Condolence meet for T N Seshan by Symbiosis, MIT-WPU
Madhav Godbole, former home secretary, Government of India, presided over the meet.
by Express News ServiceSymbiosis International and MIT-WPU jointly organised a condolence meeting in memory of former Chief Election Commissioner T N Seshan, who died on November 10.
The condolence meeting was held at Symbiosis Vishwabhavan, Senapati Bapat Road. Madhav Godbole, former home secretary, Government of India, presided over the meet.
Godbole said Seshan was an icon of honesty and integrity. “He was a tough person to deal with. He redefined the status and visibility of the Election Commission of India. He identified more than 100 electoral malpractices and reformed the election process. Our nation needs more people like T N Seshan,” he said.
Dr S B Mujumdar, founder and president of Symbiosis, and Dr Vishwanath Karad, founder and director general, MAEER’s MIT, said how emotionally attached Seshan was to both the institutions and also shared their personal experiences with him.
Mujumdar said Seshan was like a “jackfruit, who was tough from outside but sweet on the inside”. Karad said Seshan gave “the right direction to our country and there will not be another Seshan”.


North Korea says nuclear issues will not be on agenda unless U.S. 'hostile policy' discussed: KCNA
SEOUL (Reuters) - North Korea said on Sunday nuclear issues will not be discussed when talks with the United States restart unless the withdrawal of U.S. “hostile policy” was put on the agenda, state media reported.
The North’s foreign ministry said in a statement carried by the official KCNA news agency that the recent passage of a United Nations resolution on Pyongyang’s human rights was a U.S.-led “political provocation.”
North Korea has previously described the U.N. criticism as a product of U.S. “hostile policy”.


Dependency Injection (DI) is a software design pattern that deals with how code gets hold of its dependencies.
For in-depth discussion about DI, see Dependency Injection at Wikipedia, Inversion of Control by Martin Fowler, or read about DI in your favorite software design pattern book.
There are only three ways an object or a function can get a hold of its dependencies:
The dependency can be created, typically using the new
operator.
The dependency can be looked up by referring to a global variable.
The dependency can be passed in to where it is needed.
The first two options of creating or looking up dependencies are not optimal because they hard code the dependency. This makes it difficult, if not impossible, to modify the dependencies. This is especially problematic in tests, where it is often desirable to provide mock dependencies for test isolation.
The third option is the most viable, since it removes the responsibility of locating the dependency from the component. The dependency is simply handed to the component.
function SomeClass(greeter) { this.greeter = greeter; } SomeClass.prototype.doSomething = function(name) { this.greeter.greet(name); }
In the above example SomeClass
is not concerned with locating the greeter
dependency, it
is simply handed the greeter
at runtime.
This is desirable, but it puts the responsibility of getting hold of the dependency on the
code that constructs SomeClass
.
To manage the responsibility of dependency creation, each Angular application has an injector
. The injector is a service locator that is responsible for
construction and lookup of dependencies.
Here is an example of using the injector service:
// Provide the wiring information in a module angular.module('myModule', []). // Teach the injector how to build a 'greeter' // Notice that greeter itself is dependent on '$window' factory('greeter', function($window) { // This is a factory function, and is responsible for // creating the 'greet' service. return { greet: function(text) { $window.alert(text); } }; }); // New injector is created from the module. // (This is usually done automatically by angular bootstrap) var injector = angular.injector(['myModule', 'ng']); // Request any dependency from the injector var greeter = injector.get('greeter');
Asking for dependencies solves the issue of hard coding, but it also means that the injector needs to be passed throughout the application. Passing the injector breaks the Law of Demeter. To remedy this, we turn the dependency lookup responsibility to the injector by declaring the dependencies as in this example:
<!-- Given this HTML --> <div ng-controller="MyController"> <button ng-click="sayHello()">Hello</button> </div>
// And this controller definition function MyController($scope, greeter) { $scope.sayHello = function() { greeter.greet('Hello World'); }; } // The 'ng-controller' directive does this behind the scenes injector.instantiate(MyController);
Notice that by having the ng-controller
instantiate the class, it can satisfy all of the
dependencies of MyController
without the controller ever knowing about the injector. This is
the best outcome. The application code simply asks for the dependencies it needs, without having to
deal with the injector. This setup does not break the Law of Demeter.
How does the injector know what service needs to be injected?
The application developer needs to provide annotation information that the injector uses in order to resolve the dependencies. Throughout Angular, certain API functions are invoked using the injector, as per the API documentation. The injector needs to know what services to inject into the function. Below are three equivalent ways of annotating your code with service name information. These can be used interchangeably as you see fit and are equivalent.
The simplest way to get hold of the dependencies, is to assume that the function parameter names are the names of the dependencies.
function MyController($scope, greeter) { ... }
Given a function the injector can infer the names of the service to inject by examining the
function declaration and extracting the parameter names. In the above example $scope
, and
greeter
are two services which need to be injected into the function.
While straightforward, this method will not work with JavaScript minifiers/obfuscators as they rename the method parameter names. This makes this way of annotating only useful for pretotyping, and demo applications.
$inject
AnnotationTo allow the minifers to rename the function parameters and still be able to inject right services
the function needs to be annotated with the $inject
property. The $inject
property is an array
of service names to inject.
var MyController = function(renamed$scope, renamedGreeter) { ... } MyController['$inject'] = ['$scope', 'greeter'];
In this scenario the ordering of the values in the '$inject' array must match the ordering of the arguments to inject.
Using above code snippet as an example, '$scope' will be injected into 'renamed$scope' and 'greeter' into 'renamedGreeter'.
Care must be taken that the $inject
annotation is kept in sync with the actual arguments in the
function declaration.
This method of annotation is useful for controller declarations since it assigns the annotation information with the function.
Sometimes using the $inject
annotation style is not convenient such as when annotating
directives.
For example:
someModule.factory('greeter', function($window) { ... });
Results in code bloat due to needing a temporary variable:
var greeterFactory = function(renamed$window) { ... }; greeterFactory.$inject = ['$window']; someModule.factory('greeter', greeterFactory);
For this reason the third annotation style is provided as well.
someModule.factory('greeter', ['$window', function(renamed$window) { ... }]);
Keep in mind that all of the annotation styles are equivalent and can be used anywhere in Angular where injection is supported.
DI is pervasive throughout Angular. It is typically used in controllers and factory methods.
Controllers are classes which are responsible for application behavior. The recommended way of declaring controllers is using the array notation:
someModule.controller('MyController', ['$scope', 'dep1', 'dep2', function($scope, dep1, dep2) { ... $scope.aMethod = function() { ... } ... }]);
This avoids the creation of global functions for controllers and also protects against minification.
Factory methods are responsible for creating most objects in Angular. Examples are directives, services, and filters. The factory methods are registered with the module, and the recommended way of declaring factories is:
angular.module('myModule', []). config(['depProvider', function(depProvider){ ... }]). factory('serviceId', ['depService', function(depService) { ... }]). directive('directiveName', ['depService', function(depService) { ... }]). filter('filterName', ['depService', function(depService) { ... }]). run(['depService', function(depService) { ... }]);


