aboutsummaryrefslogtreecommitdiffstats
path: root/src/apis.js
diff options
context:
space:
mode:
authorMisko Hevery2011-10-07 11:27:49 -0700
committerIgor Minar2011-10-11 11:01:46 -0700
commitfd822bdaf9d04e522aaa5400b673f333190abe98 (patch)
tree451cd26d3f7da862692d6c56e6e8f235824c180a /src/apis.js
parent4f78fd692c0ec51241476e6be9a4df06cd62fdd6 (diff)
downloadangular.js-fd822bdaf9d04e522aaa5400b673f333190abe98.tar.bz2
chore(formating): clean code to be function() {
Diffstat (limited to 'src/apis.js')
-rw-r--r--src/apis.js16
1 files changed, 8 insertions, 8 deletions
diff --git a/src/apis.js b/src/apis.js
index 6a5bf6c4..c9b2a99f 100644
--- a/src/apis.js
+++ b/src/apis.js
@@ -104,7 +104,7 @@ var angularArray = {
<doc:example>
<doc:source>
<script>
- function Ctrl(){
+ function Ctrl() {
this.books = ['Moby Dick', 'Great Gatsby', 'Romeo and Juliet'];
this.bookName = 'Romeo and Juliet';
}
@@ -154,7 +154,7 @@ var angularArray = {
<doc:example>
<doc:source>
<script>
- function Ctrl(){
+ function Ctrl() {
this.invoice = {
items:[ {
qty:10,
@@ -400,7 +400,7 @@ var angularArray = {
case "object":
for (var key in expression) {
if (key == '$') {
- (function(){
+ (function() {
var text = (''+expression[key]).toLowerCase();
if (!text) return;
predicates.push(function(value) {
@@ -408,7 +408,7 @@ var angularArray = {
});
})();
} else {
- (function(){
+ (function() {
var path = key;
var text = (''+expression[key]).toLowerCase();
if (!text) return;
@@ -462,7 +462,7 @@ var angularArray = {
<doc:example>
<doc:source>
<script>
- function Ctrl(){
+ function Ctrl() {
this.people = [];
}
</script>
@@ -612,7 +612,7 @@ var angularArray = {
<doc:example>
<doc:source>
<script>
- function Ctrl(){
+ function Ctrl() {
this.friends =
[{name:'John', phone:'555-1212', age:10},
{name:'Mary', phone:'555-9876', age:19},
@@ -738,7 +738,7 @@ var angularArray = {
<doc:example>
<doc:source>
<script>
- function Ctrl(){
+ function Ctrl() {
this.numbers = [1,2,3,4,5,6,7,8,9];
this.limit = 3;
}
@@ -939,7 +939,7 @@ HashMap.prototype = {
* A map where multiple values can be added to the same key such that the form a queue.
* @returns {HashQueueMap}
*/
-function HashQueueMap(){}
+function HashQueueMap() {}
HashQueueMap.prototype = {
/**
* Same as array push, but using an array as the value for the hash