Pittsburgh: POC Zine Project RACE RIOT Tour! | Facebook
Pittsburgh: POC Zine Project RACE RIOT Tour! Public Event · By Osa Atoe, Daniela Capistrano and Heather Manning. Wednesday, September 26, 2012 .
https://www.facebook.com/events/282813171825386/
Treatment for Herniated or Bulging Discs
Black and White Tour Coming to Pittsburgh | FreedomWorks
Sep 20, 2012 . They're kicking off the multi-city tour in Pittsburgh, Pennsylvania this Wednesday, September 26th. Matt and Deneen. Bring your friends and .
http://www.freedomworks.org/blog/kristina-ribali/black-and-white-tour-coming-to-pittsburgh
Pittsburgh, PA | Eric Church
Sep 15, 2012 . Hoping to seem him a 3rd time in Pittsburgh this September! Login or register . Submitted by majeskimelissa on Sun, 2012-08-26 20:55. I have .
https://ericchurch.com/tour/pittsburgh-pa-2012-09-15
pittsburgh tour september 26 Herniated or Bulging Discs
PTL Links: Sept. 26, 2012 « CBS Pittsburgh
Pittsburgh Steelers Black Heart and Soul T-shirt . 26, 2012. September 26, 2012 8:53 AM . Visit the links below for more on today's guests & topics: Carnegie .
http://pittsburgh.cbslocal.com/2012/09/26/ptl-links-sept-26-2012/
Announcing the 2012 Pittsburgh Solar Tour! - Pittsburgh Climate ...
Announcing the 2012 Pittsburgh Solar Tour! September 26, 2012 / Pittsburgh Climate Initiative / No comments. Category: PCI Partners / .
http://pittsburghclimate.org/announcing-the-2012-pittsburgh-solar-tour/
CREW Downtown Property Tour | Pittsburgh Downtown Partnership
Sep 26, 2012 . Join CREW Pittsburgh and the Pittsburgh Downtown Partnership on Wednesday, September 26, for a behind the scenes tour of Downtown .
http://www.downtownpittsburgh.com/do/downtown-property-tour
Official Impairment Listing for Spinal Disorders
Pittsburgh Concerts, Live Music, Tour Dates, Gigs and Tickets ...
Comprehensive listings and tickets for upcoming concerts, live music, and tour dates in Pittsburgh for December 2012 on Songkick. Get email alerts when your .
http://www.songkick.com/metro_areas/22443-us-pittsburgh
- great river engineering west plains missouri (narrowing of the spine)
Events - UPMC, Pittsburgh, PA, USA
GO. UPMC/University of Pittsburgh Schools of the Health Sciences . Wednesday , September 26, 2012UPMC Living-At-Home Program Celebrates 25th .
http://www.upmc.com/media/newsreleases/pages/events.aspxPittsburgh Improv :: Comedy Tickets
Jan 25 - Jan 26. Select Show . Pittsburgh Improv / Homestead, PA Stephen Rannazzisi plays "Kevin," the League Commissioner on FX's hit show The League.
http://pittsburgh.improv.com/
Free Things To Do In Pittsburgh - Tours - Concerts - Movies ...
25, Apr 26, Sept 28; all start at 5:30pm. The Pittsburgh Cultural District Visit Website. Come "crawl" the galleries during these free quarterly showcases of art and .
http://www.visitpittsburgh.com/essentials/free-pittsburgh/
Reel Rock Tour 7 / Calendar / United States / Pittsburgh / Carnegie ...
Pittsburgh / Pennsylvania / United States . Start Date. Wed 09/26 . Details. Sponsored jointly by the CMU Explorers Club and the Explorers Club of Pittsburgh.
http://www.reelrocktour.com/calendar/event/17/
Medical-Vocational Allowance for Herniated Disc
Rush, Consol Energy Center, Pittsburgh, PA, USA - Setlist.fm
Sep 11, 2012 . Rush Setlist at Consol Energy Center, Pittsburgh, PA, USA. Sep . zappafrank September 12, 2012 3:35:26 AM UTC . Related Concert Setlists .
http://www.setlist.fm/setlist/rush/2012/consol-energy-center-pittsburgh-pa-bddad3a.html
Civic Arena (Pittsburgh) - Wikipedia, the free encyclopedia
Pop superstar Michael Jackson performed three concerts at Pittsburgh Civic Arena on September 26, 27 and 28, 1988 during his Bad Tour. Pop singer Britney .
http://en.wikipedia.org/wiki/Civic_Arena_(Pittsburgh)
Appealing a Denial of Benefits
Critics' Picks: September 26 - October 2 - Pittsburgh City Paper
Sep 26, 2012 . Critics' Picks: September 26 - October 2 .


Components in a COHORTE system can be implemented using your Java or Python programming languages (other languages are under study). You can also wrap C modules within Python components to use legacy C code. In addition, you can dynamically update the C code without any complications.COHORTE uses two similar Service-Oriented Component-based frameworks for Java and Python environments. Service provider can be implemented using Python and used by another component implemented in Java.


DataNucleus Access Platform is an open source java persistence system, fully implementing and fully-compliant with all JDO and JPA specifications. It supports persistence to many types of datastores including RDBMS, ODBMS, XML, Excel/ODF, JSON, BigTable. This project is DataNucleus "core" providing the persistence framework used by all DataNucleus sub-projects (plugins). It includes transaction handling, logging, and management of datastores, together with the basis for JDOQL/JPQL querying.
Support for this persistence layer is provided by way of a Free Forum (no guarantee of availability) or via Commercial Support from DataNucleus.


“No one knows you like we do!”
“Keeping tabs on the terrorists and everyone else.”
“Your secrets are safe with us.”


Find the Perimeter
问题描述 :
If there is a point P inside or outside a triangle ABC, so that three triangles ABP, ACP, and BCP have equal perimeters, we say P is the perimeter center of triangle ABC, the perimeter of ABP, ACP and BCP is denoted by Q(ABC).
For example, in an equilateral triangle with each side 10 in figure 1, the P at its center satisfies the above condition and Q(ABC)=21.54701 (=10+20/sqrt(3)).
输入:
Input contains several cases. Each case has one line containing three integers a, b, c, indicating the lengths of the respective sides of a triangle. Note that 0 < a, b, c ≤ 100. The input is terminated by three zeros.
输出:
Input contains several cases. Each case has one line containing three integers a, b, c, indicating the lengths of the respective sides of a triangle. Note that 0 < a, b, c ≤ 100. The input is terminated by three zeros.
样例输入:
10 10 10 30 40 50 18 17 15 1 2 3 0 0 0
样例输出:
21.54701 120.00000 36.54972 -1
(adsbygoogle = window.adsbygoogle || []).push({});
printf这个函数在计算的时候是从右到左，打印是从左到右。
这个.. 真没看出来
<EMAIL_ADDRESS>沙发呢，我抢到了沙发
正确性是关键，冲突是都会有的，主要是那种算法冲突的概率低
顺利测试通过了，多谢
修改一下吧 …
很好。代码比书上的简练！
都是一些基础题啊
很给力啊，学习了
第二个方法很不错啊
很好的题，还是能做出几道的，嘿嘿


--- title: Windows 7 in Europe excerpt: '"No IE onboard Windows 7 in Europe" (http://tinyurl.com/nso6kt). Why the EU attacks M$ while using their products themselves? Apple next?' date: '2009-06-12 19:03:23 +0200' date_gmt: '2009-06-12 17:03:23 +0200' categories: - Webdev ---
"No IE onboard Windows 7 in Europe" (http://tinyurl.com/nso6kt). Why the EU attacks M$ while using their products themselves? Apple next?


File: src/equations/FrictionEquation.js
var vec2 = require('../math/vec2') , Equation = require('./Equation') , Utils = require('../utils/Utils'); module.exports = FrictionEquation; /** * Constrains the slipping in a contact along a tangent * * @class FrictionEquation * @constructor * @param {Body} bodyA * @param {Body} bodyB * @param {Number} slipForce * @extends Equation */ function FrictionEquation(bodyA, bodyB, slipForce){ Equation.call(this, bodyA, bodyB, -slipForce, slipForce); /** * Relative vector from center of body A to the contact point, world oriented. * @property contactPointA * @type {Array} */ this.contactPointA = vec2.create(); /** * Relative vector from center of body B to the contact point, world oriented. * @property contactPointB * @type {Array} */ this.contactPointB = vec2.create(); /** * Tangent vector that the friction force will act along. World oriented. * @property t * @type {Array} */ this.t = vec2.create(); /** * A ContactEquation connected to this friction. The contact equations can be used to rescale the max force for the friction. If more than one contact equation is given, then the max force can be set to the average. * @property contactEquations * @type {ContactEquation} */ this.contactEquations = []; /** * The shape in body i that triggered this friction. * @property shapeA * @type {Shape} * @todo Needed? The shape can be looked up via contactEquation.shapeA... */ this.shapeA = null; /** * The shape in body j that triggered this friction. * @property shapeB * @type {Shape} * @todo Needed? The shape can be looked up via contactEquation.shapeB... */ this.shapeB = null; /** * The friction coefficient to use. * @property frictionCoefficient * @type {Number} */ this.frictionCoefficient = 0.3; } FrictionEquation.prototype = new Equation(); FrictionEquation.prototype.constructor = FrictionEquation; /** * Set the slipping condition for the constraint. The friction force cannot be * larger than this value. * @method setSlipForce * @param {Number} slipForce */ FrictionEquation.prototype.setSlipForce = function(slipForce){ this.maxForce = slipForce; this.minForce = -slipForce; }; /** * Get the max force for the constraint. * @method getSlipForce * @return {Number} */ FrictionEquation.prototype.getSlipForce = function(){ return this.maxForce; }; FrictionEquation.prototype.computeB = function(a,b,h){ var bi = this.bodyA, bj = this.bodyB, ri = this.contactPointA, rj = this.contactPointB, t = this.t, G = this.G; // G = [-t -rixt t rjxt] // And remember, this is a pure velocity constraint, g is always zero! G[0] = -t[0]; G[1] = -t[1]; G[2] = -vec2.crossLength(ri,t); G[3] = t[0]; G[4] = t[1]; G[5] = vec2.crossLength(rj,t); var GW = this.computeGW(), GiMf = this.computeGiMf(); var B = /* - g * a */ - GW * b - h*GiMf; return B; };


About Brandon
Side Bar
Test 1
Questions...
-
Is Brandon a gamer boi?
- The entity has yet to answer...
-
Do the songbirds envy Brandon?
- The entity has yet to answer...
-
Does Brandon even lift...brah?
- The entity has yet to answer...
-
Does Brandon ingest of the hated substance of the pit...LICORICE!?
- The entity has yet to answer...
-
Is Brandon preoccupied by the desires of the masses?
- The entity has yet to answer...


WITNESS LIST Intergovernmental Relations Committee March 12, 2003 - 9:00A SB 454 Registering, but not testifying: For: Bray, Jimmy Senior Assistant City Attorney (City of Corpus Christi), Corpus Christi, TX SB 527 Registering, but not testifying: For: Andersen, Cris Police Lieutenant (San Antonio Police Officers Association), San Antonio, TX Elder, Bonnie General Counsel (VIA Metropolitan Transit), San Antonio, TX SB 592 FOR: Summerlin, Greg Lt. Harris County Sheriff's Department (Harris County/ HCSO ), Houston, TX Registering, but not testifying: For: Dougherty, Patrick Lieutenant (Houston Police Dept./City of Houston), Houston, TX Fenz, Caton Legislative Coordinator (Harris County Commissioners Court), Houston, TX SB 642 Registering, but not testifying: For: Andersen, Cris Police Lieutenant (San Antonio Police Officers Association), San Antonio, TX Burney, Frank Attorney (Fire and Police Pensoin Fund, San Antonio), San Antonio, TX Campbell, Jim Director, External Relations (City of San Antonio), San Antonio, TX Higgins, Mike Chief of Staff TSAFF (Texas State Association of Fire Fighters), Austin, TX Schott, Warren Investment Officer (San Antonio Fire and Police Pension Fund), San Antonio, TX Stewart, Teddy Police Detective (Fire and Police Pension Fund, San Antonio), San Antonio, TX


Home
Parks
#if($user)
Profile
#end
#if($user)
Signed in as $user.getUsername()
#if($user.getAdmin())
Admin
#end
Logout
#else
Login
#if($wrongPass)
Incorrect Password
#end
Username
Password
Login
#end
#parse( $template )
Copyright (c) 2017
This software is licensed under the MIT license.
Chris Finney
Grace Stuart
Jahan Walsh
Janek Brandt


What's your thinking style?
Category: Cultural | Author: Mohamed Shibl
In preparation for joining an 18 month program to learn programming, I was asked to take a personality test that would evaluate my "style of thinking". This test is called the (Mind Styles Model) invented by Anthony F. Gregorc, Ph. D., who is a phenomenological (I have no idea what that word means!), he also happens to be a researcher, lecturer, consultant, author and President of Gregorc Associates, Inc.
Basically, the mind styles model splits a person's style of thinking into 2 parts:
- The first part is your Perceptual Quality which is the way you interpret information, do you accept the obvious meaning "Concrete thinking", or do you often think that it might a have a hidden meaning "Abstract thinking".
- The second part is your Ordering Ability which is basically the way your mind organizes information, and how you complete any given task. Do you like following a plan "Sequential thinking" or do you prefer to follow your impulses "Random thinking"
After taking the test myself, I was given the analysis that I have an "Abstract Sequential" way of thinking. The main highlights are that I like to take the time to analyze information before acting on it, I prefer to have the ability to work alone, and I don't like being limited by too many rules and regulations.
Assuming that all of this analysis is true, I started looking back at my first 3 weeks studying at Dev Bootcamp. How am I dealing with this learning experience? Is there anything that I could improve? Is there anything I'm already improving? The truth is that my biggest struggle is the pairing sessions (my tendency to work alone), where I have to work with someone on solving a given set of challenges. The reason I find pairing up difficult is that most of the time I feel it would be easier to just go through the problem alone. However, I started realizing that there's one advantage in particular in pairing up at Dev Bootcamp, which is getting feedback. In a real life work environment, you will be required to work with other people, but most likely, you will not receive much feedback. I'm starting to see that getting actionable feedback can greatly help me build up my skills and fix my flaws before I head out of Dev Bootcamp looking for a job!
Having said all of this, I have to say that I'm not a big fan of personality quizzes. I believe that self perception and reality can be 2 entirely different things, this is why most of the personality quizzes gives you an analysis of (how you think you are) instead of (who you really are). Why don't you give it a try? Here is the link to the quiz!
--------------------------------


Our history
We have been preparing delicious dishes since 1879
Culinary traditions
Our tradition is unique.
Quality Food
The quality of the food is proper.
We have been preparing delicious dishes since 1879
Our tradition is unique.
The quality of the food is proper.
Cup of coffee sold
Football Match Viewed
Food Delivered
Satisfied Customers
There is no love more sincere than the love of food.
Reserve your table & amp; enjoy Lorem ipsum.
Mon to Fri: 7:30 AM - 11:30 AM
Sam & time: 8:00 AM - 9:00 AM
Mon to Fri: 12:00 PM - 5:00 PM
Sun: 6:00 PM - 1:00 AM
time: 5:30 PM -12:00 AM
Follow the way to your south after reaching gateway of india.
Email<EMAIL_ADDRESS>Telephone: +91<PHONE_NUMBER>
There is no love more sincere than the love of food.
Often no pain, then none of which are free.
Never pleasures, she is born. Pain, choice, indeed!
To come up with when they often are.


Message
Invalid HTML: explanation
Explanation
Common causes for this condition:
- Placing plain text in an element intended to be rendered as HTML.
Example: representing a less than sign ("<") as escaped HTML
requires the following code:
<
- Use of non-HTML tags.
- Arbitrary truncation of HTML, possibly in the middle of a tag.
- Unmatched quotes in attribute values, or missing whitespace between attributes
- For Atom feeds: declaring the
type
asxhtml
, but not changing the default namespace from atom's to xhtml's.
Solution
For elements intended to be rendered as HTML, like RSS
description
, make sure that all plain text content is escaped
first as HTML and then again as XML.
For Atom text constructs, you can use the type
attribute
to declare your intented usage: plain text
,
escaped html
or in-line xhtml
.
Not clear? Disagree?
You might be able to find help in one of these fine resources.


@* * Copyright 2023 HM Revenue & Customs * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. *@ @import security.RoleUtils._ @(cachedUser: CachedData)(implicit request: Request[_], flash: Flash, user: Option[CachedData], feedbackUrl: String) @if(hasFastPassRejectedAndInvitedToPhase1Tests(cachedUser)){
Unfortunately we've not been able to confirm that your Fast Pass is valid.
You now need to do your online exercises.


DANS needs to know whether your dataset contains personal data in the sense of the General Data Protection Regulation (GDPR).
In the GDPR, personal data are defined as follows:
"'Personal data' means any information relating to an identified or identifiable natural person ('data subject'); an identifiable natural person is one who can be identified, directly or indirectly, in particular by reference to an identifier such as a name, an identification number, location data, an online identifier or to one or more factors specific to the physical, physiological, genetic, mental, economic, cultural or social identity of that natural person." This includes pseudonymised data.
Please choose "yes" if your dataset contains personal data other than the personal data to account for the dataset, such as the creator, the rights holder or citations. For instance, this applies when your dataset contains personal data from research subjects.
Please choose "no" if your dataset only contains personal data to account for the dataset, such as the creator, the rights holder or citations. This would typically be information that you provide as metadata below.
When you choose "yes", please note:


Email
We'll never share your email with anyone else
Password
Sign Up
I do have an account !
Log In Now !


Data Structure & Algorithm
- Introduction - Data Structures
- Complexity of Algorithms
- Time Space Tradeoff
- Linear and Binary Searching
- Sorting and Recursion
- Discussion of Common Sorting Techniques
- Insertion Sort, Selection Sort
- Bubble Sort, Quick Sort
- Merge Sort, Radix Sort
- Factorial and Tower of Hanoi Problem
- Linked Lists - Abstract Data Types
- List ADTs and Linked Lists
- Singly, Two Way and Circular Linked Lists
- Stacks and Queues
- Stacks and Queues Implementation Strategies
- Prefix, Infix and Postfix Expressions
- Prefix, Infix and Postfix Transformation and Evaluation Algorithms
- Hashing - Hash Indices and Hash Functions
- Static and Dynamic Hashing
- Collisions in Hash Indices
- Collision Resolving Techniques
- Trees - Tree Concepts, Binary Tree
- Binary Search Tree
- Heaps, Heap Sort
- Huffman Encoding Technique
- AVL Tree, B Tree and B+ Tree
- Graphs - Graph Terminologies, Representing Graphs
- Graph Searching: BFS and DFS
- Shortest Path Problems
- Minimum Spanning Tree
- Minimum Spanning Tree Algorithms
- Greedy Algorithms
- Divide and Conquer Strategy
- Dynamic Programming and Backtracking


Experience the taste of
pizza like
never before.
Trendy pizza toppings come and go, but few topping combinations are so everlasting that they become iconic pizzas in their own right. These are the pizzas you see at every pizza joint and on every delivery menu, and the pizzas we believe every home cook should be able to replicate at home. These are the five most iconic pizzas of all time!
Margherita is the mother of all pizzas. This Neopaltian-style pizza has thin crust, fresh tomato sauce, fresh mozzarella cheese, and just a few leaves of basil. Margherita’s toppings are simple but they also have the power to be truly sublime in a way few other toppings can be.
We’d wager that pepperoni is still America’s number-one, most-popular pizza topping. This singular topping even graces the pizza emoji! It makes sense if you really consider everything that is good about pepperoni: The salty and slightly spicy taste holds its own against waves of melty, gooey cheese and gets ever-so-slightly crisped in the hot oven in such a crave-worthy way that no one can resist pulling them straight from the smoldering hot pizza and dropping them directly into their mouths.


Mentor Assignments
| Mentor | Student Group | Mentor Pay Rate |
|---|---|---|
| Brian Skinner | Bruce Goldberg | 45 |
| Brian Skinner | Buffy Poon | 45 |
| Morgan Connelly | Shelli Ching | 45 |
| Trina Sarkar | Trae Vassallo | 45 |
| Mentor | Student Group | Mentor Pay Rate |
|---|---|---|
| Brian Skinner | Bruce Goldberg | 45 |
| Brian Skinner | Buffy Poon | 45 |
| Morgan Connelly | Shelli Ching | 45 |
| Trina Sarkar | Trae Vassallo | 45 |


Cursorophone
Copyright (c) Picorims 2021 - MIT license
Min Octave (A4 to G#5 = 0):
Max Octave (A4 to G#5 = 0):
Active notes:
A
A#
B
C
C#
D
D#
E
F
F#
G
G#
Portamento:
Oscillator type:
sine
square
sawtooth
triangle
Attack:
Decay:
Sustain:
Release:
Feedback delay
Speed:
Feedback:
Dry/Wet:
Reverb
Pre-delay:
Decay:
Dry/Wet:


A civics hacking project by two students.
RHoK The Hood began as a project at the 2013 Rochester Random Hacks of Kindness Hackathon. It was an attempt to provide the residents of Rochester City with an easy way to visualize information that we found was frequently requested through the Freedom of Information Law in a concise manner at a block level using the power of Geographic Information Systems.
Now, we want to do it on a bigger scale - we want to get as much data on as many places and make it accessible to as many people as possible. And we're going to need your help to do it. Get involved.
×


This is a Golomb encoder. Select a file and a divisor in the left and press encode or decode button.
When encoding you will be able to check the encoding step by step or just run to the end.
When decoding there is no step by step option.
After finishing the encoding/decoding the source and the result will be put in the screen.
As input for encoding a plain text file is expected.
As input for decoding a plain text file with '0's and '1's is expected.


Depth map estimation using multi-view stereo
This post talks about the algorithmic details and implementation of depth map estimation using multi-view stereo technique. The method is proposed in Secion 5, 6 of the paper Multi-View Stereo for Community Photo Collections (pdf). The MVE has a C++ implementation of the algorithms (source code).
View Selection
Global View Selection
- The number of shared feature points reconstructed in the SfM phase/success in SIFT matching is a good indicator that pixel-level matching will also succeed
- The number of shared feature points is not sufficient to ensure good reconstructions
- The views with the most shared feature points tend to be nearly collocated, thus do not provide a large enough baseline.
- SIFT is scale invariant, which causes images of different resolution to match well.
We compute a global score \(g_R\) for each view \(V\) within a candidate neighbourhood \(\textbf{N}\) (which include \(R\), and grow incrementally by adding to \(\textbf{N}\) the highest scoring view given the current \(\textbf{N}\)) as a weighted sum over features shared with \(R\):
The weight function \(\omega_\textbf{N}(f)\) is defined as a product over all pairs of views in \(\textbf{N}\):
where \(\omega_\alpha (f, V_i, V_j) = \min ((\frac{\alpha}{\alpha_{max}})^2, 1)\) and \(\alpha\) is the angle between the lines of sight from \(V_i\) and \(V_j\) to \(f\). The quadratic weight function serves to counteract the trend of greater numbers of features in common with decreasing angle. Meanwhile, excessively large triangulation angles are automatically discouraged by the associated scarcity of shared SIFT features.
The weighting function \(\omega_s(f)\) measures similarity in resolution of images \(R\) and \(V\) at feature \(f\). To estimate the 3D sampling rate of \(V\) in the vicinity of the feature \(f\), we compute the diameter \(s_V(f)\) of a sphere centered at \(f\) whose projected diameter in \(V\) equals the pixel spacing in \(V\). \(s_R(f)\) is computed similarly for \(R\) and define the scale weight \(\omega_s\) based on the ratio \(r=\frac{s_R(f)}{s_V(f)}\) using
The weight function favors views with equal or higher resolution than the reference view.
Local View Selection
Instead of using all of the views determined by global view selection, only a subset \(\textbf{A} \in \textbf{N}\) is used to speed up the depth computation, which speeds up the depth computation.
\(\textbf{A}\) is iteratively updated using a set of local view selection criteria that favours views that are photometrically consistent and provide a sufficiently wide range of observation directions (?).
Multi-View Stereo Reconstruction
Region-growing
The idea behind the region growing approach is that a successfully matched depth sample provides a good initial estimate for depth, normal, and matching confidence for neighboring pixel locations in \(\mathit{R}\). The optimisation process is non-linear with numerous local minima, which makes initialisation critical. This heuristic may fail for non-smooth surfaces or at silhouettes.
Stereo Matching as Optimisation
We interpret an \(n \times n\) pixel window centered on a pixel in the reference view \(R\) as the projection of a small planar patch in the scene. The goal is to optimize over the depth and orientation of this patch to maximize photometric consistency with its projections into the neighbouring views.
Scene Geometry Model
We assume that scene geometry visible in the \(n \times n\) pixel window centered at a pixel location \((s, t)\) in the reference view is well modeled by a planar, oriented window at depth \(h(s, t)\). The 3D position \(\textbf{x}_R(s, t)\) of the point projecting to the central pixel is
where \(\textbf{o}_R\) is the center of projection of view \(R\) and \(\vec{r}_R(s, t)\) is the normalized ray direction through the pixel. We encode the window orientation using per-pixel distance offsets \(h_s(s, t)\) and \(h_t(s, t)\), corresponding to the per-pixel rate of change of depth in the \(s\) and \(t\) directions. The 3D position of a point projecting to a pixel inside the matching window is then
with \(i, j = -\frac{n-1}{2}, …, \frac{n-1}{2}\). We can now determine the corresponding locations in a neighbouring view \(k\) with sub-pixel accuracy using that view’s projection \(\textbf{P}_k(x_R(s + i, t + j))\)
Photometric Model
A simple model for reflectance effects: a colour scale factor \(c_k\) for each patch projected into the \(k\)-th neighbouring view. The model fails when the illumination changes within the patch or when the patch contains a specular highlight or when the local contrast changes between views.
We can relate the pixel intensities within a patch in \(R\) to the intensities in the \(k\)-th neighbouring view
with \(i, j = -\frac{n-1}{2}, …, \frac{n-1}{2}, k = 1, …, m\), where \(m=(|\textbf{A}|)\). Omitting the pixel coordinates \((s, t)\), we get
In the case of a 3-channel colour image, the equation above represents 3 equations, one per colour channel. Consider all pixels in the window (\(n^2\)) and all neighbouring views (\(m\)), we have \(3n^2m\) equations to solve for \(3 + 3m\): \(h, h_s, h_t\) and the per-view color scale \(c_k\). To solve this overdetermined non-linear system, we follow the standard MPGC approach and linearize the above equation
Given an initial value for \(h, h_s, \text{ and } h_t\), we can solve for \(dh, dh_s, dh_t\), and the \(c_k\) using linear least squares. Then we update \(h, h_s, h_t\) by adding to them \(h, h_s, \text{ and } h_t\), respectively and iterate.


Roads Kill
Pulitzer Center
Close
« Previous
Next »
Tweets about "#roadskill"
Road deaths per 100,000 people (2013)
> 0
> 10
> 20
> 30
No data
Story
Source:
World Health Organization, 2015
View fullscreen
i


@* * Copyright 2023 HM Revenue & Customs * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. *@ @import uk.gov.hmrc.testuser.models.views.FeedbackBanner @import uk.gov.hmrc.testuser.config.ApplicationConfig @this() @(feedbackBanner: FeedbackBanner)(implicit config: ApplicationConfig)


| Name | URI | Hardware Signal | Description | UI Dependency | Connections |
| Timer Interrupt | rtc/timer_int | TIMER_INT | Timer Interrupt | Yes | None |
| Alarm Interrupt | rtc/alarm_int | ALARM_INT | Alarm interrupt | Yes | None |
| GCU RTC Timer Event | gcu_intrtctick/rtc_timer_int | RTC_TIMER_INT | GCU Timer Event | Yes | None |
| GCU RTC Alarm Event | gcu_intrtcalarm/rtc_alarm_int | RTC_ALARM_INT | GCU Alarm Event | Yes | None |
| Name | URI | Description | Conditional Consumption |
| rtc | peripheral/rtc/0/* | This is the consumption of rtc module | Always Consumed |
| scu | app/nvic_scu001/0 | This is the consumption of scu module | Conditionally Consumed |
| dbgapp1 | app/dbg001/* | This is the consumption of debug module | Always Consumed |
| excep001 | app/excp001/0 | This is the consumption of exception app | Conditionally Consumed |
| Name | URI | Description | Access mode |
| RTC Enable | app/rtc001/0/RTC001_erwEnableRTC | Enables the RTC module. Required for RTC to work. If this is enabled, hibernate domain is enabled in the CLK001 App. | R/W |
| Enable Time initialization once | app/rtc001/0/RTC001_erwTimeInitialisation | If this flag is checked during initialization of RTC then the time and date will be written only once; any update of time and date will be ineffective even after power off or reset as long as RTC runs from the battery. The RTC has to be disabled in order to reprogram the initial time | R/W |
| User configured calendar date value | app/rtc001/0/RTC001_srwDateValue | Text box to enter date value for initial RTC time. The value should be entered as mm/dd/yyyy. | R/W |
| User configured clock time value | app/rtc001/0/RTC001_srwTimeValue | Text box to enter time value for initial RTC time. The value should be entered as hh:mm:ss | R/W |
| Event Trigger for Timer | app/rtc001/0/RTC001_Eventtrigger_timer | Selects if the RTC Periodic timer event generates an SCU interrupt or an NMI. If it is SCU interrupt then the signal shall be connected NVIC_SCU001 and user needs to define the interrupt handler. In the latter case, it shall be connected to EXCP001 app NMI handling shall be enabled in EXCP001 App. | R/W |
| Timer Status Flag | app/rtc001/0/RTC001_eroString | Used for giving message on how the Periodic Timer event is handled based on the "Event Trigger for Timer" parameter. | R/W |
| Enable periodic seconds interrupt | app/rtc001/0/RTC001_erwPeriodicSecInter | Enables periodic seconds interrupt | R/W |
| Enable periodic minutes interrupt | app/rtc001/0/RTC001_erwPeriodicMinInter | Enables periodic minutes interrupt | R/W |
| Enable periodic hours interrupt | app/rtc001/0/RTC001_erwPeriodicHrsInter | Enables periodic hours interrupt | R/W |
| Enable periodic days interrupt | app/rtc001/0/RTC001_erwPeriodicDaysInter | Enables periodic days interrupt | R/W |
| Enable periodic months interrupt | app/rtc001/0/RTC001_erwPeriodicMonths | Enables periodic months interrupt | R/W |
| Enable periodic years interrupt | app/rtc001/0/RTC001_erwPeriodicYears | Enables periodic years interrupt | R/W |
| User defined interrupt handler for Periodic interrupts | app/rtc001/0/RTC001_srwTimerUserFunction | If the periodic timer event is used for SCU interrupt, then the user defined interrupt handler name shall be entered here. | R/W |
| Enable alarm interrupt | app/rtc001/0/RTC001_erwAlarmIntrptEna | Enables alarm interrupt. RTC module generate and alarm event when the current date and time matches the time in the alarm date and time registers. | R/W |
| User configured alarm date value | app/rtc001/0/RTC001_srwAlarmDate | Text box to enter date value for alarm configuration The value should be entered as mm/dd/yyyy. | R/W |
| User configured alarm time value | app/rtc001/0/RTC001_srwAlarmTime | Text box to enter time value for alarm configuration. The value should be entered as hh:mm:ss | R/W |
| Event Trigger for Alarm | app/rtc001/0/RTC001_Eventtrigger_Alarm | Selects if the RTC alarm event generates an SCU interrupt or an NMI. If it is SCU interrupt then the signal shall be connected NVIC_SCU001 and user needs to define the interrupt handler. In the latter case, it shall be connected to EXCP001 app NMI handling shall be enabled in EXCP001 App. | R/W |
| Alarm Status Flag | app/rtc001/0/RTC001_eroString1 | Used for giving message on how the Periodic Timer event is handled based on the "Event Trigger for Alarm" parameter. | R/W |
| User defined interrupt handler for Alarm interrupts | app/rtc001/0/RTC001_srwAlarmUserFunction | If the alarm event is used for SCU interrupt, then the user defined interrupt handler name shall be entered here. | R/W |
| Enable alarm event in hibernate mode | RTC001_erwTimerAlarm | Enables wake up from Hibernate mode on an RTC alarm event | R/W |
| Enable periodic seconds event in hibernate mode | RTC001_erwEnaSecComp | Enables wake up from Hibernate mode on an RTC periodic seconds event | R/W |
| Enable periodic minutes event in hibernate mode | RTC001_erwEnaMinComp | Enables wake up from Hibernate mode on an RTC periodic minutes event | R/W |
| Enable periodic hours event in hibernate mode | RTC001_erwEnaHrsComp | Enables wake up from Hibernate mode on an RTC periodic hours event | R/W |
| Enable periodic days event in hibernate mode | RTC001_erwEnaDaysComp | Enables wake up from Hibernate mode on an RTC periodic days | R/W |
| Enable periodic months event in hibernate mode | RTC001_erwEnaMonthsComp | Enables wake up from Hibernate mode on an RTC periodic months event | R/W |
| Enable periodic years event in hibernate mode | RTC001_erwEnaYearsComp | Enables wake up from Hibernate mode on an RTC periodic years event | R/W |


val level: Int?
Log level, must be one of Log.VERBOSE,Log.DEBUG, Log.INFO, Log.WARN and Log.ERROR.
level - Log level, must be one of Log.VERBOSE,Log.DEBUG, Log.INFO, Log.WARN and Log.ERROR.
level


--- title: Textmate color: cyan layout: theme.html icon: skull icon_width: 198 icon_height: 182 ---
Open Preferences and click on the Bundles tab, scroll to Dracula and click the checkbox to the left. To switch themes go to View → Theme → Dracula. The bundle will be automatically updated for you.
If you are a git user, you can install the theme and keep up to date by cloning the repo:
$ git clone https://github.com/dracula/textmate.git Dracula.tmbundle
The default branch is for TextMate 2. If you need to use the TextMate 1 version, you need to checkout the v1 branch.
$ git checkout v1
v2: Download using the GitHub .zip download option and unzip them.
v1: Download using the GitHub .zip download option and unzip them.
Double-click the resulting bundle after unarchiving to install.
From the TextMate menus: View → Theme → Dracula.


Identify the features of the movie scene below
If you are unsure about a feature, select
{{ cant_tell }}
.
{% for f in features %}
{{ f.feature.name }} :
{% for fv in f.vals %}
{{ fv.name }}
{% endfor %}
{% endfor %}


git-diff-files - Compares files in the working tree and the index
git diff-files [-q] [-0|-1|-2|-3|-c|--cc] [<common diff options>] [<path>...]
Compares the files in the working tree and the index. When paths are specified, compares only those named paths. Otherwise all entries in the index are compared. The output format is the same as for git diff-index and git diff-tree.
-p, -u, --patch
Generate patch (see section on generating patches).
-s, --no-patch
Suppress diff output. Useful for commands like git show that show the patch by default, or to cancel the effect of --patch.
-U<n>, --unified=<n>
Generate diffs with <n> lines of context instead of the usual three. Implies -p.
--raw
Generate the raw format. This is the default.
--patch-with-raw
Synonym for -p --raw.
--minimal
Spend extra time to make sure the smallest possible diff is produced.
--patience
Generate a diff using the "patience diff" algorithm.
--histogram
Generate a diff using the "histogram diff" algorithm.
--diff-algorithm={patience|minimal|histogram|myers}
Choose a diff algorithm. The variants are as follows:
default, myers
The basic greedy diff algorithm. Currently, this is the default.
minimal
Spend extra time to make sure the smallest possible diff is produced.
patience
Use "patience diff" algorithm when generating patches.
histogram
This algorithm extends the patience algorithm to "support low-occurrence common elements".
For instance, if you configured diff.algorithm variable to a non-default value and want to use the default one, then you have to use --diff-algorithm=default option.
--stat[=<width>[,<name-width>[,<count>]]]
Generate a diffstat. By default, as much space as necessary will be used for the filename part, and the rest for the graph part. Maximum width defaults to terminal width, or 80 columns if not connected to a terminal, and can be overridden by <width>. The width of the filename part can be limited by giving another width <name-width> after a comma. The width of the graph part can be limited by using --stat-graph-width=<width> (affects all commands generating a stat graph) or by setting diff.statGraphWidth=<width> (does not affect git format-patch). By giving a third parameter <count>, you can limit the output to the first <count> lines, followed by ... if there are more.
These parameters can also be set individually with --stat-width=<width>, --stat-name-width=<name-width> and --stat-count=<count>.
--numstat
Similar to --stat, but shows number of added and deleted lines in decimal notation and pathname without abbreviation, to make it more machine friendly. For binary files, outputs two - instead of saying 0 0.
--shortstat
Output only the last line of the --stat format containing total number of modified files, as well as number of added and deleted lines.
--dirstat[=<param1,param2,...>]
Output the distribution of relative amount of changes for each sub-directory. The behavior of --dirstat can be customized by passing it a comma separated list of parameters. The defaults are controlled by the diff.dirstat configuration variable (see git-config(1)). The following parameters are available:
changes
Compute the dirstat numbers by counting the lines that have been removed from the source, or added to the destination. This ignores the amount of pure code movements within a file. In other words, rearranging lines in a file is not counted as much as other changes. This is the default behavior when no parameter is given.
lines
Compute the dirstat numbers by doing the regular line-based diff analysis, and summing the removed/added line counts. (For binary files, count 64-byte chunks instead, since binary files have no natural concept of lines). This is a more expensive --dirstat behavior than the changes behavior, but it does count rearranged lines within a file as much as other changes. The resulting output is consistent with what you get from the other --*stat options.
files
Compute the dirstat numbers by counting the number of files changed. Each changed file counts equally in the dirstat analysis. This is the computationally cheapest --dirstat behavior, since it does not have to look at the file contents at all.
cumulative
Count changes in a child directory for the parent directory as well. Note that when using cumulative, the sum of the percentages reported may exceed 100%. The default (non-cumulative) behavior can be specified with the noncumulative parameter.
<limit>
An integer parameter specifies a cut-off percent (3% by default). Directories contributing less than this percentage of the changes are not shown in the output.
Example: The following will count changed files, while ignoring directories with less than 10% of the total amount of changed files, and accumulating child directory counts in the parent directories: --dirstat=files,10,cumulative.
--summary
Output a condensed summary of extended header information such as creations, renames and mode changes.
--patch-with-stat
Synonym for -p --stat.
-z
When --raw, --numstat, --name-only or --name-status has been given, do not munge pathnames and use NULs as output field terminators.
Without this option, each pathname output will have TAB, LF, double quotes, and backslash characters replaced with et, en, e", and ee, respectively, and the pathname will be enclosed in double quotes if any of those replacements occurred.
--name-only
Show only names of changed files.
--name-status
Show only names and status of changed files. See the description of the --diff-filter option on what the status letters mean.
--submodule[=<format>]
Specify how differences in submodules are shown. When --submodule or --submodule=log is given, the log format is used. This format lists the commits in the range like git-submodule(1)summary does. Omitting the --submodule option or specifying --submodule=short, uses the short format. This format just shows the names of the commits at the beginning and end of the range. Can be tweaked via the diff.submodule configuration variable.
--color[=<when>]
Show colored diff. --color (i.e. without =<when>) is the same as --color=always. <when> can be one of always, never, or auto.
--no-color
Turn off colored diff. It is the same as --color=never.
--word-diff[=<mode>]
Show a word diff, using the <mode> to delimit changed words. By default, words are delimited by whitespace; see --word-diff-regex below. The <mode> defaults to plain, and must be one of:
color
Highlight changed words using only colors. Implies --color.
plain
Show words as [-removed-] and {+added+}. Makes no attempts to escape the delimiters if they appear in the input, so the output may be ambiguous.
porcelain
Use a special line-based format intended for script consumption. Added/removed/unchanged runs are printed in the usual unified diff format, starting with a +/-/` ` character at the beginning of the line and extending to the end of the line. Newlines in the input are represented by a tilde ~ on a line of its own.
none
Disable word diff again.
Note that despite the name of the first mode, color is used to highlight the changed parts in all modes if enabled.
--word-diff-regex=<regex>
Use <regex> to decide what a word is, instead of considering runs of non-whitespace to be a word. Also implies --word-diff unless it was already enabled.
Every non-overlapping match of the <regex> is considered a word. Anything between these matches is considered whitespace and ignored(!) for the purposes of finding differences. You may want to append |[^[:space:]] to your regular expression to make sure that it matches all non-whitespace characters. A match that contains a newline is silently truncated(!) at the newline.
The regex can also be set via a diff driver or configuration option, see gitattributes(1) or git-config(1). Giving it explicitly overrides any diff driver or configuration setting. Diff drivers override configuration settings.
--color-words[=<regex>]
Equivalent to --word-diff=color plus (if a regex was specified) --word-diff-regex=<regex>.
--no-renames
Turn off rename detection, even when the configuration file gives the default to do so.
--check
Warn if changes introduce whitespace errors. What are considered whitespace errors is controlled by core.whitespace configuration. By default, trailing whitespaces (including lines that solely consist of whitespaces) and a space character that is immediately followed by a tab character inside the initial indent of the line are considered whitespace errors. Exits with non-zero status if problems are found. Not compatible with --exit-code.
--full-index
Instead of the first handful of characters, show the full pre- and post-image blob object names on the "index" line when generating patch format output.
--binary
In addition to --full-index, output a binary diff that can be applied with git-apply.
--abbrev[=<n>]
Instead of showing the full 40-byte hexadecimal object name in diff-raw format output and diff-tree header lines, show only a partial prefix. This is independent of the --full-index option above, which controls the diff-patch output format. Non default number of digits can be specified with --abbrev=<n>.
-B[<n>][/<m>], --break-rewrites[=[<n>][/<m>]]
Break complete rewrite changes into pairs of delete and create. This serves two purposes:
It affects the way a change that amounts to a total rewrite of a file not as a series of deletion and insertion mixed together with a very few lines that happen to match textually as the context, but as a single deletion of everything old followed by a single insertion of everything new, and the number m controls this aspect of the -B option (defaults to 60%). -B/70% specifies that less than 30% of the original should remain in the result for Git to consider it a total rewrite (i.e. otherwise the resulting patch will be a series of deletion and insertion mixed together with context lines).
When used with -M, a totally-rewritten file is also considered as the source of a rename (usually -M only considers a file that disappeared as the source of a rename), and the number n controls this aspect of the -B option (defaults to 50%). -B20% specifies that a change with addition and deletion compared to 20% or more of the file(cqs size are eligible for being picked up as a possible source of a rename to another file.
-M[<n>], --find-renames[=<n>]
Detect renames. If n is specified, it is a threshold on the similarity index (i.e. amount of addition/deletions compared to the file(cqs size). For example, -M90% means Git should consider a delete/add pair to be a rename if more than 90% of the file hasn(cqt changed. Without a % sign, the number is to be read as a fraction, with a decimal point before it. I.e., -M5 becomes 0.5, and is thus the same as -M50%. Similarly, -M05 is the same as -M5%. To limit detection to exact renames, use -M100%. The default similarity index is 50%.
-C[<n>], --find-copies[=<n>]
Detect copies as well as renames. See also --find-copies-harder. If n is specified, it has the same meaning as for -M<n>.
--find-copies-harder
For performance reasons, by default, -C option finds copies only if the original file of the copy was modified in the same changeset. This flag makes the command inspect unmodified files as candidates for the source of copy. This is a very expensive operation for large projects, so use it with caution. Giving more than one -C option has the same effect.
-D, --irreversible-delete
Omit the preimage for deletes, i.e. print only the header but not the diff between the preimage and /dev/null. The resulting patch is not meant to be applied with patch or git apply; this is solely for people who want to just concentrate on reviewing the text after the change. In addition, the output obviously lack enough information to apply such a patch in reverse, even manually, hence the name of the option.
When used together with -B, omit also the preimage in the deletion part of a delete/create pair.
-l<num>
The -M and -C options require O(n^2) processing time where n is the number of potential rename/copy targets. This option prevents rename/copy detection from running if the number of rename/copy targets exceeds the specified number.
--diff-filter=[(A|C|D|M|R|T|U|X|B)...[*]]
Select only files that are Added (A), Copied (C), Deleted (D), Modified (M), Renamed (R), have their type (i.e. regular file, symlink, submodule, ...) changed (T), are Unmerged (U), are Unknown (X), or have had their pairing Broken (B). Any combination of the filter characters (including none) can be used. When * (All-or-none) is added to the combination, all paths are selected if there is any file that matches other criteria in the comparison; if there is no file that matches other criteria, nothing is selected.
-S<string>
Look for differences that change the number of occurrences of the specified string (i.e. addition/deletion) in a file. Intended for the scripter(cqs use.
It is useful when you(cqre looking for an exact block of code (like a struct), and want to know the history of that block since it first came into being: use the feature iteratively to feed the interesting block in the preimage back into -S, and keep going until you get the very first version of the block.
-G<regex>
Look for differences whose patch text contains added/removed lines that match <regex>.
To illustrate the difference between -S<regex> --pickaxe-regex and -G<regex>, consider a commit with the following diff in the same file:
+ return !regexec(regexp, two->ptr, 1, ®match, 0); ... - hit = !regexec(regexp, mf2.ptr, 1, ®match, 0);
While git log -G"regexece(regexp" will show this commit, git log -S"regexece(regexp" --pickaxe-regex will not (because the number of occurrences of that string did not change).
See the pickaxe entry in gitdiffcore(7) for more information.
--pickaxe-all
When -S or -G finds a change, show all the changes in that changeset, not just the files that contain the change in <string>.
--pickaxe-regex
Treat the <string> given to -S as an extended POSIX regular expression to match.
-O<orderfile>
Output the patch in the order specified in the <orderfile>, which has one shell glob pattern per line. This overrides the diff.orderfile configuration variable (see git-config(1)). To cancel diff.orderfile, use -O/dev/null.
-R
Swap two inputs; that is, show differences from index or on-disk file to tree contents.
--relative[=<path>]
When run from a subdirectory of the project, it can be told to exclude changes outside the directory and show pathnames relative to it with this option. When you are not in a subdirectory (e.g. in a bare repository), you can name which subdirectory to make the output relative to by giving a <path> as an argument.
-a, --text
Treat all files as text.
--ignore-space-at-eol
Ignore changes in whitespace at EOL.
-b, --ignore-space-change
Ignore changes in amount of whitespace. This ignores whitespace at line end, and considers all other sequences of one or more whitespace characters to be equivalent.
-w, --ignore-all-space
Ignore whitespace when comparing lines. This ignores differences even if one line has whitespace where the other line has none.
--ignore-blank-lines
Ignore changes whose lines are all blank.
--inter-hunk-context=<lines>
Show the context between diff hunks, up to the specified number of lines, thereby fusing hunks that are close to each other.
-W, --function-context
Show whole surrounding functions of changes.
--exit-code
Make the program exit with codes similar to diff(1). That is, it exits with 1 if there were differences and 0 means no differences.
--quiet
Disable all output of the program. Implies --exit-code.
--ext-diff
Allow an external diff helper to be executed. If you set an external diff driver with gitattributes(5), you need to use this option with git-log(1) and friends.
--no-ext-diff
Disallow external diff drivers.
--textconv, --no-textconv
Allow (or disallow) external text conversion filters to be run when comparing binary files. See gitattributes(5) for details. Because textconv filters are typically a one-way conversion, the resulting diff is suitable for human consumption, but cannot be applied. For this reason, textconv filters are enabled by default only for git-diff(1) and git-log(1), but not for git-format-patch(1) or diff plumbing commands.
--ignore-submodules[=<when>]
Ignore changes to submodules in the diff generation. <when> can be either "none", "untracked", "dirty" or "all", which is the default. Using "none" will consider the submodule modified when it either contains untracked or modified files or its HEAD differs from the commit recorded in the superproject and can be used to override any settings of the ignore option in git-config(1) or gitmodules(5). When "untracked" is used submodules are not considered dirty when they only contain untracked content (but they are still scanned for modified content). Using "dirty" ignores all changes to the work tree of submodules, only changes to the commits stored in the superproject are shown (this was the behavior until 1.7.0). Using "all" hides all changes to submodules.
--src-prefix=<prefix>
Show the given source prefix instead of "a/".
--dst-prefix=<prefix>
Show the given destination prefix instead of "b/".
--no-prefix
Do not show any source or destination prefix.
For more detailed explanation on these common options, see also gitdiffcore(7).
-1 --base, -2 --ours, -3 --theirs, -0
Diff against the "base" version, "our branch" or "their branch" respectively. With these options, diffs for merged entries are not shown.
The default is to diff against our branch (-2) and the cleanly resolved paths. The option -0 can be given to omit diff output for unmerged entries and just show "Unmerged".
-c, --cc
This compares stage 2 (our branch), stage 3 (their branch) and the working tree file and outputs a combined diff, similar to the way diff-tree shows a merge commit with these flags.
-q
Remain silent even on nonexistent files
The raw output format from "git-diff-index", "git-diff-tree", "git-diff-files" and "git diff --raw" are very similar.
These commands all compare two sets of things; what is compared differs:
git-diff-index <tree-ish>
compares the <tree-ish> and the files on the filesystem.
git-diff-index --cached <tree-ish>
compares the <tree-ish> and the index.
git-diff-tree [-r] <tree-ish-1> <tree-ish-2> [<pattern>...]
compares the trees named by the two arguments.
git-diff-files [<pattern>...]
compares the index and the files on the filesystem.
The "git-diff-tree" command begins its output by printing the hash of what is being compared. After that, all the commands print one output line per changed file.
An output line is formatted this way:
in-place edit :100644 100644 bcd1234... 0123456... M file0 copy-edit :100644 100644 abcd123... 1234567... C68 file1 file2 rename-edit :100644 100644 abcd123... 1234567... R86 file1 file3 create :000000<PHONE_NUMBER>000... 1234567... A file4 delete :100644<PHONE_NUMBER>567... 0000000... D file5 unmerged :000000<PHONE_NUMBER>000... 0000000... U file6
That is, from the left to the right:
h'-04' 1.h'+01'c
a colon.
h'-04' 2.h'+01'c
mode for "src"; 000000 if creation or unmerged.
h'-04' 3.h'+01'c
a space.
h'-04' 4.h'+01'c
mode for "dst"; 000000 if deletion or unmerged.
h'-04' 5.h'+01'c
a space.
h'-04' 6.h'+01'c
sha1 for "src"; 0{40} if creation or unmerged.
h'-04' 7.h'+01'c
a space.
h'-04' 8.h'+01'c
sha1 for "dst"; 0{40} if creation, unmerged or "look at work tree".
h'-04' 9.h'+01'c
a space.
h'-04'10.h'+01'c
status, followed by optional "score" number.
h'-04'11.h'+01'c
a tab or a NUL when -z option is used.
h'-04'12.h'+01'c
path for "src"
h'-04'13.h'+01'c
a tab or a NUL when -z option is used; only exists for C or R.
h'-04'14.h'+01'c
path for "dst"; only exists for C or R.
h'-04'15.h'+01'c
an LF or a NUL when -z option is used, to terminate the record.
Possible status letters are:
h'-04'(buh'+03'c
A: addition of a file
h'-04'(buh'+03'c
C: copy of a file into a new one
h'-04'(buh'+03'c
D: deletion of a file
h'-04'(buh'+03'c
M: modification of the contents or mode of a file
h'-04'(buh'+03'c
R: renaming of a file
h'-04'(buh'+03'c
T: change in the type of the file
h'-04'(buh'+03'c
U: file is unmerged (you must complete the merge before it can be committed)
h'-04'(buh'+03'c
X: "unknown" change type (most probably a bug, please report it)
Status letters C and R are always followed by a score (denoting the percentage of similarity between the source and target of the move or copy), and are the only ones to be so.
<sha1> is shown as all 0(cqs if a file is new on the filesystem and it is out of sync with the index.
Example:
:100644 100644 5be4a4...... 000000...... M file.c
When -z option is not used, TAB, LF, and backslash characters in pathnames are represented as et, en, and ee, respectively.
"git-diff-tree", "git-diff-files" and "git-diff --raw" can take -c or --cc option to generate diff output also for merge commits. The output differs from the format described above in the following way:
h'-04' 1.h'+01'c
there is a colon for each parent
h'-04' 2.h'+01'c
there are more "src" modes and "src" sha1
h'-04' 3.h'+01'c
status is concatenated status characters for each parent
h'-04' 4.h'+01'c
no optional "score" number
h'-04' 5.h'+01'c
single path, only for "dst"
Example:
::100644<PHONE_NUMBER>44 fabadb8... cc95eb0... 4866510... MM describe.c
Note that combined diff lists only files which were modified from all parents.
When "git-diff-index", "git-diff-tree", or "git-diff-files" are run with a -p option, "git diff" without the --raw option, or "git log" with the "-p" option, they do not produce the output described above; instead they produce a patch file. You can customize the creation of such patches via the GIT_EXTERNAL_DIFF and the GIT_DIFF_OPTS environment variables.
What the -p option produces is slightly different from the traditional diff format:
h'-04' 1.h'+01'c
It is preceded with a "git diff" header that looks like this:
diff --git a/file1 b/file2
The a/ and b/ filenames are the same unless rename/copy is involved. Especially, even for a creation or a deletion, /dev/null is not used in place of the a/ or b/ filenames.
When rename/copy is involved, file1 and file2 show the name of the source file of the rename/copy and the name of the file that rename/copy produces, respectively.
h'-04' 2.h'+01'c
It is followed by one or more extended header lines:
old mode <mode> new mode <mode> deleted file mode <mode> new file mode <mode> copy from <path> copy to <path> rename from <path> rename to <path> similarity index <number> dissimilarity index <number> index <hash>..<hash> <mode>
File modes are printed as 6-digit octal numbers including the file type and file permission bits.
Path names in extended headers do not include the a/ and b/ prefixes.
The similarity index is the percentage of unchanged lines, and the dissimilarity index is the percentage of changed lines. It is a rounded down integer, followed by a percent sign. The similarity index value of 100% is thus reserved for two equal files, while 100% dissimilarity means that no line from the old file made it into the new one.
The index line includes the SHA-1 checksum before and after the change. The <mode> is included if the file mode does not change; otherwise, separate lines indicate the old and the new mode.
h'-04' 3.h'+01'c
TAB, LF, double quote and backslash characters in pathnames are represented as et, en, e" and ee, respectively. If there is need for such substitution then the whole pathname is put in double quotes.
h'-04' 4.h'+01'c
All the file1 files in the output refer to files before the commit, and all the file2 files refer to files after the commit. It is incorrect to apply each change to each file sequentially. For example, this patch will swap a and b:
diff --git a/a b/b rename from a rename to b diff --git a/b b/a rename from b rename to a
Any diff-generating command can take the (oq-c` or --cc option to produce a combined diff when showing a merge. This is the default format when showing merges with git-diff(1) or git-show(1). Note also that you can give the `-m(cq option to any of these commands to force generation of diffs with individual parents of a merge.
A combined diff format looks like this:
diff --combined describe.c index fabadb8,cc95eb0..4866510 --- a/describe.c +++ b/describe.c @@@ -98,20 -98,12 +98,20 @@@ return (a_date > b_date) ? -1 : (a_date == b_date) ? 0 : 1; } - static void describe(char *arg) -static void describe(struct commit *cmit, int last_one) ++static void describe(char *arg, int last_one) { + unsigned char sha1[20]; + struct commit *cmit; struct commit_list *list; static int initialized = 0; struct commit_name *n; + if (get_sha1(arg, sha1) < 0) + usage(describe_usage); + cmit = lookup_commit_reference(sha1); + if (!cmit) + usage(describe_usage); + if (!initialized) { initialized = 1; for_each_ref(get_name);
h'-04' 1.h'+01'c
It is preceded with a "git diff" header, that looks like this (when -c option is used):
diff --combined file
or like this (when --cc option is used):
diff --cc file
h'-04' 2.h'+01'c
It is followed by one or more extended header lines (this example shows a merge with two parents):
index <hash>,<hash>..<hash> mode <mode>,<mode>..<mode> new file mode <mode> deleted file mode <mode>,<mode>
The mode <mode>,<mode>..<mode> line appears only if at least one of the <mode> is different from the rest. Extended headers with information about detected contents movement (renames and copying detection) are designed to work with diff of two <tree-ish> and are not used by combined diff format.
h'-04' 3.h'+01'c
It is followed by two-line from-file/to-file header
--- a/file +++ b/file
Similar to two-line header for traditional unified diff format, /dev/null is used to signal created or deleted files.
h'-04' 4.h'+01'c
Chunk header format is modified to prevent people from accidentally feeding it to patch -p1. Combined diff format was created for review of merge commit changes, and was not meant for apply. The change is similar to the change in the extended index header:
@@@ <from-file-range> <from-file-range> <to-file-range> @@@
There are (number of parents + 1) @ characters in the chunk header for combined diff format.
Unlike the traditional unified diff format, which shows two files A and B with a single column that has - (minus (em appears in A but removed in B), + (plus (em missing in A but added to B), or " " (space (em unchanged) prefix, this format compares two or more files file1, file2,... with one file X, and shows how X differs from each of fileN. One column for each of fileN is prepended to the output line to note how X(cqs line is different from it.
A - character in the column N means that the line appears in fileN but it does not appear in the result. A + character in the column N means that the line appears in the result, and fileN does not have that line (in other words, the line was added, from the point of view of that parent).
In the above example output, the function signature was changed from both files (hence two - removals from both file1 and file2, plus ++ to mean one line that was added does not appear in either file1 or file2). Also eight other lines are the same from file1 but do not appear in file2 (hence prefixed with +).
When shown by git diff-tree -c, it compares the parents of a merge commit with the merge result (i.e. file1..fileN are the parents). When shown by git diff-files -c, it compares the two unresolved merge parents with the working tree file (i.e. file1 is stage 2 aka "our version", file2 is stage 3 aka "their version").
The --summary option describes newly added, deleted, renamed and copied files. The --stat option adds diffstat(1) graph to the output. These options can be combined with other options, such as -p, and are meant for human consumption.
When showing a change that involves a rename or a copy, --stat output formats the pathnames compactly by combining common prefix and suffix of the pathnames. For example, a change that moves arch/i386/Makefile to arch/x86/Makefile while modifying 4 lines will be shown like this:
arch/{i386 => x86}/Makefile | 4 +--
The --numstat option gives the diffstat(1) information but is designed for easier machine consumption. An entry in --numstat output looks like this:
1 2 README 3 1 arch/{i386 => x86}/Makefile
That is, from left to right:
h'-04' 1.h'+01'c
the number of added lines;
h'-04' 2.h'+01'c
a tab;
h'-04' 3.h'+01'c
the number of deleted lines;
h'-04' 4.h'+01'c
a tab;
h'-04' 5.h'+01'c
pathname (possibly with rename/copy information);
h'-04' 6.h'+01'c
a newline.
When -z output option is in effect, the output is formatted this way:
1 2 README NUL 3 1 NUL arch/i386/Makefile NUL arch/x86/Makefile NUL
That is:
h'-04' 1.h'+01'c
the number of added lines;
h'-04' 2.h'+01'c
a tab;
h'-04' 3.h'+01'c
the number of deleted lines;
h'-04' 4.h'+01'c
a tab;
h'-04' 5.h'+01'c
a NUL (only exists if renamed/copied);
h'-04' 6.h'+01'c
pathname in preimage;
h'-04' 7.h'+01'c
a NUL (only exists if renamed/copied);
h'-04' 8.h'+01'c
pathname in postimage (only exists if renamed/copied);
h'-04' 9.h'+01'c
a NUL.
The extra NUL before the preimage path in renamed case is to allow scripts that read the output to tell if the current record being read is a single-path record or a rename/copy record without reading ahead. After reading added and deleted lines, reading up to NUL would yield the pathname, but if that is NUL, the record will show two paths.
Part of the git(1) suite


RDoc uses generators to turn parsed source code in the form of an RDoc::CodeObject tree into some form of output. RDoc comes with the HTML generator RDoc::Generator::Darkfish and an ri data generator RDoc::Generator::RI.
Generators are registered by calling RDoc::RDoc.add_generator with the class of the generator:
class My::Awesome::Generator RDoc::RDoc.add_generator self end
Before option processing in rdoc, RDoc::Options will call ::setup_options on the generator class with an RDoc::Options instance. The generator can use RDoc::Options#option_parser to add command-line options to the rdoc tool. See RDoc::Options@Custom+Options for an example and see OptionParser for details on how to add options.
You can extend the RDoc::Options instance with additional accessors for your generator.
After parsing, RDoc::RDoc will instantiate a generator by calling initialize with an RDoc::Store instance and an RDoc::Options instance.
The RDoc::Store instance holds documentation for parsed source code. In RDoc 3 and earlier the RDoc::TopLevel class held this data. When upgrading a generator from RDoc 3 and earlier you should only need to replace RDoc::TopLevel with the store instance.
RDoc will then call generate on the generator instance. You can use the various methods on RDoc::Store and in the RDoc::CodeObject tree to create your desired output format.


Templating Compiled Sample
This sample uses a Grunt task to compile the template (in Templates/mytable.tmpl.html) into javascript


Email is the best way to keep in contact with us. Email us at<EMAIL_ADDRESS>or click the button below.
Email us now
If you need something quickly, feel free to call us. Our number is 1(850)-776-1156


Thank you for taking the time to view my resume. What you can't tell from my picture is that I am a very dedicated and passionate about programming. In my spare time I like to learn more about new technologies and implement them in my projects. I like to learn by implementing technology into my personal projects and figuring out how it works and how it can better serve my needs. I use React, Node, Redux, JavaScript and HTML/CSS on daily basis to build interactive and mobile responsive web applications.
Build multiple projects in team environment, using React, Node, Redux, JavaScript and various other technologies. Learned coding through real world applications, like e-commerce, relational database, and authentication. Solved complex and challenging problems through teamwork and coding implementation.
Worked in a team of three, to build a video discussion web-app. Where a user could register, login using B-Crypt, create a room with a build in streaming video and chat messaging using Sockets.io. Owner of the room could control the stream by pausing or setting the time interval within the video. Frontend was build using React, Redux and JavaScript. Database was designed using PostgreSQL. On the backend, the project used Node for server, Massive for database and Sockets.
Created a clone web-app based on REI hiking equipment. User could login using Auth0 authentication, add products to shopping cart and checkout using Stripe API. In this project React, Redux and JavaScript was used on frontend. For the backend, it was Node, PostgreSQL, Massive and Auth0.
No database project, which uses full CRUD (Create, Read, Update, Delete) with React and Node. User would add car information, picture, model, make, and price. The app would display all added cars in a list. User could then edit the information of a car, add it to his favorites list, or delete it from his list.
Over the course of eight years, I was the primary point of contact for all IT related incidents and service requests for three divisions/400+ employee base. Responsible for all desktop and telecom needs, software/hardware upgrades, budgetary improvements and task consolidation.
HBA (Home Base Agent) where I provided technical resolutions over the phone to customers with Apple products. Daily responsibilities were to manage time and call duration to meet call quota, also ticket escalation, closing and resolution. I was consistently in the top five of my team in call resolution and customer satisfaction.
Started with Quicken loans as internal telephone support technician. Supporting users, Microsoft products and in house mortgage applications. Was promoted to desktop support. Later I was offered a position at a new Arizona branch office as a Desktop support specialist. I managed branch day to day IT tasks and services.
Associete's in Computer Science