diff --git a/BeyondResponsiveDesign.Menus/BeyondResponsiveDesign.Menus.csproj b/BeyondResponsiveDesign.Menus/BeyondResponsiveDesign.Menus.csproj
deleted file mode 100644
index 330684a..0000000
--- a/BeyondResponsiveDesign.Menus/BeyondResponsiveDesign.Menus.csproj
+++ /dev/null
@@ -1,326 +0,0 @@
-
-
-
- Debug
- AnyCPU
-
-
- 2.0
- {54C61F9C-7B4B-4071-A7FB-5A9FE4D9777D}
- {349c5851-65df-11da-9384-00065b846f21};{fae04ec0-301f-11d3-bf4b-00c04f79efbc}
- Library
- Properties
- BeyondResponsiveDesign.Menus
- BeyondResponsiveDesign.Menus
- v4.5
- true
-
-
- true
- full
- false
- bin\
- DEBUG;TRACE
- prompt
- 4
-
-
- pdbonly
- true
- bin\
- TRACE
- prompt
- 4
-
-
-
- ..\packages\Microsoft.Owin.3.0.0-rc2\lib\net45\Microsoft.Owin.dll
-
-
- ..\packages\Microsoft.Owin.FileSystems.3.0.0-rc2\lib\net45\Microsoft.Owin.FileSystems.dll
-
-
- ..\packages\Microsoft.Owin.Host.SystemWeb.3.0.0-rc2\lib\net45\Microsoft.Owin.Host.SystemWeb.dll
-
-
- ..\packages\Microsoft.Owin.StaticFiles.3.0.0-rc2\lib\net45\Microsoft.Owin.StaticFiles.dll
-
-
- ..\packages\Owin.1.0\lib\net40\Owin.dll
-
-
-
-
- theme.less
-
-
- theme.css
-
-
- styles.css
-
-
- theme.css
-
-
- transforms.less
-
-
- transforms.css
-
-
- Web.config
-
-
- Web.config
-
-
-
-
- styles.less
-
-
- styles.css
-
-
- transforms.css
-
-
-
-
-
- 10.0
- $(MSBuildExtensionsPath32)\Microsoft\VisualStudio\v$(VisualStudioVersion)
-
-
-
-
-
- True
- True
- 64566
- /
- http://localhost:64566/
- False
- False
-
-
- False
-
-
-
-
-
-
\ No newline at end of file
diff --git a/BeyondResponsiveDesign.Menus/Index.html b/BeyondResponsiveDesign.Menus/Index.html
deleted file mode 100644
index b59d1c7..0000000
--- a/BeyondResponsiveDesign.Menus/Index.html
+++ /dev/null
@@ -1,214 +0,0 @@
-
-
-
- Beyond responsive design - UI for the modern web application
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- Home
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
diff --git a/BeyondResponsiveDesign.Menus/Properties/AssemblyInfo.cs b/BeyondResponsiveDesign.Menus/Properties/AssemblyInfo.cs
deleted file mode 100644
index 0030e5e..0000000
--- a/BeyondResponsiveDesign.Menus/Properties/AssemblyInfo.cs
+++ /dev/null
@@ -1,35 +0,0 @@
-using System.Reflection;
-using System.Runtime.CompilerServices;
-using System.Runtime.InteropServices;
-
-// General Information about an assembly is controlled through the following
-// set of attributes. Change these attribute values to modify the information
-// associated with an assembly.
-[assembly: AssemblyTitle("BeyondResponsiveDesign.Menus")]
-[assembly: AssemblyDescription("")]
-[assembly: AssemblyConfiguration("")]
-[assembly: AssemblyCompany("")]
-[assembly: AssemblyProduct("BeyondResponsiveDesign.Menus")]
-[assembly: AssemblyCopyright("Copyright © 2014")]
-[assembly: AssemblyTrademark("")]
-[assembly: AssemblyCulture("")]
-
-// Setting ComVisible to false makes the types in this assembly not visible
-// to COM components. If you need to access a type in this assembly from
-// COM, set the ComVisible attribute to true on that type.
-[assembly: ComVisible(false)]
-
-// The following GUID is for the ID of the typelib if this project is exposed to COM
-[assembly: Guid("8c64d4fb-bc21-4195-bd4b-20a31fdb48f1")]
-
-// Version information for an assembly consists of the following four values:
-//
-// Major Version
-// Minor Version
-// Build Number
-// Revision
-//
-// You can specify all the values or you can default the Revision and Build Numbers
-// by using the '*' as shown below:
-[assembly: AssemblyVersion("1.0.0.0")]
-[assembly: AssemblyFileVersion("1.0.0.0")]
diff --git a/BeyondResponsiveDesign.Menus/Settings.StyleCop b/BeyondResponsiveDesign.Menus/Settings.StyleCop
deleted file mode 100644
index b49c38e..0000000
--- a/BeyondResponsiveDesign.Menus/Settings.StyleCop
+++ /dev/null
@@ -1,219 +0,0 @@
-
-
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
- False
-
-
-
-
-
-
\ No newline at end of file
diff --git a/BeyondResponsiveDesign.Menus/Startup.cs b/BeyondResponsiveDesign.Menus/Startup.cs
deleted file mode 100644
index e727bb3..0000000
--- a/BeyondResponsiveDesign.Menus/Startup.cs
+++ /dev/null
@@ -1,12 +0,0 @@
-namespace BeyondResponsiveDesign.Menus
-{
- using Owin;
-
- public class Startup
- {
- public void Configuration(IAppBuilder app)
- {
- app.UseStaticFiles();
- }
- }
-}
\ No newline at end of file
diff --git a/BeyondResponsiveDesign.Menus/Web.Debug.config b/BeyondResponsiveDesign.Menus/Web.Debug.config
deleted file mode 100644
index 2e302f9..0000000
--- a/BeyondResponsiveDesign.Menus/Web.Debug.config
+++ /dev/null
@@ -1,30 +0,0 @@
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/BeyondResponsiveDesign.Menus/Web.Release.config b/BeyondResponsiveDesign.Menus/Web.Release.config
deleted file mode 100644
index c358444..0000000
--- a/BeyondResponsiveDesign.Menus/Web.Release.config
+++ /dev/null
@@ -1,31 +0,0 @@
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/BeyondResponsiveDesign.Menus/Web.config b/BeyondResponsiveDesign.Menus/Web.config
deleted file mode 100644
index b5191c7..0000000
--- a/BeyondResponsiveDesign.Menus/Web.config
+++ /dev/null
@@ -1,16 +0,0 @@
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/BeyondResponsiveDesign.Menus/agenda.html.modern b/BeyondResponsiveDesign.Menus/agenda.html.modern
deleted file mode 100644
index 472e5ba..0000000
--- a/BeyondResponsiveDesign.Menus/agenda.html.modern
+++ /dev/null
@@ -1,86 +0,0 @@
-
-
-
-
-
-
\ No newline at end of file
diff --git a/BeyondResponsiveDesign.Menus/cache.manifest b/BeyondResponsiveDesign.Menus/cache.manifest
deleted file mode 100644
index c741696..0000000
--- a/BeyondResponsiveDesign.Menus/cache.manifest
+++ /dev/null
@@ -1,81 +0,0 @@
-CACHE MANIFEST
-# 2014-08-14:v1.5
-
-# Explicitly cached 'master entries'.
-CACHE:
-images/favicon.ico
-images/icon-128.png
-images/icon-196.png
-images/logo-small-green.png
-images/logo-small.png
-images/logo-notext-green.png
-images/googleplaystore.gif
-images/itunesappstore.gif
-images/venue.jpg
-images/speakers/11.jpg
-images/speakers/1313.jpg
-images/speakers/23.jpg
-images/speakers/2311.jpg
-images/speakers/2312.jpg
-images/speakers/2314.jpg
-images/speakers/2316.jpg
-images/speakers/293.jpg
-images/speakers/30.jpg
-images/speakers/302.jpg
-images/speakers/303.jpg
-images/speakers/309.jpg
-images/speakers/3319.jpg
-images/speakers/3320.jpg
-images/speakers/3322.jpg
-images/speakers/3323.jpg
-images/speakers/3324.jpg
-images/speakers/34.jpg
-images/speakers/4328.jpg
-images/speakers/4331.jpg
-images/speakers/4332.jpg
-images/speakers/48.jpg
-images/speakers/53.jpg
-images/speakers/5333.jpg
-images/speakers/62.jpg
-images/accommodation/doubletree-hilton.jpg
-images/accommodation/premierinn-a14-j32.jpg
-images/accommodation/travelodge-cambridge-central.jpg
-images/accommodation/travelodge-newmarket-road.jpg
-images/accommodation/travelodge-orchard-park.jpg
-images/accommodation/university-arms.jpg
-images/accommodation/varsity.jpg
-styles/fonts/opensans_regular_macroman/OpenSans-Regular-webfont.eot
-styles/fonts/opensans_regular_macroman/OpenSans-Regular-webfont.eot?iefix
-styles/fonts/opensans_regular_macroman/OpenSans-Regular-webfont.svg#webfont
-styles/fonts/opensans_regular_macroman/OpenSans-Regular-webfont.ttf
-styles/fonts/opensans_regular_macroman/OpenSans-Regular-webfont.woff
-styles/fonts/fontawesome-webfont.eot?v=4.1.0
-styles/fonts/fontawesome-webfont.eot?#iefix&v=4.1.0
-styles/fonts/fontawesome-webfont.svg?v=4.1.0#fontawesomeregular
-styles/fonts/fontawesome-webfont.ttf?v=4.1.0
-styles/fonts/fontawesome-webfont.woff?v=4.1.0
-styles/fonts/FontAwesome.otf
-styles/styles.css
-styles/theme.css
-styles/transforms.css
-styles/font-awesome.min.css
-scripts/fastclick.js
-scripts/interactions.js
-scripts/jquery-2.1.1.min.js
-scripts/jquery.detect_swipe.js
-scripts/knockout-3.1.0.js
-scripts/touchscrollfix.js
-Index.html
-content/accommodation.html
-content/agenda.json
-content/agenda.html
-content/cfp.html
-content/contact.html
-content/home.html
-content/presentation.html
-content/sessions.html
-content/speakers.json
-content/speakers.html
-content/speakerdetail.html
-content/sponsors.html
-content/venue.html
\ No newline at end of file
diff --git a/BeyondResponsiveDesign.Menus/content/accommodation.html b/BeyondResponsiveDesign.Menus/content/accommodation.html
deleted file mode 100644
index de574ac..0000000
--- a/BeyondResponsiveDesign.Menus/content/accommodation.html
+++ /dev/null
@@ -1,141 +0,0 @@
-
-
-
-
-
-
- If the Newmarket Road Travelodge is full, alternatives include (map ):
-
-
-
-
\ No newline at end of file
diff --git a/BeyondResponsiveDesign.Menus/content/agenda.html b/BeyondResponsiveDesign.Menus/content/agenda.html
deleted file mode 100644
index 33f3e8d..0000000
--- a/BeyondResponsiveDesign.Menus/content/agenda.html
+++ /dev/null
@@ -1,101 +0,0 @@
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/BeyondResponsiveDesign.Menus/content/agenda.json b/BeyondResponsiveDesign.Menus/content/agenda.json
deleted file mode 100644
index 08aacc9..0000000
--- a/BeyondResponsiveDesign.Menus/content/agenda.json
+++ /dev/null
@@ -1,397 +0,0 @@
-{
- "Tracks": [
- {
- "Id": 1,
- "Identifier": "one",
- "Name": "Track 1",
- "RoomName": "Room 1"
- },
- {
- "Id": 2,
- "Identifier": "two",
- "Name": "Track 2",
- "RoomName": "Room 2"
- },
- {
- "Id": 3,
- "Identifier": "three",
- "Name": "Track 3",
- "RoomName": "Room 3"
- },
- {
- "Id": 4,
- "Identifier": "four",
- "Name": "Track 4",
- "RoomName": "Room 4"
- },
- {
- "Id": 5,
- "Identifier": "five",
- "Name": "Track 5",
- "RoomName": "Room 5"
- }
- ],
- "TimeSlots": [
- {
- "Id": 1,
- "From": "2014-09-13T08:30:00",
- "To": "2014-09-13T09:00:00",
- "Info": "Registration, Refreshments (sponsored by Compare the Market)"
- },
- {
- "Id": 2,
- "From": "2014-09-13T09:00:00",
- "To": "2014-09-13T09:30:00",
- "Info": "Welcome & Housekeeping"
- },
- {
- "Id": 3,
- "From": "2014-09-13T09:15:00",
- "To": "2014-09-13T10:15:00",
- "Info": null
- },
- {
- "Id": 4,
- "From": "2014-09-13T10:15:00",
- "To": "2014-09-13T10:35:00",
- "Info": "Break"
- },
- {
- "Id": 5,
- "From": "2014-09-13T10:35:00",
- "To": "2014-09-13T11:35:00",
- "Info": null
- },
- {
- "Id": 6,
- "From": "2014-09-13T11:35:00",
- "To": "2014-09-13T11:55:00",
- "Info": "Break"
- },
- {
- "Id": 7,
- "From": "2014-09-13T11:55:00",
- "To": "2014-09-13T12:55:00",
- "Info": null
- },
- {
- "Id": 8,
- "From": "2014-09-13T12:55:00",
- "To": "2014-09-13T14:00:00",
- "Info": "Lunch, Grok Talks (sponsored by Huddle)"
- },
- {
- "Id": 9,
- "From": "2014-09-13T14:00:00",
- "To": "2014-09-13T15:00:00",
- "Info": null
- },
- {
- "Id": 10,
- "From": "2014-09-13T15:00:00",
- "To": "2014-09-13T15:20:00",
- "Info": "Break"
- },
- {
- "Id": 11,
- "From": "2014-09-13T15:20:00",
- "To": "2014-09-13T16:20:00",
- "Info": null
- },
- {
- "Id": 12,
- "From": "2014-09-13T16:20:00",
- "To": "2014-09-13T16:30:00",
- "Info": "Break"
- },
- {
- "Id": 13,
- "From": "2014-09-13T16:30:00",
- "To": "2014-09-13T17:00:00",
- "Info": "Wrap-up"
- },
- {
- "Id": 14,
- "From": "2014-09-13T17:00:00",
- "To": "2014-09-13T17:00:00",
- "Info": "Close"
- }
- ],
- "Sessions": [
- {
- "Id": 1,
- "DDDEventId": 1,
- "TrackId": 1,
- "TimeSlotId": 3,
- "Title": "OWIN, Katana and ASP.NET vNext: eliminating the pain of IIS",
- "Speaker": "David Simner",
- "SpeakerId": 11,
- "ShortDescription": "I first encountered OWIN when I added SignalR to a legacy ASP.NET MVC app, and had to write a piece of OWIN middleware to get SignalR to play nicely with our legacy authentication.\r\n\r\nIt was a thoroughly impressive experience, so I built my next greenfield project on OWIN & Katana as a single-page app using static files & Web API, finally ditching IIS for good. The glad tidings continue for Microsoft web developers, with ASP.NET vNext promising even more goodness on the horizon.\r\n\r\nTheres a lot of changes coming for those of us working on the .NET web stack, so this talk will show you what things look like today:\r\n\r\n - What are OWIN & Katana, and why you should care\r\n - What middleware is, as well as why and how you write it\r\n - The advantages this brings for testing\r\n - How Helios lets you host on IIS (if you really *really really* want to)\r\n\r\nAs well as what's changing in ASP.NET vNext:\r\n\r\n - How Roslyn comes into play\r\n - The what and the why of the K runtime\r\n - Why you should care about the Core CLR\r\n - Whats shiny about ASP.NET MVC 6\r\n\r\nTheres a lot to cover, so well move fast. You'll come away knowing why and how you should start using this on your own projects.",
- "FullDescription": "I first encountered OWIN when I added SignalR to a legacy ASP.NET MVC app, and had to write a piece of OWIN middleware to get SignalR to play nicely with our legacy authentication.\r\n\r\nIt was a thoroughly impressive experience, so I built my next greenfield project on OWIN & Katana as a single-page app using static files & Web API, finally ditching IIS for good. The glad tidings continue for Microsoft web developers, with ASP.NET vNext promising even more goodness on the horizon.\r\n\r\nTheres a lot of changes coming for those of us working on the .NET web stack, so this talk will show you what things look like today:\r\n\r\n - What are OWIN & Katana, and why you should care\r\n - What middleware is, as well as why and how you write it\r\n - The advantages this brings for testing\r\n - How Helios lets you host on IIS (if you really *really really* want to)\r\n\r\nAs well as what's changing in ASP.NET vNext:\r\n\r\n - How Roslyn comes into play\r\n - The what and the why of the K runtime\r\n - Why you should care about the Core CLR\r\n - Whats shiny about ASP.NET MVC 6\r\n\r\nTheres a lot to cover, so well move fast. You'll come away knowing why and how you should start using this on your own projects."
- },
- {
- "Id": 2,
- "DDDEventId": 1,
- "TrackId": 2,
- "TimeSlotId": 3,
- "Title": "GitHub Automation",
- "Speaker": "Forbes Lindesay",
- "SpeakerId": 303,
- "ShortDescription": "GitHub has one of the best REST APIs you'll ever see. Pretty much any task in GitHub can be automated. Tired of updating code after a feature gets deprecated? Write a bot for that. Need to add the repository field to all your package.json files? Script it. You can even use GitHub as the backend for an entire application to take advantage of its built in collaboration features. This talk will take you through how to write you own GitHub automation code in JavaScript and give you some ideas on how to use your new-found powers for good.",
- "FullDescription": "GitHub has one of the best REST APIs you'll ever see. Pretty much any task in GitHub can be automated. Tired of updating code after a feature gets deprecated? Write a bot for that. Need to add the repository field to all your package.json files? Script it. You can even use GitHub as the backend for an entire application to take advantage of its built in collaboration features. This talk will take you through how to write you own GitHub automation code in JavaScript and give you some ideas on how to use your new-found powers for good."
- },
- {
- "Id": 3,
- "DDDEventId": 1,
- "TrackId": 3,
- "TimeSlotId": 3,
- "Title": "An Actor's Life for Me - An introduction to the TPL Dataflow Library and asynchronous programming blocks",
- "Speaker": "Liam Westley",
- "SpeakerId": 62,
- "ShortDescription": "Every version of the .NET Framework has brought improvements to asynchronous and concurrent programming. While .NET 4.0 brought the async/await model which is useful for improving UI responses and server applications, it can sometimes still be tricky to marshal multiple threads within longer processing pipelines.\r\n\r\nThe Dataflow Library consists of a Nuget package built on top of the Task Parallel Library (TPL). It harnesses the actor-based programming model to provide a set of dataflow blocks data structures that buffer and process data, which you can connect together to form custom pipelines with messages passed between the blocks.\r\n\r\nBy using the Dataflow Library you can concentrate on the messages and actions being performed, while the blocks marshal the messages, provide concurrent message processing and buffering as well as supporting cancellation and exception handling.",
- "FullDescription": "Every version of the .NET Framework has brought improvements to asynchronous and concurrent programming. While .NET 4.0 brought the async/await model which is useful for improving UI responses and server applications, it can sometimes still be tricky to marshal multiple threads within longer processing pipelines.\r\n\r\nThe Dataflow Library consists of a Nuget package built on top of the Task Parallel Library (TPL). It harnesses the actor-based programming model to provide a set of dataflow blocks data structures that buffer and process data, which you can connect together to form custom pipelines with messages passed between the blocks.\r\n\r\nBy using the Dataflow Library you can concentrate on the messages and actions being performed, while the blocks marshal the messages, provide concurrent message processing and buffering as well as supporting cancellation and exception handling."
- },
- {
- "Id": 4,
- "DDDEventId": 1,
- "TrackId": 4,
- "TimeSlotId": 3,
- "Title": "A Unit Testing Swiss Army Knife",
- "Speaker": "Adam Kosinski",
- "SpeakerId": 3324,
- "ShortDescription": "Putting all of *#IsTddDeadOrNotQuiteYet* discussion aside, there are a lot of things to be said about more technical side of writing tests. Instead of big important questions like \"How\" or \"Why\", I would like to present you a couple of tricks, patterns and libraries that help in what is usually of secondary interest - readability, maintainability.\r\n\r\nThe leading motive for this talk will be approaching our tests like living documentation - and what we can possibly do to make it better.\r\n\r\nSo, have you ever wondered what is Bulider Pattern about? What is all the fuss in being \"fluent\"? Or maybe you wondered if you can effectively integration test you MVC app? I hope you will find useful learning this, and some more. \r\n",
- "FullDescription": "Putting all of *#IsTddDeadOrNotQuiteYet* discussion aside, there are a lot of things to be said about more technical side of writing tests. Instead of big important questions like \"How\" or \"Why\", I would like to present you a couple of tricks, patterns and libraries that help in what is usually of secondary interest - readability, maintainability.\r\n\r\nThe leading motive for this talk will be approaching our tests like living documentation - and what we can possibly do to make it better.\r\n\r\nSo, have you ever wondered what is Bulider Pattern about? What is all the fuss in being \"fluent\"? Or maybe you wondered if you can effectively integration test you MVC app? I hope you will find useful learning this, and some more. \r\n"
- },
- {
- "Id": 5,
- "DDDEventId": 1,
- "TrackId": 5,
- "TimeSlotId": 3,
- "Title": "Taking your craft seriously with F#",
- "Speaker": "Tomas Petricek",
- "SpeakerId": 4332,
- "ShortDescription": "Many standard F# libraries and tools, including the compiler itself, are developed as open-source and have a large number of contributors. To successfully build such projects, you need to be serious about your craft. This includes comprehensive testing, using automated build tools, continuous integration, as well as creating great documentation and tutorials. In this talk, I'll talk about what I learned as an open-source F# contributor.\r\n\r\nAlong the way, we'll look a number of risk-free ways of introducing F# into your workflow:\r\n\r\n * How to use F# Interactive for explorative programming and writing code that works on the first try\r\n * Using FAKE - an F# build tool - to automate everything in your build process\r\n * Writing readable unit tests with F# and using FsCheck for property-based testing\r\n * Generating great documentation using F# Formatting tools\r\n\r\nIn summary, this talk is a walkthrough covering some of the software engineering aspects of programming that have been working extremely well for the F# open-source ecosystem. After the talk, you'll have a good idea how to use some of the techniques in your daily job - but you may as well become an F# contributor! \r\n",
- "FullDescription": "Many standard F# libraries and tools, including the compiler itself, are developed as open-source and have a large number of contributors. To successfully build such projects, you need to be serious about your craft. This includes comprehensive testing, using automated build tools, continuous integration, as well as creating great documentation and tutorials. In this talk, I'll talk about what I learned as an open-source F# contributor.\r\n\r\nAlong the way, we'll look a number of risk-free ways of introducing F# into your workflow:\r\n\r\n * How to use F# Interactive for explorative programming and writing code that works on the first try\r\n * Using FAKE - an F# build tool - to automate everything in your build process\r\n * Writing readable unit tests with F# and using FsCheck for property-based testing\r\n * Generating great documentation using F# Formatting tools\r\n\r\nIn summary, this talk is a walkthrough covering some of the software engineering aspects of programming that have been working extremely well for the F# open-source ecosystem. After the talk, you'll have a good idea how to use some of the techniques in your daily job - but you may as well become an F# contributor! \r\n"
- },
- {
- "Id": 6,
- "DDDEventId": 1,
- "TrackId": 1,
- "TimeSlotId": 5,
- "Title": "Functional DDD",
- "Speaker": "Alessandro Melchiori",
- "SpeakerId": 2312,
- "ShortDescription": "Very often we approach, more or less unconsciously, DDD's principles only with object-oriented paradigm, without exploring if other \"style\" can live better with aggregates, value objects, commands and domain events. Well, yes: there is 'other' out there... \r\nIn this session we will see how a functional language as F# can lead to a more intuitive and compact implementation of our domains.",
- "FullDescription": "Very often we approach, more or less unconsciously, DDD's principles only with object-oriented paradigm, without exploring if other \"style\" can live better with aggregates, value objects, commands and domain events. Well, yes: there is 'other' out there... \r\nIn this session we will see how a functional language as F# can lead to a more intuitive and compact implementation of our domains."
- },
- {
- "Id": 7,
- "DDDEventId": 1,
- "TrackId": 2,
- "TimeSlotId": 5,
- "Title": "Building Skynet: Machine learning for software developers",
- "Speaker": "Anthony Brown",
- "SpeakerId": 293,
- "ShortDescription": "How does Netflix know that I'd like that new movie which just released? How does Google know which ads to serve to me? How do games like Halo and Titanfall put me in game lobbies to create even matches? All these questions are answered with machine learning algorithms. Machine learning can sometimes look difficult. This session aims to break down the barrier to entry for machine learning and show how powerful even the most simple algorithms can be. Expect plenty of sample code to show just how quick and easy these basic algorithms can be.",
- "FullDescription": "How does Netflix know that I'd like that new movie which just released? How does Google know which ads to serve to me? How do games like Halo and Titanfall put me in game lobbies to create even matches? All these questions are answered with machine learning algorithms. Machine learning can sometimes look difficult. This session aims to break down the barrier to entry for machine learning and show how powerful even the most simple algorithms can be. Expect plenty of sample code to show just how quick and easy these basic algorithms can be."
- },
- {
- "Id": 8,
- "DDDEventId": 1,
- "TrackId": 3,
- "TimeSlotId": 5,
- "Title": "Embracing DevOps at JUST EAT, within a Microsoft platform",
- "Speaker": "Peter Mounce",
- "SpeakerId": 3323,
- "ShortDescription": "JUST EAT changed its culture towards embracing DevOps principles, and heavily leveraged AWS to achieve it.\r\n\r\nWe're a successful online takeaway ecommerce website running on a Microsoft-based platform.\r\n\r\nCome learn how we:\r\n\r\n - re-organised our teams and our platform to loosely couple them\r\n - re-organised our architecture to be more modular\r\n - made it possible for developers to operate their code in production directly, starting with shoot-it-in-the-head debugging\r\n - made it possible for developers to continuously ship changes\r\n - eliminated most differences between production and qa environments\r\n - became more resilient as a happy by-product",
- "FullDescription": "JUST EAT changed its culture towards embracing DevOps principles, and heavily leveraged AWS to achieve it.\r\n\r\nWe're a successful online takeaway ecommerce website running on a Microsoft-based platform.\r\n\r\nCome learn how we:\r\n\r\n - re-organised our teams and our platform to loosely couple them\r\n - re-organised our architecture to be more modular\r\n - made it possible for developers to operate their code in production directly, starting with shoot-it-in-the-head debugging\r\n - made it possible for developers to continuously ship changes\r\n - eliminated most differences between production and qa environments\r\n - became more resilient as a happy by-product"
- },
- {
- "Id": 9,
- "DDDEventId": 1,
- "TrackId": 4,
- "TimeSlotId": 5,
- "Title": "Super charging your JavaScript development experience",
- "Speaker": "Chris Canal",
- "SpeakerId": 302,
- "ShortDescription": "With the release of V8 and subsequently NodeJs, JavaScript has started to grow up. In this session we will look at how you can super charge your JavaScript development lifecycle and deliver better written, cleaner and more coherent JavaScript with and without VisualStudio\r\n\r\nWe will look at the many awesome frameworks for infrastructural support when developing JavaScript applications like Yeoman, Gulp, grunt, Browserfy and a few other handy libraries",
- "FullDescription": "With the release of V8 and subsequently NodeJs, JavaScript has started to grow up. In this session we will look at how you can super charge your JavaScript development lifecycle and deliver better written, cleaner and more coherent JavaScript with and without VisualStudio\r\n\r\nWe will look at the many awesome frameworks for infrastructural support when developing JavaScript applications like Yeoman, Gulp, grunt, Browserfy and a few other handy libraries"
- },
- {
- "Id": 10,
- "DDDEventId": 1,
- "TrackId": 5,
- "TimeSlotId": 5,
- "Title": "Beyond responsive design - UI for the modern web application",
- "Speaker": "Pete Smith",
- "SpeakerId": 1313,
- "ShortDescription": "Applications written for the modern web are being consumed not just on desktop browsers, but also on a myriad of other devices... even watches and glasses. If you design your application with a pc screen in mind, at worst you're either cutting your userbase in half or setting yourself up for an expensive redesign.\r\n\r\nIn this talk I'll introduce you to some modern web design constructs, and the technologies that bring them to life. Learn how to create apps that work just as well on phone, mobile and desktop with no extra effort, and without restrictive layout frameworks. Who knows... you may even even see things that begin to rival native apps!",
- "FullDescription": "Applications written for the modern web are being consumed not just on desktop browsers, but also on a myriad of other devices... even watches and glasses. If you design your application with a pc screen in mind, at worst you're either cutting your userbase in half or setting yourself up for an expensive redesign.\r\n\r\nIn this talk I'll introduce you to some modern web design constructs, and the technologies that bring them to life. Learn how to create apps that work just as well on phone, mobile and desktop with no extra effort, and without restrictive layout frameworks. Who knows... you may even even see things that begin to rival native apps!"
- },
- {
- "Id": 11,
- "DDDEventId": 1,
- "TrackId": 1,
- "TimeSlotId": 7,
- "Title": "So you want to be a Tech Lead? 10 things you need to do to succeed.",
- "Speaker": "Joel Hammond-Turner",
- "SpeakerId": 23,
- "ShortDescription": "\"Tech Lead\" is an amorphous job title - is it all about the technology, or all about leadership? What should the balance really be?\r\n\r\nAnd it can also be a complex and thankless role too - particularly if you find yourself becoming the go-to guy (or gal) for everyone from the intern to the product manager.\r\n\r\nIn this talk I'll cover (at least) 10 things that I think are essential to success in both areas, including how to address technical debt, herd your PMs and make sure your development team has a steady flow of work (and beer, pizza or other \"motivationals\").\r\n",
- "FullDescription": "\"Tech Lead\" is an amorphous job title - is it all about the technology, or all about leadership? What should the balance really be?\r\n\r\nAnd it can also be a complex and thankless role too - particularly if you find yourself becoming the go-to guy (or gal) for everyone from the intern to the product manager.\r\n\r\nIn this talk I'll cover (at least) 10 things that I think are essential to success in both areas, including how to address technical debt, herd your PMs and make sure your development team has a steady flow of work (and beer, pizza or other \"motivationals\").\r\n"
- },
- {
- "Id": 12,
- "DDDEventId": 1,
- "TrackId": 2,
- "TimeSlotId": 7,
- "Title": "Decoupling from ASP.NET - Hexagonal Architectures in .NET",
- "Speaker": "Ian Cooper",
- "SpeakerId": 2311,
- "ShortDescription": "The term 'hexagonal architecture' has come back and forth in popularity since Alistair Cockburn first mooted it, with the Rails community's recent soul searching over its importance or threat just the latest. So what is a hexagonal architecture, why might you want to use one, and why is the 'Rails just falls away' (https://www.youtube.com/watch?v=tg5RFeSfBM4) threat so discomforting to web framework builders. How can we make 'ASP.NET just fall away'.\r\n\r\nIn this presentation we will look at the Layered Architectural style - when we would want to use one (as opposed to the alternatives) and when it is appropriate how to implement one. We will look at how to implement the Ports & Adapters (Hexagonal's 'proper' name) style, explaining what the different layers are. \r\n\r\nWe will look at the value the command pattern for implementing our ports , explain why Netflix uses it in Hystrix for reliability. On the way we will discuss Retry, Timeout and Circuit Breaker and explain how we can do better than Hystrix with a Command Dispatcher and Command Processor.\r\n\r\nWe'll show code throughout, including a look at the Paramore. Brighter framework, an OSS version of the platform we use at Huddle to build this kind of architecture.\r\n\r\nAs a bonus we will round off showing you how easy it is go from sync to async with this approach.\r\n",
- "FullDescription": "The term 'hexagonal architecture' has come back and forth in popularity since Alistair Cockburn first mooted it, with the Rails community's recent soul searching over its importance or threat just the latest. So what is a hexagonal architecture, why might you want to use one, and why is the 'Rails just falls away' (https://www.youtube.com/watch?v=tg5RFeSfBM4) threat so discomforting to web framework builders. How can we make 'ASP.NET just fall away'.\r\n\r\nIn this presentation we will look at the Layered Architectural style - when we would want to use one (as opposed to the alternatives) and when it is appropriate how to implement one. We will look at how to implement the Ports & Adapters (Hexagonal's 'proper' name) style, explaining what the different layers are. \r\n\r\nWe will look at the value the command pattern for implementing our ports , explain why Netflix uses it in Hystrix for reliability. On the way we will discuss Retry, Timeout and Circuit Breaker and explain how we can do better than Hystrix with a Command Dispatcher and Command Processor.\r\n\r\nWe'll show code throughout, including a look at the Paramore. Brighter framework, an OSS version of the platform we use at Huddle to build this kind of architecture.\r\n\r\nAs a bonus we will round off showing you how easy it is go from sync to async with this approach.\r\n"
- },
- {
- "Id": 13,
- "DDDEventId": 1,
- "TrackId": 3,
- "TimeSlotId": 7,
- "Title": "Performance is a Feature!",
- "Speaker": "Matt Warren",
- "SpeakerId": 2316,
- "ShortDescription": "Starting with the premise that *\"Performance is a Feature\"*, this session will look at how to measure, what to measure and how get the best performance from your .NET code. We will look at real-world examples from the Roslyn code-base, StackOverflow and my personal experience of trying (but ultimately failing) to break a world record.",
- "FullDescription": "Starting with the premise that *\"Performance is a Feature\"*, this session will look at how to measure, what to measure and how get the best performance from your .NET code. We will look at real-world examples from the Roslyn code-base, StackOverflow and my personal experience of trying (but ultimately failing) to break a world record."
- },
- {
- "Id": 14,
- "DDDEventId": 1,
- "TrackId": 4,
- "TimeSlotId": 7,
- "Title": "All your types are belong to us!",
- "Speaker": "Phillip Trelford",
- "SpeakerId": 34,
- "ShortDescription": "Big Data tasks typically require acquiring and analysing data from a wide variety of data sources, visualizing the data and applying a barrage of statistical algorithms. This talk will show how this can be accomplished in Visual Studio on Windows or Xamarin Studio on Mac and Linux using F#'s REPL and Type Providers. \r\nType Providers give typed access to a wide range of data sources from CSV, JSON and XML to SQL, OData and Web Services, instantly without a code generation step. The Type Provider mechanism can also be used to analyse data with direct access to statistical packages like R and MATLAB as well as all the existing .Net libraries.\r\nFinally visualizations can be generated using F#'s desktop charting libraries, or with ASP.Net and even JavaScript libraries like HighCharts.\r\nExpect a sprinkling of anecdotes drawn from experiences working on large machine learning systems at Microsoft, and plenty of live demos.",
- "FullDescription": "Big Data tasks typically require acquiring and analysing data from a wide variety of data sources, visualizing the data and applying a barrage of statistical algorithms. This talk will show how this can be accomplished in Visual Studio on Windows or Xamarin Studio on Mac and Linux using F#'s REPL and Type Providers. \r\nType Providers give typed access to a wide range of data sources from CSV, JSON and XML to SQL, OData and Web Services, instantly without a code generation step. The Type Provider mechanism can also be used to analyse data with direct access to statistical packages like R and MATLAB as well as all the existing .Net libraries.\r\nFinally visualizations can be generated using F#'s desktop charting libraries, or with ASP.Net and even JavaScript libraries like HighCharts.\r\nExpect a sprinkling of anecdotes drawn from experiences working on large machine learning systems at Microsoft, and plenty of live demos."
- },
- {
- "Id": 15,
- "DDDEventId": 1,
- "TrackId": 5,
- "TimeSlotId": 7,
- "Title": "DDD: Disney Driven Development",
- "Speaker": "Melinda Seckington",
- "SpeakerId": 3320,
- "ShortDescription": "Disney parks are built using their Four Keys of The Kingdom: Safety, Courtesy, Show and Efficiency. This talk will show examples of how Disney have applied these four keys everywhere in their parks and how we can extend those principles to our work as web developers.",
- "FullDescription": "Disney parks are built using their Four Keys of The Kingdom: Safety, Courtesy, Show and Efficiency. This talk will show examples of how Disney have applied these four keys everywhere in their parks and how we can extend those principles to our work as web developers."
- },
- {
- "Id": 16,
- "DDDEventId": 1,
- "TrackId": 1,
- "TimeSlotId": 9,
- "Title": "The vNext Big Thing",
- "Speaker": "Mark Rendle",
- "SpeakerId": 48,
- "ShortDescription": "At TechEd this year, various Scotts and a David announced ASP.NET vNext, the biggest thing to happen to the Microsoft web developers story since ASP.NET 1.0.\r\n\r\nIt's a moving target, so I can't say exactly what the talk will include, but I can guarantee it will cover:\r\n\r\n- The Core CLR, the K Runtime, and the project.json file\r\n- How Roslyn fits into the story\r\n- What (and why) OWIN is, and how to write middleware for it\r\n- The merging of MVC and Web API into a single, streamlined, uber-framework\r\n- Why I'm never going to finish Simple.Web\r\n\r\nLook, it's all awesome. Just come and see.",
- "FullDescription": "At TechEd this year, various Scotts and a David announced ASP.NET vNext, the biggest thing to happen to the Microsoft web developers story since ASP.NET 1.0.\r\n\r\nIt's a moving target, so I can't say exactly what the talk will include, but I can guarantee it will cover:\r\n\r\n- The Core CLR, the K Runtime, and the project.json file\r\n- How Roslyn fits into the story\r\n- What (and why) OWIN is, and how to write middleware for it\r\n- The merging of MVC and Web API into a single, streamlined, uber-framework\r\n- Why I'm never going to finish Simple.Web\r\n\r\nLook, it's all awesome. Just come and see."
- },
- {
- "Id": 17,
- "DDDEventId": 1,
- "TrackId": 2,
- "TimeSlotId": 9,
- "Title": "NServiceBus: introduction to a message based distributed architecture",
- "Speaker": "Mauro Servienti",
- "SpeakerId": 309,
- "ShortDescription": "SOA and distributed had been buzzwords for a long time, a message based architecture that embrace the SOA principles is the real solution to a scalable and distributed environment where HA or/and temporal decoupling are a must.\r\nIn this session we will introduce messaging concepts and see how NServiceBus, a powerfull toolkit to rule all the aspects of a messaging transport, can dramatically simplify the development process.",
- "FullDescription": "SOA and distributed had been buzzwords for a long time, a message based architecture that embrace the SOA principles is the real solution to a scalable and distributed environment where HA or/and temporal decoupling are a must.\r\nIn this session we will introduce messaging concepts and see how NServiceBus, a powerfull toolkit to rule all the aspects of a messaging transport, can dramatically simplify the development process."
- },
- {
- "Id": 18,
- "DDDEventId": 1,
- "TrackId": 3,
- "TimeSlotId": 9,
- "Title": "Keeping it responsive - cross-platform MVVM with ReactiveUI",
- "Speaker": "Sam Hogarth",
- "SpeakerId": 2314,
- "ShortDescription": "Building an awesome user interface is hard work. You've got the complexities of real life to deal with - handling user inputs, dealing with slow network connections and managing background workers. There's also this testing thing that people keep going on about!\r\n\r\nWe need a way of handling the real world, whilst behaving in a predictable and responsive manner. Enter ReactiveUI, a fusion of MVVM and the Reactive Extensions (Rx) for .NET applications.\r\n\r\nIn this session I'll introduce ReactiveUI, show you some tips and tricks, discuss the benefits and tradeoffs of the framework and show how it can be used as a solid foundation for building cross-platform .NET applications.\r\n\r\n",
- "FullDescription": "Building an awesome user interface is hard work. You've got the complexities of real life to deal with - handling user inputs, dealing with slow network connections and managing background workers. There's also this testing thing that people keep going on about!\r\n\r\nWe need a way of handling the real world, whilst behaving in a predictable and responsive manner. Enter ReactiveUI, a fusion of MVVM and the Reactive Extensions (Rx) for .NET applications.\r\n\r\nIn this session I'll introduce ReactiveUI, show you some tips and tricks, discuss the benefits and tradeoffs of the framework and show how it can be used as a solid foundation for building cross-platform .NET applications.\r\n\r\n"
- },
- {
- "Id": 19,
- "DDDEventId": 1,
- "TrackId": 4,
- "TimeSlotId": 9,
- "Title": "A Brief Introduction to Making your own (Internet of Things) Thing.",
- "Speaker": "Stephen Harrison",
- "SpeakerId": 4328,
- "ShortDescription": "The Internet of Things is exploding and it's a great time to join in: more and more devices like the Arduino, Netduino and Gadgeteer are becoming available. The question is, how do I get started?\r\n\r\nWe will look at what is available in terms of popular hardware for building your Thing, and a demo of how to develop for the Arduino, followed by an introduction to the Gadgeteer and .Net Micro Framework, hopefully finishing up with a fairly simple but connected Gadgeteer based Thing (Wifi Allowing!).\r\n",
- "FullDescription": "The Internet of Things is exploding and it's a great time to join in: more and more devices like the Arduino, Netduino and Gadgeteer are becoming available. The question is, how do I get started?\r\n\r\nWe will look at what is available in terms of popular hardware for building your Thing, and a demo of how to develop for the Arduino, followed by an introduction to the Gadgeteer and .Net Micro Framework, hopefully finishing up with a fairly simple but connected Gadgeteer based Thing (Wifi Allowing!).\r\n"
- },
- {
- "Id": 20,
- "DDDEventId": 1,
- "TrackId": 5,
- "TimeSlotId": 9,
- "Title": "Data Science for Fun and Profit",
- "Speaker": "Gary Short",
- "SpeakerId": 30,
- "ShortDescription": "Make no mistake, data science can be hard, but it can also be fun. In this session I'll introduce you to Classic and Bayesian Statistics and Machine Learning, all through the medium of predicting horse racing results. We'll explore a number of techniques for making such predictions and we'll finish by combining them into a powerful \"mixed model\" prediction engine, that's sure to pick the next big winner. This session won't only improve your knowledge, it'll improve your bank balance too! Note: probably won't do the latter though. :-)",
- "FullDescription": "Make no mistake, data science can be hard, but it can also be fun. In this session I'll introduce you to Classic and Bayesian Statistics and Machine Learning, all through the medium of predicting horse racing results. We'll explore a number of techniques for making such predictions and we'll finish by combining them into a powerful \"mixed model\" prediction engine, that's sure to pick the next big winner. This session won't only improve your knowledge, it'll improve your bank balance too! Note: probably won't do the latter though. :-)"
- },
- {
- "Id": 21,
- "DDDEventId": 1,
- "TrackId": 1,
- "TimeSlotId": 11,
- "Title": "Architecture - why so serious?",
- "Speaker": "Barbara Fusinska",
- "SpeakerId": 3322,
- "ShortDescription": "What comes to developer's mind when he hears the phrase 'software architecture'? Is it clean design or rather heavy and unusable overhead? Nowadays there are many approaches to follow while building the software, but they often sound to pompous and lead to overcomplicating things. Programmers refuse to consider them, when all they need is making some simple functionalities work. They hear the word architecture and they get uptight in seconds. And that's not how it's supposed to be. Good practices should help, not introduce unnecessary problems and disturbance.\r\n\r\nWhat if thinking about architecture doesn't make the software too heavy and introduces actual value? What if some of its concepts could be used easily, even in non complex projects, simplifying the process of creation at the same time?\r\n\r\nThe talk is to illustrate how architecture is not about ivory towers, but actual coding, and on what those coding architects should do. It will center on showing some habits developed through years of building different kinds of software systems. Using them can help reducing work, while focusing on what's most important - getting the job done that brings concrete value to the client. It will be demonstrated by real (but simple in the same time) code and fully functional web application. One that can be used as an outline for further usage, as patterns to apply. Presented examples will highlight power of more abstract approach, but in the same time will consider hands on code.",
- "FullDescription": "What comes to developer's mind when he hears the phrase 'software architecture'? Is it clean design or rather heavy and unusable overhead? Nowadays there are many approaches to follow while building the software, but they often sound to pompous and lead to overcomplicating things. Programmers refuse to consider them, when all they need is making some simple functionalities work. They hear the word architecture and they get uptight in seconds. And that's not how it's supposed to be. Good practices should help, not introduce unnecessary problems and disturbance.\r\n\r\nWhat if thinking about architecture doesn't make the software too heavy and introduces actual value? What if some of its concepts could be used easily, even in non complex projects, simplifying the process of creation at the same time?\r\n\r\nThe talk is to illustrate how architecture is not about ivory towers, but actual coding, and on what those coding architects should do. It will center on showing some habits developed through years of building different kinds of software systems. Using them can help reducing work, while focusing on what's most important - getting the job done that brings concrete value to the client. It will be demonstrated by real (but simple in the same time) code and fully functional web application. One that can be used as an outline for further usage, as patterns to apply. Presented examples will highlight power of more abstract approach, but in the same time will consider hands on code."
- },
- {
- "Id": 22,
- "DDDEventId": 1,
- "TrackId": 2,
- "TimeSlotId": 11,
- "Title": "What Developers Need To Know About Visual Design ",
- "Speaker": "Ben Hall",
- "SpeakerId": 3319,
- "ShortDescription": "The world has become a very design sensitive meaning its now even more critical that developers build products that look amazing. Sadly frameworks like twitters bootstrap can only take us so far and even with designers on the team developers need to understand the key principals of good design to make effective decisions.\r\n\r\nIn this session Ben will explore the five key topics around design that can make or break an application and website. The key topics are Layout and the golden ratio, Typography, Imaginary, Colours and User Feedback. With these topics attendees will come away with a deeper understanding about why certain elements look good while others dont and what developers really should know about design. It will explore the cognitive science and research to move beyond personal options about design to data and research driven insights.\r\n",
- "FullDescription": "The world has become a very design sensitive meaning its now even more critical that developers build products that look amazing. Sadly frameworks like twitters bootstrap can only take us so far and even with designers on the team developers need to understand the key principals of good design to make effective decisions.\r\n\r\nIn this session Ben will explore the five key topics around design that can make or break an application and website. The key topics are Layout and the golden ratio, Typography, Imaginary, Colours and User Feedback. With these topics attendees will come away with a deeper understanding about why certain elements look good while others dont and what developers really should know about design. It will explore the cognitive science and research to move beyond personal options about design to data and research driven insights.\r\n"
- },
- {
- "Id": 23,
- "DDDEventId": 1,
- "TrackId": 3,
- "TimeSlotId": 11,
- "Title": "Using F# for Line of Business Applications",
- "Speaker": "Ian Russell",
- "SpeakerId": 53,
- "ShortDescription": "C# is a great language for developing Line of Business applications but F# is even better! If you want to write code that expresses your requirements clearly, ensures correctness and supports rapid, and fun, development then guess what, F# does all that and more!\r\n\r\nNo prior experience of F# is necessary for this session but be warned, once you've seen what F# can do, you won't want to go back to C#!",
- "FullDescription": "C# is a great language for developing Line of Business applications but F# is even better! If you want to write code that expresses your requirements clearly, ensures correctness and supports rapid, and fun, development then guess what, F# does all that and more!\r\n\r\nNo prior experience of F# is necessary for this session but be warned, once you've seen what F# can do, you won't want to go back to C#!"
- },
- {
- "Id": 24,
- "DDDEventId": 1,
- "TrackId": 4,
- "TimeSlotId": 11,
- "Title": "Scream if you want to go faster: speed up .NET and SQL Server web apps",
- "Speaker": "Bart Read",
- "SpeakerId": 5553,
- "ShortDescription": "We all know that websites need to be fast. But how do you juice up creaking web apps that have been around for a while without deploying the thermonuclear option (i.e., the costly and much-maligned ground-up rewrite)?\r\n\r\nUnfortunately this can still prove tricky, especially when the issues lie in the database layer. Help is at hand though: Ill show you the techniques that will help you hunt down performance problems in your database, and relate them back to your .NET code. But that's only half the story: we'll also talk about the strategies you can use to fix them from the relatively simple, to the much more involved.\r\n\r\nYou should leave with an arsenal of optimisation tricks for every occasion!",
- "FullDescription": "We all know that websites need to be fast. But how do you juice up creaking web apps that have been around for a while without deploying the thermonuclear option (i.e., the costly and much-maligned ground-up rewrite)?\r\n\r\nUnfortunately this can still prove tricky, especially when the issues lie in the database layer. Help is at hand though: Ill show you the techniques that will help you hunt down performance problems in your database, and relate them back to your .NET code. But that's only half the story: we'll also talk about the strategies you can use to fix them from the relatively simple, to the much more involved.\r\n\r\nYou should leave with an arsenal of optimisation tricks for every occasion!"
- },
- {
- "Id": 25,
- "DDDEventId": 1,
- "TrackId": 5,
- "TimeSlotId": 11,
- "Title": "Build Great Software for the Enterprise and Love it",
- "Speaker": "Kendall Miller",
- "SpeakerId": 4331,
- "ShortDescription": "You want to write great code - taking the time to create an application that is cleanly written, easy to test, performs well, and delights users. Your company wants it done yesterday. **How do you get the time and budget you need to build it right instead of just pounding out the next feature**?\r\n\r\nIn this talk, we'll cover how to:\r\n\r\n 1. Never skip coded tests again.\r\n 2. Communicate security risks effectively so your business isn't the next Target.\r\n 3. Pay down technical debt while delivering the features your users are waiting for.\r\n\r\nSound incredible? Come to the talk to find out how you can go home happy with the work you've done each day, even in an enterprise.",
- "FullDescription": "You want to write great code - taking the time to create an application that is cleanly written, easy to test, performs well, and delights users. Your company wants it done yesterday. **How do you get the time and budget you need to build it right instead of just pounding out the next feature**?\r\n\r\nIn this talk, we'll cover how to:\r\n\r\n 1. Never skip coded tests again.\r\n 2. Communicate security risks effectively so your business isn't the next Target.\r\n 3. Pay down technical debt while delivering the features your users are waiting for.\r\n\r\nSound incredible? Come to the talk to find out how you can go home happy with the work you've done each day, even in an enterprise."
- }
- ]
-}
diff --git a/BeyondResponsiveDesign.Menus/content/contact.html b/BeyondResponsiveDesign.Menus/content/contact.html
deleted file mode 100644
index 0bfdede..0000000
--- a/BeyondResponsiveDesign.Menus/content/contact.html
+++ /dev/null
@@ -1,20 +0,0 @@
-
-
-
-
- Contacting DDD East Anglia
-
-
-
-
-
diff --git a/BeyondResponsiveDesign.Menus/content/home.html b/BeyondResponsiveDesign.Menus/content/home.html
deleted file mode 100644
index ecf4810..0000000
--- a/BeyondResponsiveDesign.Menus/content/home.html
+++ /dev/null
@@ -1,74 +0,0 @@
-
-
-
-
- Welcome to DDD East Anglia!
-
-
-
-
- DDD East Anglia will be returning to Cambridge on Saturday 13 September 2014 at Cambridge University's West Road Concert Hall.
- Like all DDD community events, DDD East Anglia is free
- to attend, funded entirely through the generosity of our sponsors.
-
-
- Take a look around the site to whet your appetite for what will be a fantastic event!
- Why not follow us on Twitter to get all the latest news and updates?
-
-
-
-
-
- About DDD East Anglia
-
-
-
-
- Developer! Developer! Developer! (DDD) East Anglia is the newest event in the popular series of
- Developer Days events for the UK .NET Community that have run since May 2005. Although each DDD
- event has its own particular "flavour", they remain immensely popular and enjoyable, regularly
- attracting 200-300 attendees and often selling out within minutes.
-
-
- DDD events were started on the following five principles, which we intend to adhere to in their spirit:
-
-
- For the community by the community
- Free to attend
- Held on a Saturday or non-work day
- No Microsoft speakers (with some exceptions)
- Grow the local speaker community
-
-
- Sessions are submitted by members of the community and selected by attendees. Microsoft speakers are generally not permitted
- to speak at DDD events, but the exceptions to this rule are Microsoft employees who are active members
- of the UK .NET community. In short, these are sessions crafted by developers for
- developers, with no sales pitches allowed!
-
-
-
-
-
- How is the agenda decided?
-
-
-
-
- DDD events are unique in that the conference is made by its attendees .
- Sessions are submitted by members of the UK .NET developer community (i.e. you can submit a session
- if you want to), and are voted on by prospective attendees (i.e. you) before registration opens. The
- organisers of DDD events use the results of the voting to determine which sessions are most popular,
- and so which will make for the best event for attendees.
-
-
- The results of voting are weighted to uphold the five principles of DDD events, so we will favour new
- and local speakers over established speakers or speakers from a more remote geographical location.
-
-
-
\ No newline at end of file
diff --git a/BeyondResponsiveDesign.Menus/content/sessions.html b/BeyondResponsiveDesign.Menus/content/sessions.html
deleted file mode 100644
index 3c68a21..0000000
--- a/BeyondResponsiveDesign.Menus/content/sessions.html
+++ /dev/null
@@ -1,13 +0,0 @@
-
-
-
-
-
- Welcome to DDD East Anglia!
-
-
-
-
-
\ No newline at end of file
diff --git a/BeyondResponsiveDesign.Menus/content/speakerdetail.html b/BeyondResponsiveDesign.Menus/content/speakerdetail.html
deleted file mode 100644
index ccb7c2b..0000000
--- a/BeyondResponsiveDesign.Menus/content/speakerdetail.html
+++ /dev/null
@@ -1,51 +0,0 @@
-
-
\ No newline at end of file
diff --git a/BeyondResponsiveDesign.Menus/content/speakers.html b/BeyondResponsiveDesign.Menus/content/speakers.html
deleted file mode 100644
index 4c92b96..0000000
--- a/BeyondResponsiveDesign.Menus/content/speakers.html
+++ /dev/null
@@ -1,36 +0,0 @@
-
-
-
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/BeyondResponsiveDesign.Menus/content/speakers.json b/BeyondResponsiveDesign.Menus/content/speakers.json
deleted file mode 100644
index e4183e8..0000000
--- a/BeyondResponsiveDesign.Menus/content/speakers.json
+++ /dev/null
@@ -1,497 +0,0 @@
-[
- {
- "Id":3324,
- "Name":" Adam Kosinski",
- "Bio":"Journeyman, developer, craftsman, currently coding C# in London. Interested in just about anything, excelling at discussions over code, beer and pizza.
\n",
- "Links":[
- {
- "Icon":"fa-twitter",
- "Url":"http://twitter.com/adk0s"
- }
- ],
- "Sessions":[
- {
- "Id":2117,
- "Title":"A Unit Testing Swiss Army Knife",
- "Abstract":"\r\n Putting all of #IsTddDeadOrNotQuiteYet discussion aside, there are a lot of things to be said about more technical side of writing tests. Instead of big important questions like \"How\" or \"Why\", I would like to present you a couple of tricks, patterns and libraries that help in what is usually of secondary interest - readability, maintainability.
\n\nThe leading motive for this talk will be approaching our tests like living documentation - and what we can possibly do to make it better.
\n\nSo, have you ever wondered what is Bulider Pattern about? What is all the fuss in being \"fluent\"? Or maybe you wondered if you can effectively integration test you MVC app? I hope you will find useful learning this, and some more.
\n\r\n"
- }
- ]
- },
- {
- "Id":2312,
- "Name":" Alessandro Melchiori",
- "Bio":"Software craftsman, husband, father, ex-sportsman and inquiring reader. Since I was young I have loved taking apart and reassembling things to understand how they work. Now, this passion has become my job: the step from Lego to software development was small.
\n\nFinding the best possible solution so that a complex system can work at its best and making it run smoothly are the goals of my work. C#, WCF, ESB, MongoDb and Azure make up my survival toolkit and help me cruise through distributed systems and enterprise solutions, with ease.
\n\nBe it a command or an event, I try to do my best in contributing to the life of the communities that have adopted me (ugidotnet and webdebs), trying to “give back” at least a part of what I have received over these years.
\n",
- "Links":[
- {
- "Icon":"fa-globe",
- "Url":"http://codiceplastico.com"
- },
- {
- "Icon":"fa-twitter",
- "Url":"http://twitter.com/amelchiori"
- }
- ],
- "Sessions":[
- {
- "Id":1108,
- "Title":"Functional DDD",
- "Abstract":"\r\n Very often we approach, more or less unconsciously, DDD's principles only with object-oriented paradigm, without exploring if other \"style\" can live better with aggregates, value objects, commands and domain events. Well, yes: there is 'other' out there... \nIn this session we will see how a functional language as F# can lead to a more intuitive and compact implementation of our domains.
\n\r\n"
- }
- ]
- },
- {
- "Id":293,
- "Name":" Anthony Brown",
- "Bio":"",
- "Links":[
- {
- "Icon":"fa-twitter",
- "Url":"http://twitter.com/bruinbrown93"
- }
- ],
- "Sessions":[
- {
- "Id":2107,
- "Title":"Building Skynet: Machine learning for software developers",
- "Abstract":"\r\n How does Netflix know that I'd like that new movie which just released? How does Google know which ads to serve to me? How do games like Halo and Titanfall put me in game lobbies to create even matches? All these questions are answered with machine learning algorithms. Machine learning can sometimes look difficult. This session aims to break down the barrier to entry for machine learning and show how powerful even the most simple algorithms can be. Expect plenty of sample code to show just how quick and easy these basic algorithms can be.
\n\r\n"
- }
- ]
- },
- {
- "Id":3322,
- "Name":" Barbara Fusinska",
- "Bio":"Developer, architect, problem solver. \nStrongly believes in team work and providing the best environment to help people reach their potential to the fullest.\nEnjoys designing beautiful system architectures using good practices, patterns and a great deal of common sense.
\n",
- "Links":[
- {
- "Icon":"fa-globe",
- "Url":"http://barbarafusinska.com/"
- },
- {
- "Icon":"fa-twitter",
- "Url":"http://twitter.com/basiafusinska"
- }
- ],
- "Sessions":[
- {
- "Id":4133,
- "Title":"Architecture - why so serious?",
- "Abstract":"\r\n What comes to developer's mind when he hears the phrase 'software architecture'? Is it clean design or rather heavy and unusable overhead? Nowadays there are many approaches to follow while building the software, but they often sound to pompous and lead to overcomplicating things. Programmers refuse to consider them, when all they need is making some simple functionalities work. They hear the word architecture and they get uptight in seconds. And that's not how it's supposed to be. Good practices should help, not introduce unnecessary problems and disturbance.
\n\nWhat if thinking about architecture doesn't make the software too heavy and introduces actual value? What if some of its concepts could be used easily, even in non complex projects, simplifying the process of creation at the same time?
\n\nThe talk is to illustrate how architecture is not about ivory towers, but actual coding, and on what those coding architects should do. It will center on showing some habits developed through years of building different kinds of software systems. Using them can help reducing work, while focusing on what's most important - getting the job done that brings concrete value to the client. It will be demonstrated by real (but simple in the same time) code and fully functional web application. One that can be used as an outline for further usage, as patterns to apply. Presented examples will highlight power of more abstract approach, but in the same time will consider hands on code.
\n\r\n"
- }
- ]
- },
- {
- "Id":5333,
- "Name":" Bart Read",
- "Bio":"",
- "Links":[
- {
- "Icon":"fa-globe",
- "Url":"http://www.bartread.com"
- },
- {
- "Icon":"fa-twitter",
- "Url":"http://twitter.com/bart_read"
- }
- ],
- "Sessions":[
- {
- "Id":4135,
- "Title":"Scream if you want to go faster: speed up .NET and SQL Server web apps",
- "Abstract":"\r\n We all know that websites need to be fast. But how do you juice up creaking web apps that have been around for a while without deploying the thermonuclear option (i.e., the costly and much-maligned ground-up rewrite)?
\n\nUnfortunately this can still prove tricky, especially when the issues lie in the database layer. Help is at hand though: I’ll show you the techniques that will help you hunt down performance problems in your database, and relate them back to your .NET code. But that's only half the story: we'll also talk about the strategies you can use to fix them from the relatively simple, to the much more involved.
\n\nYou should leave with an arsenal of optimisation tricks for every occasion!
\n\r\n"
- }
- ]
- },
- {
- "Id":3319,
- "Name":" Ben Hall",
- "Bio":"Performed the rounds as a tester, developer, speaker, freelancer & startup entrepreneur. Currently working on the next venture
\n",
- "Links":[
- {
- "Icon":"fa-globe",
- "Url":"http://www.ocelotuproar.com"
- },
- {
- "Icon":"fa-twitter",
- "Url":"http://twitter.com/ben_hall"
- }
- ],
- "Sessions":[
- {
- "Id":2111,
- "Title":"What Developers Need To Know About Visual Design ",
- "Abstract":"\r\n The world has become a very design sensitive meaning it’s now even more critical that developers build products that look amazing. Sadly frameworks like twitter’s bootstrap can only take us so far and even with designers on the team developers need to understand the key principals of good design to make effective decisions.
\n\nIn this session Ben will explore the five key topics around design that can make or break an application and website. The key topics are Layout and the golden ratio, Typography, Imaginary, Colours and User Feedback. With these topics attendees will come away with a deeper understanding about why certain elements look good while others don’t and what developers really should know about design. It will explore the cognitive science and research to move beyond personal options about design to data and research driven insights.
\n\r\n"
- }
- ]
- },
- {
- "Id":302,
- "Name":" Chris Canal",
- "Bio":"",
- "Links":[
-
- ],
- "Sessions":[
- {
- "Id":102,
- "Title":"Super charging your JavaScript development experience",
- "Abstract":"\r\n With the release of V8 and subsequently NodeJs, JavaScript has started to grow up. In this session we will look at how you can super charge your JavaScript development lifecycle and deliver better written, cleaner and more coherent JavaScript with and without VisualStudio
\n\nWe will look at the many awesome frameworks for infrastructural support when developing JavaScript applications like Yeoman, Gulp, grunt, Browserfy and a few other handy libraries
\n\r\n"
- }
- ]
- },
- {
- "Id":11,
- "Name":" David Simner",
- "Bio":"I started playing with computers when I stuffed sweets into my parents' floppy disk drive when I was 5. They weren't happy. When I was 10, I progressed onto something much more fun: coding!
\n\nAfter a brief stint pretending to be an academic, I returned to what I love. For the past 5 years I've been a software developer at Red Gate.
\n\nThere have been lots of mistakes and learning along the way, but that’s what makes it fun: I now know that “Minimally Viable” includes writing the clean-up code, because otherwise you’ll spend nearly a grand on Amazon S3 before anybody notices; luckily my boss was forgiving.
\n\nIn my spare time I try to convince my train-obsessed friends to give up their obsession, and despite claiming not to be able to cook, I “product manage” my partner's Fair Trade Cook Book website.
\n",
- "Links":[
- {
- "Icon":"fa-globe",
- "Url":"http://www.davidsimner.me.uk/"
- }
- ],
- "Sessions":[
- {
- "Id":4124,
- "Title":"OWIN, Katana and ASP.NET vNext: eliminating the pain of IIS",
- "Abstract":"\r\n I first encountered OWIN when I added SignalR to a legacy ASP.NET MVC app, and had to write a piece of OWIN middleware to get SignalR to play nicely with our legacy authentication.
\n\nIt was a thoroughly impressive experience, so I built my next greenfield project on OWIN & Katana as a single-page app using static files & Web API, finally ditching IIS for good. The glad tidings continue for Microsoft web developers, with ASP.NET vNext promising even more goodness on the horizon.
\n\nThere’s a lot of changes coming for those of us working on the .NET web stack, so this talk will show you what things look like today:
\n\n\nWhat are OWIN & Katana, and why you should care \nWhat middleware is, as well as why and how you write it \nThe advantages this brings for testing \nHow Helios lets you host on IIS (if you really really really want to) \n \n\nAs well as what's changing in ASP.NET vNext:
\n\n\nHow Roslyn comes into play \nThe what and the why of the K runtime \nWhy you should care about the Core CLR \nWhat’s shiny about ASP.NET MVC 6 \n \n\nThere’s a lot to cover, so we’ll move fast. You'll come away knowing why and how you should start using this on your own projects.
\n\r\n"
- }
- ]
- },
- {
- "Id":303,
- "Name":" Forbes Lindesay",
- "Bio":"Node.js enthusiast, open source contributor and maintainer of the Jade templating language..
\n",
- "Links":[
- {
- "Icon":"fa-globe",
- "Url":"http://www.forbeslindesay.co.uk/"
- },
- {
- "Icon":"fa-twitter",
- "Url":"http://twitter.com/ForbesLindesay"
- }
- ],
- "Sessions":[
- {
- "Id":104,
- "Title":"GitHub Automation",
- "Abstract":"\r\n GitHub has one of the best REST APIs you'll ever see. Pretty much any task in GitHub can be automated. Tired of updating code after a feature gets deprecated? Write a bot for that. Need to add the repository field to all your package.json files? Script it. You can even use GitHub as the backend for an entire application to take advantage of its built in collaboration features. This talk will take you through how to write you own GitHub automation code in JavaScript and give you some ideas on how to use your new-found powers for good.
\n\r\n"
- }
- ]
- },
- {
- "Id":30,
- "Name":" Gary Short",
- "Bio":"Gary Short is the Head of Gibraltar Labs, a skunk works division of Gibraltar software. He is a Microsoft MVP in C# as well as being a Node.js and Python hacker. Gary is a popular speaker giving presentations at conferences and user groups throughout the UK, Europe and the US, mainly on his pet subjects of Social Network Analysis, Big Data and Data Science
\n",
- "Links":[
- {
- "Icon":"fa-twitter",
- "Url":"http://twitter.com/garyshort"
- }
- ],
- "Sessions":[
- {
- "Id":3127,
- "Title":"Data Science for Fun and Profit",
- "Abstract":"\r\n Make no mistake, data science can be hard, but it can also be fun. In this session I'll introduce you to Classic and Bayesian Statistics and Machine Learning, all through the medium of predicting horse racing results. We'll explore a number of techniques for making such predictions and we'll finish by combining them into a powerful \"mixed model\" prediction engine, that's sure to pick the next big winner. This session won't only improve your knowledge, it'll improve your bank balance too! Note: probably won't do the latter though. :-)
\n\r\n"
- }
- ]
- },
- {
- "Id":2311,
- "Name":" Ian Cooper",
- "Bio":"Ian Cooper has over 20 years of experience delivering Microsoft platform solutions in government, healthcare, and finance. During that time he has worked for the DTI, Reuters, Sungard, Misys, Beazley, and Huddle delivering everything from bespoke enterprise solutions, 'shrink-wrapped' products, and cloud services to thousands of customers. Ian is a passionate exponent of Software Craftsmanship and Agile Architecture. When he is not writing code he is also the and founder of the London .NET user group and speaks at events throughout the UK.
\n",
- "Links":[
- {
- "Icon":"fa-twitter",
- "Url":"http://twitter.com/ICooper"
- }
- ],
- "Sessions":[
- {
- "Id":1107,
- "Title":"Decoupling from ASP.NET - Hexagonal Architectures in .NET",
- "Abstract":"\r\n The term 'hexagonal architecture' has come back and forth in popularity since Alistair Cockburn first mooted it, with the Rails community's recent soul searching over its importance or threat just the latest. So what is a hexagonal architecture, why might you want to use one, and why is the 'Rails just falls away' (https://www.youtube.com/watch?v=tg5RFeSfBM4) threat so discomforting to web framework builders. How can we make 'ASP.NET just fall away'.
\n\nIn this presentation we will look at the Layered Architectural style - when we would want to use one (as opposed to the alternatives) and when it is appropriate how to implement one. We will look at how to implement the Ports & Adapters (Hexagonal's 'proper' name) style, explaining what the different layers are.
\n\nWe will look at the value the command pattern for implementing our ports , explain why Netflix uses it in Hystrix for reliability. On the way we will discuss Retry, Timeout and Circuit Breaker and explain how we can do better than Hystrix with a Command Dispatcher and Command Processor.
\n\nWe'll show code throughout, including a look at the Paramore. Brighter framework, an OSS version of the platform we use at Huddle to build this kind of architecture.
\n\nAs a bonus we will round off showing you how easy it is go from sync to async with this approach.
\n\r\n"
- }
- ]
- },
- {
- "Id":53,
- "Name":" Ian Russell",
- "Bio":"Experienced provider of simplicity, order and common-sense to complex OLTP solutions. Passionate about learning from others and giving back to the community. Paid to write C# and SQL, lover of F#, node.js and NoSql.
\n",
- "Links":[
- {
- "Icon":"fa-globe",
- "Url":"http://ijrussell.tumblr.com"
- },
- {
- "Icon":"fa-twitter",
- "Url":"http://twitter.com/ijrussell"
- }
- ],
- "Sessions":[
- {
- "Id":108,
- "Title":"Using F# for Line of Business Applications",
- "Abstract":"\r\n C# is a great language for developing Line of Business applications but F# is even better! If you want to write code that expresses your requirements clearly, ensures correctness and supports rapid, and fun, development then guess what, F# does all that and more!
\n\nNo prior experience of F# is necessary for this session but be warned, once you've seen what F# can do, you won't want to go back to C#!
\n\r\n"
- }
- ]
- },
- {
- "Id":23,
- "Name":" Joel Hammond-Turner",
- "Bio":"Joel works as a Technical Lead for Landmark, and is currently bringing his 20 years of experience of software development and a passion for both technology and elegance to designing a world-class applications for the property information and risk management sectors.
\n\nHe has presented sessions on using NuGet for enterprise software development at DDDSW 4.0 and DDDNorth 2 , and is responsible for the the open source NuGet.PackageNPublish tooling project.
\n\nOutside of work he referees life with his wife and three young children in a home with more computers than is probably wise, but is really looking forward to teaching his boys Python now they've mastered Scratch on their Raspberry Pi.
\n",
- "Links":[
- {
- "Icon":"fa-globe",
- "Url":"http://www.hammond-turner.org.uk"
- },
- {
- "Icon":"fa-twitter",
- "Url":"http://twitter.com/Rammesses"
- }
- ],
- "Sessions":[
- {
- "Id":3139,
- "Title":"So you want to be a Tech Lead? 10 things you need to do to succeed.",
- "Abstract":"\r\n \"Tech Lead\" is an amorphous job title - is it all about the technology, or all about leadership? What should the balance really be?
\n\nAnd it can also be a complex and thankless role too - particularly if you find yourself becoming the go-to guy (or gal) for everyone from the intern to the product manager.
\n\nIn this talk I'll cover (at least) 10 things that I think are essential to success in both areas, including how to address technical debt, herd your PMs and make sure your development team has a steady flow of work (and beer, pizza or other \"motivationals\").
\n\r\n"
- }
- ]
- },
- {
- "Id":4331,
- "Name":" Kendall Miller",
- "Bio":"Kendall Miller is one of the founding partners of Gibraltar Software, an Independent Software Vendor (ISV) that develops & markets commercial applications for .NET developers. Introduced commercially in 2009, Loupe is an application logging & monitoring platform that is currently used by customers around the world from individual consultants through Fortune 100 companies and governments.
\n\nBefore starting Gibraltar Software, Kendall worked for multiple startups leading their technology development from beginning through profitability. In each case he's focused on translating enterprise-level performance and capabilities down to smaller companies. Kendall has a B.S in Computer Engineering from the University of Illinois, Urbana-Champaign.
\n",
- "Links":[
- {
- "Icon":"fa-globe",
- "Url":"http://rocksolid.gibraltarsoftware.com"
- },
- {
- "Icon":"fa-twitter",
- "Url":"http://twitter.com/kendallmiller"
- }
- ],
- "Sessions":[
- {
- "Id":3129,
- "Title":"Build Great Software for the Enterprise and Love it",
- "Abstract":"\r\n You want to write great code - taking the time to create an application that is cleanly written, easy to test, performs well, and delights users. Your company wants it done yesterday. How do you get the time and budget you need to build it right instead of just pounding out the next feature ?
\n\nIn this talk, we'll cover how to:
\n\n\nNever skip coded tests again. \nCommunicate security risks effectively so your business isn't the next Target. \nPay down technical debt while delivering the features your users are waiting for. \n \n\nSound incredible? Come to the talk to find out how you can go home happy with the work you've done each day, even in an enterprise.
\n\r\n"
- }
- ]
- },
- {
- "Id":62,
- "Name":" Liam Westley",
- "Bio":"Liam Westley is an Application Architect at Huddle where he works with some of the best .Net developers and UX designers to deliver world class collaboration software. He quite likes working just off Old Street as there is some fantastic food and coffee to be had within a few minutes walk.
\n\nPrevious to Huddle Liam worked at Criteria MX, a digital media startup and has worked as a consultant via his own company Tiger Computer Services Ltd, specialising in software for Broadcast Television. His Niagara SMS moderation system was used by QVC UK for eight years to display SMS messages from viewers, live, on screen. Liam is also responsible for the ticketing system for Hat Trick Productions which provides e-tickets to shows such as Have I Got New For You and Room 101.
\n\nLiam has worked for chellomedia, GMTV, BSkyB, SmashedAtom and Original Thinking Group. In his time he created the first in house weather system for Sky News using Visual Basic 1.0, acted as architect for two general election systems, project managed the launch of the GMTV web site, was key to delivering the first interactive television chat service in the UK for BSkyB and helped launch the first live shopping channels in the Netherlands.
\n",
- "Links":[
- {
- "Icon":"fa-globe",
- "Url":"http://geekswithblogs.net/twickers"
- },
- {
- "Icon":"fa-twitter",
- "Url":"http://twitter.com/westleyl"
- }
- ],
- "Sessions":[
- {
- "Id":1109,
- "Title":"An Actor's Life for Me – An introduction to the TPL Dataflow Library and asynchronous programming blocks",
- "Abstract":"\r\n Every version of the .NET Framework has brought improvements to asynchronous and concurrent programming. While .NET 4.0 brought the async/await model which is useful for improving UI responses and server applications, it can sometimes still be tricky to marshal multiple threads within longer processing pipelines.
\n\nThe Dataflow Library consists of a Nuget package built on top of the Task Parallel Library (TPL). It harnesses the actor-based programming model to provide a set of dataflow blocks data structures that buffer and process data, which you can connect together to form custom pipelines with messages passed between the blocks.
\n\nBy using the Dataflow Library you can concentrate on the messages and actions being performed, while the blocks marshal the messages, provide concurrent message processing and buffering as well as supporting cancellation and exception handling.
\n\r\n"
- }
- ]
- },
- {
- "Id":48,
- "Name":" Mark Rendle",
- "Bio":"",
- "Links":[
-
- ],
- "Sessions":[
- {
- "Id":3125,
- "Title":"The vNext Big Thing",
- "Abstract":"\r\n At TechEd this year, various Scotts and a David announced ASP.NET vNext, the biggest thing to happen to the Microsoft web developers story since ASP.NET 1.0.
\n\nIt's a moving target, so I can't say exactly what the talk will include, but I can guarantee it will cover:
\n\n\nThe Core CLR, the K Runtime, and the project.json file \nHow Roslyn fits into the story \nWhat (and why) OWIN is, and how to write middleware for it \nThe merging of MVC and Web API into a single, streamlined, uber-framework \nWhy I'm never going to finish Simple.Web \n \n\nLook, it's all awesome. Just come and see.
\n\r\n"
- }
- ]
- },
- {
- "Id":2316,
- "Name":" Matt Warren",
- "Bio":"I'm a C# dev who loves nothing better than finding and fixing performance issues. I also contribute to RavenDB and wrote the .NET port of HdrHistogram .
\n",
- "Links":[
- {
- "Icon":"fa-globe",
- "Url":"http://www.mattwarren.org"
- },
- {
- "Icon":"fa-twitter",
- "Url":"http://twitter.com/matthewwarren"
- }
- ],
- "Sessions":[
- {
- "Id":3140,
- "Title":"Performance is a Feature!",
- "Abstract":"\r\n Starting with the premise that \"Performance is a Feature\" , this session will look at how to measure, what to measure and how get the best performance from your .NET code. We will look at real-world examples from the Roslyn code-base, StackOverflow and my personal experience of trying (but ultimately failing) to break a world record.
\n\r\n"
- }
- ]
- },
- {
- "Id":309,
- "Name":" Mauro Servienti",
- "Bio":"CTO and Architect @ Mastreeno Ltd, Dublin, Long time Microsoft MVP for Visual C#, really passionated about DDD, CQRS and Event Sourcing. NServiceBus Champ and official trainer, RavendDB trainer.
\n\nHas been working with the .net platform since the first Alpha in 1999.
\n",
- "Links":[
- {
- "Icon":"fa-globe",
- "Url":"http://milestone.topics.it"
- },
- {
- "Icon":"fa-twitter",
- "Url":"http://twitter.com/mauroservienti"
- }
- ],
- "Sessions":[
- {
- "Id":107,
- "Title":"NServiceBus: introduction to a message based distributed architecture",
- "Abstract":"\r\n SOA and distributed had been buzzwords for a long time, a message based architecture that embrace the SOA principles is the real solution to a scalable and distributed environment where HA or/and temporal decoupling are a must.\nIn this session we will introduce messaging concepts and see how NServiceBus, a powerfull toolkit to rule all the aspects of a messaging transport, can dramatically simplify the development process.
\n\r\n"
- }
- ]
- },
- {
- "Id":3320,
- "Name":" Melinda Seckington",
- "Bio":"Melinda Seckington is a developer at FutureLearn, a social learning platform, backed by the Open University, offering free courses from a wide range of university partners, and cultural institutions like the British Council, British Library and British Museum.
\n\nShe loves attending and hacking at Hackdays, BarCamps and other tech meet ups, and since 2009 has been organising them at Geeks of London, including HACKED at the O2 last year. She also runs MissGeeky.com, a blog about all things geeky and girly.
\n",
- "Links":[
- {
- "Icon":"fa-globe",
- "Url":"http://missgeeky.com"
- },
- {
- "Icon":"fa-twitter",
- "Url":"http://twitter.com/mseckington"
- }
- ],
- "Sessions":[
- {
- "Id":2113,
- "Title":"DDD: Disney Driven Development",
- "Abstract":"\r\n Disney parks are built using their Four Keys of The Kingdom: Safety, Courtesy, Show and Efficiency. This talk will show examples of how Disney have applied these four keys everywhere in their parks and how we can extend those principles to our work as web developers.
\n\r\n"
- }
- ]
- },
- {
- "Id":1313,
- "Name":" Pete Smith",
- "Bio":"Pete is a software consultant based in London with almost 10 years of experience making web applications with Asp.Net, specialising in API design and Javascript browser-based applications. He is the author of Superscribe - a graph based routing framework, and the OData library Linq to Querystring.
\n",
- "Links":[
- {
- "Icon":"fa-globe",
- "Url":"http://roysvork.wordpress.com"
- },
- {
- "Icon":"fa-twitter",
- "Url":"http://twitter.com/roysvork"
- }
- ],
- "Sessions":[
- {
- "Id":1106,
- "Title":"Beyond responsive design - UI for the modern web application",
- "Abstract":"\r\n Applications written for the modern web are being consumed not just on desktop browsers, but also on a myriad of other devices... even watches and glasses. If you design your application with a pc screen in mind, at worst you're either cutting your userbase in half or setting yourself up for an expensive redesign.
\n\nIn this talk I'll introduce you to some modern web design constructs, and the technologies that bring them to life. Learn how to create apps that work just as well on phone, mobile and desktop with no extra effort, and without restrictive layout frameworks. Who knows... you may even even see things that begin to rival native apps!
\n\r\n"
- }
- ]
- },
- {
- "Id":3323,
- "Name":" Peter Mounce",
- "Bio":"",
- "Links":[
-
- ],
- "Sessions":[
- {
- "Id":2115,
- "Title":"Embracing DevOps at JUST EAT, within a Microsoft platform",
- "Abstract":"\r\n JUST EAT changed its culture towards embracing DevOps principles, and heavily leveraged AWS to achieve it.
\n\nWe're a successful online takeaway ecommerce website running on a Microsoft-based platform.
\n\nCome learn how we:
\n\n\nre-organised our teams and our platform to loosely couple them \nre-organised our architecture to be more modular \nmade it possible for developers to operate their code in production directly, starting with shoot-it-in-the-head debugging \nmade it possible for developers to continuously ship changes \neliminated most differences between production and qa environments \nbecame more resilient as a happy by-product \n \n\r\n"
- }
- ]
- },
- {
- "Id":34,
- "Name":" Phillip Trelford",
- "Bio":"",
- "Links":[
-
- ],
- "Sessions":[
- {
- "Id":1114,
- "Title":"All your types are belong to us!",
- "Abstract":"\r\n Big Data tasks typically require acquiring and analysing data from a wide variety of data sources, visualizing the data and applying a barrage of statistical algorithms. This talk will show how this can be accomplished in Visual Studio on Windows or Xamarin Studio on Mac and Linux using F#'s REPL and Type Providers. \nType Providers give typed access to a wide range of data sources from CSV, JSON and XML to SQL, OData and Web Services, instantly without a code generation step. The Type Provider mechanism can also be used to analyse data with direct access to statistical packages like R and MATLAB as well as all the existing .Net libraries.\nFinally visualizations can be generated using F#'s desktop charting libraries, or with ASP.Net and even JavaScript libraries like HighCharts.\nExpect a sprinkling of anecdotes drawn from experiences working on large machine learning systems at Microsoft, and plenty of live demos.
\n\r\n"
- }
- ]
- },
- {
- "Id":2314,
- "Name":" Sam Hogarth",
- "Bio":"Sam works with .NET at Nonlinear Dynamics, creating software to analyse proteomics and metabolomics experiments. Previously he has built desktop and web-based trading applications for some of the world's largest financial institutions, developed for two charting products (Visiblox and ShinobiControls) and contributed to the PropertyCross open-source project.
\n\nIn his spare time he runs, plays a ridiculous amount of board games, co-organises Newcastle Skeptics in the Pub and builds Android apps - including a scheduling app for DDD East Anglia! ;)
\n",
- "Links":[
- {
- "Icon":"fa-globe",
- "Url":"http://samhogy.co.uk"
- },
- {
- "Icon":"fa-twitter",
- "Url":"http://twitter.com/samhogy"
- }
- ],
- "Sessions":[
- {
- "Id":2109,
- "Title":"Keeping it responsive - cross-platform MVVM with ReactiveUI",
- "Abstract":"\r\n Building an awesome user interface is hard work. You've got the complexities of real life to deal with - handling user inputs, dealing with slow network connections and managing background workers. There's also this testing thing that people keep going on about!
\n\nWe need a way of handling the real world, whilst behaving in a predictable and responsive manner. Enter ReactiveUI, a fusion of MVVM and the Reactive Extensions (Rx) for .NET applications.
\n\nIn this session I'll introduce ReactiveUI, show you some tips and tricks, discuss the benefits and tradeoffs of the framework and show how it can be used as a solid foundation for building cross-platform .NET applications.
\n\r\n"
- }
- ]
- },
- {
- "Id":4328,
- "Name":" Stephen Harrison",
- "Bio":"",
- "Links":[
- {
- "Icon":"fa-globe",
- "Url":"http://Tinamous.com"
- },
- {
- "Icon":"fa-twitter",
- "Url":"http://twitter.com/TinamousSteve"
- }
- ],
- "Sessions":[
- {
- "Id":3119,
- "Title":"A Brief Introduction to Making your own (Internet of Things) Thing.",
- "Abstract":"\r\n The Internet of Things is exploding and it's a great time to join in: more and more devices like the Arduino, Netduino and Gadgeteer are becoming available. The question is, how do I get started?
\n\nWe will look at what is available in terms of popular hardware for building your Thing, and a demo of how to develop for the Arduino, followed by an introduction to the Gadgeteer and .Net Micro Framework, hopefully finishing up with a fairly simple but connected Gadgeteer based Thing (Wifi Allowing!).
\n\r\n"
- }
- ]
- },
- {
- "Id":4332,
- "Name":" Tomas Petricek",
- "Bio":"",
- "Links":[
-
- ],
- "Sessions":[
- {
- "Id":3132,
- "Title":"Taking your craft seriously with F#",
- "Abstract":"\r\n Many standard F# libraries and tools, including the compiler itself, are developed as open-source and have a large number of contributors. To successfully build such projects, you need to be serious about your craft. This includes comprehensive testing, using automated build tools, continuous integration, as well as creating great documentation and tutorials. In this talk, I'll talk about what I learned as an open-source F# contributor.
\n\nAlong the way, we'll look a number of risk-free ways of introducing F# into your workflow:
\n\n\nHow to use F# Interactive for explorative programming and writing code that works on the first try \nUsing FAKE - an F# build tool - to automate everything in your build process \nWriting readable unit tests with F# and using FsCheck for property-based testing \nGenerating great documentation using F# Formatting tools \n \n\nIn summary, this talk is a walkthrough covering some of the software engineering aspects of programming that have been working extremely well for the F# open-source ecosystem. After the talk, you'll have a good idea how to use some of the techniques in your daily job - but you may as well become an F# contributor!
\n\r\n"
- }
- ]
- }
-]
\ No newline at end of file
diff --git a/BeyondResponsiveDesign.Menus/content/sponsors.html b/BeyondResponsiveDesign.Menus/content/sponsors.html
deleted file mode 100644
index 1d862b9..0000000
--- a/BeyondResponsiveDesign.Menus/content/sponsors.html
+++ /dev/null
@@ -1,12 +0,0 @@
-
-
-
-
- Welcome to DDD East Anglia!
-
-
-
-
-
-
\ No newline at end of file
diff --git a/BeyondResponsiveDesign.Menus/icon-large.png b/BeyondResponsiveDesign.Menus/icon-large.png
deleted file mode 100644
index 23fda3a..0000000
Binary files a/BeyondResponsiveDesign.Menus/icon-large.png and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/accommodation/doubletree-hilton.jpg b/BeyondResponsiveDesign.Menus/images/accommodation/doubletree-hilton.jpg
deleted file mode 100644
index d5bfffa..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/accommodation/doubletree-hilton.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/accommodation/premierinn-a14-j32.jpg b/BeyondResponsiveDesign.Menus/images/accommodation/premierinn-a14-j32.jpg
deleted file mode 100644
index 5e6e5c9..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/accommodation/premierinn-a14-j32.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/accommodation/travelodge-cambridge-central.jpg b/BeyondResponsiveDesign.Menus/images/accommodation/travelodge-cambridge-central.jpg
deleted file mode 100644
index 62ab790..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/accommodation/travelodge-cambridge-central.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/accommodation/travelodge-newmarket-road.jpg b/BeyondResponsiveDesign.Menus/images/accommodation/travelodge-newmarket-road.jpg
deleted file mode 100644
index 714d719..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/accommodation/travelodge-newmarket-road.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/accommodation/travelodge-orchard-park.jpg b/BeyondResponsiveDesign.Menus/images/accommodation/travelodge-orchard-park.jpg
deleted file mode 100644
index 88d75ba..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/accommodation/travelodge-orchard-park.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/accommodation/university-arms.jpg b/BeyondResponsiveDesign.Menus/images/accommodation/university-arms.jpg
deleted file mode 100644
index 1d02674..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/accommodation/university-arms.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/accommodation/varsity.jpg b/BeyondResponsiveDesign.Menus/images/accommodation/varsity.jpg
deleted file mode 100644
index 67f31dc..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/accommodation/varsity.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/favicon.ico b/BeyondResponsiveDesign.Menus/images/favicon.ico
deleted file mode 100644
index 9f29f27..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/favicon.ico and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/googleplaystore.gif b/BeyondResponsiveDesign.Menus/images/googleplaystore.gif
deleted file mode 100644
index a5c49f5..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/googleplaystore.gif and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/icon-128.png b/BeyondResponsiveDesign.Menus/images/icon-128.png
deleted file mode 100644
index 24005a9..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/icon-128.png and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/icon-196.png b/BeyondResponsiveDesign.Menus/images/icon-196.png
deleted file mode 100644
index 2bd91c2..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/icon-196.png and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/itunesappstore.gif b/BeyondResponsiveDesign.Menus/images/itunesappstore.gif
deleted file mode 100644
index 2aa8405..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/itunesappstore.gif and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/logo-notext-green.png b/BeyondResponsiveDesign.Menus/images/logo-notext-green.png
deleted file mode 100644
index 7f2b678..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/logo-notext-green.png and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/logo-small-green.png b/BeyondResponsiveDesign.Menus/images/logo-small-green.png
deleted file mode 100644
index 28c69b8..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/logo-small-green.png and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/logo-small.png b/BeyondResponsiveDesign.Menus/images/logo-small.png
deleted file mode 100644
index e6a8fe5..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/logo-small.png and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/speakers/11.jpg b/BeyondResponsiveDesign.Menus/images/speakers/11.jpg
deleted file mode 100644
index 25483ec..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/speakers/11.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/speakers/1313.jpg b/BeyondResponsiveDesign.Menus/images/speakers/1313.jpg
deleted file mode 100644
index de0a05d..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/speakers/1313.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/speakers/23.jpg b/BeyondResponsiveDesign.Menus/images/speakers/23.jpg
deleted file mode 100644
index 235935a..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/speakers/23.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/speakers/2311.jpg b/BeyondResponsiveDesign.Menus/images/speakers/2311.jpg
deleted file mode 100644
index 6721ee5..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/speakers/2311.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/speakers/2312.jpg b/BeyondResponsiveDesign.Menus/images/speakers/2312.jpg
deleted file mode 100644
index cba63be..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/speakers/2312.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/speakers/2314.jpg b/BeyondResponsiveDesign.Menus/images/speakers/2314.jpg
deleted file mode 100644
index 9af9413..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/speakers/2314.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/speakers/2316.jpg b/BeyondResponsiveDesign.Menus/images/speakers/2316.jpg
deleted file mode 100644
index 63483d4..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/speakers/2316.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/speakers/293.jpg b/BeyondResponsiveDesign.Menus/images/speakers/293.jpg
deleted file mode 100644
index 2642a7b..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/speakers/293.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/speakers/30.jpg b/BeyondResponsiveDesign.Menus/images/speakers/30.jpg
deleted file mode 100644
index 6721ee5..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/speakers/30.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/speakers/302.jpg b/BeyondResponsiveDesign.Menus/images/speakers/302.jpg
deleted file mode 100644
index 1eb1bef..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/speakers/302.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/speakers/303.jpg b/BeyondResponsiveDesign.Menus/images/speakers/303.jpg
deleted file mode 100644
index c6bbdbc..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/speakers/303.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/speakers/309.jpg b/BeyondResponsiveDesign.Menus/images/speakers/309.jpg
deleted file mode 100644
index c32fd1d..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/speakers/309.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/speakers/3319.jpg b/BeyondResponsiveDesign.Menus/images/speakers/3319.jpg
deleted file mode 100644
index 9f8a3cd..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/speakers/3319.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/speakers/3320.jpg b/BeyondResponsiveDesign.Menus/images/speakers/3320.jpg
deleted file mode 100644
index 7ca13ea..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/speakers/3320.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/speakers/3322.jpg b/BeyondResponsiveDesign.Menus/images/speakers/3322.jpg
deleted file mode 100644
index bcf82d2..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/speakers/3322.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/speakers/3323.jpg b/BeyondResponsiveDesign.Menus/images/speakers/3323.jpg
deleted file mode 100644
index 7e2831f..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/speakers/3323.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/speakers/3324.jpg b/BeyondResponsiveDesign.Menus/images/speakers/3324.jpg
deleted file mode 100644
index 218dcea..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/speakers/3324.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/speakers/34.jpg b/BeyondResponsiveDesign.Menus/images/speakers/34.jpg
deleted file mode 100644
index 7e71be1..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/speakers/34.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/speakers/4328.jpg b/BeyondResponsiveDesign.Menus/images/speakers/4328.jpg
deleted file mode 100644
index 6721ee5..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/speakers/4328.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/speakers/4331.jpg b/BeyondResponsiveDesign.Menus/images/speakers/4331.jpg
deleted file mode 100644
index a3efade..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/speakers/4331.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/speakers/4332.jpg b/BeyondResponsiveDesign.Menus/images/speakers/4332.jpg
deleted file mode 100644
index cd43c18..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/speakers/4332.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/speakers/48.jpg b/BeyondResponsiveDesign.Menus/images/speakers/48.jpg
deleted file mode 100644
index 460d6e3..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/speakers/48.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/speakers/53.jpg b/BeyondResponsiveDesign.Menus/images/speakers/53.jpg
deleted file mode 100644
index 6721ee5..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/speakers/53.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/speakers/5333.jpg b/BeyondResponsiveDesign.Menus/images/speakers/5333.jpg
deleted file mode 100644
index 80bfc75..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/speakers/5333.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/speakers/62.jpg b/BeyondResponsiveDesign.Menus/images/speakers/62.jpg
deleted file mode 100644
index 35a3f61..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/speakers/62.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/images/speakers/speakers.json b/BeyondResponsiveDesign.Menus/images/speakers/speakers.json
deleted file mode 100644
index 37ab5a4..0000000
--- a/BeyondResponsiveDesign.Menus/images/speakers/speakers.json
+++ /dev/null
@@ -1 +0,0 @@
-[{"Id":3324,"Name":" Adam Kosinski","Bio":"Journeyman, developer, craftsman, currently coding C# in London. Interested in just about anything, excelling at discussions over code, beer and pizza.
\n","Links":[{"Icon":"icon-twitter","Url":"http://twitter.com/adk0s"}],"Sessions":[{"Id":2117,"Title":"A Unit Testing Swiss Army Knife","Abstract":"\r\n Putting all of #IsTddDeadOrNotQuiteYet discussion aside, there are a lot of things to be said about more technical side of writing tests. Instead of big important questions like \"How\" or \"Why\", I would like to present you a couple of tricks, patterns and libraries that help in what is usually of secondary interest - readability, maintainability.
\n\nThe leading motive for this talk will be approaching our tests like living documentation - and what we can possibly do to make it better.
\n\nSo, have you ever wondered what is Bulider Pattern about? What is all the fuss in being \"fluent\"? Or maybe you wondered if you can effectively integration test you MVC app? I hope you will find useful learning this, and some more.
\n\r\n"}]},{"Id":2312,"Name":" Alessandro Melchiori","Bio":"Software craftsman, husband, father, ex-sportsman and inquiring reader. Since I was young I have loved taking apart and reassembling things to understand how they work. Now, this passion has become my job: the step from Lego to software development was small.
\n\nFinding the best possible solution so that a complex system can work at its best and making it run smoothly are the goals of my work. C#, WCF, ESB, MongoDb and Azure make up my survival toolkit and help me cruise through distributed systems and enterprise solutions, with ease.
\n\nBe it a command or an event, I try to do my best in contributing to the life of the communities that have adopted me (ugidotnet and webdebs), trying to “give back” at least a part of what I have received over these years.
\n","Links":[{"Icon":"icon-globe","Url":"http://codiceplastico.com"},{"Icon":"icon-twitter","Url":"http://twitter.com/amelchiori"}],"Sessions":[{"Id":1108,"Title":"Functional DDD","Abstract":"\r\n Very often we approach, more or less unconsciously, DDD's principles only with object-oriented paradigm, without exploring if other \"style\" can live better with aggregates, value objects, commands and domain events. Well, yes: there is 'other' out there... \nIn this session we will see how a functional language as F# can lead to a more intuitive and compact implementation of our domains.
\n\r\n"}]},{"Id":293,"Name":" Anthony Brown","Bio":"","Links":[{"Icon":"icon-twitter","Url":"http://twitter.com/bruinbrown93"}],"Sessions":[{"Id":2107,"Title":"Building Skynet: Machine learning for software developers","Abstract":"\r\n How does Netflix know that I'd like that new movie which just released? How does Google know which ads to serve to me? How do games like Halo and Titanfall put me in game lobbies to create even matches? All these questions are answered with machine learning algorithms. Machine learning can sometimes look difficult. This session aims to break down the barrier to entry for machine learning and show how powerful even the most simple algorithms can be. Expect plenty of sample code to show just how quick and easy these basic algorithms can be.
\n\r\n"}]},{"Id":3322,"Name":" Barbara Fusinska","Bio":"Developer, architect, problem solver. \nStrongly believes in team work and providing the best environment to help people reach their potential to the fullest.\nEnjoys designing beautiful system architectures using good practices, patterns and a great deal of common sense.
\n","Links":[{"Icon":"icon-globe","Url":"http://barbarafusinska.com/"},{"Icon":"icon-twitter","Url":"http://twitter.com/basiafusinska"}],"Sessions":[{"Id":4133,"Title":"Architecture - why so serious?","Abstract":"\r\n What comes to developer's mind when he hears the phrase 'software architecture'? Is it clean design or rather heavy and unusable overhead? Nowadays there are many approaches to follow while building the software, but they often sound to pompous and lead to overcomplicating things. Programmers refuse to consider them, when all they need is making some simple functionalities work. They hear the word architecture and they get uptight in seconds. And that's not how it's supposed to be. Good practices should help, not introduce unnecessary problems and disturbance.
\n\nWhat if thinking about architecture doesn't make the software too heavy and introduces actual value? What if some of its concepts could be used easily, even in non complex projects, simplifying the process of creation at the same time?
\n\nThe talk is to illustrate how architecture is not about ivory towers, but actual coding, and on what those coding architects should do. It will center on showing some habits developed through years of building different kinds of software systems. Using them can help reducing work, while focusing on what's most important - getting the job done that brings concrete value to the client. It will be demonstrated by real (but simple in the same time) code and fully functional web application. One that can be used as an outline for further usage, as patterns to apply. Presented examples will highlight power of more abstract approach, but in the same time will consider hands on code.
\n\r\n"}]},{"Id":5333,"Name":" Bart Read","Bio":"","Links":[{"Icon":"icon-globe","Url":"http://www.bartread.com"},{"Icon":"icon-twitter","Url":"http://twitter.com/bart_read"}],"Sessions":[{"Id":4135,"Title":"Scream if you want to go faster: speed up .NET and SQL Server web apps","Abstract":"\r\n We all know that websites need to be fast. But how do you juice up creaking web apps that have been around for a while without deploying the thermonuclear option (i.e., the costly and much-maligned ground-up rewrite)?
\n\nUnfortunately this can still prove tricky, especially when the issues lie in the database layer. Help is at hand though: I’ll show you the techniques that will help you hunt down performance problems in your database, and relate them back to your .NET code. But that's only half the story: we'll also talk about the strategies you can use to fix them from the relatively simple, to the much more involved.
\n\nYou should leave with an arsenal of optimisation tricks for every occasion!
\n\r\n"}]},{"Id":3319,"Name":" Ben Hall","Bio":"Performed the rounds as a tester, developer, speaker, freelancer & startup entrepreneur. Currently working on the next venture
\n","Links":[{"Icon":"icon-globe","Url":"http://www.ocelotuproar.com"},{"Icon":"icon-twitter","Url":"http://twitter.com/ben_hall"}],"Sessions":[{"Id":2111,"Title":"What Developers Need To Know About Visual Design ","Abstract":"\r\n The world has become a very design sensitive meaning it’s now even more critical that developers build products that look amazing. Sadly frameworks like twitter’s bootstrap can only take us so far and even with designers on the team developers need to understand the key principals of good design to make effective decisions.
\n\nIn this session Ben will explore the five key topics around design that can make or break an application and website. The key topics are Layout and the golden ratio, Typography, Imaginary, Colours and User Feedback. With these topics attendees will come away with a deeper understanding about why certain elements look good while others don’t and what developers really should know about design. It will explore the cognitive science and research to move beyond personal options about design to data and research driven insights.
\n\r\n"}]},{"Id":302,"Name":" Chris Canal","Bio":"","Links":[],"Sessions":[{"Id":102,"Title":"Super charging your JavaScript development experience","Abstract":"\r\n With the release of V8 and subsequently NodeJs, JavaScript has started to grow up. In this session we will look at how you can super charge your JavaScript development lifecycle and deliver better written, cleaner and more coherent JavaScript with and without VisualStudio
\n\nWe will look at the many awesome frameworks for infrastructural support when developing JavaScript applications like Yeoman, Gulp, grunt, Browserfy and a few other handy libraries
\n\r\n"}]},{"Id":11,"Name":" David Simner","Bio":"I started playing with computers when I stuffed sweets into my parents' floppy disk drive when I was 5. They weren't happy. When I was 10, I progressed onto something much more fun: coding!
\n\nAfter a brief stint pretending to be an academic, I returned to what I love. For the past 5 years I've been a software developer at Red Gate.
\n\nThere have been lots of mistakes and learning along the way, but that’s what makes it fun: I now know that “Minimally Viable” includes writing the clean-up code, because otherwise you’ll spend nearly a grand on Amazon S3 before anybody notices; luckily my boss was forgiving.
\n\nIn my spare time I try to convince my train-obsessed friends to give up their obsession, and despite claiming not to be able to cook, I “product manage” my partner's Fair Trade Cook Book website.
\n","Links":[{"Icon":"icon-globe","Url":"http://www.davidsimner.me.uk/"}],"Sessions":[{"Id":4124,"Title":"OWIN, Katana and ASP.NET vNext: eliminating the pain of IIS","Abstract":"\r\n I first encountered OWIN when I added SignalR to a legacy ASP.NET MVC app, and had to write a piece of OWIN middleware to get SignalR to play nicely with our legacy authentication.
\n\nIt was a thoroughly impressive experience, so I built my next greenfield project on OWIN & Katana as a single-page app using static files & Web API, finally ditching IIS for good. The glad tidings continue for Microsoft web developers, with ASP.NET vNext promising even more goodness on the horizon.
\n\nThere’s a lot of changes coming for those of us working on the .NET web stack, so this talk will show you what things look like today:
\n\n\nWhat are OWIN & Katana, and why you should care \nWhat middleware is, as well as why and how you write it \nThe advantages this brings for testing \nHow Helios lets you host on IIS (if you really really really want to) \n \n\nAs well as what's changing in ASP.NET vNext:
\n\n\nHow Roslyn comes into play \nThe what and the why of the K runtime \nWhy you should care about the Core CLR \nWhat’s shiny about ASP.NET MVC 6 \n \n\nThere’s a lot to cover, so we’ll move fast. You'll come away knowing why and how you should start using this on your own projects.
\n\r\n"}]},{"Id":303,"Name":" Forbes Lindesay","Bio":"Node.js enthusiast, open source contributor and maintainer of the Jade templating language..
\n","Links":[{"Icon":"icon-globe","Url":"http://www.forbeslindesay.co.uk/"},{"Icon":"icon-twitter","Url":"http://twitter.com/ForbesLindesay"}],"Sessions":[{"Id":104,"Title":"GitHub Automation","Abstract":"\r\n GitHub has one of the best REST APIs you'll ever see. Pretty much any task in GitHub can be automated. Tired of updating code after a feature gets deprecated? Write a bot for that. Need to add the repository field to all your package.json files? Script it. You can even use GitHub as the backend for an entire application to take advantage of its built in collaboration features. This talk will take you through how to write you own GitHub automation code in JavaScript and give you some ideas on how to use your new-found powers for good.
\n\r\n"}]},{"Id":30,"Name":" Gary Short","Bio":"Gary Short is the Head of Gibraltar Labs, a skunk works division of Gibraltar software. He is a Microsoft MVP in C# as well as being a Node.js and Python hacker. Gary is a popular speaker giving presentations at conferences and user groups throughout the UK, Europe and the US, mainly on his pet subjects of Social Network Analysis, Big Data and Data Science
\n","Links":[{"Icon":"icon-twitter","Url":"http://twitter.com/garyshort"}],"Sessions":[{"Id":3127,"Title":"Data Science for Fun and Profit","Abstract":"\r\n Make no mistake, data science can be hard, but it can also be fun. In this session I'll introduce you to Classic and Bayesian Statistics and Machine Learning, all through the medium of predicting horse racing results. We'll explore a number of techniques for making such predictions and we'll finish by combining them into a powerful \"mixed model\" prediction engine, that's sure to pick the next big winner. This session won't only improve your knowledge, it'll improve your bank balance too! Note: probably won't do the latter though. :-)
\n\r\n"}]},{"Id":2311,"Name":" Ian Cooper","Bio":"Ian Cooper has over 20 years of experience delivering Microsoft platform solutions in government, healthcare, and finance. During that time he has worked for the DTI, Reuters, Sungard, Misys, Beazley, and Huddle delivering everything from bespoke enterprise solutions, 'shrink-wrapped' products, and cloud services to thousands of customers. Ian is a passionate exponent of Software Craftsmanship and Agile Architecture. When he is not writing code he is also the and founder of the London .NET user group and speaks at events throughout the UK.
\n","Links":[{"Icon":"icon-twitter","Url":"http://twitter.com/ICooper"}],"Sessions":[{"Id":1107,"Title":"Decoupling from ASP.NET - Hexagonal Architectures in .NET","Abstract":"\r\n The term 'hexagonal architecture' has come back and forth in popularity since Alistair Cockburn first mooted it, with the Rails community's recent soul searching over its importance or threat just the latest. So what is a hexagonal architecture, why might you want to use one, and why is the 'Rails just falls away' (https://www.youtube.com/watch?v=tg5RFeSfBM4) threat so discomforting to web framework builders. How can we make 'ASP.NET just fall away'.
\n\nIn this presentation we will look at the Layered Architectural style - when we would want to use one (as opposed to the alternatives) and when it is appropriate how to implement one. We will look at how to implement the Ports & Adapters (Hexagonal's 'proper' name) style, explaining what the different layers are.
\n\nWe will look at the value the command pattern for implementing our ports , explain why Netflix uses it in Hystrix for reliability. On the way we will discuss Retry, Timeout and Circuit Breaker and explain how we can do better than Hystrix with a Command Dispatcher and Command Processor.
\n\nWe'll show code throughout, including a look at the Paramore. Brighter framework, an OSS version of the platform we use at Huddle to build this kind of architecture.
\n\nAs a bonus we will round off showing you how easy it is go from sync to async with this approach.
\n\r\n"}]},{"Id":53,"Name":" Ian Russell","Bio":"Experienced provider of simplicity, order and common-sense to complex OLTP solutions. Passionate about learning from others and giving back to the community. Paid to write C# and SQL, lover of F#, node.js and NoSql.
\n","Links":[{"Icon":"icon-globe","Url":"http://ijrussell.tumblr.com"},{"Icon":"icon-twitter","Url":"http://twitter.com/ijrussell"}],"Sessions":[{"Id":108,"Title":"Using F# for Line of Business Applications","Abstract":"\r\n C# is a great language for developing Line of Business applications but F# is even better! If you want to write code that expresses your requirements clearly, ensures correctness and supports rapid, and fun, development then guess what, F# does all that and more!
\n\nNo prior experience of F# is necessary for this session but be warned, once you've seen what F# can do, you won't want to go back to C#!
\n\r\n"}]},{"Id":23,"Name":" Joel Hammond-Turner","Bio":"Joel works as a Technical Lead for Landmark, and is currently bringing his 20 years of experience of software development and a passion for both technology and elegance to designing a world-class applications for the property information and risk management sectors.
\n\nHe has presented sessions on using NuGet for enterprise software development at DDDSW 4.0 and DDDNorth 2 , and is responsible for the the open source NuGet.PackageNPublish tooling project.
\n\nOutside of work he referees life with his wife and three young children in a home with more computers than is probably wise, but is really looking forward to teaching his boys Python now they've mastered Scratch on their Raspberry Pi.
\n","Links":[{"Icon":"icon-globe","Url":"http://www.hammond-turner.org.uk"},{"Icon":"icon-twitter","Url":"http://twitter.com/Rammesses"}],"Sessions":[{"Id":3139,"Title":"So you want to be a Tech Lead? 10 things you need to do to succeed.","Abstract":"\r\n \"Tech Lead\" is an amorphous job title - is it all about the technology, or all about leadership? What should the balance really be?
\n\nAnd it can also be a complex and thankless role too - particularly if you find yourself becoming the go-to guy (or gal) for everyone from the intern to the product manager.
\n\nIn this talk I'll cover (at least) 10 things that I think are essential to success in both areas, including how to address technical debt, herd your PMs and make sure your development team has a steady flow of work (and beer, pizza or other \"motivationals\").
\n\r\n"}]},{"Id":4331,"Name":" Kendall Miller","Bio":"Kendall Miller is one of the founding partners of Gibraltar Software, an Independent Software Vendor (ISV) that develops & markets commercial applications for .NET developers. Introduced commercially in 2009, Loupe is an application logging & monitoring platform that is currently used by customers around the world from individual consultants through Fortune 100 companies and governments.
\n\nBefore starting Gibraltar Software, Kendall worked for multiple startups leading their technology development from beginning through profitability. In each case he's focused on translating enterprise-level performance and capabilities down to smaller companies. Kendall has a B.S in Computer Engineering from the University of Illinois, Urbana-Champaign.
\n","Links":[{"Icon":"icon-globe","Url":"http://rocksolid.gibraltarsoftware.com"},{"Icon":"icon-twitter","Url":"http://twitter.com/kendallmiller"}],"Sessions":[{"Id":3129,"Title":"Build Great Software for the Enterprise and Love it","Abstract":"\r\n You want to write great code - taking the time to create an application that is cleanly written, easy to test, performs well, and delights users. Your company wants it done yesterday. How do you get the time and budget you need to build it right instead of just pounding out the next feature ?
\n\nIn this talk, we'll cover how to:
\n\n\nNever skip coded tests again. \nCommunicate security risks effectively so your business isn't the next Target. \nPay down technical debt while delivering the features your users are waiting for. \n \n\nSound incredible? Come to the talk to find out how you can go home happy with the work you've done each day, even in an enterprise.
\n\r\n"}]},{"Id":62,"Name":" Liam Westley","Bio":"Liam Westley is an Application Architect at Huddle where he works with some of the best .Net developers and UX designers to deliver world class collaboration software. He quite likes working just off Old Street as there is some fantastic food and coffee to be had within a few minutes walk.
\n\nPrevious to Huddle Liam worked at Criteria MX, a digital media startup and has worked as a consultant via his own company Tiger Computer Services Ltd, specialising in software for Broadcast Television. His Niagara SMS moderation system was used by QVC UK for eight years to display SMS messages from viewers, live, on screen. Liam is also responsible for the ticketing system for Hat Trick Productions which provides e-tickets to shows such as Have I Got New For You and Room 101.
\n\nLiam has worked for chellomedia, GMTV, BSkyB, SmashedAtom and Original Thinking Group. In his time he created the first in house weather system for Sky News using Visual Basic 1.0, acted as architect for two general election systems, project managed the launch of the GMTV web site, was key to delivering the first interactive television chat service in the UK for BSkyB and helped launch the first live shopping channels in the Netherlands.
\n","Links":[{"Icon":"icon-globe","Url":"http://geekswithblogs.net/twickers"},{"Icon":"icon-twitter","Url":"http://twitter.com/westleyl"}],"Sessions":[{"Id":1109,"Title":"An Actor's Life for Me – An introduction to the TPL Dataflow Library and asynchronous programming blocks","Abstract":"\r\n Every version of the .NET Framework has brought improvements to asynchronous and concurrent programming. While .NET 4.0 brought the async/await model which is useful for improving UI responses and server applications, it can sometimes still be tricky to marshal multiple threads within longer processing pipelines.
\n\nThe Dataflow Library consists of a Nuget package built on top of the Task Parallel Library (TPL). It harnesses the actor-based programming model to provide a set of dataflow blocks data structures that buffer and process data, which you can connect together to form custom pipelines with messages passed between the blocks.
\n\nBy using the Dataflow Library you can concentrate on the messages and actions being performed, while the blocks marshal the messages, provide concurrent message processing and buffering as well as supporting cancellation and exception handling.
\n\r\n"}]},{"Id":48,"Name":" Mark Rendle","Bio":"","Links":[],"Sessions":[{"Id":3125,"Title":"The vNext Big Thing","Abstract":"\r\n At TechEd this year, various Scotts and a David announced ASP.NET vNext, the biggest thing to happen to the Microsoft web developers story since ASP.NET 1.0.
\n\nIt's a moving target, so I can't say exactly what the talk will include, but I can guarantee it will cover:
\n\n\nThe Core CLR, the K Runtime, and the project.json file \nHow Roslyn fits into the story \nWhat (and why) OWIN is, and how to write middleware for it \nThe merging of MVC and Web API into a single, streamlined, uber-framework \nWhy I'm never going to finish Simple.Web \n \n\nLook, it's all awesome. Just come and see.
\n\r\n"}]},{"Id":2316,"Name":" Matt Warren","Bio":"I'm a C# dev who loves nothing better than finding and fixing performance issues. I also contribute to RavenDB and wrote the .NET port of HdrHistogram .
\n","Links":[{"Icon":"icon-globe","Url":"http://www.mattwarren.org"},{"Icon":"icon-twitter","Url":"http://twitter.com/matthewwarren"}],"Sessions":[{"Id":3140,"Title":"Performance is a Feature!","Abstract":"\r\n Starting with the premise that \"Performance is a Feature\" , this session will look at how to measure, what to measure and how get the best performance from your .NET code. We will look at real-world examples from the Roslyn code-base, StackOverflow and my personal experience of trying (but ultimately failing) to break a world record.
\n\r\n"}]},{"Id":309,"Name":" Mauro Servienti","Bio":"CTO and Architect @ Mastreeno Ltd, Dublin, Long time Microsoft MVP for Visual C#, really passionated about DDD, CQRS and Event Sourcing. NServiceBus Champ and official trainer, RavendDB trainer.
\n\nHas been working with the .net platform since the first Alpha in 1999.
\n","Links":[{"Icon":"icon-globe","Url":"http://milestone.topics.it"},{"Icon":"icon-twitter","Url":"http://twitter.com/mauroservienti"}],"Sessions":[{"Id":107,"Title":"NServiceBus: introduction to a message based distributed architecture","Abstract":"\r\n SOA and distributed had been buzzwords for a long time, a message based architecture that embrace the SOA principles is the real solution to a scalable and distributed environment where HA or/and temporal decoupling are a must.\nIn this session we will introduce messaging concepts and see how NServiceBus, a powerfull toolkit to rule all the aspects of a messaging transport, can dramatically simplify the development process.
\n\r\n"}]},{"Id":3320,"Name":" Melinda Seckington","Bio":"Melinda Seckington is a developer at FutureLearn, a social learning platform, backed by the Open University, offering free courses from a wide range of university partners, and cultural institutions like the British Council, British Library and British Museum.
\n\nShe loves attending and hacking at Hackdays, BarCamps and other tech meet ups, and since 2009 has been organising them at Geeks of London, including HACKED at the O2 last year. She also runs MissGeeky.com, a blog about all things geeky and girly.
\n","Links":[{"Icon":"icon-globe","Url":"http://missgeeky.com"},{"Icon":"icon-twitter","Url":"http://twitter.com/mseckington"}],"Sessions":[{"Id":2113,"Title":"DDD: Disney Driven Development","Abstract":"\r\n Disney parks are built using their Four Keys of The Kingdom: Safety, Courtesy, Show and Efficiency. This talk will show examples of how Disney have applied these four keys everywhere in their parks and how we can extend those principles to our work as web developers.
\n\r\n"}]},{"Id":1313,"Name":" Pete Smith","Bio":"Pete is a software consultant based in London with almost 10 years of experience making web applications with Asp.Net, specialising in API design and Javascript browser-based applications. He is the author of Superscribe - a graph based routing framework, and the OData library Linq to Querystring.
\n","Links":[{"Icon":"icon-globe","Url":"http://roysvork.wordpress.com"},{"Icon":"icon-twitter","Url":"http://twitter.com/roysvork"}],"Sessions":[{"Id":1106,"Title":"Beyond responsive design - UI for the modern web application","Abstract":"\r\n Applications written for the modern web are being consumed not just on desktop browsers, but also on a myriad of other devices... even watches and glasses. If you design your application with a pc screen in mind, at worst you're either cutting your userbase in half or setting yourself up for an expensive redesign.
\n\nIn this talk I'll introduce you to some modern web design constructs, and the technologies that bring them to life. Learn how to create apps that work just as well on phone, mobile and desktop with no extra effort, and without restrictive layout frameworks. Who knows... you may even even see things that begin to rival native apps!
\n\r\n"}]},{"Id":3323,"Name":" Peter Mounce","Bio":"","Links":[],"Sessions":[{"Id":2115,"Title":"Embracing DevOps at JUST EAT, within a Microsoft platform","Abstract":"\r\n JUST EAT changed its culture towards embracing DevOps principles, and heavily leveraged AWS to achieve it.
\n\nWe're a successful online takeaway ecommerce website running on a Microsoft-based platform.
\n\nCome learn how we:
\n\n\nre-organised our teams and our platform to loosely couple them \nre-organised our architecture to be more modular \nmade it possible for developers to operate their code in production directly, starting with shoot-it-in-the-head debugging \nmade it possible for developers to continuously ship changes \neliminated most differences between production and qa environments \nbecame more resilient as a happy by-product \n \n\r\n"}]},{"Id":34,"Name":" Phillip Trelford","Bio":"","Links":[],"Sessions":[{"Id":1114,"Title":"All your types are belong to us!","Abstract":"\r\n Big Data tasks typically require acquiring and analysing data from a wide variety of data sources, visualizing the data and applying a barrage of statistical algorithms. This talk will show how this can be accomplished in Visual Studio on Windows or Xamarin Studio on Mac and Linux using F#'s REPL and Type Providers. \nType Providers give typed access to a wide range of data sources from CSV, JSON and XML to SQL, OData and Web Services, instantly without a code generation step. The Type Provider mechanism can also be used to analyse data with direct access to statistical packages like R and MATLAB as well as all the existing .Net libraries.\nFinally visualizations can be generated using F#'s desktop charting libraries, or with ASP.Net and even JavaScript libraries like HighCharts.\nExpect a sprinkling of anecdotes drawn from experiences working on large machine learning systems at Microsoft, and plenty of live demos.
\n\r\n"}]},{"Id":2314,"Name":" Sam Hogarth","Bio":"Sam works with .NET at Nonlinear Dynamics, creating software to analyse proteomics and metabolomics experiments. Previously he has built desktop and web-based trading applications for some of the world's largest financial institutions, developed for two charting products (Visiblox and ShinobiControls) and contributed to the PropertyCross open-source project.
\n\nIn his spare time he runs, plays a ridiculous amount of board games, co-organises Newcastle Skeptics in the Pub and builds Android apps - including a scheduling app for DDD East Anglia! ;)
\n","Links":[{"Icon":"icon-globe","Url":"http://samhogy.co.uk"},{"Icon":"icon-twitter","Url":"http://twitter.com/samhogy"}],"Sessions":[{"Id":2109,"Title":"Keeping it responsive - cross-platform MVVM with ReactiveUI","Abstract":"\r\n Building an awesome user interface is hard work. You've got the complexities of real life to deal with - handling user inputs, dealing with slow network connections and managing background workers. There's also this testing thing that people keep going on about!
\n\nWe need a way of handling the real world, whilst behaving in a predictable and responsive manner. Enter ReactiveUI, a fusion of MVVM and the Reactive Extensions (Rx) for .NET applications.
\n\nIn this session I'll introduce ReactiveUI, show you some tips and tricks, discuss the benefits and tradeoffs of the framework and show how it can be used as a solid foundation for building cross-platform .NET applications.
\n\r\n"}]},{"Id":4328,"Name":" Stephen Harrison","Bio":"","Links":[{"Icon":"icon-globe","Url":"http://Tinamous.com"},{"Icon":"icon-twitter","Url":"http://twitter.com/TinamousSteve"}],"Sessions":[{"Id":3119,"Title":"A Brief Introduction to Making your own (Internet of Things) Thing.","Abstract":"\r\n The Internet of Things is exploding and it's a great time to join in: more and more devices like the Arduino, Netduino and Gadgeteer are becoming available. The question is, how do I get started?
\n\nWe will look at what is available in terms of popular hardware for building your Thing, and a demo of how to develop for the Arduino, followed by an introduction to the Gadgeteer and .Net Micro Framework, hopefully finishing up with a fairly simple but connected Gadgeteer based Thing (Wifi Allowing!).
\n\r\n"}]},{"Id":4332,"Name":" Tomas Petricek","Bio":"","Links":[],"Sessions":[{"Id":3132,"Title":"Taking your craft seriously with F#","Abstract":"\r\n Many standard F# libraries and tools, including the compiler itself, are developed as open-source and have a large number of contributors. To successfully build such projects, you need to be serious about your craft. This includes comprehensive testing, using automated build tools, continuous integration, as well as creating great documentation and tutorials. In this talk, I'll talk about what I learned as an open-source F# contributor.
\n\nAlong the way, we'll look a number of risk-free ways of introducing F# into your workflow:
\n\n\nHow to use F# Interactive for explorative programming and writing code that works on the first try \nUsing FAKE - an F# build tool - to automate everything in your build process \nWriting readable unit tests with F# and using FsCheck for property-based testing \nGenerating great documentation using F# Formatting tools \n \n\nIn summary, this talk is a walkthrough covering some of the software engineering aspects of programming that have been working extremely well for the F# open-source ecosystem. After the talk, you'll have a good idea how to use some of the techniques in your daily job - but you may as well become an F# contributor!
\n\r\n"}]}]
\ No newline at end of file
diff --git a/BeyondResponsiveDesign.Menus/images/venue.jpg b/BeyondResponsiveDesign.Menus/images/venue.jpg
deleted file mode 100644
index f04b902..0000000
Binary files a/BeyondResponsiveDesign.Menus/images/venue.jpg and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/logo-large.png b/BeyondResponsiveDesign.Menus/logo-large.png
deleted file mode 100644
index 9e98711..0000000
Binary files a/BeyondResponsiveDesign.Menus/logo-large.png and /dev/null differ
diff --git a/BeyondResponsiveDesign.Menus/logo.svg b/BeyondResponsiveDesign.Menus/logo.svg
deleted file mode 100644
index fb92405..0000000
--- a/BeyondResponsiveDesign.Menus/logo.svg
+++ /dev/null
@@ -1,148 +0,0 @@
-
-
-
-
-
-
-
-
-
-
-
- image/svg+xml
-
-
-
-
-
-
-
- DeveloperDeveloper Developer !
- East Anglia
-
diff --git a/BeyondResponsiveDesign.Menus/packages.config b/BeyondResponsiveDesign.Menus/packages.config
deleted file mode 100644
index 504a8fb..0000000
--- a/BeyondResponsiveDesign.Menus/packages.config
+++ /dev/null
@@ -1,12 +0,0 @@
-
-
-
\ No newline at end of file
diff --git a/BeyondResponsiveDesign.Menus/styles/styles.css.map b/BeyondResponsiveDesign.Menus/styles/styles.css.map
deleted file mode 100644
index a28f221..0000000
--- a/BeyondResponsiveDesign.Menus/styles/styles.css.map
+++ /dev/null
@@ -1,9 +0,0 @@
-{
- "version": 3,
- "file": "styles.css",
- "sources": [
- "styles.less"
- ],
- "names": [],
- "mappings": "AAYA;EACI,eAAA;EACA,WAAA;EACA,YAAA;;AAGJ;EAbI,kBAAA;EACA,MAAA;EACA,OAAA;EACA,QAAA;EACA,SAAA;EAWA,gBAAA;;AAGJ;EACI,gBAAA;;AADJ,gBAGI;EACI,YAAA;;AAJR,gBAGI,mBAGI;EACI,iBAAA;;AAKZ;EACI,gBAAA;EACA,iCAAA;;AAGJ;EACI,kBAAA;EACA,iCAAA;;AAGJ;EACI,gBAAA;EACA,iCAAA;;AAEA,QAAE;EACE,qBAAA;EACA,eAAA;;AAIR;AAAkB;EAlDd,kBAAA;EACA,MAAA;EACA,OAAA;EACA,QAAA;EACA,SAAA;EAgDA,yBAAA;EACA,YAAA;EACA,eAAA;;AAGJ;EACI,QAAA;;AAGJ,GAAG;EACC,gBAAA;EACA,iBAAA;EACA,kBAAA;EACA,kBAAA;EACA,aAAA;EACA,kBAAA;EACA,kBAAA;;AAEA,GATD,MASE;EACG,mBAAA;;AAVR,GAAG,MAaC,KAAK;EACD,WAAA;;AAIR,IAAK;EA/ED,kBAAA;EACA,MAAA;EACA,OAAA;EACA,QAAA;EACA,SAAA;EA6EA,UAAA;EACA,WAAA;EACA,WAAA;EACA,WAAA;;AALJ,IAAK,SAOD;EACI,kBAAA;EACA,MAAA;EACA,OAAA;EACA,WAAA;;AAXR,IAAK,SAcD;EACI,WAAA;EACA,WAAA;;AAhBR,IAAK,SAcD,KAII;EACI,gBAAA;EACA,WAAA;EACA,qBAAA;;AAEA,IAvBP,SAcD,KAII,KAKK;EACG,aAAA;EACA,kBAAA;EACA,UAAA;EACA,cAAA;;AAGJ,IA9BP,SAcD,KAII,KAYK;EACG,aAAA;EACA,kBAAA;EACA,UAAA;EACA,cAAA;EACA,YAAA;;AAnChB,IAAK,SAcD,KAII,KAoBI;EACI,gBAAA;;AAvChB,IAAK,SAcD,KA6BI,KAAI,KAAM;EACN,kBAAA;EACA,MAAA;EACA,OAAA;EACA,cAAA;EACA,WAAA;EACA,UAAA;;AAjDZ,IAAK,SAcD,KA6BI,KAAI,KAAM,IAQN;EACI,cAAA;EACA,YAAA;EACA,gBAAA;EACA,gBAAA;EACA,0BAAA;;AAMhB,IAAK;EA7ID,kBAAA;EACA,QAAA;EACA,OAAA;EACA,QAAA;EACA,SAAA;EA2IA,aAAA;EACA,iBAAA;EACA,UAAA;EACA,uBAAA;;AAGJ,IAAK;EArJD,kBAAA;EACA,QAAA;EACA,OAAA;EACA,QAAA;EACA,SAAA;;AAiJJ,IAAK,OAGD;EAxJA,kBAAA;EACA,MAAA;EACA,YAAA;EACA,QAAA;EACA,SAAA;EAeA,gBAAA;;AAkIJ,IAAK,OAGD,UAnIA;EACI,YAAA;;AA+HR,IAAK,OAGD,UAnIA,mBAGI;EACI,iBAAA;;AA4HZ,IAAK,OAGD,UAII,qBAAqB;EACjB,aAAA;;AAEA,IAVP,OAGD,UAII,qBAAqB,YAGhB;EACG,cAAA;;AAOhB,IAAK,OAAO,QAAO;EACf,kBAAA;EACA,MAAA;EACA,QAAA;EACA,UAAA;EACA,SAAA;EACA,gBAAA;EACA,eAAA;EACA,aAAA;;AAEA,IAVC,OAAO,QAAO,cAUd;EACG,cAAA;;AAGJ,IAdC,OAAO,QAAO,cAcd;EACG,UAAA;;AAfR,IAAK,OAAO,QAAO,cAkBf;EAzLA,kBAAA;EACA,MAAA;EACA,OAAA;EACA,QAAA;EACA,SAAA;EAuLI,uBAAA;;AAIR,IAAK,OAAO,UAAU,MAAK;EACvB,kBAAA;EACA,eAAA;;AAFJ,IAAK,OAAO,UAAU,MAAK,QAIvB;EACI,WAAA;EACA,eAAA;EACA,WAAA;;AAPR,IAAK,OAAO,UAAU,MAAK,QAUvB;EACI,eAAA;EACA,WAAA;;AAZR,IAAK,OAAO,UAAU,MAAK,QAUvB,KAII;EACI,cAAA;EACA,WAAA"
-}
\ No newline at end of file
diff --git a/BeyondResponsiveDesign.Menus/styles/theme.css.map b/BeyondResponsiveDesign.Menus/styles/theme.css.map
deleted file mode 100644
index 357415f..0000000
--- a/BeyondResponsiveDesign.Menus/styles/theme.css.map
+++ /dev/null
@@ -1,9 +0,0 @@
-{
- "version": 3,
- "file": "theme.css",
- "sources": [
- "theme.less"
- ],
- "names": [],
- "mappings": "AAmCA;EACI,aAAa,UAAb;EACA,SAAS,+DAAT;EACA,SAAS,sEAAsE,OAAO,YAAY,iEAAiE,OAAO,aAAa,gEAAgE,OAAO,iBAAiB,wEAAwE,OAAO,MAA9V;;AAGJ;EACI,2BAAA;EACA,wBAAA;EACA,uBAAA;EACA,sBAAA;EACA,mBAAA;;AAGJ;EACI,aArCQ,YAAW,kBAAiB,aAAY,SAAQ,YAqCxD;EACA,cAAA;EACA,gBAAA;EACA,gBAAA;EACA,SAAA;;AAGJ;EACI,cAAA;EACA,gBAAA;EACA,qBAAA;EACA,6CAAA;;AAGJ;EACI,mBAAA;EACA,UAAA;EACA,oBAAA;;AAGJ;AAAI;AAAI;EACJ,aA1DQ,YAAW,kBAAiB,aAAY,SAAQ,YA0DxD;EACA,kBAAA;EACA,uBAAA;EACA,UAAA;EACA,cAAA;EACA,cAAA;;AAGJ,CAAC;EACG,cAAA;;AAGJ;EACI,WAAA;EACA,yBAAA;EACA,iBAAA;EACA,UAAA;EACA,SAAA;EACA,iBAAA;EACA,kBAAA;;AAEA,KAAC,OAAQ,QAAQ,KAAI,IAAI;EACrB,YAAA;EACA,cAAA;;AAGJ,KAAC,cAAe,QAAQ,KAAK;EACzB,cAAA;EACA,WAAA;;AAGJ,KAAC,cAAe,QAAQ,KAAK,KAAK;EA5DlC,2BAAA;EACA,wBAAA;EACA,uBAAA;EACA,sBAAA;EACA,mBAAA;;AAqCJ,KAuBI,QAAQ;EACJ,gCAAA;EACA,eAAA;;AAzBR,KAuBI,QAAQ,KAIJ;EACI,mBAAA;EACA,gCAAA;EACA,gBAAA;EACA,gBAAA;;AA/BZ,KAuBI,QAAQ,KAIJ,KAMI;EACI,gBAAA;EACA,WAAA;;AAMhB,GAAG;EACC,mBAAA;EACA,gBAAA;EACA,2BAAA;EACA,8CAAA;EACA,sCAAA;EACA,kBAAA;EACA,cAAA;EACA,UAAA;;AARJ,GAAG,MAUC;EACI,qBAAA;EACA,cAAA;EACA,UAAA;EACA,SAAA;;AAdR,GAAG,MAUC,KAMI;EACI,WAAA;EACA,cAAA;EACA,SAAA;EACA,UAAA;EACA,sBAAA;EACA,cAAA;EACA,eAAA;EACA,cAAA;EACA,WAAA;EACA,gBAAA;EACA,2BAAA;EACA,0BAAA;EACA,uBAAA;EACA,mBAAA;;AAEA,GAhCT,MAUC,KAMI,KAgBK,IAAI;EACD,8BAAA;;AAjChB,GAAG,MAUC,KAMI,KAoBI;EACI,mBAAA;EACA,cAAA;EACA,qBAAA;EACA,cAAA;EACA,4BAAA;EACA,oBAAA;EACA,2BAAA;EACA,0BAAA;EACA,uBAAA;;AAMhB,IAAK;EACD,mBAAA;EACA,4CAAA;EACA,MAAM,+BAAN;;AAHJ,IAAK,SAKD;EACI,gBAAA;EACA,gBAAA;EACA,gBAAA;EACA,cAAA;EACA,kBAAA;EACA,cAAA;;AAXR,IAAK,SAcD;EACI,WAAA;EACA,cAAA;EACA,SAAA;EACA,UAAA;EACA,qBAAA;EACA,mBAAA;;AAEA,IAtBH,SAcD,KAQK;EACG,YAAA;;AAvBZ,IAAK,SAcD,KAYI;EACI,kBAAA;EACA,WAAA;EACA,SAAA;EACA,mBAAA;EACA,gBAAA;EACA,cAAA;EACA,aAAA;EACA,UAAA;EACA,gBAAA;EACA,cAAA;;AApCZ,IAAK,SAcD,KAYI,KAYI;EACI,cAAA;EACA,gBAAA;;AAxChB,IAAK,SAcD,KAYI,KAiBI;EACI,cAAA;EACA,WAAA;EACA,0BAAA;EACA,cAAA;EACA,aAAA;EACA,6CAAA;EACA,SAAA;;AAEA,IApDX,SAcD,KAYI,KAiBI,IASK;EACG,cAAA;;AArDpB,IAAK,SAcD,KAYI,KAiBI,IAaI;EACI,SAAA;EACA,UAAA;;AA1DpB,IAAK,SAcD,KAYI,KAiBI,IAaI,IAII;EACI,mBAAA;;AAIR,IAjEX,SAcD,KAYI,KAiBI,IAsBK;EACG,cAAA;EACA,eAAA;EACA,qBAAA;;AAIR,IAxEP,SAcD,KAYI,KA8CK;EACG,cAAA;EACA,eAAA;EACA,mBAAA;;AAMhB,IAAK;EACD,yBAAA;EACA,6CAAA;EACA,UAAA;EACA,SAAA;;AAJJ,IAAK,MAMD,MAAM,MAAM;EACR,qBAAA;EACA,cAAA;EACA,SAAA;EACA,UAAA;EACA,WAAA;;AAXR,IAAK,MAMD,MAAM,MAAM,KAOR;EACI,cAAA;EACA,cAAA;EACA,UAAA;EACA,SAAA;EACA,sBAAA;EACA,kBAAA;;AAnBZ,IAAK,MAMD,MAAM,MAAM,KAOR,KAQI;EACI,sBAAA;;AAtBhB,IAAK,MAMD,MAAM,MAAM,KAOR,KAYI;EACI,kBAAA;EACA,UAAA;;AA3BhB,IAAK,MAMD,MAAM,MAAM,KAOR,KAYI,IAII;EACI,cAAA;EACA,gBAAA;EACA,sBAAA;EACA,cAAA;EACA,gBAAA;EACA,SAAA;EACA,0BAAA;EACA,0BAAA;EACA,2BAAA;EACA,0BAAA;EACA,uBAAA;EACA,mBAAA;EACA,gBAAA;EACA,kBAAA;;AA3CpB,IAAK,MAMD,MAAM,MAAM,KAOR,KAYI,IAII,KAgBI;EACI,mBAAA;EACA,gBAAA;EACA,2BAAA;EACA,0BAAA;EACA,uBAAA;;AAlDxB,IAAK,MAMD,MAAM,MAAM,KAOR,KAYI,IAII,KAwBI,IAAG;EACC,WAAA;EACA,aAAA;EACA,iBAAA;EACA,oBAAA;EACA,aAAA;;AA1DxB,IAAK,MAMD,MAAM,MAAM,KAOR,KAkDI;EACI,gBAAA;;EAEA,YAAA;;AAlEhB,IAAK,MAMD,MAAM,MAAM,KAOR,KAkDI,MAKI;EACI,qBAAA;EACA,cAAA;EACA,SAAA;EACA,UAAA;;AAxEpB,IAAK,MAMD,MAAM,MAAM,KAOR,KAkDI,MAKI,KAMI;EACI,kBAAA;EACA,iBAAA;EACA,cAAA;EACA,SAAA;EACA,UAAA;EACA,sBAAA;EACA,cAAA;EACA,kBAAA;;AAlFxB,IAAK,MAMD,MAAM,MAAM,KAOR,KAkDI,MAKI,KAMI,KAUI;EACI,cAAA;EACA,SAAA;EACA,2BAAA;EACA,cAAA;EACA,aAAA;EACA,mBAAA;EACA,gBAAA;EACA,2BAAA;EACA,0BAAA;EACA,uBAAA;;AA9F5B,IAAK,MAMD,MAAM,MAAM,KAOR,KAkDI,MAKI,KAMI,KAUI,IAYI,IAAG;EACC,WAAA;EACA,aAAA;EACA,iBAAA;EACA,cAAA;EACA,kBAAA;;AAGJ,IAxGvB,MAMD,MAAM,MAAM,KAOR,KAkDI,MAKI,KAMI,KAUI,IAoBK;EACG,cAAA;;AAIR,IA7GnB,MAMD,MAAM,MAAM,KAOR,KAkDI,MAKI,KAMI,KAmCK,OACG;EACI,cAAA;;AAOpB,IAtHP,MAMD,MAAM,MAAM,KAOR,KAyGK,OACG;EACI,gBAAA;EACA,YAAA;;AAIQ,IA7HvB,MAMD,MAAM,MAAM,KAOR,KAyGK,OACG,MAII,KACI,KACK;EACG,yBAAA;EACA,cAAA;;AAFJ,IA7HvB,MAMD,MAAM,MAAM,KAOR,KAyGK,OACG,MAII,KACI,KACK,OAIG;EACI,cAAA;;AAZxB,IAtHP,MAMD,MAAM,MAAM,KAOR,KAyGK,OAmBG;EACI,cAAA;EACA,qBAAA;EACA,yBAAA;;AAtBR,IAtHP,MAMD,MAAM,MAAM,KAOR,KAyGK,OAmBG,IAKI;EACI,cAAA;EACA,qBAAA;EACA,yBAAA;;AA3BZ,IAtHP,MAMD,MAAM,MAAM,KAOR,KAyGK,OAmBG,IAKI,KAKI,IAAG;EACC,sBAAsB,2BAAtB;;AAS5B,IAAK;EACD,mBAAA;;AAGI,IAJH,OAGD,QACK,aAAc;EACX,+BAAA;;AALZ,IAAK,OAGD,QAKI,SACI;EACI,gBAAA;EACA,cAAA;EACA,WAAA;EACA,sBAAA;EACA,gCAAA;EACA,SAAA;EACA,mBAAA;EACA,gBAAA;EACA,2BAAA;EACA,0BAAA;EACA,uBAAA;;AApBhB,IAAK,OAGD,QAKI,SACI,KAaI,IAAG;EACC,kBAAA;EACA,cAAA;EACA,cAAA;EACA,gBAAA;EACA,iBAAA;;AA3BpB,IAAK,OAGD,QAKI,SACI,KAqBI;EACI,yBAAA;EACA,gBAAA;EACA,mBAAA;EACA,cAAA;;AAOpB,IAAK,OAAO,QAAO;EACf,qDAAA;EACA,6CAAA;;AAFJ,IAAK,OAAO,QAAO,cAIf,UAAS;EACL,mBAAA;;AAIR,IAAK,OAAO,UAAU,MAAK,QACvB;EACI,sBAAA;EACA,gBAAA;;AAHR,IAAK,OAAO,UAAU,MAAK,QAMvB;EACI,qBAAA;EACA,oBAAA;EACA,mBAAA;EACA,SAAA;;AAEA,IAZH,OAAO,UAAU,MAAK,QAMvB,KAMK;EACG,kBAAA;EACA,SAAA;EACA,OAAA;EACA,QAAA;EACA,SAAS,GAAT;EACA,WAAA;EACA,gCAAA;;AAnBZ,IAAK,OAAO,UAAU,MAAK,QAMvB,KAgBI;EACI,UAAA;EACA,mBAAA;EACA,cAAA;EACA,SAAA;EACA,eAAA;EACA,gBAAA;;AA5BZ,IAAK,OAAO,UAAU,MAAK,QAMvB,KAgBI,KAQI;EACI,kBAAA;EACA,kBAAA;EACA,WAAA;EACA,WAAA;EACA,gCAAA;;AAGJ,IAtCP,OAAO,UAAU,MAAK,QAMvB,KAgBI,KAgBK,OACG;EACI,mBAAA;;AAFR,IAtCP,OAAO,UAAU,MAAK,QAMvB,KAgBI,KAgBK,OAKG;EACI,cAAA;;AA5CpB,IAAK,OAAO,UAAU,MAAK,QAMvB,KAgBI,KA0BI;EACI,gBAAA;EACA,kBAAA;EACA,qBAAA;EACA,cAAA;EACA,eAAA;EACA,0BAAA;EACA,mBAAA;EACA,wBAAA;;AAxDhB,IAAK,OAAO,UAAU,MAAK,QAMvB,KAgBI,KA0BI,IAUI;EACI,gBAAA;EACA,2BAAA;;AAGJ,IA/DX,OAAO,UAAU,MAAK,QAMvB,KAgBI,KA0BI,IAeK;EACG,cAAA"
-}
\ No newline at end of file
diff --git a/BeyondResponsiveDesign.Menus/styles/transforms.css.map b/BeyondResponsiveDesign.Menus/styles/transforms.css.map
deleted file mode 100644
index 4629610..0000000
--- a/BeyondResponsiveDesign.Menus/styles/transforms.css.map
+++ /dev/null
@@ -1,9 +0,0 @@
-{
- "version": 3,
- "file": "transforms.css",
- "sources": [
- "transforms.less"
- ],
- "names": [],
- "mappings": "AAWA;EANI,wCAAA;EACA,qCAAA;EACA,mCAAA;EACA,gCAAA;;AAOJ,GAAG,gBAAiB;EAChB,eAAA;EACA,YAAA;;AAIA,IADA,cAAe,SAAS,KAAK,KAC5B;EACG,cAAA;;AAGJ,IALA,cAAe,SAAS,KAAK,KAK5B;EACG,aAAA;;AAKJ,IADA,IAAI,gBAAiB,SAAS,KAAK,KAClC;EACG,aAAA;;AAIR,IAAK,MAAM,MAAM,MAAM,KAAK,KAAI,IAAI,SAAU;EAC1C,gBAAA;EACA,SAAA;;AAFJ,IAAK,MAAM,MAAM,MAAM,KAAK,KAAI,IAAI,SAAU,MAI1C;EACI,mBAAmB,wBAAnB;EACA,eAAe,wBAAf;EACA,gBAAgB,wBAAhB;EACA,cAAc,wBAAd;EACA,WAAW,wBAAX;;AAIR,IAAK,MAAM,MAAM,MAAM,KAAK,KAAI,OAAQ,MAAM;EAC1C,mBAAmB,oBAAnB;EACA,eAAe,oBAAf;EACA,gBAAgB,oBAAhB;EACA,cAAc,oBAAd;EACA,WAAW,oBAAX;EAjDA,wCAAA;EACA,qCAAA;EACA,mCAAA;EACA,gCAAA;;AAkDJ,IAAK,OAAO,UAAU,MAAK;EACvB,YAAA;EACA,gCAAA;;AAFJ,IAAK,OAAO,UAAU,MAAK,kBAIvB;EAzDA,wCAAA;EACA,qCAAA;EACA,mCAAA;EACA,gCAAA;;AAyDI,IAPH,OAAO,UAAU,MAAK,kBAIvB,UAGK;EACG,kBAAA;EACA,cAAA;EACA,QAAA;EACA,OAAA;EACA,QAAA;EACA,SAAA;;AAGJ,IAhBH,OAAO,UAAU,MAAK,kBAIvB,UAYK;EACG,mBAAmB,uBAAnB;EACA,gBAAgB,uBAAhB;EACA,eAAe,uBAAf;EACA,cAAc,uBAAd;EACA,WAAW,uBAAX;;AAGJ,IAxBH,OAAO,UAAU,MAAK,kBAIvB,UAoBK;EACG,mBAAmB,wBAAnB;EACA,gBAAgB,wBAAhB;EACA,eAAe,wBAAf;EACA,cAAc,wBAAd;EACA,WAAW,wBAAX;;AAKZ,IAAK,OAAO,UAAU,MAAK,QAAS,KAAK,KACrC;EACI,cAAA;;AAGJ,IALC,OAAO,UAAU,MAAK,QAAS,KAAK,KAKpC,QAAS;EACN,mBAAmB,uBAAnB;EACA,eAAe,uBAAf;EACA,gBAAgB,uBAAhB;EACA,cAAc,uBAAd;EACA,WAAW,uBAAX;EAjGJ,wCAAA;EACA,qCAAA;EACA,mCAAA;EACA,gCAAA;;AAkGA,IAdC,OAAO,UAAU,MAAK,QAAS,KAAK,KAcpC,SAAU;EACP,mBAAmB,wBAAnB;EACA,eAAe,wBAAf;EACA,gBAAgB,wBAAhB;EACA,cAAc,wBAAd;EACA,WAAW,wBAAX;EA1GJ,wCAAA;EACA,qCAAA;EACA,mCAAA;EACA,gCAAA;;AA2GA,IAvBC,OAAO,UAAU,MAAK,QAAS,KAAK,KAuBpC,OAAQ;EACL,mBAAmB,oBAAnB;EACA,eAAe,oBAAf;EACA,gBAAgB,oBAAhB;EACA,cAAc,oBAAd;EACA,WAAW,oBAAX;EAnHJ,wCAAA;EACA,qCAAA;EACA,mCAAA;EACA,gCAAA;;AAqHJ,IAAK,OAAO,QAAO;EAxHf,wCAAA;EACA,qCAAA;EACA,mCAAA;EACA,gCAAA;EAuHA,cAAA;;AAEA,IAJC,OAAO,QAAO,cAId;EACG,mBAAmB,uBAAnB;EACA,gBAAgB,uBAAhB;EACA,eAAe,uBAAf;EACA,cAAc,uBAAd;EACA,WAAW,uBAAX;;AAcR,wBAV0C;EACtC,IAAK;EACL,IAAK,OAAO;IAvIZ,wCAAA;IACA,qCAAA;IACA,mCAAA;IACA,gCAAA;;EAuIA,IAAK,OAAO,QAAO,cAAc;IAC7B,UAAA;;;AAoDR,wBAhD0C;EACtC,KAAK,cAAe,QAAQ,KAAK,KAAK;IAClC,eAAA;;EAGJ,IACI,SAAS,KAAK,KAAI;IACd,cAAA;IACA,YAAA;IAvJR,wCAAA;IACA,qCAAA;IACA,mCAAA;IACA,gCAAA;;EAiJA,IAOI;IACI,aAAA;IACA,iBAAA;IA7JR,wCAAA;IACA,qCAAA;IACA,mCAAA;IACA,gCAAA;;EAiJA,IAaI,OAAO;IACH,OAAA;IACA,iBAAA;IAnKR,wCAAA;IACA,qCAAA;IACA,mCAAA;IACA,gCAAA;;EAqKA,IAAI,QAAS,SAAS,KAAK,KAAI;IAC3B,YAAA;;EAGJ,IAAI,QAAS;EACb,IAAI,QAAS,OAAO;IAChB,mBAAmB,kBAAnB;IACA,eAAe,kBAAf;IACA,gBAAgB,kBAAhB;IACA,cAAc,kBAAd;IACA,WAAW,kBAAX;;EAGJ,IAAI,IAAI,UAAW;EACnB,IAAI,IAAI,UAAW,OAAO;IACtB,mBAAmB,aAAnB;IACA,eAAe,aAAf;IACA,gBAAgB,aAAhB;IACA,cAAc,aAAd;IACA,WAAW,aAAX;;;AA4BR,wBAxB0C;EACtC,GAAG;IACC,eAAA;IACA,SAAA;IACA,WAAA;IACA,eAAA;IACA,eAAA;IACA,gBAAgB,uBAAhB;IACA,eAAe,uBAAf;IACA,cAAc,uBAAd;IACA,mBAAmB,uBAAnB;IACA,WAAW,uBAAX;IA1MJ,wCAAA;IACA,qCAAA;IACA,mCAAA;IACA,gCAAA;;EA0MI,GAbD,MAaE;IACG,gBAAgB,oBAAhB;IACA,eAAe,oBAAf;IACA,cAAc,oBAAd;IACA,mBAAmB,oBAAnB;IACA,WAAW,oBAAX;;;AAoBZ,wBAf0C;EAElC,KADE,QAAQ,KAAK,KACd;IACG,aAAA;;EAIR,IAAK,OAAO,QAAO;IACf,WAAA;IACA,eAAA;IACA,eAAA;IACA,OAAA;IACA,mBAAA"
-}
\ No newline at end of file
diff --git a/BeyondResponsiveDesign.sln b/BeyondResponsiveDesign.sln
index 5322992..086a68e 100644
--- a/BeyondResponsiveDesign.sln
+++ b/BeyondResponsiveDesign.sln
@@ -1,10 +1,8 @@
Microsoft Visual Studio Solution File, Format Version 12.00
# Visual Studio 2013
-VisualStudioVersion = 12.0.30723.0
+VisualStudioVersion = 12.0.31101.0
MinimumVisualStudioVersion = 10.0.40219.1
-Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "BeyondResponsiveDesign.Menus", "BeyondResponsiveDesign.Menus\BeyondResponsiveDesign.Menus.csproj", "{54C61F9C-7B4B-4071-A7FB-5A9FE4D9777D}"
-EndProject
Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "DataScraper", "DataScraper\DataScraper.csproj", "{F9BA2DCB-6095-481E-B1A8-1BC44FC075CC}"
EndProject
Global
@@ -13,10 +11,6 @@ Global
Release|Any CPU = Release|Any CPU
EndGlobalSection
GlobalSection(ProjectConfigurationPlatforms) = postSolution
- {54C61F9C-7B4B-4071-A7FB-5A9FE4D9777D}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
- {54C61F9C-7B4B-4071-A7FB-5A9FE4D9777D}.Debug|Any CPU.Build.0 = Debug|Any CPU
- {54C61F9C-7B4B-4071-A7FB-5A9FE4D9777D}.Release|Any CPU.ActiveCfg = Release|Any CPU
- {54C61F9C-7B4B-4071-A7FB-5A9FE4D9777D}.Release|Any CPU.Build.0 = Release|Any CPU
{F9BA2DCB-6095-481E-B1A8-1BC44FC075CC}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
{F9BA2DCB-6095-481E-B1A8-1BC44FC075CC}.Debug|Any CPU.Build.0 = Debug|Any CPU
{F9BA2DCB-6095-481E-B1A8-1BC44FC075CC}.Release|Any CPU.ActiveCfg = Release|Any CPU
diff --git a/BeyondResponsiveDesign/.idea/.name b/BeyondResponsiveDesign/.idea/.name
new file mode 100644
index 0000000..aa40113
--- /dev/null
+++ b/BeyondResponsiveDesign/.idea/.name
@@ -0,0 +1 @@
+BeyondResponsiveDesign
\ No newline at end of file
diff --git a/BeyondResponsiveDesign/.idea/BeyondResponsiveDesign.iml b/BeyondResponsiveDesign/.idea/BeyondResponsiveDesign.iml
new file mode 100644
index 0000000..c956989
--- /dev/null
+++ b/BeyondResponsiveDesign/.idea/BeyondResponsiveDesign.iml
@@ -0,0 +1,8 @@
+
+
+
+
+
\ No newline at end of file
diff --git a/BeyondResponsiveDesign/.idea/deployment.xml b/BeyondResponsiveDesign/.idea/deployment.xml
new file mode 100644
index 0000000..994c4bd
--- /dev/null
+++ b/BeyondResponsiveDesign/.idea/deployment.xml
@@ -0,0 +1,4 @@
+
+
+
\ No newline at end of file
diff --git a/BeyondResponsiveDesign/.idea/encodings.xml b/BeyondResponsiveDesign/.idea/encodings.xml
new file mode 100644
index 0000000..d821048
--- /dev/null
+++ b/BeyondResponsiveDesign/.idea/encodings.xml
@@ -0,0 +1,4 @@
+
+
+
\ No newline at end of file
diff --git a/BeyondResponsiveDesign/.idea/misc.xml b/BeyondResponsiveDesign/.idea/misc.xml
new file mode 100644
index 0000000..8662aa9
--- /dev/null
+++ b/BeyondResponsiveDesign/.idea/misc.xml
@@ -0,0 +1,4 @@
+
+
+
\ No newline at end of file
diff --git a/BeyondResponsiveDesign/.idea/modules.xml b/BeyondResponsiveDesign/.idea/modules.xml
new file mode 100644
index 0000000..470553a
--- /dev/null
+++ b/BeyondResponsiveDesign/.idea/modules.xml
@@ -0,0 +1,8 @@
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/BeyondResponsiveDesign/.idea/scopes/scope_settings.xml b/BeyondResponsiveDesign/.idea/scopes/scope_settings.xml
new file mode 100644
index 0000000..922003b
--- /dev/null
+++ b/BeyondResponsiveDesign/.idea/scopes/scope_settings.xml
@@ -0,0 +1,5 @@
+
+
+
+
\ No newline at end of file
diff --git a/BeyondResponsiveDesign/.idea/vcs.xml b/BeyondResponsiveDesign/.idea/vcs.xml
new file mode 100644
index 0000000..6c0b863
--- /dev/null
+++ b/BeyondResponsiveDesign/.idea/vcs.xml
@@ -0,0 +1,6 @@
+
+
+
+
+
\ No newline at end of file
diff --git a/BeyondResponsiveDesign/.idea/watcherTasks.xml b/BeyondResponsiveDesign/.idea/watcherTasks.xml
new file mode 100644
index 0000000..b0c425c
--- /dev/null
+++ b/BeyondResponsiveDesign/.idea/watcherTasks.xml
@@ -0,0 +1,31 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/BeyondResponsiveDesign/.idea/workspace.xml b/BeyondResponsiveDesign/.idea/workspace.xml
new file mode 100644
index 0000000..9c8431f
--- /dev/null
+++ b/BeyondResponsiveDesign/.idea/workspace.xml
@@ -0,0 +1,1424 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ true
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ true
+
+
+
+
+
+
+
+
+
+
+ 1422990778861
+ 1422990778861
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/BeyondResponsiveDesign/content/agenda-friday.html b/BeyondResponsiveDesign/content/agenda-friday.html
new file mode 100644
index 0000000..0100b98
--- /dev/null
+++ b/BeyondResponsiveDesign/content/agenda-friday.html
@@ -0,0 +1,3846 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/BeyondResponsiveDesign/content/agenda-friday.json b/BeyondResponsiveDesign/content/agenda-friday.json
new file mode 100644
index 0000000..bee87f3
--- /dev/null
+++ b/BeyondResponsiveDesign/content/agenda-friday.json
@@ -0,0 +1,424 @@
+{
+ "Tracks": [
+ {
+ "Id": "Innovation",
+ "Identifier": "1"
+ },
+ {
+ "Id": "Devops",
+ "Identifier": "2"
+ },
+ {
+ "Id": "Mobile",
+ "Identifier": "3"
+ },
+ {
+ "Id": "IoT - Maker - Wearable",
+ "Identifier": "4"
+ },
+ {
+ "Id": "Security - Hack",
+ "Identifier": "5"
+ },
+ {
+ "Id": "Methods",
+ "Identifier": "6"
+ },
+ {
+ "Id": "Big Data - Cloud",
+ "Identifier": "7"
+ },
+ {
+ "Id": "Languages",
+ "Identifier": "8"
+ }
+ ],
+ "TimeSlots": [
+ {
+ "Id": "09:00/09:50",
+ "Info": "Keynote"
+ },
+ {
+ "Id": "10:00/11:00",
+ "Info": null
+ },
+ {
+ "Id": "11:00/11:30",
+ "Info": "Coffee break"
+ },
+ {
+ "Id": "11:30/12:10",
+ "Info": null
+ },
+ {
+ "Id": "12:20/13:00",
+ "Info": null
+ },
+ {
+ "Id": "13:00/14:00",
+ "Info": "Lunch time"
+ },
+ {
+ "Id": "14:00/14:40",
+ "Info": null
+ },
+ {
+ "Id": "14:50/15:50",
+ "Info": null
+ },
+ {
+ "Id": "15:50/16:10",
+ "Info": "Coffee break"
+ },
+ {
+ "Id": "16:10/17:10",
+ "Info": null
+ },
+ {
+ "Id": "17:20/18:00",
+ "Info": null
+ }
+ ],
+ "Sessions": [
+ {
+ "Id": "977",
+ "Title": "Windows 10 e il futuro delle Universal App",
+ "TimeSlotId": "10:00/11:00",
+ "TrackId": "1",
+ "Abstract": "Windows 10 è la piattaforma unificata per telefoni, tablet, desktop, Xbox, board, Hololens e Surface Hub. In questa sessione vedremo quali sono le novità principali della nuova piattaforma e come sfruttarle al meglio nelle nostre applicazioni.",
+ "Speaker": "Erica Barone",
+ "SpeakerId": "1176",
+ "Day": "Friday"
+ },
+ {
+ "Id": "979",
+ "Title": "NO. La sottile arte di trovare il tempo dove non esiste.",
+ "TimeSlotId": "11:30/12:10",
+ "TrackId": "1",
+ "Abstract": "Non abbiamo mai tempo per fare nulla. Quante volte avete detto: "Vorrei rilasciare un progetto Open Source" oppure "Vorrei studiare Obj-C e imparare a fare App!". E poi andate su GitHub e trovate persone che hanno rilasciato o contributo a CENTINAIA di progetti, conoscono 6-7 linguaggi di programmazione diversi e parlano a conferenze in giro per l'Italia e l'Europa. Come fanno a gestire il tempo? Sono più bravi di noi? NO è la risposta.",
+ "Speaker": "Matteo Collina",
+ "SpeakerId": "167",
+ "Day": "Friday"
+ },
+ {
+ "Id": "980",
+ "Title": "In Flight Data Fusion. Drones How To and Why",
+ "TimeSlotId": "12:20/13:00",
+ "TrackId": "1",
+ "Abstract": "No one doubts that a drone flights. We will show what there is behind the data fusion of all the data from the single sensors and how/why the drones use them for flight functionality.\r\nToday drones are "isolated systems" with and high need of ideas and software developments to be part of a more integrated world.",
+ "Speaker": "Roberto Collina",
+ "SpeakerId": "1169",
+ "Day": "Friday"
+ },
+ {
+ "Id": "982",
+ "Title": "Building Successful APIs Overnight",
+ "TimeSlotId": "14:00/14:40",
+ "TrackId": "1",
+ "Abstract": "Hackathons have boomed, people attending such events have been consuming thousands of APIs to power their creative projects. However, not everyone can consume APIs like a boss. Companies spend hundreds of thousands of dollars in promoting and ensuring best practices are followed when building APIs.\r\nIn this talk I will give you an overview of how to build a potentially successful API overnight, like hackathoneers do. A recipe for success as a takeaway from this talk will be shared.\r\nTopics covered: Evolution of APIs, Hackathons, REST API Frameworks, API Design, API Editors, API Management",
+ "Speaker": "Orlando K",
+ "SpeakerId": "1062",
+ "Day": "Friday"
+ },
+ {
+ "Id": "983",
+ "Title": "The second screen world in the Google Cast era",
+ "TimeSlotId": "14:50/15:50",
+ "TrackId": "1",
+ "Abstract": "TVs are the biggest, most beautiful screen in people’s living rooms. Google Cast is a technology that enables true multi-screen experiences for the users.\r\n\r\nIntegrating Google Cast into existing applications is simple, and we’re going to cover the SDK and resources available to make your application Cast enabled really easily. Android, iOS and Web.\r\n\r\nPossibilities? Endless: not only casting video or audio, but also games where the TV becomes the new and high-tech game board or a variety of other apps to enjoy with friends, sitting together on the couch.",
+ "Speaker": "Alfredo Morresi",
+ "SpeakerId": "391",
+ "Day": "Friday"
+ },
+ {
+ "Id": "987",
+ "Title": "Good artists copy; Great artists replicate",
+ "TimeSlotId": "10:00/11:00",
+ "TrackId": "2",
+ "Abstract": "Let's talk about replication.\r\n\r\nDatabase replication is probably one of the most misunderstood things in computer science.\r\nSome argue that mongodb's way is the best. Some argue postgres. Some prefer emailing zips of database dumps around the office.\r\n\r\nIn general, replication is a *really hard* problem. However, it is actually pretty simple if you are willing to accept some trade-offs.\r\n\r\nThis talk will be a hands on approach about investigating how we can make replication simpler by building specialized databases. There will be lots of demos.",
+ "Speaker": "Mathias Buus",
+ "SpeakerId": "1020",
+ "Day": "Friday"
+ },
+ {
+ "Id": "989",
+ "Title": "Measuring Micro-services",
+ "TimeSlotId": "11:30/12:10",
+ "TrackId": "2",
+ "Abstract": "Micro-service systems deliver wonderful adaptability to business needs, easy scalability, and low-risk deployment. What's not to like?\r\nYou also end up with a system that's hard to understand, measure and predict. Traditional approaches to monitoring simply aren't powerful enough to handle the emergent properties of a system with lots of moving parts.\r\nThe solution is to apply the scientific method! Anything can be measured. Uncertainty can be reduced, and stability can be an emergent property. We just have to learn the lessons that the natural world can teach us.",
+ "Speaker": "Richard Rodger",
+ "SpeakerId": "1164",
+ "Day": "Friday"
+ },
+ {
+ "Id": "992",
+ "Title": "Continuous Delivery di una webapp by example",
+ "TimeSlotId": "14:00/14:40",
+ "TrackId": "2",
+ "Abstract": "Una feature non è completa finché non è nelle mani di chi la deve usare. Solo da lì inizia a produrre valore, sia economico o feedback. Che si tratti di master, preview o prod, con l’automazione delle build si possono evitare operazioni ripetitive, complesse, risparmiare tempo ed ottenere interessanti metriche. Tutto al fine di arrivare a poter rilasciare ogni poche ore (ogni volta che la build è verde!). Una overview di una delle 12 pratiche di Extreme Programming: continuous integration (e delivery) con gli strumenti al momento più interessanti. Esempio con una webapp in PHP.",
+ "Speaker": "Fabio Mora",
+ "SpeakerId": "236",
+ "Day": "Friday"
+ },
+ {
+ "Id": "994",
+ "Title": "Apt-get no more let Vagrant, Puppet and Docker take the stage",
+ "TimeSlotId": "16:10/17:10",
+ "TrackId": "2",
+ "Abstract": "How frustrating is to configure your dev machine everytime to meet the production specs?\r\nHow frustrating is to be sure that all of your colleagues have the same setup?\r\nHow to avoid distributing a new 4 GB vm to your team devs everytime you change the specs?\r\nEnter Vagrant, Puppet and Docker, the easy way to distribute vm and integrate them in your project repo\r\nwith just few KB!",
+ "Speaker": "Alessandro Cinelli",
+ "SpeakerId": "470",
+ "Day": "Friday"
+ },
+ {
+ "Id": "995",
+ "Title": "Monitoraggio, logging e alerting moderni",
+ "TimeSlotId": "17:20/18:00",
+ "TrackId": "2",
+ "Abstract": "Gestire un'infrastruttura sembra un'attività arida e ripetitiva, ma non\r\ne così: negli ultimi anni sono stati sviluppati sempre piu software\r\nfree alternativi alle soluzioni consolidate.\r\n\r\nGrazie ai sistemi cloud e alla virtualizzazione, nei prossimi anni\r\nsarà necessario dotarsi di strumenti efficaci per gestire la\r\ncomplessità di un'infrastruttura distribuita, e gli strumenti che\r\nabbiamo adesso a disposizione possono rendere questa attività\r\ngratificante ... anche da un punto di vista estetico !",
+ "Speaker": "Michele Finelli",
+ "SpeakerId": "93",
+ "Day": "Friday"
+ },
+ {
+ "Id": "997",
+ "Title": "Ubuntu phone, smart from the source (code)",
+ "TimeSlotId": "10:00/11:00",
+ "TrackId": "3",
+ "Abstract": "Un'introduzione al mondo di Ubuntu Touch, il nuovo sistema operativo mobile che fa della convergenza la sua bandiera, creato da Canonical e dalla comunità di Ubuntu, proponendo un nuovo modello realmente aperto e basato su nuove tecnologie che cercano di rivedere i paradigmi del passato.\r\n\r\nSi parlerà di sviluppo di applicazioni, dei suoi framework, della sicurezza.",
+ "Speaker": "Marco Trevisan",
+ "SpeakerId": "991",
+ "Day": "Friday"
+ },
+ {
+ "Id": "999",
+ "Title": "Xamarin Forms: one technology to rule them all",
+ "TimeSlotId": "11:30/12:10",
+ "TrackId": "3",
+ "Abstract": "Xamarin Forms è la nuova tecnologia introdotta da Xamarin per supportare lo sviluppo multi piattaforma di applicazioni per iOS, Android e Windows Phone utilizzando un unico linguaggio di design (lo XAML) e di sviluppo (C#). Nel corso di questa sessione vedremo le basi di questa piattaforma, gli scenari in cui è adatta e quelli in cui lo è di meno e una serie di preziosi consigli, nati dall'esperienza maturata nello sviluppo di un'importante progetto.",
+ "Speaker": "Matteo Pagani",
+ "SpeakerId": "1146",
+ "Day": "Friday"
+ },
+ {
+ "Id": "1002",
+ "Title": "Introduzione alla tecnologia iBeacon",
+ "TimeSlotId": "14:00/14:40",
+ "TrackId": "3",
+ "Abstract": "Presentata in maniera piuttosto discreta tra le novità di iOS 7 nel 2013, le tecnologia iBeacon consente la localizzazione a corto raggio (prevalentemente indoor) e la realizzazione di servizi sensibili alla prossimità. L’intuizione di Apple sfrutta una delle caratteristiche fondamentali di Bluetooth Low Energy e questo rende gli iBeacon pressoché universali. In pochissimo tempo, sono comparsi sul mercato numerosi prodotti hardware che implementano la specifica (ufficiale e reverse engineered) e diverse API e librerie per l’integrazione di funzionalità di prossimità all’interno di mobile app.",
+ "Speaker": "Stefano Sanna",
+ "SpeakerId": "1165",
+ "Day": "Friday"
+ },
+ {
+ "Id": "1003",
+ "Title": "Improving Mobile UX with Apache DeviceMap",
+ "TimeSlotId": "14:50/15:50",
+ "TrackId": "3",
+ "Abstract": "We experience a growing number of mobile phones, tablets, phablets, smart TV and similar devices flooding the market almost every day. If you want to create a comfortable user experience you need dynamic content according to hardware and browser of your device. That’s the reason for Device Description Repositories (DDR).\r\n\r\nApache DeviceMap started in January 2012, after OpenDDR contributed data and APis. It graduated from Apache Incubator November 2014. Next steps include an improved data format, maintenance of device data by the community via common API based on REST/OAuth and XML or JSON.",
+ "Speaker": "Werner Keil",
+ "SpeakerId": "953",
+ "Day": "Friday"
+ },
+ {
+ "Id": "1005",
+ "Title": "Tips and Tricks for Mobile Apps Prototyping",
+ "TimeSlotId": "17:20/18:00",
+ "TrackId": "3",
+ "Abstract": "Probably every company has faced the following problem - you are starting new Mobile app with really outstanding idea. All tech processes are adjusted and the project is being developed by experienced developers, designers and QA engineers. Seems that everything should be fine, but when the app was uploaded to the App Store the users receive it coldly. "It's so inconvenient, the app's logic is unclear at all!" - they say. Whose fault is it? Let's try to figure out.",
+ "Speaker": "Yauheni Kaziak",
+ "SpeakerId": "595",
+ "Day": "Friday"
+ },
+ {
+ "Id": "1015",
+ "Title": "Sviluppo IoT - Un approccio standard da Nerd ad Impresa, prove pratiche di Mesh",
+ "TimeSlotId": "14:00/14:40",
+ "TrackId": "4",
+ "Abstract": "Gli anni passati a veder nascere e crescere tecnologie e tendenze ci aiutano a comprendere come l'Internet delle Cose sia diventata matura per il mercato delle imprese. L’intervento, che include una panoramica sulle tendenze attuali e future dell’IoT, è centrato sullo sviluppo di soluzioni basate su standard industriali in ascesa (eg. Z-Wave), mettendo in evidenza gli inevitabili vantaggi e limiti derivanti dall’adozione di una metodologia industriale: solo un approccio industriale può rappresentare il vero e proprio salto di qualità per proporre prodotti efficaci per un mercato a doppia cifra",
+ "Speaker": "Nino Guarnacci",
+ "SpeakerId": "413",
+ "Day": "Friday"
+ },
+ {
+ "Id": "1017",
+ "Title": "Hacking your doorbell",
+ "TimeSlotId": "16:10/17:10",
+ "TrackId": "4",
+ "Abstract": "Interested in getting started reverse engineering hardware? In this talk we will take a look at how I took a regular doorbell and made it computer controlled, and how extremely simple it was! This talk asserts the possible technology choices for hardware hacking such as Arduino, Netduino,Raspberry PI and more, how basic reverse engineering of existing hardware is done (analysis, tools for analysis etc) and how to get started hacking hardware in a Microsoft/C# .NET (well mostly) environment TODAY!",
+ "Speaker": "Karl-Henrik Nilsson",
+ "SpeakerId": "834",
+ "Day": "Friday"
+ },
+ {
+ "Id": "1018",
+ "Title": "Trash Robotic Router Platform",
+ "TimeSlotId": "17:20/18:00",
+ "TrackId": "4",
+ "Abstract": "Building a drone from scratch with spare parts is a challenging business. To accomplish this journey, a Linux embedded stability control system is developed entirely from 0.This is a journey starting from the hardware choosing (a home WIFI router), to a stable and real flight. Unconventional implementations are one of the main topic, like using WiFi as communication between drone and pilot, HTML5 and COMET to show telemetry from the router web server, and implementing a entirely new protocol based on 802.11 Beacon Frames to prevent deauthentication attacks.",
+ "Speaker": "David Melendez",
+ "SpeakerId": "1110",
+ "Day": "Friday"
+ },
+ {
+ "Id": "1021",
+ "Title": "The Dark Side of Malware Analysis",
+ "TimeSlotId": "10:00/11:00",
+ "TrackId": "5",
+ "Abstract": "Storicamente il reversing di eseguibili è sempre stata una pratica oscura associata alla pirateria o allo spionaggio industriale, ma oggi, con l'aumentare di malware targettizzati, quest'arte sta diventando un argomento molto discusso perchè necessita \r\nuna forte capacità di analisi, intuizione ed inventiva. Ma perchè è così importante analizzare un malware? Quali strumenti utlizzare, ma soprattutto come approcciare il problema? Come gestire i meccanismi di protezione adottati? Niente di meglio \r\nper addentrarci nel mondo della malware analysis partendo proprio da alcuni casi reali",
+ "Speaker": "Andrea Pompili",
+ "SpeakerId": "190",
+ "Day": "Friday"
+ },
+ {
+ "Id": "1024",
+ "Title": "Securing your apps with OAuth2 and OpenID Connect",
+ "TimeSlotId": "12:20/13:00",
+ "TrackId": "5",
+ "Abstract": "In the past you could come by with designing a login screen with a username and login textbox in your app and directly check the credentials in a database. But we're living in the age of (Web) APIs. With modern apps, like SPAs, just authenticating with the website isn't enough, you also want to connect on behalf of the logged in user in a Web API that is providing data for example.\r\nOpenId Connect and OAuth2 for authorisation together are the complete solution to this problem.\r\nIn this session after a furter explanation we'll look at a collection of .Net apps that demonstrate this process.",
+ "Speaker": "Roland Guijt",
+ "SpeakerId": "1064",
+ "Day": "Friday"
+ },
+ {
+ "Id": "1027",
+ "Title": "Rendere sicure le esperienze dell'individuo nel mondo digitale allargato",
+ "TimeSlotId": "14:50/15:50",
+ "TrackId": "5",
+ "Abstract": "La User Experience si evolve guidata delle opportunità tecnologiche (Mobility, Active Spaces, Internet delle Cose, Wearable, ...). I nuovi servizi coinvolgono un sempre maggior numero di utenti e di Smart Objects. I volumi e la complessità degli scenari determinano una serie di nuove vulnerabilità che attirano l'interesse di un Cyber-crimine sempre più determinato e sofisticato. Riconoscere il rischo e sviluppare di conseguenza soluzioni "sicure" è il primo, fondamentale elemento per contribuire a mitigare il quadro complessivo della minaccia tecnologica.",
+ "Speaker": "Pietro Scarpino",
+ "SpeakerId": "1183",
+ "Day": "Friday"
+ },
+ {
+ "Id": "1037",
+ "Title": "Every millisecond counts: Techniques, strategies, and tools for a Web Performance Jedi Wannabe",
+ "TimeSlotId": "14:00/14:40",
+ "TrackId": "6",
+ "Abstract": "Developers, Designers, and Project Managers love to promise high performance for their web apps.\r\nBut they know they're lying. In fact most of the websites fail from a performance point of view.\r\nIn this talk I focus on every aspect and strategy that you have to consider to to fulfill the promise: performance metrics, measurements and monitoring strategy, optimization best practices, the paradox of third-party content, image rendering, browser performance tools.\r\n\r\nWith one goal in mind: finding small changes that led to some of the biggest performance gains.",
+ "Speaker": "Marco Casario",
+ "SpeakerId": "376",
+ "Day": "Friday"
+ },
+ {
+ "Id": "1038",
+ "Title": "E' meglio Kanban o Scrum? (Prossima domanda, prego)",
+ "TimeSlotId": "14:50/15:50",
+ "TrackId": "6",
+ "Abstract": "Metto a confronto - con l'aiuto del pubblico - i due "metodi agili" più di moda - Scrum, al top delle classifiche da qualche anno, e Kanban, stabile al secondo posto. Riassumo la loro storia ed evoluzione. Riepilogo le loro "regole" (cosa prescrivono, in termini di ruoli, eventi. processi). Mostro un po' di dati sulla loro adozione, in Italia e all'estero. E concludo con un piccolo ragionamento sui valori che ci stanno dietro (a loro e altri metodi "agili"), che spiega perchè la domanda "E' meglio x o y?" è, in molti casi, poco significativa.",
+ "Speaker": "Carlo Beschi",
+ "SpeakerId": "583",
+ "Day": "Friday"
+ },
+ {
+ "Id": "1039",
+ "Title": "The Value of Open Source",
+ "TimeSlotId": "16:10/17:10",
+ "TrackId": "6",
+ "Abstract": "Open Source is undoubtably valuable and has a strong intrinsic worth. But where does this value exist? Does the value lie in the software produced, or somewhere else? How could Open Sourcing your software benefit your company? In this talk we’ll explore the main benefits of Open Source, how it can benefit you and how it can lead to better software.",
+ "Speaker": "Robin Johnson",
+ "SpeakerId": "1073",
+ "Day": "Friday"
+ },
+ {
+ "Id": "1040",
+ "Title": "Agile Project Management: Integrare metodologie di progetto tradizionali con Agile",
+ "TimeSlotId": "17:20/18:00",
+ "TrackId": "6",
+ "Abstract": "Negli ultimi anni, anche secondo l'approccio Lean Startup, il modo migliore per rilasciare prodotti - non solo software - è tramite framework Agili. Quando si è agili all'interno di un organizzazione più tradizionale, questo approccio spesso si scontra con le prassi di gestione progetti più tradizionali. Nonostante lo scontro - principalmente filosofico - è in realtà possibile integrare metodologie di progetto tradizionali con quelle agili.\r\nDurante il talk, dopo una breve introduzione, saranno presentati dei modelli di ciclo di vita Agile e Tradizionale e la struttura consigliata dei team.",
+ "Speaker": "Simone Onofri",
+ "SpeakerId": "156",
+ "Day": "Friday"
+ },
+ {
+ "Id": "1043",
+ "Title": "Hands-on with BigQuery JavaScript User-Defined Functions",
+ "TimeSlotId": "10:00/11:00",
+ "TrackId": "7",
+ "Abstract": "Performing ETL on big data can be slow, expensive and painful - but it doesn't have to be! In this session, we'll take an in-depth look at several real-world examples of computations that don't fit well with the SQL language model and how to solve them with user-defined functions in Google BigQuery.\r\n\r\nBigQuery is a fully-managed SQL analytical engine, also used internally in Google, capable of analyzing terabytes of data per second. BigQuery executes user-defined functions on the same server shards that handle data processing and analytics, allowing extremely efficient execution.",
+ "Speaker": "Felipe Hoffa",
+ "SpeakerId": "338",
+ "Day": "Friday"
+ },
+ {
+ "Id": "1046",
+ "Title": "GlusterFS : un file system open source per i big data di oggi e domani",
+ "TimeSlotId": "12:20/13:00",
+ "TrackId": "7",
+ "Abstract": "GlusterFS (www.gluster.org) è un file system distribuito open source, scalabile fino ai petabytes.\r\nLa presentazione ha lo scopo di mostrare le feature di questo FS e la nostra esperineza, che parte nel 2010 con un cluster da 4TB all'odierno da 30TB: perchè è stato scelto, principali features, evoluzione, fallimenti (anche quelli), futuro. \r\nAlcune feature: accesso in user-space, protocolo nativo, NFS, SMB . Replicazione, distribuzione, striping dei file o una loro combinazione (e.g: distributed striped replicated). All'interno dell'ecosistema Hadoop può sostituire HDFS.",
+ "Speaker": "Roberto Franchini",
+ "SpeakerId": "52",
+ "Day": "Friday"
+ },
+ {
+ "Id": "1048",
+ "Title": "From Docker To Kubernetes: A Developer's Guide To Containers",
+ "TimeSlotId": "14:00/14:40",
+ "TrackId": "7",
+ "Abstract": "Everyone is talking about Containers, but mostly in the context of how they work and not why and when they are useful or how to apply them to your own often complex and unique Use Cases. We'll start by looking at how Docker works by manually creating a simple guestbook application using Docker Containers running Redis and PHP. We'll then use the same application to show how you can use Kubernetes and Google Container Engine to create a cluster of nodes, declare to that cluster what you expect it to do, and then have the cluster assign resources as needed, run your work, recover from failures.",
+ "Speaker": "Mandy Waite",
+ "SpeakerId": "513",
+ "Day": "Friday"
+ },
+ {
+ "Id": "1054",
+ "Title": "Kotlin, the Swift of Android",
+ "TimeSlotId": "10:00/11:00",
+ "TrackId": "8",
+ "Abstract": "Apple has introduced “a better language” for iOS developers. But what options do we have for Android? Surely Kotlin should be under consideration! Android Studio is now based on Intellij Idea, the “native” environment for Kotlin.\r\nKotlin is a modern language for industry. It can help you reduce the amount of code you write for Android applications and at the same time make it readable and more maintainable. In this session we’re going to see how certain constructs and DSL’s can be used to make Android more enjoyable.",
+ "Speaker": "Svetlana Isakova",
+ "SpeakerId": "943",
+ "Day": "Friday"
+ },
+ {
+ "Id": "1056",
+ "Title": "Loving Beautiful Code - Alla Scoperta di Laravel 5",
+ "TimeSlotId": "11:30/12:10",
+ "TrackId": "8",
+ "Abstract": "Laravel 4 ha portato una ventata d'aria fresca nel mondo PHP. Adesso, nel 2015, l'uscita di Laravel 5 segna un ulteriore punto di svolta. In questo talk Francesco introdurrà l'ultima versione del Framework e spiegherà quanto è semplice creare applicazioni, in pochissimo tempo e con una sintassi piacevole ed espressiva. Verranno coperte tutte le basi necessarie ad iniziare a lavorare, partendo dal MVC arrivando ad Eloquent, il potente ORM in dotazione. Come degna conclusione, quindi, una veloce sessione di live coding per rendere l'idea del vero livello di flessibilità di Laravel.",
+ "Speaker": "Francesco Malatesta",
+ "SpeakerId": "1173",
+ "Day": "Friday"
+ },
+ {
+ "Id": "1059",
+ "Title": "Una lista di cose che potresti non sapere su Python",
+ "TimeSlotId": "14:00/14:40",
+ "TrackId": "8",
+ "Abstract": "Dopo più di due anni di Python ho stilato una lista di librerie e trucchi che mi aiutano nella mia attività di sviluppo quotidiano, lista che penso valga la pena di essere condivisa. Non siate timidi e venite a seguire il talk, potreste scoprire qualcosa di nuovo (o insegnare qualcosa di nuovo a me).",
+ "Speaker": "Luca Lanziani",
+ "SpeakerId": "967",
+ "Day": "Friday"
+ },
+ {
+ "Id": "1060",
+ "Title": "PHP is the king, nodejs is the prince and Python is the fool",
+ "TimeSlotId": "14:50/15:50",
+ "TrackId": "8",
+ "Abstract": "At Namshi, an e-commerce retailer based in Dubai serving the UAE and GCC, we are using different technologies to boost our architecture.\r\nWe started with a common architecture based on PHP Nginx, Mysql and Memcache: the usual suspects. \r\nDuring last year the architecture changed a lot, using an SOA paradigm to meet expectations and the huge increase of traffic from several millions users throughout the year. But there’s more…\r\nIn this talk we will show how funny, easy and rewarding is to integrate different technologies in your stack, with PHP always being the king of the whole system.",
+ "Speaker": "Alessandro Cinelli",
+ "SpeakerId": "470",
+ "Day": "Friday"
+ },
+ {
+ "Id": "1061",
+ "Title": "Join The Dart Side Of Web Development 2 ( Use The Force )",
+ "TimeSlotId": "16:10/17:10",
+ "TrackId": "8",
+ "Abstract": "Hai seguito il precedente Talk su Dart a Codemotion Roma e Milano 2014? Ti ha incuriosito questo nuovo e potente linguaggio "battery included" by Google?\r\nAllora proseguiamo questo viaggio all'interno del Dartiverse, visiteremo insieme Polymer.Dart, Dart Force, e StageXL alcune tra la più potenti librerie per realizzare Web App davvero potenti in maniera semplice.",
+ "Speaker": "Giovanni Laquidara",
+ "SpeakerId": "266",
+ "Day": "Friday"
+ },
+ {
+ "Id": "1062",
+ "Title": "My adventure with Elm",
+ "TimeSlotId": "17:20/18:00",
+ "TrackId": "8",
+ "Abstract": "Reactive Extensions (Rx) has brought reactive programming to the mainstream in recent years with successful adoption in languages such as C#, Java and JavaScript. But have you ever wondered what Rx will look like as a language?\r\n\r\nElm is a new programming language based on the idea of Functional Reactive Programming (FRP). Elm lets you create highly interactive web applications without all the messy callbacks tangling around shared states.\r\n\r\nIn this talk Yan Cui will give a gentle introduction to Elm and FRP and finish off with a live demo building a web-based game from scratch.",
+ "Speaker": "Yan Cui",
+ "SpeakerId": "948",
+ "Day": "Friday"
+ }
+ ]
+}
\ No newline at end of file
diff --git a/BeyondResponsiveDesign/content/agenda-saturday.html b/BeyondResponsiveDesign/content/agenda-saturday.html
new file mode 100644
index 0000000..0b1aefc
--- /dev/null
+++ b/BeyondResponsiveDesign/content/agenda-saturday.html
@@ -0,0 +1,3651 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/BeyondResponsiveDesign/content/agenda-saturday.json b/BeyondResponsiveDesign/content/agenda-saturday.json
new file mode 100644
index 0000000..dd93005
--- /dev/null
+++ b/BeyondResponsiveDesign/content/agenda-saturday.json
@@ -0,0 +1,404 @@
+{
+ "Tracks": [
+ {
+ "Id": "Startup",
+ "Identifier": "1"
+ },
+ {
+ "Id": "Enterprise - Architecture",
+ "Identifier": "2"
+ },
+ {
+ "Id": "UX",
+ "Identifier": "3"
+ },
+ {
+ "Id": "Inspiration",
+ "Identifier": "4"
+ },
+ {
+ "Id": "Front end",
+ "Identifier": "5"
+ },
+ {
+ "Id": "Functional and Reactive Programming",
+ "Identifier": "7"
+ },
+ {
+ "Id": "Server side - Full stack",
+ "Identifier": "8"
+ }
+ ],
+ "TimeSlots": [
+ {
+ "Id": "09:00/10:00",
+ "Info": null
+ },
+ {
+ "Id": "10:10/11:10",
+ "Info": "Keynote"
+ },
+ {
+ "Id": "11:10/11:40",
+ "Info": "Coffee break"
+ },
+ {
+ "Id": "11:40/12:20",
+ "Info": null
+ },
+ {
+ "Id": "12:30/13:10",
+ "Info": null
+ },
+ {
+ "Id": "13:10/14:10",
+ "Info": "Lunch time"
+ },
+ {
+ "Id": "14:10/14:50",
+ "Info": null
+ },
+ {
+ "Id": "15:00/16:00",
+ "Info": null
+ },
+ {
+ "Id": "16:00/16:20",
+ "Info": "Coffee break"
+ },
+ {
+ "Id": "16:20/17:20",
+ "Info": null
+ },
+ {
+ "Id": "17:30/18:10",
+ "Info": null
+ },
+ {
+ "Id": "18:15/18:20",
+ "Info": "Closing Keynote"
+ }
+ ],
+ "Sessions": [
+ {
+ "Id": "1064",
+ "Title": "Una Startup asincrona e distribuita",
+ "TimeSlotId": "09:00/10:00",
+ "TrackId": "1",
+ "Abstract": "Costruire una startup con un team tecnico completamente remoto non è un modo per evitare il traffico mattutino, ma un' opportunità per costruire una squadra migliore e più produttiva. Il lavoro remoto richiede un diverso approccio alla comunicazione ed ai processi, ma se gestito in modo corretto, può essere un arma capace di fare la differenza.",
+ "Speaker": "Bruno Bellissimo",
+ "SpeakerId": "724",
+ "Day": "Saturday"
+ },
+ {
+ "Id": "1071",
+ "Title": "Tecnologie e Startup: ICT è solo una commodity?",
+ "TimeSlotId": "15:00/16:00",
+ "TrackId": "1",
+ "Abstract": "Questa sessione vuole affrontare il tema della tecnologia e come questa possa essere una leva fondamentale per le nuove Startup. Nella prima parte saranno discussi i maggiori trend di mercato: le tecnologie più in voga e ricercate, quelle già mature e consolidate e quelle che sono in fase calante ma che avranno un alto impatto in futuro. Nella seconda parte mostrerò alcuni tool e tecniche che possono migliorare la gestione del lavoro di una start-up introducendo meccanismi di sviluppo agili.",
+ "Speaker": "Matteo Valoriani",
+ "SpeakerId": "359",
+ "Day": "Saturday"
+ },
+ {
+ "Id": "1073",
+ "Title": "How to create a product (Practical Guide)",
+ "TimeSlotId": "16:20/17:20",
+ "TrackId": "1",
+ "Abstract": "When developing a new product, two problems often arise:\r\n- Which features should be developed?\r\n- How to work with developers avoiding frustration?\r\n\r\nThe aim of the talk is to present a practical process to manage the development of new features. \r\nSpecifically, it illustrates the tricks that product managers use to navigate through the complexity of product development.\r\n\r\nThe process is described with practical examples and it is composed by 3 steps:\r\n1) Choosing the features \r\n2) Managing the development \r\n3) Measuring the results",
+ "Speaker": "Giuseppe Laddomada",
+ "SpeakerId": "1172",
+ "Day": "Saturday"
+ },
+ {
+ "Id": "1077",
+ "Title": "Let's talk about the cache !",
+ "TimeSlotId": "09:00/10:00",
+ "TrackId": "2",
+ "Abstract": "We all know that caching is a solution for developers to increase the performance of an application. We will start by presenting the JSR-107 terminology and the most important cache patterns. Some use cases will also be discussed and you will see how you can scale your cache from a single node to a multi node cluster. If you are a beginners in caching or if the words Cache Aside, Write-Behind, Read/Write Through doesn’t means anything to you or if you are interesting about high availabilty and scalable architecture, that this is the place to be !",
+ "Speaker": "Mathilde Lemée",
+ "SpeakerId": "524",
+ "Day": "Saturday"
+ },
+ {
+ "Id": "1080",
+ "Title": "Stack Overflow - obiettivo performance",
+ "TimeSlotId": "11:40/12:20",
+ "TrackId": "2",
+ "Abstract": "Stack Exchange è uno dei 50 maggiori network al mondo ed è sviluppato con l'obiettivo di essere il sito più veloce in assoluto. \r\nNel talk racconto:\r\n* L'architettura fisica di Stack Overflow. Quanti server abbiamo? A cosa servono e cosa sono le loro spec?\r\n* L'architettura logica del software. Come scaliamo? Quali sono i pezzi principali dell'applicazione?\r\n* Il sistema di tool. Cosa usiamo per sostenere la nostra filosofia di "extreme optimization"?\r\n* Il team di sviluppo. Quali sono i nostri valori fondamentali? Che impronta volgiamo lasciare come sviluppatori?",
+ "Speaker": "Marco Cecconi",
+ "SpeakerId": "506",
+ "Day": "Saturday"
+ },
+ {
+ "Id": "1081",
+ "Title": "Domain Driven Design + Command Query Responsibility Segregation + Event Sourcing = l’architettura del futuro",
+ "TimeSlotId": "12:30/13:10",
+ "TrackId": "2",
+ "Abstract": "Qual'è lo stato dell'arte delle architetture software? Costruiamo la soluzione con le ultime evoluzioni di Domain Driven Design, otteniamo ottime prestazioni con Command Query Responsibility Segregation e scaliamo alla grande con Event Sourcing, puntando ai microservice per ottenere un'architettura robusta, affidabile, veloce, distribuita e scalabile.",
+ "Speaker": "Valerio Del Bello",
+ "SpeakerId": "1111",
+ "Day": "Saturday"
+ },
+ {
+ "Id": "1083",
+ "Title": "The Fast and The Mobile",
+ "TimeSlotId": "14:10/14:50",
+ "TrackId": "2",
+ "Abstract": "Frameworks such as AngularJS and Polymer are great tools for building complex systems with less coding. But what if your client wants ultra-high performance? This talk shows you how to deal with some lower-level decisions in order to achieve a solid architecture and a highly performant JavaScript on mobile web applications using some old friends like Backbone, RequireJS, Mustache and a lot of trial-and-error. The examples shown are based on PagineGialle's mobile webapp, whose performance impressed Google Italy.",
+ "Speaker": "Matteo Antony Mistretta",
+ "SpeakerId": "1050",
+ "Day": "Saturday"
+ },
+ {
+ "Id": "1084",
+ "Title": "Advanced search for your legacy application",
+ "TimeSlotId": "15:00/16:00",
+ "TrackId": "2",
+ "Abstract": "How do you mix SQL and NoSQL worlds without starting a messy revolution?\r\n\r\nThis live coding talk will show you how to add Elasticsearch to your legacy application without changing all your current development habits. Your application will have suddenly have advanced search features, all without the need to write complex SQL code!\r\n\r\nDavid will start from a Spring, Hibernate and Postgresql based application and will add a complete integration of Elasticsearch, all live from the stage during his presentation.",
+ "Speaker": "David Pilato",
+ "SpeakerId": "116",
+ "Day": "Saturday"
+ },
+ {
+ "Id": "1085",
+ "Title": "Refactor your Java EE application using Microservices and Containers",
+ "TimeSlotId": "16:20/17:20",
+ "TrackId": "2",
+ "Abstract": "This talk will provide a quick introduction to Docker images (build time), containers (run time), and registry (distribution). It shows how to take an existing Java EE application and package it as a monolithic application as a single Docker image. The application will then be refactored in to multiple microservices and assembled together using orchestration. Unit and integration testing of such applications will be discussed and shown as well. Design patterns and anti-patterns that show how to create cluster of such applications will be demonstrated and discussed.",
+ "Speaker": "Arun Gupta",
+ "SpeakerId": "926",
+ "Day": "Saturday"
+ },
+ {
+ "Id": "1087",
+ "Title": "Come creare e manutenere una Styleguide visiva per i tuoi clienti",
+ "TimeSlotId": "17:30/18:10",
+ "TrackId": "2",
+ "Abstract": "In base alla maturità, tipologia e dimensione di un progetto i workflow di design e sviluppo possono cambiare. \r\nUna delle tecniche più 'breakthrough' dei workflow è quella delle styleguide.\r\nCosa sono (e cosa non sono)? Come si usano? Come si progettano? Quali sono i pro e i contro? Serve per forza BEM? arà un talk 20% metodo, 60% tecnica e 20% domande!",
+ "Speaker": "Fabio Fabbrucci",
+ "SpeakerId": "307",
+ "Day": "Saturday"
+ },
+ {
+ "Id": "1089",
+ "Title": "Integrating User Experience and Agile",
+ "TimeSlotId": "09:00/10:00",
+ "TrackId": "3",
+ "Abstract": "The web is no longer in it's infancy. We're growing up. The age old model of creating time consuming deliverables just to appease a client is over. Disciplines must now collaborate, reduce waste and learn to be truly agile in order to create high quality products. In this presentation attendees will discover: \r\n\r\n• a quick review of user experience\r\n• methodology tools in the toolbox (Agile, Scrum, Kanban, Lean)\r\n• the difference between a deliverable and an artifact \r\n• integrating user experience into agile processes\r\n• ways to reduce waste and get to market quickly",
+ "Speaker": "Bermon Painter",
+ "SpeakerId": "192",
+ "Day": "Saturday"
+ },
+ {
+ "Id": "1092",
+ "Title": "Mobile UX for user engagement and monetization",
+ "TimeSlotId": "11:40/12:20",
+ "TrackId": "3",
+ "Abstract": "The talk dives into the best practices for user engagement and monetization of mobile apps and games. Through examples and real-life scenarios, the key moments of the mobile user experience will be examined to provide guidelines and hands-on practices to help monetize apps and turn average users into a marketing and revenue building resource.",
+ "Speaker": "Emilia Ciardi",
+ "SpeakerId": "1163",
+ "Day": "Saturday"
+ },
+ {
+ "Id": "1093",
+ "Title": "Beyond responsive design - UI for the modern web application",
+ "TimeSlotId": "12:30/13:10",
+ "TrackId": "3",
+ "Abstract": "Applications written for the modern web are being consumed not just on desktops, but also on a myriad of other devices... even watches and glasses. If you design your application with a pc screen in mind, you're either cutting your userbase in half or setting yourself up for an expensive redesign. In this talk I'll introduce you to some modern web design constructs, and the technologies that bring them to life. Learn how to create apps for phone, mobile and desktop with no extra effort, and without restrictive layout frameworks. Web has finally caught up with native apps... the future is now!",
+ "Speaker": "Pete Smith",
+ "SpeakerId": "977",
+ "Day": "Saturday"
+ },
+ {
+ "Id": "1107",
+ "Title": "The Wolf Method. Dall'Epic Fail al Problem Solving Creativo.",
+ "TimeSlotId": "14:10/14:50",
+ "TrackId": "4",
+ "Abstract": "Ogni problema può diventare un'opportunità se sai come trasformarlo a tuo vantaggio. \r\nPassando da McGyver al Signor Wolf l’intervento si propone di rispondere a una delle sfide più impegnative poste dalla programmazione così come dalla vita: la necessità di acquisire insieme ai linguaggi anche una nuova mentalità orientata alla risoluzione dei problemi. \r\nIl Problem Solving può aiutare a trovare soluzioni non convenzionali alle difficoltà quotidiane, purché si conoscano le strategie logiche che non sono frutto di un improvviso atto di creatività ma sono basate su decodificate metodologie.",
+ "Speaker": "Lucia Zappacosta",
+ "SpeakerId": "329",
+ "Day": "Saturday"
+ },
+ {
+ "Id": "1108",
+ "Title": "Waaaaaah! - Sviluppare Software con la Produzione Relazionale Ricombinante (RRP)",
+ "TimeSlotId": "15:00/16:00",
+ "TrackId": "4",
+ "Abstract": "Sviluppare il software richiede migliaia di piccole decisioni da parte di noi sviluppatori. Quale criterio usiamo per fare il nostro prossimo passo? La consapevolezza di questo criterio è la chiave per la nostra produttività. Francesco presenterà un nuovo approccio allo sviluppo del software basato su questa forma di consapevolezza. Essere consapevoli delle nostre decisioni può farci scoprire nuovi modi di fare design e di organizzare il nostro team in modo produrre più feature con meno costi e in modo sostenibile.",
+ "Speaker": "Francesco Cirillo",
+ "SpeakerId": "663",
+ "Day": "Saturday"
+ },
+ {
+ "Id": "1109",
+ "Title": "No more excuses left - let's build great things",
+ "TimeSlotId": "16:20/17:20",
+ "TrackId": "4",
+ "Abstract": "As developers, we know things break. We also know how to fix them. What we don't do is do this efficiently. Instead we seem to have a perverse fascination telling one another and the world how broken things are. If you look, however, how cool technology is these days, what tools we have at our disposal and the latest changes in the last excuse we had: "What about IE?" it is time to stop complaining and get to work. Our job is to build things that people want to use. Not to complain about our tools. This is what people looking for excuses do. We're better than that.",
+ "Speaker": "Christian Heilmann",
+ "SpeakerId": "1099",
+ "Day": "Saturday"
+ },
+ {
+ "Id": "1113",
+ "Title": "Typescript, Angular e Bootstrap assieme per applicazioni real world",
+ "TimeSlotId": "09:00/10:00",
+ "TrackId": "5",
+ "Abstract": "La recente affermazione in ambito web delle applicazioni rich basate su HTML5 e Javascript è diventato sorgente di una serie di librerie innovative e di strumenti che, se usati correttamente, possono semplificare enormemente lo sviluppo. In questa sessione sarà illustrato come sfruttare Typescript, in concomitanza con Angular e Bootstrap per realizzare applicazioni che sfruttino al massimo le possibilità dei browser e diano un feedback il più possibile simile alle applicazioni desktop",
+ "Speaker": "Andrea Boschin",
+ "SpeakerId": "287",
+ "Day": "Saturday"
+ },
+ {
+ "Id": "1116",
+ "Title": "CSS3 Layouts: Flexbox vs CSS Grid",
+ "TimeSlotId": "11:40/12:20",
+ "TrackId": "5",
+ "Abstract": "The way we create layouts is messy we have to admit it, those floats and inline-block's don't make anyone's life any easier and they aren't exactly tools for creating massive layouts, just properties we adapted for our layout needs because, well, they worked and we got used to them.\r\nWith CSS3 we got Flexbox and the CSS grid , two things created especially for the creation of layouts , in here I will talk about each one, the pros , the cons and why you should be looking forward to using these in production. All of this so you can go home with even more hope for the future of CSS.",
+ "Speaker": "Sara Vieira",
+ "SpeakerId": "1054",
+ "Day": "Saturday"
+ },
+ {
+ "Id": "1117",
+ "Title": "AbsurdJS - Hacking the front-end",
+ "TimeSlotId": "12:30/13:10",
+ "TrackId": "5",
+ "Abstract": "It's a talk about AbsurdJS (http://absurdjs.com/). JavaScript library that acts as a CSS and HTML preprocessor. At the same time is a template engine and client-side framework. The presentation is made of two parts. The first one presents the library and the second one is a real life example of its usage.",
+ "Speaker": "Krasimir Tsonev",
+ "SpeakerId": "998",
+ "Day": "Saturday"
+ },
+ {
+ "Id": "1119",
+ "Title": "lean frontend development",
+ "TimeSlotId": "14:10/14:50",
+ "TrackId": "5",
+ "Abstract": "Il processo di maturazione dello sviluppo frontend passa per l'adozione di metodologie agili e \r\nlean, vedremo una sequenza di tecniche e di metodologie per alleggerirlo, costruendo il nostro mvp \r\nin maniera modulare e realizzando progetti più scalabili",
+ "Speaker": "Matteo guidotto",
+ "SpeakerId": "908",
+ "Day": "Saturday"
+ },
+ {
+ "Id": "1120",
+ "Title": "AngularJS 2.0: A natural evolvement or a new beginning",
+ "TimeSlotId": "15:00/16:00",
+ "TrackId": "5",
+ "Abstract": "For only a couple of years AngularJS has become a standard when talking about single-page applications. Its modularity, testability and structure gives developers a well-defined scope and certain confidence in their projects. As Web changes, so a natural change is expected to happen in the project itself. Version 2.0 however brings a far new world. Although it builds on the existing foundation and governing principles behind the project, it reveals some aspects that have already provoked discussions in the community. In this talk I will go through the new components in AngularJS 2.0: ECMAScrip",
+ "Speaker": "Boyan Mihaylov",
+ "SpeakerId": "1091",
+ "Day": "Saturday"
+ },
+ {
+ "Id": "1123",
+ "Title": "Progressive Enhancement for JavaScript Apps",
+ "TimeSlotId": "17:30/18:10",
+ "TrackId": "5",
+ "Abstract": "When progressive enhancement was introduced as a concept, JavaScript applications seemed as relevant as flying cars. As JS became more powerful, it seemed we'd reach a point where we could forget PE entirely. For its original meaning, we now have rock-solid libraries and polyfills to provide abstractions that make PE easy. But as JS has advanced, we've started writing things that can't be polyfilled. We know now how to progressively enhance widgets and user interactions. We'll talk about how we progressively enhance entire applications, and why it's more important than ever that we do so.",
+ "Speaker": "Garann Means",
+ "SpeakerId": "1151",
+ "Day": "Saturday"
+ },
+ {
+ "Id": "1137",
+ "Title": "OOP and FP: become a better programmer",
+ "TimeSlotId": "09:00/10:00",
+ "TrackId": "7",
+ "Abstract": "Hear the story of Simon, an experienced OOP Java developer, exposed to the new lambda features of JDK 8.\r\nHis friend Mario, a long-bearded FP geek, will try to convince him that FP can help him develop more readable and maintainable code.\r\nA journey into the discovery of the main new feature - lambda expressions - of JDK 8.",
+ "Speaker": "Simone Bordet",
+ "SpeakerId": "299",
+ "Day": "Saturday"
+ },
+ {
+ "Id": "1140",
+ "Title": "Functional Programming You Already Know",
+ "TimeSlotId": "11:40/12:20",
+ "TrackId": "7",
+ "Abstract": "From JVM to .NET languages, from minor coding idioms to system-level architectures, functional programming is enjoying a long overdue surge in interest. Functional programming is certainly not a new idea and, although not apparently as mainstream as object-oriented and procedural programming, many of its concepts are also more familiar than many programmers believe.\r\n\r\nThis talk examines functional and declarative programming styles from the point of view of coding patterns, little languages and programming techniques already familiar to many programmers.",
+ "Speaker": "Kevlin Henney",
+ "SpeakerId": "1011",
+ "Day": "Saturday"
+ },
+ {
+ "Id": "1141",
+ "Title": "Fun with Functional JavaScript",
+ "TimeSlotId": "12:30/13:10",
+ "TrackId": "7",
+ "Abstract": "It might be a surprise for some of you, but JavaScript can be regarded as a functional programming language. Why don't we use more functional programming concepts in our JavaScript code, then? In this talk you will learn how to start including some of them in your applications and when they might be particularly beneficial. You will also get familiar with libraries that extend the functional capabilities of JavaScript (lodash and FunctionalJS) and the upcoming ES6 features that make JavaScript even more functional.",
+ "Speaker": "Kuba Waliński",
+ "SpeakerId": "749",
+ "Day": "Saturday"
+ },
+ {
+ "Id": "1143",
+ "Title": "import Golang; struct microservices",
+ "TimeSlotId": "14:10/14:50",
+ "TrackId": "7",
+ "Abstract": "Se anni fa abbiamo pensato applicazioni complesse con in mente l’omonogeneità,oggi facilmente ci ritroveremo un accumulo disordinato di codice lento e difficile da mantenere.\r\n\r\nIl talk ci porta violentemente nel 2015, nel mondo dei microservizi, dove \r\nil vero protagonista è GOlang, che fa della sua filosofia il punto di forza.\r\n\r\nIn questo viaggio nelle buone pratiche e negli esempi di come implementare applicazioni modulari e pronte a crescere verranno installati nella testa concetti come Rest, Websocket, Json Web Token, Docker, httptest ...",
+ "Speaker": "Giulio De Donato",
+ "SpeakerId": "168",
+ "Day": "Saturday"
+ },
+ {
+ "Id": "1147",
+ "Title": "Meteor + Polymer, the Holy Grail of Web Development.",
+ "TimeSlotId": "17:30/18:10",
+ "TrackId": "7",
+ "Abstract": "Meteor is an open-source Javascript platform for building modern web apps. Polymer is a library for creating Web Components, which are a set of W3C standards and upcoming browser APIs for defining your own custom HTML elements. Let's combine them to build modern, reactive and beautiful web apps.",
+ "Speaker": "Enrico Risa",
+ "SpeakerId": "297",
+ "Day": "Saturday"
+ },
+ {
+ "Id": "1149",
+ "Title": "RealTime Ninja - Hands on MEAN",
+ "TimeSlotId": "09:00/10:00",
+ "TrackId": "8",
+ "Abstract": "Il talk sarà diviso in due parti.Nella prima analizzeremo brevemente le peculiarità di Node.js (e simili), le ragioni del suo successo e i domini applicativi di questo tipo di tecnologia. Vedremo anche cosa può aspettarsi uno sviluppatore frontend deciso a fare il grande passo e a cominciare a usare Javascript anche sul server. Nella seconda svilupperemo passo passo un servizio di API/REST in NodeJs, persistendo i dati su un database non relazionale (MongoDB). Sarà spiegato come impostare l’applicazione, definire rotte, middleware e modelli e infine come implementare notifiche realtime.",
+ "Speaker": "Matteo Scandolo Giovanni Lela",
+ "SpeakerId": "875",
+ "Day": "Saturday"
+ },
+ {
+ "Id": "1155",
+ "Title": "nginx for fun and performance",
+ "TimeSlotId": "14:10/14:50",
+ "TrackId": "8",
+ "Abstract": "Is it fast yet? Performance is getting ever more important and using nginx is one of the easiest hacks to make your system faster.\r\nThis talk takes a look at why and how nginx is so fast — it's all about being event-driven. Additionally, we discuss where you can make use of nginx's power, specifically for terminating SSL connections, providing a load balancer or proxy, and to run static websites as well as dynamic web-applications with PHP.",
+ "Speaker": "Philipp Krenn",
+ "SpeakerId": "1101",
+ "Day": "Saturday"
+ },
+ {
+ "Id": "1156",
+ "Title": "Develop and design RESTful web API in PHP using Apigility",
+ "TimeSlotId": "15:00/16:00",
+ "TrackId": "8",
+ "Abstract": "Develop a robust RESTful web API is not a simple task. How to manage the error handling? Which format to use for the data exchange? How to manage the content negotiation? What about the versioning? How to build an authentication system? How to produce the API documentation? In this talk we will show how to design and implement a REST architecture using Apigility, the open source API builder for PHP (http://apigility.org).",
+ "Speaker": "Enrico Zimuel",
+ "SpeakerId": "982",
+ "Day": "Saturday"
+ },
+ {
+ "Id": "1157",
+ "Title": "Fully Reactive - from Data to UI with OrientDB + Node.js + Socket.io",
+ "TimeSlotId": "16:20/17:20",
+ "TrackId": "8",
+ "Abstract": "Having both a reactive application layer and front-end is just not enough anymore. Today's reality demands a fully reactive architecture where all the layers, including the database, are able to interact with each other using a paradigm. In this presentation, you'll learn how to build a fully reactive application in a few minutes with just a few lines of code resulting in every database change propagating asynchronously between the application layer and the front-end.",
+ "Speaker": "Luigi Dell Aquila",
+ "SpeakerId": "141",
+ "Day": "Saturday"
+ },
+ {
+ "Id": "1159",
+ "Title": "Java EE facile con Spring Boot",
+ "TimeSlotId": "17:30/18:10",
+ "TrackId": "8",
+ "Abstract": "Costruiamo con Spring Boot una applicazione Java EE con transazioni multiple JDBC-JMS utilizzando H2 e HornetQ (embedded in memory), il supporto di autoconfiguration JAX-RS (Jersey), le annotazioni JSR 250 per i lifecycle hooks, e le annotazioni JSR 330 utilizzabili per AS proprietari e per la portabilità in container di dependency injection come Spring. Per finire distribuiremo su Undertow embedded HTTTP server, su un AS standalone (Apache TomEE) e come PAAS su Cloud Foundry.",
+ "Speaker": "Luigi Bennardis",
+ "SpeakerId": "145",
+ "Day": "Saturday"
+ }
+ ]
+}
\ No newline at end of file
diff --git a/BeyondResponsiveDesign.Menus/content/cfp.html b/BeyondResponsiveDesign/content/cfp.html
similarity index 63%
rename from BeyondResponsiveDesign.Menus/content/cfp.html
rename to BeyondResponsiveDesign/content/cfp.html
index 52fb0a3..57cd241 100644
--- a/BeyondResponsiveDesign.Menus/content/cfp.html
+++ b/BeyondResponsiveDesign/content/cfp.html
@@ -3,40 +3,35 @@
When do submissions open?
- Session submissions usually opens a couple of months in advance of the DDD event. This allows us time
+ Session submissions usually opens a couple of months in advance of the event. This allows us time
to collate all the submissions, vote on the submissions, and create an agenda for the day from the
results of the voting process.
How long should my session be?
- Sessions at DDD events last for one hour.
+ Sessions last for 50 minutes.
What topics do you accept sessions on?
- Anything relevant to a .NET developer! Other DDD events have seen submissions on the Raspberry Pi and
+ Anything relevant to a Java or Web developers! Other events have seen submissions on the Raspberry Pi and
Gadgeteer, Unit Testing and Test-Driven Development, NoSQL databases like RavenDB and Redis, JavaScript,
mobile devices. "Softer" topics such as best practices, agile software development, and taking
your side project to a prime time business, have also been presented.
-
+
- DDD sessions are usually single-speaker talks on a specific subject, although some have featured multiple
+ Voxxed days sessions are usually single-speaker talks on a specific subject, although some have featured multiple
speakers. Technical sessions, particularly those featuring hardware elements (e.g. Raspberry Pi), work
well when demos and code samples are included. That said, we also welcome sessions that are based around a
- new format not yet presented at a DDD event.
+ new format not yet presented at an event.
-
- Some DDD events have run panel discussions and balloon debates .
- These are usually at the inception of the event organisers rather than through submissions.
-
-
Do I need to be an expert in my topic?
- No. One of the aims of DDD events is to grow the local speaker community, which means
- favouring new speakers as well as local speakers. DDD audiences are interested in hearing about what you've
+ No. One of the aims of these events is to grow the local speaker community, which means
+ favouring new speakers as well as local speakers. Audiences are interested in hearing about what you've
learned about the topic that you are speaking on; being introduced to a new topic, idea, or technology; or
hearing about your experiences with a project you have been working on.
diff --git a/BeyondResponsiveDesign/content/contact.html b/BeyondResponsiveDesign/content/contact.html
new file mode 100644
index 0000000..8bf0480
--- /dev/null
+++ b/BeyondResponsiveDesign/content/contact.html
@@ -0,0 +1,58 @@
+
+
+
+
+ Contact Codemotion Rome
+
+
+
+
+ Have any questions? Want to make suggestions? Or find out about sponsorship options? Drop us a line. We would love to hear from you.
+
+
+ Email the organisers on info@codemotion.it
+
+
+
+
+
diff --git a/BeyondResponsiveDesign/content/home.html b/BeyondResponsiveDesign/content/home.html
new file mode 100644
index 0000000..69a2f5d
--- /dev/null
+++ b/BeyondResponsiveDesign/content/home.html
@@ -0,0 +1,36 @@
+
+
+
+
+ Welcome to Codemotion Rome!
+
+
+
+
+ Codemotion is the ecosystem devoted to innovation, focused on developers and coding, open to all programming languages and technologies. Pioneering spirits, we scout the future to deliver a first class experience to our people. Get involved in Codemotion, join Codemotion People. Discover Codemotionworld.
+
+ Let’s code the future.
+
+
+
+
+
+ Codemotion World
+
+
+
+
+ We are one of the biggest tech-conferences in Europe, with an international network of 30.000 developers and 350 speakers coming from all over the world and from the most important IT realities.
+
+
+ We draw in our main conferences thousands of attendees eager to discuss about hottest topics: we tailor for them disruptive proposals ranging from mobile to UX, devops, cloud, big data, gamedev, security, methods, languages, web, Internet of things. Codemotion is also a startup, providing a bunch of services and activities, for personal and business customers.
+
+
+
+
+
+
\ No newline at end of file
diff --git a/BeyondResponsiveDesign.Menus/content/presentation.html b/BeyondResponsiveDesign/content/presentation.html
similarity index 100%
rename from BeyondResponsiveDesign.Menus/content/presentation.html
rename to BeyondResponsiveDesign/content/presentation.html
diff --git a/BeyondResponsiveDesign/content/render-agenda-friday.html b/BeyondResponsiveDesign/content/render-agenda-friday.html
new file mode 100644
index 0000000..8947157
--- /dev/null
+++ b/BeyondResponsiveDesign/content/render-agenda-friday.html
@@ -0,0 +1,140 @@
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/BeyondResponsiveDesign/content/render-agenda-saturday.html b/BeyondResponsiveDesign/content/render-agenda-saturday.html
new file mode 100644
index 0000000..d858871
--- /dev/null
+++ b/BeyondResponsiveDesign/content/render-agenda-saturday.html
@@ -0,0 +1,140 @@
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/BeyondResponsiveDesign/content/render-speakers.html b/BeyondResponsiveDesign/content/render-speakers.html
new file mode 100644
index 0000000..d7f16c7
--- /dev/null
+++ b/BeyondResponsiveDesign/content/render-speakers.html
@@ -0,0 +1,97 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/BeyondResponsiveDesign/content/sessiondetail.html b/BeyondResponsiveDesign/content/sessiondetail.html
new file mode 100644
index 0000000..983c04a
--- /dev/null
+++ b/BeyondResponsiveDesign/content/sessiondetail.html
@@ -0,0 +1,27 @@
+
+
\ No newline at end of file
diff --git a/BeyondResponsiveDesign/content/speakerdetail.html b/BeyondResponsiveDesign/content/speakerdetail.html
new file mode 100644
index 0000000..5f28270
--- /dev/null
+++ b/BeyondResponsiveDesign/content/speakerdetail.html
@@ -0,0 +1 @@
+
\ No newline at end of file
diff --git a/BeyondResponsiveDesign/content/speakers.html b/BeyondResponsiveDesign/content/speakers.html
new file mode 100644
index 0000000..23aa9ad
--- /dev/null
+++ b/BeyondResponsiveDesign/content/speakers.html
@@ -0,0 +1,4149 @@
+
+
+
+
+
+ Alessandro Cinelli Alessandro Cinelli (a.k.a. cirpo) is currently working at Namshi (http://namshi.com), the fashion e-commerce in the Middle East located in Dubai. He has a keen attention for enterprise patterns, methodologies, clean code and everything related to performances. He loves to share and give back to the community, that’s why he actively contributes to open source projects and when he was in Italy he has been a board member of the Italian PHP, Javascript User Group and WEBdeBS.
+
+
+
+
+
+
+ Alfredo Morresi 79ers, nature and technology lover, supporter of open-source philosophy and footings along the beach. Maieutic and social oriented, passionate about evolutions of mobile world. Best dishes: community, code and Tiramisu’. Desires? A couple of additional hours of sleep every day.
+
+
+
+
+
+
+ Andrea Boschin Andrea si occupa di sviluppo di software da più di 15 anni, con particolare predilezione per le tecnologie web ma con esperienze molteplici anche in ambito desktop e web service. Dal 2007 è Microsoft MVP, dapprima nell'ambito di ASP.NET e in seguito su Silverlight per il quale è stato il primo ad essere nominato in Italia. Scrive correntemente articoli tecnici per testate internazionali e per il proprio weblog, e conduce da più di 8 anni XeDotNet, il più attivo user group di Italia in termini di eventi organizzati.
+
+
+
+
+
+
+ Andrea Pompili Andrea Pompili è un informatico che si occupa di sicurezza. Giovanissimo, è entrato nel mondo dei computer realizzando uno dei più celebri videogiochi italiani della vecchia informatica. Terminati gli studi, si è occupato prima di sviluppo software e quindi di sicurezza informatica. Attualmente consulente strategico in ambito sicurezza e networking per l'integrazione di soluzioni innovative. Dal 2013 fa parte del core developement team del progetto OWASP ZAP.
+
+
+
+
+
+
+ Arun Gupta Arun Gupta is Director of Developer Advocacy at Red Hat and focuses on JBoss Middleware. As a founding member of the Java EE team at Sun Microsystems, he spread the love for technology all around the world. At Oracle, he led a cross-functional team to drive the global launch of the Java EE 7 platform through strategy, planning, and execution of content, marketing campaigns, and program. He is a prolific blogger since 2005 and have authored 1500+ blogs on technology. Arun has extensive speaking experience in ~40 countries on myriad topics and is a JavaOne Rockstar. He also founded the Devoxx4Ki
+
+
+
+
+
+
+ Bermon Painter Bermon is the organizer of various community groups for user experience designers and front-end developers, and the organizer of Blend Conference, a 3-day multi-track event for user experience strategists, designers and developers. He also leads the user experience team for Cardinal Solutions' Charlotte office where he consults with large enterprise clients on interesting problems across user experience, design and front-end development.
+
+ In his free time he contributes to http://sass-lang.com/ and is the father of the Sass logo.
+
+
+
+
+
+
+ Boyan Mihaylov I am interested in software architectures and using IT as a tool to solve everyday problems. I have been working in the consultancy sector the last couple of years where I have been part of a team to deliver IT solutions to different branches: insurance, pension funds, on-line commodities trading, ferry transport. I have been mainly working on .NET platform for back-end development and JavaScript at the client, specializing on techniques on separating these two and building the necessary layers.
+
+
+
+
+
+
+ Bruno Bellissimo Full stack mobile developer, CTO@Qurami.
+ I speak about software management and mobile development.
+
+
+
+
+
+
+ Carlo Beschi I've been on the web since the late 90's - studying it, using it, loving it, co-creating it.
+
+ I've done some software development, some project management, some program management, some consultancy, some training.
+
+ My current job and sincere interest is focused on the organization of work ("methods", "processes") in technology companies.
+
+ I try and help reduce human suffering, while increasing ROI.
+
+
+
+
+
+
+ Christian Heilmann Chris Heilmann has dedicated a lot of his time making the web better. Originally coming from a radio journalism background, he built his first web site from scratch around 1997 and spent the following years working on lots of large, international web sites. He then spent a few years in Yahoo building products and explaining and training people including Yahoo Answers, Search, Local and Maps. He then worked at Mozilla moving HTML5 support forward and advocating Firefox OS as an open alternative to closed mobile systems. Chris wrote two and contributed to eight books on web development and wrote
+
+
+
+
+
+
+ David Melendez David Melendez was born in 1983 in Zaragoza, Spain. He has a Bachellor Computer Degree by Wales University. Nowadays works as R&D software engineer for TV Studio manufacturer company, Albalá Ingenieros in Madrid. He has won several prices in robotic tournamens at Campus Party Spain 2010 and 2012, and has been a speaker in several conferences in Spain, RootedCON 2013, NavajaNegra 2013, OSWHCon 2014, 8.8 Security Conference in Chile 2014 and NoConName 2014 in Barcelona, Spain
+
+
+
+
+
+
+ David Pilato David Pilato is technical advocate at elasticsearch. He joined the company after spending the last two years to promote the project and spread the technology in France. He is leading the Elasticsearch French Community and give talks for Java User Groups and some conferences like Devoxx (BE, FR, UK), CodeMotion, Web5, Mix-IT and Open World Forum.
+ He implemented many plugins for the Elasticsearch ecosystem (Rivers: RSS, FileSystem and DropBox, Spring factories).
+
+
+
+
+
+
+ Emilia Ciardi Emilia is a software engineer with a focus on mobile gaming technologies and a long time experience leading cross functional teams. Working on a wide range of projects, from aerospacial software to e-learning and multimedia applications, she specialized in user experience design, graphical user interface and usability. She has a passion for videogames and over the years has developed several mobile casual games, using almost any tool at hand.
+ Emilia currently lives in Lugano and works at GTECH, gathering an in-deep knowledge on math models for the design of gambling and casino games.
+
+
+
+
+
+
+ Enrico Risa Software engineer, Hacker,open source enthusiast and music lover always looking for new technology.
+
+
+
+
+
+
+ Enrico Zimuel I'm a Software Engineer since 1996. I work in the R&D department of Zend Technologies in Cupertino (California). I'm an open source contributor of Zend Framework and Apigility. I'm a TEDx and regular speaker of conferences about web programming. I did computer science research at the Informatics Institute of the University of Amsterdam. I'm the co-author of the books PHP Best Practices and Javascript Best Pracitces published by FAG Milano. I'm the co-founder of PHP User Group in Turin (Italy), where I live and work remotely, most of my time.
+
+
+
+
+
+
+ Erica Barone Erica Barone is Technical Evangelist in Microsoft Italia since May 2014, mainly focused on Windows and Windows Phone platforms, but also involved in Internet of Things topic. After one year spent working as firmware designer in safety light curtains and vision sensors projects in Datalogic Automation s.r.l., she joined Microsoft as TE, following all the events involving Windows Phone developers.
+
+
+
+
+
+
+ Fabio Fabbrucci Sviluppatore per passione, frontendista per casualità.
+ Mi piace condividere le cose che apprendo con le comunità di riferimento facendo da speaker in diverse conferenze, e credo fortemente che il miglioramento continuo sia la via per poter mantenere viva la passione per ciò che faccio.
+ Da anni sono focalizzato sullo sviluppo di modalità di lavoro cross-funzionali, orientati a fornire valore al cliente ed a mantenere alta l’efficacia del team.
+ Credo che il software sia un mezzo, un veicolo per distribuire interfacce che aiutino le persone a risolvere - in parte - i loro problemi.
+
+
+
+
+
+
+ Fabio Mora Fabio Mora, classe 1990, software engineer ad eBay Inc. e studente di economia. Scrivo software e aiuto le organizzazioni a farlo al meglio con i metodi agili.
+
+ Fin da giovane appassionato di informatica, nel 2002 fondo un Linux User Group con amici e cresco con la community. Inizio a lavorare da freelance, nel 2010 fondo la mia prima Srl, che venderò poco dopo. Percorsa un po’ di strada arrivo a Cocoon Projects, un'azienda dove sperimento la cultura delle “open company” e nuovi modelli di governance.
+
+ Mi piace cantare e suonare la chitarra, leggere, la montagna, viaggiare per il mondo.
+
+
+
+
+
+
+ Felipe Hoffa Google Developer Advocate, focused on big data and BigQuery.
+
+
+
+
+
+
+ Francesco Cirillo Francesco is currently working on three new books, "The Waaaaaah! Decision Making Model", "Recombining Relational Production", and "Managing Software Development with RRP".
+ In the 1980s, Francesco created the Pomodoro Technique. In the 1990s, he became known as an expert mentor of Object-Oriented Software Engineering and established his reputation as one of the pioneers of XP and Agile Methods.
+ Over the years, Francesco has successfully trained and mentored hundreds of managers and developers throughout Europe on issues of productivity and the evolution of software.
+
+
+
+
+
+
+ Francesco Malatesta Francesco is a web developer and enthusiast with a focus on PHP and the Laravel Framework. He is the Founder of Laravel-Italia.it, the Laravel official italian community. Francesco also writes for Sitepoint as an Author and had many other writing experiences. From the 2012 to 2014 he translated Laravel Code Bright, Laravel Code Happy and Laravel Testing Decoded. Actually he is working on his own first english book. About Laravel, of course. Francesco actually lives in Rome and studies Computer Engineering at "La Sapienza" University of Rome.
+
+
+
+
+
+
+ Garann Means Garann began doing web development in 1997 and was drawn from the beginning to front-end development. While working in various languages at various companies, she watched JavaScript mature and eventually focused on that language and a speciality, using it in both client-side and server-side web dev. She also founded and led technical meetups and trainings, contributed articles to publications such as A List Apart, and is the author of one book, Node.js for Front-End Developers.
+
+
+
+
+
+
+ Gianfranco Fedele Web Software Analyst and Developer, I can cover all layers of development from database to services and user interfaces. Expert in Analysis, design and programming of databases. I collaborated in the development banking software, editorial software, management software. Speaker
+
+ Specialties: Web solutions, software and database architecture, data analisys, software development, software refactoring, database refactoring, verticalization, training.
+
+
+
+
+
+
+ Giovanni Laquidara Software Engineer working in Air Traffic Control and Command & Control System development field. Active member in GDG-Rome and CodeInvaders Communities having fun developing Android and Web Application. Startupper in love with new and life changing technologies. Digital Champion Tivoli. Work Hard Dance Hard ;)
+
+
+
+
+
+
+ Giulio De Donato Liuggio aka Giulio De Donato is a passionate open source developer, he works as CTO at Chupamobile .
+ Expert in e-commerce platforms and Service Oriented Architecture, he is actively involved in the PHP community and Golang ecosystem.
+ Latest projects that he has created is used by all the PHP repositories http://poser.pugx.org
+
+ He is known as evangelist of good design, cache and the data monitoring.
+
+ Speaker also in: SymfonyDay2012, PHPday 2013, SymfonyDay2013, SymfonyPortugal ...
+
+
+
+
+
+
+ Giuseppe Laddomada I am the founder of Travelchat, an app that lets you chat with locals in real-time.
+ In the last years, I have been working as product manager in several Berlin startups (including Rocket Internet, MONOQI & bonusbox). Beforehand, I studied innovation at Copenhagen Business School and Stockholm School of Economics and I have a double master degree from CEMS.
+
+
+
+
+
+
+ Karl-Henrik Nilsson Karl-Henrik is an experienced developer that have written code for anything from cellular network base stations to websites. He runs the local Microsoft competence network at Sogeti and spend a somewhat obsessive amount of his free time building smarter devices.
+
+ "If you ever need to see a man about building a smarter toaster - I'm that guy"
+
+ Previous speaking engagements at DevDay, IT-Arena, IT-Weekend and dozens of meetups,work and university talks.
+
+
+
+
+
+
+ Kevlin Henney Kevlin is an independent consultant and trainer based in the UK. His development interests are in patterns, programming, practice and process. He has been a columnist for various magazines and web sites, including Better Software and The Register. Kevlin is co-author of A Pattern Language for Distributed Computing and On Patterns and Pattern Languages, two volumes in the Pattern-Oriented Software Architecture series. He is also editor of 97 Things Every Programmer Should Know.
+
+
+
+
+
+
+ Krasimir Tsonev Krasimir Tsonev is a front-end developer, blogger and speaker. He loves writing JavaScript and experimenting with the latest CSS and HTML features. Author of the "Node.js blueprints" book he is focused on delivering cutting edge applications. At the moment Krasimir is working for TrialReach - London based health startup.
+
+
+
+
+
+
+ Kuba Waliński Kuba started coding VB6 in middle school. Then he learned Pascal, C, C++, Java, PHP, Prolog, C#, JavaScript & Python. Even though he spent most of his 7+ year career as an ASP.NET/C# developer, lately he's taken a deep dive in the (fascinating) world of JavaScript, discovering the joy of functional programming in the process, which resulted in experimenting with F# and Clojure. Having worked in a number of very different work environments (startup, small enterprise, big corporation), Kuba benefits from being able to approach programming challenges from different perspectives.
+
+
+
+
+
+
+ Luca Lanziani Software engineer, developer, linux addict, hacker as http://bit.ly/hacker_def , passionate traveler, InnovAction Lab alumnus
+
+
+
+
+
+
+ Lucia Zappacosta Nata in Abruzzo nel 1980 è dottore di ricerca in “Culture, linguaggi e politica della comunicazione”. Dal 2008 collabora con gallerie d’arte e nel 2011 diventa direttore artistico dell'Alviani ArtSpace spazio di ricerca sulle nuove frontiere del contemporaneo. Consulente per la comunicazione per diversi studi e agenzie, organizza grandi eventi culturali e creativi. A partire dal 1998 si occupa di temi alle evoluzioni nel web e dal 2012 è Presidente dell’Associazione Culturale telematica Metro Olografix.
+
+
+
+
+
+
+ Luigi Bennardis Laurea in Scienze Statistiche e Economiche e certificato MCSD.
+ Dal 2007 in Poste Italiane. Attualmente Information Sistem Manager, già Architetto IT (MS-J2EE) e Configuration Manager(Change Management-continuus integration-build automation).
+ In Banksiel per dieci anni come Operation Manager, incaricato nel rilascio di soluzioni applicative e di sicurezza per banche.
+ Nelle le precedenti esperienze in ISTAT e in Sistemi Informativi ha svolto il ruolo di sviluppatore OOP e di IT Solution Architect in tecnologie Java e Microsoft. Dal 2009 ha pubblicato una quindicina di articoli su Mokabyte.
+
+
+
+
+
+
+ Luigi Dell Aquila Computer engineer, Open Source enthusiast, technology addicted.
+ Programming languages, tools and frameworks are my toy box.
+ ICT consultant in the rest of the time.
+
+
+
+
+
+
+ Mandy Waite Mandy works at Google as a Developer Advocate for Google Cloud Platform and is working to make the world a better place for developers building applications for the Cloud. She came to Google from Sun Microsystems where she worked with partners on performance and optimisation of large scale applications and services before moving on to building an ecosystem of Open Source applications for OpenSolaris. In her spare time she is learning Japanese and plays the guitar.
+
+
+
+
+
+
+ Marco Casario Marco has been passionate about programming since he was little more than a child and used to program games in Basic for Commodore 64 before dedicating himself, while still very young, to innovative projects for the web using Javascript and Flash.
+ In 2005, Marco has founded Comtaste (www.comtaste.com), a company dedicated to exploring new frontiers in Rich Internet and Mobile Applications and the convergence between the web and the world of mobile devices.
+
+ He is author of the following book projects: HTML 5 Solutions, CSS3 Solutions, Flex 4 Cookbook, AIR Cookbook, and many more.
+
+
+
+
+
+
+ Marco Cecconi Marco Cecconi è uno sviluppatore per Stack Overflow e presenta talk su architettura e sviluppo.
+ Italiano di origine, è nomade da qualche anno. Ha studiato a Singapore, lavorato in Francia, Portogallo, ed ora in UK dove vive con moglie e figlio da qualche anno.
+
+ Come speaker ha parlato di Stack Overflow e programmazione a dozzine di conferenze internazionali, incluse keynote a Community Days Milano e QCon Pechino, talk a QCon Tokyo, Øredev Malmö, {codemotion} e molte ancora.
+
+ È noto come Sklivvz su twitter e Stack Exchange dove ha contribuito dall'inizio e è stato moderatore dal 2011.
+
+
+
+
+
+
+ Marco Trevisan A technology enthusiast since his first steps, Marco got soon caught by the Free Software world as an unique way to learn the art of programming from the deep and for a good cause.
+ So, he invested all his energies and curiosity to improve the open source world, scratching his own itches and contributing to various projects, which finally lead him to Ubuntu.
+
+ During the years Marco has been involved in various FLOSS projects such as Compiz, Openmoko, SHR, Enlightenment, GNOME (vala, gtk, libwnck…), to which he can now continue to contribute by working at Canonical as Software Engineer for Unity
+
+
+
+
+
+
+ Mario Fusco Mario is a senior software engineer at Red Hat working at the development of the core of Drools, the JBoss rule engine. He has a huge experience as Java developer having been involved in (and often leading) many enterprise level projects in several industries ranging from media companies to the financial sector. Among his interests there are also functional programming and Domain Specific Languages. He is also the co-author of "Java 8 in Action" published by Manning.
+
+
+
+
+
+
+ Mathias Buus Mathias is a Node.js hacker from Copenhagen, Denmark.
+ He is a core contributor to the open data project, dat and tends to write a bunch of npm modules whenever he has time.
+ Recently he's been working a lot with new ways of replicating of single purpose databases using leveldb and other mad science projects.
+
+
+
+
+
+
+ Mathilde Lemée After Mathilde Lemee joining Software AG (Terracotta) in 2012 as a R&D engineer working on ehcache and bigmemory, Mathilde now work as a freelancer. She co-founded the Duchess France Chapter, an organization to connect and give visibility to women in Java technology, in 2010, where she organised a lot of events (Hadoop, Mahout, Mockito, Cache …). She blogs on http://www.java-freelance.fr about performance, best practices and testing. She is a regular open source commuter and creator ofFluentLenium, a wrapper around Selenium that provide a Fluent API which is used in others open source project,
+
+
+
+
+
+
+ Matteo Antony Mistretta Software engineer, failed musician and digital craftsman, but most of all vehicle for the propagation of memes, Antony loves his job and loves bragging about it. He thinks that a master's degree in computer engineering is sufficient to save the world.
+
+
+
+
+
+
+ Matteo Collina Matteo is a code pirate and mad scientist. He spends most of his days programming in node.js, but in the past he worked with Ruby, Java and Objective-C. He recently defended his a Ph.D. thesis titled "Application Platforms for the Internet of Things". Now he is a Software Architect at nearForm, working on the nscale deployer. Matteo is also the author of the Node.js MQTT Broker, Mosca and of the LevelGraph database. Matteo spoke at several international conferences: Nodeconf.eu, LXJS, Distill by Engine Yard, and JsDay to name a few. In the summer he loves sailing the Sirocco.
+
+
+
+
+
+
+ Matteo guidotto Nato nell'umida laguna veneta, svezzato come developer nella campagna trevigiana grazie ad E-TREE, da tre anni a questa parte vivo e lavoro a Verona occupandomi più che di tecnologia, di persone. Project Management, User Experience ma anche formazione dei dipendenti e organizzazione di corsi.
+
+ Sono cofondatore di FEVR - Fronteders Verona, uno usergroup che si pone come riferimento a 180 gradi su tutti i temi riguardanti interfaccia: frontenddev, ux, pm, ia, design; dal 2014 faccio parte dell'organizzazione di TEDXVerona.
+
+
+
+
+
+
+ Matteo Pagani I’m a developer with a strong passion about mobile development and, especially, the Windows and Windows Phone platforms. A passion that I love to share with the communities as a blogger, book writer and speaker in many national and international conferences. I'm one of the founders of the community DotNetLombardia, I’ve been a Nokia Developer Champion and a Microsoft MVP for almost 5 years, until in November 2014 I joined Microsoft as a Support Engineer for the App Consult program to support Windows Store developers.
+
+
+
+
+
+
+ Matteo Scandolo Giovanni Lela LinkMe nasce nel 2009 e si rinnova nel 2013, seguendo le idee imprenditoriali di Juri Di Natale, uno dei soci fondatori.
+ Siamo una società giovane, dinamica e agile.
+ Quello tecnologico è un settore in rapida evoluzione. Per mantenere un vantaggio competitivo, le società sono obbligate ad adattarsi in modo flessibile. Il metodo di lavoro di LinkMe è agile e privo di sovrastrutture, per semplificare il client management e alleggerire i costi. Abbiamo creato una infrastruttura cloud che ci consente di lavorare senza confini e in completa libertà.
+
+
+
+
+
+
+ Matteo Valoriani Matteo Valoriani obtained the Master of Science cum Laude in Computer Engineering at Politecnico di Milano in 2011. He worked for two years at Microsoft Italy, but in 2012 he decided to follow his passion for technology and innovation and started a PhD in Computer Science. His research activity focuses on new unconventional technologies and paradigms for ambient interaction, as well as voice commands, touch and touchless gestures, proxemic Interactions. Matteo is Microsoft MVP for Kinect and Intel Software Innovator for RealSense. In 2014, he founded FifthIngeniun, focused on IT innovation.
+
+
+
+
+
+
+ Michele Finelli laureato in informatica nel 1995, studia per un ph.d., ma non lo termina: dal 1997 libero professionista e dal 2003 socio BioDec, la prima azienda bioinformatica italiana
+
+ siamo sicuri che nel 2014 serva descrivere la propria biografia ?
+
+
+
+
+
+
+ Nino Guarnacci Passion for innovation and Information Technology coupled with extensive experience has given me a straightaway approach to Enterprise Architecture: from Mobile, Integration System and Applications Architectures to full project life cycle definitions.Experience in meeting challenging deadlines and targets as a project manager improved my professional and competencies, problem solving and decision making skills, particularly in highly complex distributed scenarios. Work-Travelling all around the world thanks to my past experience in BEA and now in Oracle help me to catch new idea and trend.
+
+
+
+
+
+
+ Orlando K I am a keen software developer who likes APIs a whole lot - I often go to hackathons during weekends to release my inner passion for new ideas and quick code writing/prototyping. Occasionally watch sport on TV, but only if it's a major event.
+
+
+
+
+
+
+ Pete Smith Pete is a software consultant based in London with almost 10 years of experience making web applications with Asp.Net, specialising in API design and Javascript browser-based applications. He is the author of Superscribe - a graph based routing framework, and the OData library Linq to Querystring.
+
+
+
+
+
+
+ Philipp Krenn Philipp Krenn is running everything database related and the general infrastructure of the Vienna based B2B startup ecosio. When not fighting MongoDB, MySQL, Jenkins, or AWS, he is giving NoSQL and cloud computing trainings or organizes his meetups ViennaDB and Papers We Love Vienna.
+
+
+
+
+
+
+ Pietro Scarpino Pietro holds a Degree in Information Technology at University of Calabria.
+ His current position is Mobility & Innovation Competence Center Manager at NTT DATA ATSC, located in Cosenza. The competence center born with the mission to detect Innovation in the new IT paradigms, Improve mobility projects delivery capability, support NTT DATA mobility strategy and contribute to NTT DATA global R&D strategy by collaborating with NTT DATA Corporation in Japan on Innovative topics like Mobile Security, Wearable and IoT.
+ His main areas of activities are: Mobility, IoT, Innovation, Cyber Security.
+
+
+
+
+
+
+ Richard Rodger Richard Rodger is the CTO of nearForm.com, a Node.js consultancy that builds large-scale systems. Richard is the author of Mobile Application Development in the Cloud (Wiley 2012), and was formerly CTO of feedhenry.com, a mobile applications platform. He is a regular contributor to the Sunday Business Post newspaper in Ireland, and holds degrees in Mathematics and Philosophy, and Computer Science.
+
+
+
+
+
+
+ Roberto Collina Behind Aibotix Italia is an international, dynamic team with one great thing in common: the passion for artificial intelligence and robotics. Hence the company’s name AIBOTIX consists of AI for Artificial Intelligence and BOTIX for Robotics. With creativity, expertise and passion we explore every day the boundaries of robotics and artificial intelligence anew. Our goal: the development of intelligent, computer-controlled devices that make our work and lives easier and safer. Our core product is the flying robot Aibot X6.
+
+
+
+
+
+
+ Roberto Franchini Comincia con il C64 e non si ferma più.
+ Da 7 anni lavora per CELI (http://celi.it) dove si occupa di NLP, big data, scalabilità.
+ Per BlogMeter (http://www.blogmeter.it/) ha curato lo sviluppo dei back-end di analisi linguistica, concentrandosi sugli aspetti di scalabilità del sw e della intera infrastruttura hw, garantendo al sistema la possibilità di analizzare più di 3 milioni di documenti al giorno.
+ Fa parte del gruppo di coordinamento del JUG Torino.
+
+
+
+
+
+
+ Robin Johnson A Polyglot Programmer and Developer Evangelist at SendGrid, currently working amongst the world-wide developer community to ease the adoption of Email API technology. Having spoken at some of the world's leading technical conferences, Robin is building his way to being a player in the London tech scene; attending, speaking at, and even helping organise multiple large events. Mentoring on topics such as Distributed Systems, Golang, NoSQL Databases and Open Source values; Robin is as much hacker as he is hustler.
+
+
+
+
+
+
+ Roland Guijt Roland is a passionate developer, international speaker, Pluralsight author and trainer (MCT) for many years now. Disciplines are all of .Net, javascript + libraries and mobile app development.
+
+
+
+
+
+
+ Sara Vieira Sara is a freelance Front-End Developer from Portugal. She’s one of those few people in the world who love what they do and believe that the internet is something we are building and making better on a daily basis may that be through education websites or simply by creating useful one page applications. She is also a blogger on the weekend and has her work featured on Developer Drive and Webdesigner Depot. When she isn’t on the internet she’s a total TV Show addict and video game lover.
+
+
+
+
+
+
+ Simone Bordet Simone Bordet is a Jetty Committer, the CometD project leader and works as Lead Architect at Webtide, now part of Intalio. Active open source developer, he founded and contributed to various open source projects such as Jetty, CometD, MX4J, Foxtrot, LiveTribe, and others. Simone has been technical speaker at various national and international conferences such as Devoxx, JavaOne, CodeMotion, etc., and is a co-lead of the Java User Group of Torino, Italy. Simone specializes in server-side multi-thread development, J2EE application development, in Comet technologies applied to web development, web network protocols and in high performance JVM tuning.
+
+
+
+
+
+
+ Simone Onofri I am a Project Manager / Senior IT Security Consultant with 10 years of experience in IT field. I like to be Agile: DSDM® Consortium Community Member, Agile Project Management™ Practitioner and Certified ScrumMaster® (with Craig Larman). I carried out several projects in Ethical Hacking, Security Operation Center and Secure Software Development Life-Cycle areas.
+
+
+
+
+
+
+ Stefano Sanna Stefano wrote his first mobile app in 1999 (on a PSION 5MX!). He worked for 7 years at CRS4 in the Network Distributed Applications research group. He then joined beeweeb SpA in 2006 as Mobile Application Architect, working on Mobile TV client for leading European network operators. He is currently Manager at Open Reply (Reply Group), focused 100% on mobile and wearable applications. He wrote "Java Micro Edition" for Hoepli and "Android - Programmazione Avanzata" for FAG. Far from the keyboard, Stefano loves playing LEGO Technic with his sons and enjoying cakes lovely cooked by his wife.
+
+
+
+
+
+
+ Svetlana Isakova Svetlana is working on Project Kotlin at JetBrains since 2011. From time to time she tries to encourage people with Kotlin at the conferences. Before joining Kotlin she had a passion for the Scala programming language. She loves concepts and ideas, and skiing in the Alps as well.
+
+
+
+
+
+
+ Valerio Del Bello Always interested in improving software development methods and approaches, he gets excited with new technologies and technical solutions. He has been working for seven years as a consultant in (mostly) Java-oriented environments and spends it's free time exploring new methodologies or having fun experimenting the latest technology. He believes it's important to deeply understand the business needs to develop a great solution choosing the best architecture and technologies.
+
+
+
+
+
+
+ Werner Keil Werner Keil is Agile Coach and IoT/Embedded/Real Time expert. Helping Global 500 Enterprises across industries and leading IT vendors. He worked for over 25 years as Program Manager, Coach, SW architect and consultant for Finance, Mobile, Media, Tansport and Public sector. Werner is Eclipse and Apache Committer and JCP member in JSRs like 333 (JCR), 342 (Java EE 7), 354 (Money), 358/364 (JCP.next), Java ME 8, 362 (Portlet 3), 363 (Units, also Spec Lead), 365 (CDI 2) and the Executive Committee.
+
+
+
+
+
+
+ Yan Cui Yan works as a server side developer at Gamesys where he develops scalable backend services for Gamesys's social games on mobile and Facebook. He's a co-author of "F# Deep Dives" by Manning. He's a regular speaker on topics such as Aspect-Oriented Programming, F# and NoSQL, and he keeps an active blog at http://theburningmonk.com/
+
+
+
+
+
+
+ Yauheni Kaziak Yauheni Kaziak is a founder of the Stone Labs, Mobile and Web Development Studio with offices in US, Lithuania, Belarus and Hong Kong. The company is engaged in custom software development and outsourcing. Prior to this he has over 7 years of Project Management and Business Analyst experience in Mobile Development field. Has presented Belarus at the "Regional Mobile Application Contest 2013" sponsored by Nokia (Yerevan, Armenia) where his team has won 2d place among other Countries. Keynote speaker in numerous IT Events and Conferences in Russia, Belarus, Ukraine and Lithuania.
+
+
+
+
+
+
+
+
+
+
+
diff --git a/BeyondResponsiveDesign/content/speakers.json b/BeyondResponsiveDesign/content/speakers.json
new file mode 100644
index 0000000..5e052c9
--- /dev/null
+++ b/BeyondResponsiveDesign/content/speakers.json
@@ -0,0 +1 @@
+[{"Id":"470","Name":"Alessandro Cinelli","Role":"Head of Backend Engineering - Namshi","Bio":"Alessandro Cinelli (a.k.a. cirpo) is currently working at Namshi (http://namshi.com), the fashion e-commerce in the Middle East located in Dubai. He has a keen attention for enterprise patterns, methodologies, clean code and everything related to performances. He loves to share and give back to the community, that’s why he actively contributes to open source projects and when he was in Italy he has been a board member of the Italian PHP, Javascript User Group and WEBdeBS.","Links":[{"Icon":"linkedin","Url":"https://www.linkedin.com/in/cinellialessandro","Text":"https://www.linkedin.com/in/cinellialessandro"},{"Icon":"twitter","Url":"","Text":"@cirpo"}],"Sessions":[{"Id":"1060","Title":"PHP is the king, nodejs is the prince and Python is the fool","TimeSlotId":"14:50/15:50","TrackId":"8","Abstract":"At Namshi, an e-commerce retailer based in Dubai serving the UAE and GCC, we are using different technologies to boost our architecture.\r\nWe started with a common architecture based on PHP Nginx, Mysql and Memcache: the usual suspects. \r\nDuring last year the architecture changed a lot, using an SOA paradigm to meet expectations and the huge increase of traffic from several millions users throughout the year. But there’s more…\r\nIn this talk we will show how funny, easy and rewarding is to integrate different technologies in your stack, with PHP always being the king of the whole system.","Speaker":"Alessandro Cinelli","SpeakerId":"470","Day":"Friday"},{"Id":"994","Title":"Apt-get no more let Vagrant, Puppet and Docker take the stage","TimeSlotId":"16:10/17:10","TrackId":"2","Abstract":"How frustrating is to configure your dev machine everytime to meet the production specs?\r\nHow frustrating is to be sure that all of your colleagues have the same setup?\r\nHow to avoid distributing a new 4 GB vm to your team devs everytime you change the specs?\r\nEnter Vagrant, Puppet and Docker, the easy way to distribute vm and integrate them in your project repo\r\nwith just few KB!","Speaker":"Alessandro Cinelli","SpeakerId":"470","Day":"Friday"}]},{"Id":"391","Name":"Alfredo Morresi","Role":"Developer Relations - Google","Bio":"79ers, nature and technology lover, supporter of open-source philosophy and footings along the beach. Maieutic and social oriented, passionate about evolutions of mobile world. Best dishes: community, code and Tiramisu’. Desires? A couple of additional hours of sleep every day.","Links":[{"Icon":"website","Url":"http://www.rainbowbreeze.it","Text":"http://www.rainbowbreeze.it"},{"Icon":"linkedin","Url":"http://it.linkedin.com/in/alfredomorresi","Text":"http://it.linkedin.com/in/alfredomorresi"},{"Icon":"twitter","Url":"","Text":"@rainbowbreeze"}],"Sessions":[{"Id":"983","Title":"The second screen world in the Google Cast era","TimeSlotId":"14:50/15:50","TrackId":"1","Abstract":"TVs are the biggest, most beautiful screen in people’s living rooms. Google Cast is a technology that enables true multi-screen experiences for the users.\r\n\r\nIntegrating Google Cast into existing applications is simple, and we’re going to cover the SDK and resources available to make your application Cast enabled really easily. Android, iOS and Web.\r\n\r\nPossibilities? Endless: not only casting video or audio, but also games where the TV becomes the new and high-tech game board or a variety of other apps to enjoy with friends, sitting together on the couch.","Speaker":"Alfredo Morresi","SpeakerId":"391","Day":"Friday"}]},{"Id":"287","Name":"Andrea Boschin","Role":"Owner, Consultant - Elite Agency","Bio":"Andrea si occupa di sviluppo di software da più di 15 anni, con particolare predilezione per le tecnologie web ma con esperienze molteplici anche in ambito desktop e web service. Dal 2007 è Microsoft MVP, dapprima nell'ambito di ASP.NET e in seguito su Silverlight per il quale è stato il primo ad essere nominato in Italia. Scrive correntemente articoli tecnici per testate internazionali e per il proprio weblog, e conduce da più di 8 anni XeDotNet, il più attivo user group di Italia in termini di eventi organizzati.","Links":[{"Icon":"website","Url":"http://xamlplayground.org","Text":"http://xamlplayground.org"},{"Icon":"linkedin","Url":"http://www.linkedin.com/in/boschin","Text":"http://www.linkedin.com/in/boschin"},{"Icon":"twitter","Url":"","Text":"aboschin"}],"Sessions":[{"Id":"1113","Title":"Typescript, Angular e Bootstrap assieme per applicazioni real world","TimeSlotId":"09:00/10:00","TrackId":"5","Abstract":"La recente affermazione in ambito web delle applicazioni rich basate su HTML5 e Javascript è diventato sorgente di una serie di librerie innovative e di strumenti che, se usati correttamente, possono semplificare enormemente lo sviluppo. In questa sessione sarà illustrato come sfruttare Typescript, in concomitanza con Angular e Bootstrap per realizzare applicazioni che sfruttino al massimo le possibilità dei browser e diano un feedback il più possibile simile alle applicazioni desktop","Speaker":"Andrea Boschin","SpeakerId":"287","Day":"Saturday"}]},{"Id":"190","Name":"Andrea Pompili","Role":"Security Consuntant - Mine","Bio":"Andrea Pompili è un informatico che si occupa di sicurezza. Giovanissimo, è entrato nel mondo dei computer realizzando uno dei più celebri videogiochi italiani della vecchia informatica. Terminati gli studi, si è occupato prima di sviluppo software e quindi di sicurezza informatica. Attualmente consulente strategico in ambito sicurezza e networking per l'integrazione di soluzioni innovative. Dal 2013 fa parte del core developement team del progetto OWASP ZAP.","Links":[{"Icon":"website","Url":"http://letigriditelecom.blogspot.it/","Text":"http://letigriditelecom.blogspot.it/"},{"Icon":"linkedin","Url":"http://www.linkedin.com/in/andreapompili","Text":"http://www.linkedin.com/in/andreapompili"},{"Icon":"twitter","Url":"","Text":""}],"Sessions":[{"Id":"1021","Title":"The Dark Side of Malware Analysis","TimeSlotId":"10:00/11:00","TrackId":"5","Abstract":"Storicamente il reversing di eseguibili è sempre stata una pratica oscura associata alla pirateria o allo spionaggio industriale, ma oggi, con l'aumentare di malware targettizzati, quest'arte sta diventando un argomento molto discusso perchè necessita \r\nuna forte capacità di analisi, intuizione ed inventiva. Ma perchè è così importante analizzare un malware? Quali strumenti utlizzare, ma soprattutto come approcciare il problema? Come gestire i meccanismi di protezione adottati? Niente di meglio \r\nper addentrarci nel mondo della malware analysis partendo proprio da alcuni casi reali","Speaker":"Andrea Pompili","SpeakerId":"190","Day":"Friday"}]},{"Id":"926","Name":"Arun Gupta","Role":"Director, Developer Advocacy - Red Hat","Bio":"Arun Gupta is Director of Developer Advocacy at Red Hat and focuses on JBoss Middleware. As a founding member of the Java EE team at Sun Microsystems, he spread the love for technology all around the world. At Oracle, he led a cross-functional team to drive the global launch of the Java EE 7 platform through strategy, planning, and execution of content, marketing campaigns, and program. He is a prolific blogger since 2005 and have authored 1500+ blogs on technology. Arun has extensive speaking experience in ~40 countries on myriad topics and is a JavaOne Rockstar. He also founded the Devoxx4Ki","Links":[{"Icon":"website","Url":"http://blog.arungupta.me","Text":"http://blog.arungupta.me"},{"Icon":"twitter","Url":"","Text":"@arungupta"}],"Sessions":[{"Id":"1085","Title":"Refactor your Java EE application using Microservices and Containers","TimeSlotId":"16:20/17:20","TrackId":"2","Abstract":"This talk will provide a quick introduction to Docker images (build time), containers (run time), and registry (distribution). It shows how to take an existing Java EE application and package it as a monolithic application as a single Docker image. The application will then be refactored in to multiple microservices and assembled together using orchestration. Unit and integration testing of such applications will be discussed and shown as well. Design patterns and anti-patterns that show how to create cluster of such applications will be demonstrated and discussed.","Speaker":"Arun Gupta","SpeakerId":"926","Day":"Saturday"}]},{"Id":"192","Name":"Bermon Painter","Role":"Experience Design, Practice Manager - Cardinal Solutions","Bio":"Bermon is the organizer of various community groups for user experience designers and front-end developers, and the organizer of Blend Conference, a 3-day multi-track event for user experience strategists, designers and developers. He also leads the user experience team for Cardinal Solutions' Charlotte office where he consults with large enterprise clients on interesting problems across user experience, design and front-end development. \r\n\r\nIn his free time he contributes to http://sass-lang.com/ and is the father of the Sass logo.","Links":[{"Icon":"website","Url":"http://bermonpainter.com","Text":"http://bermonpainter.com"},{"Icon":"linkedin","Url":"https://www.linkedin.com/in/bermonpainter","Text":"https://www.linkedin.com/in/bermonpainter"},{"Icon":"twitter","Url":"","Text":"bermonpainter"}],"Sessions":[{"Id":"1089","Title":"Integrating User Experience and Agile","TimeSlotId":"09:00/10:00","TrackId":"3","Abstract":"The web is no longer in it's infancy. We're growing up. The age old model of creating time consuming deliverables just to appease a client is over. Disciplines must now collaborate, reduce waste and learn to be truly agile in order to create high quality products. In this presentation attendees will discover: \r\n\r\n• a quick review of user experience\r\n• methodology tools in the toolbox (Agile, Scrum, Kanban, Lean)\r\n• the difference between a deliverable and an artifact \r\n• integrating user experience into agile processes\r\n• ways to reduce waste and get to market quickly","Speaker":"Bermon Painter","SpeakerId":"192","Day":"Saturday"}]},{"Id":"1091","Name":"Boyan Mihaylov","Role":"Software architect and developer - Ebita","Bio":"I am interested in software architectures and using IT as a tool to solve everyday problems. I have been working in the consultancy sector the last couple of years where I have been part of a team to deliver IT solutions to different branches: insurance, pension funds, on-line commodities trading, ferry transport. I have been mainly working on .NET platform for back-end development and JavaScript at the client, specializing on techniques on separating these two and building the necessary layers.","Links":[{"Icon":"website","Url":"http://boyan.in","Text":"http://boyan.in"},{"Icon":"linkedin","Url":"http://www.linkedin.com/in/bmihaylov","Text":"http://www.linkedin.com/in/bmihaylov"},{"Icon":"twitter","Url":"","Text":"@bmihaylov"}],"Sessions":[{"Id":"1120","Title":"AngularJS 2.0: A natural evolvement or a new beginning","TimeSlotId":"15:00/16:00","TrackId":"5","Abstract":"For only a couple of years AngularJS has become a standard when talking about single-page applications. Its modularity, testability and structure gives developers a well-defined scope and certain confidence in their projects. As Web changes, so a natural change is expected to happen in the project itself. Version 2.0 however brings a far new world. Although it builds on the existing foundation and governing principles behind the project, it reveals some aspects that have already provoked discussions in the community. In this talk I will go through the new components in AngularJS 2.0: ECMAScrip","Speaker":"Boyan Mihaylov","SpeakerId":"1091","Day":"Saturday"}]},{"Id":"724","Name":"Bruno Bellissimo","Role":"CTO - Qurami","Bio":"Full stack mobile developer, CTO@Qurami.\r\nI speak about software management and mobile development.","Links":[{"Icon":"twitter","Url":"","Text":"@brbellissimo"}],"Sessions":[{"Id":"1064","Title":"Una Startup asincrona e distribuita","TimeSlotId":"09:00/10:00","TrackId":"1","Abstract":"Costruire una startup con un team tecnico completamente remoto non è un modo per evitare il traffico mattutino, ma un' opportunità per costruire una squadra migliore e più produttiva. Il lavoro remoto richiede un diverso approccio alla comunicazione ed ai processi, ma se gestito in modo corretto, può essere un arma capace di fare la differenza.","Speaker":"Bruno Bellissimo","SpeakerId":"724","Day":"Saturday"}]},{"Id":"583","Name":"Carlo Beschi","Role":"co-founder - devsum","Bio":"I've been on the web since the late 90's - studying it, using it, loving it, co-creating it. \r\n\r\nI've done some software development, some project management, some program management, some consultancy, some training.\r\n\r\nMy current job and sincere interest is focused on the organization of work (\"methods\", \"processes\") in technology companies. \r\n\r\nI try and help reduce human suffering, while increasing ROI.","Links":[{"Icon":"linkedin","Url":"http://www.linkedin.com/in/beschi","Text":"http://www.linkedin.com/in/beschi"},{"Icon":"twitter","Url":"","Text":"@carloz"}],"Sessions":[{"Id":"1038","Title":"E' meglio Kanban o Scrum? (Prossima domanda, prego)","TimeSlotId":"14:50/15:50","TrackId":"6","Abstract":"Metto a confronto - con l'aiuto del pubblico - i due "metodi agili" più di moda - Scrum, al top delle classifiche da qualche anno, e Kanban, stabile al secondo posto. Riassumo la loro storia ed evoluzione. Riepilogo le loro "regole" (cosa prescrivono, in termini di ruoli, eventi. processi). Mostro un po' di dati sulla loro adozione, in Italia e all'estero. E concludo con un piccolo ragionamento sui valori che ci stanno dietro (a loro e altri metodi "agili"), che spiega perchè la domanda "E' meglio x o y?" è, in molti casi, poco significativa.","Speaker":"Carlo Beschi","SpeakerId":"583","Day":"Friday"}]},{"Id":"1099","Name":"Christian Heilmann","Role":"Enthusiast - The Open Web","Bio":"Chris Heilmann has dedicated a lot of his time making the web better. Originally coming from a radio journalism background, he built his first web site from scratch around 1997 and spent the following years working on lots of large, international web sites. He then spent a few years in Yahoo building products and explaining and training people including Yahoo Answers, Search, Local and Maps. He then worked at Mozilla moving HTML5 support forward and advocating Firefox OS as an open alternative to closed mobile systems. Chris wrote two and contributed to eight books on web development and wrote","Links":[{"Icon":"website","Url":"http://christianheilmann.com","Text":"http://christianheilmann.com"},{"Icon":"twitter","Url":"","Text":"@codepo8"}],"Sessions":[{"Id":"1109","Title":"No more excuses left - let's build great things","TimeSlotId":"16:20/17:20","TrackId":"4","Abstract":"As developers, we know things break. We also know how to fix them. What we don't do is do this efficiently. Instead we seem to have a perverse fascination telling one another and the world how broken things are. If you look, however, how cool technology is these days, what tools we have at our disposal and the latest changes in the last excuse we had: "What about IE?" it is time to stop complaining and get to work. Our job is to build things that people want to use. Not to complain about our tools. This is what people looking for excuses do. We're better than that.","Speaker":"Christian Heilmann","SpeakerId":"1099","Day":"Saturday"}]},{"Id":"1110","Name":"David Melendez","Role":"R&D Sofware Engineer - Albala Ingenieros S.A.","Bio":"David Melendez was born in 1983 in Zaragoza, Spain. He has a Bachellor Computer Degree by Wales University. Nowadays works as R&D software engineer for TV Studio manufacturer company, Albalá Ingenieros in Madrid. He has won several prices in robotic tournamens at Campus Party Spain 2010 and 2012, and has been a speaker in several conferences in Spain, RootedCON 2013, NavajaNegra 2013, OSWHCon 2014, 8.8 Security Conference in Chile 2014 and NoConName 2014 in Barcelona, Spain","Links":[{"Icon":"website","Url":"http://taiksonprojects.blogspot.com","Text":"http://taiksonprojects.blogspot.com"},{"Icon":"twitter","Url":"","Text":"@taiksontexas"}],"Sessions":[{"Id":"1018","Title":"Trash Robotic Router Platform","TimeSlotId":"17:20/18:00","TrackId":"4","Abstract":"Building a drone from scratch with spare parts is a challenging business. To accomplish this journey, a Linux embedded stability control system is developed entirely from 0.This is a journey starting from the hardware choosing (a home WIFI router), to a stable and real flight. Unconventional implementations are one of the main topic, like using WiFi as communication between drone and pilot, HTML5 and COMET to show telemetry from the router web server, and implementing a entirely new protocol based on 802.11 Beacon Frames to prevent deauthentication attacks.","Speaker":"David Melendez","SpeakerId":"1110","Day":"Friday"}]},{"Id":"116","Name":"David Pilato","Role":"developer - elasticsearch","Bio":"David Pilato is technical advocate at elasticsearch. He joined the company after spending the last two years to promote the project and spread the technology in France. He is leading the Elasticsearch French Community and give talks for Java User Groups and some conferences like Devoxx (BE, FR, UK), CodeMotion, Web5, Mix-IT and Open World Forum.\r\nHe implemented many plugins for the Elasticsearch ecosystem (Rivers: RSS, FileSystem and DropBox, Spring factories).","Links":[{"Icon":"website","Url":"http://dev.david.pilato.fr/","Text":"http://dev.david.pilato.fr/"},{"Icon":"linkedin","Url":"http://fr.linkedin.com/in/dadoonet/","Text":"http://fr.linkedin.com/in/dadoonet/"},{"Icon":"twitter","Url":"","Text":"@dadoonet"}],"Sessions":[{"Id":"1084","Title":"Advanced search for your legacy application","TimeSlotId":"15:00/16:00","TrackId":"2","Abstract":"How do you mix SQL and NoSQL worlds without starting a messy revolution?\r\n\r\nThis live coding talk will show you how to add Elasticsearch to your legacy application without changing all your current development habits. Your application will have suddenly have advanced search features, all without the need to write complex SQL code!\r\n\r\nDavid will start from a Spring, Hibernate and Postgresql based application and will add a complete integration of Elasticsearch, all live from the stage during his presentation.","Speaker":"David Pilato","SpeakerId":"116","Day":"Saturday"}]},{"Id":"1163","Name":"Emilia Ciardi","Role":"Head of Native Games - GTECH","Bio":"Emilia is a software engineer with a focus on mobile gaming technologies and a long time experience leading cross functional teams. Working on a wide range of projects, from aerospacial software to e-learning and multimedia applications, she specialized in user experience design, graphical user interface and usability. She has a passion for videogames and over the years has developed several mobile casual games, using almost any tool at hand.\r\nEmilia currently lives in Lugano and works at GTECH, gathering an in-deep knowledge on math models for the design of gambling and casino games.","Links":[{"Icon":"website","Url":"http://www.gtech.com/","Text":"http://www.gtech.com/"},{"Icon":"linkedin","Url":"http://ch.linkedin.com/in/ekleptica","Text":"http://ch.linkedin.com/in/ekleptica"},{"Icon":"twitter","Url":"","Text":""}],"Sessions":[{"Id":"1092","Title":"Mobile UX for user engagement and monetization","TimeSlotId":"11:40/12:20","TrackId":"3","Abstract":"The talk dives into the best practices for user engagement and monetization of mobile apps and games. Through examples and real-life scenarios, the key moments of the mobile user experience will be examined to provide guidelines and hands-on practices to help monetize apps and turn average users into a marketing and revenue building resource.","Speaker":"Emilia Ciardi","SpeakerId":"1163","Day":"Saturday"}]},{"Id":"297","Name":"Enrico Risa","Role":"Developer - Freelance","Bio":"Software engineer, Hacker,open source enthusiast and music lover always looking for new technology.","Links":[{"Icon":"twitter","Url":"","Text":"@wolf4ood"}],"Sessions":[{"Id":"1147","Title":"Meteor + Polymer, the Holy Grail of Web Development.","TimeSlotId":"17:30/18:10","TrackId":"7","Abstract":"Meteor is an open-source Javascript platform for building modern web apps. Polymer is a library for creating Web Components, which are a set of W3C standards and upcoming browser APIs for defining your own custom HTML elements. Let's combine them to build modern, reactive and beautiful web apps.","Speaker":"Enrico Risa","SpeakerId":"297","Day":"Saturday"}]},{"Id":"982","Name":"Enrico Zimuel","Role":"Senior Software Engineer - Zend Technologies","Bio":"I'm a Software Engineer since 1996. I work in the R&D department of Zend Technologies in Cupertino (California). I'm an open source contributor of Zend Framework and Apigility. I'm a TEDx and regular speaker of conferences about web programming. I did computer science research at the Informatics Institute of the University of Amsterdam. I'm the co-author of the books PHP Best Practices and Javascript Best Pracitces published by FAG Milano. I'm the co-founder of PHP User Group in Turin (Italy), where I live and work remotely, most of my time.","Links":[{"Icon":"website","Url":"http://www.zimuel.it","Text":"http://www.zimuel.it"},{"Icon":"linkedin","Url":"https://www.linkedin.com/in/ezimuel","Text":"https://www.linkedin.com/in/ezimuel"},{"Icon":"twitter","Url":"","Text":"@ezimuel"}],"Sessions":[{"Id":"1156","Title":"Develop and design RESTful web API in PHP using Apigility","TimeSlotId":"15:00/16:00","TrackId":"8","Abstract":"Develop a robust RESTful web API is not a simple task. How to manage the error handling? Which format to use for the data exchange? How to manage the content negotiation? What about the versioning? How to build an authentication system? How to produce the API documentation? In this talk we will show how to design and implement a REST architecture using Apigility, the open source API builder for PHP (http://apigility.org).","Speaker":"Enrico Zimuel","SpeakerId":"982","Day":"Saturday"}]},{"Id":"1176","Name":"Erica Barone","Role":"Technical Evangelist - Microsoft","Bio":"Erica Barone is Technical Evangelist in Microsoft Italia since May 2014, mainly focused on Windows and Windows Phone platforms, but also involved in Internet of Things topic. After one year spent working as firmware designer in safety light curtains and vision sensors projects in Datalogic Automation s.r.l., she joined Microsoft as TE, following all the events involving Windows Phone developers.","Links":[{"Icon":"twitter","Url":"","Text":"@_ericabarone"}],"Sessions":[{"Id":"977","Title":"Windows 10 e il futuro delle Universal App","TimeSlotId":"10:00/11:00","TrackId":"1","Abstract":"Windows 10 è la piattaforma unificata per telefoni, tablet, desktop, Xbox, board, Hololens e Surface Hub. In questa sessione vedremo quali sono le novità principali della nuova piattaforma e come sfruttarle al meglio nelle nostre applicazioni.","Speaker":"Erica Barone","SpeakerId":"1176","Day":"Friday"}]},{"Id":"307","Name":"Fabio Fabbrucci","Role":"Frontend Developer - GNV & Partners","Bio":"Sviluppatore per passione, frontendista per casualità.\r\nMi piace condividere le cose che apprendo con le comunità di riferimento facendo da speaker in diverse conferenze, e credo fortemente che il miglioramento continuo sia la via per poter mantenere viva la passione per ciò che faccio.\r\nDa anni sono focalizzato sullo sviluppo di modalità di lavoro cross-funzionali, orientati a fornire valore al cliente ed a mantenere alta l’efficacia del team.\r\nCredo che il software sia un mezzo, un veicolo per distribuire interfacce che aiutino le persone a risolvere - in parte - i loro problemi.","Links":[{"Icon":"website","Url":"http://fabbrucci.me","Text":"http://fabbrucci.me"},{"Icon":"linkedin","Url":"http://it.linkedin.com/in/fabiofabbrucci","Text":"http://it.linkedin.com/in/fabiofabbrucci"},{"Icon":"twitter","Url":"","Text":"@Fabbrucci"}],"Sessions":[{"Id":"1087","Title":"Come creare e manutenere una Styleguide visiva per i tuoi clienti","TimeSlotId":"17:30/18:10","TrackId":"2","Abstract":"In base alla maturità, tipologia e dimensione di un progetto i workflow di design e sviluppo possono cambiare. \r\nUna delle tecniche più 'breakthrough' dei workflow è quella delle styleguide.\r\nCosa sono (e cosa non sono)? Come si usano? Come si progettano? Quali sono i pro e i contro? Serve per forza BEM? arà un talk 20% metodo, 60% tecnica e 20% domande!","Speaker":"Fabio Fabbrucci","SpeakerId":"307","Day":"Saturday"}]},{"Id":"236","Name":"Fabio Mora","Role":"Software Engineer - eBay Inc.","Bio":"Fabio Mora, classe 1990, software engineer ad eBay Inc. e studente di economia. Scrivo software e aiuto le organizzazioni a farlo al meglio con i metodi agili.\r\n\r\nFin da giovane appassionato di informatica, nel 2002 fondo un Linux User Group con amici e cresco con la community. Inizio a lavorare da freelance, nel 2010 fondo la mia prima Srl, che venderò poco dopo. Percorsa un po’ di strada arrivo a Cocoon Projects, un'azienda dove sperimento la cultura delle “open company” e nuovi modelli di governance.\r\n\r\nMi piace cantare e suonare la chitarra, leggere, la montagna, viaggiare per il mondo.","Links":[{"Icon":"website","Url":"http://fabiomora.com","Text":"http://fabiomora.com"},{"Icon":"linkedin","Url":"http://it.linkedin.com/in/fabiomora","Text":"http://it.linkedin.com/in/fabiomora"},{"Icon":"twitter","Url":"","Text":"@morafabio"}],"Sessions":[{"Id":"992","Title":"Continuous Delivery di una webapp by example","TimeSlotId":"14:00/14:40","TrackId":"2","Abstract":"Una feature non è completa finché non è nelle mani di chi la deve usare. Solo da lì inizia a produrre valore, sia economico o feedback. Che si tratti di master, preview o prod, con l’automazione delle build si possono evitare operazioni ripetitive, complesse, risparmiare tempo ed ottenere interessanti metriche. Tutto al fine di arrivare a poter rilasciare ogni poche ore (ogni volta che la build è verde!). Una overview di una delle 12 pratiche di Extreme Programming: continuous integration (e delivery) con gli strumenti al momento più interessanti. Esempio con una webapp in PHP.","Speaker":"Fabio Mora","SpeakerId":"236","Day":"Friday"}]},{"Id":"338","Name":"Felipe Hoffa","Role":"Developer Advocate - Google","Bio":"Google Developer Advocate, focused on big data and BigQuery.","Links":[{"Icon":"website","Url":"https://developers.google.com/bigquery/","Text":"https://developers.google.com/bigquery/"},{"Icon":"twitter","Url":"","Text":"felipehoffa"}],"Sessions":[{"Id":"1043","Title":"Hands-on with BigQuery JavaScript User-Defined Functions","TimeSlotId":"10:00/11:00","TrackId":"7","Abstract":"Performing ETL on big data can be slow, expensive and painful - but it doesn't have to be! In this session, we'll take an in-depth look at several real-world examples of computations that don't fit well with the SQL language model and how to solve them with user-defined functions in Google BigQuery.\r\n\r\nBigQuery is a fully-managed SQL analytical engine, also used internally in Google, capable of analyzing terabytes of data per second. BigQuery executes user-defined functions on the same server shards that handle data processing and analytics, allowing extremely efficient execution.","Speaker":"Felipe Hoffa","SpeakerId":"338","Day":"Friday"}]},{"Id":"663","Name":"Francesco Cirillo","Role":"Coach - Programming With Francesco","Bio":"Francesco is currently working on three new books, \"The Waaaaaah! Decision Making Model\", \"Recombining Relational Production\", and \"Managing Software Development with RRP\".\r\nIn the 1980s, Francesco created the Pomodoro Technique. In the 1990s, he became known as an expert mentor of Object-Oriented Software Engineering and established his reputation as one of the pioneers of XP and Agile Methods.\r\nOver the years, Francesco has successfully trained and mentored hundreds of managers and developers throughout Europe on issues of productivity and the evolution of software.","Links":[{"Icon":"website","Url":"http://www.programmingwithfrancesco.com","Text":"http://www.programmingwithfrancesco.com"},{"Icon":"linkedin","Url":"http://de.linkedin.com/in/cirillof/","Text":"http://de.linkedin.com/in/cirillof/"},{"Icon":"twitter","Url":"","Text":"@progwithfc"}],"Sessions":[{"Id":"1108","Title":"Waaaaaah! - Sviluppare Software con la Produzione Relazionale Ricombinante (RRP)","TimeSlotId":"15:00/16:00","TrackId":"4","Abstract":"Sviluppare il software richiede migliaia di piccole decisioni da parte di noi sviluppatori. Quale criterio usiamo per fare il nostro prossimo passo? La consapevolezza di questo criterio è la chiave per la nostra produttività. Francesco presenterà un nuovo approccio allo sviluppo del software basato su questa forma di consapevolezza. Essere consapevoli delle nostre decisioni può farci scoprire nuovi modi di fare design e di organizzare il nostro team in modo produrre più feature con meno costi e in modo sostenibile.","Speaker":"Francesco Cirillo","SpeakerId":"663","Day":"Saturday"}]},{"Id":"1173","Name":"Francesco Malatesta","Role":"Founder - Laravel-Italia","Bio":"Francesco is a web developer and enthusiast with a focus on PHP and the Laravel Framework. He is the Founder of Laravel-Italia.it, the Laravel official italian community. Francesco also writes for Sitepoint as an Author and had many other writing experiences. From the 2012 to 2014 he translated Laravel Code Bright, Laravel Code Happy and Laravel Testing Decoded. Actually he is working on his own first english book. About Laravel, of course. Francesco actually lives in Rome and studies Computer Engineering at \"La Sapienza\" University of Rome.","Links":[{"Icon":"website","Url":"http://www.hellofrancesco.com","Text":"http://www.hellofrancesco.com"},{"Icon":"linkedin","Url":"http://it.linkedin.com/pub/francesco-malatesta/30/b69/3a5","Text":"http://it.linkedin.com/pub/francesco-malatesta/30/b69/3a5"},{"Icon":"twitter","Url":"","Text":"@malatestafra"}],"Sessions":[{"Id":"1056","Title":"Loving Beautiful Code - Alla Scoperta di Laravel 5","TimeSlotId":"11:30/12:10","TrackId":"8","Abstract":"Laravel 4 ha portato una ventata d'aria fresca nel mondo PHP. Adesso, nel 2015, l'uscita di Laravel 5 segna un ulteriore punto di svolta. In questo talk Francesco introdurrà l'ultima versione del Framework e spiegherà quanto è semplice creare applicazioni, in pochissimo tempo e con una sintassi piacevole ed espressiva. Verranno coperte tutte le basi necessarie ad iniziare a lavorare, partendo dal MVC arrivando ad Eloquent, il potente ORM in dotazione. Come degna conclusione, quindi, una veloce sessione di live coding per rendere l'idea del vero livello di flessibilità di Laravel.","Speaker":"Francesco Malatesta","SpeakerId":"1173","Day":"Friday"}]},{"Id":"1151","Name":"Garann Means","Role":"JavaScript developer - freelance","Bio":"Garann began doing web development in 1997 and was drawn from the beginning to front-end development. While working in various languages at various companies, she watched JavaScript mature and eventually focused on that language and a speciality, using it in both client-side and server-side web dev. She also founded and led technical meetups and trainings, contributed articles to publications such as A List Apart, and is the author of one book, Node.js for Front-End Developers.","Links":[{"Icon":"website","Url":"http://garann.com","Text":"http://garann.com"},{"Icon":"linkedin","Url":"http://www.linkedin.com/in/garann","Text":"http://www.linkedin.com/in/garann"},{"Icon":"twitter","Url":"","Text":"@garannm"}],"Sessions":[{"Id":"1123","Title":"Progressive Enhancement for JavaScript Apps","TimeSlotId":"17:30/18:10","TrackId":"5","Abstract":"When progressive enhancement was introduced as a concept, JavaScript applications seemed as relevant as flying cars. As JS became more powerful, it seemed we'd reach a point where we could forget PE entirely. For its original meaning, we now have rock-solid libraries and polyfills to provide abstractions that make PE easy. But as JS has advanced, we've started writing things that can't be polyfilled. We know now how to progressively enhance widgets and user interactions. We'll talk about how we progressively enhance entire applications, and why it's more important than ever that we do so.","Speaker":"Garann Means","SpeakerId":"1151","Day":"Saturday"}]},{"Id":"92","Name":"Gianfranco Fedele","Role":"Web architect - Insem S.p.A.","Bio":"Web Software Analyst and Developer, I can cover all layers of development from database to services and user interfaces. Expert in Analysis, design and programming of databases. I collaborated in the development banking software, editorial software, management software. Speaker\r\n\r\nSpecialties: Web solutions, software and database architecture, data analisys, software development, software refactoring, database refactoring, verticalization, training.","Links":[{"Icon":"linkedin","Url":"http://it.linkedin.com/in/gianfrasoft","Text":"http://it.linkedin.com/in/gianfrasoft"},{"Icon":"twitter","Url":"","Text":"@gianfrasoft"}],"Sessions":[]},{"Id":"266","Name":"Giovanni Laquidara","Role":"Technical leader - GDG-Rome","Bio":"Software Engineer working in Air Traffic Control and Command & Control System development field. Active member in GDG-Rome and CodeInvaders Communities having fun developing Android and Web Application. Startupper in love with new and life changing technologies. Digital Champion Tivoli. Work Hard Dance Hard ;)","Links":[{"Icon":"website","Url":"www.laquysoft.com","Text":"www.laquysoft.com"},{"Icon":"linkedin","Url":"http://www.linkedin.com/profile/view?id=9774768","Text":"http://www.linkedin.com/profile/view?id=9774768"},{"Icon":"twitter","Url":"","Text":"@joaolaq"}],"Sessions":[{"Id":"1061","Title":"Join The Dart Side Of Web Development 2 ( Use The Force )","TimeSlotId":"16:10/17:10","TrackId":"8","Abstract":"Hai seguito il precedente Talk su Dart a Codemotion Roma e Milano 2014? Ti ha incuriosito questo nuovo e potente linguaggio "battery included" by Google?\r\nAllora proseguiamo questo viaggio all'interno del Dartiverse, visiteremo insieme Polymer.Dart, Dart Force, e StageXL alcune tra la più potenti librerie per realizzare Web App davvero potenti in maniera semplice.","Speaker":"Giovanni Laquidara","SpeakerId":"266","Day":"Friday"}]},{"Id":"168","Name":"Giulio De Donato","Role":"CTO - Chupamobile","Bio":"Liuggio aka Giulio De Donato is a passionate open source developer, he works as CTO at Chupamobile .\r\nExpert in e-commerce platforms and Service Oriented Architecture, he is actively involved in the PHP community and Golang ecosystem.\r\nLatest projects that he has created is used by all the PHP repositories http://poser.pugx.org\r\n\r\nHe is known as evangelist of good design, cache and the data monitoring.\r\n\r\nSpeaker also in: SymfonyDay2012, PHPday 2013, SymfonyDay2013, SymfonyPortugal ...","Links":[{"Icon":"website","Url":"http://welcometothebundle.com","Text":"http://welcometothebundle.com"},{"Icon":"linkedin","Url":"http://it.linkedin.com/in/giuliodedonato/","Text":"http://it.linkedin.com/in/giuliodedonato/"},{"Icon":"twitter","Url":"","Text":"@liuggio"}],"Sessions":[{"Id":"1143","Title":"import Golang; struct microservices","TimeSlotId":"14:10/14:50","TrackId":"7","Abstract":"Se anni fa abbiamo pensato applicazioni complesse con in mente l’omonogeneità,oggi facilmente ci ritroveremo un accumulo disordinato di codice lento e difficile da mantenere.\r\n\r\nIl talk ci porta violentemente nel 2015, nel mondo dei microservizi, dove \r\nil vero protagonista è GOlang, che fa della sua filosofia il punto di forza.\r\n\r\nIn questo viaggio nelle buone pratiche e negli esempi di come implementare applicazioni modulari e pronte a crescere verranno installati nella testa concetti come Rest, Websocket, Json Web Token, Docker, httptest ...","Speaker":"Giulio De Donato","SpeakerId":"168","Day":"Saturday"}]},{"Id":"1172","Name":"Giuseppe Laddomada","Role":"Cofounder and CPO - Travelchat","Bio":"I am the founder of Travelchat, an app that lets you chat with locals in real-time. \r\nIn the last years, I have been working as product manager in several Berlin startups (including Rocket Internet, MONOQI & bonusbox). Beforehand, I studied innovation at Copenhagen Business School and Stockholm School of Economics and I have a double master degree from CEMS.","Links":[{"Icon":"website","Url":"www.travelchat.it","Text":"www.travelchat.it"},{"Icon":"linkedin","Url":"https://it.linkedin.com/pub/giuseppe-laddomada/1a/2b5/55b","Text":"https://it.linkedin.com/pub/giuseppe-laddomada/1a/2b5/55b"},{"Icon":"twitter","Url":"","Text":""}],"Sessions":[{"Id":"1073","Title":"How to create a product (Practical Guide)","TimeSlotId":"16:20/17:20","TrackId":"1","Abstract":"When developing a new product, two problems often arise:\r\n- Which features should be developed?\r\n- How to work with developers avoiding frustration?\r\n\r\nThe aim of the talk is to present a practical process to manage the development of new features. \r\nSpecifically, it illustrates the tricks that product managers use to navigate through the complexity of product development.\r\n\r\nThe process is described with practical examples and it is composed by 3 steps:\r\n1) Choosing the features \r\n2) Managing the development \r\n3) Measuring the results","Speaker":"Giuseppe Laddomada","SpeakerId":"1172","Day":"Saturday"}]},{"Id":"834","Name":"Karl-Henrik Nilsson","Role":"Senior developer / Software architect - Sogeti","Bio":"Karl-Henrik is an experienced developer that have written code for anything from cellular network base stations to websites. He runs the local Microsoft competence network at Sogeti and spend a somewhat obsessive amount of his free time building smarter devices.\r\n\r\n\"If you ever need to see a man about building a smarter toaster - I'm that guy\"\r\n\r\nPrevious speaking engagements at DevDay, IT-Arena, IT-Weekend and dozens of meetups,work and university talks.","Links":[{"Icon":"website","Url":"http://karl-henrik.se","Text":"http://karl-henrik.se"},{"Icon":"linkedin","Url":"http://se.linkedin.com/pub/karl-henrik-nilsson/12/560/778","Text":"http://se.linkedin.com/pub/karl-henrik-nilsson/12/560/778"},{"Icon":"twitter","Url":"","Text":"@khnilsson"}],"Sessions":[{"Id":"1017","Title":"Hacking your doorbell","TimeSlotId":"16:10/17:10","TrackId":"4","Abstract":"Interested in getting started reverse engineering hardware? In this talk we will take a look at how I took a regular doorbell and made it computer controlled, and how extremely simple it was! This talk asserts the possible technology choices for hardware hacking such as Arduino, Netduino,Raspberry PI and more, how basic reverse engineering of existing hardware is done (analysis, tools for analysis etc) and how to get started hacking hardware in a Microsoft/C# .NET (well mostly) environment TODAY!","Speaker":"Karl-Henrik Nilsson","SpeakerId":"834","Day":"Friday"}]},{"Id":"1011","Name":"Kevlin Henney","Role":"Director - Curbralan","Bio":"Kevlin is an independent consultant and trainer based in the UK. His development interests are in patterns, programming, practice and process. He has been a columnist for various magazines and web sites, including Better Software and The Register. Kevlin is co-author of A Pattern Language for Distributed Computing and On Patterns and Pattern Languages, two volumes in the Pattern-Oriented Software Architecture series. He is also editor of 97 Things Every Programmer Should Know.","Links":[{"Icon":"website","Url":"http://kevlin.tel","Text":"http://kevlin.tel"},{"Icon":"linkedin","Url":"https://www.linkedin.com/in/kevlin","Text":"https://www.linkedin.com/in/kevlin"},{"Icon":"twitter","Url":"","Text":"@KevlinHenney"}],"Sessions":[{"Id":"1140","Title":"Functional Programming You Already Know","TimeSlotId":"11:40/12:20","TrackId":"7","Abstract":"From JVM to .NET languages, from minor coding idioms to system-level architectures, functional programming is enjoying a long overdue surge in interest. Functional programming is certainly not a new idea and, although not apparently as mainstream as object-oriented and procedural programming, many of its concepts are also more familiar than many programmers believe.\r\n\r\nThis talk examines functional and declarative programming styles from the point of view of coding patterns, little languages and programming techniques already familiar to many programmers.","Speaker":"Kevlin Henney","SpeakerId":"1011","Day":"Saturday"}]},{"Id":"998","Name":"Krasimir Tsonev","Role":"Front-end developer - TrialReach","Bio":"Krasimir Tsonev is a front-end developer, blogger and speaker. He loves writing JavaScript and experimenting with the latest CSS and HTML features. Author of the \"Node.js blueprints\" book he is focused on delivering cutting edge applications. At the moment Krasimir is working for TrialReach - London based health startup.","Links":[{"Icon":"website","Url":"http://krasimirtsonev.com/","Text":"http://krasimirtsonev.com/"},{"Icon":"linkedin","Url":"https://www.linkedin.com/profile/view?id=20145983","Text":"https://www.linkedin.com/profile/view?id=20145983"},{"Icon":"twitter","Url":"","Text":"@KrasimirTsonev"}],"Sessions":[{"Id":"1117","Title":"AbsurdJS - Hacking the front-end","TimeSlotId":"12:30/13:10","TrackId":"5","Abstract":"It's a talk about AbsurdJS (http://absurdjs.com/). JavaScript library that acts as a CSS and HTML preprocessor. At the same time is a template engine and client-side framework. The presentation is made of two parts. The first one presents the library and the second one is a real life example of its usage.","Speaker":"Krasimir Tsonev","SpeakerId":"998","Day":"Saturday"}]},{"Id":"749","Name":"Kuba Waliński","Role":"Senior Software Engineer - ABB","Bio":"Kuba started coding VB6 in middle school. Then he learned Pascal, C, C++, Java, PHP, Prolog, C#, JavaScript & Python. Even though he spent most of his 7+ year career as an ASP.NET/C# developer, lately he's taken a deep dive in the (fascinating) world of JavaScript, discovering the joy of functional programming in the process, which resulted in experimenting with F# and Clojure. Having worked in a number of very different work environments (startup, small enterprise, big corporation), Kuba benefits from being able to approach programming challenges from different perspectives.","Links":[{"Icon":"website","Url":"http://blog.kubawalinski.com/","Text":"http://blog.kubawalinski.com/"},{"Icon":"twitter","Url":"","Text":"@kubawalinski"}],"Sessions":[{"Id":"1141","Title":"Fun with Functional JavaScript","TimeSlotId":"12:30/13:10","TrackId":"7","Abstract":"It might be a surprise for some of you, but JavaScript can be regarded as a functional programming language. Why don't we use more functional programming concepts in our JavaScript code, then? In this talk you will learn how to start including some of them in your applications and when they might be particularly beneficial. You will also get familiar with libraries that extend the functional capabilities of JavaScript (lodash and FunctionalJS) and the upcoming ES6 features that make JavaScript even more functional.","Speaker":"Kuba Waliński","SpeakerId":"749","Day":"Saturday"}]},{"Id":"967","Name":"Luca Lanziani","Role":"Software Engineer - nearForm","Bio":"Software engineer, developer, linux addict, hacker as http://bit.ly/hacker_def , passionate traveler, InnovAction Lab alumnus","Links":[{"Icon":"website","Url":"https://lanziani.com","Text":"https://lanziani.com"},{"Icon":"linkedin","Url":"uk.linkedin.com/in/lucalanziani","Text":"uk.linkedin.com/in/lucalanziani"},{"Icon":"twitter","Url":"","Text":"@_Nss_"}],"Sessions":[{"Id":"1059","Title":"Una lista di cose che potresti non sapere su Python","TimeSlotId":"14:00/14:40","TrackId":"8","Abstract":"Dopo più di due anni di Python ho stilato una lista di librerie e trucchi che mi aiutano nella mia attività di sviluppo quotidiano, lista che penso valga la pena di essere condivisa. Non siate timidi e venite a seguire il talk, potreste scoprire qualcosa di nuovo (o insegnare qualcosa di nuovo a me).","Speaker":"Luca Lanziani","SpeakerId":"967","Day":"Friday"}]},{"Id":"329","Name":"Lucia Zappacosta","Role":"Presidente - Metro Olografix","Bio":"Nata in Abruzzo nel 1980 è dottore di ricerca in “Culture, linguaggi e politica della comunicazione”. Dal 2008 collabora con gallerie d’arte e nel 2011 diventa direttore artistico dell'Alviani ArtSpace spazio di ricerca sulle nuove frontiere del contemporaneo. Consulente per la comunicazione per diversi studi e agenzie, organizza grandi eventi culturali e creativi. A partire dal 1998 si occupa di temi alle evoluzioni nel web e dal 2012 è Presidente dell’Associazione Culturale telematica Metro Olografix.","Links":[{"Icon":"website","Url":"http://www.luciazappacosta.it","Text":"http://www.luciazappacosta.it"},{"Icon":"linkedin","Url":"http://it.linkedin.com/in/luciazappacosta","Text":"http://it.linkedin.com/in/luciazappacosta"},{"Icon":"twitter","Url":"","Text":"https://twitter.com/luciazappacosta"}],"Sessions":[{"Id":"1107","Title":"The Wolf Method. Dall'Epic Fail al Problem Solving Creativo.","TimeSlotId":"14:10/14:50","TrackId":"4","Abstract":"Ogni problema può diventare un'opportunità se sai come trasformarlo a tuo vantaggio. \r\nPassando da McGyver al Signor Wolf l’intervento si propone di rispondere a una delle sfide più impegnative poste dalla programmazione così come dalla vita: la necessità di acquisire insieme ai linguaggi anche una nuova mentalità orientata alla risoluzione dei problemi. \r\nIl Problem Solving può aiutare a trovare soluzioni non convenzionali alle difficoltà quotidiane, purché si conoscano le strategie logiche che non sono frutto di un improvviso atto di creatività ma sono basate su decodificate metodologie.","Speaker":"Lucia Zappacosta","SpeakerId":"329","Day":"Saturday"}]},{"Id":"145","Name":"Luigi Bennardis","Role":"System Manager - Poste Italiane","Bio":"Laurea in Scienze Statistiche e Economiche e certificato MCSD. \r\nDal 2007 in Poste Italiane. Attualmente Information Sistem Manager, già Architetto IT (MS-J2EE) e Configuration Manager(Change Management-continuus integration-build automation). \r\nIn Banksiel per dieci anni come Operation Manager, incaricato nel rilascio di soluzioni applicative e di sicurezza per banche.\r\nNelle le precedenti esperienze in ISTAT e in Sistemi Informativi ha svolto il ruolo di sviluppatore OOP e di IT Solution Architect in tecnologie Java e Microsoft. Dal 2009 ha pubblicato una quindicina di articoli su Mokabyte.","Links":[{"Icon":"linkedin","Url":"http://it.linkedin.com/pub/luigi-bennardis/2/6a7/a5","Text":"http://it.linkedin.com/pub/luigi-bennardis/2/6a7/a5"},{"Icon":"twitter","Url":"","Text":""}],"Sessions":[{"Id":"1159","Title":"Java EE facile con Spring Boot","TimeSlotId":"17:30/18:10","TrackId":"8","Abstract":"Costruiamo con Spring Boot una applicazione Java EE con transazioni multiple JDBC-JMS utilizzando H2 e HornetQ (embedded in memory), il supporto di autoconfiguration JAX-RS (Jersey), le annotazioni JSR 250 per i lifecycle hooks, e le annotazioni JSR 330 utilizzabili per AS proprietari e per la portabilità in container di dependency injection come Spring. Per finire distribuiremo su Undertow embedded HTTTP server, su un AS standalone (Apache TomEE) e come PAAS su Cloud Foundry.","Speaker":"Luigi Bennardis","SpeakerId":"145","Day":"Saturday"}]},{"Id":"141","Name":"Luigi Dell Aquila","Role":"project manager - Orient Technologies LTD","Bio":"Computer engineer, Open Source enthusiast, technology addicted.\r\nProgramming languages, tools and frameworks are my toy box.\r\nICT consultant in the rest of the time.","Links":[{"Icon":"twitter","Url":"","Text":"@ldellaquila"}],"Sessions":[{"Id":"1157","Title":"Fully Reactive - from Data to UI with OrientDB + Node.js + Socket.io","TimeSlotId":"16:20/17:20","TrackId":"8","Abstract":"Having both a reactive application layer and front-end is just not enough anymore. Today's reality demands a fully reactive architecture where all the layers, including the database, are able to interact with each other using a paradigm. In this presentation, you'll learn how to build a fully reactive application in a few minutes with just a few lines of code resulting in every database change propagating asynchronously between the application layer and the front-end.","Speaker":"Luigi Dell Aquila","SpeakerId":"141","Day":"Saturday"}]},{"Id":"513","Name":"Mandy Waite","Role":"Developer Advocate - Google","Bio":"Mandy works at Google as a Developer Advocate for Google Cloud Platform and is working to make the world a better place for developers building applications for the Cloud. She came to Google from Sun Microsystems where she worked with partners on performance and optimisation of large scale applications and services before moving on to building an ecosystem of Open Source applications for OpenSolaris. In her spare time she is learning Japanese and plays the guitar.","Links":[{"Icon":"website","Url":"developers.google.com","Text":"developers.google.com"},{"Icon":"twitter","Url":"","Text":"@tekgrrl"}],"Sessions":[{"Id":"1048","Title":"From Docker To Kubernetes: A Developer's Guide To Containers","TimeSlotId":"14:00/14:40","TrackId":"7","Abstract":"Everyone is talking about Containers, but mostly in the context of how they work and not why and when they are useful or how to apply them to your own often complex and unique Use Cases. We'll start by looking at how Docker works by manually creating a simple guestbook application using Docker Containers running Redis and PHP. We'll then use the same application to show how you can use Kubernetes and Google Container Engine to create a cluster of nodes, declare to that cluster what you expect it to do, and then have the cluster assign resources as needed, run your work, recover from failures.","Speaker":"Mandy Waite","SpeakerId":"513","Day":"Friday"}]},{"Id":"376","Name":"Marco Casario","Role":"CTO - Comtaste","Bio":"Marco has been passionate about programming since he was little more than a child and used to program games in Basic for Commodore 64 before dedicating himself, while still very young, to innovative projects for the web using Javascript and Flash.\r\nIn 2005, Marco has founded Comtaste (www.comtaste.com), a company dedicated to exploring new frontiers in Rich Internet and Mobile Applications and the convergence between the web and the world of mobile devices.\r\n\r\nHe is author of the following book projects: HTML 5 Solutions, CSS3 Solutions, Flex 4 Cookbook, AIR Cookbook, and many more.","Links":[{"Icon":"website","Url":"www.comtaste.com","Text":"www.comtaste.com"},{"Icon":"linkedin","Url":"http://it.linkedin.com/in/marcocasario","Text":"http://it.linkedin.com/in/marcocasario"},{"Icon":"twitter","Url":"","Text":"@marcocasario"}],"Sessions":[{"Id":"1037","Title":"Every millisecond counts: Techniques, strategies, and tools for a Web Performance Jedi Wannabe","TimeSlotId":"14:00/14:40","TrackId":"6","Abstract":"Developers, Designers, and Project Managers love to promise high performance for their web apps.\r\nBut they know they're lying. In fact most of the websites fail from a performance point of view.\r\nIn this talk I focus on every aspect and strategy that you have to consider to to fulfill the promise: performance metrics, measurements and monitoring strategy, optimization best practices, the paradox of third-party content, image rendering, browser performance tools.\r\n\r\nWith one goal in mind: finding small changes that led to some of the biggest performance gains.","Speaker":"Marco Casario","SpeakerId":"376","Day":"Friday"}]},{"Id":"506","Name":"Marco Cecconi","Role":"Software Developer - Stack Exchange","Bio":"Marco Cecconi è uno sviluppatore per Stack Overflow e presenta talk su architettura e sviluppo. \r\nItaliano di origine, è nomade da qualche anno. Ha studiato a Singapore, lavorato in Francia, Portogallo, ed ora in UK dove vive con moglie e figlio da qualche anno.\r\n\r\nCome speaker ha parlato di Stack Overflow e programmazione a dozzine di conferenze internazionali, incluse keynote a Community Days Milano e QCon Pechino, talk a QCon Tokyo, Øredev Malmö, {codemotion} e molte ancora.\r\n\r\nÈ noto come Sklivvz su twitter e Stack Exchange dove ha contribuito dall'inizio e è stato moderatore dal 2011.","Links":[{"Icon":"website","Url":"http://sklivvz.com","Text":"http://sklivvz.com"},{"Icon":"twitter","Url":"","Text":"sklivvz"}],"Sessions":[{"Id":"1080","Title":"Stack Overflow - obiettivo performance","TimeSlotId":"11:40/12:20","TrackId":"2","Abstract":"Stack Exchange è uno dei 50 maggiori network al mondo ed è sviluppato con l'obiettivo di essere il sito più veloce in assoluto. \r\nNel talk racconto:\r\n* L'architettura fisica di Stack Overflow. Quanti server abbiamo? A cosa servono e cosa sono le loro spec?\r\n* L'architettura logica del software. Come scaliamo? Quali sono i pezzi principali dell'applicazione?\r\n* Il sistema di tool. Cosa usiamo per sostenere la nostra filosofia di "extreme optimization"?\r\n* Il team di sviluppo. Quali sono i nostri valori fondamentali? Che impronta volgiamo lasciare come sviluppatori?","Speaker":"Marco Cecconi","SpeakerId":"506","Day":"Saturday"}]},{"Id":"991","Name":"Marco Trevisan","Role":"Software Engineer - Canonical Ltd","Bio":"A technology enthusiast since his first steps, Marco got soon caught by the Free Software world as an unique way to learn the art of programming from the deep and for a good cause.\r\nSo, he invested all his energies and curiosity to improve the open source world, scratching his own itches and contributing to various projects, which finally lead him to Ubuntu.\r\n\r\nDuring the years Marco has been involved in various FLOSS projects such as Compiz, Openmoko, SHR, Enlightenment, GNOME (vala, gtk, libwnck…), to which he can now continue to contribute by working at Canonical as Software Engineer for Unity","Links":[{"Icon":"website","Url":"http://www.3v1n0.net","Text":"http://www.3v1n0.net"},{"Icon":"linkedin","Url":"https://www.linkedin.com/profile/view?id=119380100","Text":"https://www.linkedin.com/profile/view?id=119380100"},{"Icon":"twitter","Url":"","Text":"@3v1n0"}],"Sessions":[{"Id":"997","Title":"Ubuntu phone, smart from the source (code)","TimeSlotId":"10:00/11:00","TrackId":"3","Abstract":"Un'introduzione al mondo di Ubuntu Touch, il nuovo sistema operativo mobile che fa della convergenza la sua bandiera, creato da Canonical e dalla comunità di Ubuntu, proponendo un nuovo modello realmente aperto e basato su nuove tecnologie che cercano di rivedere i paradigmi del passato.\r\n\r\nSi parlerà di sviluppo di applicazioni, dei suoi framework, della sicurezza.","Speaker":"Marco Trevisan","SpeakerId":"991","Day":"Friday"}]},{"Id":"485","Name":"Mario Fusco","Role":"Software Engineer - Red Hat","Bio":"Mario is a senior software engineer at Red Hat working at the development of the core of Drools, the JBoss rule engine. He has a huge experience as Java developer having been involved in (and often leading) many enterprise level projects in several industries ranging from media companies to the financial sector. Among his interests there are also functional programming and Domain Specific Languages. He is also the co-author of \"Java 8 in Action\" published by Manning.","Links":[{"Icon":"twitter","Url":"","Text":"@mariofusco"}],"Sessions":[]},{"Id":"1020","Name":"Mathias Buus","Role":"hacker - dat","Bio":"Mathias is a Node.js hacker from Copenhagen, Denmark.\r\nHe is a core contributor to the open data project, dat and tends to write a bunch of npm modules whenever he has time.\r\nRecently he's been working a lot with new ways of replicating of single purpose databases using leveldb and other mad science projects.","Links":[{"Icon":"twitter","Url":"","Text":"@mafintosh"}],"Sessions":[{"Id":"987","Title":"Good artists copy; Great artists replicate","TimeSlotId":"10:00/11:00","TrackId":"2","Abstract":"Let's talk about replication.\r\n\r\nDatabase replication is probably one of the most misunderstood things in computer science.\r\nSome argue that mongodb's way is the best. Some argue postgres. Some prefer emailing zips of database dumps around the office.\r\n\r\nIn general, replication is a *really hard* problem. However, it is actually pretty simple if you are willing to accept some trade-offs.\r\n\r\nThis talk will be a hands on approach about investigating how we can make replication simpler by building specialized databases. There will be lots of demos.","Speaker":"Mathias Buus","SpeakerId":"1020","Day":"Friday"}]},{"Id":"524","Name":"Mathilde Lemée","Role":"CTO - Aetys","Bio":"After Mathilde Lemee joining Software AG (Terracotta) in 2012 as a R&D engineer working on ehcache and bigmemory, Mathilde now work as a freelancer. She co-founded the Duchess France Chapter, an organization to connect and give visibility to women in Java technology, in 2010, where she organised a lot of events (Hadoop, Mahout, Mockito, Cache …). She blogs on http://www.java-freelance.fr about performance, best practices and testing. She is a regular open source commuter and creator ofFluentLenium, a wrapper around Selenium that provide a Fluent API which is used in others open source project,","Links":[{"Icon":"website","Url":"http://www.java-freelance.fr","Text":"http://www.java-freelance.fr"},{"Icon":"linkedin","Url":"https://www.linkedin.com/in/mathildelemee/en","Text":"https://www.linkedin.com/in/mathildelemee/en"},{"Icon":"twitter","Url":"","Text":"@MathildeLemee"}],"Sessions":[{"Id":"1077","Title":"Let's talk about the cache !","TimeSlotId":"09:00/10:00","TrackId":"2","Abstract":"We all know that caching is a solution for developers to increase the performance of an application. We will start by presenting the JSR-107 terminology and the most important cache patterns. Some use cases will also be discussed and you will see how you can scale your cache from a single node to a multi node cluster. If you are a beginners in caching or if the words Cache Aside, Write-Behind, Read/Write Through doesn’t means anything to you or if you are interesting about high availabilty and scalable architecture, that this is the place to be !","Speaker":"Mathilde Lemée","SpeakerId":"524","Day":"Saturday"}]},{"Id":"1050","Name":"Matteo Antony Mistretta","Role":"Mobile Projects Tech Lead - Seat PagineGialle S.p.A.","Bio":"Software engineer, failed musician and digital craftsman, but most of all vehicle for the propagation of memes, Antony loves his job and loves bragging about it. He thinks that a master's degree in computer engineering is sufficient to save the world.","Links":[{"Icon":"linkedin","Url":"https://www.linkedin.com/in/antonymistretta","Text":"https://www.linkedin.com/in/antonymistretta"},{"Icon":"twitter","Url":"","Text":""}],"Sessions":[{"Id":"1083","Title":"The Fast and The Mobile","TimeSlotId":"14:10/14:50","TrackId":"2","Abstract":"Frameworks such as AngularJS and Polymer are great tools for building complex systems with less coding. But what if your client wants ultra-high performance? This talk shows you how to deal with some lower-level decisions in order to achieve a solid architecture and a highly performant JavaScript on mobile web applications using some old friends like Backbone, RequireJS, Mustache and a lot of trial-and-error. The examples shown are based on PagineGialle's mobile webapp, whose performance impressed Google Italy.","Speaker":"Matteo Antony Mistretta","SpeakerId":"1050","Day":"Saturday"}]},{"Id":"167","Name":"Matteo Collina","Role":"Architect - nearForm","Bio":"Matteo is a code pirate and mad scientist. He spends most of his days programming in node.js, but in the past he worked with Ruby, Java and Objective-C. He recently defended his a Ph.D. thesis titled \"Application Platforms for the Internet of Things\". Now he is a Software Architect at nearForm, working on the nscale deployer. Matteo is also the author of the Node.js MQTT Broker, Mosca and of the LevelGraph database. Matteo spoke at several international conferences: Nodeconf.eu, LXJS, Distill by Engine Yard, and JsDay to name a few. In the summer he loves sailing the Sirocco.","Links":[{"Icon":"website","Url":"www.matteocollina.com","Text":"www.matteocollina.com"},{"Icon":"linkedin","Url":"http://it.linkedin.com/in/matteocollina","Text":"http://it.linkedin.com/in/matteocollina"},{"Icon":"twitter","Url":"","Text":"@matteocollina"}],"Sessions":[{"Id":"979","Title":"NO. La sottile arte di trovare il tempo dove non esiste.","TimeSlotId":"11:30/12:10","TrackId":"1","Abstract":"Non abbiamo mai tempo per fare nulla. Quante volte avete detto: "Vorrei rilasciare un progetto Open Source" oppure "Vorrei studiare Obj-C e imparare a fare App!". E poi andate su GitHub e trovate persone che hanno rilasciato o contributo a CENTINAIA di progetti, conoscono 6-7 linguaggi di programmazione diversi e parlano a conferenze in giro per l'Italia e l'Europa. Come fanno a gestire il tempo? Sono più bravi di noi? NO è la risposta.","Speaker":"Matteo Collina","SpeakerId":"167","Day":"Friday"}]},{"Id":"908","Name":"Matteo guidotto","Role":"PM & Frontend Developer - Intesys","Bio":"Nato nell'umida laguna veneta, svezzato come developer nella campagna trevigiana grazie ad E-TREE, da tre anni a questa parte vivo e lavoro a Verona occupandomi più che di tecnologia, di persone. Project Management, User Experience ma anche formazione dei dipendenti e organizzazione di corsi.\r\n\r\nSono cofondatore di FEVR - Fronteders Verona, uno usergroup che si pone come riferimento a 180 gradi su tutti i temi riguardanti interfaccia: frontenddev, ux, pm, ia, design; dal 2014 faccio parte dell'organizzazione di TEDXVerona.","Links":[{"Icon":"website","Url":"http://www.matteoguidotto.com","Text":"http://www.matteoguidotto.com"},{"Icon":"linkedin","Url":"https://www.linkedin.com/in/matteoguidotto","Text":"https://www.linkedin.com/in/matteoguidotto"},{"Icon":"twitter","Url":"","Text":"@j8matteo"}],"Sessions":[{"Id":"1119","Title":"lean frontend development","TimeSlotId":"14:10/14:50","TrackId":"5","Abstract":"Il processo di maturazione dello sviluppo frontend passa per l'adozione di metodologie agili e \r\nlean, vedremo una sequenza di tecniche e di metodologie per alleggerirlo, costruendo il nostro mvp \r\nin maniera modulare e realizzando progetti più scalabili","Speaker":"Matteo guidotto","SpeakerId":"908","Day":"Saturday"}]},{"Id":"1146","Name":"Matteo Pagani","Role":"Support Engineer - Microsoft","Bio":"I’m a developer with a strong passion about mobile development and, especially, the Windows and Windows Phone platforms. A passion that I love to share with the communities as a blogger, book writer and speaker in many national and international conferences. I'm one of the founders of the community DotNetLombardia, I’ve been a Nokia Developer Champion and a Microsoft MVP for almost 5 years, until in November 2014 I joined Microsoft as a Support Engineer for the App Consult program to support Windows Store developers.","Links":[{"Icon":"website","Url":"http://wp.qmatteoq.com","Text":"http://wp.qmatteoq.com"},{"Icon":"twitter","Url":"","Text":"@qmatteoq."}],"Sessions":[{"Id":"999","Title":"Xamarin Forms: one technology to rule them all","TimeSlotId":"11:30/12:10","TrackId":"3","Abstract":"Xamarin Forms è la nuova tecnologia introdotta da Xamarin per supportare lo sviluppo multi piattaforma di applicazioni per iOS, Android e Windows Phone utilizzando un unico linguaggio di design (lo XAML) e di sviluppo (C#). Nel corso di questa sessione vedremo le basi di questa piattaforma, gli scenari in cui è adatta e quelli in cui lo è di meno e una serie di preziosi consigli, nati dall'esperienza maturata nello sviluppo di un'importante progetto.","Speaker":"Matteo Pagani","SpeakerId":"1146","Day":"Friday"}]},{"Id":"875","Name":"Matteo Scandolo Giovanni Lela","Role":"SEO - LinkMe","Bio":"LinkMe nasce nel 2009 e si rinnova nel 2013, seguendo le idee imprenditoriali di Juri Di Natale, uno dei soci fondatori. \r\nSiamo una società giovane, dinamica e agile.\r\nQuello tecnologico è un settore in rapida evoluzione. Per mantenere un vantaggio competitivo, le società sono obbligate ad adattarsi in modo flessibile. Il metodo di lavoro di LinkMe è agile e privo di sovrastrutture, per semplificare il client management e alleggerire i costi. Abbiamo creato una infrastruttura cloud che ci consente di lavorare senza confini e in completa libertà.","Links":[{"Icon":"website","Url":"http://linkme.it/","Text":"http://linkme.it/"},{"Icon":"twitter","Url":"","Text":"@LinkMeSRL"}],"Sessions":[{"Id":"1149","Title":"RealTime Ninja - Hands on MEAN","TimeSlotId":"09:00/10:00","TrackId":"8","Abstract":"Il talk sarà diviso in due parti.Nella prima analizzeremo brevemente le peculiarità di Node.js (e simili), le ragioni del suo successo e i domini applicativi di questo tipo di tecnologia. Vedremo anche cosa può aspettarsi uno sviluppatore frontend deciso a fare il grande passo e a cominciare a usare Javascript anche sul server. Nella seconda svilupperemo passo passo un servizio di API/REST in NodeJs, persistendo i dati su un database non relazionale (MongoDB). Sarà spiegato come impostare l’applicazione, definire rotte, middleware e modelli e infine come implementare notifiche realtime.","Speaker":"Matteo Scandolo Giovanni Lela","SpeakerId":"875","Day":"Saturday"}]},{"Id":"359","Name":"Matteo Valoriani","Role":"CEO - FifthIngeniunm","Bio":"Matteo Valoriani obtained the Master of Science cum Laude in Computer Engineering at Politecnico di Milano in 2011. He worked for two years at Microsoft Italy, but in 2012 he decided to follow his passion for technology and innovation and started a PhD in Computer Science. His research activity focuses on new unconventional technologies and paradigms for ambient interaction, as well as voice commands, touch and touchless gestures, proxemic Interactions. Matteo is Microsoft MVP for Kinect and Intel Software Innovator for RealSense. In 2014, he founded FifthIngeniun, focused on IT innovation.","Links":[{"Icon":"website","Url":"http://www.fifthingenium.com/","Text":"http://www.fifthingenium.com/"},{"Icon":"linkedin","Url":"https://www.linkedin.com/profile/view?id=60857524&trk=spm_pic","Text":"https://www.linkedin.com/profile/view?id=60857524&trk=spm_pic"},{"Icon":"twitter","Url":"","Text":"@MatteoValoriani"}],"Sessions":[{"Id":"1071","Title":"Tecnologie e Startup: ICT è solo una commodity?","TimeSlotId":"15:00/16:00","TrackId":"1","Abstract":"Questa sessione vuole affrontare il tema della tecnologia e come questa possa essere una leva fondamentale per le nuove Startup. Nella prima parte saranno discussi i maggiori trend di mercato: le tecnologie più in voga e ricercate, quelle già mature e consolidate e quelle che sono in fase calante ma che avranno un alto impatto in futuro. Nella seconda parte mostrerò alcuni tool e tecniche che possono migliorare la gestione del lavoro di una start-up introducendo meccanismi di sviluppo agili.","Speaker":"Matteo Valoriani","SpeakerId":"359","Day":"Saturday"}]},{"Id":"93","Name":"Michele Finelli","Role":"Socio - BioDec","Bio":"laureato in informatica nel 1995, studia per un ph.d., ma non lo termina: dal 1997 libero professionista e dal 2003 socio BioDec, la prima azienda bioinformatica italiana\r\n\r\nsiamo sicuri che nel 2014 serva descrivere la propria biografia ?","Links":[{"Icon":"website","Url":"http://www.biodec.com","Text":"http://www.biodec.com"},{"Icon":"linkedin","Url":"http://www.linkedin.com/in/mfinelli","Text":"http://www.linkedin.com/in/mfinelli"},{"Icon":"twitter","Url":"","Text":"@gaunilone"}],"Sessions":[{"Id":"995","Title":"Monitoraggio, logging e alerting moderni","TimeSlotId":"17:20/18:00","TrackId":"2","Abstract":"Gestire un'infrastruttura sembra un'attività arida e ripetitiva, ma non\r\ne così: negli ultimi anni sono stati sviluppati sempre piu software\r\nfree alternativi alle soluzioni consolidate.\r\n\r\nGrazie ai sistemi cloud e alla virtualizzazione, nei prossimi anni\r\nsarà necessario dotarsi di strumenti efficaci per gestire la\r\ncomplessità di un'infrastruttura distribuita, e gli strumenti che\r\nabbiamo adesso a disposizione possono rendere questa attività\r\ngratificante ... anche da un punto di vista estetico !","Speaker":"Michele Finelli","SpeakerId":"93","Day":"Friday"}]},{"Id":"413","Name":"Nino Guarnacci","Role":"BDM - Oracle","Bio":"Passion for innovation and Information Technology coupled with extensive experience has given me a straightaway approach to Enterprise Architecture: from Mobile, Integration System and Applications Architectures to full project life cycle definitions.Experience in meeting challenging deadlines and targets as a project manager improved my professional and competencies, problem solving and decision making skills, particularly in highly complex distributed scenarios. Work-Travelling all around the world thanks to my past experience in BEA and now in Oracle help me to catch new idea and trend.","Links":[{"Icon":"website","Url":"http://www.ninoguarnacci.net","Text":"http://www.ninoguarnacci.net"},{"Icon":"linkedin","Url":"http://it.linkedin.com/in/spiderweb","Text":"http://it.linkedin.com/in/spiderweb"},{"Icon":"twitter","Url":"","Text":"@ninoguarnacci"}],"Sessions":[{"Id":"1015","Title":"Sviluppo IoT - Un approccio standard da Nerd ad Impresa, prove pratiche di Mesh","TimeSlotId":"14:00/14:40","TrackId":"4","Abstract":"Gli anni passati a veder nascere e crescere tecnologie e tendenze ci aiutano a comprendere come l'Internet delle Cose sia diventata matura per il mercato delle imprese. L’intervento, che include una panoramica sulle tendenze attuali e future dell’IoT, è centrato sullo sviluppo di soluzioni basate su standard industriali in ascesa (eg. Z-Wave), mettendo in evidenza gli inevitabili vantaggi e limiti derivanti dall’adozione di una metodologia industriale: solo un approccio industriale può rappresentare il vero e proprio salto di qualità per proporre prodotti efficaci per un mercato a doppia cifra","Speaker":"Nino Guarnacci","SpeakerId":"413","Day":"Friday"}]},{"Id":"1062","Name":"Orlando K","Role":"API Overlord - Mashape","Bio":"I am a keen software developer who likes APIs a whole lot - I often go to hackathons during weekends to release my inner passion for new ideas and quick code writing/prototyping. Occasionally watch sport on TV, but only if it's a major event.","Links":[{"Icon":"twitter","Url":"","Text":"@orliesaurus"}],"Sessions":[{"Id":"982","Title":"Building Successful APIs Overnight","TimeSlotId":"14:00/14:40","TrackId":"1","Abstract":"Hackathons have boomed, people attending such events have been consuming thousands of APIs to power their creative projects. However, not everyone can consume APIs like a boss. Companies spend hundreds of thousands of dollars in promoting and ensuring best practices are followed when building APIs.\r\nIn this talk I will give you an overview of how to build a potentially successful API overnight, like hackathoneers do. A recipe for success as a takeaway from this talk will be shared.\r\nTopics covered: Evolution of APIs, Hackathons, REST API Frameworks, API Design, API Editors, API Management","Speaker":"Orlando K","SpeakerId":"1062","Day":"Friday"}]},{"Id":"977","Name":"Pete Smith","Role":"Director - One and Three Consulting Ltd","Bio":"\u0001Pete is a software consultant based in London with almost 10 years of experience making web applications with Asp.Net, specialising in API design and Javascript browser-based applications. He is the author of Superscribe - a graph based routing framework, and the OData library Linq to Querystring.","Links":[{"Icon":"website","Url":"http://roysvork.wordpress.com","Text":"http://roysvork.wordpress.com"},{"Icon":"twitter","Url":"","Text":"@roysvork"}],"Sessions":[{"Id":"1093","Title":"Beyond responsive design - UI for the modern web application","TimeSlotId":"12:30/13:10","TrackId":"3","Abstract":"Applications written for the modern web are being consumed not just on desktops, but also on a myriad of other devices... even watches and glasses. If you design your application with a pc screen in mind, you're either cutting your userbase in half or setting yourself up for an expensive redesign. In this talk I'll introduce you to some modern web design constructs, and the technologies that bring them to life. Learn how to create apps for phone, mobile and desktop with no extra effort, and without restrictive layout frameworks. Web has finally caught up with native apps... the future is now!","Speaker":"Pete Smith","SpeakerId":"977","Day":"Saturday"}]},{"Id":"1101","Name":"Philipp Krenn","Role":"DevOps - ecosio GmbH","Bio":"Philipp Krenn is running everything database related and the general infrastructure of the Vienna based B2B startup ecosio. When not fighting MongoDB, MySQL, Jenkins, or AWS, he is giving NoSQL and cloud computing trainings or organizes his meetups ViennaDB and Papers We Love Vienna.","Links":[{"Icon":"website","Url":"https://xeraa.net","Text":"https://xeraa.net"},{"Icon":"linkedin","Url":"http://at.linkedin.com/in/philippkrenn/","Text":"http://at.linkedin.com/in/philippkrenn/"},{"Icon":"twitter","Url":"","Text":"@xeraa"}],"Sessions":[{"Id":"1155","Title":"nginx for fun and performance","TimeSlotId":"14:10/14:50","TrackId":"8","Abstract":"Is it fast yet? Performance is getting ever more important and using nginx is one of the easiest hacks to make your system faster.\r\nThis talk takes a look at why and how nginx is so fast — it's all about being event-driven. Additionally, we discuss where you can make use of nginx's power, specifically for terminating SSL connections, providing a load balancer or proxy, and to run static websites as well as dynamic web-applications with PHP.","Speaker":"Philipp Krenn","SpeakerId":"1101","Day":"Saturday"}]},{"Id":"1183","Name":"Pietro Scarpino","Role":"Competence Center Manager - NTT Data","Bio":"Pietro holds a Degree in Information Technology at University of Calabria. \r\nHis current position is Mobility & Innovation Competence Center Manager at NTT DATA ATSC, located in Cosenza. The competence center born with the mission to detect Innovation in the new IT paradigms, Improve mobility projects delivery capability, support NTT DATA mobility strategy and contribute to NTT DATA global R&D strategy by collaborating with NTT DATA Corporation in Japan on Innovative topics like Mobile Security, Wearable and IoT. \r\nHis main areas of activities are: Mobility, IoT, Innovation, Cyber Security.","Links":[{"Icon":"linkedin","Url":"https://www.linkedin.com/in/pietroscarpino","Text":"https://www.linkedin.com/in/pietroscarpino"},{"Icon":"twitter","Url":"","Text":"@piscarpi"}],"Sessions":[{"Id":"1027","Title":"Rendere sicure le esperienze dell'individuo nel mondo digitale allargato","TimeSlotId":"14:50/15:50","TrackId":"5","Abstract":"La User Experience si evolve guidata delle opportunità tecnologiche (Mobility, Active Spaces, Internet delle Cose, Wearable, ...). I nuovi servizi coinvolgono un sempre maggior numero di utenti e di Smart Objects. I volumi e la complessità degli scenari determinano una serie di nuove vulnerabilità che attirano l'interesse di un Cyber-crimine sempre più determinato e sofisticato. Riconoscere il rischo e sviluppare di conseguenza soluzioni "sicure" è il primo, fondamentale elemento per contribuire a mitigare il quadro complessivo della minaccia tecnologica.","Speaker":"Pietro Scarpino","SpeakerId":"1183","Day":"Friday"}]},{"Id":"1164","Name":"Richard Rodger","Role":"CTO - nearForm","Bio":"Richard Rodger is the CTO of nearForm.com, a Node.js consultancy that builds large-scale systems. Richard is the author of Mobile Application Development in the Cloud (Wiley 2012), and was formerly CTO of feedhenry.com, a mobile applications platform. He is a regular contributor to the Sunday Business Post newspaper in Ireland, and holds degrees in Mathematics and Philosophy, and Computer Science.","Links":[{"Icon":"website","Url":"http://richardrodger.com","Text":"http://richardrodger.com"},{"Icon":"linkedin","Url":"https://www.linkedin.com/in/richardrodger","Text":"https://www.linkedin.com/in/richardrodger"},{"Icon":"twitter","Url":"","Text":"@rjrodger"}],"Sessions":[{"Id":"989","Title":"Measuring Micro-services","TimeSlotId":"11:30/12:10","TrackId":"2","Abstract":"Micro-service systems deliver wonderful adaptability to business needs, easy scalability, and low-risk deployment. What's not to like?\r\nYou also end up with a system that's hard to understand, measure and predict. Traditional approaches to monitoring simply aren't powerful enough to handle the emergent properties of a system with lots of moving parts.\r\nThe solution is to apply the scientific method! Anything can be measured. Uncertainty can be reduced, and stability can be an emergent property. We just have to learn the lessons that the natural world can teach us.","Speaker":"Richard Rodger","SpeakerId":"1164","Day":"Friday"}]},{"Id":"1169","Name":"Roberto Collina","Role":"Marketing Manager - Aibotix Italia","Bio":"Behind Aibotix Italia is an international, dynamic team with one great thing in common: the passion for artificial intelligence and robotics. Hence the company’s name AIBOTIX consists of AI for Artificial Intelligence and BOTIX for Robotics. With creativity, expertise and passion we explore every day the boundaries of robotics and artificial intelligence anew. Our goal: the development of intelligent, computer-controlled devices that make our work and lives easier and safer. Our core product is the flying robot Aibot X6.","Links":[{"Icon":"website","Url":"http://www.aibotixitalia.it","Text":"http://www.aibotixitalia.it"},{"Icon":"linkedin","Url":"Public Profile Update your public profile settingsit.linkedin.com/pub/roberto-collina/67/561/a24/en","Text":"Public Profile Update your public profile settingsit.linkedin.com/pub/roberto-collina/67/561/a24/en"},{"Icon":"twitter","Url":"","Text":""}],"Sessions":[{"Id":"980","Title":"In Flight Data Fusion. Drones How To and Why","TimeSlotId":"12:20/13:00","TrackId":"1","Abstract":"No one doubts that a drone flights. We will show what there is behind the data fusion of all the data from the single sensors and how/why the drones use them for flight functionality.\r\nToday drones are "isolated systems" with and high need of ideas and software developments to be part of a more integrated world.","Speaker":"Roberto Collina","SpeakerId":"1169","Day":"Friday"}]},{"Id":"52","Name":"Roberto Franchini","Role":"Senior Sw Engineer - CELI s.r.l.","Bio":"Comincia con il C64 e non si ferma più. \r\nDa 7 anni lavora per CELI (http://celi.it) dove si occupa di NLP, big data, scalabilità. \r\nPer BlogMeter (http://www.blogmeter.it/) ha curato lo sviluppo dei back-end di analisi linguistica, concentrandosi sugli aspetti di scalabilità del sw e della intera infrastruttura hw, garantendo al sistema la possibilità di analizzare più di 3 milioni di documenti al giorno. \r\nFa parte del gruppo di coordinamento del JUG Torino.","Links":[{"Icon":"linkedin","Url":"http://www.linkedin.com/in/robfrank","Text":"http://www.linkedin.com/in/robfrank"},{"Icon":"twitter","Url":"","Text":"@robfrankie"}],"Sessions":[{"Id":"1046","Title":"GlusterFS : un file system open source per i big data di oggi e domani","TimeSlotId":"12:20/13:00","TrackId":"7","Abstract":"GlusterFS (www.gluster.org) è un file system distribuito open source, scalabile fino ai petabytes.\r\nLa presentazione ha lo scopo di mostrare le feature di questo FS e la nostra esperineza, che parte nel 2010 con un cluster da 4TB all'odierno da 30TB: perchè è stato scelto, principali features, evoluzione, fallimenti (anche quelli), futuro. \r\nAlcune feature: accesso in user-space, protocolo nativo, NFS, SMB . Replicazione, distribuzione, striping dei file o una loro combinazione (e.g: distributed striped replicated). All'interno dell'ecosistema Hadoop può sostituire HDFS.","Speaker":"Roberto Franchini","SpeakerId":"52","Day":"Friday"}]},{"Id":"1073","Name":"Robin Johnson","Role":"Developer Evangelist - SendGrid","Bio":"A Polyglot Programmer and Developer Evangelist at SendGrid, currently working amongst the world-wide developer community to ease the adoption of Email API technology. Having spoken at some of the world's leading technical conferences, Robin is building his way to being a player in the London tech scene; attending, speaking at, and even helping organise multiple large events. Mentoring on topics such as Distributed Systems, Golang, NoSQL Databases and Open Source values; Robin is as much hacker as he is hustler.","Links":[{"Icon":"twitter","Url":"","Text":"rbin"}],"Sessions":[{"Id":"1039","Title":"The Value of Open Source","TimeSlotId":"16:10/17:10","TrackId":"6","Abstract":"Open Source is undoubtably valuable and has a strong intrinsic worth. But where does this value exist? Does the value lie in the software produced, or somewhere else? How could Open Sourcing your software benefit your company? In this talk we’ll explore the main benefits of Open Source, how it can benefit you and how it can lead to better software.","Speaker":"Robin Johnson","SpeakerId":"1073","Day":"Friday"}]},{"Id":"1064","Name":"Roland Guijt","Role":"Senior Developer - R.M.G. Holding B.V.","Bio":"Roland is a passionate developer, international speaker, Pluralsight author and trainer (MCT) for many years now. Disciplines are all of .Net, javascript + libraries and mobile app development.","Links":[{"Icon":"website","Url":"www.rmgsolutions.nl","Text":"www.rmgsolutions.nl"},{"Icon":"twitter","Url":"","Text":"@rolandguijt"}],"Sessions":[{"Id":"1024","Title":"Securing your apps with OAuth2 and OpenID Connect","TimeSlotId":"12:20/13:00","TrackId":"5","Abstract":"In the past you could come by with designing a login screen with a username and login textbox in your app and directly check the credentials in a database. But we're living in the age of (Web) APIs. With modern apps, like SPAs, just authenticating with the website isn't enough, you also want to connect on behalf of the logged in user in a Web API that is providing data for example.\r\nOpenId Connect and OAuth2 for authorisation together are the complete solution to this problem.\r\nIn this session after a furter explanation we'll look at a collection of .Net apps that demonstrate this process.","Speaker":"Roland Guijt","SpeakerId":"1064","Day":"Friday"}]},{"Id":"1054","Name":"Sara Vieira","Role":"Front-End Developer - Freelancer","Bio":"Sara is a freelance Front-End Developer from Portugal. She’s one of those few people in the world who love what they do and believe that the internet is something we are building and making better on a daily basis may that be through education websites or simply by creating useful one page applications. She is also a blogger on the weekend and has her work featured on Developer Drive and Webdesigner Depot. When she isn’t on the internet she’s a total TV Show addict and video game lover.","Links":[{"Icon":"website","Url":"http://iamsaravieira.com","Text":"http://iamsaravieira.com"},{"Icon":"linkedin","Url":"http://pt.linkedin.com/pub/sara-vieira/45/a4b/290/","Text":"http://pt.linkedin.com/pub/sara-vieira/45/a4b/290/"},{"Icon":"twitter","Url":"","Text":"@NikkitaFTW"}],"Sessions":[{"Id":"1116","Title":"CSS3 Layouts: Flexbox vs CSS Grid","TimeSlotId":"11:40/12:20","TrackId":"5","Abstract":"The way we create layouts is messy we have to admit it, those floats and inline-block's don't make anyone's life any easier and they aren't exactly tools for creating massive layouts, just properties we adapted for our layout needs because, well, they worked and we got used to them.\r\nWith CSS3 we got Flexbox and the CSS grid , two things created especially for the creation of layouts , in here I will talk about each one, the pros , the cons and why you should be looking forward to using these in production. All of this so you can go home with even more hope for the future of CSS.","Speaker":"Sara Vieira","SpeakerId":"1054","Day":"Saturday"}]},{"Id":"299","Name":"Simone Bordet","Role":"Lead Architct - Webtide","Bio":"Simone Bordet is a Jetty Committer, the CometD project leader and works as Lead Architect at Webtide, now part of Intalio. Active open source developer, he founded and contributed to various open source projects such as Jetty, CometD, MX4J, Foxtrot, LiveTribe, and others. Simone has been technical speaker at various national and international conferences such as Devoxx, JavaOne, CodeMotion, etc., and is a co-lead of the Java User Group of Torino, Italy. Simone specializes in server-side multi-thread development, J2EE application development, in Comet technologies applied to web development, web network protocols and in high performance JVM tuning.","Links":[{"Icon":"twitter","Url":"","Text":"@simonebordet"}],"Sessions":[{"Id":"1137","Title":"OOP and FP: become a better programmer","TimeSlotId":"09:00/10:00","TrackId":"7","Abstract":"Hear the story of Simon, an experienced OOP Java developer, exposed to the new lambda features of JDK 8.\r\nHis friend Mario, a long-bearded FP geek, will try to convince him that FP can help him develop more readable and maintainable code.\r\nA journey into the discovery of the main new feature - lambda expressions - of JDK 8.","Speaker":"Simone Bordet","SpeakerId":"299","Day":"Saturday"}]},{"Id":"156","Name":"Simone Onofri","Role":"Project Manager / Senior IT Security Consultant - Techub S.p.A.","Bio":"I am a Project Manager / Senior IT Security Consultant with 10 years of experience in IT field. I like to be Agile: DSDM® Consortium Community Member, Agile Project Management™ Practitioner and Certified ScrumMaster® (with Craig Larman). I carried out several projects in Ethical Hacking, Security Operation Center and Secure Software Development Life-Cycle areas.","Links":[{"Icon":"website","Url":"http://onofri.org/b","Text":"http://onofri.org/b"},{"Icon":"linkedin","Url":"http://www.linkedin.com/in/simoneonofri","Text":"http://www.linkedin.com/in/simoneonofri"},{"Icon":"twitter","Url":"","Text":"@simoneonofri"}],"Sessions":[{"Id":"1040","Title":"Agile Project Management: Integrare metodologie di progetto tradizionali con Agile","TimeSlotId":"17:20/18:00","TrackId":"6","Abstract":"Negli ultimi anni, anche secondo l'approccio Lean Startup, il modo migliore per rilasciare prodotti - non solo software - è tramite framework Agili. Quando si è agili all'interno di un organizzazione più tradizionale, questo approccio spesso si scontra con le prassi di gestione progetti più tradizionali. Nonostante lo scontro - principalmente filosofico - è in realtà possibile integrare metodologie di progetto tradizionali con quelle agili.\r\nDurante il talk, dopo una breve introduzione, saranno presentati dei modelli di ciclo di vita Agile e Tradizionale e la struttura consigliata dei team.","Speaker":"Simone Onofri","SpeakerId":"156","Day":"Friday"}]},{"Id":"1165","Name":"Stefano Sanna","Role":"Manager - Open Reply","Bio":"Stefano wrote his first mobile app in 1999 (on a PSION 5MX!). He worked for 7 years at CRS4 in the Network Distributed Applications research group. He then joined beeweeb SpA in 2006 as Mobile Application Architect, working on Mobile TV client for leading European network operators. He is currently Manager at Open Reply (Reply Group), focused 100% on mobile and wearable applications. He wrote \"Java Micro Edition\" for Hoepli and \"Android - Programmazione Avanzata\" for FAG. Far from the keyboard, Stefano loves playing LEGO Technic with his sons and enjoying cakes lovely cooked by his wife.","Links":[{"Icon":"website","Url":"http://www.gerdavax.it","Text":"http://www.gerdavax.it"},{"Icon":"linkedin","Url":"http://it.linkedin.com/in/gerdavax","Text":"http://it.linkedin.com/in/gerdavax"},{"Icon":"twitter","Url":"","Text":"@gerdavax"}],"Sessions":[{"Id":"1002","Title":"Introduzione alla tecnologia iBeacon","TimeSlotId":"14:00/14:40","TrackId":"3","Abstract":"Presentata in maniera piuttosto discreta tra le novità di iOS 7 nel 2013, le tecnologia iBeacon consente la localizzazione a corto raggio (prevalentemente indoor) e la realizzazione di servizi sensibili alla prossimità. L’intuizione di Apple sfrutta una delle caratteristiche fondamentali di Bluetooth Low Energy e questo rende gli iBeacon pressoché universali. In pochissimo tempo, sono comparsi sul mercato numerosi prodotti hardware che implementano la specifica (ufficiale e reverse engineered) e diverse API e librerie per l’integrazione di funzionalità di prossimità all’interno di mobile app.","Speaker":"Stefano Sanna","SpeakerId":"1165","Day":"Friday"}]},{"Id":"943","Name":"Svetlana Isakova","Role":"Developer - JetBrains","Bio":"Svetlana is working on Project Kotlin at JetBrains since 2011. From time to time she tries to encourage people with Kotlin at the conferences. Before joining Kotlin she had a passion for the Scala programming language. She loves concepts and ideas, and skiing in the Alps as well.","Links":[{"Icon":"website","Url":"http://kotlinlang.org/","Text":"http://kotlinlang.org/"},{"Icon":"twitter","Url":"","Text":""}],"Sessions":[{"Id":"1054","Title":"Kotlin, the Swift of Android","TimeSlotId":"10:00/11:00","TrackId":"8","Abstract":"Apple has introduced “a better language” for iOS developers. But what options do we have for Android? Surely Kotlin should be under consideration! Android Studio is now based on Intellij Idea, the “native” environment for Kotlin.\r\nKotlin is a modern language for industry. It can help you reduce the amount of code you write for Android applications and at the same time make it readable and more maintainable. In this session we’re going to see how certain constructs and DSL’s can be used to make Android more enjoyable.","Speaker":"Svetlana Isakova","SpeakerId":"943","Day":"Friday"}]},{"Id":"1111","Name":"Valerio Del Bello","Role":"Consultant - K-Tech","Bio":"Always interested in improving software development methods and approaches, he gets excited with new technologies and technical solutions. He has been working for seven years as a consultant in (mostly) Java-oriented environments and spends it's free time exploring new methodologies or having fun experimenting the latest technology. He believes it's important to deeply understand the business needs to develop a great solution choosing the best architecture and technologies.","Links":[{"Icon":"linkedin","Url":"http://it.linkedin.com/in/valeriodelbello","Text":"http://it.linkedin.com/in/valeriodelbello"},{"Icon":"twitter","Url":"","Text":"@valeriodelbello"}],"Sessions":[{"Id":"1081","Title":"Domain Driven Design + Command Query Responsibility Segregation + Event Sourcing = l’architettura del futuro","TimeSlotId":"12:30/13:10","TrackId":"2","Abstract":"Qual'è lo stato dell'arte delle architetture software? Costruiamo la soluzione con le ultime evoluzioni di Domain Driven Design, otteniamo ottime prestazioni con Command Query Responsibility Segregation e scaliamo alla grande con Event Sourcing, puntando ai microservice per ottenere un'architettura robusta, affidabile, veloce, distribuita e scalabile.","Speaker":"Valerio Del Bello","SpeakerId":"1111","Day":"Saturday"}]},{"Id":"953","Name":"Werner Keil","Role":"Founder/Director - Creative Arts & Technologies","Bio":"Werner Keil is Agile Coach and IoT/Embedded/Real Time expert. Helping Global 500 Enterprises across industries and leading IT vendors. He worked for over 25 years as Program Manager, Coach, SW architect and consultant for Finance, Mobile, Media, Tansport and Public sector. Werner is Eclipse and Apache Committer and JCP member in JSRs like 333 (JCR), 342 (Java EE 7), 354 (Money), 358/364 (JCP.next), Java ME 8, 362 (Portlet 3), 363 (Units, also Spec Lead), 365 (CDI 2) and the Executive Committee.","Links":[{"Icon":"website","Url":"http://www.catmedia.us","Text":"http://www.catmedia.us"},{"Icon":"linkedin","Url":"https://www.linkedin.com/in/catmedia","Text":"https://www.linkedin.com/in/catmedia"},{"Icon":"twitter","Url":"","Text":"@wernerkeil"}],"Sessions":[{"Id":"1003","Title":"Improving Mobile UX with Apache DeviceMap","TimeSlotId":"14:50/15:50","TrackId":"3","Abstract":"We experience a growing number of mobile phones, tablets, phablets, smart TV and similar devices flooding the market almost every day. If you want to create a comfortable user experience you need dynamic content according to hardware and browser of your device. That’s the reason for Device Description Repositories (DDR).\r\n\r\nApache DeviceMap started in January 2012, after OpenDDR contributed data and APis. It graduated from Apache Incubator November 2014. Next steps include an improved data format, maintenance of device data by the community via common API based on REST/OAuth and XML or JSON.","Speaker":"Werner Keil","SpeakerId":"953","Day":"Friday"}]},{"Id":"948","Name":"Yan Cui","Role":"Senior Developer - Gamesys","Bio":"Yan works as a server side developer at Gamesys where he develops scalable backend services for Gamesys's social games on mobile and Facebook. He's a co-author of \"F# Deep Dives\" by Manning. He's a regular speaker on topics such as Aspect-Oriented Programming, F# and NoSQL, and he keeps an active blog at http://theburningmonk.com/","Links":[{"Icon":"website","Url":"http://theburningmonk.com","Text":"http://theburningmonk.com"},{"Icon":"linkedin","Url":"http://uk.linkedin.com/in/theburningmonk/","Text":"http://uk.linkedin.com/in/theburningmonk/"},{"Icon":"twitter","Url":"","Text":"@theburningmonk"}],"Sessions":[{"Id":"1062","Title":"My adventure with Elm","TimeSlotId":"17:20/18:00","TrackId":"8","Abstract":"Reactive Extensions (Rx) has brought reactive programming to the mainstream in recent years with successful adoption in languages such as C#, Java and JavaScript. But have you ever wondered what Rx will look like as a language?\r\n\r\nElm is a new programming language based on the idea of Functional Reactive Programming (FRP). Elm lets you create highly interactive web applications without all the messy callbacks tangling around shared states.\r\n\r\nIn this talk Yan Cui will give a gentle introduction to Elm and FRP and finish off with a live demo building a web-based game from scratch.","Speaker":"Yan Cui","SpeakerId":"948","Day":"Friday"}]},{"Id":"595","Name":"Yauheni Kaziak","Role":"CEO - Stone Labs","Bio":"Yauheni Kaziak is a founder of the Stone Labs, Mobile and Web Development Studio with offices in US, Lithuania, Belarus and Hong Kong. The company is engaged in custom software development and outsourcing. Prior to this he has over 7 years of Project Management and Business Analyst experience in Mobile Development field. Has presented Belarus at the \"Regional Mobile Application Contest 2013\" sponsored by Nokia (Yerevan, Armenia) where his team has won 2d place among other Countries. Keynote speaker in numerous IT Events and Conferences in Russia, Belarus, Ukraine and Lithuania.","Links":[{"Icon":"website","Url":"http://stone-labs.com/","Text":"http://stone-labs.com/"},{"Icon":"twitter","Url":"","Text":""}],"Sessions":[{"Id":"1005","Title":"Tips and Tricks for Mobile Apps Prototyping","TimeSlotId":"17:20/18:00","TrackId":"3","Abstract":"Probably every company has faced the following problem - you are starting new Mobile app with really outstanding idea. All tech processes are adjusted and the project is being developed by experienced developers, designers and QA engineers. Seems that everything should be fine, but when the app was uploaded to the App Store the users receive it coldly. "It's so inconvenient, the app's logic is unclear at all!" - they say. Whose fault is it? Let's try to figure out.","Speaker":"Yauheni Kaziak","SpeakerId":"595","Day":"Friday"}]}]
\ No newline at end of file
diff --git a/BeyondResponsiveDesign/content/sponsors.html b/BeyondResponsiveDesign/content/sponsors.html
new file mode 100644
index 0000000..76094cb
--- /dev/null
+++ b/BeyondResponsiveDesign/content/sponsors.html
@@ -0,0 +1,155 @@
+
+
+
+
\ No newline at end of file
diff --git a/BeyondResponsiveDesign.Menus/content/venue.html b/BeyondResponsiveDesign/content/venue.html
similarity index 96%
rename from BeyondResponsiveDesign.Menus/content/venue.html
rename to BeyondResponsiveDesign/content/venue.html
index 166759f..d39f13c 100644
--- a/BeyondResponsiveDesign.Menus/content/venue.html
+++ b/BeyondResponsiveDesign/content/venue.html
@@ -11,7 +11,7 @@
DDD East Anglia for 2014 is taking place at the West Road Concert Hall , located on the edge of Cambridge city centre.
-
+
diff --git a/BeyondResponsiveDesign/images/INFO_About.png b/BeyondResponsiveDesign/images/INFO_About.png
new file mode 100644
index 0000000..7ecb4fb
Binary files /dev/null and b/BeyondResponsiveDesign/images/INFO_About.png differ
diff --git a/BeyondResponsiveDesign/images/codemotion_logo.png b/BeyondResponsiveDesign/images/codemotion_logo.png
new file mode 100644
index 0000000..0db46d5
Binary files /dev/null and b/BeyondResponsiveDesign/images/codemotion_logo.png differ
diff --git a/BeyondResponsiveDesign/images/facebook.png b/BeyondResponsiveDesign/images/facebook.png
new file mode 100644
index 0000000..4cf8329
Binary files /dev/null and b/BeyondResponsiveDesign/images/facebook.png differ
diff --git a/BeyondResponsiveDesign/images/favicon.ico b/BeyondResponsiveDesign/images/favicon.ico
new file mode 100644
index 0000000..b15ca44
Binary files /dev/null and b/BeyondResponsiveDesign/images/favicon.ico differ
diff --git a/BeyondResponsiveDesign/images/header_logo.png b/BeyondResponsiveDesign/images/header_logo.png
new file mode 100644
index 0000000..1864229
Binary files /dev/null and b/BeyondResponsiveDesign/images/header_logo.png differ
diff --git a/BeyondResponsiveDesign/images/icon-128.png b/BeyondResponsiveDesign/images/icon-128.png
new file mode 100644
index 0000000..dd43b6e
Binary files /dev/null and b/BeyondResponsiveDesign/images/icon-128.png differ
diff --git a/BeyondResponsiveDesign/images/icon-196.png b/BeyondResponsiveDesign/images/icon-196.png
new file mode 100644
index 0000000..470e3b8
Binary files /dev/null and b/BeyondResponsiveDesign/images/icon-196.png differ
diff --git a/BeyondResponsiveDesign/images/linkedin.png b/BeyondResponsiveDesign/images/linkedin.png
new file mode 100644
index 0000000..1f3af07
Binary files /dev/null and b/BeyondResponsiveDesign/images/linkedin.png differ
diff --git a/BeyondResponsiveDesign/images/logo-notext.png b/BeyondResponsiveDesign/images/logo-notext.png
new file mode 100644
index 0000000..1956b01
Binary files /dev/null and b/BeyondResponsiveDesign/images/logo-notext.png differ
diff --git a/BeyondResponsiveDesign/images/speakers/1011.jpg b/BeyondResponsiveDesign/images/speakers/1011.jpg
new file mode 100644
index 0000000..dbf244b
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/1011.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/1020.jpg b/BeyondResponsiveDesign/images/speakers/1020.jpg
new file mode 100644
index 0000000..7569456
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/1020.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/1050.jpg b/BeyondResponsiveDesign/images/speakers/1050.jpg
new file mode 100644
index 0000000..05338ea
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/1050.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/1054.jpg b/BeyondResponsiveDesign/images/speakers/1054.jpg
new file mode 100644
index 0000000..8f14758
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/1054.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/1062.jpg b/BeyondResponsiveDesign/images/speakers/1062.jpg
new file mode 100644
index 0000000..8bf1f42
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/1062.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/1064.jpg b/BeyondResponsiveDesign/images/speakers/1064.jpg
new file mode 100644
index 0000000..b4c70c0
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/1064.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/1073.jpg b/BeyondResponsiveDesign/images/speakers/1073.jpg
new file mode 100644
index 0000000..1c88e23
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/1073.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/1091.jpg b/BeyondResponsiveDesign/images/speakers/1091.jpg
new file mode 100644
index 0000000..e1236bd
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/1091.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/1099.jpg b/BeyondResponsiveDesign/images/speakers/1099.jpg
new file mode 100644
index 0000000..f8065fb
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/1099.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/1101.jpg b/BeyondResponsiveDesign/images/speakers/1101.jpg
new file mode 100644
index 0000000..0f31c5c
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/1101.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/1110.jpg b/BeyondResponsiveDesign/images/speakers/1110.jpg
new file mode 100644
index 0000000..fcb4445
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/1110.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/1111.jpg b/BeyondResponsiveDesign/images/speakers/1111.jpg
new file mode 100644
index 0000000..cc9d706
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/1111.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/1146.jpg b/BeyondResponsiveDesign/images/speakers/1146.jpg
new file mode 100644
index 0000000..2f06a34
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/1146.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/1151.jpg b/BeyondResponsiveDesign/images/speakers/1151.jpg
new file mode 100644
index 0000000..db4029c
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/1151.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/116.jpg b/BeyondResponsiveDesign/images/speakers/116.jpg
new file mode 100644
index 0000000..63177e9
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/116.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/1163.jpg b/BeyondResponsiveDesign/images/speakers/1163.jpg
new file mode 100644
index 0000000..f40b721
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/1163.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/1164.jpg b/BeyondResponsiveDesign/images/speakers/1164.jpg
new file mode 100644
index 0000000..df21af7
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/1164.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/1165.jpg b/BeyondResponsiveDesign/images/speakers/1165.jpg
new file mode 100644
index 0000000..b79b5ae
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/1165.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/1169.jpg b/BeyondResponsiveDesign/images/speakers/1169.jpg
new file mode 100644
index 0000000..44ab822
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/1169.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/1172.jpg b/BeyondResponsiveDesign/images/speakers/1172.jpg
new file mode 100644
index 0000000..b6ced0b
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/1172.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/1173.jpg b/BeyondResponsiveDesign/images/speakers/1173.jpg
new file mode 100644
index 0000000..3f17c52
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/1173.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/1176.jpg b/BeyondResponsiveDesign/images/speakers/1176.jpg
new file mode 100644
index 0000000..5452ac7
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/1176.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/1183.jpg b/BeyondResponsiveDesign/images/speakers/1183.jpg
new file mode 100644
index 0000000..d67a2aa
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/1183.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/141.jpg b/BeyondResponsiveDesign/images/speakers/141.jpg
new file mode 100644
index 0000000..587d04e
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/141.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/145.jpg b/BeyondResponsiveDesign/images/speakers/145.jpg
new file mode 100644
index 0000000..82d541d
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/145.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/156.jpg b/BeyondResponsiveDesign/images/speakers/156.jpg
new file mode 100644
index 0000000..9f19acc
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/156.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/167.jpg b/BeyondResponsiveDesign/images/speakers/167.jpg
new file mode 100644
index 0000000..0af0c1b
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/167.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/168.jpg b/BeyondResponsiveDesign/images/speakers/168.jpg
new file mode 100644
index 0000000..971b32b
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/168.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/190.jpg b/BeyondResponsiveDesign/images/speakers/190.jpg
new file mode 100644
index 0000000..468f9e7
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/190.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/192.jpg b/BeyondResponsiveDesign/images/speakers/192.jpg
new file mode 100644
index 0000000..ffe7f5b
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/192.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/236.jpg b/BeyondResponsiveDesign/images/speakers/236.jpg
new file mode 100644
index 0000000..461a718
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/236.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/266.jpg b/BeyondResponsiveDesign/images/speakers/266.jpg
new file mode 100644
index 0000000..2db0a00
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/266.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/287.jpg b/BeyondResponsiveDesign/images/speakers/287.jpg
new file mode 100644
index 0000000..d7f3c3e
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/287.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/297.jpg b/BeyondResponsiveDesign/images/speakers/297.jpg
new file mode 100644
index 0000000..50b7240
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/297.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/299.jpg b/BeyondResponsiveDesign/images/speakers/299.jpg
new file mode 100644
index 0000000..d2df2e1
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/299.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/307.jpg b/BeyondResponsiveDesign/images/speakers/307.jpg
new file mode 100644
index 0000000..411ca1f
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/307.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/329.jpg b/BeyondResponsiveDesign/images/speakers/329.jpg
new file mode 100644
index 0000000..3d17bae
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/329.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/338.jpg b/BeyondResponsiveDesign/images/speakers/338.jpg
new file mode 100644
index 0000000..73bf68e
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/338.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/359.jpg b/BeyondResponsiveDesign/images/speakers/359.jpg
new file mode 100644
index 0000000..c13d964
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/359.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/376.jpg b/BeyondResponsiveDesign/images/speakers/376.jpg
new file mode 100644
index 0000000..f453624
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/376.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/391.jpg b/BeyondResponsiveDesign/images/speakers/391.jpg
new file mode 100644
index 0000000..0ce44c3
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/391.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/413.jpg b/BeyondResponsiveDesign/images/speakers/413.jpg
new file mode 100644
index 0000000..0295a83
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/413.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/470.jpg b/BeyondResponsiveDesign/images/speakers/470.jpg
new file mode 100644
index 0000000..4260c56
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/470.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/485.jpg b/BeyondResponsiveDesign/images/speakers/485.jpg
new file mode 100644
index 0000000..8af01cd
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/485.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/506.jpg b/BeyondResponsiveDesign/images/speakers/506.jpg
new file mode 100644
index 0000000..8e04ad9
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/506.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/513.jpg b/BeyondResponsiveDesign/images/speakers/513.jpg
new file mode 100644
index 0000000..cdfdb05
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/513.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/52.jpg b/BeyondResponsiveDesign/images/speakers/52.jpg
new file mode 100644
index 0000000..9fb1546
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/52.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/524.jpg b/BeyondResponsiveDesign/images/speakers/524.jpg
new file mode 100644
index 0000000..207f97f
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/524.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/583.jpg b/BeyondResponsiveDesign/images/speakers/583.jpg
new file mode 100644
index 0000000..2f06a34
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/583.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/595.jpg b/BeyondResponsiveDesign/images/speakers/595.jpg
new file mode 100644
index 0000000..b177131
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/595.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/663.jpg b/BeyondResponsiveDesign/images/speakers/663.jpg
new file mode 100644
index 0000000..af8df26
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/663.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/724.jpg b/BeyondResponsiveDesign/images/speakers/724.jpg
new file mode 100644
index 0000000..2f06a34
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/724.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/749.jpg b/BeyondResponsiveDesign/images/speakers/749.jpg
new file mode 100644
index 0000000..465c40c
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/749.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/834.jpg b/BeyondResponsiveDesign/images/speakers/834.jpg
new file mode 100644
index 0000000..8e59ae4
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/834.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/875.jpg b/BeyondResponsiveDesign/images/speakers/875.jpg
new file mode 100644
index 0000000..8731c83
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/875.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/908.jpg b/BeyondResponsiveDesign/images/speakers/908.jpg
new file mode 100644
index 0000000..bb67a59
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/908.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/92.jpg b/BeyondResponsiveDesign/images/speakers/92.jpg
new file mode 100644
index 0000000..22c4728
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/92.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/926.jpg b/BeyondResponsiveDesign/images/speakers/926.jpg
new file mode 100644
index 0000000..4b1bfe5
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/926.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/93.jpg b/BeyondResponsiveDesign/images/speakers/93.jpg
new file mode 100644
index 0000000..ccb5373
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/93.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/943.jpg b/BeyondResponsiveDesign/images/speakers/943.jpg
new file mode 100644
index 0000000..4c03ded
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/943.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/948.jpg b/BeyondResponsiveDesign/images/speakers/948.jpg
new file mode 100644
index 0000000..754a07c
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/948.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/953.jpg b/BeyondResponsiveDesign/images/speakers/953.jpg
new file mode 100644
index 0000000..323d3f7
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/953.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/967.jpg b/BeyondResponsiveDesign/images/speakers/967.jpg
new file mode 100644
index 0000000..7b75942
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/967.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/977.jpg b/BeyondResponsiveDesign/images/speakers/977.jpg
new file mode 100644
index 0000000..e830af7
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/977.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/982.jpg b/BeyondResponsiveDesign/images/speakers/982.jpg
new file mode 100644
index 0000000..7ee5d14
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/982.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/991.jpg b/BeyondResponsiveDesign/images/speakers/991.jpg
new file mode 100644
index 0000000..6f295ad
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/991.jpg differ
diff --git a/BeyondResponsiveDesign/images/speakers/998.jpg b/BeyondResponsiveDesign/images/speakers/998.jpg
new file mode 100644
index 0000000..d70c2ff
Binary files /dev/null and b/BeyondResponsiveDesign/images/speakers/998.jpg differ
diff --git a/BeyondResponsiveDesign/images/sponsors/Amazon-messo-sul-sito-240x240-240x240.jpg b/BeyondResponsiveDesign/images/sponsors/Amazon-messo-sul-sito-240x240-240x240.jpg
new file mode 100644
index 0000000..e1d6a7d
Binary files /dev/null and b/BeyondResponsiveDesign/images/sponsors/Amazon-messo-sul-sito-240x240-240x240.jpg differ
diff --git a/BeyondResponsiveDesign/images/sponsors/Bravofly-messo-sul-sito1-240x240-240x240.jpg b/BeyondResponsiveDesign/images/sponsors/Bravofly-messo-sul-sito1-240x240-240x240.jpg
new file mode 100644
index 0000000..cc701e6
Binary files /dev/null and b/BeyondResponsiveDesign/images/sponsors/Bravofly-messo-sul-sito1-240x240-240x240.jpg differ
diff --git a/BeyondResponsiveDesign/images/sponsors/Capgemini_highres-240x240-240x240.png b/BeyondResponsiveDesign/images/sponsors/Capgemini_highres-240x240-240x240.png
new file mode 100644
index 0000000..dd81b7a
Binary files /dev/null and b/BeyondResponsiveDesign/images/sponsors/Capgemini_highres-240x240-240x240.png differ
diff --git a/BeyondResponsiveDesign/images/sponsors/Dedagroup-messo-sul-sito-240x240-240x240.jpg b/BeyondResponsiveDesign/images/sponsors/Dedagroup-messo-sul-sito-240x240-240x240.jpg
new file mode 100644
index 0000000..0e5a676
Binary files /dev/null and b/BeyondResponsiveDesign/images/sponsors/Dedagroup-messo-sul-sito-240x240-240x240.jpg differ
diff --git a/BeyondResponsiveDesign/images/sponsors/Google.png b/BeyondResponsiveDesign/images/sponsors/Google.png
new file mode 100644
index 0000000..d3a14e2
Binary files /dev/null and b/BeyondResponsiveDesign/images/sponsors/Google.png differ
diff --git a/BeyondResponsiveDesign/images/sponsors/IBM_Diamond-240x240.jpg b/BeyondResponsiveDesign/images/sponsors/IBM_Diamond-240x240.jpg
new file mode 100644
index 0000000..d297815
Binary files /dev/null and b/BeyondResponsiveDesign/images/sponsors/IBM_Diamond-240x240.jpg differ
diff --git a/BeyondResponsiveDesign/images/sponsors/Intel_Platinum-240x240.jpg b/BeyondResponsiveDesign/images/sponsors/Intel_Platinum-240x240.jpg
new file mode 100644
index 0000000..4be6e03
Binary files /dev/null and b/BeyondResponsiveDesign/images/sponsors/Intel_Platinum-240x240.jpg differ
diff --git a/BeyondResponsiveDesign/images/sponsors/K-Tech-messo-sul-sito-240x240-240x240.jpg b/BeyondResponsiveDesign/images/sponsors/K-Tech-messo-sul-sito-240x240-240x240.jpg
new file mode 100644
index 0000000..757f3b8
Binary files /dev/null and b/BeyondResponsiveDesign/images/sponsors/K-Tech-messo-sul-sito-240x240-240x240.jpg differ
diff --git a/BeyondResponsiveDesign/images/sponsors/LVenture-240x240.jpg b/BeyondResponsiveDesign/images/sponsors/LVenture-240x240.jpg
new file mode 100644
index 0000000..3e87348
Binary files /dev/null and b/BeyondResponsiveDesign/images/sponsors/LVenture-240x240.jpg differ
diff --git a/BeyondResponsiveDesign/images/sponsors/Labs-Horizontal-Color-RGB-240x240.jpg b/BeyondResponsiveDesign/images/sponsors/Labs-Horizontal-Color-RGB-240x240.jpg
new file mode 100644
index 0000000..6e046cf
Binary files /dev/null and b/BeyondResponsiveDesign/images/sponsors/Labs-Horizontal-Color-RGB-240x240.jpg differ
diff --git a/BeyondResponsiveDesign/images/sponsors/Logo-green-vulcano-240x240.jpg b/BeyondResponsiveDesign/images/sponsors/Logo-green-vulcano-240x240.jpg
new file mode 100644
index 0000000..6c9b07d
Binary files /dev/null and b/BeyondResponsiveDesign/images/sponsors/Logo-green-vulcano-240x240.jpg differ
diff --git a/BeyondResponsiveDesign/images/sponsors/Mailjet_logo1-240x105.png b/BeyondResponsiveDesign/images/sponsors/Mailjet_logo1-240x105.png
new file mode 100644
index 0000000..295a31c
Binary files /dev/null and b/BeyondResponsiveDesign/images/sponsors/Mailjet_logo1-240x105.png differ
diff --git a/BeyondResponsiveDesign/images/sponsors/Microsoft_Diamond.jpg b/BeyondResponsiveDesign/images/sponsors/Microsoft_Diamond.jpg
new file mode 100644
index 0000000..794b5c9
Binary files /dev/null and b/BeyondResponsiveDesign/images/sponsors/Microsoft_Diamond.jpg differ
diff --git a/BeyondResponsiveDesign/images/sponsors/Oracle.png b/BeyondResponsiveDesign/images/sponsors/Oracle.png
new file mode 100644
index 0000000..a8b2b29
Binary files /dev/null and b/BeyondResponsiveDesign/images/sponsors/Oracle.png differ
diff --git a/BeyondResponsiveDesign/images/sponsors/Redhat_Platinum-240x240.jpg b/BeyondResponsiveDesign/images/sponsors/Redhat_Platinum-240x240.jpg
new file mode 100644
index 0000000..573119e
Binary files /dev/null and b/BeyondResponsiveDesign/images/sponsors/Redhat_Platinum-240x240.jpg differ
diff --git a/BeyondResponsiveDesign/images/sponsors/Starbytes-240x240.png b/BeyondResponsiveDesign/images/sponsors/Starbytes-240x240.png
new file mode 100644
index 0000000..4cbf33d
Binary files /dev/null and b/BeyondResponsiveDesign/images/sponsors/Starbytes-240x240.png differ
diff --git a/BeyondResponsiveDesign/images/sponsors/WIND-240x240.jpg b/BeyondResponsiveDesign/images/sponsors/WIND-240x240.jpg
new file mode 100644
index 0000000..1a6100d
Binary files /dev/null and b/BeyondResponsiveDesign/images/sponsors/WIND-240x240.jpg differ
diff --git a/BeyondResponsiveDesign/images/sponsors/decisyon-240x240.jpg b/BeyondResponsiveDesign/images/sponsors/decisyon-240x240.jpg
new file mode 100644
index 0000000..cdb89d0
Binary files /dev/null and b/BeyondResponsiveDesign/images/sponsors/decisyon-240x240.jpg differ
diff --git a/BeyondResponsiveDesign/images/sponsors/everis-240x240.jpg b/BeyondResponsiveDesign/images/sponsors/everis-240x240.jpg
new file mode 100644
index 0000000..d574df1
Binary files /dev/null and b/BeyondResponsiveDesign/images/sponsors/everis-240x240.jpg differ
diff --git a/BeyondResponsiveDesign/images/sponsors/infocert-240x240.png b/BeyondResponsiveDesign/images/sponsors/infocert-240x240.png
new file mode 100644
index 0000000..3890fbe
Binary files /dev/null and b/BeyondResponsiveDesign/images/sponsors/infocert-240x240.png differ
diff --git a/BeyondResponsiveDesign/images/sponsors/jamgle_logo-240x240.jpg b/BeyondResponsiveDesign/images/sponsors/jamgle_logo-240x240.jpg
new file mode 100644
index 0000000..9cbfbf0
Binary files /dev/null and b/BeyondResponsiveDesign/images/sponsors/jamgle_logo-240x240.jpg differ
diff --git a/BeyondResponsiveDesign/images/sponsors/logomfr-240x240.jpg b/BeyondResponsiveDesign/images/sponsors/logomfr-240x240.jpg
new file mode 100644
index 0000000..254573f
Binary files /dev/null and b/BeyondResponsiveDesign/images/sponsors/logomfr-240x240.jpg differ
diff --git a/BeyondResponsiveDesign/images/sponsors/monster300-240x240.png b/BeyondResponsiveDesign/images/sponsors/monster300-240x240.png
new file mode 100644
index 0000000..7904b2d
Binary files /dev/null and b/BeyondResponsiveDesign/images/sponsors/monster300-240x240.png differ
diff --git a/BeyondResponsiveDesign/images/sponsors/neomobile-logo-240x179.png b/BeyondResponsiveDesign/images/sponsors/neomobile-logo-240x179.png
new file mode 100644
index 0000000..199bd01
Binary files /dev/null and b/BeyondResponsiveDesign/images/sponsors/neomobile-logo-240x179.png differ
diff --git a/BeyondResponsiveDesign/images/sponsors/nttdata-240x240.jpg b/BeyondResponsiveDesign/images/sponsors/nttdata-240x240.jpg
new file mode 100644
index 0000000..e061b1b
Binary files /dev/null and b/BeyondResponsiveDesign/images/sponsors/nttdata-240x240.jpg differ
diff --git a/BeyondResponsiveDesign/images/sponsors/redbull-quadrato-240x240.jpg b/BeyondResponsiveDesign/images/sponsors/redbull-quadrato-240x240.jpg
new file mode 100644
index 0000000..cb91ee1
Binary files /dev/null and b/BeyondResponsiveDesign/images/sponsors/redbull-quadrato-240x240.jpg differ
diff --git a/BeyondResponsiveDesign/images/twitter.png b/BeyondResponsiveDesign/images/twitter.png
new file mode 100644
index 0000000..f44cac4
Binary files /dev/null and b/BeyondResponsiveDesign/images/twitter.png differ
diff --git a/BeyondResponsiveDesign/index.html b/BeyondResponsiveDesign/index.html
new file mode 100644
index 0000000..b2abfd1
--- /dev/null
+++ b/BeyondResponsiveDesign/index.html
@@ -0,0 +1,205 @@
+
+
+
+ Beyond responsive design - UI for the modern web application
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Home
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/BeyondResponsiveDesign.Menus/Scripts/fastclick.js b/BeyondResponsiveDesign/scripts/fastclick.js
similarity index 100%
rename from BeyondResponsiveDesign.Menus/Scripts/fastclick.js
rename to BeyondResponsiveDesign/scripts/fastclick.js
diff --git a/BeyondResponsiveDesign.Menus/Scripts/interactions.js b/BeyondResponsiveDesign/scripts/interactions.js
similarity index 97%
rename from BeyondResponsiveDesign.Menus/Scripts/interactions.js
rename to BeyondResponsiveDesign/scripts/interactions.js
index 12cfd12..2200edb 100644
--- a/BeyondResponsiveDesign.Menus/Scripts/interactions.js
+++ b/BeyondResponsiveDesign/scripts/interactions.js
@@ -199,6 +199,11 @@
e.stopPropagation();
});
+ if (!location)
+ {
+ return $.Deferred().resolve().promise();
+ }
+
return $.get("content/" + location + ".html").done(function (html) {
var target = $("main > aside");
target.empty();
@@ -229,8 +234,8 @@
target.empty();
target.html(html);
- $("nav > div > div > ul li").removeClass("active");
- var menuitem = $("nav > div > div > ul li#menu-" + location);
+ $("nav > div > ul li").removeClass("active");
+ var menuitem = $("nav > div > ul li#menu-" + location);
menuitem.addClass("active");
var title = menuitem.find("a span").first().text();
@@ -278,6 +283,7 @@
interactions.slideToTab = function (tab) {
var tabLink = $("article > nav > ul > li#tab-" + tab);
+ tabLink[0].scrollIntoView();
shiftElements(tabLink, "li");
var tabContent = $("article > div.slideTabContainer > section#" + tab);
diff --git a/BeyondResponsiveDesign.Menus/Scripts/jquery-2.1.1.intellisense.js b/BeyondResponsiveDesign/scripts/jquery-2.1.1.intellisense.js
similarity index 100%
rename from BeyondResponsiveDesign.Menus/Scripts/jquery-2.1.1.intellisense.js
rename to BeyondResponsiveDesign/scripts/jquery-2.1.1.intellisense.js
diff --git a/BeyondResponsiveDesign.Menus/Scripts/jquery-2.1.1.js b/BeyondResponsiveDesign/scripts/jquery-2.1.1.js
similarity index 100%
rename from BeyondResponsiveDesign.Menus/Scripts/jquery-2.1.1.js
rename to BeyondResponsiveDesign/scripts/jquery-2.1.1.js
diff --git a/BeyondResponsiveDesign.Menus/Scripts/jquery-2.1.1.min.js b/BeyondResponsiveDesign/scripts/jquery-2.1.1.min.js
similarity index 100%
rename from BeyondResponsiveDesign.Menus/Scripts/jquery-2.1.1.min.js
rename to BeyondResponsiveDesign/scripts/jquery-2.1.1.min.js
diff --git a/BeyondResponsiveDesign.Menus/Scripts/jquery-2.1.1.min.map b/BeyondResponsiveDesign/scripts/jquery-2.1.1.min.map
similarity index 100%
rename from BeyondResponsiveDesign.Menus/Scripts/jquery-2.1.1.min.map
rename to BeyondResponsiveDesign/scripts/jquery-2.1.1.min.map
diff --git a/BeyondResponsiveDesign.Menus/Scripts/jquery.detect_swipe.js b/BeyondResponsiveDesign/scripts/jquery.detect_swipe.js
similarity index 100%
rename from BeyondResponsiveDesign.Menus/Scripts/jquery.detect_swipe.js
rename to BeyondResponsiveDesign/scripts/jquery.detect_swipe.js
diff --git a/BeyondResponsiveDesign.Menus/Scripts/knockout-3.1.0.debug.js b/BeyondResponsiveDesign/scripts/knockout-3.1.0.debug.js
similarity index 100%
rename from BeyondResponsiveDesign.Menus/Scripts/knockout-3.1.0.debug.js
rename to BeyondResponsiveDesign/scripts/knockout-3.1.0.debug.js
diff --git a/BeyondResponsiveDesign.Menus/Scripts/knockout-3.1.0.js b/BeyondResponsiveDesign/scripts/knockout-3.1.0.js
similarity index 100%
rename from BeyondResponsiveDesign.Menus/Scripts/knockout-3.1.0.js
rename to BeyondResponsiveDesign/scripts/knockout-3.1.0.js
diff --git a/BeyondResponsiveDesign.Menus/Scripts/touchscrollfix.js b/BeyondResponsiveDesign/scripts/touchscrollfix.js
similarity index 100%
rename from BeyondResponsiveDesign.Menus/Scripts/touchscrollfix.js
rename to BeyondResponsiveDesign/scripts/touchscrollfix.js
diff --git a/BeyondResponsiveDesign.Menus/styles/font-awesome.css b/BeyondResponsiveDesign/styles/font-awesome.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/font-awesome.css
rename to BeyondResponsiveDesign/styles/font-awesome.css
diff --git a/BeyondResponsiveDesign.Menus/styles/font-awesome.min.css b/BeyondResponsiveDesign/styles/font-awesome.min.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/font-awesome.min.css
rename to BeyondResponsiveDesign/styles/font-awesome.min.css
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/FontAwesome.otf b/BeyondResponsiveDesign/styles/fonts/FontAwesome.otf
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/FontAwesome.otf
rename to BeyondResponsiveDesign/styles/fonts/FontAwesome.otf
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/fontawesome-webfont.eot b/BeyondResponsiveDesign/styles/fonts/fontawesome-webfont.eot
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/fontawesome-webfont.eot
rename to BeyondResponsiveDesign/styles/fonts/fontawesome-webfont.eot
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/fontawesome-webfont.svg b/BeyondResponsiveDesign/styles/fonts/fontawesome-webfont.svg
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/fontawesome-webfont.svg
rename to BeyondResponsiveDesign/styles/fonts/fontawesome-webfont.svg
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/fontawesome-webfont.ttf b/BeyondResponsiveDesign/styles/fonts/fontawesome-webfont.ttf
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/fontawesome-webfont.ttf
rename to BeyondResponsiveDesign/styles/fonts/fontawesome-webfont.ttf
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/fontawesome-webfont.woff b/BeyondResponsiveDesign/styles/fonts/fontawesome-webfont.woff
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/fontawesome-webfont.woff
rename to BeyondResponsiveDesign/styles/fonts/fontawesome-webfont.woff
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_bold_macroman/OpenSans-Bold-demo.html b/BeyondResponsiveDesign/styles/fonts/opensans_bold_macroman/OpenSans-Bold-demo.html
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_bold_macroman/OpenSans-Bold-demo.html
rename to BeyondResponsiveDesign/styles/fonts/opensans_bold_macroman/OpenSans-Bold-demo.html
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_bold_macroman/OpenSans-Bold-webfont.eot b/BeyondResponsiveDesign/styles/fonts/opensans_bold_macroman/OpenSans-Bold-webfont.eot
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_bold_macroman/OpenSans-Bold-webfont.eot
rename to BeyondResponsiveDesign/styles/fonts/opensans_bold_macroman/OpenSans-Bold-webfont.eot
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_bold_macroman/OpenSans-Bold-webfont.svg b/BeyondResponsiveDesign/styles/fonts/opensans_bold_macroman/OpenSans-Bold-webfont.svg
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_bold_macroman/OpenSans-Bold-webfont.svg
rename to BeyondResponsiveDesign/styles/fonts/opensans_bold_macroman/OpenSans-Bold-webfont.svg
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_bold_macroman/OpenSans-Bold-webfont.ttf b/BeyondResponsiveDesign/styles/fonts/opensans_bold_macroman/OpenSans-Bold-webfont.ttf
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_bold_macroman/OpenSans-Bold-webfont.ttf
rename to BeyondResponsiveDesign/styles/fonts/opensans_bold_macroman/OpenSans-Bold-webfont.ttf
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_bold_macroman/OpenSans-Bold-webfont.woff b/BeyondResponsiveDesign/styles/fonts/opensans_bold_macroman/OpenSans-Bold-webfont.woff
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_bold_macroman/OpenSans-Bold-webfont.woff
rename to BeyondResponsiveDesign/styles/fonts/opensans_bold_macroman/OpenSans-Bold-webfont.woff
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_bold_macroman/specimen_files/OpenSans-Bold-cleartype.png b/BeyondResponsiveDesign/styles/fonts/opensans_bold_macroman/specimen_files/OpenSans-Bold-cleartype.png
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_bold_macroman/specimen_files/OpenSans-Bold-cleartype.png
rename to BeyondResponsiveDesign/styles/fonts/opensans_bold_macroman/specimen_files/OpenSans-Bold-cleartype.png
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_bold_macroman/specimen_files/easytabs.js b/BeyondResponsiveDesign/styles/fonts/opensans_bold_macroman/specimen_files/easytabs.js
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_bold_macroman/specimen_files/easytabs.js
rename to BeyondResponsiveDesign/styles/fonts/opensans_bold_macroman/specimen_files/easytabs.js
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_bold_macroman/specimen_files/grid_12-825-55-15.css b/BeyondResponsiveDesign/styles/fonts/opensans_bold_macroman/specimen_files/grid_12-825-55-15.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_bold_macroman/specimen_files/grid_12-825-55-15.css
rename to BeyondResponsiveDesign/styles/fonts/opensans_bold_macroman/specimen_files/grid_12-825-55-15.css
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_bold_macroman/specimen_files/specimen_stylesheet.css b/BeyondResponsiveDesign/styles/fonts/opensans_bold_macroman/specimen_files/specimen_stylesheet.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_bold_macroman/specimen_files/specimen_stylesheet.css
rename to BeyondResponsiveDesign/styles/fonts/opensans_bold_macroman/specimen_files/specimen_stylesheet.css
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_bold_macroman/stylesheet.css b/BeyondResponsiveDesign/styles/fonts/opensans_bold_macroman/stylesheet.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_bold_macroman/stylesheet.css
rename to BeyondResponsiveDesign/styles/fonts/opensans_bold_macroman/stylesheet.css
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_bolditalic_macroman/OpenSans-BoldItalic-demo.html b/BeyondResponsiveDesign/styles/fonts/opensans_bolditalic_macroman/OpenSans-BoldItalic-demo.html
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_bolditalic_macroman/OpenSans-BoldItalic-demo.html
rename to BeyondResponsiveDesign/styles/fonts/opensans_bolditalic_macroman/OpenSans-BoldItalic-demo.html
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_bolditalic_macroman/OpenSans-BoldItalic-webfont.eot b/BeyondResponsiveDesign/styles/fonts/opensans_bolditalic_macroman/OpenSans-BoldItalic-webfont.eot
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_bolditalic_macroman/OpenSans-BoldItalic-webfont.eot
rename to BeyondResponsiveDesign/styles/fonts/opensans_bolditalic_macroman/OpenSans-BoldItalic-webfont.eot
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_bolditalic_macroman/OpenSans-BoldItalic-webfont.svg b/BeyondResponsiveDesign/styles/fonts/opensans_bolditalic_macroman/OpenSans-BoldItalic-webfont.svg
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_bolditalic_macroman/OpenSans-BoldItalic-webfont.svg
rename to BeyondResponsiveDesign/styles/fonts/opensans_bolditalic_macroman/OpenSans-BoldItalic-webfont.svg
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_bolditalic_macroman/OpenSans-BoldItalic-webfont.ttf b/BeyondResponsiveDesign/styles/fonts/opensans_bolditalic_macroman/OpenSans-BoldItalic-webfont.ttf
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_bolditalic_macroman/OpenSans-BoldItalic-webfont.ttf
rename to BeyondResponsiveDesign/styles/fonts/opensans_bolditalic_macroman/OpenSans-BoldItalic-webfont.ttf
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_bolditalic_macroman/OpenSans-BoldItalic-webfont.woff b/BeyondResponsiveDesign/styles/fonts/opensans_bolditalic_macroman/OpenSans-BoldItalic-webfont.woff
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_bolditalic_macroman/OpenSans-BoldItalic-webfont.woff
rename to BeyondResponsiveDesign/styles/fonts/opensans_bolditalic_macroman/OpenSans-BoldItalic-webfont.woff
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_bolditalic_macroman/specimen_files/OpenSans-BoldItalic-cleartype.png b/BeyondResponsiveDesign/styles/fonts/opensans_bolditalic_macroman/specimen_files/OpenSans-BoldItalic-cleartype.png
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_bolditalic_macroman/specimen_files/OpenSans-BoldItalic-cleartype.png
rename to BeyondResponsiveDesign/styles/fonts/opensans_bolditalic_macroman/specimen_files/OpenSans-BoldItalic-cleartype.png
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_bolditalic_macroman/specimen_files/easytabs.js b/BeyondResponsiveDesign/styles/fonts/opensans_bolditalic_macroman/specimen_files/easytabs.js
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_bolditalic_macroman/specimen_files/easytabs.js
rename to BeyondResponsiveDesign/styles/fonts/opensans_bolditalic_macroman/specimen_files/easytabs.js
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_bolditalic_macroman/specimen_files/grid_12-825-55-15.css b/BeyondResponsiveDesign/styles/fonts/opensans_bolditalic_macroman/specimen_files/grid_12-825-55-15.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_bolditalic_macroman/specimen_files/grid_12-825-55-15.css
rename to BeyondResponsiveDesign/styles/fonts/opensans_bolditalic_macroman/specimen_files/grid_12-825-55-15.css
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_bolditalic_macroman/specimen_files/specimen_stylesheet.css b/BeyondResponsiveDesign/styles/fonts/opensans_bolditalic_macroman/specimen_files/specimen_stylesheet.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_bolditalic_macroman/specimen_files/specimen_stylesheet.css
rename to BeyondResponsiveDesign/styles/fonts/opensans_bolditalic_macroman/specimen_files/specimen_stylesheet.css
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_bolditalic_macroman/stylesheet.css b/BeyondResponsiveDesign/styles/fonts/opensans_bolditalic_macroman/stylesheet.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_bolditalic_macroman/stylesheet.css
rename to BeyondResponsiveDesign/styles/fonts/opensans_bolditalic_macroman/stylesheet.css
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabold_macroman/OpenSans-ExtraBold-demo.html b/BeyondResponsiveDesign/styles/fonts/opensans_extrabold_macroman/OpenSans-ExtraBold-demo.html
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabold_macroman/OpenSans-ExtraBold-demo.html
rename to BeyondResponsiveDesign/styles/fonts/opensans_extrabold_macroman/OpenSans-ExtraBold-demo.html
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabold_macroman/OpenSans-ExtraBold-webfont.eot b/BeyondResponsiveDesign/styles/fonts/opensans_extrabold_macroman/OpenSans-ExtraBold-webfont.eot
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabold_macroman/OpenSans-ExtraBold-webfont.eot
rename to BeyondResponsiveDesign/styles/fonts/opensans_extrabold_macroman/OpenSans-ExtraBold-webfont.eot
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabold_macroman/OpenSans-ExtraBold-webfont.svg b/BeyondResponsiveDesign/styles/fonts/opensans_extrabold_macroman/OpenSans-ExtraBold-webfont.svg
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabold_macroman/OpenSans-ExtraBold-webfont.svg
rename to BeyondResponsiveDesign/styles/fonts/opensans_extrabold_macroman/OpenSans-ExtraBold-webfont.svg
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabold_macroman/OpenSans-ExtraBold-webfont.ttf b/BeyondResponsiveDesign/styles/fonts/opensans_extrabold_macroman/OpenSans-ExtraBold-webfont.ttf
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabold_macroman/OpenSans-ExtraBold-webfont.ttf
rename to BeyondResponsiveDesign/styles/fonts/opensans_extrabold_macroman/OpenSans-ExtraBold-webfont.ttf
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabold_macroman/OpenSans-ExtraBold-webfont.woff b/BeyondResponsiveDesign/styles/fonts/opensans_extrabold_macroman/OpenSans-ExtraBold-webfont.woff
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabold_macroman/OpenSans-ExtraBold-webfont.woff
rename to BeyondResponsiveDesign/styles/fonts/opensans_extrabold_macroman/OpenSans-ExtraBold-webfont.woff
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabold_macroman/specimen_files/OpenSans-ExtraBold-cleartype.png b/BeyondResponsiveDesign/styles/fonts/opensans_extrabold_macroman/specimen_files/OpenSans-ExtraBold-cleartype.png
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabold_macroman/specimen_files/OpenSans-ExtraBold-cleartype.png
rename to BeyondResponsiveDesign/styles/fonts/opensans_extrabold_macroman/specimen_files/OpenSans-ExtraBold-cleartype.png
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabold_macroman/specimen_files/easytabs.js b/BeyondResponsiveDesign/styles/fonts/opensans_extrabold_macroman/specimen_files/easytabs.js
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabold_macroman/specimen_files/easytabs.js
rename to BeyondResponsiveDesign/styles/fonts/opensans_extrabold_macroman/specimen_files/easytabs.js
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabold_macroman/specimen_files/grid_12-825-55-15.css b/BeyondResponsiveDesign/styles/fonts/opensans_extrabold_macroman/specimen_files/grid_12-825-55-15.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabold_macroman/specimen_files/grid_12-825-55-15.css
rename to BeyondResponsiveDesign/styles/fonts/opensans_extrabold_macroman/specimen_files/grid_12-825-55-15.css
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabold_macroman/specimen_files/specimen_stylesheet.css b/BeyondResponsiveDesign/styles/fonts/opensans_extrabold_macroman/specimen_files/specimen_stylesheet.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabold_macroman/specimen_files/specimen_stylesheet.css
rename to BeyondResponsiveDesign/styles/fonts/opensans_extrabold_macroman/specimen_files/specimen_stylesheet.css
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabold_macroman/stylesheet.css b/BeyondResponsiveDesign/styles/fonts/opensans_extrabold_macroman/stylesheet.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabold_macroman/stylesheet.css
rename to BeyondResponsiveDesign/styles/fonts/opensans_extrabold_macroman/stylesheet.css
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabolditalic_macroman/OpenSans-ExtraBoldItalic-demo.html b/BeyondResponsiveDesign/styles/fonts/opensans_extrabolditalic_macroman/OpenSans-ExtraBoldItalic-demo.html
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabolditalic_macroman/OpenSans-ExtraBoldItalic-demo.html
rename to BeyondResponsiveDesign/styles/fonts/opensans_extrabolditalic_macroman/OpenSans-ExtraBoldItalic-demo.html
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabolditalic_macroman/OpenSans-ExtraBoldItalic-webfont.eot b/BeyondResponsiveDesign/styles/fonts/opensans_extrabolditalic_macroman/OpenSans-ExtraBoldItalic-webfont.eot
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabolditalic_macroman/OpenSans-ExtraBoldItalic-webfont.eot
rename to BeyondResponsiveDesign/styles/fonts/opensans_extrabolditalic_macroman/OpenSans-ExtraBoldItalic-webfont.eot
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabolditalic_macroman/OpenSans-ExtraBoldItalic-webfont.svg b/BeyondResponsiveDesign/styles/fonts/opensans_extrabolditalic_macroman/OpenSans-ExtraBoldItalic-webfont.svg
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabolditalic_macroman/OpenSans-ExtraBoldItalic-webfont.svg
rename to BeyondResponsiveDesign/styles/fonts/opensans_extrabolditalic_macroman/OpenSans-ExtraBoldItalic-webfont.svg
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabolditalic_macroman/OpenSans-ExtraBoldItalic-webfont.ttf b/BeyondResponsiveDesign/styles/fonts/opensans_extrabolditalic_macroman/OpenSans-ExtraBoldItalic-webfont.ttf
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabolditalic_macroman/OpenSans-ExtraBoldItalic-webfont.ttf
rename to BeyondResponsiveDesign/styles/fonts/opensans_extrabolditalic_macroman/OpenSans-ExtraBoldItalic-webfont.ttf
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabolditalic_macroman/OpenSans-ExtraBoldItalic-webfont.woff b/BeyondResponsiveDesign/styles/fonts/opensans_extrabolditalic_macroman/OpenSans-ExtraBoldItalic-webfont.woff
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabolditalic_macroman/OpenSans-ExtraBoldItalic-webfont.woff
rename to BeyondResponsiveDesign/styles/fonts/opensans_extrabolditalic_macroman/OpenSans-ExtraBoldItalic-webfont.woff
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabolditalic_macroman/specimen_files/OpenSans-ExtraBoldItalic-cleartype.png b/BeyondResponsiveDesign/styles/fonts/opensans_extrabolditalic_macroman/specimen_files/OpenSans-ExtraBoldItalic-cleartype.png
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabolditalic_macroman/specimen_files/OpenSans-ExtraBoldItalic-cleartype.png
rename to BeyondResponsiveDesign/styles/fonts/opensans_extrabolditalic_macroman/specimen_files/OpenSans-ExtraBoldItalic-cleartype.png
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabolditalic_macroman/specimen_files/easytabs.js b/BeyondResponsiveDesign/styles/fonts/opensans_extrabolditalic_macroman/specimen_files/easytabs.js
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabolditalic_macroman/specimen_files/easytabs.js
rename to BeyondResponsiveDesign/styles/fonts/opensans_extrabolditalic_macroman/specimen_files/easytabs.js
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabolditalic_macroman/specimen_files/grid_12-825-55-15.css b/BeyondResponsiveDesign/styles/fonts/opensans_extrabolditalic_macroman/specimen_files/grid_12-825-55-15.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabolditalic_macroman/specimen_files/grid_12-825-55-15.css
rename to BeyondResponsiveDesign/styles/fonts/opensans_extrabolditalic_macroman/specimen_files/grid_12-825-55-15.css
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabolditalic_macroman/specimen_files/specimen_stylesheet.css b/BeyondResponsiveDesign/styles/fonts/opensans_extrabolditalic_macroman/specimen_files/specimen_stylesheet.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabolditalic_macroman/specimen_files/specimen_stylesheet.css
rename to BeyondResponsiveDesign/styles/fonts/opensans_extrabolditalic_macroman/specimen_files/specimen_stylesheet.css
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabolditalic_macroman/stylesheet.css b/BeyondResponsiveDesign/styles/fonts/opensans_extrabolditalic_macroman/stylesheet.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_extrabolditalic_macroman/stylesheet.css
rename to BeyondResponsiveDesign/styles/fonts/opensans_extrabolditalic_macroman/stylesheet.css
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_italic_macroman/OpenSans-Italic-demo.html b/BeyondResponsiveDesign/styles/fonts/opensans_italic_macroman/OpenSans-Italic-demo.html
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_italic_macroman/OpenSans-Italic-demo.html
rename to BeyondResponsiveDesign/styles/fonts/opensans_italic_macroman/OpenSans-Italic-demo.html
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_italic_macroman/OpenSans-Italic-webfont.eot b/BeyondResponsiveDesign/styles/fonts/opensans_italic_macroman/OpenSans-Italic-webfont.eot
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_italic_macroman/OpenSans-Italic-webfont.eot
rename to BeyondResponsiveDesign/styles/fonts/opensans_italic_macroman/OpenSans-Italic-webfont.eot
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_italic_macroman/OpenSans-Italic-webfont.svg b/BeyondResponsiveDesign/styles/fonts/opensans_italic_macroman/OpenSans-Italic-webfont.svg
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_italic_macroman/OpenSans-Italic-webfont.svg
rename to BeyondResponsiveDesign/styles/fonts/opensans_italic_macroman/OpenSans-Italic-webfont.svg
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_italic_macroman/OpenSans-Italic-webfont.ttf b/BeyondResponsiveDesign/styles/fonts/opensans_italic_macroman/OpenSans-Italic-webfont.ttf
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_italic_macroman/OpenSans-Italic-webfont.ttf
rename to BeyondResponsiveDesign/styles/fonts/opensans_italic_macroman/OpenSans-Italic-webfont.ttf
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_italic_macroman/OpenSans-Italic-webfont.woff b/BeyondResponsiveDesign/styles/fonts/opensans_italic_macroman/OpenSans-Italic-webfont.woff
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_italic_macroman/OpenSans-Italic-webfont.woff
rename to BeyondResponsiveDesign/styles/fonts/opensans_italic_macroman/OpenSans-Italic-webfont.woff
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_italic_macroman/specimen_files/OpenSans-Italic-cleartype.png b/BeyondResponsiveDesign/styles/fonts/opensans_italic_macroman/specimen_files/OpenSans-Italic-cleartype.png
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_italic_macroman/specimen_files/OpenSans-Italic-cleartype.png
rename to BeyondResponsiveDesign/styles/fonts/opensans_italic_macroman/specimen_files/OpenSans-Italic-cleartype.png
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_italic_macroman/specimen_files/easytabs.js b/BeyondResponsiveDesign/styles/fonts/opensans_italic_macroman/specimen_files/easytabs.js
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_italic_macroman/specimen_files/easytabs.js
rename to BeyondResponsiveDesign/styles/fonts/opensans_italic_macroman/specimen_files/easytabs.js
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_italic_macroman/specimen_files/grid_12-825-55-15.css b/BeyondResponsiveDesign/styles/fonts/opensans_italic_macroman/specimen_files/grid_12-825-55-15.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_italic_macroman/specimen_files/grid_12-825-55-15.css
rename to BeyondResponsiveDesign/styles/fonts/opensans_italic_macroman/specimen_files/grid_12-825-55-15.css
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_italic_macroman/specimen_files/specimen_stylesheet.css b/BeyondResponsiveDesign/styles/fonts/opensans_italic_macroman/specimen_files/specimen_stylesheet.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_italic_macroman/specimen_files/specimen_stylesheet.css
rename to BeyondResponsiveDesign/styles/fonts/opensans_italic_macroman/specimen_files/specimen_stylesheet.css
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_italic_macroman/stylesheet.css b/BeyondResponsiveDesign/styles/fonts/opensans_italic_macroman/stylesheet.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_italic_macroman/stylesheet.css
rename to BeyondResponsiveDesign/styles/fonts/opensans_italic_macroman/stylesheet.css
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_light_macroman/OpenSans-Light-demo.html b/BeyondResponsiveDesign/styles/fonts/opensans_light_macroman/OpenSans-Light-demo.html
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_light_macroman/OpenSans-Light-demo.html
rename to BeyondResponsiveDesign/styles/fonts/opensans_light_macroman/OpenSans-Light-demo.html
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_light_macroman/OpenSans-Light-webfont.eot b/BeyondResponsiveDesign/styles/fonts/opensans_light_macroman/OpenSans-Light-webfont.eot
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_light_macroman/OpenSans-Light-webfont.eot
rename to BeyondResponsiveDesign/styles/fonts/opensans_light_macroman/OpenSans-Light-webfont.eot
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_light_macroman/OpenSans-Light-webfont.svg b/BeyondResponsiveDesign/styles/fonts/opensans_light_macroman/OpenSans-Light-webfont.svg
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_light_macroman/OpenSans-Light-webfont.svg
rename to BeyondResponsiveDesign/styles/fonts/opensans_light_macroman/OpenSans-Light-webfont.svg
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_light_macroman/OpenSans-Light-webfont.ttf b/BeyondResponsiveDesign/styles/fonts/opensans_light_macroman/OpenSans-Light-webfont.ttf
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_light_macroman/OpenSans-Light-webfont.ttf
rename to BeyondResponsiveDesign/styles/fonts/opensans_light_macroman/OpenSans-Light-webfont.ttf
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_light_macroman/OpenSans-Light-webfont.woff b/BeyondResponsiveDesign/styles/fonts/opensans_light_macroman/OpenSans-Light-webfont.woff
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_light_macroman/OpenSans-Light-webfont.woff
rename to BeyondResponsiveDesign/styles/fonts/opensans_light_macroman/OpenSans-Light-webfont.woff
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_light_macroman/specimen_files/OpenSans-Light-cleartype.png b/BeyondResponsiveDesign/styles/fonts/opensans_light_macroman/specimen_files/OpenSans-Light-cleartype.png
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_light_macroman/specimen_files/OpenSans-Light-cleartype.png
rename to BeyondResponsiveDesign/styles/fonts/opensans_light_macroman/specimen_files/OpenSans-Light-cleartype.png
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_light_macroman/specimen_files/easytabs.js b/BeyondResponsiveDesign/styles/fonts/opensans_light_macroman/specimen_files/easytabs.js
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_light_macroman/specimen_files/easytabs.js
rename to BeyondResponsiveDesign/styles/fonts/opensans_light_macroman/specimen_files/easytabs.js
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_light_macroman/specimen_files/grid_12-825-55-15.css b/BeyondResponsiveDesign/styles/fonts/opensans_light_macroman/specimen_files/grid_12-825-55-15.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_light_macroman/specimen_files/grid_12-825-55-15.css
rename to BeyondResponsiveDesign/styles/fonts/opensans_light_macroman/specimen_files/grid_12-825-55-15.css
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_light_macroman/specimen_files/specimen_stylesheet.css b/BeyondResponsiveDesign/styles/fonts/opensans_light_macroman/specimen_files/specimen_stylesheet.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_light_macroman/specimen_files/specimen_stylesheet.css
rename to BeyondResponsiveDesign/styles/fonts/opensans_light_macroman/specimen_files/specimen_stylesheet.css
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_light_macroman/stylesheet.css b/BeyondResponsiveDesign/styles/fonts/opensans_light_macroman/stylesheet.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_light_macroman/stylesheet.css
rename to BeyondResponsiveDesign/styles/fonts/opensans_light_macroman/stylesheet.css
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_lightitalic_macroman/OpenSans-LightItalic-demo.html b/BeyondResponsiveDesign/styles/fonts/opensans_lightitalic_macroman/OpenSans-LightItalic-demo.html
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_lightitalic_macroman/OpenSans-LightItalic-demo.html
rename to BeyondResponsiveDesign/styles/fonts/opensans_lightitalic_macroman/OpenSans-LightItalic-demo.html
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_lightitalic_macroman/OpenSans-LightItalic-webfont.eot b/BeyondResponsiveDesign/styles/fonts/opensans_lightitalic_macroman/OpenSans-LightItalic-webfont.eot
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_lightitalic_macroman/OpenSans-LightItalic-webfont.eot
rename to BeyondResponsiveDesign/styles/fonts/opensans_lightitalic_macroman/OpenSans-LightItalic-webfont.eot
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_lightitalic_macroman/OpenSans-LightItalic-webfont.svg b/BeyondResponsiveDesign/styles/fonts/opensans_lightitalic_macroman/OpenSans-LightItalic-webfont.svg
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_lightitalic_macroman/OpenSans-LightItalic-webfont.svg
rename to BeyondResponsiveDesign/styles/fonts/opensans_lightitalic_macroman/OpenSans-LightItalic-webfont.svg
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_lightitalic_macroman/OpenSans-LightItalic-webfont.ttf b/BeyondResponsiveDesign/styles/fonts/opensans_lightitalic_macroman/OpenSans-LightItalic-webfont.ttf
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_lightitalic_macroman/OpenSans-LightItalic-webfont.ttf
rename to BeyondResponsiveDesign/styles/fonts/opensans_lightitalic_macroman/OpenSans-LightItalic-webfont.ttf
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_lightitalic_macroman/OpenSans-LightItalic-webfont.woff b/BeyondResponsiveDesign/styles/fonts/opensans_lightitalic_macroman/OpenSans-LightItalic-webfont.woff
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_lightitalic_macroman/OpenSans-LightItalic-webfont.woff
rename to BeyondResponsiveDesign/styles/fonts/opensans_lightitalic_macroman/OpenSans-LightItalic-webfont.woff
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_lightitalic_macroman/specimen_files/OpenSans-LightItalic-cleartype.png b/BeyondResponsiveDesign/styles/fonts/opensans_lightitalic_macroman/specimen_files/OpenSans-LightItalic-cleartype.png
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_lightitalic_macroman/specimen_files/OpenSans-LightItalic-cleartype.png
rename to BeyondResponsiveDesign/styles/fonts/opensans_lightitalic_macroman/specimen_files/OpenSans-LightItalic-cleartype.png
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_lightitalic_macroman/specimen_files/easytabs.js b/BeyondResponsiveDesign/styles/fonts/opensans_lightitalic_macroman/specimen_files/easytabs.js
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_lightitalic_macroman/specimen_files/easytabs.js
rename to BeyondResponsiveDesign/styles/fonts/opensans_lightitalic_macroman/specimen_files/easytabs.js
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_lightitalic_macroman/specimen_files/grid_12-825-55-15.css b/BeyondResponsiveDesign/styles/fonts/opensans_lightitalic_macroman/specimen_files/grid_12-825-55-15.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_lightitalic_macroman/specimen_files/grid_12-825-55-15.css
rename to BeyondResponsiveDesign/styles/fonts/opensans_lightitalic_macroman/specimen_files/grid_12-825-55-15.css
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_lightitalic_macroman/specimen_files/specimen_stylesheet.css b/BeyondResponsiveDesign/styles/fonts/opensans_lightitalic_macroman/specimen_files/specimen_stylesheet.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_lightitalic_macroman/specimen_files/specimen_stylesheet.css
rename to BeyondResponsiveDesign/styles/fonts/opensans_lightitalic_macroman/specimen_files/specimen_stylesheet.css
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_lightitalic_macroman/stylesheet.css b/BeyondResponsiveDesign/styles/fonts/opensans_lightitalic_macroman/stylesheet.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_lightitalic_macroman/stylesheet.css
rename to BeyondResponsiveDesign/styles/fonts/opensans_lightitalic_macroman/stylesheet.css
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_regular_macroman/OpenSans-Regular-demo.html b/BeyondResponsiveDesign/styles/fonts/opensans_regular_macroman/OpenSans-Regular-demo.html
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_regular_macroman/OpenSans-Regular-demo.html
rename to BeyondResponsiveDesign/styles/fonts/opensans_regular_macroman/OpenSans-Regular-demo.html
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_regular_macroman/OpenSans-Regular-webfont.eot b/BeyondResponsiveDesign/styles/fonts/opensans_regular_macroman/OpenSans-Regular-webfont.eot
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_regular_macroman/OpenSans-Regular-webfont.eot
rename to BeyondResponsiveDesign/styles/fonts/opensans_regular_macroman/OpenSans-Regular-webfont.eot
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_regular_macroman/OpenSans-Regular-webfont.svg b/BeyondResponsiveDesign/styles/fonts/opensans_regular_macroman/OpenSans-Regular-webfont.svg
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_regular_macroman/OpenSans-Regular-webfont.svg
rename to BeyondResponsiveDesign/styles/fonts/opensans_regular_macroman/OpenSans-Regular-webfont.svg
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_regular_macroman/OpenSans-Regular-webfont.ttf b/BeyondResponsiveDesign/styles/fonts/opensans_regular_macroman/OpenSans-Regular-webfont.ttf
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_regular_macroman/OpenSans-Regular-webfont.ttf
rename to BeyondResponsiveDesign/styles/fonts/opensans_regular_macroman/OpenSans-Regular-webfont.ttf
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_regular_macroman/OpenSans-Regular-webfont.woff b/BeyondResponsiveDesign/styles/fonts/opensans_regular_macroman/OpenSans-Regular-webfont.woff
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_regular_macroman/OpenSans-Regular-webfont.woff
rename to BeyondResponsiveDesign/styles/fonts/opensans_regular_macroman/OpenSans-Regular-webfont.woff
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_regular_macroman/specimen_files/OpenSans-Regular-cleartype.png b/BeyondResponsiveDesign/styles/fonts/opensans_regular_macroman/specimen_files/OpenSans-Regular-cleartype.png
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_regular_macroman/specimen_files/OpenSans-Regular-cleartype.png
rename to BeyondResponsiveDesign/styles/fonts/opensans_regular_macroman/specimen_files/OpenSans-Regular-cleartype.png
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_regular_macroman/specimen_files/easytabs.js b/BeyondResponsiveDesign/styles/fonts/opensans_regular_macroman/specimen_files/easytabs.js
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_regular_macroman/specimen_files/easytabs.js
rename to BeyondResponsiveDesign/styles/fonts/opensans_regular_macroman/specimen_files/easytabs.js
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_regular_macroman/specimen_files/grid_12-825-55-15.css b/BeyondResponsiveDesign/styles/fonts/opensans_regular_macroman/specimen_files/grid_12-825-55-15.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_regular_macroman/specimen_files/grid_12-825-55-15.css
rename to BeyondResponsiveDesign/styles/fonts/opensans_regular_macroman/specimen_files/grid_12-825-55-15.css
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_regular_macroman/specimen_files/specimen_stylesheet.css b/BeyondResponsiveDesign/styles/fonts/opensans_regular_macroman/specimen_files/specimen_stylesheet.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_regular_macroman/specimen_files/specimen_stylesheet.css
rename to BeyondResponsiveDesign/styles/fonts/opensans_regular_macroman/specimen_files/specimen_stylesheet.css
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_regular_macroman/stylesheet.css b/BeyondResponsiveDesign/styles/fonts/opensans_regular_macroman/stylesheet.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_regular_macroman/stylesheet.css
rename to BeyondResponsiveDesign/styles/fonts/opensans_regular_macroman/stylesheet.css
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibold_macroman/OpenSans-Semibold-demo.html b/BeyondResponsiveDesign/styles/fonts/opensans_semibold_macroman/OpenSans-Semibold-demo.html
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibold_macroman/OpenSans-Semibold-demo.html
rename to BeyondResponsiveDesign/styles/fonts/opensans_semibold_macroman/OpenSans-Semibold-demo.html
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibold_macroman/OpenSans-Semibold-webfont.eot b/BeyondResponsiveDesign/styles/fonts/opensans_semibold_macroman/OpenSans-Semibold-webfont.eot
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibold_macroman/OpenSans-Semibold-webfont.eot
rename to BeyondResponsiveDesign/styles/fonts/opensans_semibold_macroman/OpenSans-Semibold-webfont.eot
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibold_macroman/OpenSans-Semibold-webfont.svg b/BeyondResponsiveDesign/styles/fonts/opensans_semibold_macroman/OpenSans-Semibold-webfont.svg
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibold_macroman/OpenSans-Semibold-webfont.svg
rename to BeyondResponsiveDesign/styles/fonts/opensans_semibold_macroman/OpenSans-Semibold-webfont.svg
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibold_macroman/OpenSans-Semibold-webfont.ttf b/BeyondResponsiveDesign/styles/fonts/opensans_semibold_macroman/OpenSans-Semibold-webfont.ttf
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibold_macroman/OpenSans-Semibold-webfont.ttf
rename to BeyondResponsiveDesign/styles/fonts/opensans_semibold_macroman/OpenSans-Semibold-webfont.ttf
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibold_macroman/OpenSans-Semibold-webfont.woff b/BeyondResponsiveDesign/styles/fonts/opensans_semibold_macroman/OpenSans-Semibold-webfont.woff
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibold_macroman/OpenSans-Semibold-webfont.woff
rename to BeyondResponsiveDesign/styles/fonts/opensans_semibold_macroman/OpenSans-Semibold-webfont.woff
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibold_macroman/specimen_files/OpenSans-Semibold-cleartype.png b/BeyondResponsiveDesign/styles/fonts/opensans_semibold_macroman/specimen_files/OpenSans-Semibold-cleartype.png
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibold_macroman/specimen_files/OpenSans-Semibold-cleartype.png
rename to BeyondResponsiveDesign/styles/fonts/opensans_semibold_macroman/specimen_files/OpenSans-Semibold-cleartype.png
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibold_macroman/specimen_files/easytabs.js b/BeyondResponsiveDesign/styles/fonts/opensans_semibold_macroman/specimen_files/easytabs.js
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibold_macroman/specimen_files/easytabs.js
rename to BeyondResponsiveDesign/styles/fonts/opensans_semibold_macroman/specimen_files/easytabs.js
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibold_macroman/specimen_files/grid_12-825-55-15.css b/BeyondResponsiveDesign/styles/fonts/opensans_semibold_macroman/specimen_files/grid_12-825-55-15.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibold_macroman/specimen_files/grid_12-825-55-15.css
rename to BeyondResponsiveDesign/styles/fonts/opensans_semibold_macroman/specimen_files/grid_12-825-55-15.css
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibold_macroman/specimen_files/specimen_stylesheet.css b/BeyondResponsiveDesign/styles/fonts/opensans_semibold_macroman/specimen_files/specimen_stylesheet.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibold_macroman/specimen_files/specimen_stylesheet.css
rename to BeyondResponsiveDesign/styles/fonts/opensans_semibold_macroman/specimen_files/specimen_stylesheet.css
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibold_macroman/stylesheet.css b/BeyondResponsiveDesign/styles/fonts/opensans_semibold_macroman/stylesheet.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibold_macroman/stylesheet.css
rename to BeyondResponsiveDesign/styles/fonts/opensans_semibold_macroman/stylesheet.css
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibolditalic_macroman/OpenSans-SemiboldItalic-demo.html b/BeyondResponsiveDesign/styles/fonts/opensans_semibolditalic_macroman/OpenSans-SemiboldItalic-demo.html
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibolditalic_macroman/OpenSans-SemiboldItalic-demo.html
rename to BeyondResponsiveDesign/styles/fonts/opensans_semibolditalic_macroman/OpenSans-SemiboldItalic-demo.html
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibolditalic_macroman/OpenSans-SemiboldItalic-webfont.eot b/BeyondResponsiveDesign/styles/fonts/opensans_semibolditalic_macroman/OpenSans-SemiboldItalic-webfont.eot
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibolditalic_macroman/OpenSans-SemiboldItalic-webfont.eot
rename to BeyondResponsiveDesign/styles/fonts/opensans_semibolditalic_macroman/OpenSans-SemiboldItalic-webfont.eot
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibolditalic_macroman/OpenSans-SemiboldItalic-webfont.svg b/BeyondResponsiveDesign/styles/fonts/opensans_semibolditalic_macroman/OpenSans-SemiboldItalic-webfont.svg
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibolditalic_macroman/OpenSans-SemiboldItalic-webfont.svg
rename to BeyondResponsiveDesign/styles/fonts/opensans_semibolditalic_macroman/OpenSans-SemiboldItalic-webfont.svg
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibolditalic_macroman/OpenSans-SemiboldItalic-webfont.ttf b/BeyondResponsiveDesign/styles/fonts/opensans_semibolditalic_macroman/OpenSans-SemiboldItalic-webfont.ttf
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibolditalic_macroman/OpenSans-SemiboldItalic-webfont.ttf
rename to BeyondResponsiveDesign/styles/fonts/opensans_semibolditalic_macroman/OpenSans-SemiboldItalic-webfont.ttf
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibolditalic_macroman/OpenSans-SemiboldItalic-webfont.woff b/BeyondResponsiveDesign/styles/fonts/opensans_semibolditalic_macroman/OpenSans-SemiboldItalic-webfont.woff
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibolditalic_macroman/OpenSans-SemiboldItalic-webfont.woff
rename to BeyondResponsiveDesign/styles/fonts/opensans_semibolditalic_macroman/OpenSans-SemiboldItalic-webfont.woff
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibolditalic_macroman/specimen_files/OpenSans-SemiboldItalic-cleartype.png b/BeyondResponsiveDesign/styles/fonts/opensans_semibolditalic_macroman/specimen_files/OpenSans-SemiboldItalic-cleartype.png
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibolditalic_macroman/specimen_files/OpenSans-SemiboldItalic-cleartype.png
rename to BeyondResponsiveDesign/styles/fonts/opensans_semibolditalic_macroman/specimen_files/OpenSans-SemiboldItalic-cleartype.png
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibolditalic_macroman/specimen_files/easytabs.js b/BeyondResponsiveDesign/styles/fonts/opensans_semibolditalic_macroman/specimen_files/easytabs.js
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibolditalic_macroman/specimen_files/easytabs.js
rename to BeyondResponsiveDesign/styles/fonts/opensans_semibolditalic_macroman/specimen_files/easytabs.js
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibolditalic_macroman/specimen_files/grid_12-825-55-15.css b/BeyondResponsiveDesign/styles/fonts/opensans_semibolditalic_macroman/specimen_files/grid_12-825-55-15.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibolditalic_macroman/specimen_files/grid_12-825-55-15.css
rename to BeyondResponsiveDesign/styles/fonts/opensans_semibolditalic_macroman/specimen_files/grid_12-825-55-15.css
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibolditalic_macroman/specimen_files/specimen_stylesheet.css b/BeyondResponsiveDesign/styles/fonts/opensans_semibolditalic_macroman/specimen_files/specimen_stylesheet.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibolditalic_macroman/specimen_files/specimen_stylesheet.css
rename to BeyondResponsiveDesign/styles/fonts/opensans_semibolditalic_macroman/specimen_files/specimen_stylesheet.css
diff --git a/BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibolditalic_macroman/stylesheet.css b/BeyondResponsiveDesign/styles/fonts/opensans_semibolditalic_macroman/stylesheet.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/fonts/opensans_semibolditalic_macroman/stylesheet.css
rename to BeyondResponsiveDesign/styles/fonts/opensans_semibolditalic_macroman/stylesheet.css
diff --git a/BeyondResponsiveDesign.Menus/styles/styles.css b/BeyondResponsiveDesign/styles/styles.css
similarity index 88%
rename from BeyondResponsiveDesign.Menus/styles/styles.css
rename to BeyondResponsiveDesign/styles/styles.css
index 169f260..4757afd 100644
--- a/BeyondResponsiveDesign.Menus/styles/styles.css
+++ b/BeyondResponsiveDesign/styles/styles.css
@@ -1,4 +1,4 @@
-html {
+html {
position: fixed;
width: 100%;
height: 100%;
@@ -11,15 +11,14 @@ body {
bottom: 0;
overflow: hidden;
}
+.center {
+ margin-left: auto;
+ margin-right: auto;
+ text-align: center;
+}
.scrollcontainer {
overflow: hidden;
}
-.scrollcontainer > .scrollcontainer {
- height: 100%;
-}
-.scrollcontainer > .scrollcontainer > .wrapper {
- xmin-height: 100%;
-}
.vscroll {
overflow-y: auto;
-webkit-overflow-scrolling: touch;
@@ -36,35 +35,6 @@ body {
display: inline-block;
min-width: 100%;
}
-.modalbackground,
-.popupbackground {
- position: absolute;
- top: 0;
- left: 0;
- right: 0;
- bottom: 0;
- background-color: #000000;
- opacity: 0.4;
- z-index: 100000;
-}
-.popupbackground {
- top: 3em;
-}
-div.popup {
- z-index: 9999999;
- background: white;
- position: absolute;
- visibility: hidden;
- display: none;
- max-width: 37.5rem;
- min-width: 12.5rem;
-}
-div.popup.active {
- visibility: visible;
-}
-div.popup > ul > li {
- float: none;
-}
body > header {
position: absolute;
top: 0;
@@ -83,8 +53,14 @@ body > header > h1 {
width: 100%;
}
body > header > ul {
- float: left;
height: 3em;
+ margin: 0;
+ padding: 0;
+}
+body > header > ul.headerIcons {
+ position: absolute;
+ right: 0;
+ bottom: 0;
}
body > header > ul > li {
line-height: 3em;
@@ -104,6 +80,9 @@ body > header > ul > li.navigator {
min-width: 5em;
left: -0.5em;
}
+body > header > ul > li > h2 {
+ margin: 0;
+}
body > header > ul > li > a {
line-height: 3em;
}
@@ -118,9 +97,9 @@ body > header > ul > li.logo > a {
body > header > ul > li.logo > a > img {
border: 0 none;
height: 2rem;
- max-height: 2rem;
+ max-height: 1.8rem;
max-width: 15rem;
- padding: 0.5rem 0 0 0.3rem;
+ padding: 0.6rem 0 0 0.3rem;
}
body > nav {
position: absolute;
@@ -148,12 +127,6 @@ body > main > article {
bottom: 0;
overflow: hidden;
}
-body > main > article > .scrollcontainer {
- height: 100%;
-}
-body > main > article > .scrollcontainer > .wrapper {
- xmin-height: 100%;
-}
body > main > article > .slideTabContainer > .slideTab {
display: none;
}
@@ -196,9 +169,39 @@ body > main > article > nav.toolbar > header {
body > main > article > nav.toolbar > ul {
min-height: 3em;
height: 3em;
+ overflow-x: hidden;
+ overflow-y: hidden;
+ white-space: nowrap;
}
body > main > article > nav.toolbar > ul > li {
- display: block;
- float: left;
+ display: inline-block;
+}
+.modalbackground,
+.popupbackground {
+ position: absolute;
+ top: 0;
+ left: 0;
+ right: 0;
+ bottom: 0;
+ background-color: #000000;
+ opacity: 0.4;
+ z-index: 100000;
+}
+.popupbackground {
+ top: 3em;
+}
+div.popup {
+ z-index: 9999999;
+ background: white;
+ position: absolute;
+ visibility: hidden;
+ display: none;
+ max-width: 37.5rem;
+ min-width: 12.5rem;
+}
+div.popup.active {
+ visibility: visible;
+}
+div.popup > ul > li {
+ float: none;
}
-/*# sourceMappingURL=styles.css.map */
\ No newline at end of file
diff --git a/BeyondResponsiveDesign/styles/styles.css.map b/BeyondResponsiveDesign/styles/styles.css.map
new file mode 100644
index 0000000..4560cbb
--- /dev/null
+++ b/BeyondResponsiveDesign/styles/styles.css.map
@@ -0,0 +1 @@
+{"version":3,"sources":["styles.less"],"names":[],"mappings":"AAYA;EACI,eAAA;EACA,WAAA;EACA,YAAA;;AAGJ;EAbI,kBAAA;EACA,MAAA;EACA,OAAA;EACA,QAAA;EACA,SAAA;EAWA,gBAAA;;AAGJ;EACI,gBAAA;;AADJ,gBAGI;EACI,YAAA;;AAJR,gBAGI,mBAGI;EACI,iBAAA;;AAKZ;EACI,gBAAA;EACA,iCAAA;;AAGJ;EACI,kBAAA;EACA,iCAAA;;AAGJ;EACI,gBAAA;EACA,iCAAA;;AAEA,QAAE;EACE,qBAAA;EACA,eAAA;;AAIR;AAAkB;EAlDd,kBAAA;EACA,MAAA;EACA,OAAA;EACA,QAAA;EACA,SAAA;EAgDA,yBAAA;EACA,YAAA;EACA,eAAA;;AAGJ;EACI,QAAA;;AAGJ,GAAG;EACC,gBAAA;EACA,iBAAA;EACA,kBAAA;EACA,kBAAA;EACA,aAAA;EACA,kBAAA;EACA,kBAAA;;AAEA,GATD,MASE;EACG,mBAAA;;AAVR,GAAG,MAaC,KAAK;EACD,WAAA;;AAIR,IAAK;EA/ED,kBAAA;EACA,MAAA;EACA,OAAA;EACA,QAAA;EACA,SAAA;EA6EA,UAAA;EACA,WAAA;EACA,WAAA;EACA,WAAA;;AALJ,IAAK,SAOD;EACI,kBAAA;EACA,MAAA;EACA,OAAA;EACA,WAAA;;AAXR,IAAK,SAcD;EACI,WAAA;EACA,WAAA;;AAhBR,IAAK,SAcD,KAII;EACI,gBAAA;EACA,WAAA;EACA,qBAAA;;AAEA,IAvBP,SAcD,KAII,KAKK;EACG,aAAA;EACA,kBAAA;EACA,UAAA;EACA,cAAA;;AAGJ,IA9BP,SAcD,KAII,KAYK;EACG,aAAA;EACA,kBAAA;EACA,UAAA;EACA,cAAA;EACA,YAAA;;AAnChB,IAAK,SAcD,KAII,KAoBI;EACI,gBAAA;;AAvChB,IAAK,SAcD,KA6BI,KAAI,KAAM;EACN,kBAAA;EACA,MAAA;EACA,OAAA;EACA,cAAA;EACA,WAAA;EACA,UAAA;;AAjDZ,IAAK,SAcD,KA6BI,KAAI,KAAM,IAQN;EACI,cAAA;EACA,YAAA;EACA,kBAAA;EACA,gBAAA;EACA,0BAAA;;AAMhB,IAAK;EA7ID,kBAAA;EACA,QAAA;EACA,OAAA;EACA,QAAA;EACA,SAAA;EA2IA,aAAA;EACA,iBAAA;EACA,UAAA;EACA,uBAAA;;AAGJ,IAAK;EArJD,kBAAA;EACA,QAAA;EACA,OAAA;EACA,QAAA;EACA,SAAA;;AAiJJ,IAAK,OAGD;EAxJA,kBAAA;EACA,MAAA;EACA,YAAA;EACA,QAAA;EACA,SAAA;EAeA,gBAAA;;AAkIJ,IAAK,OAGD,UAnIA;EACI,YAAA;;AA+HR,IAAK,OAGD,UAnIA,mBAGI;EACI,iBAAA;;AA4HZ,IAAK,OAGD,UAII,qBAAqB;EACjB,aAAA;;AAEA,IAVP,OAGD,UAII,qBAAqB,YAGhB;EACG,cAAA;;AAOhB,IAAK,OAAO,QAAO;EACf,kBAAA;EACA,MAAA;EACA,QAAA;EACA,UAAA;EACA,SAAA;EACA,gBAAA;EACA,eAAA;EACA,aAAA;;AAEA,IAVC,OAAO,QAAO,cAUd;EACG,cAAA;;AAGJ,IAdC,OAAO,QAAO,cAcd;EACG,UAAA;;AAfR,IAAK,OAAO,QAAO,cAkBf;EAzLA,kBAAA;EACA,MAAA;EACA,OAAA;EACA,QAAA;EACA,SAAA;EAuLI,uBAAA;;AAIR,IAAK,OAAO,UAAU,MAAK;EACvB,kBAAA;EACA,eAAA;;AAFJ,IAAK,OAAO,UAAU,MAAK,QAIvB;EACI,WAAA;EACA,eAAA;EACA,WAAA;;AAPR,IAAK,OAAO,UAAU,MAAK,QAUvB;EACI,eAAA;EACA,WAAA;;AAZR,IAAK,OAAO,UAAU,MAAK,QAUvB,KAII;EACI,cAAA;EACA,WAAA","file":"styles.css"}
\ No newline at end of file
diff --git a/BeyondResponsiveDesign.Menus/styles/styles.less b/BeyondResponsiveDesign/styles/styles.less
similarity index 79%
rename from BeyondResponsiveDesign.Menus/styles/styles.less
rename to BeyondResponsiveDesign/styles/styles.less
index 16ab530..ef1031e 100644
--- a/BeyondResponsiveDesign.Menus/styles/styles.less
+++ b/BeyondResponsiveDesign/styles/styles.less
@@ -21,16 +21,14 @@ body {
overflow: hidden;
}
+.center {
+ margin-left: auto;
+ margin-right: auto;
+ text-align: center;
+}
+
.scrollcontainer {
overflow: hidden;
-
- > .scrollcontainer {
- height: 100%;
-
- > .wrapper {
- xmin-height: 100%;
- }
- }
}
.vscroll {
@@ -53,35 +51,6 @@ body {
}
}
-.modalbackground, .popupbackground {
- .originFixed;
- background-color: #000000;
- opacity: 0.4;
- z-index: 100000;
-}
-
-.popupbackground {
- top: @header-height;
-}
-
-div.popup {
- z-index: 9999999;
- background: white;
- position: absolute;
- visibility: hidden;
- display: none;
- max-width: 37.5rem;
- min-width: 12.5rem;
-
- &.active {
- visibility: visible;
- }
-
- > ul > li {
- float: none;
- }
-}
-
body > header {
.originFixed;
z-index: 4;
@@ -97,8 +66,15 @@ body > header {
}
> ul {
- float: left;
height: @header-height;
+ margin: 0;
+ padding: 0;
+
+ &.headerIcons {
+ position: absolute;
+ right: 0;
+ bottom: 0;
+ }
> li {
line-height: @header-height;
@@ -120,6 +96,10 @@ body > header {
left: -0.5em;
}
+ > h2 {
+ margin: 0;
+ }
+
> a {
line-height: @header-height;
}
@@ -136,9 +116,9 @@ body > header {
> img {
border: 0 none;
height: 2rem;
- max-height: 2rem;
+ max-height: 1.8rem;
max-width: 15rem;
- padding: 0.5rem 0 0 0.3rem;
+ padding: 0.6rem 0 0 0.3rem;
}
}
}
@@ -167,7 +147,6 @@ body > main {
}
}
}
-
}
body > main > aside.propertySheet {
@@ -207,10 +186,41 @@ body > main > article > nav.toolbar {
> ul {
min-height: @toolbar-height;
height: @toolbar-height;
+ overflow-x: hidden;
+ overflow-y: hidden;
+ white-space: nowrap;
> li {
- display: block;
- float: left;
+ display: inline-block;
}
}
}
+
+.modalbackground, .popupbackground {
+ .originFixed;
+ background-color: #000000;
+ opacity: 0.4;
+ z-index: 100000;
+}
+
+.popupbackground {
+ top: @header-height;
+}
+
+div.popup {
+ z-index: 9999999;
+ background: white;
+ position: absolute;
+ visibility: hidden;
+ display: none;
+ max-width: 37.5rem;
+ min-width: 12.5rem;
+
+ &.active {
+ visibility: visible;
+ }
+
+ > ul > li {
+ float: none;
+ }
+}
\ No newline at end of file
diff --git a/BeyondResponsiveDesign.Menus/styles/styles.min.css b/BeyondResponsiveDesign/styles/styles.min.css
similarity index 54%
rename from BeyondResponsiveDesign.Menus/styles/styles.min.css
rename to BeyondResponsiveDesign/styles/styles.min.css
index 84c5969..083749d 100644
--- a/BeyondResponsiveDesign.Menus/styles/styles.min.css
+++ b/BeyondResponsiveDesign/styles/styles.min.css
@@ -1 +1 @@
-html{position:fixed;width:100%;height:100%}body{position:absolute;top:0;left:0;right:0;bottom:0;overflow:hidden}.scrollcontainer{overflow:hidden}.scrollcontainer>.scrollcontainer{height:100%}.scrollcontainer>.scrollcontainer>.wrapper{xmin-height:100%}.vscroll{overflow-y:auto;-webkit-overflow-scrolling:touch}.vscroll-scroll{overflow-y:scroll;-webkit-overflow-scrolling:touch}.hscroll{overflow-x:auto;-webkit-overflow-scrolling:touch}.hscroll>.wrapper{display:inline-block;min-width:100%}.modalbackground,.popupbackground{position:absolute;top:0;left:0;right:0;bottom:0;background-color:#000;opacity:.4;z-index:100000}.popupbackground{top:3em}div.popup{z-index:9999999;background:#fff;position:absolute;visibility:hidden;display:none;max-width:37.5rem;min-width:12.5rem}div.popup.active{visibility:visible}div.popup>ul>li{float:none}body>header{position:absolute;top:0;left:0;right:0;bottom:0;z-index:4;height:3em;float:left;width:100%}body>header>h1{position:absolute;top:0;left:0;width:100%}body>header>ul{float:left;height:3em}body>header>ul>li{line-height:3em;height:3em;display:inline-block}body>header>ul>li.menuToggle{display:none;position:absolute;z-index:2;min-width:5em}body>header>ul>li.navigator{display:none;position:absolute;z-index:2;min-width:5em;left:-.5em}body>header>ul>li>a{line-height:3em}body>header>ul>li.logo>a{position:relative;top:0;left:0;display:block;height:3em;z-index:1}body>header>ul>li.logo>a>img{border:0 none;height:2rem;max-height:2rem;max-width:15rem;padding:.5rem 0 0 .3rem}body>nav{position:absolute;top:3em;left:0;right:0;bottom:0;width:16.5em;max-width:16.5em;z-index:2;background-color:#fff}body>main{position:absolute;top:3em;left:0;right:0;bottom:0}body>main>article{position:absolute;top:0;left:16.5em;right:0;bottom:0;overflow:hidden}body>main>article>.scrollcontainer{height:100%}body>main>article>.scrollcontainer>.wrapper{xmin-height:100%}body>main>article>.slideTabContainer>.slideTab{display:none}body>main>article>.slideTabContainer>.slideTab.active{display:block}body>main>aside.propertySheet{position:absolute;top:0;right:0;width:50%;bottom:0;min-width:480px;z-index:100001;display:none}body>main>aside.propertySheet.active{display:block}body>main>aside.propertySheet.wide{width:75%}body>main>aside.propertySheet>div{position:absolute;top:0;left:0;right:0;bottom:0;background-color:#fff}body>main>article>nav.toolbar{position:relative;min-height:3em}body>main>article>nav.toolbar>header{float:left;min-height:3em;height:3em}body>main>article>nav.toolbar>ul{min-height:3em;height:3em}body>main>article>nav.toolbar>ul>li{display:block;float:left}
\ No newline at end of file
+html{position:fixed;width:100%;height:100%}body{position:absolute;top:0;left:0;right:0;bottom:0;overflow:hidden}.scrollcontainer{overflow:hidden}.scrollcontainer>.scrollcontainer{height:100%}.scrollcontainer>.scrollcontainer>.wrapper{xmin-height:100%}.vscroll{overflow-y:auto;-webkit-overflow-scrolling:touch}.vscroll-scroll{overflow-y:scroll;-webkit-overflow-scrolling:touch}.hscroll{overflow-x:auto;-webkit-overflow-scrolling:touch}.hscroll>.wrapper{display:inline-block;min-width:100%}.modalbackground,.popupbackground{position:absolute;top:0;left:0;right:0;bottom:0;background-color:#000;opacity:.4;z-index:100000}.popupbackground{top:3em}div.popup{z-index:9999999;background:#fff;position:absolute;visibility:hidden;display:none;max-width:37.5rem;min-width:12.5rem}div.popup.active{visibility:visible}div.popup>ul>li{float:none}body>header{position:absolute;top:0;left:0;right:0;bottom:0;z-index:4;height:3em;float:left;width:100%}body>header>h1{position:absolute;top:0;left:0;width:100%}body>header>ul{float:left;height:3em}body>header>ul>li{line-height:3em;height:3em;display:inline-block}body>header>ul>li.menuToggle{display:none;position:absolute;z-index:2;min-width:5em}body>header>ul>li.navigator{display:none;position:absolute;z-index:2;min-width:5em;left:-.5em}body>header>ul>li>a{line-height:3em}body>header>ul>li.logo>a{position:relative;top:0;left:0;display:block;height:3em;z-index:1}body>header>ul>li.logo>a>img{border:0 none;height:2rem;max-height:1.8rem;max-width:15rem;padding:.6rem 0 0 .3rem}body>nav{position:absolute;top:3em;left:0;right:0;bottom:0;width:16.5em;max-width:16.5em;z-index:2;background-color:#fff}body>main{position:absolute;top:3em;left:0;right:0;bottom:0}body>main>article{position:absolute;top:0;left:16.5em;right:0;bottom:0;overflow:hidden}body>main>article>.scrollcontainer{height:100%}body>main>article>.scrollcontainer>.wrapper{xmin-height:100%}body>main>article>.slideTabContainer>.slideTab{display:none}body>main>article>.slideTabContainer>.slideTab.active{display:block}body>main>aside.propertySheet{position:absolute;top:0;right:0;width:50%;bottom:0;min-width:480px;z-index:100001;display:none}body>main>aside.propertySheet.active{display:block}body>main>aside.propertySheet.wide{width:75%}body>main>aside.propertySheet>div{position:absolute;top:0;left:0;right:0;bottom:0;background-color:#fff}body>main>article>nav.toolbar{position:relative;min-height:3em}body>main>article>nav.toolbar>header{float:left;min-height:3em;height:3em}body>main>article>nav.toolbar>ul{min-height:3em;height:3em}body>main>article>nav.toolbar>ul>li{display:block;float:left}
\ No newline at end of file
diff --git a/BeyondResponsiveDesign.Menus/styles/theme.css b/BeyondResponsiveDesign/styles/theme.css
similarity index 81%
rename from BeyondResponsiveDesign.Menus/styles/theme.css
rename to BeyondResponsiveDesign/styles/theme.css
index e11e98f..fcd4045 100644
--- a/BeyondResponsiveDesign.Menus/styles/theme.css
+++ b/BeyondResponsiveDesign/styles/theme.css
@@ -1,4 +1,4 @@
-@font-face {
+@font-face {
font-family: 'OpenSans';
src: url('fonts/opensans_regular_macroman/OpenSans-Regular-webfont.eot');
src: url('fonts/opensans_regular_macroman/OpenSans-Regular-webfont.eot?iefix') format('eot'), url('fonts/opensans_regular_macroman/OpenSans-Regular-webfont.woff') format('woff'), url('fonts/opensans_regular_macroman/OpenSans-Regular-webfont.ttf') format('truetype'), url('fonts/opensans_regular_macroman/OpenSans-Regular-webfont.svg#webfont') format('svg');
@@ -18,7 +18,7 @@ body {
margin: 0;
}
a {
- color: #005800;
+ color: #00c86f;
font-weight: 350;
text-decoration: none;
-webkit-tap-highlight-color: rgba(0, 0, 0, 0);
@@ -39,7 +39,7 @@ h3 {
display: block;
}
a:hover {
- color: #31a431;
+ color: #12b26b;
}
table {
width: 100%;
@@ -54,17 +54,6 @@ table.agenda > tbody > tr:not(.session) {
cursor: auto;
color: #999999;
}
-table.accommodation > tbody > tr > td {
- display: block;
- float: left;
-}
-table.accommodation > tbody > tr > td > img {
- -webkit-border-radius: 10px;
- -moz-border-radius: 10px;
- -ms-border-radius: 10px;
- -o-border-radius: 10px;
- border-radius: 10px;
-}
table > tbody > tr {
border-bottom: 1px solid #f2f2f2;
cursor: pointer;
@@ -74,6 +63,7 @@ table > tbody > tr > td {
padding: 0.5em 0.5em 0.5em 0.5em;
overflow: hidden;
min-height: 3rem;
+ min-width: 6em;
}
table > tbody > tr > td > h2 {
font-weight: 400;
@@ -126,7 +116,7 @@ div.popup > ul > li > a {
text-overflow: ellipsis;
}
body > header {
- background: #005800;
+ background: #00c86f;
box-shadow: rgba(0, 0, 0, 0.4) 0 1px 0.25rem;
clip: rect(auto, auto, 3.375em, auto);
}
@@ -139,19 +129,17 @@ body > header > h1 {
margin: 0 auto;
}
body > header > ul {
- float: left;
color: #ffffff;
- margin: 0;
- padding: 0;
list-style-type: none;
white-space: nowrap;
}
-body > header > ul.headerIcons {
- float: right;
+body > header > ul:not(.headerIcons) {
+ margin-right: 2em;
}
body > header > ul > li {
+ display: inline;
+ overflow: hidden;
position: relative;
- float: left;
margin: 0;
white-space: nowrap;
text-align: left;
@@ -162,6 +150,8 @@ body > header > ul > li {
font-size: 1em;
}
body > header > ul > li > h2 {
+ overflow: hidden;
+ text-overflow: ellipsis;
color: #ffffff;
font-weight: 400;
}
@@ -192,7 +182,7 @@ body > header > ul > li > a:hover {
body > header > ul > li.active {
color: #607d8b;
cursor: pointer;
- background: #227122;
+ background: #007f47;
}
body > nav {
background-color: #f2f2f2;
@@ -200,14 +190,14 @@ body > nav {
padding: 0;
margin: 0;
}
-body > nav > div > div > ul {
+body > nav > div > ul {
list-style-type: none;
text-indent: 0;
margin: 0;
padding: 0;
width: 100%;
}
-body > nav > div > div > ul > li {
+body > nav > div > ul > li {
color: #666666;
text-indent: 0;
padding: 0;
@@ -215,14 +205,14 @@ body > nav > div > div > ul > li {
vertical-align: middle;
position: relative;
}
-body > nav > div > div > ul > li img {
+body > nav > div > ul > li img {
vertical-align: middle;
}
-body > nav > div > div > ul > li > a {
+body > nav > div > ul > li > a {
position: relative;
z-index: 2;
}
-body > nav > div > div > ul > li > a > h2 {
+body > nav > div > ul > li > a > h2 {
font-size: 1em;
font-weight: 400;
vertical-align: middle;
@@ -238,32 +228,32 @@ body > nav > div > div > ul > li > a > h2 {
overflow: hidden;
position: relative;
}
-body > nav > div > div > ul > li > a > h2 > span {
+body > nav > div > ul > li > a > h2 > span {
white-space: nowrap;
overflow: hidden;
-ms-text-overflow: ellipsis;
-o-text-overflow: ellipsis;
text-overflow: ellipsis;
}
-body > nav > div > div > ul > li > a > h2 > i.fa {
+body > nav > div > ul > li > a > h2 > i.fa {
float: left;
outline: none;
line-height: 3rem;
font-size: 1.1875rem;
width: 1.5rem;
}
-body > nav > div > div > ul > li > div {
+body > nav > div > ul > li > div {
overflow: hidden;
/*height: 0;*/
height: auto;
}
-body > nav > div > div > ul > li > div > ul {
+body > nav > div > ul > li > div > ul {
list-style-type: none;
text-indent: 0;
margin: 0;
padding: 0;
}
-body > nav > div > div > ul > li > div > ul > li {
+body > nav > div > ul > li > div > ul > li {
font-size: 0.875em;
line-height: 2rem;
text-indent: 0;
@@ -273,7 +263,7 @@ body > nav > div > div > ul > li > div > ul > li {
color: #666666;
position: relative;
}
-body > nav > div > div > ul > li > div > ul > li > a {
+body > nav > div > ul > li > div > ul > li > a {
display: block;
margin: 0;
padding: 0 0.75rem 0 1.5rem;
@@ -285,41 +275,41 @@ body > nav > div > div > ul > li > div > ul > li > a {
-o-text-overflow: ellipsis;
text-overflow: ellipsis;
}
-body > nav > div > div > ul > li > div > ul > li > a > i.fa {
+body > nav > div > ul > li > div > ul > li > a > i.fa {
float: left;
outline: none;
line-height: 2rem;
width: 1.25rem;
max-width: 1.25rem;
}
-body > nav > div > div > ul > li > div > ul > li > a:hover {
+body > nav > div > ul > li > div > ul > li > a:hover {
color: #999999;
}
-body > nav > div > div > ul > li > div > ul > li.active > a {
+body > nav > div > ul > li > div > ul > li.active > a {
color: #ffffff;
}
-body > nav > div > div > ul > li.active > div {
+body > nav > div > ul > li.active > div {
overflow: hidden;
height: auto;
}
-body > nav > div > div > ul > li.active > div > ul > li.active {
- background-color: #31a431;
+body > nav > div > ul > li.active > div > ul > li.active {
+ background-color: #12b26b;
color: #ffffff;
}
-body > nav > div > div > ul > li.active > div > ul > li.active > a {
+body > nav > div > ul > li.active > div > ul > li.active > a {
color: #ffffff;
}
-body > nav > div > div > ul > li.active > a {
+body > nav > div > ul > li.active > a {
color: #ffffff;
text-decoration: none;
- background-color: #227122;
+ background-color: #007f47;
}
-body > nav > div > div > ul > li.active > a > h2 {
+body > nav > div > ul > li.active > a > h2 {
color: #ffffff;
text-decoration: none;
- background-color: #227122;
+ background-color: #007f47;
}
-body > nav > div > div > ul > li.active > a > h2 > i[data-icon="add"] {
+body > nav > div > ul > li.active > a > h2 > i[data-icon="add"] {
background-image: url('../images/plus_white.svg');
}
body > main {
@@ -349,7 +339,7 @@ body > main section > header > h2 > i.fa {
font-size: 1.5rem;
}
body > main section > header > h2 > span {
- padding: 0 3.75rem 0 1rem;
+ padding: 0 0 0 1rem;
font-weight: 400;
font-size: 1.125rem;
text-indent: 0;
@@ -367,7 +357,7 @@ body > main > article > nav.toolbar > header {
}
body > main > article > nav.toolbar > ul {
list-style-type: none;
- padding: 0 1em 0 1em;
+ padding: 0 1em 0 0.7em;
background: #f2f2f2;
margin: 0;
}
@@ -393,7 +383,7 @@ body > main > article > nav.toolbar > ul > li > .highlight {
position: relative;
top: 2.70em;
height: 1px;
- border-bottom: 5px solid #227122;
+ border-bottom: 5px solid #007f47;
}
body > main > article > nav.toolbar > ul > li.active > .highlight {
visibility: visible;
@@ -413,9 +403,8 @@ body > main > article > nav.toolbar > ul > li > a {
}
body > main > article > nav.toolbar > ul > li > a > i {
font-weight: 300;
- padding-right: 0.28571429em;
+ padding-right: 0.28571429;
}
body > main > article > nav.toolbar > ul > li > a:hover {
color: #b3b3b3;
}
-/*# sourceMappingURL=theme.css.map */
\ No newline at end of file
diff --git a/BeyondResponsiveDesign/styles/theme.css.map b/BeyondResponsiveDesign/styles/theme.css.map
new file mode 100644
index 0000000..8ade16b
--- /dev/null
+++ b/BeyondResponsiveDesign/styles/theme.css.map
@@ -0,0 +1 @@
+{"version":3,"sources":["theme.less"],"names":[],"mappings":"AAmCA;EACI,aAAa,UAAb;EACA,SAAS,+DAAT;EACA,SAAS,sEAAsE,OAAO,YAAY,iEAAiE,OAAO,aAAa,gEAAgE,OAAO,iBAAiB,wEAAwE,OAAO,MAA9V;;AAGJ;EACI,2BAAA;EACA,wBAAA;EACA,uBAAA;EACA,sBAAA;EACA,mBAAA;;AAGJ;EACI,aArCQ,YAAW,kBAAiB,aAAY,SAAQ,YAqCxD;EACA,cAAA;EACA,gBAAA;EACA,gBAAA;EACA,SAAA;;AAGJ;EACI,cAAA;EACA,gBAAA;EACA,qBAAA;EACA,6CAAA;;AAGJ;EACI,mBAAA;EACA,UAAA;EACA,oBAAA;;AAGJ;AAAI;AAAI;EACJ,aA1DQ,YAAW,kBAAiB,aAAY,SAAQ,YA0DxD;EACA,kBAAA;EACA,uBAAA;EACA,UAAA;EACA,cAAA;EACA,cAAA;;AAGJ,CAAC;EACG,cAAA;;AAGJ;EACI,WAAA;EACA,yBAAA;EACA,iBAAA;EACA,UAAA;EACA,SAAA;EACA,iBAAA;EACA,kBAAA;;AAEA,KAAC,OAAQ,QAAQ,KAAI,IAAI;EACrB,YAAA;EACA,cAAA;;AAGJ,KAAC,cAAe,QAAQ,KAAK;EACzB,cAAA;EACA,WAAA;;AAGJ,KAAC,cAAe,QAAQ,KAAK,KAAK;EA5DlC,2BAAA;EACA,wBAAA;EACA,uBAAA;EACA,sBAAA;EACA,mBAAA;;AAqCJ,KAuBI,QAAQ;EACJ,gCAAA;EACA,eAAA;;AAzBR,KAuBI,QAAQ,KAIJ;EACI,mBAAA;EACA,gCAAA;EACA,gBAAA;EACA,gBAAA;;AA/BZ,KAuBI,QAAQ,KAIJ,KAMI;EACI,gBAAA;EACA,WAAA;;AAMhB,GAAG;EACC,mBAAA;EACA,gBAAA;EACA,2BAAA;EACA,8CAAA;EACA,sCAAA;EACA,kBAAA;EACA,cAAA;EACA,UAAA;;AARJ,GAAG,MAUC;EACI,qBAAA;EACA,cAAA;EACA,UAAA;EACA,SAAA;;AAdR,GAAG,MAUC,KAMI;EACI,WAAA;EACA,cAAA;EACA,SAAA;EACA,UAAA;EACA,sBAAA;EACA,cAAA;EACA,eAAA;EACA,cAAA;EACA,WAAA;EACA,gBAAA;EACA,2BAAA;EACA,0BAAA;EACA,uBAAA;EACA,mBAAA;;AAEA,GAhCT,MAUC,KAMI,KAgBK,IAAI;EACD,8BAAA;;AAjChB,GAAG,MAUC,KAMI,KAoBI;EACI,mBAAA;EACA,cAAA;EACA,qBAAA;EACA,cAAA;EACA,4BAAA;EACA,oBAAA;EACA,2BAAA;EACA,0BAAA;EACA,uBAAA;;AAMhB,IAAK;EACD,mBAAA;EACA,4CAAA;EACA,MAAM,+BAAN;;AAHJ,IAAK,SAKD;EACI,gBAAA;EACA,gBAAA;EACA,gBAAA;EACA,cAAA;EACA,kBAAA;EACA,cAAA;;AAXR,IAAK,SAcD;EACI,WAAA;EACA,cAAA;EACA,SAAA;EACA,UAAA;EACA,qBAAA;EACA,mBAAA;;AAEA,IAtBH,SAcD,KAQK;EACG,YAAA;;AAvBZ,IAAK,SAcD,KAYI;EACI,kBAAA;EACA,WAAA;EACA,SAAA;EACA,mBAAA;EACA,gBAAA;EACA,cAAA;EACA,aAAA;EACA,UAAA;EACA,gBAAA;EACA,cAAA;;AApCZ,IAAK,SAcD,KAYI,KAYI;EACI,cAAA;EACA,gBAAA;;AAxChB,IAAK,SAcD,KAYI,KAiBI;EACI,cAAA;EACA,WAAA;EACA,0BAAA;EACA,cAAA;EACA,aAAA;EACA,6CAAA;EACA,SAAA;;AAEA,IApDX,SAcD,KAYI,KAiBI,IASK;EACG,cAAA;;AArDpB,IAAK,SAcD,KAYI,KAiBI,IAaI;EACI,SAAA;EACA,UAAA;;AA1DpB,IAAK,SAcD,KAYI,KAiBI,IAaI,IAII;EACI,mBAAA;;AAIR,IAjEX,SAcD,KAYI,KAiBI,IAsBK;EACG,cAAA;EACA,eAAA;EACA,qBAAA;;AAIR,IAxEP,SAcD,KAYI,KA8CK;EACG,cAAA;EACA,eAAA;EACA,mBAAA;;AAMhB,IAAK;EACD,yBAAA;EACA,6CAAA;EACA,UAAA;EACA,SAAA;;AAJJ,IAAK,MAMD,MAAM,MAAM;EACR,qBAAA;EACA,cAAA;EACA,SAAA;EACA,UAAA;EACA,WAAA;;AAXR,IAAK,MAMD,MAAM,MAAM,KAOR;EACI,cAAA;EACA,cAAA;EACA,UAAA;EACA,SAAA;EACA,sBAAA;EACA,kBAAA;;AAnBZ,IAAK,MAMD,MAAM,MAAM,KAOR,KAQI;EACI,sBAAA;;AAtBhB,IAAK,MAMD,MAAM,MAAM,KAOR,KAYI;EACI,kBAAA;EACA,UAAA;;AA3BhB,IAAK,MAMD,MAAM,MAAM,KAOR,KAYI,IAII;EACI,cAAA;EACA,gBAAA;EACA,sBAAA;EACA,cAAA;EACA,gBAAA;EACA,SAAA;EACA,0BAAA;EACA,0BAAA;EACA,2BAAA;EACA,0BAAA;EACA,uBAAA;EACA,mBAAA;EACA,gBAAA;EACA,kBAAA;;AA3CpB,IAAK,MAMD,MAAM,MAAM,KAOR,KAYI,IAII,KAgBI;EACI,mBAAA;EACA,gBAAA;EACA,2BAAA;EACA,0BAAA;EACA,uBAAA;;AAlDxB,IAAK,MAMD,MAAM,MAAM,KAOR,KAYI,IAII,KAwBI,IAAG;EACC,WAAA;EACA,aAAA;EACA,iBAAA;EACA,oBAAA;EACA,aAAA;;AA1DxB,IAAK,MAMD,MAAM,MAAM,KAOR,KAkDI;EACI,gBAAA;;EAEA,YAAA;;AAlEhB,IAAK,MAMD,MAAM,MAAM,KAOR,KAkDI,MAKI;EACI,qBAAA;EACA,cAAA;EACA,SAAA;EACA,UAAA;;AAxEpB,IAAK,MAMD,MAAM,MAAM,KAOR,KAkDI,MAKI,KAMI;EACI,kBAAA;EACA,iBAAA;EACA,cAAA;EACA,SAAA;EACA,UAAA;EACA,sBAAA;EACA,cAAA;EACA,kBAAA;;AAlFxB,IAAK,MAMD,MAAM,MAAM,KAOR,KAkDI,MAKI,KAMI,KAUI;EACI,cAAA;EACA,SAAA;EACA,2BAAA;EACA,cAAA;EACA,aAAA;EACA,mBAAA;EACA,gBAAA;EACA,2BAAA;EACA,0BAAA;EACA,uBAAA;;AA9F5B,IAAK,MAMD,MAAM,MAAM,KAOR,KAkDI,MAKI,KAMI,KAUI,IAYI,IAAG;EACC,WAAA;EACA,aAAA;EACA,iBAAA;EACA,cAAA;EACA,kBAAA;;AAGJ,IAxGvB,MAMD,MAAM,MAAM,KAOR,KAkDI,MAKI,KAMI,KAUI,IAoBK;EACG,cAAA;;AAIR,IA7GnB,MAMD,MAAM,MAAM,KAOR,KAkDI,MAKI,KAMI,KAmCK,OACG;EACI,cAAA;;AAOpB,IAtHP,MAMD,MAAM,MAAM,KAOR,KAyGK,OACG;EACI,gBAAA;EACA,YAAA;;AAIQ,IA7HvB,MAMD,MAAM,MAAM,KAOR,KAyGK,OACG,MAII,KACI,KACK;EACG,yBAAA;EACA,cAAA;;AAFJ,IA7HvB,MAMD,MAAM,MAAM,KAOR,KAyGK,OACG,MAII,KACI,KACK,OAIG;EACI,cAAA;;AAZxB,IAtHP,MAMD,MAAM,MAAM,KAOR,KAyGK,OAmBG;EACI,cAAA;EACA,qBAAA;EACA,yBAAA;;AAtBR,IAtHP,MAMD,MAAM,MAAM,KAOR,KAyGK,OAmBG,IAKI;EACI,cAAA;EACA,qBAAA;EACA,yBAAA;;AA3BZ,IAtHP,MAMD,MAAM,MAAM,KAOR,KAyGK,OAmBG,IAKI,KAKI,IAAG;EACC,sBAAsB,2BAAtB;;AAS5B,IAAK;EACD,mBAAA;;AAGI,IAJH,OAGD,QACK,aAAc;EACX,+BAAA;;AALZ,IAAK,OAGD,QAKI,SACI;EACI,gBAAA;EACA,cAAA;EACA,WAAA;EACA,sBAAA;EACA,gCAAA;EACA,SAAA;EACA,mBAAA;EACA,gBAAA;EACA,2BAAA;EACA,0BAAA;EACA,uBAAA;;AApBhB,IAAK,OAGD,QAKI,SACI,KAaI,IAAG;EACC,kBAAA;EACA,cAAA;EACA,cAAA;EACA,gBAAA;EACA,iBAAA;;AA3BpB,IAAK,OAGD,QAKI,SACI,KAqBI;EACI,yBAAA;EACA,gBAAA;EACA,mBAAA;EACA,cAAA;;AAOpB,IAAK,OAAO,QAAO;EACf,qDAAA;EACA,6CAAA;;AAFJ,IAAK,OAAO,QAAO,cAIf,UAAS;EACL,mBAAA;;AAIR,IAAK,OAAO,UAAU,MAAK,QACvB;EACI,sBAAA;EACA,gBAAA;;AAHR,IAAK,OAAO,UAAU,MAAK,QAMvB;EACI,qBAAA;EACA,sBAAA;EACA,mBAAA;EACA,SAAA;;AAEA,IAZH,OAAO,UAAU,MAAK,QAMvB,KAMK;EACG,kBAAA;EACA,SAAA;EACA,OAAA;EACA,QAAA;EACA,SAAS,GAAT;EACA,WAAA;EACA,gCAAA;;AAnBZ,IAAK,OAAO,UAAU,MAAK,QAMvB,KAgBI;EACI,UAAA;EACA,mBAAA;EACA,cAAA;EACA,SAAA;EACA,eAAA;EACA,gBAAA;;AA5BZ,IAAK,OAAO,UAAU,MAAK,QAMvB,KAgBI,KAQI;EACI,kBAAA;EACA,kBAAA;EACA,WAAA;EACA,WAAA;EACA,gCAAA;;AAGJ,IAtCP,OAAO,UAAU,MAAK,QAMvB,KAgBI,KAgBK,OACG;EACI,mBAAA;;AAFR,IAtCP,OAAO,UAAU,MAAK,QAMvB,KAgBI,KAgBK,OAKG;EACI,cAAA;;AA5CpB,IAAK,OAAO,UAAU,MAAK,QAMvB,KAgBI,KA0BI;EACI,gBAAA;EACA,kBAAA;EACA,qBAAA;EACA,cAAA;EACA,eAAA;EACA,0BAAA;EACA,mBAAA;EACA,wBAAA;;AAxDhB,IAAK,OAAO,UAAU,MAAK,QAMvB,KAgBI,KA0BI,IAUI;EACI,gBAAA;EACA,2BAAA;;AAGJ,IA/DX,OAAO,UAAU,MAAK,QAMvB,KAgBI,KA0BI,IAeK;EACG,cAAA","file":"theme.css"}
\ No newline at end of file
diff --git a/BeyondResponsiveDesign.Menus/styles/theme.less b/BeyondResponsiveDesign/styles/theme.less
similarity index 90%
rename from BeyondResponsiveDesign.Menus/styles/theme.less
rename to BeyondResponsiveDesign/styles/theme.less
index 96bd9d3..bc5f370 100644
--- a/BeyondResponsiveDesign.Menus/styles/theme.less
+++ b/BeyondResponsiveDesign/styles/theme.less
@@ -16,9 +16,9 @@
@body-text-light-color: lighten(@body-text-color, 20%);
@body-highlight-color: lighten(@body-text-color, 30%);
-@header-color: #005800;
+@header-color: #00C86F;
@header-height: 3em;
-@header-color-light: #227122;
+@header-color-light: #007F47;
@header-text-color: #ffffff;
@header-active-text-color: @base-color;
@@ -30,8 +30,8 @@
@sidebar-text-color: @body-text-color;
@sidebar-text-active-color: @base-invert-color;
@sidebar-child-active-color: @sidebar-text-active-color;
-@sidebar-active-color: #227122;
-@sidebar-child-accent-background-color: #31A431;
+@sidebar-active-color: #007F47;
+@sidebar-child-accent-background-color: #12B26B;
@font-face {
font-family: 'OpenSans';
@@ -95,15 +95,6 @@ table {
color: @body-text-light-color;
}
- &.accommodation > tbody > tr > td {
- display: block;
- float: left;
- }
-
- &.accommodation > tbody > tr > td > img {
- .rounded;
- }
-
> tbody > tr {
border-bottom: 1px solid @border-line-color;
cursor: pointer;
@@ -113,6 +104,7 @@ table {
padding: 0.5em 0.5em 0.5em 0.5em;
overflow: hidden;
min-height: 3rem;
+ min-width: 6em;
> h2 {
font-weight: 400;
@@ -188,20 +180,18 @@ body > header {
}
> ul {
- float: left;
color: @header-text-color;
- margin: 0;
- padding: 0;
list-style-type: none;
white-space: nowrap;
-
- &.headerIcons {
- float: right;
+
+ &:not(.headerIcons) {
+ margin-right: 2em;
}
> li {
+ display: inline;
+ overflow: hidden;
position: relative;
- float: left;
margin: 0;
white-space: nowrap;
text-align: left;
@@ -212,6 +202,8 @@ body > header {
font-size: 1em;
> h2 {
+ overflow: hidden;
+ text-overflow: ellipsis;
color: @header-text-color;
font-weight: @bold;
}
@@ -260,7 +252,7 @@ body > nav {
padding: 0;
margin: 0;
- > div > div > ul {
+ > div > ul {
list-style-type: none;
text-indent: 0;
margin: 0;
@@ -419,34 +411,32 @@ body > main {
padding: .75rem .75rem 0 .75rem;
}
- > header {
- > h2 {
- background: #fff;
- display: block;
- width: 100%;
- line-height: 2.9375rem;
- border-bottom: 1px solid #b2b2b2;
- margin: 0;
- white-space: nowrap;
- overflow: hidden;
- -ms-text-overflow: ellipsis;
- -o-text-overflow: ellipsis;
- text-overflow: ellipsis;
+ > header > h2 {
+ background: #fff;
+ display: block;
+ width: 100%;
+ line-height: 2.9375rem;
+ border-bottom: 1px solid #b2b2b2;
+ margin: 0;
+ white-space: nowrap;
+ overflow: hidden;
+ -ms-text-overflow: ellipsis;
+ -o-text-overflow: ellipsis;
+ text-overflow: ellipsis;
- > i.fa {
- position: relative;
- top: 0.0625rem;
- left: .5625rem;
- font-weight: 300;
- font-size: 1.5rem;
- }
+ > i.fa {
+ position: relative;
+ top: 0.0625rem;
+ left: .5625rem;
+ font-weight: 300;
+ font-size: 1.5rem;
+ }
- > span {
- padding: 0 3.75rem 0 1rem;
- font-weight: 400;
- font-size: 1.125rem;
- text-indent: 0;
- }
+ > span {
+ padding: 0 0 0 1rem;
+ font-weight: 400;
+ font-size: 1.125rem;
+ text-indent: 0;
}
}
}
@@ -469,7 +459,7 @@ body > main > article > nav.toolbar {
> ul {
list-style-type: none;
- padding: 0 1em 0 1em;
+ padding: 0 1em 0 0.7em;
background: @toolbar-color;
margin: 0;
diff --git a/BeyondResponsiveDesign.Menus/styles/theme.min.css b/BeyondResponsiveDesign/styles/theme.min.css
similarity index 81%
rename from BeyondResponsiveDesign.Menus/styles/theme.min.css
rename to BeyondResponsiveDesign/styles/theme.min.css
index 1e68b90..597bac6 100644
--- a/BeyondResponsiveDesign.Menus/styles/theme.min.css
+++ b/BeyondResponsiveDesign/styles/theme.min.css
@@ -1 +1 @@
-@font-face{font-family:'OpenSans';src:url('fonts/opensans_regular_macroman/OpenSans-Regular-webfont.eot');src:url('fonts/opensans_regular_macroman/OpenSans-Regular-webfont.eot?iefix') format('eot'),url('fonts/opensans_regular_macroman/OpenSans-Regular-webfont.woff') format('woff'),url('fonts/opensans_regular_macroman/OpenSans-Regular-webfont.ttf') format('truetype'),url('fonts/opensans_regular_macroman/OpenSans-Regular-webfont.svg#webfont') format('svg')}.rounded{-webkit-border-radius:10px;-moz-border-radius:10px;-ms-border-radius:10px;-o-border-radius:10px;border-radius:10px}body{font-family:"OpenSans","Helvetica Neue","Helvetica","Arial","sans-serif";color:#666;text-align:left;line-height:1.5;margin:0}a{color:#005800;font-weight:350;text-decoration:none;-webkit-tap-highlight-color:rgba(0,0,0,0)}p{line-height:1.5rem;padding:0;margin:0 0 .5rem 0}h1,h2,h3{font-family:"OpenSans","Helvetica Neue","Helvetica","Arial","sans-serif";font-size:1.125em;margin:0 0 .375em 0;padding:0;color:#666;display:block}a:hover{color:#31a431}table{width:100%;border-collapse:collapse;border-spacing:0;padding:0;margin:0;empty-cells:show;table-layout:auto}table.agenda>tbody>tr:not(.session){cursor:auto;color:#999}table.accommodation>tbody>tr>td{display:block;float:left}table.accommodation>tbody>tr>td>img{-webkit-border-radius:10px;-moz-border-radius:10px;-ms-border-radius:10px;-o-border-radius:10px;border-radius:10px}table>tbody>tr{border-bottom:1px solid #f2f2f2;cursor:pointer}table>tbody>tr>td{vertical-align:top;padding:.5em .5em .5em .5em;overflow:hidden;min-height:3rem}table>tbody>tr>td>h2{font-weight:400;color:#222}div.popup{background:#fff;font-weight:300;backface-visibility:hidden;-webkit-box-shadow:0 0 4px rgba(0,0,0,.4);box-shadow:0 0 4px rgba(0,0,0,.4);margin:-1px 0 0 0;text-indent:0;padding:0}div.popup>ul{list-style-type:none;text-indent:0;padding:0;margin:0}div.popup>ul>li{width:100%;text-indent:0;margin:0;padding:0;vertical-align:middle;display:block;cursor:default;border:0 none;float:none;overflow:hidden;-ms-text-overflow:ellipsis;-o-text-overflow:ellipsis;text-overflow:ellipsis;white-space:nowrap}div.popup>ul>li:not(:first-child){border-top:1px dotted #f2f2f2}div.popup>ul>li>a{font-size:1.125rem;display:block;text-decoration:none;color:#666;padding:0 .75rem 0 .75rem;line-height:2.75rem;-ms-text-overflow:ellipsis;-o-text-overflow:ellipsis;text-overflow:ellipsis}body>header{background:#005800;box-shadow:rgba(0,0,0,.4) 0 1px .25rem;clip:rect(auto,auto,3.375em,auto)}body>header>h1{font-size:1.5em;line-height:2em;font-weight:400;color:#fff;text-align:center;margin:0 auto}body>header>ul{float:left;color:#fff;margin:0;padding:0;list-style-type:none;white-space:nowrap}body>header>ul.headerIcons{float:right}body>header>ul>li{position:relative;float:left;margin:0;white-space:nowrap;text-align:left;color:#fff;outline:none;padding:0;font-weight:400;font-size:1em}body>header>ul>li>h2{color:#fff;font-weight:400}body>header>ul>li>a{display:block;float:left;padding:0 .75em 0 .75em;color:#fff;outline:none;-webkit-tap-highlight-color:rgba(0,0,0,0);margin:0}body>header>ul>li>a:visited{color:#fff}body>header>ul>li>a>i{margin:0;padding:0}body>header>ul>li>a>i+span{padding-left:.5em}body>header>ul>li>a:hover{color:#fff;cursor:pointer;text-decoration:none}body>header>ul>li.active{color:#607d8b;cursor:pointer;background:#227122}body>nav{background-color:#f2f2f2;box-shadow:rgba(0,0,0,.3) 1px 0 .125rem;padding:0;margin:0}body>nav>div>div>ul{list-style-type:none;text-indent:0;margin:0;padding:0;width:100%}body>nav>div>div>ul>li{color:#666;text-indent:0;padding:0;margin:0;vertical-align:middle;position:relative}body>nav>div>div>ul>li img{vertical-align:middle}body>nav>div>div>ul>li>a{position:relative;z-index:2}body>nav>div>div>ul>li>a>h2{font-size:1em;font-weight:400;vertical-align:middle;color:#666;line-height:3em;margin:0;padding:0 .75em 0 .75em;text-transform:capitalize;-ms-text-overflow:ellipsis;-o-text-overflow:ellipsis;text-overflow:ellipsis;white-space:nowrap;overflow:hidden;position:relative}body>nav>div>div>ul>li>a>h2>span{white-space:nowrap;overflow:hidden;-ms-text-overflow:ellipsis;-o-text-overflow:ellipsis;text-overflow:ellipsis}body>nav>div>div>ul>li>a>h2>i.fa{float:left;outline:none;line-height:3rem;font-size:1.1875rem;width:1.5rem}body>nav>div>div>ul>li>div{overflow:hidden;height:auto}body>nav>div>div>ul>li>div>ul{list-style-type:none;text-indent:0;margin:0;padding:0}body>nav>div>div>ul>li>div>ul>li{font-size:.875em;line-height:2rem;text-indent:0;margin:0;padding:0;vertical-align:middle;color:#666;position:relative}body>nav>div>div>ul>li>div>ul>li>a{display:block;margin:0;padding:0 .75rem 0 1.5rem;color:#666;outline:none;white-space:nowrap;overflow:hidden;-ms-text-overflow:ellipsis;-o-text-overflow:ellipsis;text-overflow:ellipsis}body>nav>div>div>ul>li>div>ul>li>a>i.fa{float:left;outline:none;line-height:2rem;width:1.25rem;max-width:1.25rem}body>nav>div>div>ul>li>div>ul>li>a:hover{color:#999}body>nav>div>div>ul>li>div>ul>li.active>a{color:#fff}body>nav>div>div>ul>li.active>div{overflow:hidden;height:auto}body>nav>div>div>ul>li.active>div>ul>li.active{background-color:#31a431;color:#fff}body>nav>div>div>ul>li.active>div>ul>li.active>a{color:#fff}body>nav>div>div>ul>li.active>a{color:#fff;text-decoration:none;background-color:#227122}body>nav>div>div>ul>li.active>a>h2{color:#fff;text-decoration:none;background-color:#227122}body>nav>div>div>ul>li.active>a>h2>i[data-icon="add"]{background-image:url('../images/plus_white.svg')}body>main{background:#fff}body>main section.presentation>div{padding:.75rem .75rem 0 .75rem}body>main section>header>h2{background:#fff;display:block;width:100%;line-height:2.9375rem;border-bottom:1px solid #b2b2b2;margin:0;white-space:nowrap;overflow:hidden;-ms-text-overflow:ellipsis;-o-text-overflow:ellipsis;text-overflow:ellipsis}body>main section>header>h2>i.fa{position:relative;top:.0625rem;left:.5625rem;font-weight:300;font-size:1.5rem}body>main section>header>h2>span{padding:0 3.75rem 0 1rem;font-weight:400;font-size:1.125rem;text-indent:0}body>main>aside.propertySheet{-webkit-box-shadow:-1px 0 .25rem rgba(0,0,0,.4);box-shadow:-1px 0 .25rem rgba(0,0,0,.4)}body>main>aside.propertySheet>section.content{background:#fff}body>main>article>nav.toolbar>header{padding:0 .1em 0 1em;line-height:3em}body>main>article>nav.toolbar>ul{list-style-type:none;padding:0 1em 0 1em;background:#f2f2f2;margin:0}body>main>article>nav.toolbar>ul::after{position:absolute;bottom:0;left:0;right:0;content:' ';height:1px;border-bottom:1px solid #b2b2b2}body>main>article>nav.toolbar>ul>li{padding:0;line-height:2.25em;text-indent:0;margin:0;min-height:3em;overflow:hidden}body>main>article>nav.toolbar>ul>li>.highlight{visibility:hidden;position:relative;top:2.7em;height:1px;border-bottom:5px solid #227122}body>main>article>nav.toolbar>ul>li.active>.highlight{visibility:visible}body>main>article>nav.toolbar>ul>li.active>a{color:#666}body>main>article>nav.toolbar>ul>li>a{font-weight:400;font-size:.875em;text-decoration:none;color:#999;cursor:pointer;text-transform:capitalize;white-space:nowrap;padding:0 .5em 0 .5em}body>main>article>nav.toolbar>ul>li>a>i{font-weight:300;padding-right:.28571429em}body>main>article>nav.toolbar>ul>li>a:hover{color:#b3b3b3}
\ No newline at end of file
+@font-face{font-family:'OpenSans';src:url('fonts/opensans_regular_macroman/OpenSans-Regular-webfont.eot');src:url('fonts/opensans_regular_macroman/OpenSans-Regular-webfont.eot?iefix') format('eot'),url('fonts/opensans_regular_macroman/OpenSans-Regular-webfont.woff') format('woff'),url('fonts/opensans_regular_macroman/OpenSans-Regular-webfont.ttf') format('truetype'),url('fonts/opensans_regular_macroman/OpenSans-Regular-webfont.svg#webfont') format('svg')}.rounded{-webkit-border-radius:10px;-moz-border-radius:10px;-ms-border-radius:10px;-o-border-radius:10px;border-radius:10px}body{font-family:"OpenSans","Helvetica Neue","Helvetica","Arial","sans-serif";color:#666;text-align:left;line-height:1.5;margin:0}a{color:#56c2f0;font-weight:350;text-decoration:none;-webkit-tap-highlight-color:rgba(0,0,0,0)}p{line-height:1.5rem;padding:0;margin:0 0 .5rem 0}h1,h2,h3{font-family:"OpenSans","Helvetica Neue","Helvetica","Arial","sans-serif";font-size:1.125em;margin:0 0 .375em 0;padding:0;color:#666;display:block}a:hover{color:#00b1ee}table{width:100%;border-collapse:collapse;border-spacing:0;padding:0;margin:0;empty-cells:show;table-layout:auto}table.agenda>tbody>tr:not(.session){cursor:auto;color:#999}table.accommodation>tbody>tr>td{display:block;float:left}table.accommodation>tbody>tr>td>img{-webkit-border-radius:10px;-moz-border-radius:10px;-ms-border-radius:10px;-o-border-radius:10px;border-radius:10px}table>tbody>tr{border-bottom:1px solid #f2f2f2;cursor:pointer}table>tbody>tr>td{vertical-align:top;padding:.5em .5em .5em .5em;overflow:hidden;min-height:3rem}table>tbody>tr>td>h2{font-weight:400;color:#222}div.popup{background:#fff;font-weight:300;backface-visibility:hidden;-webkit-box-shadow:0 0 4px rgba(0,0,0,.4);box-shadow:0 0 4px rgba(0,0,0,.4);margin:-1px 0 0 0;text-indent:0;padding:0}div.popup>ul{list-style-type:none;text-indent:0;padding:0;margin:0}div.popup>ul>li{width:100%;text-indent:0;margin:0;padding:0;vertical-align:middle;display:block;cursor:default;border:0 none;float:none;overflow:hidden;-ms-text-overflow:ellipsis;-o-text-overflow:ellipsis;text-overflow:ellipsis;white-space:nowrap}div.popup>ul>li:not(:first-child){border-top:1px dotted #f2f2f2}div.popup>ul>li>a{font-size:1.125rem;display:block;text-decoration:none;color:#666;padding:0 .75rem 0 .75rem;line-height:2.75rem;-ms-text-overflow:ellipsis;-o-text-overflow:ellipsis;text-overflow:ellipsis}body>header{background:#56c2f0;box-shadow:rgba(0,0,0,.4) 0 1px .25rem;clip:rect(auto,auto,3.375em,auto)}body>header>h1{font-size:1.5em;line-height:2em;font-weight:400;color:#fff;text-align:center;margin:0 auto}body>header>ul{float:left;color:#fff;margin:0;padding:0;list-style-type:none;white-space:nowrap}body>header>ul.headerIcons{float:right}body>header>ul>li{position:relative;float:left;margin:0;white-space:nowrap;text-align:left;color:#fff;outline:none;padding:0;font-weight:400;font-size:1em}body>header>ul>li>h2{color:#fff;font-weight:400}body>header>ul>li>a{display:block;float:left;padding:0 .75em 0 .75em;color:#fff;outline:none;-webkit-tap-highlight-color:rgba(0,0,0,0);margin:0}body>header>ul>li>a:visited{color:#fff}body>header>ul>li>a>i{margin:0;padding:0}body>header>ul>li>a>i+span{padding-left:.5em}body>header>ul>li>a:hover{color:#fff;cursor:pointer;text-decoration:none}body>header>ul>li.active{color:#607d8b;cursor:pointer;background:#a8e5ff}body>nav{background-color:#f2f2f2;box-shadow:rgba(0,0,0,.3) 1px 0 .125rem;padding:0;margin:0}body>nav>div>div>ul{list-style-type:none;text-indent:0;margin:0;padding:0;width:100%}body>nav>div>div>ul>li{color:#666;text-indent:0;padding:0;margin:0;vertical-align:middle;position:relative}body>nav>div>div>ul>li img{vertical-align:middle}body>nav>div>div>ul>li>a{position:relative;z-index:2}body>nav>div>div>ul>li>a>h2{font-size:1em;font-weight:400;vertical-align:middle;color:#666;line-height:3em;margin:0;padding:0 .75em 0 .75em;text-transform:capitalize;-ms-text-overflow:ellipsis;-o-text-overflow:ellipsis;text-overflow:ellipsis;white-space:nowrap;overflow:hidden;position:relative}body>nav>div>div>ul>li>a>h2>span{white-space:nowrap;overflow:hidden;-ms-text-overflow:ellipsis;-o-text-overflow:ellipsis;text-overflow:ellipsis}body>nav>div>div>ul>li>a>h2>i.fa{float:left;outline:none;line-height:3rem;font-size:1.1875rem;width:1.5rem}body>nav>div>div>ul>li>div{overflow:hidden;height:auto}body>nav>div>div>ul>li>div>ul{list-style-type:none;text-indent:0;margin:0;padding:0}body>nav>div>div>ul>li>div>ul>li{font-size:.875em;line-height:2rem;text-indent:0;margin:0;padding:0;vertical-align:middle;color:#666;position:relative}body>nav>div>div>ul>li>div>ul>li>a{display:block;margin:0;padding:0 .75rem 0 1.5rem;color:#666;outline:none;white-space:nowrap;overflow:hidden;-ms-text-overflow:ellipsis;-o-text-overflow:ellipsis;text-overflow:ellipsis}body>nav>div>div>ul>li>div>ul>li>a>i.fa{float:left;outline:none;line-height:2rem;width:1.25rem;max-width:1.25rem}body>nav>div>div>ul>li>div>ul>li>a:hover{color:#999}body>nav>div>div>ul>li>div>ul>li.active>a{color:#fff}body>nav>div>div>ul>li.active>div{overflow:hidden;height:auto}body>nav>div>div>ul>li.active>div>ul>li.active{background-color:#00b1ee;color:#fff}body>nav>div>div>ul>li.active>div>ul>li.active>a{color:#fff}body>nav>div>div>ul>li.active>a{color:#fff;text-decoration:none;background-color:#008dbd}body>nav>div>div>ul>li.active>a>h2{color:#fff;text-decoration:none;background-color:#008dbd}body>nav>div>div>ul>li.active>a>h2>i[data-icon="add"]{background-image:url('../images/plus_white.svg')}body>main{background:#fff}body>main section.presentation>div{padding:.75rem .75rem 0 .75rem}body>main section>header>h2{background:#fff;display:block;width:100%;line-height:2.9375rem;border-bottom:1px solid #b2b2b2;margin:0;white-space:nowrap;overflow:hidden;-ms-text-overflow:ellipsis;-o-text-overflow:ellipsis;text-overflow:ellipsis}body>main section>header>h2>i.fa{position:relative;top:.0625rem;left:.5625rem;font-weight:300;font-size:1.5rem}body>main section>header>h2>span{padding:0 3.75rem 0 1rem;font-weight:400;font-size:1.125rem;text-indent:0}body>main>aside.propertySheet{-webkit-box-shadow:-1px 0 .25rem rgba(0,0,0,.4);box-shadow:-1px 0 .25rem rgba(0,0,0,.4)}body>main>aside.propertySheet>section.content{background:#fff}body>main>article>nav.toolbar>header{padding:0 .1em 0 1em;line-height:3em}body>main>article>nav.toolbar>ul{list-style-type:none;padding:0 1em 0 .7em;background:#f2f2f2;margin:0}body>main>article>nav.toolbar>ul::after{position:absolute;bottom:0;left:0;right:0;content:' ';height:1px;border-bottom:1px solid #b2b2b2}body>main>article>nav.toolbar>ul>li{padding:0;line-height:2.25em;text-indent:0;margin:0;min-height:3em;overflow:hidden}body>main>article>nav.toolbar>ul>li>.highlight{visibility:hidden;position:relative;top:2.7em;height:1px;border-bottom:5px solid #008dbd}body>main>article>nav.toolbar>ul>li.active>.highlight{visibility:visible}body>main>article>nav.toolbar>ul>li.active>a{color:#666}body>main>article>nav.toolbar>ul>li>a{font-weight:400;font-size:.875em;text-decoration:none;color:#999;cursor:pointer;text-transform:capitalize;white-space:nowrap;padding:0 .5em 0 .5em}body>main>article>nav.toolbar>ul>li>a>i{font-weight:300;padding-right:.28571429em}body>main>article>nav.toolbar>ul>li>a:hover{color:#b3b3b3}
\ No newline at end of file
diff --git a/BeyondResponsiveDesign.Menus/styles/transforms.css b/BeyondResponsiveDesign/styles/transforms.css
similarity index 90%
rename from BeyondResponsiveDesign.Menus/styles/transforms.css
rename to BeyondResponsiveDesign/styles/transforms.css
index 58269d3..d19f8cc 100644
--- a/BeyondResponsiveDesign.Menus/styles/transforms.css
+++ b/BeyondResponsiveDesign/styles/transforms.css
@@ -1,4 +1,4 @@
-.animateFast {
+.animateFast {
-webkit-transition: all 0.1s ease-in-out;
-moz-transition: all 0.1s ease-in-out;
-o-transition: all 0.1s ease-in-out;
@@ -17,18 +17,20 @@ body.propertySheet > header > ul > li.menuToggle {
body:not(.propertySheet) > header > ul > li.navigator {
display: none;
}
-body > nav > div > div > ul > li:not(.active) > div {
+body > nav > div > ul > li:not(.active) > div {
overflow: hidden;
height: 0;
+ /* Hide the submenu when main item is not active */
}
-body > nav > div > div > ul > li:not(.active) > div > ul {
+body > nav > div > ul > li:not(.active) > div > ul {
-webkit-transform: translate3d(0, -100%, 0);
-ms-transform: translate3d(0, -100%, 0);
-moz-transform: translate3d(0, -100%, 0);
-o-transform: translate3d(0, -100%, 0);
transform: translate3d(0, -100%, 0);
}
-body > nav > div > div > ul > li.active > div > ul {
+body > nav > div > ul > li.active > div > ul {
+ /* Return submenu to normal position when main item is active */
-webkit-transform: translate3d(0, 0, 0);
-ms-transform: translate3d(0, 0, 0);
-moz-transform: translate3d(0, 0, 0);
@@ -71,6 +73,9 @@ body > main > article > div.slideTabContainer > section.offLeft {
-o-transform: translate3d(-100%, 0, 0);
transform: translate3d(-100%, 0, 0);
}
+body > main > article > nav.toolbar > ul > li {
+ /* Transforms controlling the tab selection underline */
+}
body > main > article > nav.toolbar > ul > li > .highlight {
display: block;
}
@@ -129,14 +134,13 @@ body > main > aside.propertySheet.offRight {
-o-transition: all 0.2s ease-in-out;
transition: all 0.2s ease-in-out;
}
+ /* Wide property sheets are 50% width on large screens */
body > main > aside.propertySheet.wide {
width: 50%;
}
}
@media only screen and (max-width: 800px) {
- table.accommodation > tbody > tr > td > p {
- max-width: 14em;
- }
+ /* Auto hide sidebar and enable toggle button on smaller screens */
body > header > ul > li.menuToggle {
display: block;
left: -1.2em;
@@ -182,6 +186,7 @@ body > main > aside.propertySheet.offRight {
}
}
@media only screen and (max-width: 600px) {
+ /* Drop down menu becomes pop-up on horizontal mobile screens */
div.popup {
position: fixed;
bottom: 0;
@@ -207,9 +212,11 @@ body > main > aside.propertySheet.offRight {
}
}
@media only screen and (max-width: 480px) {
+ /* Hide bio on smaller screens - positive use of reactive design */
table > tbody > tr > td.bio {
display: none;
}
+ /* Property sheets are 100% width on portrait mobile screens */
body > main > aside.propertySheet {
width: 100%;
min-width: 100%;
@@ -218,4 +225,3 @@ body > main > aside.propertySheet.offRight {
border-left: 0 none;
}
}
-/*# sourceMappingURL=transforms.css.map */
\ No newline at end of file
diff --git a/BeyondResponsiveDesign/styles/transforms.css.map b/BeyondResponsiveDesign/styles/transforms.css.map
new file mode 100644
index 0000000..8c6c936
--- /dev/null
+++ b/BeyondResponsiveDesign/styles/transforms.css.map
@@ -0,0 +1 @@
+{"version":3,"sources":["transforms.less"],"names":[],"mappings":"AAWA;EANI,wCAAA;EACA,qCAAA;EACA,mCAAA;EACA,gCAAA;;AAOJ,GAAG,gBAAiB;EAChB,eAAA;EACA,YAAA;;AAIA,IADA,cAAe,SAAS,KAAK,KAC5B;EACG,cAAA;;AAGJ,IALA,cAAe,SAAS,KAAK,KAK5B;EACG,aAAA;;AAKJ,IADA,IAAI,gBAAiB,SAAS,KAAK,KAClC;EACG,aAAA;;AAIR,IAAK,MAAM,MAAM,MAAM,KAAK,KAAI,IAAI,SAAU;EAC1C,gBAAA;EACA,SAAA;;AAFJ,IAAK,MAAM,MAAM,MAAM,KAAK,KAAI,IAAI,SAAU,MAI1C;EACI,mBAAmB,wBAAnB;EACA,eAAe,wBAAf;EACA,gBAAgB,wBAAhB;EACA,cAAc,wBAAd;EACA,WAAW,wBAAX;;AAIR,IAAK,MAAM,MAAM,MAAM,KAAK,KAAI,OAAQ,MAAM;EAC1C,mBAAmB,oBAAnB;EACA,eAAe,oBAAf;EACA,gBAAgB,oBAAhB;EACA,cAAc,oBAAd;EACA,WAAW,oBAAX;EAjDA,wCAAA;EACA,qCAAA;EACA,mCAAA;EACA,gCAAA;;AAkDJ,IAAK,OAAO,UAAU,MAAK;EACvB,YAAA;EACA,gCAAA;;AAFJ,IAAK,OAAO,UAAU,MAAK,kBAIvB;EAzDA,wCAAA;EACA,qCAAA;EACA,mCAAA;EACA,gCAAA;;AAyDI,IAPH,OAAO,UAAU,MAAK,kBAIvB,UAGK;EACG,kBAAA;EACA,cAAA;EACA,QAAA;EACA,OAAA;EACA,QAAA;EACA,SAAA;;AAGJ,IAhBH,OAAO,UAAU,MAAK,kBAIvB,UAYK;EACG,mBAAmB,uBAAnB;EACA,gBAAgB,uBAAhB;EACA,eAAe,uBAAf;EACA,cAAc,uBAAd;EACA,WAAW,uBAAX;;AAGJ,IAxBH,OAAO,UAAU,MAAK,kBAIvB,UAoBK;EACG,mBAAmB,wBAAnB;EACA,gBAAgB,wBAAhB;EACA,eAAe,wBAAf;EACA,cAAc,wBAAd;EACA,WAAW,wBAAX;;AAKZ,IAAK,OAAO,UAAU,MAAK,QAAS,KAAK,KACrC;EACI,cAAA;;AAGJ,IALC,OAAO,UAAU,MAAK,QAAS,KAAK,KAKpC,QAAS;EACN,mBAAmB,uBAAnB;EACA,eAAe,uBAAf;EACA,gBAAgB,uBAAhB;EACA,cAAc,uBAAd;EACA,WAAW,uBAAX;EAjGJ,wCAAA;EACA,qCAAA;EACA,mCAAA;EACA,gCAAA;;AAkGA,IAdC,OAAO,UAAU,MAAK,QAAS,KAAK,KAcpC,SAAU;EACP,mBAAmB,wBAAnB;EACA,eAAe,wBAAf;EACA,gBAAgB,wBAAhB;EACA,cAAc,wBAAd;EACA,WAAW,wBAAX;EA1GJ,wCAAA;EACA,qCAAA;EACA,mCAAA;EACA,gCAAA;;AA2GA,IAvBC,OAAO,UAAU,MAAK,QAAS,KAAK,KAuBpC,OAAQ;EACL,mBAAmB,oBAAnB;EACA,eAAe,oBAAf;EACA,gBAAgB,oBAAhB;EACA,cAAc,oBAAd;EACA,WAAW,oBAAX;EAnHJ,wCAAA;EACA,qCAAA;EACA,mCAAA;EACA,gCAAA;;AAqHJ,IAAK,OAAO,QAAO;EAxHf,wCAAA;EACA,qCAAA;EACA,mCAAA;EACA,gCAAA;EAuHA,cAAA;;AAEA,IAJC,OAAO,QAAO,cAId;EACG,mBAAmB,uBAAnB;EACA,gBAAgB,uBAAhB;EACA,eAAe,uBAAf;EACA,cAAc,uBAAd;EACA,WAAW,uBAAX;;AAcR,wBAV0C;EACtC,IAAK;EACL,IAAK,OAAO;IAvIZ,wCAAA;IACA,qCAAA;IACA,mCAAA;IACA,gCAAA;;EAuIA,IAAK,OAAO,QAAO,cAAc;IAC7B,UAAA;;;AAoDR,wBAhD0C;EACtC,KAAK,cAAe,QAAQ,KAAK,KAAK;IAClC,eAAA;;EAGJ,IACI,SAAS,KAAK,KAAI;IACd,cAAA;IACA,YAAA;IAvJR,wCAAA;IACA,qCAAA;IACA,mCAAA;IACA,gCAAA;;EAiJA,IAOI;IACI,aAAA;IACA,iBAAA;IA7JR,wCAAA;IACA,qCAAA;IACA,mCAAA;IACA,gCAAA;;EAiJA,IAaI,OAAO;IACH,OAAA;IACA,iBAAA;IAnKR,wCAAA;IACA,qCAAA;IACA,mCAAA;IACA,gCAAA;;EAqKA,IAAI,QAAS,SAAS,KAAK,KAAI;IAC3B,YAAA;;EAGJ,IAAI,QAAS;EACb,IAAI,QAAS,OAAO;IAChB,mBAAmB,kBAAnB;IACA,eAAe,kBAAf;IACA,gBAAgB,kBAAhB;IACA,cAAc,kBAAd;IACA,WAAW,kBAAX;;EAGJ,IAAI,IAAI,UAAW;EACnB,IAAI,IAAI,UAAW,OAAO;IACtB,mBAAmB,aAAnB;IACA,eAAe,aAAf;IACA,gBAAgB,aAAhB;IACA,cAAc,aAAd;IACA,WAAW,aAAX;;;AA4BR,wBAxB0C;EACtC,GAAG;IACC,eAAA;IACA,SAAA;IACA,WAAA;IACA,eAAA;IACA,eAAA;IACA,gBAAgB,uBAAhB;IACA,eAAe,uBAAf;IACA,cAAc,uBAAd;IACA,mBAAmB,uBAAnB;IACA,WAAW,uBAAX;IA1MJ,wCAAA;IACA,qCAAA;IACA,mCAAA;IACA,gCAAA;;EA0MI,GAbD,MAaE;IACG,gBAAgB,oBAAhB;IACA,eAAe,oBAAf;IACA,cAAc,oBAAd;IACA,mBAAmB,oBAAnB;IACA,WAAW,oBAAX;;;AAmBX,wBAdyC;EAElC,KADE,QAAQ,KAAK,KACd;IACG,aAAA;;EAIR,IAAK,OAAO,QAAO;IACf,WAAA;IACA,eAAA;IACA,eAAA;IACA,OAAA;IACA,mBAAA","file":"transforms.css"}
\ No newline at end of file
diff --git a/BeyondResponsiveDesign.Menus/styles/transforms.less b/BeyondResponsiveDesign/styles/transforms.less
similarity index 90%
rename from BeyondResponsiveDesign.Menus/styles/transforms.less
rename to BeyondResponsiveDesign/styles/transforms.less
index 9dda615..500034b 100644
--- a/BeyondResponsiveDesign.Menus/styles/transforms.less
+++ b/BeyondResponsiveDesign/styles/transforms.less
@@ -34,10 +34,11 @@ body:not(.propertySheet) > header > ul > li {
}
}
-body > nav > div > div > ul > li:not(.active) > div {
+body > nav > div > ul > li:not(.active) > div {
overflow: hidden;
height: 0;
+ /* Hide the submenu when main item is not active */
> ul {
-webkit-transform: translate3d(0,-100%,0);
-ms-transform: translate3d(0,-100%,0);
@@ -47,7 +48,8 @@ body > nav > div > div > ul > li:not(.active) > div {
}
}
-body > nav > div > div > ul > li.active > div > ul {
+body > nav > div > ul > li.active > div > ul {
+ /* Return submenu to normal position when main item is active */
-webkit-transform: translate3d(0,0,0);
-ms-transform: translate3d(0,0,0);
-moz-transform: translate3d(0,0,0);
@@ -91,6 +93,7 @@ body > main > article > div.slideTabContainer {
}
body > main > article > nav.toolbar > ul > li {
+ /* Transforms controlling the tab selection underline */
> .highlight {
display: block;
}
@@ -141,16 +144,15 @@ body > main > aside.propertySheet {
body > main > article {
.animate;
}
+
+ /* Wide property sheets are 50% width on large screens */
body > main > aside.propertySheet.wide {
width: 50%;
}
}
@media only screen and (max-width: 800px) {
- table.accommodation > tbody > tr > td > p {
- max-width: 14em;
- }
-
+ /* Auto hide sidebar and enable toggle button on smaller screens */
body {
> header > ul > li.menuToggle {
display: block;
@@ -195,6 +197,7 @@ body > main > aside.propertySheet {
}
@media only screen and (max-width: 600px) {
+ /* Drop down menu becomes pop-up on horizontal mobile screens */
div.popup {
position: fixed;
bottom: 0;
@@ -219,12 +222,14 @@ body > main > aside.propertySheet {
}
@media only screen and (max-width: 480px) {
+ /* Hide bio on smaller screens - positive use of reactive design */
table > tbody > tr > td {
&.bio {
display: none;
}
}
+ /* Property sheets are 100% width on portrait mobile screens */
body > main > aside.propertySheet {
width: 100%;
min-width: 100%;
diff --git a/BeyondResponsiveDesign.Menus/styles/transforms.min.css b/BeyondResponsiveDesign/styles/transforms.min.css
similarity index 100%
rename from BeyondResponsiveDesign.Menus/styles/transforms.min.css
rename to BeyondResponsiveDesign/styles/transforms.min.css
diff --git a/DataScraper/Program.cs b/DataScraper/Program.cs
index 5b6ef7f..7dd2ae3 100644
--- a/DataScraper/Program.cs
+++ b/DataScraper/Program.cs
@@ -17,110 +17,318 @@ public class Link
public string Icon { get; set; }
public string Url { get; set; }
+
+ public string Text { get; set; }
}
public class Session
{
- public int Id { get; set; }
+ public string Id { get; set; }
public string Title { get; set; }
+ public string TimeSlotId { get; set; }
+
+ public string TrackId { get; set; }
+
public string Abstract { get; set; }
+
+ public string Speaker { get; set; }
+
+ public string SpeakerId { get; set; }
+
+ public string Day { get; set; }
}
public class Speaker
{
- public int Id { get; set; }
+ public Speaker()
+ {
+ this.Sessions = new List();
+ }
+
+ public string Id { get; set; }
public string Name { get; set; }
+ public string Role { get; set; }
+
public string Bio { get; set; }
public IEnumerable Sessions { get; set; }
+ public List Sessions { get; set; }
+ }
+
+ public class SessionInfo
+ {
+ public string Day { get; set; }
+
+ public string SessionId { get; set; }
+
+ public Speaker Speaker { get; set; }
}
public class Program
{
+ private const string OutputDir = "D:\\Code\\BeyondResponsiveDesign\\BeyondResponsiveDesign\\images\\speakers";
+
+ const int Innovation = 1;
+ const int Devops = 2;
+ const int Mobile = 3;
+ const int IoTMakerWearable = 4;
+ const int SecurityHack = 5;
+ const int Methods = 6;
+ const int BigDataCloud = 7;
+ const int Languages = 8;
+ const int Codelab1 = 9;
+ const int Codelab2 = 10;
+
public static void Main(string[] args)
{
- const string AgendaUrl = "/Agenda";
- const string OutputDir =
- "D:\\Code\\BeyondResponsiveDesign\\BeyondResponsiveDesign.Menus\\images\\speakers";
-
var imageClient = new HttpClient();
- var htmlClient = new HttpClient { BaseAddress = new Uri("http://www.dddeastanglia.com") };
+ imageClient.DefaultRequestHeaders.Add(
+ "User-Agent",
+ "Mozilla/5.0 (Windows NT 6.3; WOW64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/40.0.2214.91 Safari/537.36");
+
+ var htmlClient = new HttpClient { BaseAddress = new Uri("http://rome2015.codemotionworld.com") };
+ htmlClient.DefaultRequestHeaders.Add("Accept", "text/html");
+ htmlClient.DefaultRequestHeaders.Add(
+ "User-Agent",
+ "Mozilla/5.0 (Windows NT 6.3; WOW64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/40.0.2214.91 Safari/537.36");
+
+ var speakers = new ConcurrentQueue();
+ var sessions = new ConcurrentQueue();
+ var sessionInfos = new ConcurrentQueue();
+
+ ScrapeSpeakers(htmlClient, imageClient, speakers, sessionInfos);
+ ScrapeSessions(htmlClient, sessionInfos, sessions);
+
+ var sessionDictionary = sessions.ToDictionary(k => k.Id, v => v);
+ ScrapeTimeSlots(htmlClient, sessionDictionary);
+
+ var streamWriter = new StreamWriter(string.Format("{0}\\speakers.json", OutputDir));
+ streamWriter.Write(JsonConvert.SerializeObject(speakers.OrderBy(o => o.Name)));
+ streamWriter.Close();
+
+ var agendaFridayWriter = new StreamWriter(string.Format("{0}\\agenda-friday.json", OutputDir));
+ agendaFridayWriter.Write(JsonConvert.SerializeObject(sessions.Where(o => o.Day == "Friday").OrderBy(o => o.TrackId).ThenBy(o => o.TimeSlotId)));
+ agendaFridayWriter.Close();
+
+ var agendaSaturdayWriter = new StreamWriter(string.Format("{0}\\agenda-saturday.json", OutputDir));
+ agendaSaturdayWriter.Write(JsonConvert.SerializeObject(sessions.Where(o => o.Day == "Saturday").OrderBy(o => o.TrackId).ThenBy(o => o.TimeSlotId)));
+ agendaSaturdayWriter.Close();
+
+
+ Console.WriteLine("Process completed, press any key to exit");
+ Console.ReadKey();
+ }
+
+ private static void ScrapeSpeakers(
+ HttpClient htmlClient,
+ HttpClient imageClient,
+ ConcurrentQueue speakers,
+ ConcurrentQueue sessionInfo)
+ {
+ const string SpeakersUrl = "/speakers";
var htmlDoc = new HtmlDocument();
- htmlDoc.LoadHtml(htmlClient.GetStringAsync(AgendaUrl).Result);
+ htmlDoc.LoadHtml(htmlClient.GetStringAsync(SpeakersUrl).Result);
- var speakerLinks =
- htmlDoc.DocumentNode.Descendants("a")
- .Where(o => o.Attributes.Contains("class") && o.Attributes["class"].Value == "speakerName");
+ var speakerContainers =
+ htmlDoc.DocumentNode.Descendants("div").First(o => o.Id == "speaker").Descendants("article");
- var speakers = new ConcurrentQueue();
- Task.WaitAll(speakerLinks.Select(link => Task.Run(async () =>
- {
- var href = link.Attributes["href"].Value;
- var speakerPage = new HtmlDocument();
- speakerPage.LoadHtml(await htmlClient.GetStringAsync(href));
-
- var container =
- speakerPage.DocumentNode.Descendants("div")
- .First(
- o => o.Attributes.Contains("class") && o.Attributes["class"].Value.Contains("speaker"));
-
- var titleElement = container.Descendants("h3").First();
- var linkElements = container.Descendants("section").First().Descendants("p");
- var paragraphElements = container.Elements("p");
- var sessionLinkElements = container.Element("ul").Descendants("a");
-
- var id = int.Parse(href.Split('/').Last());
- var name = titleElement.Element("#text").InnerHtml;
- var bio = string.Join(string.Empty, paragraphElements.Select(o => o.InnerHtml));
- var links = (from linkElement in linkElements
- let icon = linkElement.Descendants("i").First().Attributes["class"].Value
- let url = linkElement.Descendants("a").First().Attributes["href"].Value
- select new Link { Icon = icon, Url = url }).ToList();
-
- var sessions = new List();
- foreach (var sessionLinkElement in sessionLinkElements)
- {
- var sessionHref = sessionLinkElement.Attributes["href"].Value;
- var sessionId = int.Parse(sessionHref.Split('/').Last());
- var title = sessionLinkElement.InnerText;
+ Task.WaitAll(
+ speakerContainers.Select(
+ container => Task.Run(
+ async () =>
+ {
+ var link = container.Descendants("a").First();
+ var href = link.Attributes["href"].Value;
+ var speakerPage = new HtmlDocument();
+ speakerPage.LoadHtml(await htmlClient.GetStringAsync(href));
- var sessionPage = new HtmlDocument();
- sessionPage.LoadHtml(await htmlClient.GetStringAsync(sessionHref));
+ var speakerContainer =
+ speakerPage.DocumentNode.Descendants("article").First(o => o.Id == "speaker");
- var abstractElement =
- sessionPage.DocumentNode.Descendants("div")
- .First(o => o.Attributes.Contains("class") && o.Attributes["class"].Value == "abstract");
+ var header = speakerContainer.Descendants("header").First();
+ var titleElement = header.Elements("h1").First();
+ var roleElement = header.Elements("h2").First();
- var @abstract = abstractElement.InnerHtml;
- sessions.Add(new Session { Id = sessionId, Title = title, Abstract = @abstract});
- }
+ var linkContainer = speakerContainer.Descendants("ul").First(o => o.HasClass("links"));
- speakers.Enqueue(
- new Speaker { Id = id, Name = name, Links = links, Bio = bio, Sessions = sessions });
+ IEnumerable linkElements = new List();
+ if (linkContainer != null)
+ {
+ linkElements = linkContainer.Descendants("li").Select(o => o.Element("a"));
+ }
- var imageTag = titleElement.Descendants("img").First();
- var imageUrl = imageTag.Attributes["src"].Value.Replace("s=50", "s=300");
+ var bioContainer = speakerContainer.Descendants("p").First();
- var stream = await imageClient.GetStreamAsync(imageUrl);
- var file = File.OpenWrite(string.Format("{0}\\{1}.jpg", OutputDir, id));
- await stream.CopyToAsync(file);
+ var id = href.Split('/').Last();
+ var name = titleElement.Element("#text").InnerHtml.Trim();
+ var role = roleElement.Element("#text").InnerHtml.Trim();
+ var links =
+ linkElements.Select(
+ o =>
+ new Link
+ {
+ Text = o.Element("#text") != null ? o.Element("#text").InnerHtml.Trim() : string.Empty,
+ Url = o.Attributes.Contains("href") ? o.Attributes["href"].Value : string.Empty,
+ Icon = o.Attributes.Contains("class") ? o.Attributes["class"].Value : string.Empty
+ }).ToList();
- file.Close();
- })).ToArray());
+ var bio = bioContainer == null ? string.Empty : bioContainer.InnerHtml.Trim();
- var streamWriter = new StreamWriter(string.Format("{0}\\speakers.json", OutputDir));
- streamWriter.Write(JsonConvert.SerializeObject(speakers.OrderBy(o => o.Name)));
- streamWriter.Close();
+ var speaker = new Speaker
+ {
+ Id = id,
+ Name = name,
+ Role = role,
+ Links = links,
+ Bio = bio
+ };
+ speakers.Enqueue(speaker);
- Console.WriteLine("Process completed, press any key to exit");
- Console.ReadKey();
+ var linksContainer = speakerContainer.Descendants("p").Skip(1).FirstOrDefault();
+ if (linksContainer != null)
+ {
+
+ var sessionLinks = linksContainer.Elements("a");
+
+ foreach (var sessionLink in sessionLinks)
+ {
+ var rawHref = sessionLink.Attributes["href"].Value;
+
+ var day = rawHref.Contains("/22/") ? "Friday" : "Saturday";
+ var sessionId =
+ rawHref.Replace(
+ "/conference/22/?dlink=dtalk",
+ string.Empty)
+ .Replace(
+ "/conference/23/?dlink=dtalk",
+ string.Empty);
+
+ sessionInfo.Enqueue(
+ new SessionInfo { Day = day, SessionId = sessionId, Speaker = speaker });
+ }
+
+ var imageTag = speakerContainer.Descendants("img").FirstOrDefault();
+ if (imageTag != null)
+ {
+ var rawUrl = imageTag.Attributes["src"].Value;
+ var imageUrl = rawUrl.StartsWith("//") ? rawUrl.Replace("//", "http://") : rawUrl;
+
+ try
+ {
+ var stream = await imageClient.GetStreamAsync(imageUrl);
+ var file = File.OpenWrite(string.Format("{0}\\{1}.jpg", OutputDir, id));
+
+ await stream.CopyToAsync(file);
+ file.Close();
+ }
+ catch (Exception ex)
+ {
+ }
+ }
+ }
+ })).ToArray());
+ }
+
+ private static void ScrapeSessions(
+ HttpClient htmlClient,
+ IEnumerable sessionInfos,
+ ConcurrentQueue sessions)
+ {
+ Task.WaitAll(
+ sessionInfos.Select(
+ sessionInfo => Task.Run(
+ async () =>
+ {
+ var day = sessionInfo.Day;
+ var sessionId = sessionInfo.SessionId;
+ var speaker = sessionInfo.Speaker;
+
+ var sessionHref =
+ "http://rome2015.codemotionworld.com/wp-content/themes/event/detail-talk.php?detail="
+ + sessionId;
+
+ var sessionPage = new HtmlDocument();
+ sessionPage.LoadHtml(await htmlClient.GetStringAsync(sessionHref));
+
+ var titleElement = sessionPage.DocumentNode.Descendants("h1").First();
+ var slotElement = sessionPage.DocumentNode.Descendants("h3").First();
+ var abstractElement = sessionPage.DocumentNode.Descendants("p").First();
+
+ var title = titleElement.Element("#text").InnerHtml.Trim();
+ var @abstract = abstractElement.Element("#text").InnerHtml.Trim();
+ var slot = slotElement.Element("#text").InnerHtml.Trim();
+
+ var session = new Session
+ {
+ Id = sessionId,
+ Day = day,
+ Title = title,
+ TimeSlotId = slot,
+ Abstract = @abstract,
+ Speaker = speaker.Name,
+ SpeakerId = speaker.Id
+ };
+
+ speaker.Sessions.Add(session);
+ sessions.Enqueue(session);
+ })).ToArray());
+ }
+
+ private static void ScrapeTimeSlots(HttpClient htmlClient, IReadOnlyDictionary sessionDictionary)
+ {
+ const string FridayUrl = "/conference/22";
+ const string SaturdayUrl = "/conference/23";
+
+ ScrapeDay(htmlClient, sessionDictionary, FridayUrl);
+ ScrapeDay(htmlClient, sessionDictionary, SaturdayUrl);
+ }
+
+ private static void ScrapeDay(HttpClient htmlClient, IReadOnlyDictionary sessionDictionary, string url)
+ {
+ var htmlDoc = new HtmlDocument();
+ htmlDoc.LoadHtml(htmlClient.GetStringAsync(url).Result);
+
+ var table = htmlDoc.DocumentNode.Descendants("table").FirstOrDefault(o => o.Id == "table_talk");
+ if (table != null)
+ {
+ // skip first row as this is just headers
+ var rows = table.Descendants("tr").Skip(1);
+ foreach (var row in rows)
+ {
+ var columns = row.Descendants("td").ToList();
+ var timeslotSpan = columns.First().Descendants("span").First();
+ var timeslotId = timeslotSpan.Element("#text").InnerHtml.Trim().Replace(" ", string.Empty);
+
+ foreach (var column in columns.Skip(1))
+ {
+ var link = column.Descendants("a").FirstOrDefault();
+ if (link != null)
+ {
+ Session session;
+ var sessionId = link.Id.Replace("dtalk", string.Empty);
+ if (sessionDictionary.TryGetValue(sessionId, out session))
+ {
+ session.TimeSlotId = timeslotId;
+ session.TrackId = columns.IndexOf(column).ToString();
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+
+ public static class Extensions
+ {
+ public static bool HasClass(this HtmlNode o, string className)
+ {
+ return o.Attributes.Contains("class") && o.Attributes["class"].Value == className;
}
}
}
diff --git a/Gruntfile.js b/Gruntfile.js
new file mode 100644
index 0000000..5fd05d4
--- /dev/null
+++ b/Gruntfile.js
@@ -0,0 +1,35 @@
+module.exports = function(grunt) {
+
+ grunt.initConfig({
+ appcache: {
+ options: {
+ basePath: 'BeyondResponsiveDesign'
+ },
+ all: {
+ dest: 'BeyondResponsiveDesign/cache.manifest',
+ cache: {
+ patterns: [
+ 'BeyondResponsiveDesign/**/*',
+ '!**/*.less'
+ ],
+ literals: [
+ 'styles/fonts/opensans_regular_macroman/OpenSans-Regular-webfont.eot',
+ 'styles/fonts/opensans_regular_macroman/OpenSans-Regular-webfont.eot?iefix',
+ 'styles/fonts/opensans_regular_macroman/OpenSans-Regular-webfont.svg#webfont',
+ 'styles/fonts/opensans_regular_macroman/OpenSans-Regular-webfont.ttf',
+ 'styles/fonts/opensans_regular_macroman/OpenSans-Regular-webfont.woff',
+ 'styles/fonts/fontawesome-webfont.eot?v=4.1.0',
+ 'styles/fonts/fontawesome-webfont.eot?#iefix&v=4.1.0',
+ 'styles/fonts/fontawesome-webfont.svg?v=4.1.0#fontawesomeregular',
+ 'styles/fonts/fontawesome-webfont.ttf?v=4.1.0',
+ 'styles/fonts/fontawesome-webfont.woff?v=4.1.0']
+ },
+ network: '*'
+ }
+ }
+ });
+
+ grunt.loadNpmTasks('grunt-appcache');
+
+ grunt.registerTask('default', ['appcache']);
+};
\ No newline at end of file
diff --git a/Sponsors/Sponsors Rome 2015.html b/Sponsors/Sponsors Rome 2015.html
new file mode 100644
index 0000000..e4a68b8
--- /dev/null
+++ b/Sponsors/Sponsors Rome 2015.html
@@ -0,0 +1,476 @@
+
+
+Sponsors | Rome 2015
+
+
+
+
+
+
+
+
Become a sponsor
+
Codemotion is the biggest tech conference in Italy and one of the most important in Europe, with a network of more than 30k developers. Take part as a sponsor in the event open to all languages, platforms and technologies.
+
Contact us
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/Sponsors/Sponsors Rome 2015_files/Amazon-messo-sul-sito-240x240-240x240.jpg b/Sponsors/Sponsors Rome 2015_files/Amazon-messo-sul-sito-240x240-240x240.jpg
new file mode 100644
index 0000000..e1d6a7d
Binary files /dev/null and b/Sponsors/Sponsors Rome 2015_files/Amazon-messo-sul-sito-240x240-240x240.jpg differ
diff --git a/Sponsors/Sponsors Rome 2015_files/Bravofly-messo-sul-sito1-240x240-240x240.jpg b/Sponsors/Sponsors Rome 2015_files/Bravofly-messo-sul-sito1-240x240-240x240.jpg
new file mode 100644
index 0000000..cc701e6
Binary files /dev/null and b/Sponsors/Sponsors Rome 2015_files/Bravofly-messo-sul-sito1-240x240-240x240.jpg differ
diff --git a/Sponsors/Sponsors Rome 2015_files/Capgemini_highres-240x240-240x240.png b/Sponsors/Sponsors Rome 2015_files/Capgemini_highres-240x240-240x240.png
new file mode 100644
index 0000000..dd81b7a
Binary files /dev/null and b/Sponsors/Sponsors Rome 2015_files/Capgemini_highres-240x240-240x240.png differ
diff --git a/Sponsors/Sponsors Rome 2015_files/Dedagroup-messo-sul-sito-240x240-240x240.jpg b/Sponsors/Sponsors Rome 2015_files/Dedagroup-messo-sul-sito-240x240-240x240.jpg
new file mode 100644
index 0000000..0e5a676
Binary files /dev/null and b/Sponsors/Sponsors Rome 2015_files/Dedagroup-messo-sul-sito-240x240-240x240.jpg differ
diff --git a/Sponsors/Sponsors Rome 2015_files/Google.png b/Sponsors/Sponsors Rome 2015_files/Google.png
new file mode 100644
index 0000000..d3a14e2
Binary files /dev/null and b/Sponsors/Sponsors Rome 2015_files/Google.png differ
diff --git a/Sponsors/Sponsors Rome 2015_files/IBM_Diamond-240x240.jpg b/Sponsors/Sponsors Rome 2015_files/IBM_Diamond-240x240.jpg
new file mode 100644
index 0000000..d297815
Binary files /dev/null and b/Sponsors/Sponsors Rome 2015_files/IBM_Diamond-240x240.jpg differ
diff --git a/Sponsors/Sponsors Rome 2015_files/Intel_Platinum-240x240.jpg b/Sponsors/Sponsors Rome 2015_files/Intel_Platinum-240x240.jpg
new file mode 100644
index 0000000..4be6e03
Binary files /dev/null and b/Sponsors/Sponsors Rome 2015_files/Intel_Platinum-240x240.jpg differ
diff --git a/Sponsors/Sponsors Rome 2015_files/K-Tech-messo-sul-sito-240x240-240x240.jpg b/Sponsors/Sponsors Rome 2015_files/K-Tech-messo-sul-sito-240x240-240x240.jpg
new file mode 100644
index 0000000..757f3b8
Binary files /dev/null and b/Sponsors/Sponsors Rome 2015_files/K-Tech-messo-sul-sito-240x240-240x240.jpg differ
diff --git a/Sponsors/Sponsors Rome 2015_files/LVenture-240x240.jpg b/Sponsors/Sponsors Rome 2015_files/LVenture-240x240.jpg
new file mode 100644
index 0000000..3e87348
Binary files /dev/null and b/Sponsors/Sponsors Rome 2015_files/LVenture-240x240.jpg differ
diff --git a/Sponsors/Sponsors Rome 2015_files/Labs-Horizontal-Color-RGB-240x240.jpg b/Sponsors/Sponsors Rome 2015_files/Labs-Horizontal-Color-RGB-240x240.jpg
new file mode 100644
index 0000000..6e046cf
Binary files /dev/null and b/Sponsors/Sponsors Rome 2015_files/Labs-Horizontal-Color-RGB-240x240.jpg differ
diff --git a/Sponsors/Sponsors Rome 2015_files/Logo-green-vulcano-240x240.jpg b/Sponsors/Sponsors Rome 2015_files/Logo-green-vulcano-240x240.jpg
new file mode 100644
index 0000000..6c9b07d
Binary files /dev/null and b/Sponsors/Sponsors Rome 2015_files/Logo-green-vulcano-240x240.jpg differ
diff --git a/Sponsors/Sponsors Rome 2015_files/Mailjet_logo1-240x105.png b/Sponsors/Sponsors Rome 2015_files/Mailjet_logo1-240x105.png
new file mode 100644
index 0000000..295a31c
Binary files /dev/null and b/Sponsors/Sponsors Rome 2015_files/Mailjet_logo1-240x105.png differ
diff --git a/Sponsors/Sponsors Rome 2015_files/Microsoft_Diamond.jpg b/Sponsors/Sponsors Rome 2015_files/Microsoft_Diamond.jpg
new file mode 100644
index 0000000..794b5c9
Binary files /dev/null and b/Sponsors/Sponsors Rome 2015_files/Microsoft_Diamond.jpg differ
diff --git a/Sponsors/Sponsors Rome 2015_files/Oracle.png b/Sponsors/Sponsors Rome 2015_files/Oracle.png
new file mode 100644
index 0000000..a8b2b29
Binary files /dev/null and b/Sponsors/Sponsors Rome 2015_files/Oracle.png differ
diff --git a/Sponsors/Sponsors Rome 2015_files/Redhat_Platinum-240x240.jpg b/Sponsors/Sponsors Rome 2015_files/Redhat_Platinum-240x240.jpg
new file mode 100644
index 0000000..573119e
Binary files /dev/null and b/Sponsors/Sponsors Rome 2015_files/Redhat_Platinum-240x240.jpg differ
diff --git a/Sponsors/Sponsors Rome 2015_files/Starbytes-240x240.png b/Sponsors/Sponsors Rome 2015_files/Starbytes-240x240.png
new file mode 100644
index 0000000..4cbf33d
Binary files /dev/null and b/Sponsors/Sponsors Rome 2015_files/Starbytes-240x240.png differ
diff --git a/Sponsors/Sponsors Rome 2015_files/WIND-240x240.jpg b/Sponsors/Sponsors Rome 2015_files/WIND-240x240.jpg
new file mode 100644
index 0000000..1a6100d
Binary files /dev/null and b/Sponsors/Sponsors Rome 2015_files/WIND-240x240.jpg differ
diff --git a/Sponsors/Sponsors Rome 2015_files/codemotion_logo.png b/Sponsors/Sponsors Rome 2015_files/codemotion_logo.png
new file mode 100644
index 0000000..0db46d5
Binary files /dev/null and b/Sponsors/Sponsors Rome 2015_files/codemotion_logo.png differ
diff --git a/Sponsors/Sponsors Rome 2015_files/decisyon-240x240.jpg b/Sponsors/Sponsors Rome 2015_files/decisyon-240x240.jpg
new file mode 100644
index 0000000..cdb89d0
Binary files /dev/null and b/Sponsors/Sponsors Rome 2015_files/decisyon-240x240.jpg differ
diff --git a/Sponsors/Sponsors Rome 2015_files/everis-240x240.jpg b/Sponsors/Sponsors Rome 2015_files/everis-240x240.jpg
new file mode 100644
index 0000000..d574df1
Binary files /dev/null and b/Sponsors/Sponsors Rome 2015_files/everis-240x240.jpg differ
diff --git a/Sponsors/Sponsors Rome 2015_files/infocert-240x240.png b/Sponsors/Sponsors Rome 2015_files/infocert-240x240.png
new file mode 100644
index 0000000..3890fbe
Binary files /dev/null and b/Sponsors/Sponsors Rome 2015_files/infocert-240x240.png differ
diff --git a/Sponsors/Sponsors Rome 2015_files/jamgle_logo-240x240.jpg b/Sponsors/Sponsors Rome 2015_files/jamgle_logo-240x240.jpg
new file mode 100644
index 0000000..9cbfbf0
Binary files /dev/null and b/Sponsors/Sponsors Rome 2015_files/jamgle_logo-240x240.jpg differ
diff --git a/Sponsors/Sponsors Rome 2015_files/logomfr-240x240.jpg b/Sponsors/Sponsors Rome 2015_files/logomfr-240x240.jpg
new file mode 100644
index 0000000..254573f
Binary files /dev/null and b/Sponsors/Sponsors Rome 2015_files/logomfr-240x240.jpg differ
diff --git a/Sponsors/Sponsors Rome 2015_files/monster300-240x240.png b/Sponsors/Sponsors Rome 2015_files/monster300-240x240.png
new file mode 100644
index 0000000..7904b2d
Binary files /dev/null and b/Sponsors/Sponsors Rome 2015_files/monster300-240x240.png differ
diff --git a/Sponsors/Sponsors Rome 2015_files/neomobile-logo-240x179.png b/Sponsors/Sponsors Rome 2015_files/neomobile-logo-240x179.png
new file mode 100644
index 0000000..199bd01
Binary files /dev/null and b/Sponsors/Sponsors Rome 2015_files/neomobile-logo-240x179.png differ
diff --git a/Sponsors/Sponsors Rome 2015_files/nttdata-240x240.jpg b/Sponsors/Sponsors Rome 2015_files/nttdata-240x240.jpg
new file mode 100644
index 0000000..e061b1b
Binary files /dev/null and b/Sponsors/Sponsors Rome 2015_files/nttdata-240x240.jpg differ
diff --git a/Sponsors/Sponsors Rome 2015_files/redbull-quadrato-240x240.jpg b/Sponsors/Sponsors Rome 2015_files/redbull-quadrato-240x240.jpg
new file mode 100644
index 0000000..cb91ee1
Binary files /dev/null and b/Sponsors/Sponsors Rome 2015_files/redbull-quadrato-240x240.jpg differ
diff --git a/node_modules/grunt-appcache/.gitattributes b/node_modules/grunt-appcache/.gitattributes
new file mode 100644
index 0000000..ca96d04
--- /dev/null
+++ b/node_modules/grunt-appcache/.gitattributes
@@ -0,0 +1,2 @@
+# Use native line endings
+* text=auto
diff --git a/node_modules/grunt-appcache/.jshintrc b/node_modules/grunt-appcache/.jshintrc
new file mode 100644
index 0000000..389b131
--- /dev/null
+++ b/node_modules/grunt-appcache/.jshintrc
@@ -0,0 +1,24 @@
+{
+ "camelcase": true,
+ "curly": true,
+ "immed": true,
+ "indent": 4,
+ "latedef": true,
+ "newcap": true,
+ "noarg": true,
+ "quotmark": "single",
+ "undef": true,
+ "unused": true,
+ "strict": false,
+ "trailing": true,
+ "boss": true,
+ "debug": true,
+ "expr": true,
+ "loopfunc": true,
+ "multistr": true,
+ "smarttabs": true,
+ "supernew": true,
+
+ "browser": true,
+ "node": true
+}
diff --git a/node_modules/grunt-appcache/.npmignore b/node_modules/grunt-appcache/.npmignore
new file mode 100644
index 0000000..da42947
--- /dev/null
+++ b/node_modules/grunt-appcache/.npmignore
@@ -0,0 +1,2 @@
+/tmp/
+/node_modules/
diff --git a/node_modules/grunt-appcache/Gruntfile.js b/node_modules/grunt-appcache/Gruntfile.js
new file mode 100644
index 0000000..a50c9d4
--- /dev/null
+++ b/node_modules/grunt-appcache/Gruntfile.js
@@ -0,0 +1,52 @@
+/*
+ * grunt-appcache
+ * http://canvace.com/
+ *
+ * Copyright (c) 2013 Canvace Srl
+ * Licensed under the MIT license.
+ */
+
+'use strict';
+
+module.exports = function (grunt) {
+
+ grunt.initConfig({
+ jshint: {
+ all: [
+ 'Gruntfile.js',
+ 'tasks/**/*.js',
+ '<%= nodeunit.tests %>',
+ ],
+ options: {
+ jshintrc: '.jshintrc',
+ },
+ },
+
+ clean: {
+ tests: ['tmp'],
+ },
+
+ appcache: {
+ options: {
+ basePath: 'test'
+ },
+ test: {
+ dest: 'tmp/appcache.manifest',
+ cache: 'test/**/*'
+ }
+ },
+
+ nodeunit: {
+ tests: ['test/*_test.js'],
+ },
+ });
+
+ grunt.loadTasks('tasks');
+ grunt.loadNpmTasks('grunt-contrib-jshint');
+ grunt.loadNpmTasks('grunt-contrib-clean');
+ grunt.loadNpmTasks('grunt-contrib-nodeunit');
+
+ grunt.registerTask('test', ['clean', 'appcache', 'nodeunit']);
+ grunt.registerTask('default', ['jshint', 'test']);
+
+};
diff --git a/node_modules/grunt-appcache/LICENSE b/node_modules/grunt-appcache/LICENSE
new file mode 100644
index 0000000..6576288
--- /dev/null
+++ b/node_modules/grunt-appcache/LICENSE
@@ -0,0 +1,22 @@
+Copyright (c) 2013 Canvace Srl
+
+Permission is hereby granted, free of charge, to any person
+obtaining a copy of this software and associated documentation
+files (the "Software"), to deal in the Software without
+restriction, including without limitation the rights to use,
+copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the
+Software is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/grunt-appcache/README.md b/node_modules/grunt-appcache/README.md
new file mode 100644
index 0000000..9c1e1e5
--- /dev/null
+++ b/node_modules/grunt-appcache/README.md
@@ -0,0 +1,127 @@
+# grunt-appcache
+
+> Grunt task for generating an HTML5 AppCache manifest from the specified list of files.
+
+## Getting Started
+This plugin requires Grunt `~0.4.1`
+
+If you haven't used [Grunt](http://gruntjs.com/) before, be sure to check out the [Getting Started](http://gruntjs.com/getting-started) guide, as it explains how to create a [Gruntfile](http://gruntjs.com/sample-gruntfile) as well as install and use Grunt plugins. Once you're familiar with that process, you may install this plugin with this command:
+
+```shell
+npm install grunt-appcache --save-dev
+```
+
+Once the plugin has been installed, it may be enabled inside your Gruntfile with this line of JavaScript:
+
+```js
+grunt.loadNpmTasks('grunt-appcache');
+```
+
+## The "appcache" task
+
+### Overview
+In your project's Gruntfile, add a section named `appcache` to the data object passed into `grunt.initConfig()`.
+
+```js
+grunt.initConfig({
+ appcache: {
+ options: {
+ // Task-specific options go here.
+ },
+ your_target: {
+ // Target-specific file lists and/or options go here.
+ },
+ },
+})
+```
+
+### Options
+
+#### options.basePath
+Type: `String`
+Default value: `process.cwd()`
+
+The absolute or relative path to the directory to consider as the root of the application for which to generate the cache manifest.
+
+#### options.baseUrl
+Type: `String`
+Default value: `undefined`
+
+The base URL to prepand to all expanded cache entries.
+
+#### options.ignoreManifest
+Type: `Boolean`
+Default value: `true`
+
+Specifies if to ignore the cache manifest itself from the list of files to insert in the "CACHE:" section.
+
+#### options.preferOnline
+Type: `Boolean`
+Default value: `false`
+
+Specifies whether to write the "prefer-online" entry in the "SETTINGS:" section or not. [More information](http://www.whatwg.org/specs/web-apps/current-work/multipage/browsers.html#appcache).
+
+### Target fields
+
+#### dest
+
+`String` indicating the output path for the AppCache manifest.
+
+#### cache
+
+A descriptor for the "CACHE:" entries. A cache descriptor can be either a `String` or an `Array` of `String`s, in the format accepted by the `patterns` argument to [grunt.file.expand](http://gruntjs.com/api/grunt.file#grunt.file.expand).
+Alternatively, this argument can be an `Object` containing the optional properties `patterns` (a cache descriptor, as defined earlier) and `literals` (`String` or `Array` of `String`s to insert as is in the "CACHE:" section).
+
+#### ignored
+
+Files to be ignored and excluded from the "CACHE:" entries. This parameter has been deprecated since v0.1.4, when proper support for the `!` prefix to the glob patterns was added (this serves the same purpose while being more concise).
+
+#### network
+
+`String` or `Array` of `String`s to insert as is in the "NETWORK:" section.
+
+#### fallback
+
+`String` or `Array` of `String`s to insert as is in the "FALLBACK:" section.
+
+### Usage Examples
+
+In this example, the module is set to generate an AppCache manifest from the contents of the `static` directory, placing the resulting manifest in `static/manifest.appcache`. The `basePath` option allows the module to generate paths relative to the `static` directory, instead of the directory where the gruntfile resides.
+
+```js
+grunt.initConfig({
+ appcache: {
+ options: {
+ basePath: 'static'
+ },
+ all: {
+ dest: 'static/manifest.appcache',
+ cache: 'static/**/*',
+ network: '*',
+ fallback: '/ /offline.html'
+ }
+ }
+})
+```
+
+The next example uses the extended syntax to the `cache` parameter:
+
+```js
+grunt.initConfig({
+ appcache: {
+ options: {
+ basePath: 'static'
+ },
+ all: {
+ dest: 'static/manifest.appcache',
+ cache: {
+ patterns: [
+ 'static/**/*', // all the resources in 'static/'
+ '!static/ignored/**/*' // except the 'static/ignored/' subtree
+ ],
+ literals: '/' // insert '/' as is in the "CACHE:" section
+ }
+ }
+ }
+})
+```
diff --git a/node_modules/grunt-appcache/package.json b/node_modules/grunt-appcache/package.json
new file mode 100644
index 0000000..517073d
--- /dev/null
+++ b/node_modules/grunt-appcache/package.json
@@ -0,0 +1,62 @@
+{
+ "name": "grunt-appcache",
+ "description": "Grunt task for generating an HTML5 AppCache manifest.",
+ "version": "0.1.8",
+ "homepage": "https://github.com/canvace/grunt-appcache/",
+ "author": {
+ "name": "Daniele Cocca",
+ "email": "daniele.cocca@gmail.com"
+ },
+ "repository": {
+ "type": "git",
+ "url": "https://github.com/canvace/grunt-appcache.git"
+ },
+ "bugs": {
+ "url": "https://github.com/canvace/grunt-appcache/issues"
+ },
+ "license": "MIT",
+ "main": "Gruntfile.js",
+ "engines": {
+ "node": ">= 0.8.0"
+ },
+ "scripts": {
+ "test": "grunt test"
+ },
+ "devDependencies": {
+ "grunt-contrib-jshint": "~0.6.0",
+ "grunt-contrib-clean": "~0.4.0",
+ "grunt-contrib-nodeunit": "~0.2.0",
+ "grunt": "~0.4.1"
+ },
+ "peerDependencies": {
+ "grunt": "~0.4.1"
+ },
+ "keywords": [
+ "grunt",
+ "gruntplugin",
+ "html5",
+ "manifest",
+ "appcache"
+ ],
+ "gitHead": "2b2b02dde4ac09bb5eeb071251a3df67668af066",
+ "_id": "grunt-appcache@0.1.8",
+ "_shasum": "6e741862025d9497f61560d8d58b5003349c1d31",
+ "_from": "grunt-appcache@*",
+ "_npmVersion": "1.4.21",
+ "_npmUser": {
+ "name": "jmc88",
+ "email": "daniele.cocca@canvace.com"
+ },
+ "maintainers": [
+ {
+ "name": "jmc88",
+ "email": "daniele.cocca@canvace.com"
+ }
+ ],
+ "dist": {
+ "shasum": "6e741862025d9497f61560d8d58b5003349c1d31",
+ "tarball": "http://registry.npmjs.org/grunt-appcache/-/grunt-appcache-0.1.8.tgz"
+ },
+ "directories": {},
+ "_resolved": "https://registry.npmjs.org/grunt-appcache/-/grunt-appcache-0.1.8.tgz"
+}
diff --git a/node_modules/grunt-appcache/tasks/appcache.js b/node_modules/grunt-appcache/tasks/appcache.js
new file mode 100644
index 0000000..3301de2
--- /dev/null
+++ b/node_modules/grunt-appcache/tasks/appcache.js
@@ -0,0 +1,111 @@
+/*
+ * grunt-appcache
+ * http://canvace.com/
+ *
+ * Copyright (c) 2013 Canvace Srl
+ * Licensed under the MIT license.
+ */
+
+'use strict';
+
+module.exports = function (grunt) {
+
+ var path = require('path');
+ var appcache = require('./lib/appcache').init(grunt);
+
+ function array(input) {
+ return Array.isArray(input) ? input : [input];
+ }
+
+ function isUrl(path) {
+ return (/^(?:https?:)?\/\//i).test(path);
+ }
+
+ function joinUrl(/* ... */) {
+ return Array.prototype.map.call(arguments, function (part) {
+ // remove trailing slashes
+ return part.replace(/\/+$/, '');
+ }).join('/');
+ }
+
+ function relative(basePath, filePath) {
+ return path.relative(
+ path.normalize(basePath),
+ path.normalize(filePath));
+ }
+
+ function expand(pattern, basePath) {
+ var matches = grunt.file.expand({
+ filter: function (src) {
+ return grunt.file.isFile(src) || isUrl(src);
+ }
+ }, pattern);
+ if (typeof basePath === 'string') {
+ matches = matches.map(function (filePath) {
+ return relative(basePath, filePath);
+ });
+ }
+ return matches;
+ }
+
+ grunt.registerMultiTask('appcache', 'Automatically generates an HTML5 AppCache manifest from a list of files.', function () {
+ var output = path.normalize(this.data.dest);
+ var options = this.options({
+ basePath: process.cwd(),
+ ignoreManifest: true,
+ preferOnline: false
+ });
+
+ var ignored = [];
+ if (this.data.ignored) {
+ ignored = expand(this.data.ignored, options.basePath);
+ }
+ if (options.ignoreManifest) {
+ ignored.push(relative(options.basePath, output));
+ }
+
+ var cachePatterns = array(this.data.cache || []);
+ if (typeof this.data.cache === 'object') {
+ this.data.cache.patterns = array(this.data.cache.patterns || []);
+ this.data.cache.literals = array(this.data.cache.literals || []);
+ cachePatterns = this.data.cache.patterns;
+ }
+ var cache = expand(cachePatterns, options.basePath).filter(function (path) {
+ return ignored.indexOf(path) === -1;
+ });
+ if (typeof options.baseUrl === 'string') {
+ cache = cache.map(function (path) {
+ return joinUrl(options.baseUrl, path);
+ });
+ }
+ if (typeof this.data.cache === 'object') {
+ Array.prototype.push.apply(cache, this.data.cache.literals);
+ }
+
+ var manifest = {
+ version: {
+ revision: 1,
+ date: new Date()
+ },
+ cache: cache,
+ network: array(this.data.network || []),
+ fallback: array(this.data.fallback || []),
+ settings: options.preferOnline ? ['prefer-online'] : []
+ };
+
+ if (grunt.file.exists(output)) {
+ var original = appcache.readManifest(output);
+ manifest.version.revision = (1 + original.version.revision);
+ }
+
+ if (!appcache.writeManifest(output, manifest)) {
+ grunt.log.error('AppCache manifest creation failed.');
+ return false;
+ }
+
+ grunt.log.writeln('AppCache manifest "' +
+ path.basename(output) +
+ '" created.');
+ });
+
+};
diff --git a/node_modules/grunt-appcache/tasks/lib/appcache.js b/node_modules/grunt-appcache/tasks/lib/appcache.js
new file mode 100644
index 0000000..f69dd7e
--- /dev/null
+++ b/node_modules/grunt-appcache/tasks/lib/appcache.js
@@ -0,0 +1,138 @@
+/*
+ * grunt-appcache
+ * http://canvace.com/
+ *
+ * Copyright (c) 2013 Canvace Srl
+ * Licensed under the MIT license.
+ */
+
+'use strict';
+
+module.exports.init = function (grunt) {
+
+ var path = require('path');
+ var exports = {};
+
+ exports.readManifest = function (filepath) {
+ if (!filepath || !grunt.file.exists(filepath)) {
+ grunt.verbose.error('file "' + filepath + '" does not exist');
+ return false;
+ }
+
+ var manifest = {
+ version: {
+ revision: 1,
+ date: new Date().toISOString()
+ },
+ cache: [],
+ network: [],
+ fallback: []
+ };
+ var section = 'cache';
+ var foundHeader = false;
+ var foundVersion = false;
+
+ var lines = grunt.file.read(filepath)
+ .split(/\r?\n/)
+ .map(function (line) {
+ return line.trim();
+ });
+
+ var manifestSections = {
+ 'CACHE:': 'cache',
+ 'NETWORK:': 'network',
+ 'FALLBACK:': 'fallback',
+ 'SETTINGS': 'settings'
+ };
+
+ for (var i = 0; i < lines.length; ++i) {
+ if (lines[i] === '') {
+ continue;
+ }
+
+ if (lines[i][0] === '#') {
+ if (!foundVersion) {
+ var re = /# rev (\d+) - (\d{4}-\d{2}-\d{2}T\d{2}:\d{2}:\d{2}(?:\.\d{3})?Z)/;
+ var matches = re.exec(lines[i]);
+ if (matches) {
+ manifest.version.revision = parseInt(matches[1], 10);
+ manifest.version.date = new Date(matches[2]).toISOString();
+ foundVersion = true;
+ }
+ }
+ continue;
+ }
+
+ if (lines[i] === 'CACHE MANIFEST') {
+ if (foundHeader) {
+ grunt.verbose.error('duplicate "CACHE MANIFEST" header');
+ return false;
+ }
+ foundHeader = true;
+ } else if (lines[i] in manifestSections) {
+ if (!foundHeader) {
+ grunt.verbose.error('found section "' + lines[i] + '" before the "CACHE MANIFEST" header');
+ return false;
+ }
+ section = manifestSections[lines[i]];
+ } else {
+ if (!foundHeader) {
+ grunt.verbose.error('unexpected "' + lines[i] + '" before the "CACHE MANIFEST" header');
+ return false;
+ }
+ manifest[section].push(lines[i]);
+ }
+ }
+
+ return manifest;
+ };
+
+ exports.writeManifest = function (filepath, manifest) {
+ var contents = ['CACHE MANIFEST'];
+ var i;
+
+ if (manifest.version.date.toISOString) {
+ contents.push('# rev ' + manifest.version.revision + ' - ' + manifest.version.date.toISOString());
+ } else {
+ contents.push('# rev ' + manifest.version.revision + ' - ' + manifest.version.date);
+ }
+
+ if (0 !== manifest.cache.length) {
+ contents.push('');
+ contents.push('CACHE:');
+ for (i = 0; i < manifest.cache.length; ++i) {
+ contents.push(manifest.cache[i].split(path.sep).join('/'));
+ }
+ }
+
+ if (0 !== manifest.network.length) {
+ contents.push('');
+ contents.push('NETWORK:');
+ for (i = 0; i < manifest.network.length; ++i) {
+ contents.push(manifest.network[i]);
+ }
+ }
+
+ if (0 !== manifest.fallback.length) {
+ contents.push('');
+ contents.push('FALLBACK:');
+ for (i = 0; i < manifest.fallback.length; ++i) {
+ contents.push(manifest.fallback[i]);
+ }
+ }
+
+ if (0 !== manifest.settings.length) {
+ contents.push('');
+ contents.push('SETTINGS:');
+ for (i = 0; i < manifest.settings.length; ++i) {
+ contents.push(manifest.settings[i]);
+ }
+ }
+
+ return grunt.file.write(filepath, contents.join('\n'));
+ };
+
+ return exports;
+
+};
+
diff --git a/node_modules/grunt-appcache/test/appcache_test.js b/node_modules/grunt-appcache/test/appcache_test.js
new file mode 100644
index 0000000..817e03c
--- /dev/null
+++ b/node_modules/grunt-appcache/test/appcache_test.js
@@ -0,0 +1,43 @@
+'use strict';
+
+var grunt = require('grunt');
+var appcache = require('../tasks/lib/appcache').init(grunt);
+
+/*
+ ======== A Handy Little Nodeunit Reference ========
+ https://github.com/caolan/nodeunit
+
+ Test methods:
+ test.expect(numAssertions)
+ test.done()
+ Test assertions:
+ test.ok(value, [message])
+ test.equal(actual, expected, [message])
+ test.notEqual(actual, expected, [message])
+ test.deepEqual(actual, expected, [message])
+ test.notDeepEqual(actual, expected, [message])
+ test.strictEqual(actual, expected, [message])
+ test.notStrictEqual(actual, expected, [message])
+ test.throws(block, [error], [message])
+ test.doesNotThrow(block, [error], [message])
+ test.ifError(value)
+ */
+
+exports.appcache = {
+ setUp: function (done) {
+ // setup here if necessary
+ done();
+ },
+
+ read: {
+ revisionNumber: function (test) {
+ test.expect(1);
+
+ var actual = appcache.readManifest('test/fixtures/read/revision.manifest');
+ var expected = grunt.file.readJSON('test/expected/read/revision.json');
+ test.deepEqual(actual, expected, 'should correctly parse the manifest and save its revision number.');
+
+ test.done();
+ }
+ }
+};
diff --git a/node_modules/grunt-appcache/test/expected/read/revision.json b/node_modules/grunt-appcache/test/expected/read/revision.json
new file mode 100644
index 0000000..565f504
--- /dev/null
+++ b/node_modules/grunt-appcache/test/expected/read/revision.json
@@ -0,0 +1 @@
+{"version":{"revision":5,"date":"2011-10-05T14:48:00.000Z"},"cache":[],"network":[],"fallback":[]}
\ No newline at end of file
diff --git a/node_modules/grunt-appcache/test/fixtures/read/revision.manifest b/node_modules/grunt-appcache/test/fixtures/read/revision.manifest
new file mode 100644
index 0000000..ec89e73
--- /dev/null
+++ b/node_modules/grunt-appcache/test/fixtures/read/revision.manifest
@@ -0,0 +1,4 @@
+CACHE MANIFEST
+# empty, just for the sake of testing the correct parsing
+# of the revision line
+# rev 5 - 2011-10-05T14:48:00.000Z
diff --git a/node_modules/grunt/.npmignore b/node_modules/grunt/.npmignore
new file mode 100644
index 0000000..5032ab2
--- /dev/null
+++ b/node_modules/grunt/.npmignore
@@ -0,0 +1,7 @@
+docs
+test
+.travis.yml
+AUTHORS
+CHANGELOG
+custom-gruntfile.js
+Gruntfile.js
diff --git a/node_modules/grunt/CONTRIBUTING.md b/node_modules/grunt/CONTRIBUTING.md
new file mode 100644
index 0000000..5d08cc3
--- /dev/null
+++ b/node_modules/grunt/CONTRIBUTING.md
@@ -0,0 +1 @@
+Please see the [Contributing to grunt](http://gruntjs.com/contributing) guide for information on contributing to this project.
diff --git a/node_modules/grunt/LICENSE-MIT b/node_modules/grunt/LICENSE-MIT
new file mode 100644
index 0000000..1056fb5
--- /dev/null
+++ b/node_modules/grunt/LICENSE-MIT
@@ -0,0 +1,22 @@
+Copyright (c) 2014 "Cowboy" Ben Alman
+
+Permission is hereby granted, free of charge, to any person
+obtaining a copy of this software and associated documentation
+files (the "Software"), to deal in the Software without
+restriction, including without limitation the rights to use,
+copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the
+Software is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/grunt/README.md b/node_modules/grunt/README.md
new file mode 100644
index 0000000..df3d344
--- /dev/null
+++ b/node_modules/grunt/README.md
@@ -0,0 +1,20 @@
+# Grunt: The JavaScript Task Runner
+
+[](http://travis-ci.org/gruntjs/grunt)
+', ' '],
+ 'italic' : ['', ' '],
+ 'underline' : ['', ' '],
+ 'inverse' : ['', ' '],
+ 'strikethrough' : ['', ''],
+ //text colors
+ //grayscale
+ 'white' : ['', ' '],
+ 'grey' : ['', ' '],
+ 'black' : ['', ' '],
+ //colors
+ 'blue' : ['', ' '],
+ 'cyan' : ['', ' '],
+ 'green' : ['', ' '],
+ 'magenta' : ['', ' '],
+ 'red' : ['', ' '],
+ 'yellow' : ['', ' '],
+ //background colors
+ //grayscale
+ 'whiteBG' : ['', ' '],
+ 'greyBG' : ['', ' '],
+ 'blackBG' : ['', ' '],
+ //colors
+ 'blueBG' : ['', ' '],
+ 'cyanBG' : ['', ' '],
+ 'greenBG' : ['', ' '],
+ 'magentaBG' : ['', ' '],
+ 'redBG' : ['', ' '],
+ 'yellowBG' : ['', ' ']
+ };
+ } else if (exports.mode === 'none') {
+ return str + '';
+ } else {
+ console.log('unsupported mode, try "browser", "console" or "none"');
+ }
+ return styles[style][0] + str + styles[style][1];
+}
+
+function applyTheme(theme) {
+
+ //
+ // Remark: This is a list of methods that exist
+ // on String that you should not overwrite.
+ //
+ var stringPrototypeBlacklist = [
+ '__defineGetter__', '__defineSetter__', '__lookupGetter__', '__lookupSetter__', 'charAt', 'constructor',
+ 'hasOwnProperty', 'isPrototypeOf', 'propertyIsEnumerable', 'toLocaleString', 'toString', 'valueOf', 'charCodeAt',
+ 'indexOf', 'lastIndexof', 'length', 'localeCompare', 'match', 'replace', 'search', 'slice', 'split', 'substring',
+ 'toLocaleLowerCase', 'toLocaleUpperCase', 'toLowerCase', 'toUpperCase', 'trim', 'trimLeft', 'trimRight'
+ ];
+
+ Object.keys(theme).forEach(function (prop) {
+ if (stringPrototypeBlacklist.indexOf(prop) !== -1) {
+ console.log('warn: '.red + ('String.prototype' + prop).magenta + ' is probably something you don\'t want to override. Ignoring style name');
+ }
+ else {
+ if (typeof(theme[prop]) === 'string') {
+ addProperty(prop, function () {
+ return exports[theme[prop]](this);
+ });
+ }
+ else {
+ addProperty(prop, function () {
+ var ret = this;
+ for (var t = 0; t < theme[prop].length; t++) {
+ ret = exports[theme[prop][t]](ret);
+ }
+ return ret;
+ });
+ }
+ }
+ });
+}
+
+
+//
+// Iterate through all default styles and colors
+//
+var x = ['bold', 'underline', 'strikethrough', 'italic', 'inverse', 'grey', 'black', 'yellow', 'red', 'green', 'blue', 'white', 'cyan', 'magenta', 'greyBG', 'blackBG', 'yellowBG', 'redBG', 'greenBG', 'blueBG', 'whiteBG', 'cyanBG', 'magentaBG'];
+x.forEach(function (style) {
+
+ // __defineGetter__ at the least works in more browsers
+ // http://robertnyman.com/javascript/javascript-getters-setters.html
+ // Object.defineProperty only works in Chrome
+ addProperty(style, function () {
+ return stylize(this, style);
+ });
+});
+
+function sequencer(map) {
+ return function () {
+ if (!isHeadless) {
+ return this.replace(/( )/, '$1');
+ }
+ var exploded = this.split(""), i = 0;
+ exploded = exploded.map(map);
+ return exploded.join("");
+ };
+}
+
+var rainbowMap = (function () {
+ var rainbowColors = ['red', 'yellow', 'green', 'blue', 'magenta']; //RoY G BiV
+ return function (letter, i, exploded) {
+ if (letter === " ") {
+ return letter;
+ } else {
+ return stylize(letter, rainbowColors[i++ % rainbowColors.length]);
+ }
+ };
+})();
+
+exports.themes = {};
+
+exports.addSequencer = function (name, map) {
+ addProperty(name, sequencer(map));
+};
+
+exports.addSequencer('rainbow', rainbowMap);
+exports.addSequencer('zebra', function (letter, i, exploded) {
+ return i % 2 === 0 ? letter : letter.inverse;
+});
+
+exports.setTheme = function (theme) {
+ if (typeof theme === 'string') {
+ try {
+ exports.themes[theme] = require(theme);
+ applyTheme(exports.themes[theme]);
+ return exports.themes[theme];
+ } catch (err) {
+ console.log(err);
+ return err;
+ }
+ } else {
+ applyTheme(theme);
+ }
+};
+
+
+addProperty('stripColors', function () {
+ return ("" + this).replace(/\x1B\[\d+m/g, '');
+});
+
+// please no
+function zalgo(text, options) {
+ var soul = {
+ "up" : [
+ '̍', '̎', '̄', '̅',
+ '̿', '̑', '̆', '̐',
+ '͒', '͗', '͑', '̇',
+ '̈', '̊', '͂', '̓',
+ '̈', '͊', '͋', '͌',
+ '̃', '̂', '̌', '͐',
+ '̀', '́', '̋', '̏',
+ '̒', '̓', '̔', '̽',
+ '̉', 'ͣ', 'ͤ', 'ͥ',
+ 'ͦ', 'ͧ', 'ͨ', 'ͩ',
+ 'ͪ', 'ͫ', 'ͬ', 'ͭ',
+ 'ͮ', 'ͯ', '̾', '͛',
+ '͆', '̚'
+ ],
+ "down" : [
+ '̖', '̗', '̘', '̙',
+ '̜', '̝', '̞', '̟',
+ '̠', '̤', '̥', '̦',
+ '̩', '̪', '̫', '̬',
+ '̭', '̮', '̯', '̰',
+ '̱', '̲', '̳', '̹',
+ '̺', '̻', '̼', 'ͅ',
+ '͇', '͈', '͉', '͍',
+ '͎', '͓', '͔', '͕',
+ '͖', '͙', '͚', '̣'
+ ],
+ "mid" : [
+ '̕', '̛', '̀', '́',
+ '͘', '̡', '̢', '̧',
+ '̨', '̴', '̵', '̶',
+ '͜', '͝', '͞',
+ '͟', '͠', '͢', '̸',
+ '̷', '͡', ' ҉'
+ ]
+ },
+ all = [].concat(soul.up, soul.down, soul.mid),
+ zalgo = {};
+
+ function randomNumber(range) {
+ var r = Math.floor(Math.random() * range);
+ return r;
+ }
+
+ function is_char(character) {
+ var bool = false;
+ all.filter(function (i) {
+ bool = (i === character);
+ });
+ return bool;
+ }
+
+ function heComes(text, options) {
+ var result = '', counts, l;
+ options = options || {};
+ options["up"] = options["up"] || true;
+ options["mid"] = options["mid"] || true;
+ options["down"] = options["down"] || true;
+ options["size"] = options["size"] || "maxi";
+ text = text.split('');
+ for (l in text) {
+ if (is_char(l)) {
+ continue;
+ }
+ result = result + text[l];
+ counts = {"up" : 0, "down" : 0, "mid" : 0};
+ switch (options.size) {
+ case 'mini':
+ counts.up = randomNumber(8);
+ counts.min = randomNumber(2);
+ counts.down = randomNumber(8);
+ break;
+ case 'maxi':
+ counts.up = randomNumber(16) + 3;
+ counts.min = randomNumber(4) + 1;
+ counts.down = randomNumber(64) + 3;
+ break;
+ default:
+ counts.up = randomNumber(8) + 1;
+ counts.mid = randomNumber(6) / 2;
+ counts.down = randomNumber(8) + 1;
+ break;
+ }
+
+ var arr = ["up", "mid", "down"];
+ for (var d in arr) {
+ var index = arr[d];
+ for (var i = 0 ; i <= counts[index]; i++) {
+ if (options[index]) {
+ result = result + soul[index][randomNumber(soul[index].length)];
+ }
+ }
+ }
+ }
+ return result;
+ }
+ return heComes(text);
+}
+
+
+// don't summon zalgo
+addProperty('zalgo', function () {
+ return zalgo(this);
+});
diff --git a/node_modules/grunt/node_modules/colors/example.html b/node_modules/grunt/node_modules/colors/example.html
new file mode 100644
index 0000000..7a2ae60
--- /dev/null
+++ b/node_modules/grunt/node_modules/colors/example.html
@@ -0,0 +1,76 @@
+
+
+
+ Colors Example
+
+
+
+
+
+
\ No newline at end of file
diff --git a/node_modules/grunt/node_modules/colors/example.js b/node_modules/grunt/node_modules/colors/example.js
new file mode 100644
index 0000000..b1e03a4
--- /dev/null
+++ b/node_modules/grunt/node_modules/colors/example.js
@@ -0,0 +1,77 @@
+var colors = require('./colors');
+
+//colors.mode = "browser";
+
+var test = colors.red("hopefully colorless output");
+console.log('Rainbows are fun!'.rainbow);
+console.log('So '.italic + 'are'.underline + ' styles! '.bold + 'inverse'.inverse); // styles not widely supported
+console.log('Chains are also cool.'.bold.italic.underline.red); // styles not widely supported
+//console.log('zalgo time!'.zalgo);
+console.log(test.stripColors);
+console.log("a".grey + " b".black);
+console.log("Zebras are so fun!".zebra);
+console.log('background color attack!'.black.whiteBG)
+
+//
+// Remark: .strikethrough may not work with Mac OS Terminal App
+//
+console.log("This is " + "not".strikethrough + " fun.");
+console.log(colors.rainbow('Rainbows are fun!'));
+console.log(colors.italic('So ') + colors.underline('are') + colors.bold(' styles! ') + colors.inverse('inverse')); // styles not widely supported
+console.log(colors.bold(colors.italic(colors.underline(colors.red('Chains are also cool.'))))); // styles not widely supported
+//console.log(colors.zalgo('zalgo time!'));
+console.log(colors.stripColors(test));
+console.log(colors.grey("a") + colors.black(" b"));
+
+colors.addSequencer("america", function(letter, i, exploded) {
+ if(letter === " ") return letter;
+ switch(i%3) {
+ case 0: return letter.red;
+ case 1: return letter.white;
+ case 2: return letter.blue;
+ }
+});
+
+colors.addSequencer("random", (function() {
+ var available = ['bold', 'underline', 'italic', 'inverse', 'grey', 'yellow', 'red', 'green', 'blue', 'white', 'cyan', 'magenta'];
+
+ return function(letter, i, exploded) {
+ return letter === " " ? letter : letter[available[Math.round(Math.random() * (available.length - 1))]];
+ };
+})());
+
+console.log("AMERICA! F--K YEAH!".america);
+console.log("So apparently I've been to Mars, with all the little green men. But you know, I don't recall.".random);
+
+//
+// Custom themes
+//
+
+// Load theme with JSON literal
+colors.setTheme({
+ silly: 'rainbow',
+ input: 'grey',
+ verbose: 'cyan',
+ prompt: 'grey',
+ info: 'green',
+ data: 'grey',
+ help: 'cyan',
+ warn: 'yellow',
+ debug: 'blue',
+ error: 'red'
+});
+
+// outputs red text
+console.log("this is an error".error);
+
+// outputs yellow text
+console.log("this is a warning".warn);
+
+// outputs grey text
+console.log("this is an input".input);
+
+// Load a theme from file
+colors.setTheme('./themes/winston-dark.js');
+
+console.log("this is an input".input);
+
diff --git a/node_modules/grunt/node_modules/colors/package.json b/node_modules/grunt/node_modules/colors/package.json
new file mode 100644
index 0000000..ba9b3aa
--- /dev/null
+++ b/node_modules/grunt/node_modules/colors/package.json
@@ -0,0 +1,46 @@
+{
+ "name": "colors",
+ "description": "get colors in your node.js console like what",
+ "version": "0.6.2",
+ "author": {
+ "name": "Marak Squires"
+ },
+ "homepage": "https://github.com/Marak/colors.js",
+ "bugs": {
+ "url": "https://github.com/Marak/colors.js/issues"
+ },
+ "keywords": [
+ "ansi",
+ "terminal",
+ "colors"
+ ],
+ "repository": {
+ "type": "git",
+ "url": "http://github.com/Marak/colors.js.git"
+ },
+ "engines": {
+ "node": ">=0.1.90"
+ },
+ "main": "colors",
+ "_id": "colors@0.6.2",
+ "dist": {
+ "shasum": "2423fe6678ac0c5dae8852e5d0e5be08c997abcc",
+ "tarball": "http://registry.npmjs.org/colors/-/colors-0.6.2.tgz"
+ },
+ "_from": "colors@>=0.6.2 <0.7.0",
+ "_npmVersion": "1.2.30",
+ "_npmUser": {
+ "name": "marak",
+ "email": "marak.squires@gmail.com"
+ },
+ "maintainers": [
+ {
+ "name": "marak",
+ "email": "marak.squires@gmail.com"
+ }
+ ],
+ "directories": {},
+ "_shasum": "2423fe6678ac0c5dae8852e5d0e5be08c997abcc",
+ "_resolved": "https://registry.npmjs.org/colors/-/colors-0.6.2.tgz",
+ "readme": "ERROR: No README data found!"
+}
diff --git a/node_modules/grunt/node_modules/colors/test.js b/node_modules/grunt/node_modules/colors/test.js
new file mode 100644
index 0000000..c32417d
--- /dev/null
+++ b/node_modules/grunt/node_modules/colors/test.js
@@ -0,0 +1,70 @@
+var assert = require('assert'),
+ colors = require('./colors');
+
+var s = 'string';
+
+function a(s, code) {
+ return '\x1B[' + code.toString() + 'm' + s + '\x1B[39m';
+}
+
+function aE(s, color, code) {
+ assert.equal(s[color], a(s, code));
+ assert.equal(colors[color](s), a(s, code));
+ assert.equal(s[color], colors[color](s));
+ assert.equal(s[color].stripColors, s);
+ assert.equal(s[color].stripColors, colors.stripColors(s));
+}
+
+function h(s, color) {
+ return '' + s + ' ';
+}
+
+var stylesColors = ['white', 'black', 'blue', 'cyan', 'green', 'magenta', 'red', 'yellow'];
+var stylesAll = stylesColors.concat(['bold', 'italic', 'underline', 'inverse', 'rainbow']);
+
+colors.mode = 'console';
+assert.equal(s.bold, '\x1B[1m' + s + '\x1B[22m');
+assert.equal(s.italic, '\x1B[3m' + s + '\x1B[23m');
+assert.equal(s.underline, '\x1B[4m' + s + '\x1B[24m');
+assert.equal(s.strikethrough, '\x1B[9m' + s + '\x1B[29m');
+assert.equal(s.inverse, '\x1B[7m' + s + '\x1B[27m');
+assert.ok(s.rainbow);
+aE(s, 'white', 37);
+aE(s, 'grey', 90);
+aE(s, 'black', 30);
+aE(s, 'blue', 34);
+aE(s, 'cyan', 36);
+aE(s, 'green', 32);
+aE(s, 'magenta', 35);
+aE(s, 'red', 31);
+aE(s, 'yellow', 33);
+assert.equal(s, 'string');
+
+colors.setTheme({error:'red'});
+
+assert.equal(typeof("astring".red),'string');
+assert.equal(typeof("astring".error),'string');
+
+colors.mode = 'browser';
+assert.equal(s.bold, '' + s + ' ');
+assert.equal(s.italic, '' + s + ' ');
+assert.equal(s.underline, '' + s + ' ');
+assert.equal(s.strikethrough, '' + s + '');
+assert.equal(s.inverse, '' + s + ' ');
+assert.ok(s.rainbow);
+stylesColors.forEach(function (color) {
+ assert.equal(s[color], h(s, color));
+ assert.equal(colors[color](s), h(s, color));
+});
+
+assert.equal(typeof("astring".red),'string');
+assert.equal(typeof("astring".error),'string');
+
+colors.mode = 'none';
+stylesAll.forEach(function (style) {
+ assert.equal(s[style], s);
+ assert.equal(colors[style](s), s);
+});
+
+assert.equal(typeof("astring".red),'string');
+assert.equal(typeof("astring".error),'string');
diff --git a/node_modules/grunt/node_modules/colors/themes/winston-dark.js b/node_modules/grunt/node_modules/colors/themes/winston-dark.js
new file mode 100644
index 0000000..49a905b
--- /dev/null
+++ b/node_modules/grunt/node_modules/colors/themes/winston-dark.js
@@ -0,0 +1,12 @@
+module['exports'] = {
+ silly: 'rainbow',
+ input: 'black',
+ verbose: 'cyan',
+ prompt: 'grey',
+ info: 'green',
+ data: 'grey',
+ help: 'cyan',
+ warn: 'yellow',
+ debug: 'blue',
+ error: 'red'
+};
\ No newline at end of file
diff --git a/node_modules/grunt/node_modules/colors/themes/winston-light.js b/node_modules/grunt/node_modules/colors/themes/winston-light.js
new file mode 100644
index 0000000..571972c
--- /dev/null
+++ b/node_modules/grunt/node_modules/colors/themes/winston-light.js
@@ -0,0 +1,12 @@
+module['exports'] = {
+ silly: 'rainbow',
+ input: 'grey',
+ verbose: 'cyan',
+ prompt: 'grey',
+ info: 'green',
+ data: 'grey',
+ help: 'cyan',
+ warn: 'yellow',
+ debug: 'blue',
+ error: 'red'
+};
\ No newline at end of file
diff --git a/node_modules/grunt/node_modules/dateformat/Readme.md b/node_modules/grunt/node_modules/dateformat/Readme.md
new file mode 100644
index 0000000..d469e6d
--- /dev/null
+++ b/node_modules/grunt/node_modules/dateformat/Readme.md
@@ -0,0 +1,67 @@
+# node-dateformat
+
+A node.js package for Steven Levithan's excellent [dateFormat()][dateformat] function.
+
+## Modifications
+
+* Removed the `Date.prototype.format` method. Sorry folks, but extending native prototypes is for suckers.
+* Added a `module.exports = dateFormat;` statement at the bottom
+
+## Usage
+
+As taken from Steven's post, modified to match the Modifications listed above:
+
+ var dateFormat = require('dateformat');
+ var now = new Date();
+
+ // Basic usage
+ dateFormat(now, "dddd, mmmm dS, yyyy, h:MM:ss TT");
+ // Saturday, June 9th, 2007, 5:46:21 PM
+
+ // You can use one of several named masks
+ dateFormat(now, "isoDateTime");
+ // 2007-06-09T17:46:21
+
+ // ...Or add your own
+ dateFormat.masks.hammerTime = 'HH:MM! "Can\'t touch this!"';
+ dateFormat(now, "hammerTime");
+ // 17:46! Can't touch this!
+
+ // When using the standalone dateFormat function,
+ // you can also provide the date as a string
+ dateFormat("Jun 9 2007", "fullDate");
+ // Saturday, June 9, 2007
+
+ // Note that if you don't include the mask argument,
+ // dateFormat.masks.default is used
+ dateFormat(now);
+ // Sat Jun 09 2007 17:46:21
+
+ // And if you don't include the date argument,
+ // the current date and time is used
+ dateFormat();
+ // Sat Jun 09 2007 17:46:22
+
+ // You can also skip the date argument (as long as your mask doesn't
+ // contain any numbers), in which case the current date/time is used
+ dateFormat("longTime");
+ // 5:46:22 PM EST
+
+ // And finally, you can convert local time to UTC time. Simply pass in
+ // true as an additional argument (no argument skipping allowed in this case):
+ dateFormat(now, "longTime", true);
+ // 10:46:21 PM UTC
+
+ // ...Or add the prefix "UTC:" to your mask.
+ dateFormat(now, "UTC:h:MM:ss TT Z");
+ // 10:46:21 PM UTC
+
+ // You can also get the ISO 8601 week of the year:
+ dateFormat(now, "W");
+ // 42
+## License
+
+(c) 2007-2009 Steven Levithan [stevenlevithan.com][stevenlevithan], MIT license.
+
+[dateformat]: http://blog.stevenlevithan.com/archives/date-time-format
+[stevenlevithan]: http://stevenlevithan.com/
diff --git a/node_modules/grunt/node_modules/dateformat/lib/dateformat.js b/node_modules/grunt/node_modules/dateformat/lib/dateformat.js
new file mode 100644
index 0000000..9229424
--- /dev/null
+++ b/node_modules/grunt/node_modules/dateformat/lib/dateformat.js
@@ -0,0 +1,165 @@
+/*
+ * Date Format 1.2.3
+ * (c) 2007-2009 Steven Levithan
+ * MIT license
+ *
+ * Includes enhancements by Scott Trenda
+ * and Kris Kowal
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the 'Software'), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is furnished
+to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
+FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
+COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
+AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/grunt/node_modules/eventemitter2/index.js b/node_modules/grunt/node_modules/eventemitter2/index.js
new file mode 100644
index 0000000..6f583b5
--- /dev/null
+++ b/node_modules/grunt/node_modules/eventemitter2/index.js
@@ -0,0 +1 @@
+module.exports = require('./lib/eventemitter2');
diff --git a/node_modules/grunt/node_modules/eventemitter2/lib/eventemitter2.js b/node_modules/grunt/node_modules/eventemitter2/lib/eventemitter2.js
new file mode 100644
index 0000000..bde69e8
--- /dev/null
+++ b/node_modules/grunt/node_modules/eventemitter2/lib/eventemitter2.js
@@ -0,0 +1,573 @@
+/*!
+ * EventEmitter2
+ * https://github.com/hij1nx/EventEmitter2
+ *
+ * Copyright (c) 2013 hij1nx
+ * Licensed under the MIT license.
+ */
+;!function(undefined) {
+
+ var isArray = Array.isArray ? Array.isArray : function _isArray(obj) {
+ return Object.prototype.toString.call(obj) === "[object Array]";
+ };
+ var defaultMaxListeners = 10;
+
+ function init() {
+ this._events = {};
+ if (this._conf) {
+ configure.call(this, this._conf);
+ }
+ }
+
+ function configure(conf) {
+ if (conf) {
+
+ this._conf = conf;
+
+ conf.delimiter && (this.delimiter = conf.delimiter);
+ conf.maxListeners && (this._events.maxListeners = conf.maxListeners);
+ conf.wildcard && (this.wildcard = conf.wildcard);
+ conf.newListener && (this.newListener = conf.newListener);
+
+ if (this.wildcard) {
+ this.listenerTree = {};
+ }
+ }
+ }
+
+ function EventEmitter(conf) {
+ this._events = {};
+ this.newListener = false;
+ configure.call(this, conf);
+ }
+
+ //
+ // Attention, function return type now is array, always !
+ // It has zero elements if no any matches found and one or more
+ // elements (leafs) if there are matches
+ //
+ function searchListenerTree(handlers, type, tree, i) {
+ if (!tree) {
+ return [];
+ }
+ var listeners=[], leaf, len, branch, xTree, xxTree, isolatedBranch, endReached,
+ typeLength = type.length, currentType = type[i], nextType = type[i+1];
+ if (i === typeLength && tree._listeners) {
+ //
+ // If at the end of the event(s) list and the tree has listeners
+ // invoke those listeners.
+ //
+ if (typeof tree._listeners === 'function') {
+ handlers && handlers.push(tree._listeners);
+ return [tree];
+ } else {
+ for (leaf = 0, len = tree._listeners.length; leaf < len; leaf++) {
+ handlers && handlers.push(tree._listeners[leaf]);
+ }
+ return [tree];
+ }
+ }
+
+ if ((currentType === '*' || currentType === '**') || tree[currentType]) {
+ //
+ // If the event emitted is '*' at this part
+ // or there is a concrete match at this patch
+ //
+ if (currentType === '*') {
+ for (branch in tree) {
+ if (branch !== '_listeners' && tree.hasOwnProperty(branch)) {
+ listeners = listeners.concat(searchListenerTree(handlers, type, tree[branch], i+1));
+ }
+ }
+ return listeners;
+ } else if(currentType === '**') {
+ endReached = (i+1 === typeLength || (i+2 === typeLength && nextType === '*'));
+ if(endReached && tree._listeners) {
+ // The next element has a _listeners, add it to the handlers.
+ listeners = listeners.concat(searchListenerTree(handlers, type, tree, typeLength));
+ }
+
+ for (branch in tree) {
+ if (branch !== '_listeners' && tree.hasOwnProperty(branch)) {
+ if(branch === '*' || branch === '**') {
+ if(tree[branch]._listeners && !endReached) {
+ listeners = listeners.concat(searchListenerTree(handlers, type, tree[branch], typeLength));
+ }
+ listeners = listeners.concat(searchListenerTree(handlers, type, tree[branch], i));
+ } else if(branch === nextType) {
+ listeners = listeners.concat(searchListenerTree(handlers, type, tree[branch], i+2));
+ } else {
+ // No match on this one, shift into the tree but not in the type array.
+ listeners = listeners.concat(searchListenerTree(handlers, type, tree[branch], i));
+ }
+ }
+ }
+ return listeners;
+ }
+
+ listeners = listeners.concat(searchListenerTree(handlers, type, tree[currentType], i+1));
+ }
+
+ xTree = tree['*'];
+ if (xTree) {
+ //
+ // If the listener tree will allow any match for this part,
+ // then recursively explore all branches of the tree
+ //
+ searchListenerTree(handlers, type, xTree, i+1);
+ }
+
+ xxTree = tree['**'];
+ if(xxTree) {
+ if(i < typeLength) {
+ if(xxTree._listeners) {
+ // If we have a listener on a '**', it will catch all, so add its handler.
+ searchListenerTree(handlers, type, xxTree, typeLength);
+ }
+
+ // Build arrays of matching next branches and others.
+ for(branch in xxTree) {
+ if(branch !== '_listeners' && xxTree.hasOwnProperty(branch)) {
+ if(branch === nextType) {
+ // We know the next element will match, so jump twice.
+ searchListenerTree(handlers, type, xxTree[branch], i+2);
+ } else if(branch === currentType) {
+ // Current node matches, move into the tree.
+ searchListenerTree(handlers, type, xxTree[branch], i+1);
+ } else {
+ isolatedBranch = {};
+ isolatedBranch[branch] = xxTree[branch];
+ searchListenerTree(handlers, type, { '**': isolatedBranch }, i+1);
+ }
+ }
+ }
+ } else if(xxTree._listeners) {
+ // We have reached the end and still on a '**'
+ searchListenerTree(handlers, type, xxTree, typeLength);
+ } else if(xxTree['*'] && xxTree['*']._listeners) {
+ searchListenerTree(handlers, type, xxTree['*'], typeLength);
+ }
+ }
+
+ return listeners;
+ }
+
+ function growListenerTree(type, listener) {
+
+ type = typeof type === 'string' ? type.split(this.delimiter) : type.slice();
+
+ //
+ // Looks for two consecutive '**', if so, don't add the event at all.
+ //
+ for(var i = 0, len = type.length; i+1 < len; i++) {
+ if(type[i] === '**' && type[i+1] === '**') {
+ return;
+ }
+ }
+
+ var tree = this.listenerTree;
+ var name = type.shift();
+
+ while (name) {
+
+ if (!tree[name]) {
+ tree[name] = {};
+ }
+
+ tree = tree[name];
+
+ if (type.length === 0) {
+
+ if (!tree._listeners) {
+ tree._listeners = listener;
+ }
+ else if(typeof tree._listeners === 'function') {
+ tree._listeners = [tree._listeners, listener];
+ }
+ else if (isArray(tree._listeners)) {
+
+ tree._listeners.push(listener);
+
+ if (!tree._listeners.warned) {
+
+ var m = defaultMaxListeners;
+
+ if (typeof this._events.maxListeners !== 'undefined') {
+ m = this._events.maxListeners;
+ }
+
+ if (m > 0 && tree._listeners.length > m) {
+
+ tree._listeners.warned = true;
+ console.error('(node) warning: possible EventEmitter memory ' +
+ 'leak detected. %d listeners added. ' +
+ 'Use emitter.setMaxListeners() to increase limit.',
+ tree._listeners.length);
+ console.trace();
+ }
+ }
+ }
+ return true;
+ }
+ name = type.shift();
+ }
+ return true;
+ }
+
+ // By default EventEmitters will print a warning if more than
+ // 10 listeners are added to it. This is a useful default which
+ // helps finding memory leaks.
+ //
+ // Obviously not all Emitters should be limited to 10. This function allows
+ // that to be increased. Set to zero for unlimited.
+
+ EventEmitter.prototype.delimiter = '.';
+
+ EventEmitter.prototype.setMaxListeners = function(n) {
+ this._events || init.call(this);
+ this._events.maxListeners = n;
+ if (!this._conf) this._conf = {};
+ this._conf.maxListeners = n;
+ };
+
+ EventEmitter.prototype.event = '';
+
+ EventEmitter.prototype.once = function(event, fn) {
+ this.many(event, 1, fn);
+ return this;
+ };
+
+ EventEmitter.prototype.many = function(event, ttl, fn) {
+ var self = this;
+
+ if (typeof fn !== 'function') {
+ throw new Error('many only accepts instances of Function');
+ }
+
+ function listener() {
+ if (--ttl === 0) {
+ self.off(event, listener);
+ }
+ fn.apply(this, arguments);
+ }
+
+ listener._origin = fn;
+
+ this.on(event, listener);
+
+ return self;
+ };
+
+ EventEmitter.prototype.emit = function() {
+
+ this._events || init.call(this);
+
+ var type = arguments[0];
+
+ if (type === 'newListener' && !this.newListener) {
+ if (!this._events.newListener) { return false; }
+ }
+
+ // Loop through the *_all* functions and invoke them.
+ if (this._all) {
+ var l = arguments.length;
+ var args = new Array(l - 1);
+ for (var i = 1; i < l; i++) args[i - 1] = arguments[i];
+ for (i = 0, l = this._all.length; i < l; i++) {
+ this.event = type;
+ this._all[i].apply(this, args);
+ }
+ }
+
+ // If there is no 'error' event listener then throw.
+ if (type === 'error') {
+
+ if (!this._all &&
+ !this._events.error &&
+ !(this.wildcard && this.listenerTree.error)) {
+
+ if (arguments[1] instanceof Error) {
+ throw arguments[1]; // Unhandled 'error' event
+ } else {
+ throw new Error("Uncaught, unspecified 'error' event.");
+ }
+ return false;
+ }
+ }
+
+ var handler;
+
+ if(this.wildcard) {
+ handler = [];
+ var ns = typeof type === 'string' ? type.split(this.delimiter) : type.slice();
+ searchListenerTree.call(this, handler, ns, this.listenerTree, 0);
+ }
+ else {
+ handler = this._events[type];
+ }
+
+ if (typeof handler === 'function') {
+ this.event = type;
+ if (arguments.length === 1) {
+ handler.call(this);
+ }
+ else if (arguments.length > 1)
+ switch (arguments.length) {
+ case 2:
+ handler.call(this, arguments[1]);
+ break;
+ case 3:
+ handler.call(this, arguments[1], arguments[2]);
+ break;
+ // slower
+ default:
+ var l = arguments.length;
+ var args = new Array(l - 1);
+ for (var i = 1; i < l; i++) args[i - 1] = arguments[i];
+ handler.apply(this, args);
+ }
+ return true;
+ }
+ else if (handler) {
+ var l = arguments.length;
+ var args = new Array(l - 1);
+ for (var i = 1; i < l; i++) args[i - 1] = arguments[i];
+
+ var listeners = handler.slice();
+ for (var i = 0, l = listeners.length; i < l; i++) {
+ this.event = type;
+ listeners[i].apply(this, args);
+ }
+ return (listeners.length > 0) || !!this._all;
+ }
+ else {
+ return !!this._all;
+ }
+
+ };
+
+ EventEmitter.prototype.on = function(type, listener) {
+
+ if (typeof type === 'function') {
+ this.onAny(type);
+ return this;
+ }
+
+ if (typeof listener !== 'function') {
+ throw new Error('on only accepts instances of Function');
+ }
+ this._events || init.call(this);
+
+ // To avoid recursion in the case that type == "newListeners"! Before
+ // adding it to the listeners, first emit "newListeners".
+ this.emit('newListener', type, listener);
+
+ if(this.wildcard) {
+ growListenerTree.call(this, type, listener);
+ return this;
+ }
+
+ if (!this._events[type]) {
+ // Optimize the case of one listener. Don't need the extra array object.
+ this._events[type] = listener;
+ }
+ else if(typeof this._events[type] === 'function') {
+ // Adding the second element, need to change to array.
+ this._events[type] = [this._events[type], listener];
+ }
+ else if (isArray(this._events[type])) {
+ // If we've already got an array, just append.
+ this._events[type].push(listener);
+
+ // Check for listener leak
+ if (!this._events[type].warned) {
+
+ var m = defaultMaxListeners;
+
+ if (typeof this._events.maxListeners !== 'undefined') {
+ m = this._events.maxListeners;
+ }
+
+ if (m > 0 && this._events[type].length > m) {
+
+ this._events[type].warned = true;
+ console.error('(node) warning: possible EventEmitter memory ' +
+ 'leak detected. %d listeners added. ' +
+ 'Use emitter.setMaxListeners() to increase limit.',
+ this._events[type].length);
+ console.trace();
+ }
+ }
+ }
+ return this;
+ };
+
+ EventEmitter.prototype.onAny = function(fn) {
+
+ if (typeof fn !== 'function') {
+ throw new Error('onAny only accepts instances of Function');
+ }
+
+ if(!this._all) {
+ this._all = [];
+ }
+
+ // Add the function to the event listener collection.
+ this._all.push(fn);
+ return this;
+ };
+
+ EventEmitter.prototype.addListener = EventEmitter.prototype.on;
+
+ EventEmitter.prototype.off = function(type, listener) {
+ if (typeof listener !== 'function') {
+ throw new Error('removeListener only takes instances of Function');
+ }
+
+ var handlers,leafs=[];
+
+ if(this.wildcard) {
+ var ns = typeof type === 'string' ? type.split(this.delimiter) : type.slice();
+ leafs = searchListenerTree.call(this, null, ns, this.listenerTree, 0);
+ }
+ else {
+ // does not use listeners(), so no side effect of creating _events[type]
+ if (!this._events[type]) return this;
+ handlers = this._events[type];
+ leafs.push({_listeners:handlers});
+ }
+
+ for (var iLeaf=0; iLeaf 0) {
+ fns = this._all;
+ for(i = 0, l = fns.length; i < l; i++) {
+ if(fn === fns[i]) {
+ fns.splice(i, 1);
+ return this;
+ }
+ }
+ } else {
+ this._all = [];
+ }
+ return this;
+ };
+
+ EventEmitter.prototype.removeListener = EventEmitter.prototype.off;
+
+ EventEmitter.prototype.removeAllListeners = function(type) {
+ if (arguments.length === 0) {
+ !this._events || init.call(this);
+ return this;
+ }
+
+ if(this.wildcard) {
+ var ns = typeof type === 'string' ? type.split(this.delimiter) : type.slice();
+ var leafs = searchListenerTree.call(this, null, ns, this.listenerTree, 0);
+
+ for (var iLeaf=0; iLeaf= 0.2.2"
+ },
+ "main": "./lib/eventemitter2.js",
+ "scripts": {
+ "test": "nodeunit test/simple/ && nodeunit test/wildcardEvents/",
+ "benchmark": "node test/perf/benchmark.js"
+ },
+ "files": [
+ "lib/eventemitter2.js",
+ "index.js"
+ ],
+ "bugs": {
+ "url": "https://github.com/hij1nx/EventEmitter2/issues"
+ },
+ "homepage": "https://github.com/hij1nx/EventEmitter2",
+ "_id": "eventemitter2@0.4.14",
+ "_shasum": "8f61b75cde012b2e9eb284d4545583b5643b61ab",
+ "_from": "eventemitter2@>=0.4.13 <0.5.0",
+ "_npmVersion": "1.4.7",
+ "_npmUser": {
+ "name": "jasonkuhrt",
+ "email": "jasonkuhrt@me.com"
+ },
+ "maintainers": [
+ {
+ "name": "hij1nx",
+ "email": "hij1nx@me.com"
+ },
+ {
+ "name": "jasonkuhrt",
+ "email": "jasonkuhrt@me.com"
+ }
+ ],
+ "dist": {
+ "shasum": "8f61b75cde012b2e9eb284d4545583b5643b61ab",
+ "tarball": "http://registry.npmjs.org/eventemitter2/-/eventemitter2-0.4.14.tgz"
+ },
+ "directories": {},
+ "_resolved": "https://registry.npmjs.org/eventemitter2/-/eventemitter2-0.4.14.tgz",
+ "readme": "ERROR: No README data found!"
+}
diff --git a/node_modules/grunt/node_modules/exit/.jshintrc b/node_modules/grunt/node_modules/exit/.jshintrc
new file mode 100644
index 0000000..2b7e39b
--- /dev/null
+++ b/node_modules/grunt/node_modules/exit/.jshintrc
@@ -0,0 +1,14 @@
+{
+ "curly": true,
+ "eqeqeq": true,
+ "immed": true,
+ "latedef": "nofunc",
+ "newcap": true,
+ "noarg": true,
+ "sub": true,
+ "undef": true,
+ "unused": true,
+ "boss": true,
+ "eqnull": true,
+ "node": true
+}
diff --git a/node_modules/grunt/node_modules/exit/.npmignore b/node_modules/grunt/node_modules/exit/.npmignore
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/grunt/node_modules/exit/.travis.yml b/node_modules/grunt/node_modules/exit/.travis.yml
new file mode 100644
index 0000000..42d4302
--- /dev/null
+++ b/node_modules/grunt/node_modules/exit/.travis.yml
@@ -0,0 +1,6 @@
+language: node_js
+node_js:
+ - 0.8
+ - '0.10'
+before_script:
+ - npm install -g grunt-cli
diff --git a/node_modules/grunt/node_modules/exit/Gruntfile.js b/node_modules/grunt/node_modules/exit/Gruntfile.js
new file mode 100644
index 0000000..ff37751
--- /dev/null
+++ b/node_modules/grunt/node_modules/exit/Gruntfile.js
@@ -0,0 +1,48 @@
+'use strict';
+
+module.exports = function(grunt) {
+
+ // Project configuration.
+ grunt.initConfig({
+ nodeunit: {
+ files: ['test/**/*_test.js'],
+ },
+ jshint: {
+ options: {
+ jshintrc: '.jshintrc'
+ },
+ gruntfile: {
+ src: 'Gruntfile.js'
+ },
+ lib: {
+ src: ['lib/**/*.js']
+ },
+ test: {
+ src: ['test/**/*.js']
+ },
+ },
+ watch: {
+ gruntfile: {
+ files: '<%= jshint.gruntfile.src %>',
+ tasks: ['jshint:gruntfile']
+ },
+ lib: {
+ files: '<%= jshint.lib.src %>',
+ tasks: ['jshint:lib', 'nodeunit']
+ },
+ test: {
+ files: '<%= jshint.test.src %>',
+ tasks: ['jshint:test', 'nodeunit']
+ },
+ },
+ });
+
+ // These plugins provide necessary tasks.
+ grunt.loadNpmTasks('grunt-contrib-nodeunit');
+ grunt.loadNpmTasks('grunt-contrib-jshint');
+ grunt.loadNpmTasks('grunt-contrib-watch');
+
+ // Default task.
+ grunt.registerTask('default', ['jshint', 'nodeunit']);
+
+};
diff --git a/node_modules/grunt/node_modules/exit/LICENSE-MIT b/node_modules/grunt/node_modules/exit/LICENSE-MIT
new file mode 100644
index 0000000..bb2aad6
--- /dev/null
+++ b/node_modules/grunt/node_modules/exit/LICENSE-MIT
@@ -0,0 +1,22 @@
+Copyright (c) 2013 "Cowboy" Ben Alman
+
+Permission is hereby granted, free of charge, to any person
+obtaining a copy of this software and associated documentation
+files (the "Software"), to deal in the Software without
+restriction, including without limitation the rights to use,
+copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the
+Software is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/grunt/node_modules/exit/README.md b/node_modules/grunt/node_modules/exit/README.md
new file mode 100644
index 0000000..20c364e
--- /dev/null
+++ b/node_modules/grunt/node_modules/exit/README.md
@@ -0,0 +1,75 @@
+# exit [](http://travis-ci.org/cowboy/node-exit)
+
+A replacement for process.exit that ensures stdio are fully drained before exiting.
+
+To make a long story short, if `process.exit` is called on Windows, script output is often truncated when pipe-redirecting `stdout` or `stderr`. This module attempts to work around this issue by waiting until those streams have been completely drained before actually calling `process.exit`.
+
+See [Node.js issue #3584](https://github.com/joyent/node/issues/3584) for further reference.
+
+Tested in OS X 10.8, Windows 7 on Node.js 0.8.25 and 0.10.18.
+
+Based on some code by [@vladikoff](https://github.com/vladikoff).
+
+## Getting Started
+Install the module with: `npm install exit`
+
+```javascript
+var exit = require('exit');
+
+// These lines should appear in the output, EVEN ON WINDOWS.
+console.log("omg");
+console.error("yay");
+
+// process.exit(5);
+exit(5);
+
+// These lines shouldn't appear in the output.
+console.log("wtf");
+console.error("bro");
+```
+
+## Don't believe me? Try it for yourself.
+
+In Windows, clone the repo and cd to the `test\fixtures` directory. The only difference between [log.js](test/fixtures/log.js) and [log-broken.js](test/fixtures/log-broken.js) is that the former uses `exit` while the latter calls `process.exit` directly.
+
+This test was done using cmd.exe, but you can see the same results using `| grep "std"` in either PowerShell or git-bash.
+
+```
+C:\node-exit\test\fixtures>node log.js 0 10 stdout stderr 2>&1 | find "std"
+stdout 0
+stderr 0
+stdout 1
+stderr 1
+stdout 2
+stderr 2
+stdout 3
+stderr 3
+stdout 4
+stderr 4
+stdout 5
+stderr 5
+stdout 6
+stderr 6
+stdout 7
+stderr 7
+stdout 8
+stderr 8
+stdout 9
+stderr 9
+
+C:\node-exit\test\fixtures>node log-broken.js 0 10 stdout stderr 2>&1 | find "std"
+
+C:\node-exit\test\fixtures>
+```
+
+## Contributing
+In lieu of a formal styleguide, take care to maintain the existing coding style. Add unit tests for any new or changed functionality. Lint and test your code using [Grunt](http://gruntjs.com/).
+
+## Release History
+2013-11-26 - v0.1.2 - Fixed a bug with hanging processes.
+2013-09-26 - v0.1.1 - Fixed some bugs. It seems to actually work now!
+2013-09-20 - v0.1.0 - Initial release.
+
+## License
+Copyright (c) 2013 "Cowboy" Ben Alman
+Licensed under the MIT license.
diff --git a/node_modules/grunt/node_modules/exit/lib/exit.js b/node_modules/grunt/node_modules/exit/lib/exit.js
new file mode 100644
index 0000000..2883e05
--- /dev/null
+++ b/node_modules/grunt/node_modules/exit/lib/exit.js
@@ -0,0 +1,41 @@
+/*
+ * exit
+ * https://github.com/cowboy/node-exit
+ *
+ * Copyright (c) 2013 "Cowboy" Ben Alman
+ * Licensed under the MIT license.
+ */
+
+'use strict';
+
+module.exports = function exit(exitCode, streams) {
+ if (!streams) { streams = [process.stdout, process.stderr]; }
+ var drainCount = 0;
+ // Actually exit if all streams are drained.
+ function tryToExit() {
+ if (drainCount === streams.length) {
+ process.exit(exitCode);
+ }
+ }
+ streams.forEach(function(stream) {
+ // Count drained streams now, but monitor non-drained streams.
+ if (stream.bufferSize === 0) {
+ drainCount++;
+ } else {
+ stream.write('', 'utf-8', function() {
+ drainCount++;
+ tryToExit();
+ });
+ }
+ // Prevent further writing.
+ stream.write = function() {};
+ });
+ // If all streams were already drained, exit now.
+ tryToExit();
+ // In Windows, when run as a Node.js child process, a script utilizing
+ // this library might just exit with a 0 exit code, regardless. This code,
+ // despite the fact that it looks a bit crazy, appears to fix that.
+ process.on('exit', function() {
+ process.exit(exitCode);
+ });
+};
diff --git a/node_modules/grunt/node_modules/exit/package.json b/node_modules/grunt/node_modules/exit/package.json
new file mode 100644
index 0000000..16c9caa
--- /dev/null
+++ b/node_modules/grunt/node_modules/exit/package.json
@@ -0,0 +1,69 @@
+{
+ "name": "exit",
+ "description": "A replacement for process.exit that ensures stdio are fully drained before exiting.",
+ "version": "0.1.2",
+ "homepage": "https://github.com/cowboy/node-exit",
+ "author": {
+ "name": "\"Cowboy\" Ben Alman",
+ "url": "http://benalman.com/"
+ },
+ "repository": {
+ "type": "git",
+ "url": "git://github.com/cowboy/node-exit.git"
+ },
+ "bugs": {
+ "url": "https://github.com/cowboy/node-exit/issues"
+ },
+ "licenses": [
+ {
+ "type": "MIT",
+ "url": "https://github.com/cowboy/node-exit/blob/master/LICENSE-MIT"
+ }
+ ],
+ "main": "lib/exit",
+ "engines": {
+ "node": ">= 0.8.0"
+ },
+ "scripts": {
+ "test": "grunt nodeunit"
+ },
+ "devDependencies": {
+ "grunt-contrib-jshint": "~0.6.4",
+ "grunt-contrib-nodeunit": "~0.2.0",
+ "grunt-contrib-watch": "~0.5.3",
+ "grunt": "~0.4.1",
+ "which": "~1.0.5"
+ },
+ "keywords": [
+ "exit",
+ "process",
+ "stdio",
+ "stdout",
+ "stderr",
+ "drain",
+ "flush",
+ "3584"
+ ],
+ "readme": "# exit [](http://travis-ci.org/cowboy/node-exit)\n\nA replacement for process.exit that ensures stdio are fully drained before exiting.\n\nTo make a long story short, if `process.exit` is called on Windows, script output is often truncated when pipe-redirecting `stdout` or `stderr`. This module attempts to work around this issue by waiting until those streams have been completely drained before actually calling `process.exit`.\n\nSee [Node.js issue #3584](https://github.com/joyent/node/issues/3584) for further reference.\n\nTested in OS X 10.8, Windows 7 on Node.js 0.8.25 and 0.10.18.\n\nBased on some code by [@vladikoff](https://github.com/vladikoff).\n\n## Getting Started\nInstall the module with: `npm install exit`\n\n```javascript\nvar exit = require('exit');\n\n// These lines should appear in the output, EVEN ON WINDOWS.\nconsole.log(\"omg\");\nconsole.error(\"yay\");\n\n// process.exit(5);\nexit(5);\n\n// These lines shouldn't appear in the output.\nconsole.log(\"wtf\");\nconsole.error(\"bro\");\n```\n\n## Don't believe me? Try it for yourself.\n\nIn Windows, clone the repo and cd to the `test\\fixtures` directory. The only difference between [log.js](test/fixtures/log.js) and [log-broken.js](test/fixtures/log-broken.js) is that the former uses `exit` while the latter calls `process.exit` directly.\n\nThis test was done using cmd.exe, but you can see the same results using `| grep \"std\"` in either PowerShell or git-bash.\n\n```\nC:\\node-exit\\test\\fixtures>node log.js 0 10 stdout stderr 2>&1 | find \"std\"\nstdout 0\nstderr 0\nstdout 1\nstderr 1\nstdout 2\nstderr 2\nstdout 3\nstderr 3\nstdout 4\nstderr 4\nstdout 5\nstderr 5\nstdout 6\nstderr 6\nstdout 7\nstderr 7\nstdout 8\nstderr 8\nstdout 9\nstderr 9\n\nC:\\node-exit\\test\\fixtures>node log-broken.js 0 10 stdout stderr 2>&1 | find \"std\"\n\nC:\\node-exit\\test\\fixtures>\n```\n\n## Contributing\nIn lieu of a formal styleguide, take care to maintain the existing coding style. Add unit tests for any new or changed functionality. Lint and test your code using [Grunt](http://gruntjs.com/).\n\n## Release History\n2013-11-26 - v0.1.2 - Fixed a bug with hanging processes. \n2013-09-26 - v0.1.1 - Fixed some bugs. It seems to actually work now! \n2013-09-20 - v0.1.0 - Initial release.\n\n## License\nCopyright (c) 2013 \"Cowboy\" Ben Alman \nLicensed under the MIT license.\n",
+ "readmeFilename": "README.md",
+ "_id": "exit@0.1.2",
+ "dist": {
+ "shasum": "0632638f8d877cc82107d30a0fff1a17cba1cd0c",
+ "tarball": "http://registry.npmjs.org/exit/-/exit-0.1.2.tgz"
+ },
+ "_from": "exit@>=0.1.1 <0.2.0",
+ "_npmVersion": "1.3.11",
+ "_npmUser": {
+ "name": "cowboy",
+ "email": "cowboy@rj3.net"
+ },
+ "maintainers": [
+ {
+ "name": "cowboy",
+ "email": "cowboy@rj3.net"
+ }
+ ],
+ "directories": {},
+ "_shasum": "0632638f8d877cc82107d30a0fff1a17cba1cd0c",
+ "_resolved": "https://registry.npmjs.org/exit/-/exit-0.1.2.tgz"
+}
diff --git a/node_modules/grunt/node_modules/exit/test/exit_test.js b/node_modules/grunt/node_modules/exit/test/exit_test.js
new file mode 100644
index 0000000..a91afb9
--- /dev/null
+++ b/node_modules/grunt/node_modules/exit/test/exit_test.js
@@ -0,0 +1,121 @@
+'use strict';
+
+/*
+ ======== A Handy Little Nodeunit Reference ========
+ https://github.com/caolan/nodeunit
+
+ Test methods:
+ test.expect(numAssertions)
+ test.done()
+ Test assertions:
+ test.ok(value, [message])
+ test.equal(actual, expected, [message])
+ test.notEqual(actual, expected, [message])
+ test.deepEqual(actual, expected, [message])
+ test.notDeepEqual(actual, expected, [message])
+ test.strictEqual(actual, expected, [message])
+ test.notStrictEqual(actual, expected, [message])
+ test.throws(block, [error], [message])
+ test.doesNotThrow(block, [error], [message])
+ test.ifError(value)
+*/
+
+var fs = require('fs');
+var exec = require('child_process').exec;
+
+var _which = require('which').sync;
+function which(command) {
+ try {
+ _which(command);
+ return command;
+ } catch (err) {
+ return false;
+ }
+}
+
+// Look for grep first (any OS). If not found (but on Windows) look for find,
+// which is Windows' horribly crippled grep alternative.
+var grep = which('grep') || process.platform === 'win32' && which('find');
+
+exports['exit'] = {
+ setUp: function(done) {
+ this.origCwd = process.cwd();
+ process.chdir('test/fixtures');
+ done();
+ },
+ tearDown: function(done) {
+ process.chdir(this.origCwd);
+ done();
+ },
+ 'grep': function(test) {
+ test.expect(1);
+ // Many unit tests depend on this.
+ test.ok(grep, 'A suitable "grep" or "find" program was not found in the PATH.');
+ test.done();
+ },
+ // The rest of the tests are built dynamically, to keep things sane.
+};
+
+// A few helper functions.
+function normalizeLineEndings(s) {
+ return s.replace(/\r?\n/g, '\n');
+}
+
+// Capture command output, normalizing captured stdout to unix file endings.
+function run(command, callback) {
+ exec(command, function(error, stdout) {
+ callback(error ? error.code : 0, normalizeLineEndings(stdout));
+ });
+}
+
+// Read a fixture file, normalizing file contents to unix file endings.
+function fixture(filename) {
+ return normalizeLineEndings(String(fs.readFileSync(filename)));
+}
+
+function buildTests() {
+ // Build individual unit tests for command output.
+ var counts = [10, 100, 1000];
+ var outputs = [' stdout stderr', ' stdout', ' stderr'];
+ var pipes = ['', ' | ' + grep + ' "std"'];
+ counts.forEach(function(count) {
+ outputs.forEach(function(output) {
+ pipes.forEach(function(pipe) {
+ var command = 'node log.js 0 ' + count + output + ' 2>&1' + pipe;
+ exports['exit']['output (' + command + ')'] = function(test) {
+ test.expect(2);
+ run(command, function(code, actual) {
+ var expected = fixture(count + output.replace(/ /g, '-') + '.txt');
+ // Sometimes, the actual file lines are out of order on Windows.
+ // But since the point of this lib is to drain the buffer and not
+ // guarantee output order, we only test the length.
+ test.equal(actual.length, expected.length, 'should be the same length.');
+ // The "fail" lines in log.js should NOT be output!
+ test.ok(actual.indexOf('fail') === -1, 'should not output after exit is called.');
+ test.done();
+ });
+ };
+ });
+ });
+ });
+
+ // Build individual unit tests for exit codes.
+ var codes = [0, 1, 123];
+ codes.forEach(function(code) {
+ var command = 'node log.js ' + code + ' 10 stdout stderr';
+ exports['exit']['exit code (' + command + ')'] = function(test) {
+ test.expect(1);
+ run(command, function(actual) {
+ // The specified exit code should be passed through.
+ test.equal(actual, code, 'should exit with ' + code + ' error code.');
+ test.done();
+ });
+ };
+ });
+}
+
+// Don't bother building tests if grep wasn't found, otherwise everything will
+// fail and the error will get lost.
+if (grep) {
+ buildTests();
+}
diff --git a/node_modules/grunt/node_modules/exit/test/fixtures/10-stderr.txt b/node_modules/grunt/node_modules/exit/test/fixtures/10-stderr.txt
new file mode 100644
index 0000000..2859200
--- /dev/null
+++ b/node_modules/grunt/node_modules/exit/test/fixtures/10-stderr.txt
@@ -0,0 +1,10 @@
+stderr 0
+stderr 1
+stderr 2
+stderr 3
+stderr 4
+stderr 5
+stderr 6
+stderr 7
+stderr 8
+stderr 9
diff --git a/node_modules/grunt/node_modules/exit/test/fixtures/10-stdout-stderr.txt b/node_modules/grunt/node_modules/exit/test/fixtures/10-stdout-stderr.txt
new file mode 100644
index 0000000..9de8616
--- /dev/null
+++ b/node_modules/grunt/node_modules/exit/test/fixtures/10-stdout-stderr.txt
@@ -0,0 +1,20 @@
+stdout 0
+stderr 0
+stdout 1
+stdout 2
+stderr 1
+stdout 3
+stderr 2
+stderr 3
+stdout 4
+stderr 4
+stdout 5
+stderr 5
+stdout 6
+stderr 6
+stdout 7
+stderr 7
+stdout 8
+stderr 8
+stdout 9
+stderr 9
diff --git a/node_modules/grunt/node_modules/exit/test/fixtures/10-stdout.txt b/node_modules/grunt/node_modules/exit/test/fixtures/10-stdout.txt
new file mode 100644
index 0000000..1ce90dc
--- /dev/null
+++ b/node_modules/grunt/node_modules/exit/test/fixtures/10-stdout.txt
@@ -0,0 +1,10 @@
+stdout 0
+stdout 1
+stdout 2
+stdout 3
+stdout 4
+stdout 5
+stdout 6
+stdout 7
+stdout 8
+stdout 9
diff --git a/node_modules/grunt/node_modules/exit/test/fixtures/100-stderr.txt b/node_modules/grunt/node_modules/exit/test/fixtures/100-stderr.txt
new file mode 100644
index 0000000..3a78c85
--- /dev/null
+++ b/node_modules/grunt/node_modules/exit/test/fixtures/100-stderr.txt
@@ -0,0 +1,100 @@
+stderr 0
+stderr 1
+stderr 2
+stderr 3
+stderr 4
+stderr 5
+stderr 6
+stderr 7
+stderr 8
+stderr 9
+stderr 10
+stderr 11
+stderr 12
+stderr 13
+stderr 14
+stderr 15
+stderr 16
+stderr 17
+stderr 18
+stderr 19
+stderr 20
+stderr 21
+stderr 22
+stderr 23
+stderr 24
+stderr 25
+stderr 26
+stderr 27
+stderr 28
+stderr 29
+stderr 30
+stderr 31
+stderr 32
+stderr 33
+stderr 34
+stderr 35
+stderr 36
+stderr 37
+stderr 38
+stderr 39
+stderr 40
+stderr 41
+stderr 42
+stderr 43
+stderr 44
+stderr 45
+stderr 46
+stderr 47
+stderr 48
+stderr 49
+stderr 50
+stderr 51
+stderr 52
+stderr 53
+stderr 54
+stderr 55
+stderr 56
+stderr 57
+stderr 58
+stderr 59
+stderr 60
+stderr 61
+stderr 62
+stderr 63
+stderr 64
+stderr 65
+stderr 66
+stderr 67
+stderr 68
+stderr 69
+stderr 70
+stderr 71
+stderr 72
+stderr 73
+stderr 74
+stderr 75
+stderr 76
+stderr 77
+stderr 78
+stderr 79
+stderr 80
+stderr 81
+stderr 82
+stderr 83
+stderr 84
+stderr 85
+stderr 86
+stderr 87
+stderr 88
+stderr 89
+stderr 90
+stderr 91
+stderr 92
+stderr 93
+stderr 94
+stderr 95
+stderr 96
+stderr 97
+stderr 98
+stderr 99
diff --git a/node_modules/grunt/node_modules/exit/test/fixtures/100-stdout-stderr.txt b/node_modules/grunt/node_modules/exit/test/fixtures/100-stdout-stderr.txt
new file mode 100644
index 0000000..65f35f4
--- /dev/null
+++ b/node_modules/grunt/node_modules/exit/test/fixtures/100-stdout-stderr.txt
@@ -0,0 +1,200 @@
+stdout 0
+stderr 0
+stdout 1
+stderr 1
+stdout 2
+stderr 2
+stdout 3
+stderr 3
+stdout 4
+stderr 4
+stdout 5
+stderr 5
+stdout 6
+stderr 6
+stdout 7
+stderr 7
+stdout 8
+stderr 8
+stdout 9
+stderr 9
+stdout 10
+stderr 10
+stdout 11
+stderr 11
+stdout 12
+stderr 12
+stdout 13
+stderr 13
+stdout 14
+stderr 14
+stdout 15
+stderr 15
+stdout 16
+stderr 16
+stdout 17
+stderr 17
+stdout 18
+stderr 18
+stdout 19
+stderr 19
+stdout 20
+stderr 20
+stdout 21
+stderr 21
+stdout 22
+stderr 22
+stdout 23
+stderr 23
+stdout 24
+stderr 24
+stdout 25
+stderr 25
+stdout 26
+stderr 26
+stdout 27
+stderr 27
+stdout 28
+stderr 28
+stdout 29
+stderr 29
+stdout 30
+stderr 30
+stdout 31
+stderr 31
+stdout 32
+stderr 32
+stdout 33
+stderr 33
+stdout 34
+stderr 34
+stdout 35
+stderr 35
+stdout 36
+stderr 36
+stdout 37
+stderr 37
+stdout 38
+stderr 38
+stdout 39
+stderr 39
+stdout 40
+stderr 40
+stdout 41
+stderr 41
+stdout 42
+stderr 42
+stdout 43
+stderr 43
+stdout 44
+stderr 44
+stdout 45
+stderr 45
+stdout 46
+stderr 46
+stdout 47
+stderr 47
+stdout 48
+stderr 48
+stdout 49
+stderr 49
+stdout 50
+stderr 50
+stdout 51
+stderr 51
+stdout 52
+stderr 52
+stdout 53
+stderr 53
+stdout 54
+stderr 54
+stdout 55
+stderr 55
+stdout 56
+stderr 56
+stdout 57
+stderr 57
+stdout 58
+stderr 58
+stdout 59
+stderr 59
+stdout 60
+stderr 60
+stdout 61
+stderr 61
+stdout 62
+stderr 62
+stdout 63
+stderr 63
+stdout 64
+stderr 64
+stdout 65
+stderr 65
+stdout 66
+stderr 66
+stdout 67
+stderr 67
+stdout 68
+stderr 68
+stdout 69
+stderr 69
+stdout 70
+stderr 70
+stdout 71
+stderr 71
+stdout 72
+stderr 72
+stdout 73
+stderr 73
+stdout 74
+stderr 74
+stdout 75
+stderr 75
+stdout 76
+stderr 76
+stdout 77
+stderr 77
+stdout 78
+stderr 78
+stdout 79
+stderr 79
+stdout 80
+stderr 80
+stdout 81
+stderr 81
+stdout 82
+stderr 82
+stdout 83
+stderr 83
+stdout 84
+stderr 84
+stdout 85
+stderr 85
+stdout 86
+stderr 86
+stdout 87
+stderr 87
+stdout 88
+stderr 88
+stdout 89
+stderr 89
+stdout 90
+stderr 90
+stdout 91
+stderr 91
+stdout 92
+stderr 92
+stdout 93
+stderr 93
+stdout 94
+stderr 94
+stdout 95
+stderr 95
+stdout 96
+stderr 96
+stdout 97
+stderr 97
+stdout 98
+stderr 98
+stdout 99
+stderr 99
diff --git a/node_modules/grunt/node_modules/exit/test/fixtures/100-stdout.txt b/node_modules/grunt/node_modules/exit/test/fixtures/100-stdout.txt
new file mode 100644
index 0000000..5d9cac2
--- /dev/null
+++ b/node_modules/grunt/node_modules/exit/test/fixtures/100-stdout.txt
@@ -0,0 +1,100 @@
+stdout 0
+stdout 1
+stdout 2
+stdout 3
+stdout 4
+stdout 5
+stdout 6
+stdout 7
+stdout 8
+stdout 9
+stdout 10
+stdout 11
+stdout 12
+stdout 13
+stdout 14
+stdout 15
+stdout 16
+stdout 17
+stdout 18
+stdout 19
+stdout 20
+stdout 21
+stdout 22
+stdout 23
+stdout 24
+stdout 25
+stdout 26
+stdout 27
+stdout 28
+stdout 29
+stdout 30
+stdout 31
+stdout 32
+stdout 33
+stdout 34
+stdout 35
+stdout 36
+stdout 37
+stdout 38
+stdout 39
+stdout 40
+stdout 41
+stdout 42
+stdout 43
+stdout 44
+stdout 45
+stdout 46
+stdout 47
+stdout 48
+stdout 49
+stdout 50
+stdout 51
+stdout 52
+stdout 53
+stdout 54
+stdout 55
+stdout 56
+stdout 57
+stdout 58
+stdout 59
+stdout 60
+stdout 61
+stdout 62
+stdout 63
+stdout 64
+stdout 65
+stdout 66
+stdout 67
+stdout 68
+stdout 69
+stdout 70
+stdout 71
+stdout 72
+stdout 73
+stdout 74
+stdout 75
+stdout 76
+stdout 77
+stdout 78
+stdout 79
+stdout 80
+stdout 81
+stdout 82
+stdout 83
+stdout 84
+stdout 85
+stdout 86
+stdout 87
+stdout 88
+stdout 89
+stdout 90
+stdout 91
+stdout 92
+stdout 93
+stdout 94
+stdout 95
+stdout 96
+stdout 97
+stdout 98
+stdout 99
diff --git a/node_modules/grunt/node_modules/exit/test/fixtures/1000-stderr.txt b/node_modules/grunt/node_modules/exit/test/fixtures/1000-stderr.txt
new file mode 100644
index 0000000..d637510
--- /dev/null
+++ b/node_modules/grunt/node_modules/exit/test/fixtures/1000-stderr.txt
@@ -0,0 +1,1000 @@
+stderr 0
+stderr 1
+stderr 2
+stderr 3
+stderr 4
+stderr 5
+stderr 6
+stderr 7
+stderr 8
+stderr 9
+stderr 10
+stderr 11
+stderr 12
+stderr 13
+stderr 14
+stderr 15
+stderr 16
+stderr 17
+stderr 18
+stderr 19
+stderr 20
+stderr 21
+stderr 22
+stderr 23
+stderr 24
+stderr 25
+stderr 26
+stderr 27
+stderr 28
+stderr 29
+stderr 30
+stderr 31
+stderr 32
+stderr 33
+stderr 34
+stderr 35
+stderr 36
+stderr 37
+stderr 38
+stderr 39
+stderr 40
+stderr 41
+stderr 42
+stderr 43
+stderr 44
+stderr 45
+stderr 46
+stderr 47
+stderr 48
+stderr 49
+stderr 50
+stderr 51
+stderr 52
+stderr 53
+stderr 54
+stderr 55
+stderr 56
+stderr 57
+stderr 58
+stderr 59
+stderr 60
+stderr 61
+stderr 62
+stderr 63
+stderr 64
+stderr 65
+stderr 66
+stderr 67
+stderr 68
+stderr 69
+stderr 70
+stderr 71
+stderr 72
+stderr 73
+stderr 74
+stderr 75
+stderr 76
+stderr 77
+stderr 78
+stderr 79
+stderr 80
+stderr 81
+stderr 82
+stderr 83
+stderr 84
+stderr 85
+stderr 86
+stderr 87
+stderr 88
+stderr 89
+stderr 90
+stderr 91
+stderr 92
+stderr 93
+stderr 94
+stderr 95
+stderr 96
+stderr 97
+stderr 98
+stderr 99
+stderr 100
+stderr 101
+stderr 102
+stderr 103
+stderr 104
+stderr 105
+stderr 106
+stderr 107
+stderr 108
+stderr 109
+stderr 110
+stderr 111
+stderr 112
+stderr 113
+stderr 114
+stderr 115
+stderr 116
+stderr 117
+stderr 118
+stderr 119
+stderr 120
+stderr 121
+stderr 122
+stderr 123
+stderr 124
+stderr 125
+stderr 126
+stderr 127
+stderr 128
+stderr 129
+stderr 130
+stderr 131
+stderr 132
+stderr 133
+stderr 134
+stderr 135
+stderr 136
+stderr 137
+stderr 138
+stderr 139
+stderr 140
+stderr 141
+stderr 142
+stderr 143
+stderr 144
+stderr 145
+stderr 146
+stderr 147
+stderr 148
+stderr 149
+stderr 150
+stderr 151
+stderr 152
+stderr 153
+stderr 154
+stderr 155
+stderr 156
+stderr 157
+stderr 158
+stderr 159
+stderr 160
+stderr 161
+stderr 162
+stderr 163
+stderr 164
+stderr 165
+stderr 166
+stderr 167
+stderr 168
+stderr 169
+stderr 170
+stderr 171
+stderr 172
+stderr 173
+stderr 174
+stderr 175
+stderr 176
+stderr 177
+stderr 178
+stderr 179
+stderr 180
+stderr 181
+stderr 182
+stderr 183
+stderr 184
+stderr 185
+stderr 186
+stderr 187
+stderr 188
+stderr 189
+stderr 190
+stderr 191
+stderr 192
+stderr 193
+stderr 194
+stderr 195
+stderr 196
+stderr 197
+stderr 198
+stderr 199
+stderr 200
+stderr 201
+stderr 202
+stderr 203
+stderr 204
+stderr 205
+stderr 206
+stderr 207
+stderr 208
+stderr 209
+stderr 210
+stderr 211
+stderr 212
+stderr 213
+stderr 214
+stderr 215
+stderr 216
+stderr 217
+stderr 218
+stderr 219
+stderr 220
+stderr 221
+stderr 222
+stderr 223
+stderr 224
+stderr 225
+stderr 226
+stderr 227
+stderr 228
+stderr 229
+stderr 230
+stderr 231
+stderr 232
+stderr 233
+stderr 234
+stderr 235
+stderr 236
+stderr 237
+stderr 238
+stderr 239
+stderr 240
+stderr 241
+stderr 242
+stderr 243
+stderr 244
+stderr 245
+stderr 246
+stderr 247
+stderr 248
+stderr 249
+stderr 250
+stderr 251
+stderr 252
+stderr 253
+stderr 254
+stderr 255
+stderr 256
+stderr 257
+stderr 258
+stderr 259
+stderr 260
+stderr 261
+stderr 262
+stderr 263
+stderr 264
+stderr 265
+stderr 266
+stderr 267
+stderr 268
+stderr 269
+stderr 270
+stderr 271
+stderr 272
+stderr 273
+stderr 274
+stderr 275
+stderr 276
+stderr 277
+stderr 278
+stderr 279
+stderr 280
+stderr 281
+stderr 282
+stderr 283
+stderr 284
+stderr 285
+stderr 286
+stderr 287
+stderr 288
+stderr 289
+stderr 290
+stderr 291
+stderr 292
+stderr 293
+stderr 294
+stderr 295
+stderr 296
+stderr 297
+stderr 298
+stderr 299
+stderr 300
+stderr 301
+stderr 302
+stderr 303
+stderr 304
+stderr 305
+stderr 306
+stderr 307
+stderr 308
+stderr 309
+stderr 310
+stderr 311
+stderr 312
+stderr 313
+stderr 314
+stderr 315
+stderr 316
+stderr 317
+stderr 318
+stderr 319
+stderr 320
+stderr 321
+stderr 322
+stderr 323
+stderr 324
+stderr 325
+stderr 326
+stderr 327
+stderr 328
+stderr 329
+stderr 330
+stderr 331
+stderr 332
+stderr 333
+stderr 334
+stderr 335
+stderr 336
+stderr 337
+stderr 338
+stderr 339
+stderr 340
+stderr 341
+stderr 342
+stderr 343
+stderr 344
+stderr 345
+stderr 346
+stderr 347
+stderr 348
+stderr 349
+stderr 350
+stderr 351
+stderr 352
+stderr 353
+stderr 354
+stderr 355
+stderr 356
+stderr 357
+stderr 358
+stderr 359
+stderr 360
+stderr 361
+stderr 362
+stderr 363
+stderr 364
+stderr 365
+stderr 366
+stderr 367
+stderr 368
+stderr 369
+stderr 370
+stderr 371
+stderr 372
+stderr 373
+stderr 374
+stderr 375
+stderr 376
+stderr 377
+stderr 378
+stderr 379
+stderr 380
+stderr 381
+stderr 382
+stderr 383
+stderr 384
+stderr 385
+stderr 386
+stderr 387
+stderr 388
+stderr 389
+stderr 390
+stderr 391
+stderr 392
+stderr 393
+stderr 394
+stderr 395
+stderr 396
+stderr 397
+stderr 398
+stderr 399
+stderr 400
+stderr 401
+stderr 402
+stderr 403
+stderr 404
+stderr 405
+stderr 406
+stderr 407
+stderr 408
+stderr 409
+stderr 410
+stderr 411
+stderr 412
+stderr 413
+stderr 414
+stderr 415
+stderr 416
+stderr 417
+stderr 418
+stderr 419
+stderr 420
+stderr 421
+stderr 422
+stderr 423
+stderr 424
+stderr 425
+stderr 426
+stderr 427
+stderr 428
+stderr 429
+stderr 430
+stderr 431
+stderr 432
+stderr 433
+stderr 434
+stderr 435
+stderr 436
+stderr 437
+stderr 438
+stderr 439
+stderr 440
+stderr 441
+stderr 442
+stderr 443
+stderr 444
+stderr 445
+stderr 446
+stderr 447
+stderr 448
+stderr 449
+stderr 450
+stderr 451
+stderr 452
+stderr 453
+stderr 454
+stderr 455
+stderr 456
+stderr 457
+stderr 458
+stderr 459
+stderr 460
+stderr 461
+stderr 462
+stderr 463
+stderr 464
+stderr 465
+stderr 466
+stderr 467
+stderr 468
+stderr 469
+stderr 470
+stderr 471
+stderr 472
+stderr 473
+stderr 474
+stderr 475
+stderr 476
+stderr 477
+stderr 478
+stderr 479
+stderr 480
+stderr 481
+stderr 482
+stderr 483
+stderr 484
+stderr 485
+stderr 486
+stderr 487
+stderr 488
+stderr 489
+stderr 490
+stderr 491
+stderr 492
+stderr 493
+stderr 494
+stderr 495
+stderr 496
+stderr 497
+stderr 498
+stderr 499
+stderr 500
+stderr 501
+stderr 502
+stderr 503
+stderr 504
+stderr 505
+stderr 506
+stderr 507
+stderr 508
+stderr 509
+stderr 510
+stderr 511
+stderr 512
+stderr 513
+stderr 514
+stderr 515
+stderr 516
+stderr 517
+stderr 518
+stderr 519
+stderr 520
+stderr 521
+stderr 522
+stderr 523
+stderr 524
+stderr 525
+stderr 526
+stderr 527
+stderr 528
+stderr 529
+stderr 530
+stderr 531
+stderr 532
+stderr 533
+stderr 534
+stderr 535
+stderr 536
+stderr 537
+stderr 538
+stderr 539
+stderr 540
+stderr 541
+stderr 542
+stderr 543
+stderr 544
+stderr 545
+stderr 546
+stderr 547
+stderr 548
+stderr 549
+stderr 550
+stderr 551
+stderr 552
+stderr 553
+stderr 554
+stderr 555
+stderr 556
+stderr 557
+stderr 558
+stderr 559
+stderr 560
+stderr 561
+stderr 562
+stderr 563
+stderr 564
+stderr 565
+stderr 566
+stderr 567
+stderr 568
+stderr 569
+stderr 570
+stderr 571
+stderr 572
+stderr 573
+stderr 574
+stderr 575
+stderr 576
+stderr 577
+stderr 578
+stderr 579
+stderr 580
+stderr 581
+stderr 582
+stderr 583
+stderr 584
+stderr 585
+stderr 586
+stderr 587
+stderr 588
+stderr 589
+stderr 590
+stderr 591
+stderr 592
+stderr 593
+stderr 594
+stderr 595
+stderr 596
+stderr 597
+stderr 598
+stderr 599
+stderr 600
+stderr 601
+stderr 602
+stderr 603
+stderr 604
+stderr 605
+stderr 606
+stderr 607
+stderr 608
+stderr 609
+stderr 610
+stderr 611
+stderr 612
+stderr 613
+stderr 614
+stderr 615
+stderr 616
+stderr 617
+stderr 618
+stderr 619
+stderr 620
+stderr 621
+stderr 622
+stderr 623
+stderr 624
+stderr 625
+stderr 626
+stderr 627
+stderr 628
+stderr 629
+stderr 630
+stderr 631
+stderr 632
+stderr 633
+stderr 634
+stderr 635
+stderr 636
+stderr 637
+stderr 638
+stderr 639
+stderr 640
+stderr 641
+stderr 642
+stderr 643
+stderr 644
+stderr 645
+stderr 646
+stderr 647
+stderr 648
+stderr 649
+stderr 650
+stderr 651
+stderr 652
+stderr 653
+stderr 654
+stderr 655
+stderr 656
+stderr 657
+stderr 658
+stderr 659
+stderr 660
+stderr 661
+stderr 662
+stderr 663
+stderr 664
+stderr 665
+stderr 666
+stderr 667
+stderr 668
+stderr 669
+stderr 670
+stderr 671
+stderr 672
+stderr 673
+stderr 674
+stderr 675
+stderr 676
+stderr 677
+stderr 678
+stderr 679
+stderr 680
+stderr 681
+stderr 682
+stderr 683
+stderr 684
+stderr 685
+stderr 686
+stderr 687
+stderr 688
+stderr 689
+stderr 690
+stderr 691
+stderr 692
+stderr 693
+stderr 694
+stderr 695
+stderr 696
+stderr 697
+stderr 698
+stderr 699
+stderr 700
+stderr 701
+stderr 702
+stderr 703
+stderr 704
+stderr 705
+stderr 706
+stderr 707
+stderr 708
+stderr 709
+stderr 710
+stderr 711
+stderr 712
+stderr 713
+stderr 714
+stderr 715
+stderr 716
+stderr 717
+stderr 718
+stderr 719
+stderr 720
+stderr 721
+stderr 722
+stderr 723
+stderr 724
+stderr 725
+stderr 726
+stderr 727
+stderr 728
+stderr 729
+stderr 730
+stderr 731
+stderr 732
+stderr 733
+stderr 734
+stderr 735
+stderr 736
+stderr 737
+stderr 738
+stderr 739
+stderr 740
+stderr 741
+stderr 742
+stderr 743
+stderr 744
+stderr 745
+stderr 746
+stderr 747
+stderr 748
+stderr 749
+stderr 750
+stderr 751
+stderr 752
+stderr 753
+stderr 754
+stderr 755
+stderr 756
+stderr 757
+stderr 758
+stderr 759
+stderr 760
+stderr 761
+stderr 762
+stderr 763
+stderr 764
+stderr 765
+stderr 766
+stderr 767
+stderr 768
+stderr 769
+stderr 770
+stderr 771
+stderr 772
+stderr 773
+stderr 774
+stderr 775
+stderr 776
+stderr 777
+stderr 778
+stderr 779
+stderr 780
+stderr 781
+stderr 782
+stderr 783
+stderr 784
+stderr 785
+stderr 786
+stderr 787
+stderr 788
+stderr 789
+stderr 790
+stderr 791
+stderr 792
+stderr 793
+stderr 794
+stderr 795
+stderr 796
+stderr 797
+stderr 798
+stderr 799
+stderr 800
+stderr 801
+stderr 802
+stderr 803
+stderr 804
+stderr 805
+stderr 806
+stderr 807
+stderr 808
+stderr 809
+stderr 810
+stderr 811
+stderr 812
+stderr 813
+stderr 814
+stderr 815
+stderr 816
+stderr 817
+stderr 818
+stderr 819
+stderr 820
+stderr 821
+stderr 822
+stderr 823
+stderr 824
+stderr 825
+stderr 826
+stderr 827
+stderr 828
+stderr 829
+stderr 830
+stderr 831
+stderr 832
+stderr 833
+stderr 834
+stderr 835
+stderr 836
+stderr 837
+stderr 838
+stderr 839
+stderr 840
+stderr 841
+stderr 842
+stderr 843
+stderr 844
+stderr 845
+stderr 846
+stderr 847
+stderr 848
+stderr 849
+stderr 850
+stderr 851
+stderr 852
+stderr 853
+stderr 854
+stderr 855
+stderr 856
+stderr 857
+stderr 858
+stderr 859
+stderr 860
+stderr 861
+stderr 862
+stderr 863
+stderr 864
+stderr 865
+stderr 866
+stderr 867
+stderr 868
+stderr 869
+stderr 870
+stderr 871
+stderr 872
+stderr 873
+stderr 874
+stderr 875
+stderr 876
+stderr 877
+stderr 878
+stderr 879
+stderr 880
+stderr 881
+stderr 882
+stderr 883
+stderr 884
+stderr 885
+stderr 886
+stderr 887
+stderr 888
+stderr 889
+stderr 890
+stderr 891
+stderr 892
+stderr 893
+stderr 894
+stderr 895
+stderr 896
+stderr 897
+stderr 898
+stderr 899
+stderr 900
+stderr 901
+stderr 902
+stderr 903
+stderr 904
+stderr 905
+stderr 906
+stderr 907
+stderr 908
+stderr 909
+stderr 910
+stderr 911
+stderr 912
+stderr 913
+stderr 914
+stderr 915
+stderr 916
+stderr 917
+stderr 918
+stderr 919
+stderr 920
+stderr 921
+stderr 922
+stderr 923
+stderr 924
+stderr 925
+stderr 926
+stderr 927
+stderr 928
+stderr 929
+stderr 930
+stderr 931
+stderr 932
+stderr 933
+stderr 934
+stderr 935
+stderr 936
+stderr 937
+stderr 938
+stderr 939
+stderr 940
+stderr 941
+stderr 942
+stderr 943
+stderr 944
+stderr 945
+stderr 946
+stderr 947
+stderr 948
+stderr 949
+stderr 950
+stderr 951
+stderr 952
+stderr 953
+stderr 954
+stderr 955
+stderr 956
+stderr 957
+stderr 958
+stderr 959
+stderr 960
+stderr 961
+stderr 962
+stderr 963
+stderr 964
+stderr 965
+stderr 966
+stderr 967
+stderr 968
+stderr 969
+stderr 970
+stderr 971
+stderr 972
+stderr 973
+stderr 974
+stderr 975
+stderr 976
+stderr 977
+stderr 978
+stderr 979
+stderr 980
+stderr 981
+stderr 982
+stderr 983
+stderr 984
+stderr 985
+stderr 986
+stderr 987
+stderr 988
+stderr 989
+stderr 990
+stderr 991
+stderr 992
+stderr 993
+stderr 994
+stderr 995
+stderr 996
+stderr 997
+stderr 998
+stderr 999
diff --git a/node_modules/grunt/node_modules/exit/test/fixtures/1000-stdout-stderr.txt b/node_modules/grunt/node_modules/exit/test/fixtures/1000-stdout-stderr.txt
new file mode 100644
index 0000000..4fde2b4
--- /dev/null
+++ b/node_modules/grunt/node_modules/exit/test/fixtures/1000-stdout-stderr.txt
@@ -0,0 +1,2000 @@
+stdout 0
+stderr 0
+stdout 1
+stderr 1
+stdout 2
+stderr 2
+stdout 3
+stderr 3
+stdout 4
+stderr 4
+stdout 5
+stderr 5
+stdout 6
+stderr 6
+stdout 7
+stderr 7
+stdout 8
+stderr 8
+stdout 9
+stderr 9
+stdout 10
+stderr 10
+stdout 11
+stderr 11
+stdout 12
+stderr 12
+stdout 13
+stderr 13
+stdout 14
+stderr 14
+stdout 15
+stderr 15
+stdout 16
+stderr 16
+stdout 17
+stderr 17
+stdout 18
+stderr 18
+stdout 19
+stderr 19
+stdout 20
+stderr 20
+stdout 21
+stderr 21
+stdout 22
+stderr 22
+stdout 23
+stderr 23
+stdout 24
+stderr 24
+stdout 25
+stderr 25
+stdout 26
+stderr 26
+stdout 27
+stderr 27
+stdout 28
+stderr 28
+stdout 29
+stderr 29
+stdout 30
+stderr 30
+stdout 31
+stderr 31
+stdout 32
+stderr 32
+stdout 33
+stderr 33
+stdout 34
+stderr 34
+stdout 35
+stderr 35
+stdout 36
+stderr 36
+stdout 37
+stderr 37
+stdout 38
+stderr 38
+stdout 39
+stderr 39
+stdout 40
+stderr 40
+stdout 41
+stderr 41
+stdout 42
+stderr 42
+stdout 43
+stderr 43
+stdout 44
+stderr 44
+stdout 45
+stderr 45
+stdout 46
+stderr 46
+stdout 47
+stderr 47
+stdout 48
+stderr 48
+stdout 49
+stderr 49
+stdout 50
+stderr 50
+stdout 51
+stderr 51
+stdout 52
+stderr 52
+stdout 53
+stderr 53
+stdout 54
+stderr 54
+stdout 55
+stderr 55
+stdout 56
+stderr 56
+stdout 57
+stderr 57
+stdout 58
+stderr 58
+stdout 59
+stderr 59
+stdout 60
+stderr 60
+stdout 61
+stderr 61
+stdout 62
+stderr 62
+stdout 63
+stderr 63
+stdout 64
+stderr 64
+stdout 65
+stderr 65
+stdout 66
+stderr 66
+stdout 67
+stderr 67
+stdout 68
+stderr 68
+stdout 69
+stderr 69
+stdout 70
+stderr 70
+stdout 71
+stderr 71
+stdout 72
+stderr 72
+stdout 73
+stderr 73
+stdout 74
+stderr 74
+stdout 75
+stderr 75
+stdout 76
+stderr 76
+stdout 77
+stderr 77
+stdout 78
+stderr 78
+stdout 79
+stderr 79
+stdout 80
+stderr 80
+stdout 81
+stderr 81
+stdout 82
+stderr 82
+stdout 83
+stderr 83
+stdout 84
+stderr 84
+stdout 85
+stderr 85
+stdout 86
+stderr 86
+stdout 87
+stderr 87
+stdout 88
+stderr 88
+stdout 89
+stderr 89
+stdout 90
+stderr 90
+stdout 91
+stderr 91
+stdout 92
+stderr 92
+stdout 93
+stderr 93
+stdout 94
+stderr 94
+stdout 95
+stderr 95
+stdout 96
+stderr 96
+stdout 97
+stderr 97
+stdout 98
+stderr 98
+stdout 99
+stderr 99
+stdout 100
+stderr 100
+stdout 101
+stderr 101
+stdout 102
+stderr 102
+stdout 103
+stderr 103
+stdout 104
+stderr 104
+stdout 105
+stderr 105
+stdout 106
+stderr 106
+stdout 107
+stderr 107
+stdout 108
+stderr 108
+stdout 109
+stderr 109
+stdout 110
+stderr 110
+stdout 111
+stderr 111
+stdout 112
+stderr 112
+stdout 113
+stderr 113
+stdout 114
+stderr 114
+stdout 115
+stderr 115
+stdout 116
+stderr 116
+stdout 117
+stderr 117
+stdout 118
+stderr 118
+stdout 119
+stderr 119
+stdout 120
+stderr 120
+stdout 121
+stderr 121
+stdout 122
+stderr 122
+stdout 123
+stderr 123
+stdout 124
+stderr 124
+stdout 125
+stderr 125
+stdout 126
+stderr 126
+stdout 127
+stderr 127
+stdout 128
+stderr 128
+stdout 129
+stderr 129
+stdout 130
+stderr 130
+stdout 131
+stderr 131
+stdout 132
+stderr 132
+stdout 133
+stderr 133
+stdout 134
+stderr 134
+stdout 135
+stderr 135
+stdout 136
+stderr 136
+stdout 137
+stderr 137
+stdout 138
+stderr 138
+stdout 139
+stderr 139
+stdout 140
+stderr 140
+stdout 141
+stderr 141
+stdout 142
+stderr 142
+stdout 143
+stderr 143
+stdout 144
+stderr 144
+stdout 145
+stderr 145
+stdout 146
+stderr 146
+stdout 147
+stderr 147
+stdout 148
+stderr 148
+stdout 149
+stderr 149
+stdout 150
+stderr 150
+stdout 151
+stderr 151
+stdout 152
+stderr 152
+stdout 153
+stderr 153
+stdout 154
+stderr 154
+stdout 155
+stderr 155
+stdout 156
+stderr 156
+stdout 157
+stderr 157
+stdout 158
+stderr 158
+stdout 159
+stderr 159
+stdout 160
+stderr 160
+stdout 161
+stderr 161
+stdout 162
+stderr 162
+stdout 163
+stderr 163
+stdout 164
+stderr 164
+stdout 165
+stderr 165
+stdout 166
+stderr 166
+stdout 167
+stderr 167
+stdout 168
+stderr 168
+stdout 169
+stderr 169
+stdout 170
+stderr 170
+stdout 171
+stderr 171
+stdout 172
+stderr 172
+stdout 173
+stderr 173
+stdout 174
+stderr 174
+stdout 175
+stderr 175
+stdout 176
+stderr 176
+stdout 177
+stderr 177
+stdout 178
+stderr 178
+stdout 179
+stderr 179
+stdout 180
+stderr 180
+stdout 181
+stderr 181
+stdout 182
+stderr 182
+stdout 183
+stderr 183
+stdout 184
+stderr 184
+stdout 185
+stderr 185
+stdout 186
+stderr 186
+stdout 187
+stderr 187
+stdout 188
+stderr 188
+stdout 189
+stderr 189
+stdout 190
+stderr 190
+stdout 191
+stderr 191
+stdout 192
+stderr 192
+stdout 193
+stderr 193
+stdout 194
+stderr 194
+stdout 195
+stderr 195
+stdout 196
+stderr 196
+stdout 197
+stderr 197
+stdout 198
+stderr 198
+stdout 199
+stderr 199
+stdout 200
+stderr 200
+stdout 201
+stderr 201
+stdout 202
+stderr 202
+stdout 203
+stderr 203
+stdout 204
+stderr 204
+stdout 205
+stderr 205
+stdout 206
+stderr 206
+stdout 207
+stderr 207
+stdout 208
+stderr 208
+stdout 209
+stderr 209
+stdout 210
+stderr 210
+stdout 211
+stderr 211
+stdout 212
+stderr 212
+stdout 213
+stderr 213
+stdout 214
+stderr 214
+stdout 215
+stderr 215
+stdout 216
+stderr 216
+stdout 217
+stderr 217
+stdout 218
+stderr 218
+stdout 219
+stderr 219
+stdout 220
+stderr 220
+stdout 221
+stderr 221
+stdout 222
+stderr 222
+stdout 223
+stderr 223
+stdout 224
+stderr 224
+stdout 225
+stderr 225
+stdout 226
+stderr 226
+stdout 227
+stderr 227
+stdout 228
+stderr 228
+stdout 229
+stderr 229
+stdout 230
+stderr 230
+stdout 231
+stderr 231
+stdout 232
+stderr 232
+stdout 233
+stderr 233
+stdout 234
+stderr 234
+stdout 235
+stderr 235
+stdout 236
+stderr 236
+stdout 237
+stderr 237
+stdout 238
+stderr 238
+stdout 239
+stderr 239
+stdout 240
+stderr 240
+stdout 241
+stderr 241
+stdout 242
+stderr 242
+stdout 243
+stderr 243
+stdout 244
+stderr 244
+stdout 245
+stderr 245
+stdout 246
+stderr 246
+stdout 247
+stderr 247
+stdout 248
+stderr 248
+stdout 249
+stderr 249
+stdout 250
+stderr 250
+stdout 251
+stderr 251
+stdout 252
+stderr 252
+stdout 253
+stderr 253
+stdout 254
+stderr 254
+stdout 255
+stderr 255
+stdout 256
+stderr 256
+stdout 257
+stderr 257
+stdout 258
+stderr 258
+stdout 259
+stderr 259
+stdout 260
+stderr 260
+stdout 261
+stderr 261
+stdout 262
+stderr 262
+stdout 263
+stderr 263
+stdout 264
+stderr 264
+stdout 265
+stderr 265
+stdout 266
+stderr 266
+stdout 267
+stderr 267
+stdout 268
+stderr 268
+stdout 269
+stderr 269
+stdout 270
+stderr 270
+stdout 271
+stderr 271
+stdout 272
+stderr 272
+stdout 273
+stderr 273
+stdout 274
+stderr 274
+stdout 275
+stderr 275
+stdout 276
+stderr 276
+stdout 277
+stderr 277
+stdout 278
+stderr 278
+stdout 279
+stderr 279
+stdout 280
+stderr 280
+stdout 281
+stderr 281
+stdout 282
+stderr 282
+stdout 283
+stderr 283
+stdout 284
+stderr 284
+stdout 285
+stderr 285
+stdout 286
+stderr 286
+stdout 287
+stderr 287
+stdout 288
+stderr 288
+stdout 289
+stderr 289
+stdout 290
+stderr 290
+stdout 291
+stderr 291
+stdout 292
+stderr 292
+stdout 293
+stderr 293
+stdout 294
+stderr 294
+stdout 295
+stderr 295
+stdout 296
+stderr 296
+stdout 297
+stderr 297
+stdout 298
+stderr 298
+stdout 299
+stderr 299
+stdout 300
+stderr 300
+stdout 301
+stderr 301
+stdout 302
+stderr 302
+stdout 303
+stderr 303
+stdout 304
+stderr 304
+stdout 305
+stderr 305
+stdout 306
+stderr 306
+stdout 307
+stderr 307
+stdout 308
+stderr 308
+stdout 309
+stderr 309
+stdout 310
+stderr 310
+stdout 311
+stderr 311
+stdout 312
+stderr 312
+stdout 313
+stderr 313
+stdout 314
+stderr 314
+stdout 315
+stderr 315
+stdout 316
+stderr 316
+stdout 317
+stderr 317
+stdout 318
+stderr 318
+stdout 319
+stderr 319
+stdout 320
+stderr 320
+stdout 321
+stderr 321
+stdout 322
+stderr 322
+stdout 323
+stderr 323
+stdout 324
+stderr 324
+stdout 325
+stderr 325
+stdout 326
+stderr 326
+stdout 327
+stderr 327
+stdout 328
+stderr 328
+stdout 329
+stderr 329
+stdout 330
+stderr 330
+stdout 331
+stderr 331
+stdout 332
+stderr 332
+stdout 333
+stderr 333
+stdout 334
+stderr 334
+stdout 335
+stderr 335
+stdout 336
+stderr 336
+stdout 337
+stderr 337
+stdout 338
+stderr 338
+stdout 339
+stderr 339
+stdout 340
+stderr 340
+stdout 341
+stderr 341
+stdout 342
+stderr 342
+stdout 343
+stderr 343
+stdout 344
+stderr 344
+stdout 345
+stderr 345
+stdout 346
+stderr 346
+stdout 347
+stderr 347
+stdout 348
+stderr 348
+stdout 349
+stderr 349
+stdout 350
+stderr 350
+stdout 351
+stderr 351
+stdout 352
+stderr 352
+stdout 353
+stderr 353
+stdout 354
+stderr 354
+stdout 355
+stderr 355
+stdout 356
+stderr 356
+stdout 357
+stderr 357
+stdout 358
+stderr 358
+stdout 359
+stderr 359
+stdout 360
+stderr 360
+stdout 361
+stderr 361
+stdout 362
+stderr 362
+stdout 363
+stderr 363
+stdout 364
+stderr 364
+stdout 365
+stderr 365
+stdout 366
+stderr 366
+stdout 367
+stderr 367
+stdout 368
+stderr 368
+stdout 369
+stderr 369
+stdout 370
+stderr 370
+stdout 371
+stderr 371
+stdout 372
+stderr 372
+stdout 373
+stderr 373
+stdout 374
+stderr 374
+stdout 375
+stderr 375
+stdout 376
+stderr 376
+stdout 377
+stderr 377
+stdout 378
+stderr 378
+stdout 379
+stderr 379
+stdout 380
+stderr 380
+stdout 381
+stderr 381
+stdout 382
+stderr 382
+stdout 383
+stderr 383
+stdout 384
+stderr 384
+stdout 385
+stderr 385
+stdout 386
+stderr 386
+stdout 387
+stderr 387
+stdout 388
+stderr 388
+stdout 389
+stderr 389
+stdout 390
+stderr 390
+stdout 391
+stderr 391
+stdout 392
+stderr 392
+stdout 393
+stderr 393
+stdout 394
+stderr 394
+stdout 395
+stderr 395
+stdout 396
+stderr 396
+stdout 397
+stderr 397
+stdout 398
+stderr 398
+stdout 399
+stderr 399
+stdout 400
+stderr 400
+stdout 401
+stderr 401
+stdout 402
+stderr 402
+stdout 403
+stderr 403
+stdout 404
+stderr 404
+stdout 405
+stderr 405
+stdout 406
+stderr 406
+stdout 407
+stderr 407
+stdout 408
+stderr 408
+stdout 409
+stderr 409
+stdout 410
+stderr 410
+stdout 411
+stderr 411
+stdout 412
+stderr 412
+stdout 413
+stderr 413
+stdout 414
+stderr 414
+stdout 415
+stderr 415
+stdout 416
+stderr 416
+stdout 417
+stderr 417
+stdout 418
+stderr 418
+stdout 419
+stderr 419
+stdout 420
+stderr 420
+stdout 421
+stderr 421
+stdout 422
+stderr 422
+stdout 423
+stderr 423
+stdout 424
+stderr 424
+stdout 425
+stderr 425
+stdout 426
+stderr 426
+stdout 427
+stderr 427
+stdout 428
+stderr 428
+stdout 429
+stderr 429
+stdout 430
+stderr 430
+stdout 431
+stderr 431
+stdout 432
+stderr 432
+stdout 433
+stderr 433
+stdout 434
+stderr 434
+stdout 435
+stderr 435
+stdout 436
+stderr 436
+stdout 437
+stderr 437
+stdout 438
+stderr 438
+stdout 439
+stderr 439
+stdout 440
+stderr 440
+stdout 441
+stderr 441
+stdout 442
+stderr 442
+stdout 443
+stderr 443
+stdout 444
+stderr 444
+stdout 445
+stderr 445
+stdout 446
+stderr 446
+stdout 447
+stderr 447
+stdout 448
+stderr 448
+stdout 449
+stderr 449
+stdout 450
+stderr 450
+stdout 451
+stderr 451
+stdout 452
+stderr 452
+stdout 453
+stderr 453
+stdout 454
+stderr 454
+stdout 455
+stderr 455
+stdout 456
+stderr 456
+stdout 457
+stderr 457
+stdout 458
+stderr 458
+stdout 459
+stderr 459
+stdout 460
+stderr 460
+stdout 461
+stderr 461
+stdout 462
+stderr 462
+stdout 463
+stderr 463
+stdout 464
+stderr 464
+stdout 465
+stderr 465
+stdout 466
+stderr 466
+stdout 467
+stderr 467
+stdout 468
+stderr 468
+stdout 469
+stderr 469
+stdout 470
+stderr 470
+stdout 471
+stderr 471
+stdout 472
+stderr 472
+stdout 473
+stderr 473
+stdout 474
+stderr 474
+stdout 475
+stderr 475
+stdout 476
+stderr 476
+stdout 477
+stderr 477
+stdout 478
+stderr 478
+stdout 479
+stderr 479
+stdout 480
+stderr 480
+stdout 481
+stderr 481
+stdout 482
+stderr 482
+stdout 483
+stderr 483
+stdout 484
+stderr 484
+stdout 485
+stderr 485
+stdout 486
+stderr 486
+stdout 487
+stderr 487
+stdout 488
+stderr 488
+stdout 489
+stderr 489
+stdout 490
+stderr 490
+stdout 491
+stderr 491
+stdout 492
+stderr 492
+stdout 493
+stderr 493
+stdout 494
+stderr 494
+stdout 495
+stderr 495
+stdout 496
+stderr 496
+stdout 497
+stderr 497
+stdout 498
+stderr 498
+stdout 499
+stderr 499
+stdout 500
+stderr 500
+stdout 501
+stderr 501
+stdout 502
+stderr 502
+stdout 503
+stderr 503
+stdout 504
+stderr 504
+stdout 505
+stderr 505
+stdout 506
+stderr 506
+stdout 507
+stderr 507
+stdout 508
+stderr 508
+stdout 509
+stderr 509
+stdout 510
+stderr 510
+stdout 511
+stderr 511
+stdout 512
+stderr 512
+stdout 513
+stderr 513
+stdout 514
+stderr 514
+stdout 515
+stderr 515
+stdout 516
+stderr 516
+stdout 517
+stderr 517
+stdout 518
+stderr 518
+stdout 519
+stderr 519
+stdout 520
+stderr 520
+stdout 521
+stderr 521
+stdout 522
+stderr 522
+stdout 523
+stderr 523
+stdout 524
+stderr 524
+stdout 525
+stderr 525
+stdout 526
+stderr 526
+stdout 527
+stderr 527
+stdout 528
+stderr 528
+stdout 529
+stderr 529
+stdout 530
+stderr 530
+stdout 531
+stderr 531
+stdout 532
+stderr 532
+stdout 533
+stderr 533
+stdout 534
+stderr 534
+stdout 535
+stderr 535
+stdout 536
+stderr 536
+stdout 537
+stderr 537
+stdout 538
+stderr 538
+stdout 539
+stderr 539
+stdout 540
+stderr 540
+stdout 541
+stderr 541
+stdout 542
+stderr 542
+stdout 543
+stderr 543
+stdout 544
+stderr 544
+stdout 545
+stderr 545
+stdout 546
+stderr 546
+stdout 547
+stderr 547
+stdout 548
+stderr 548
+stdout 549
+stderr 549
+stdout 550
+stderr 550
+stdout 551
+stderr 551
+stdout 552
+stderr 552
+stdout 553
+stderr 553
+stdout 554
+stderr 554
+stdout 555
+stderr 555
+stdout 556
+stderr 556
+stdout 557
+stderr 557
+stdout 558
+stderr 558
+stdout 559
+stderr 559
+stdout 560
+stderr 560
+stdout 561
+stderr 561
+stdout 562
+stderr 562
+stdout 563
+stderr 563
+stdout 564
+stderr 564
+stdout 565
+stderr 565
+stdout 566
+stderr 566
+stdout 567
+stderr 567
+stdout 568
+stderr 568
+stdout 569
+stderr 569
+stdout 570
+stderr 570
+stdout 571
+stderr 571
+stdout 572
+stderr 572
+stdout 573
+stderr 573
+stdout 574
+stderr 574
+stdout 575
+stderr 575
+stdout 576
+stderr 576
+stdout 577
+stderr 577
+stdout 578
+stderr 578
+stdout 579
+stderr 579
+stdout 580
+stderr 580
+stdout 581
+stderr 581
+stdout 582
+stderr 582
+stdout 583
+stderr 583
+stdout 584
+stderr 584
+stdout 585
+stderr 585
+stdout 586
+stderr 586
+stdout 587
+stderr 587
+stdout 588
+stderr 588
+stdout 589
+stderr 589
+stdout 590
+stderr 590
+stdout 591
+stderr 591
+stdout 592
+stderr 592
+stdout 593
+stderr 593
+stdout 594
+stderr 594
+stdout 595
+stderr 595
+stdout 596
+stderr 596
+stdout 597
+stderr 597
+stdout 598
+stderr 598
+stdout 599
+stderr 599
+stdout 600
+stderr 600
+stdout 601
+stderr 601
+stdout 602
+stderr 602
+stdout 603
+stderr 603
+stdout 604
+stderr 604
+stdout 605
+stderr 605
+stdout 606
+stderr 606
+stdout 607
+stderr 607
+stdout 608
+stderr 608
+stdout 609
+stderr 609
+stdout 610
+stderr 610
+stdout 611
+stderr 611
+stdout 612
+stderr 612
+stdout 613
+stderr 613
+stdout 614
+stderr 614
+stdout 615
+stderr 615
+stdout 616
+stderr 616
+stdout 617
+stderr 617
+stdout 618
+stderr 618
+stdout 619
+stderr 619
+stdout 620
+stderr 620
+stdout 621
+stderr 621
+stdout 622
+stderr 622
+stdout 623
+stderr 623
+stdout 624
+stderr 624
+stdout 625
+stderr 625
+stdout 626
+stderr 626
+stdout 627
+stderr 627
+stdout 628
+stderr 628
+stdout 629
+stderr 629
+stdout 630
+stderr 630
+stdout 631
+stderr 631
+stdout 632
+stderr 632
+stdout 633
+stderr 633
+stdout 634
+stderr 634
+stdout 635
+stderr 635
+stdout 636
+stderr 636
+stdout 637
+stderr 637
+stdout 638
+stderr 638
+stdout 639
+stderr 639
+stdout 640
+stderr 640
+stdout 641
+stderr 641
+stdout 642
+stderr 642
+stdout 643
+stderr 643
+stdout 644
+stderr 644
+stdout 645
+stderr 645
+stdout 646
+stderr 646
+stdout 647
+stderr 647
+stdout 648
+stderr 648
+stdout 649
+stderr 649
+stdout 650
+stderr 650
+stdout 651
+stderr 651
+stdout 652
+stderr 652
+stdout 653
+stderr 653
+stdout 654
+stderr 654
+stdout 655
+stderr 655
+stdout 656
+stderr 656
+stdout 657
+stderr 657
+stdout 658
+stderr 658
+stdout 659
+stderr 659
+stdout 660
+stderr 660
+stdout 661
+stderr 661
+stdout 662
+stderr 662
+stdout 663
+stderr 663
+stdout 664
+stderr 664
+stdout 665
+stderr 665
+stdout 666
+stderr 666
+stdout 667
+stderr 667
+stdout 668
+stderr 668
+stdout 669
+stderr 669
+stdout 670
+stderr 670
+stdout 671
+stderr 671
+stdout 672
+stderr 672
+stdout 673
+stderr 673
+stdout 674
+stderr 674
+stdout 675
+stderr 675
+stdout 676
+stderr 676
+stdout 677
+stderr 677
+stdout 678
+stderr 678
+stdout 679
+stderr 679
+stdout 680
+stderr 680
+stdout 681
+stderr 681
+stdout 682
+stderr 682
+stdout 683
+stderr 683
+stdout 684
+stderr 684
+stdout 685
+stderr 685
+stdout 686
+stderr 686
+stdout 687
+stderr 687
+stdout 688
+stderr 688
+stdout 689
+stderr 689
+stdout 690
+stderr 690
+stdout 691
+stderr 691
+stdout 692
+stderr 692
+stdout 693
+stderr 693
+stdout 694
+stderr 694
+stdout 695
+stderr 695
+stdout 696
+stderr 696
+stdout 697
+stderr 697
+stdout 698
+stderr 698
+stdout 699
+stderr 699
+stdout 700
+stderr 700
+stdout 701
+stderr 701
+stdout 702
+stderr 702
+stdout 703
+stderr 703
+stdout 704
+stderr 704
+stdout 705
+stderr 705
+stdout 706
+stderr 706
+stdout 707
+stderr 707
+stdout 708
+stderr 708
+stdout 709
+stderr 709
+stdout 710
+stderr 710
+stdout 711
+stderr 711
+stdout 712
+stderr 712
+stdout 713
+stderr 713
+stdout 714
+stderr 714
+stdout 715
+stderr 715
+stdout 716
+stderr 716
+stdout 717
+stderr 717
+stdout 718
+stderr 718
+stdout 719
+stderr 719
+stdout 720
+stderr 720
+stdout 721
+stderr 721
+stdout 722
+stderr 722
+stdout 723
+stderr 723
+stdout 724
+stderr 724
+stdout 725
+stderr 725
+stdout 726
+stderr 726
+stdout 727
+stderr 727
+stdout 728
+stderr 728
+stdout 729
+stderr 729
+stdout 730
+stderr 730
+stdout 731
+stderr 731
+stdout 732
+stderr 732
+stdout 733
+stderr 733
+stdout 734
+stderr 734
+stdout 735
+stderr 735
+stdout 736
+stderr 736
+stdout 737
+stderr 737
+stdout 738
+stderr 738
+stdout 739
+stderr 739
+stdout 740
+stderr 740
+stdout 741
+stderr 741
+stdout 742
+stderr 742
+stdout 743
+stderr 743
+stdout 744
+stderr 744
+stdout 745
+stderr 745
+stdout 746
+stderr 746
+stdout 747
+stderr 747
+stdout 748
+stderr 748
+stdout 749
+stderr 749
+stdout 750
+stderr 750
+stdout 751
+stderr 751
+stdout 752
+stderr 752
+stdout 753
+stderr 753
+stdout 754
+stderr 754
+stdout 755
+stderr 755
+stdout 756
+stderr 756
+stdout 757
+stderr 757
+stdout 758
+stderr 758
+stdout 759
+stderr 759
+stdout 760
+stderr 760
+stdout 761
+stderr 761
+stdout 762
+stderr 762
+stdout 763
+stderr 763
+stdout 764
+stderr 764
+stdout 765
+stderr 765
+stdout 766
+stderr 766
+stdout 767
+stderr 767
+stdout 768
+stderr 768
+stdout 769
+stderr 769
+stdout 770
+stderr 770
+stdout 771
+stderr 771
+stdout 772
+stderr 772
+stdout 773
+stderr 773
+stdout 774
+stderr 774
+stdout 775
+stderr 775
+stdout 776
+stderr 776
+stdout 777
+stderr 777
+stdout 778
+stderr 778
+stdout 779
+stderr 779
+stdout 780
+stderr 780
+stdout 781
+stderr 781
+stdout 782
+stderr 782
+stdout 783
+stderr 783
+stdout 784
+stderr 784
+stdout 785
+stderr 785
+stdout 786
+stderr 786
+stdout 787
+stderr 787
+stdout 788
+stderr 788
+stdout 789
+stderr 789
+stdout 790
+stderr 790
+stdout 791
+stderr 791
+stdout 792
+stderr 792
+stdout 793
+stderr 793
+stdout 794
+stderr 794
+stdout 795
+stderr 795
+stdout 796
+stderr 796
+stdout 797
+stderr 797
+stdout 798
+stderr 798
+stdout 799
+stderr 799
+stdout 800
+stderr 800
+stdout 801
+stderr 801
+stdout 802
+stderr 802
+stdout 803
+stderr 803
+stdout 804
+stderr 804
+stdout 805
+stderr 805
+stdout 806
+stderr 806
+stdout 807
+stderr 807
+stdout 808
+stderr 808
+stdout 809
+stderr 809
+stdout 810
+stderr 810
+stdout 811
+stderr 811
+stdout 812
+stderr 812
+stdout 813
+stderr 813
+stdout 814
+stderr 814
+stdout 815
+stderr 815
+stdout 816
+stderr 816
+stdout 817
+stderr 817
+stdout 818
+stderr 818
+stdout 819
+stderr 819
+stdout 820
+stderr 820
+stdout 821
+stderr 821
+stdout 822
+stderr 822
+stdout 823
+stderr 823
+stdout 824
+stderr 824
+stdout 825
+stderr 825
+stdout 826
+stderr 826
+stdout 827
+stderr 827
+stdout 828
+stderr 828
+stdout 829
+stderr 829
+stdout 830
+stderr 830
+stdout 831
+stderr 831
+stdout 832
+stderr 832
+stdout 833
+stderr 833
+stdout 834
+stderr 834
+stdout 835
+stderr 835
+stdout 836
+stderr 836
+stdout 837
+stderr 837
+stdout 838
+stderr 838
+stdout 839
+stderr 839
+stdout 840
+stderr 840
+stdout 841
+stderr 841
+stdout 842
+stderr 842
+stdout 843
+stderr 843
+stdout 844
+stderr 844
+stdout 845
+stderr 845
+stdout 846
+stderr 846
+stdout 847
+stderr 847
+stdout 848
+stderr 848
+stdout 849
+stderr 849
+stdout 850
+stderr 850
+stdout 851
+stderr 851
+stdout 852
+stderr 852
+stdout 853
+stderr 853
+stdout 854
+stderr 854
+stdout 855
+stderr 855
+stdout 856
+stderr 856
+stdout 857
+stderr 857
+stdout 858
+stderr 858
+stdout 859
+stderr 859
+stdout 860
+stderr 860
+stdout 861
+stderr 861
+stdout 862
+stderr 862
+stdout 863
+stderr 863
+stdout 864
+stderr 864
+stdout 865
+stderr 865
+stdout 866
+stderr 866
+stdout 867
+stderr 867
+stdout 868
+stderr 868
+stdout 869
+stderr 869
+stdout 870
+stderr 870
+stdout 871
+stderr 871
+stdout 872
+stderr 872
+stdout 873
+stderr 873
+stdout 874
+stderr 874
+stdout 875
+stderr 875
+stdout 876
+stderr 876
+stdout 877
+stderr 877
+stdout 878
+stderr 878
+stdout 879
+stderr 879
+stdout 880
+stderr 880
+stdout 881
+stderr 881
+stdout 882
+stderr 882
+stdout 883
+stderr 883
+stdout 884
+stderr 884
+stdout 885
+stderr 885
+stdout 886
+stderr 886
+stdout 887
+stderr 887
+stdout 888
+stderr 888
+stdout 889
+stderr 889
+stdout 890
+stderr 890
+stdout 891
+stderr 891
+stdout 892
+stderr 892
+stdout 893
+stderr 893
+stdout 894
+stderr 894
+stdout 895
+stderr 895
+stdout 896
+stderr 896
+stdout 897
+stderr 897
+stdout 898
+stderr 898
+stdout 899
+stderr 899
+stdout 900
+stderr 900
+stdout 901
+stderr 901
+stdout 902
+stderr 902
+stdout 903
+stderr 903
+stdout 904
+stderr 904
+stdout 905
+stderr 905
+stdout 906
+stderr 906
+stdout 907
+stderr 907
+stdout 908
+stderr 908
+stdout 909
+stderr 909
+stdout 910
+stderr 910
+stdout 911
+stderr 911
+stdout 912
+stderr 912
+stdout 913
+stderr 913
+stdout 914
+stderr 914
+stdout 915
+stderr 915
+stdout 916
+stderr 916
+stdout 917
+stderr 917
+stdout 918
+stderr 918
+stdout 919
+stderr 919
+stdout 920
+stderr 920
+stdout 921
+stderr 921
+stdout 922
+stderr 922
+stdout 923
+stderr 923
+stdout 924
+stderr 924
+stdout 925
+stderr 925
+stdout 926
+stderr 926
+stdout 927
+stderr 927
+stdout 928
+stderr 928
+stdout 929
+stderr 929
+stdout 930
+stderr 930
+stdout 931
+stderr 931
+stdout 932
+stderr 932
+stdout 933
+stderr 933
+stdout 934
+stderr 934
+stdout 935
+stderr 935
+stdout 936
+stderr 936
+stdout 937
+stderr 937
+stdout 938
+stderr 938
+stdout 939
+stderr 939
+stdout 940
+stderr 940
+stdout 941
+stderr 941
+stdout 942
+stderr 942
+stdout 943
+stderr 943
+stdout 944
+stderr 944
+stdout 945
+stderr 945
+stdout 946
+stderr 946
+stdout 947
+stderr 947
+stdout 948
+stderr 948
+stdout 949
+stderr 949
+stdout 950
+stderr 950
+stdout 951
+stderr 951
+stdout 952
+stderr 952
+stdout 953
+stderr 953
+stdout 954
+stderr 954
+stdout 955
+stderr 955
+stdout 956
+stderr 956
+stdout 957
+stderr 957
+stdout 958
+stderr 958
+stdout 959
+stderr 959
+stdout 960
+stderr 960
+stdout 961
+stderr 961
+stdout 962
+stderr 962
+stdout 963
+stderr 963
+stdout 964
+stderr 964
+stdout 965
+stderr 965
+stdout 966
+stderr 966
+stdout 967
+stderr 967
+stdout 968
+stderr 968
+stdout 969
+stderr 969
+stdout 970
+stderr 970
+stdout 971
+stderr 971
+stdout 972
+stderr 972
+stdout 973
+stderr 973
+stdout 974
+stderr 974
+stdout 975
+stderr 975
+stdout 976
+stderr 976
+stdout 977
+stderr 977
+stdout 978
+stderr 978
+stdout 979
+stderr 979
+stdout 980
+stderr 980
+stdout 981
+stderr 981
+stdout 982
+stderr 982
+stdout 983
+stderr 983
+stdout 984
+stderr 984
+stdout 985
+stderr 985
+stdout 986
+stderr 986
+stdout 987
+stderr 987
+stdout 988
+stderr 988
+stdout 989
+stderr 989
+stdout 990
+stderr 990
+stdout 991
+stderr 991
+stdout 992
+stderr 992
+stdout 993
+stderr 993
+stdout 994
+stderr 994
+stdout 995
+stderr 995
+stdout 996
+stderr 996
+stdout 997
+stderr 997
+stdout 998
+stderr 998
+stdout 999
+stderr 999
diff --git a/node_modules/grunt/node_modules/exit/test/fixtures/1000-stdout.txt b/node_modules/grunt/node_modules/exit/test/fixtures/1000-stdout.txt
new file mode 100644
index 0000000..d3649d0
--- /dev/null
+++ b/node_modules/grunt/node_modules/exit/test/fixtures/1000-stdout.txt
@@ -0,0 +1,1000 @@
+stdout 0
+stdout 1
+stdout 2
+stdout 3
+stdout 4
+stdout 5
+stdout 6
+stdout 7
+stdout 8
+stdout 9
+stdout 10
+stdout 11
+stdout 12
+stdout 13
+stdout 14
+stdout 15
+stdout 16
+stdout 17
+stdout 18
+stdout 19
+stdout 20
+stdout 21
+stdout 22
+stdout 23
+stdout 24
+stdout 25
+stdout 26
+stdout 27
+stdout 28
+stdout 29
+stdout 30
+stdout 31
+stdout 32
+stdout 33
+stdout 34
+stdout 35
+stdout 36
+stdout 37
+stdout 38
+stdout 39
+stdout 40
+stdout 41
+stdout 42
+stdout 43
+stdout 44
+stdout 45
+stdout 46
+stdout 47
+stdout 48
+stdout 49
+stdout 50
+stdout 51
+stdout 52
+stdout 53
+stdout 54
+stdout 55
+stdout 56
+stdout 57
+stdout 58
+stdout 59
+stdout 60
+stdout 61
+stdout 62
+stdout 63
+stdout 64
+stdout 65
+stdout 66
+stdout 67
+stdout 68
+stdout 69
+stdout 70
+stdout 71
+stdout 72
+stdout 73
+stdout 74
+stdout 75
+stdout 76
+stdout 77
+stdout 78
+stdout 79
+stdout 80
+stdout 81
+stdout 82
+stdout 83
+stdout 84
+stdout 85
+stdout 86
+stdout 87
+stdout 88
+stdout 89
+stdout 90
+stdout 91
+stdout 92
+stdout 93
+stdout 94
+stdout 95
+stdout 96
+stdout 97
+stdout 98
+stdout 99
+stdout 100
+stdout 101
+stdout 102
+stdout 103
+stdout 104
+stdout 105
+stdout 106
+stdout 107
+stdout 108
+stdout 109
+stdout 110
+stdout 111
+stdout 112
+stdout 113
+stdout 114
+stdout 115
+stdout 116
+stdout 117
+stdout 118
+stdout 119
+stdout 120
+stdout 121
+stdout 122
+stdout 123
+stdout 124
+stdout 125
+stdout 126
+stdout 127
+stdout 128
+stdout 129
+stdout 130
+stdout 131
+stdout 132
+stdout 133
+stdout 134
+stdout 135
+stdout 136
+stdout 137
+stdout 138
+stdout 139
+stdout 140
+stdout 141
+stdout 142
+stdout 143
+stdout 144
+stdout 145
+stdout 146
+stdout 147
+stdout 148
+stdout 149
+stdout 150
+stdout 151
+stdout 152
+stdout 153
+stdout 154
+stdout 155
+stdout 156
+stdout 157
+stdout 158
+stdout 159
+stdout 160
+stdout 161
+stdout 162
+stdout 163
+stdout 164
+stdout 165
+stdout 166
+stdout 167
+stdout 168
+stdout 169
+stdout 170
+stdout 171
+stdout 172
+stdout 173
+stdout 174
+stdout 175
+stdout 176
+stdout 177
+stdout 178
+stdout 179
+stdout 180
+stdout 181
+stdout 182
+stdout 183
+stdout 184
+stdout 185
+stdout 186
+stdout 187
+stdout 188
+stdout 189
+stdout 190
+stdout 191
+stdout 192
+stdout 193
+stdout 194
+stdout 195
+stdout 196
+stdout 197
+stdout 198
+stdout 199
+stdout 200
+stdout 201
+stdout 202
+stdout 203
+stdout 204
+stdout 205
+stdout 206
+stdout 207
+stdout 208
+stdout 209
+stdout 210
+stdout 211
+stdout 212
+stdout 213
+stdout 214
+stdout 215
+stdout 216
+stdout 217
+stdout 218
+stdout 219
+stdout 220
+stdout 221
+stdout 222
+stdout 223
+stdout 224
+stdout 225
+stdout 226
+stdout 227
+stdout 228
+stdout 229
+stdout 230
+stdout 231
+stdout 232
+stdout 233
+stdout 234
+stdout 235
+stdout 236
+stdout 237
+stdout 238
+stdout 239
+stdout 240
+stdout 241
+stdout 242
+stdout 243
+stdout 244
+stdout 245
+stdout 246
+stdout 247
+stdout 248
+stdout 249
+stdout 250
+stdout 251
+stdout 252
+stdout 253
+stdout 254
+stdout 255
+stdout 256
+stdout 257
+stdout 258
+stdout 259
+stdout 260
+stdout 261
+stdout 262
+stdout 263
+stdout 264
+stdout 265
+stdout 266
+stdout 267
+stdout 268
+stdout 269
+stdout 270
+stdout 271
+stdout 272
+stdout 273
+stdout 274
+stdout 275
+stdout 276
+stdout 277
+stdout 278
+stdout 279
+stdout 280
+stdout 281
+stdout 282
+stdout 283
+stdout 284
+stdout 285
+stdout 286
+stdout 287
+stdout 288
+stdout 289
+stdout 290
+stdout 291
+stdout 292
+stdout 293
+stdout 294
+stdout 295
+stdout 296
+stdout 297
+stdout 298
+stdout 299
+stdout 300
+stdout 301
+stdout 302
+stdout 303
+stdout 304
+stdout 305
+stdout 306
+stdout 307
+stdout 308
+stdout 309
+stdout 310
+stdout 311
+stdout 312
+stdout 313
+stdout 314
+stdout 315
+stdout 316
+stdout 317
+stdout 318
+stdout 319
+stdout 320
+stdout 321
+stdout 322
+stdout 323
+stdout 324
+stdout 325
+stdout 326
+stdout 327
+stdout 328
+stdout 329
+stdout 330
+stdout 331
+stdout 332
+stdout 333
+stdout 334
+stdout 335
+stdout 336
+stdout 337
+stdout 338
+stdout 339
+stdout 340
+stdout 341
+stdout 342
+stdout 343
+stdout 344
+stdout 345
+stdout 346
+stdout 347
+stdout 348
+stdout 349
+stdout 350
+stdout 351
+stdout 352
+stdout 353
+stdout 354
+stdout 355
+stdout 356
+stdout 357
+stdout 358
+stdout 359
+stdout 360
+stdout 361
+stdout 362
+stdout 363
+stdout 364
+stdout 365
+stdout 366
+stdout 367
+stdout 368
+stdout 369
+stdout 370
+stdout 371
+stdout 372
+stdout 373
+stdout 374
+stdout 375
+stdout 376
+stdout 377
+stdout 378
+stdout 379
+stdout 380
+stdout 381
+stdout 382
+stdout 383
+stdout 384
+stdout 385
+stdout 386
+stdout 387
+stdout 388
+stdout 389
+stdout 390
+stdout 391
+stdout 392
+stdout 393
+stdout 394
+stdout 395
+stdout 396
+stdout 397
+stdout 398
+stdout 399
+stdout 400
+stdout 401
+stdout 402
+stdout 403
+stdout 404
+stdout 405
+stdout 406
+stdout 407
+stdout 408
+stdout 409
+stdout 410
+stdout 411
+stdout 412
+stdout 413
+stdout 414
+stdout 415
+stdout 416
+stdout 417
+stdout 418
+stdout 419
+stdout 420
+stdout 421
+stdout 422
+stdout 423
+stdout 424
+stdout 425
+stdout 426
+stdout 427
+stdout 428
+stdout 429
+stdout 430
+stdout 431
+stdout 432
+stdout 433
+stdout 434
+stdout 435
+stdout 436
+stdout 437
+stdout 438
+stdout 439
+stdout 440
+stdout 441
+stdout 442
+stdout 443
+stdout 444
+stdout 445
+stdout 446
+stdout 447
+stdout 448
+stdout 449
+stdout 450
+stdout 451
+stdout 452
+stdout 453
+stdout 454
+stdout 455
+stdout 456
+stdout 457
+stdout 458
+stdout 459
+stdout 460
+stdout 461
+stdout 462
+stdout 463
+stdout 464
+stdout 465
+stdout 466
+stdout 467
+stdout 468
+stdout 469
+stdout 470
+stdout 471
+stdout 472
+stdout 473
+stdout 474
+stdout 475
+stdout 476
+stdout 477
+stdout 478
+stdout 479
+stdout 480
+stdout 481
+stdout 482
+stdout 483
+stdout 484
+stdout 485
+stdout 486
+stdout 487
+stdout 488
+stdout 489
+stdout 490
+stdout 491
+stdout 492
+stdout 493
+stdout 494
+stdout 495
+stdout 496
+stdout 497
+stdout 498
+stdout 499
+stdout 500
+stdout 501
+stdout 502
+stdout 503
+stdout 504
+stdout 505
+stdout 506
+stdout 507
+stdout 508
+stdout 509
+stdout 510
+stdout 511
+stdout 512
+stdout 513
+stdout 514
+stdout 515
+stdout 516
+stdout 517
+stdout 518
+stdout 519
+stdout 520
+stdout 521
+stdout 522
+stdout 523
+stdout 524
+stdout 525
+stdout 526
+stdout 527
+stdout 528
+stdout 529
+stdout 530
+stdout 531
+stdout 532
+stdout 533
+stdout 534
+stdout 535
+stdout 536
+stdout 537
+stdout 538
+stdout 539
+stdout 540
+stdout 541
+stdout 542
+stdout 543
+stdout 544
+stdout 545
+stdout 546
+stdout 547
+stdout 548
+stdout 549
+stdout 550
+stdout 551
+stdout 552
+stdout 553
+stdout 554
+stdout 555
+stdout 556
+stdout 557
+stdout 558
+stdout 559
+stdout 560
+stdout 561
+stdout 562
+stdout 563
+stdout 564
+stdout 565
+stdout 566
+stdout 567
+stdout 568
+stdout 569
+stdout 570
+stdout 571
+stdout 572
+stdout 573
+stdout 574
+stdout 575
+stdout 576
+stdout 577
+stdout 578
+stdout 579
+stdout 580
+stdout 581
+stdout 582
+stdout 583
+stdout 584
+stdout 585
+stdout 586
+stdout 587
+stdout 588
+stdout 589
+stdout 590
+stdout 591
+stdout 592
+stdout 593
+stdout 594
+stdout 595
+stdout 596
+stdout 597
+stdout 598
+stdout 599
+stdout 600
+stdout 601
+stdout 602
+stdout 603
+stdout 604
+stdout 605
+stdout 606
+stdout 607
+stdout 608
+stdout 609
+stdout 610
+stdout 611
+stdout 612
+stdout 613
+stdout 614
+stdout 615
+stdout 616
+stdout 617
+stdout 618
+stdout 619
+stdout 620
+stdout 621
+stdout 622
+stdout 623
+stdout 624
+stdout 625
+stdout 626
+stdout 627
+stdout 628
+stdout 629
+stdout 630
+stdout 631
+stdout 632
+stdout 633
+stdout 634
+stdout 635
+stdout 636
+stdout 637
+stdout 638
+stdout 639
+stdout 640
+stdout 641
+stdout 642
+stdout 643
+stdout 644
+stdout 645
+stdout 646
+stdout 647
+stdout 648
+stdout 649
+stdout 650
+stdout 651
+stdout 652
+stdout 653
+stdout 654
+stdout 655
+stdout 656
+stdout 657
+stdout 658
+stdout 659
+stdout 660
+stdout 661
+stdout 662
+stdout 663
+stdout 664
+stdout 665
+stdout 666
+stdout 667
+stdout 668
+stdout 669
+stdout 670
+stdout 671
+stdout 672
+stdout 673
+stdout 674
+stdout 675
+stdout 676
+stdout 677
+stdout 678
+stdout 679
+stdout 680
+stdout 681
+stdout 682
+stdout 683
+stdout 684
+stdout 685
+stdout 686
+stdout 687
+stdout 688
+stdout 689
+stdout 690
+stdout 691
+stdout 692
+stdout 693
+stdout 694
+stdout 695
+stdout 696
+stdout 697
+stdout 698
+stdout 699
+stdout 700
+stdout 701
+stdout 702
+stdout 703
+stdout 704
+stdout 705
+stdout 706
+stdout 707
+stdout 708
+stdout 709
+stdout 710
+stdout 711
+stdout 712
+stdout 713
+stdout 714
+stdout 715
+stdout 716
+stdout 717
+stdout 718
+stdout 719
+stdout 720
+stdout 721
+stdout 722
+stdout 723
+stdout 724
+stdout 725
+stdout 726
+stdout 727
+stdout 728
+stdout 729
+stdout 730
+stdout 731
+stdout 732
+stdout 733
+stdout 734
+stdout 735
+stdout 736
+stdout 737
+stdout 738
+stdout 739
+stdout 740
+stdout 741
+stdout 742
+stdout 743
+stdout 744
+stdout 745
+stdout 746
+stdout 747
+stdout 748
+stdout 749
+stdout 750
+stdout 751
+stdout 752
+stdout 753
+stdout 754
+stdout 755
+stdout 756
+stdout 757
+stdout 758
+stdout 759
+stdout 760
+stdout 761
+stdout 762
+stdout 763
+stdout 764
+stdout 765
+stdout 766
+stdout 767
+stdout 768
+stdout 769
+stdout 770
+stdout 771
+stdout 772
+stdout 773
+stdout 774
+stdout 775
+stdout 776
+stdout 777
+stdout 778
+stdout 779
+stdout 780
+stdout 781
+stdout 782
+stdout 783
+stdout 784
+stdout 785
+stdout 786
+stdout 787
+stdout 788
+stdout 789
+stdout 790
+stdout 791
+stdout 792
+stdout 793
+stdout 794
+stdout 795
+stdout 796
+stdout 797
+stdout 798
+stdout 799
+stdout 800
+stdout 801
+stdout 802
+stdout 803
+stdout 804
+stdout 805
+stdout 806
+stdout 807
+stdout 808
+stdout 809
+stdout 810
+stdout 811
+stdout 812
+stdout 813
+stdout 814
+stdout 815
+stdout 816
+stdout 817
+stdout 818
+stdout 819
+stdout 820
+stdout 821
+stdout 822
+stdout 823
+stdout 824
+stdout 825
+stdout 826
+stdout 827
+stdout 828
+stdout 829
+stdout 830
+stdout 831
+stdout 832
+stdout 833
+stdout 834
+stdout 835
+stdout 836
+stdout 837
+stdout 838
+stdout 839
+stdout 840
+stdout 841
+stdout 842
+stdout 843
+stdout 844
+stdout 845
+stdout 846
+stdout 847
+stdout 848
+stdout 849
+stdout 850
+stdout 851
+stdout 852
+stdout 853
+stdout 854
+stdout 855
+stdout 856
+stdout 857
+stdout 858
+stdout 859
+stdout 860
+stdout 861
+stdout 862
+stdout 863
+stdout 864
+stdout 865
+stdout 866
+stdout 867
+stdout 868
+stdout 869
+stdout 870
+stdout 871
+stdout 872
+stdout 873
+stdout 874
+stdout 875
+stdout 876
+stdout 877
+stdout 878
+stdout 879
+stdout 880
+stdout 881
+stdout 882
+stdout 883
+stdout 884
+stdout 885
+stdout 886
+stdout 887
+stdout 888
+stdout 889
+stdout 890
+stdout 891
+stdout 892
+stdout 893
+stdout 894
+stdout 895
+stdout 896
+stdout 897
+stdout 898
+stdout 899
+stdout 900
+stdout 901
+stdout 902
+stdout 903
+stdout 904
+stdout 905
+stdout 906
+stdout 907
+stdout 908
+stdout 909
+stdout 910
+stdout 911
+stdout 912
+stdout 913
+stdout 914
+stdout 915
+stdout 916
+stdout 917
+stdout 918
+stdout 919
+stdout 920
+stdout 921
+stdout 922
+stdout 923
+stdout 924
+stdout 925
+stdout 926
+stdout 927
+stdout 928
+stdout 929
+stdout 930
+stdout 931
+stdout 932
+stdout 933
+stdout 934
+stdout 935
+stdout 936
+stdout 937
+stdout 938
+stdout 939
+stdout 940
+stdout 941
+stdout 942
+stdout 943
+stdout 944
+stdout 945
+stdout 946
+stdout 947
+stdout 948
+stdout 949
+stdout 950
+stdout 951
+stdout 952
+stdout 953
+stdout 954
+stdout 955
+stdout 956
+stdout 957
+stdout 958
+stdout 959
+stdout 960
+stdout 961
+stdout 962
+stdout 963
+stdout 964
+stdout 965
+stdout 966
+stdout 967
+stdout 968
+stdout 969
+stdout 970
+stdout 971
+stdout 972
+stdout 973
+stdout 974
+stdout 975
+stdout 976
+stdout 977
+stdout 978
+stdout 979
+stdout 980
+stdout 981
+stdout 982
+stdout 983
+stdout 984
+stdout 985
+stdout 986
+stdout 987
+stdout 988
+stdout 989
+stdout 990
+stdout 991
+stdout 992
+stdout 993
+stdout 994
+stdout 995
+stdout 996
+stdout 997
+stdout 998
+stdout 999
diff --git a/node_modules/grunt/node_modules/exit/test/fixtures/create-files.sh b/node_modules/grunt/node_modules/exit/test/fixtures/create-files.sh
new file mode 100644
index 0000000..6a526de
--- /dev/null
+++ b/node_modules/grunt/node_modules/exit/test/fixtures/create-files.sh
@@ -0,0 +1,8 @@
+#!/usr/bin/env bash
+
+rm 10*.txt
+for n in 10 100 1000; do
+ node log.js 0 $n stdout stderr &> $n-stdout-stderr.txt
+ node log.js 0 $n stdout &> $n-stdout.txt
+ node log.js 0 $n stderr &> $n-stderr.txt
+done
diff --git a/node_modules/grunt/node_modules/exit/test/fixtures/log-broken.js b/node_modules/grunt/node_modules/exit/test/fixtures/log-broken.js
new file mode 100644
index 0000000..74c8f12
--- /dev/null
+++ b/node_modules/grunt/node_modules/exit/test/fixtures/log-broken.js
@@ -0,0 +1,23 @@
+var errorCode = process.argv[2];
+var max = process.argv[3];
+var modes = process.argv.slice(4);
+
+function stdout(message) {
+ if (modes.indexOf('stdout') === -1) { return; }
+ process.stdout.write('stdout ' + message + '\n');
+}
+
+function stderr(message) {
+ if (modes.indexOf('stderr') === -1) { return; }
+ process.stderr.write('stderr ' + message + '\n');
+}
+
+for (var i = 0; i < max; i++) {
+ stdout(i);
+ stderr(i);
+}
+
+process.exit(errorCode);
+
+stdout('fail');
+stderr('fail');
diff --git a/node_modules/grunt/node_modules/exit/test/fixtures/log.js b/node_modules/grunt/node_modules/exit/test/fixtures/log.js
new file mode 100644
index 0000000..8a9ed9a
--- /dev/null
+++ b/node_modules/grunt/node_modules/exit/test/fixtures/log.js
@@ -0,0 +1,25 @@
+var exit = require('../../lib/exit');
+
+var errorCode = process.argv[2];
+var max = process.argv[3];
+var modes = process.argv.slice(4);
+
+function stdout(message) {
+ if (modes.indexOf('stdout') === -1) { return; }
+ process.stdout.write('stdout ' + message + '\n');
+}
+
+function stderr(message) {
+ if (modes.indexOf('stderr') === -1) { return; }
+ process.stderr.write('stderr ' + message + '\n');
+}
+
+for (var i = 0; i < max; i++) {
+ stdout(i);
+ stderr(i);
+}
+
+exit(errorCode);
+
+stdout('fail');
+stderr('fail');
diff --git a/node_modules/grunt/node_modules/findup-sync/.jshintrc b/node_modules/grunt/node_modules/findup-sync/.jshintrc
new file mode 100644
index 0000000..8718952
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/.jshintrc
@@ -0,0 +1,15 @@
+{
+ "loopfunc": true,
+ "curly": true,
+ "eqeqeq": true,
+ "immed": true,
+ "latedef": true,
+ "newcap": true,
+ "noarg": true,
+ "sub": true,
+ "undef": true,
+ "unused": true,
+ "boss": true,
+ "eqnull": true,
+ "node": true
+}
diff --git a/node_modules/grunt/node_modules/findup-sync/.npmignore b/node_modules/grunt/node_modules/findup-sync/.npmignore
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/grunt/node_modules/findup-sync/.travis.yml b/node_modules/grunt/node_modules/findup-sync/.travis.yml
new file mode 100644
index 0000000..b30fcb7
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/.travis.yml
@@ -0,0 +1,5 @@
+language: node_js
+node_js:
+ - 0.8
+before_script:
+ - npm install -g grunt-cli
diff --git a/node_modules/grunt/node_modules/findup-sync/Gruntfile.js b/node_modules/grunt/node_modules/findup-sync/Gruntfile.js
new file mode 100644
index 0000000..2f964a5
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/Gruntfile.js
@@ -0,0 +1,25 @@
+'use strict';
+
+module.exports = function(grunt) {
+
+ // Project configuration.
+ grunt.initConfig({
+ nodeunit: {
+ files: ['test/**/*_test.js'],
+ },
+ jshint: {
+ options: {
+ jshintrc: '.jshintrc'
+ },
+ all: ['Gruntfile.js', 'lib/**/*.js', 'test/**/*.js']
+ }
+ });
+
+ // Load plugins.
+ grunt.loadNpmTasks('grunt-contrib-jshint');
+ grunt.loadNpmTasks('grunt-contrib-nodeunit');
+
+ // Default task.
+ grunt.registerTask('default', ['jshint', 'nodeunit']);
+
+};
diff --git a/node_modules/grunt/node_modules/findup-sync/LICENSE-MIT b/node_modules/grunt/node_modules/findup-sync/LICENSE-MIT
new file mode 100644
index 0000000..bb2aad6
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/LICENSE-MIT
@@ -0,0 +1,22 @@
+Copyright (c) 2013 "Cowboy" Ben Alman
+
+Permission is hereby granted, free of charge, to any person
+obtaining a copy of this software and associated documentation
+files (the "Software"), to deal in the Software without
+restriction, including without limitation the rights to use,
+copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the
+Software is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/grunt/node_modules/findup-sync/README.md b/node_modules/grunt/node_modules/findup-sync/README.md
new file mode 100644
index 0000000..5459b93
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/README.md
@@ -0,0 +1,45 @@
+# findup-sync [](http://travis-ci.org/cowboy/node-findup-sync)
+
+Find the first file matching a given pattern in the current directory or the nearest ancestor directory.
+
+## Getting Started
+Install the module with: `npm install findup-sync`
+
+```js
+var findup = require('findup-sync');
+
+// Start looking in the CWD.
+var filepath1 = findup('{a,b}*.txt');
+
+// Start looking somewhere else, and ignore case (probably a good idea).
+var filepath2 = findup('{a,b}*.txt', {cwd: '/some/path', nocase: true});
+```
+
+## Usage
+
+```js
+findup(patternOrPatterns [, minimatchOptions])
+```
+
+### patternOrPatterns
+Type: `String` or `Array`
+Default: none
+
+One or more wildcard glob patterns. Or just filenames.
+
+### minimatchOptions
+Type: `Object`
+Default: `{}`
+
+Options to be passed to [minimatch](https://github.com/isaacs/minimatch).
+
+Note that if you want to start in a different directory than the current working directory, specify a `cwd` property here.
+
+## Contributing
+In lieu of a formal styleguide, take care to maintain the existing coding style. Add unit tests for any new or changed functionality. Lint and test your code using [Grunt](http://gruntjs.com/).
+
+## Release History
+2014-03-14 - v0.1.3 - Updated dependencies.
+2013-03-08 - v0.1.2 - Updated dependencies. Fixed a Node 0.9.x bug. Updated unit tests to work cross-platform.
+2012-11-15 - v0.1.1 - Now works without an options object.
+2012-11-01 - v0.1.0 - Initial release.
diff --git a/node_modules/grunt/node_modules/findup-sync/lib/findup-sync.js b/node_modules/grunt/node_modules/findup-sync/lib/findup-sync.js
new file mode 100644
index 0000000..742a478
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/lib/findup-sync.js
@@ -0,0 +1,46 @@
+/*
+ * findup-sync
+ * https://github.com/cowboy/node-findup-sync
+ *
+ * Copyright (c) 2013 "Cowboy" Ben Alman
+ * Licensed under the MIT license.
+ */
+
+'use strict';
+
+// Nodejs libs.
+var path = require('path');
+
+// External libs.
+var glob = require('glob');
+var _ = require('lodash');
+
+// Search for a filename in the given directory or all parent directories.
+module.exports = function(patterns, options) {
+ // Normalize patterns to an array.
+ if (!Array.isArray(patterns)) { patterns = [patterns]; }
+ // Create globOptions so that it can be modified without mutating the
+ // original object.
+ var globOptions = Object.create(options || {});
+ globOptions.maxDepth = 1;
+ globOptions.cwd = path.resolve(globOptions.cwd || '.');
+
+ var files, lastpath;
+ do {
+ // Search for files matching patterns.
+ files = _(patterns).map(function(pattern) {
+ return glob.sync(pattern, globOptions);
+ }).flatten().uniq().value();
+ // Return file if found.
+ if (files.length > 0) {
+ return path.resolve(path.join(globOptions.cwd, files[0]));
+ }
+ // Go up a directory.
+ lastpath = globOptions.cwd;
+ globOptions.cwd = path.resolve(globOptions.cwd, '..');
+ // If parentpath is the same as basedir, we can't go any higher.
+ } while (globOptions.cwd !== lastpath);
+
+ // No files were found!
+ return null;
+};
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/.npmignore b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/.npmignore
new file mode 100644
index 0000000..2af4b71
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/.npmignore
@@ -0,0 +1,2 @@
+.*.swp
+test/a/
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/.travis.yml b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/.travis.yml
new file mode 100644
index 0000000..baa0031
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/.travis.yml
@@ -0,0 +1,3 @@
+language: node_js
+node_js:
+ - 0.8
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/LICENSE b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/LICENSE
new file mode 100644
index 0000000..0c44ae7
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/LICENSE
@@ -0,0 +1,27 @@
+Copyright (c) Isaac Z. Schlueter ("Author")
+All rights reserved.
+
+The BSD License
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+
+1. Redistributions of source code must retain the above copyright
+ notice, this list of conditions and the following disclaimer.
+
+2. Redistributions in binary form must reproduce the above copyright
+ notice, this list of conditions and the following disclaimer in the
+ documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS
+BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
+BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
+OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
+IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/README.md b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/README.md
new file mode 100644
index 0000000..cc69164
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/README.md
@@ -0,0 +1,250 @@
+# Glob
+
+Match files using the patterns the shell uses, like stars and stuff.
+
+This is a glob implementation in JavaScript. It uses the `minimatch`
+library to do its matching.
+
+## Attention: node-glob users!
+
+The API has changed dramatically between 2.x and 3.x. This library is
+now 100% JavaScript, and the integer flags have been replaced with an
+options object.
+
+Also, there's an event emitter class, proper tests, and all the other
+things you've come to expect from node modules.
+
+And best of all, no compilation!
+
+## Usage
+
+```javascript
+var glob = require("glob")
+
+// options is optional
+glob("**/*.js", options, function (er, files) {
+ // files is an array of filenames.
+ // If the `nonull` option is set, and nothing
+ // was found, then files is ["**/*.js"]
+ // er is an error object or null.
+})
+```
+
+## Features
+
+Please see the [minimatch
+documentation](https://github.com/isaacs/minimatch) for more details.
+
+Supports these glob features:
+
+* Brace Expansion
+* Extended glob matching
+* "Globstar" `**` matching
+
+See:
+
+* `man sh`
+* `man bash`
+* `man 3 fnmatch`
+* `man 5 gitignore`
+* [minimatch documentation](https://github.com/isaacs/minimatch)
+
+## glob(pattern, [options], cb)
+
+* `pattern` {String} Pattern to be matched
+* `options` {Object}
+* `cb` {Function}
+ * `err` {Error | null}
+ * `matches` {Array} filenames found matching the pattern
+
+Perform an asynchronous glob search.
+
+## glob.sync(pattern, [options])
+
+* `pattern` {String} Pattern to be matched
+* `options` {Object}
+* return: {Array} filenames found matching the pattern
+
+Perform a synchronous glob search.
+
+## Class: glob.Glob
+
+Create a Glob object by instanting the `glob.Glob` class.
+
+```javascript
+var Glob = require("glob").Glob
+var mg = new Glob(pattern, options, cb)
+```
+
+It's an EventEmitter, and starts walking the filesystem to find matches
+immediately.
+
+### new glob.Glob(pattern, [options], [cb])
+
+* `pattern` {String} pattern to search for
+* `options` {Object}
+* `cb` {Function} Called when an error occurs, or matches are found
+ * `err` {Error | null}
+ * `matches` {Array} filenames found matching the pattern
+
+Note that if the `sync` flag is set in the options, then matches will
+be immediately available on the `g.found` member.
+
+### Properties
+
+* `minimatch` The minimatch object that the glob uses.
+* `options` The options object passed in.
+* `error` The error encountered. When an error is encountered, the
+ glob object is in an undefined state, and should be discarded.
+* `aborted` Boolean which is set to true when calling `abort()`. There
+ is no way at this time to continue a glob search after aborting, but
+ you can re-use the statCache to avoid having to duplicate syscalls.
+* `statCache` Collection of all the stat results the glob search
+ performed.
+* `cache` Convenience object. Each field has the following possible
+ values:
+ * `false` - Path does not exist
+ * `true` - Path exists
+ * `1` - Path exists, and is not a directory
+ * `2` - Path exists, and is a directory
+ * `[file, entries, ...]` - Path exists, is a directory, and the
+ array value is the results of `fs.readdir`
+
+### Events
+
+* `end` When the matching is finished, this is emitted with all the
+ matches found. If the `nonull` option is set, and no match was found,
+ then the `matches` list contains the original pattern. The matches
+ are sorted, unless the `nosort` flag is set.
+* `match` Every time a match is found, this is emitted with the matched.
+* `error` Emitted when an unexpected error is encountered, or whenever
+ any fs error occurs if `options.strict` is set.
+* `abort` When `abort()` is called, this event is raised.
+
+### Methods
+
+* `abort` Stop the search.
+
+### Options
+
+All the options that can be passed to Minimatch can also be passed to
+Glob to change pattern matching behavior. Also, some have been added,
+or have glob-specific ramifications.
+
+All options are false by default, unless otherwise noted.
+
+All options are added to the glob object, as well.
+
+* `cwd` The current working directory in which to search. Defaults
+ to `process.cwd()`.
+* `root` The place where patterns starting with `/` will be mounted
+ onto. Defaults to `path.resolve(options.cwd, "/")` (`/` on Unix
+ systems, and `C:\` or some such on Windows.)
+* `dot` Include `.dot` files in normal matches and `globstar` matches.
+ Note that an explicit dot in a portion of the pattern will always
+ match dot files.
+* `nomount` By default, a pattern starting with a forward-slash will be
+ "mounted" onto the root setting, so that a valid filesystem path is
+ returned. Set this flag to disable that behavior.
+* `mark` Add a `/` character to directory matches. Note that this
+ requires additional stat calls.
+* `nosort` Don't sort the results.
+* `stat` Set to true to stat *all* results. This reduces performance
+ somewhat, and is completely unnecessary, unless `readdir` is presumed
+ to be an untrustworthy indicator of file existence. It will cause
+ ELOOP to be triggered one level sooner in the case of cyclical
+ symbolic links.
+* `silent` When an unusual error is encountered
+ when attempting to read a directory, a warning will be printed to
+ stderr. Set the `silent` option to true to suppress these warnings.
+* `strict` When an unusual error is encountered
+ when attempting to read a directory, the process will just continue on
+ in search of other matches. Set the `strict` option to raise an error
+ in these cases.
+* `cache` See `cache` property above. Pass in a previously generated
+ cache object to save some fs calls.
+* `statCache` A cache of results of filesystem information, to prevent
+ unnecessary stat calls. While it should not normally be necessary to
+ set this, you may pass the statCache from one glob() call to the
+ options object of another, if you know that the filesystem will not
+ change between calls. (See "Race Conditions" below.)
+* `sync` Perform a synchronous glob search.
+* `nounique` In some cases, brace-expanded patterns can result in the
+ same file showing up multiple times in the result set. By default,
+ this implementation prevents duplicates in the result set.
+ Set this flag to disable that behavior.
+* `nonull` Set to never return an empty set, instead returning a set
+ containing the pattern itself. This is the default in glob(3).
+* `nocase` Perform a case-insensitive match. Note that case-insensitive
+ filesystems will sometimes result in glob returning results that are
+ case-insensitively matched anyway, since readdir and stat will not
+ raise an error.
+* `debug` Set to enable debug logging in minimatch and glob.
+* `globDebug` Set to enable debug logging in glob, but not minimatch.
+
+## Comparisons to other fnmatch/glob implementations
+
+While strict compliance with the existing standards is a worthwhile
+goal, some discrepancies exist between node-glob and other
+implementations, and are intentional.
+
+If the pattern starts with a `!` character, then it is negated. Set the
+`nonegate` flag to suppress this behavior, and treat leading `!`
+characters normally. This is perhaps relevant if you wish to start the
+pattern with a negative extglob pattern like `!(a|B)`. Multiple `!`
+characters at the start of a pattern will negate the pattern multiple
+times.
+
+If a pattern starts with `#`, then it is treated as a comment, and
+will not match anything. Use `\#` to match a literal `#` at the
+start of a line, or set the `nocomment` flag to suppress this behavior.
+
+The double-star character `**` is supported by default, unless the
+`noglobstar` flag is set. This is supported in the manner of bsdglob
+and bash 4.1, where `**` only has special significance if it is the only
+thing in a path part. That is, `a/**/b` will match `a/x/y/b`, but
+`a/**b` will not.
+
+If an escaped pattern has no matches, and the `nonull` flag is set,
+then glob returns the pattern as-provided, rather than
+interpreting the character escapes. For example,
+`glob.match([], "\\*a\\?")` will return `"\\*a\\?"` rather than
+`"*a?"`. This is akin to setting the `nullglob` option in bash, except
+that it does not resolve escaped pattern characters.
+
+If brace expansion is not disabled, then it is performed before any
+other interpretation of the glob pattern. Thus, a pattern like
+`+(a|{b),c)}`, which would not be valid in bash or zsh, is expanded
+**first** into the set of `+(a|b)` and `+(a|c)`, and those patterns are
+checked for validity. Since those two are valid, matching proceeds.
+
+## Windows
+
+**Please only use forward-slashes in glob expressions.**
+
+Though windows uses either `/` or `\` as its path separator, only `/`
+characters are used by this glob implementation. You must use
+forward-slashes **only** in glob expressions. Back-slashes will always
+be interpreted as escape characters, not path separators.
+
+Results from absolute patterns such as `/foo/*` are mounted onto the
+root setting using `path.join`. On windows, this will by default result
+in `/foo/*` matching `C:\foo\bar.txt`.
+
+## Race Conditions
+
+Glob searching, by its very nature, is susceptible to race conditions,
+since it relies on directory walking and such.
+
+As a result, it is possible that a file that exists when glob looks for
+it may have been deleted or modified by the time it returns the result.
+
+As part of its internal implementation, this program caches all stat
+and readdir calls that it makes, in order to cut down on system
+overhead. However, this also makes it even more susceptible to races,
+especially if the cache or statCache objects are reused between glob
+calls.
+
+Users are thus advised not to use a glob result as a guarantee of
+filesystem state in the face of rapid changes. For the vast majority
+of operations, this is never a problem.
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/examples/g.js b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/examples/g.js
new file mode 100644
index 0000000..be122df
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/examples/g.js
@@ -0,0 +1,9 @@
+var Glob = require("../").Glob
+
+var pattern = "test/a/**/[cg]/../[cg]"
+console.log(pattern)
+
+var mg = new Glob(pattern, {mark: true, sync:true}, function (er, matches) {
+ console.log("matches", matches)
+})
+console.log("after")
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/examples/usr-local.js b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/examples/usr-local.js
new file mode 100644
index 0000000..327a425
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/examples/usr-local.js
@@ -0,0 +1,9 @@
+var Glob = require("../").Glob
+
+var pattern = "{./*/*,/*,/usr/local/*}"
+console.log(pattern)
+
+var mg = new Glob(pattern, {mark: true}, function (er, matches) {
+ console.log("matches", matches)
+})
+console.log("after")
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/glob.js b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/glob.js
new file mode 100644
index 0000000..f646c44
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/glob.js
@@ -0,0 +1,728 @@
+// Approach:
+//
+// 1. Get the minimatch set
+// 2. For each pattern in the set, PROCESS(pattern)
+// 3. Store matches per-set, then uniq them
+//
+// PROCESS(pattern)
+// Get the first [n] items from pattern that are all strings
+// Join these together. This is PREFIX.
+// If there is no more remaining, then stat(PREFIX) and
+// add to matches if it succeeds. END.
+// readdir(PREFIX) as ENTRIES
+// If fails, END
+// If pattern[n] is GLOBSTAR
+// // handle the case where the globstar match is empty
+// // by pruning it out, and testing the resulting pattern
+// PROCESS(pattern[0..n] + pattern[n+1 .. $])
+// // handle other cases.
+// for ENTRY in ENTRIES (not dotfiles)
+// // attach globstar + tail onto the entry
+// PROCESS(pattern[0..n] + ENTRY + pattern[n .. $])
+//
+// else // not globstar
+// for ENTRY in ENTRIES (not dotfiles, unless pattern[n] is dot)
+// Test ENTRY against pattern[n]
+// If fails, continue
+// If passes, PROCESS(pattern[0..n] + item + pattern[n+1 .. $])
+//
+// Caveat:
+// Cache all stats and readdirs results to minimize syscall. Since all
+// we ever care about is existence and directory-ness, we can just keep
+// `true` for files, and [children,...] for directories, or `false` for
+// things that don't exist.
+
+
+
+module.exports = glob
+
+var fs = require("fs")
+, minimatch = require("minimatch")
+, Minimatch = minimatch.Minimatch
+, inherits = require("inherits")
+, EE = require("events").EventEmitter
+, path = require("path")
+, isDir = {}
+, assert = require("assert").ok
+
+function glob (pattern, options, cb) {
+ if (typeof options === "function") cb = options, options = {}
+ if (!options) options = {}
+
+ if (typeof options === "number") {
+ deprecated()
+ return
+ }
+
+ var g = new Glob(pattern, options, cb)
+ return g.sync ? g.found : g
+}
+
+glob.fnmatch = deprecated
+
+function deprecated () {
+ throw new Error("glob's interface has changed. Please see the docs.")
+}
+
+glob.sync = globSync
+function globSync (pattern, options) {
+ if (typeof options === "number") {
+ deprecated()
+ return
+ }
+
+ options = options || {}
+ options.sync = true
+ return glob(pattern, options)
+}
+
+this._processingEmitQueue = false
+
+glob.Glob = Glob
+inherits(Glob, EE)
+function Glob (pattern, options, cb) {
+ if (!(this instanceof Glob)) {
+ return new Glob(pattern, options, cb)
+ }
+
+ if (typeof options === "function") {
+ cb = options
+ options = null
+ }
+
+ if (typeof cb === "function") {
+ this.on("error", cb)
+ this.on("end", function (matches) {
+ cb(null, matches)
+ })
+ }
+
+ options = options || {}
+
+ this._endEmitted = false
+ this.EOF = {}
+ this._emitQueue = []
+
+ this.paused = false
+ this._processingEmitQueue = false
+
+ this.maxDepth = options.maxDepth || 1000
+ this.maxLength = options.maxLength || Infinity
+ this.cache = options.cache || {}
+ this.statCache = options.statCache || {}
+
+ this.changedCwd = false
+ var cwd = process.cwd()
+ if (!options.hasOwnProperty("cwd")) this.cwd = cwd
+ else {
+ this.cwd = options.cwd
+ this.changedCwd = path.resolve(options.cwd) !== cwd
+ }
+
+ this.root = options.root || path.resolve(this.cwd, "/")
+ this.root = path.resolve(this.root)
+ if (process.platform === "win32")
+ this.root = this.root.replace(/\\/g, "/")
+
+ this.nomount = !!options.nomount
+
+ if (!pattern) {
+ throw new Error("must provide pattern")
+ }
+
+ // base-matching: just use globstar for that.
+ if (options.matchBase && -1 === pattern.indexOf("/")) {
+ if (options.noglobstar) {
+ throw new Error("base matching requires globstar")
+ }
+ pattern = "**/" + pattern
+ }
+
+ this.strict = options.strict !== false
+ this.dot = !!options.dot
+ this.mark = !!options.mark
+ this.sync = !!options.sync
+ this.nounique = !!options.nounique
+ this.nonull = !!options.nonull
+ this.nosort = !!options.nosort
+ this.nocase = !!options.nocase
+ this.stat = !!options.stat
+
+ this.debug = !!options.debug || !!options.globDebug
+ if (this.debug)
+ this.log = console.error
+
+ this.silent = !!options.silent
+
+ var mm = this.minimatch = new Minimatch(pattern, options)
+ this.options = mm.options
+ pattern = this.pattern = mm.pattern
+
+ this.error = null
+ this.aborted = false
+
+ // list of all the patterns that ** has resolved do, so
+ // we can avoid visiting multiple times.
+ this._globstars = {}
+
+ EE.call(this)
+
+ // process each pattern in the minimatch set
+ var n = this.minimatch.set.length
+
+ // The matches are stored as {: true,...} so that
+ // duplicates are automagically pruned.
+ // Later, we do an Object.keys() on these.
+ // Keep them as a list so we can fill in when nonull is set.
+ this.matches = new Array(n)
+
+ this.minimatch.set.forEach(iterator.bind(this))
+ function iterator (pattern, i, set) {
+ this._process(pattern, 0, i, function (er) {
+ if (er) this.emit("error", er)
+ if (-- n <= 0) this._finish()
+ })
+ }
+}
+
+Glob.prototype.log = function () {}
+
+Glob.prototype._finish = function () {
+ assert(this instanceof Glob)
+
+ var nou = this.nounique
+ , all = nou ? [] : {}
+
+ for (var i = 0, l = this.matches.length; i < l; i ++) {
+ var matches = this.matches[i]
+ this.log("matches[%d] =", i, matches)
+ // do like the shell, and spit out the literal glob
+ if (!matches) {
+ if (this.nonull) {
+ var literal = this.minimatch.globSet[i]
+ if (nou) all.push(literal)
+ else all[literal] = true
+ }
+ } else {
+ // had matches
+ var m = Object.keys(matches)
+ if (nou) all.push.apply(all, m)
+ else m.forEach(function (m) {
+ all[m] = true
+ })
+ }
+ }
+
+ if (!nou) all = Object.keys(all)
+
+ if (!this.nosort) {
+ all = all.sort(this.nocase ? alphasorti : alphasort)
+ }
+
+ if (this.mark) {
+ // at *some* point we statted all of these
+ all = all.map(this._mark, this)
+ }
+
+ this.log("emitting end", all)
+
+ this.EOF = this.found = all
+ this.emitMatch(this.EOF)
+}
+
+function alphasorti (a, b) {
+ a = a.toLowerCase()
+ b = b.toLowerCase()
+ return alphasort(a, b)
+}
+
+function alphasort (a, b) {
+ return a > b ? 1 : a < b ? -1 : 0
+}
+
+Glob.prototype._mark = function (p) {
+ var c = this.cache[p]
+ var m = p
+ if (c) {
+ var isDir = c === 2 || Array.isArray(c)
+ var slash = p.slice(-1) === '/'
+
+ if (isDir && !slash)
+ m += '/'
+ else if (!isDir && slash)
+ m = m.slice(0, -1)
+
+ if (m !== p) {
+ this.statCache[m] = this.statCache[p]
+ this.cache[m] = this.cache[p]
+ }
+ }
+
+ return m
+}
+
+Glob.prototype.abort = function () {
+ this.aborted = true
+ this.emit("abort")
+}
+
+Glob.prototype.pause = function () {
+ if (this.paused) return
+ if (this.sync)
+ this.emit("error", new Error("Can't pause/resume sync glob"))
+ this.paused = true
+ this.emit("pause")
+}
+
+Glob.prototype.resume = function () {
+ if (!this.paused) return
+ if (this.sync)
+ this.emit("error", new Error("Can't pause/resume sync glob"))
+ this.paused = false
+ this.emit("resume")
+ this._processEmitQueue()
+ //process.nextTick(this.emit.bind(this, "resume"))
+}
+
+Glob.prototype.emitMatch = function (m) {
+ this.log('emitMatch', m)
+ this._emitQueue.push(m)
+ this._processEmitQueue()
+}
+
+Glob.prototype._processEmitQueue = function (m) {
+ this.log("pEQ paused=%j processing=%j m=%j", this.paused,
+ this._processingEmitQueue, m)
+ var done = false
+ while (!this._processingEmitQueue &&
+ !this.paused) {
+ this._processingEmitQueue = true
+ var m = this._emitQueue.shift()
+ this.log(">processEmitQueue", m === this.EOF ? ":EOF:" : m)
+ if (!m) {
+ this.log(">processEmitQueue, falsey m")
+ this._processingEmitQueue = false
+ break
+ }
+
+ if (m === this.EOF || !(this.mark && !this.stat)) {
+ this.log("peq: unmarked, or eof")
+ next.call(this, 0, false)
+ } else if (this.statCache[m]) {
+ var sc = this.statCache[m]
+ var exists
+ if (sc)
+ exists = sc.isDirectory() ? 2 : 1
+ this.log("peq: stat cached")
+ next.call(this, exists, exists === 2)
+ } else {
+ this.log("peq: _stat, then next")
+ this._stat(m, next)
+ }
+
+ function next(exists, isDir) {
+ this.log("next", m, exists, isDir)
+ var ev = m === this.EOF ? "end" : "match"
+
+ // "end" can only happen once.
+ assert(!this._endEmitted)
+ if (ev === "end")
+ this._endEmitted = true
+
+ if (exists) {
+ // Doesn't mean it necessarily doesn't exist, it's possible
+ // we just didn't check because we don't care that much, or
+ // this is EOF anyway.
+ if (isDir && !m.match(/\/$/)) {
+ m = m + "/"
+ } else if (!isDir && m.match(/\/$/)) {
+ m = m.replace(/\/+$/, "")
+ }
+ }
+ this.log("emit", ev, m)
+ this.emit(ev, m)
+ this._processingEmitQueue = false
+ if (done && m !== this.EOF && !this.paused)
+ this._processEmitQueue()
+ }
+ }
+ done = true
+}
+
+Glob.prototype._process = function (pattern, depth, index, cb_) {
+ assert(this instanceof Glob)
+
+ var cb = function cb (er, res) {
+ assert(this instanceof Glob)
+ if (this.paused) {
+ if (!this._processQueue) {
+ this._processQueue = []
+ this.once("resume", function () {
+ var q = this._processQueue
+ this._processQueue = null
+ q.forEach(function (cb) { cb() })
+ })
+ }
+ this._processQueue.push(cb_.bind(this, er, res))
+ } else {
+ cb_.call(this, er, res)
+ }
+ }.bind(this)
+
+ if (this.aborted) return cb()
+
+ if (depth > this.maxDepth) return cb()
+
+ // Get the first [n] parts of pattern that are all strings.
+ var n = 0
+ while (typeof pattern[n] === "string") {
+ n ++
+ }
+ // now n is the index of the first one that is *not* a string.
+
+ // see if there's anything else
+ var prefix
+ switch (n) {
+ // if not, then this is rather simple
+ case pattern.length:
+ prefix = pattern.join("/")
+ this._stat(prefix, function (exists, isDir) {
+ // either it's there, or it isn't.
+ // nothing more to do, either way.
+ if (exists) {
+ if (prefix && isAbsolute(prefix) && !this.nomount) {
+ if (prefix.charAt(0) === "/") {
+ prefix = path.join(this.root, prefix)
+ } else {
+ prefix = path.resolve(this.root, prefix)
+ }
+ }
+
+ if (process.platform === "win32")
+ prefix = prefix.replace(/\\/g, "/")
+
+ this.matches[index] = this.matches[index] || {}
+ this.matches[index][prefix] = true
+ this.emitMatch(prefix)
+ }
+ return cb()
+ })
+ return
+
+ case 0:
+ // pattern *starts* with some non-trivial item.
+ // going to readdir(cwd), but not include the prefix in matches.
+ prefix = null
+ break
+
+ default:
+ // pattern has some string bits in the front.
+ // whatever it starts with, whether that's "absolute" like /foo/bar,
+ // or "relative" like "../baz"
+ prefix = pattern.slice(0, n)
+ prefix = prefix.join("/")
+ break
+ }
+
+ // get the list of entries.
+ var read
+ if (prefix === null) read = "."
+ else if (isAbsolute(prefix) || isAbsolute(pattern.join("/"))) {
+ if (!prefix || !isAbsolute(prefix)) {
+ prefix = path.join("/", prefix)
+ }
+ read = prefix = path.resolve(prefix)
+
+ // if (process.platform === "win32")
+ // read = prefix = prefix.replace(/^[a-zA-Z]:|\\/g, "/")
+
+ this.log('absolute: ', prefix, this.root, pattern, read)
+ } else {
+ read = prefix
+ }
+
+ this.log('readdir(%j)', read, this.cwd, this.root)
+
+ return this._readdir(read, function (er, entries) {
+ if (er) {
+ // not a directory!
+ // this means that, whatever else comes after this, it can never match
+ return cb()
+ }
+
+ // globstar is special
+ if (pattern[n] === minimatch.GLOBSTAR) {
+ // test without the globstar, and with every child both below
+ // and replacing the globstar.
+ var s = [ pattern.slice(0, n).concat(pattern.slice(n + 1)) ]
+ entries.forEach(function (e) {
+ if (e.charAt(0) === "." && !this.dot) return
+ // instead of the globstar
+ s.push(pattern.slice(0, n).concat(e).concat(pattern.slice(n + 1)))
+ // below the globstar
+ s.push(pattern.slice(0, n).concat(e).concat(pattern.slice(n)))
+ }, this)
+
+ s = s.filter(function (pattern) {
+ var key = gsKey(pattern)
+ var seen = !this._globstars[key]
+ this._globstars[key] = true
+ return seen
+ }, this)
+
+ if (!s.length)
+ return cb()
+
+ // now asyncForEach over this
+ var l = s.length
+ , errState = null
+ s.forEach(function (gsPattern) {
+ this._process(gsPattern, depth + 1, index, function (er) {
+ if (errState) return
+ if (er) return cb(errState = er)
+ if (--l <= 0) return cb()
+ })
+ }, this)
+
+ return
+ }
+
+ // not a globstar
+ // It will only match dot entries if it starts with a dot, or if
+ // dot is set. Stuff like @(.foo|.bar) isn't allowed.
+ var pn = pattern[n]
+ var rawGlob = pattern[n]._glob
+ , dotOk = this.dot || rawGlob.charAt(0) === "."
+
+ entries = entries.filter(function (e) {
+ return (e.charAt(0) !== "." || dotOk) &&
+ e.match(pattern[n])
+ })
+
+ // If n === pattern.length - 1, then there's no need for the extra stat
+ // *unless* the user has specified "mark" or "stat" explicitly.
+ // We know that they exist, since the readdir returned them.
+ if (n === pattern.length - 1 &&
+ !this.mark &&
+ !this.stat) {
+ entries.forEach(function (e) {
+ if (prefix) {
+ if (prefix !== "/") e = prefix + "/" + e
+ else e = prefix + e
+ }
+ if (e.charAt(0) === "/" && !this.nomount) {
+ e = path.join(this.root, e)
+ }
+
+ if (process.platform === "win32")
+ e = e.replace(/\\/g, "/")
+
+ this.matches[index] = this.matches[index] || {}
+ this.matches[index][e] = true
+ this.emitMatch(e)
+ }, this)
+ return cb.call(this)
+ }
+
+
+ // now test all the remaining entries as stand-ins for that part
+ // of the pattern.
+ var l = entries.length
+ , errState = null
+ if (l === 0) return cb() // no matches possible
+ entries.forEach(function (e) {
+ var p = pattern.slice(0, n).concat(e).concat(pattern.slice(n + 1))
+ this._process(p, depth + 1, index, function (er) {
+ if (errState) return
+ if (er) return cb(errState = er)
+ if (--l === 0) return cb.call(this)
+ })
+ }, this)
+ })
+
+}
+
+function gsKey (pattern) {
+ return '**' + pattern.map(function (p) {
+ return (p === minimatch.GLOBSTAR) ? '**' : (''+p)
+ }).join('/')
+}
+
+Glob.prototype._stat = function (f, cb) {
+ assert(this instanceof Glob)
+ var abs = f
+ if (f.charAt(0) === "/") {
+ abs = path.join(this.root, f)
+ } else if (this.changedCwd) {
+ abs = path.resolve(this.cwd, f)
+ }
+
+ if (f.length > this.maxLength) {
+ var er = new Error("Path name too long")
+ er.code = "ENAMETOOLONG"
+ er.path = f
+ return this._afterStat(f, abs, cb, er)
+ }
+
+ this.log('stat', [this.cwd, f, '=', abs])
+
+ if (!this.stat && this.cache.hasOwnProperty(f)) {
+ var exists = this.cache[f]
+ , isDir = exists && (Array.isArray(exists) || exists === 2)
+ if (this.sync) return cb.call(this, !!exists, isDir)
+ return process.nextTick(cb.bind(this, !!exists, isDir))
+ }
+
+ var stat = this.statCache[abs]
+ if (this.sync || stat) {
+ var er
+ try {
+ stat = fs.statSync(abs)
+ } catch (e) {
+ er = e
+ }
+ this._afterStat(f, abs, cb, er, stat)
+ } else {
+ fs.stat(abs, this._afterStat.bind(this, f, abs, cb))
+ }
+}
+
+Glob.prototype._afterStat = function (f, abs, cb, er, stat) {
+ var exists
+ assert(this instanceof Glob)
+
+ if (abs.slice(-1) === "/" && stat && !stat.isDirectory()) {
+ this.log("should be ENOTDIR, fake it")
+
+ er = new Error("ENOTDIR, not a directory '" + abs + "'")
+ er.path = abs
+ er.code = "ENOTDIR"
+ stat = null
+ }
+
+ var emit = !this.statCache[abs]
+ this.statCache[abs] = stat
+
+ if (er || !stat) {
+ exists = false
+ } else {
+ exists = stat.isDirectory() ? 2 : 1
+ if (emit)
+ this.emit('stat', f, stat)
+ }
+ this.cache[f] = this.cache[f] || exists
+ cb.call(this, !!exists, exists === 2)
+}
+
+Glob.prototype._readdir = function (f, cb) {
+ assert(this instanceof Glob)
+ var abs = f
+ if (f.charAt(0) === "/") {
+ abs = path.join(this.root, f)
+ } else if (isAbsolute(f)) {
+ abs = f
+ } else if (this.changedCwd) {
+ abs = path.resolve(this.cwd, f)
+ }
+
+ if (f.length > this.maxLength) {
+ var er = new Error("Path name too long")
+ er.code = "ENAMETOOLONG"
+ er.path = f
+ return this._afterReaddir(f, abs, cb, er)
+ }
+
+ this.log('readdir', [this.cwd, f, abs])
+ if (this.cache.hasOwnProperty(f)) {
+ var c = this.cache[f]
+ if (Array.isArray(c)) {
+ if (this.sync) return cb.call(this, null, c)
+ return process.nextTick(cb.bind(this, null, c))
+ }
+
+ if (!c || c === 1) {
+ // either ENOENT or ENOTDIR
+ var code = c ? "ENOTDIR" : "ENOENT"
+ , er = new Error((c ? "Not a directory" : "Not found") + ": " + f)
+ er.path = f
+ er.code = code
+ this.log(f, er)
+ if (this.sync) return cb.call(this, er)
+ return process.nextTick(cb.bind(this, er))
+ }
+
+ // at this point, c === 2, meaning it's a dir, but we haven't
+ // had to read it yet, or c === true, meaning it's *something*
+ // but we don't have any idea what. Need to read it, either way.
+ }
+
+ if (this.sync) {
+ var er, entries
+ try {
+ entries = fs.readdirSync(abs)
+ } catch (e) {
+ er = e
+ }
+ return this._afterReaddir(f, abs, cb, er, entries)
+ }
+
+ fs.readdir(abs, this._afterReaddir.bind(this, f, abs, cb))
+}
+
+Glob.prototype._afterReaddir = function (f, abs, cb, er, entries) {
+ assert(this instanceof Glob)
+ if (entries && !er) {
+ this.cache[f] = entries
+ // if we haven't asked to stat everything for suresies, then just
+ // assume that everything in there exists, so we can avoid
+ // having to stat it a second time. This also gets us one step
+ // further into ELOOP territory.
+ if (!this.mark && !this.stat) {
+ entries.forEach(function (e) {
+ if (f === "/") e = f + e
+ else e = f + "/" + e
+ this.cache[e] = true
+ }, this)
+ }
+
+ return cb.call(this, er, entries)
+ }
+
+ // now handle errors, and cache the information
+ if (er) switch (er.code) {
+ case "ENOTDIR": // totally normal. means it *does* exist.
+ this.cache[f] = 1
+ return cb.call(this, er)
+ case "ENOENT": // not terribly unusual
+ case "ELOOP":
+ case "ENAMETOOLONG":
+ case "UNKNOWN":
+ this.cache[f] = false
+ return cb.call(this, er)
+ default: // some unusual error. Treat as failure.
+ this.cache[f] = false
+ if (this.strict) this.emit("error", er)
+ if (!this.silent) console.error("glob error", er)
+ return cb.call(this, er)
+ }
+}
+
+var isAbsolute = process.platform === "win32" ? absWin : absUnix
+
+function absWin (p) {
+ if (absUnix(p)) return true
+ // pull off the device/UNC bit from a windows path.
+ // from node's lib/path.js
+ var splitDeviceRe =
+ /^([a-zA-Z]:|[\\\/]{2}[^\\\/]+[\\\/]+[^\\\/]+)?([\\\/])?([\s\S]*?)$/
+ , result = splitDeviceRe.exec(p)
+ , device = result[1] || ''
+ , isUnc = device && device.charAt(1) !== ':'
+ , isAbsolute = !!result[2] || isUnc // UNC paths are always absolute
+
+ return isAbsolute
+}
+
+function absUnix (p) {
+ return p.charAt(0) === "/" || p === ""
+}
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/inherits/LICENSE b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/inherits/LICENSE
new file mode 100644
index 0000000..dea3013
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/inherits/LICENSE
@@ -0,0 +1,16 @@
+The ISC License
+
+Copyright (c) Isaac Z. Schlueter
+
+Permission to use, copy, modify, and/or distribute this software for any
+purpose with or without fee is hereby granted, provided that the above
+copyright notice and this permission notice appear in all copies.
+
+THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
+REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
+FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
+INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
+LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
+OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
+PERFORMANCE OF THIS SOFTWARE.
+
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/inherits/README.md b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/inherits/README.md
new file mode 100644
index 0000000..b1c5665
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/inherits/README.md
@@ -0,0 +1,42 @@
+Browser-friendly inheritance fully compatible with standard node.js
+[inherits](http://nodejs.org/api/util.html#util_util_inherits_constructor_superconstructor).
+
+This package exports standard `inherits` from node.js `util` module in
+node environment, but also provides alternative browser-friendly
+implementation through [browser
+field](https://gist.github.com/shtylman/4339901). Alternative
+implementation is a literal copy of standard one located in standalone
+module to avoid requiring of `util`. It also has a shim for old
+browsers with no `Object.create` support.
+
+While keeping you sure you are using standard `inherits`
+implementation in node.js environment, it allows bundlers such as
+[browserify](https://github.com/substack/node-browserify) to not
+include full `util` package to your client code if all you need is
+just `inherits` function. It worth, because browser shim for `util`
+package is large and `inherits` is often the single function you need
+from it.
+
+It's recommended to use this package instead of
+`require('util').inherits` for any code that has chances to be used
+not only in node.js but in browser too.
+
+## usage
+
+```js
+var inherits = require('inherits');
+// then use exactly as the standard one
+```
+
+## note on version ~1.0
+
+Version ~1.0 had completely different motivation and is not compatible
+neither with 2.0 nor with standard node.js `inherits`.
+
+If you are using version ~1.0 and planning to switch to ~2.0, be
+careful:
+
+* new version uses `super_` instead of `super` for referencing
+ superclass
+* new version overwrites current prototype while old one preserves any
+ existing fields on it
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/inherits/inherits.js b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/inherits/inherits.js
new file mode 100644
index 0000000..29f5e24
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/inherits/inherits.js
@@ -0,0 +1 @@
+module.exports = require('util').inherits
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/inherits/inherits_browser.js b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/inherits/inherits_browser.js
new file mode 100644
index 0000000..c1e78a7
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/inherits/inherits_browser.js
@@ -0,0 +1,23 @@
+if (typeof Object.create === 'function') {
+ // implementation from standard node.js 'util' module
+ module.exports = function inherits(ctor, superCtor) {
+ ctor.super_ = superCtor
+ ctor.prototype = Object.create(superCtor.prototype, {
+ constructor: {
+ value: ctor,
+ enumerable: false,
+ writable: true,
+ configurable: true
+ }
+ });
+ };
+} else {
+ // old school shim for old browsers
+ module.exports = function inherits(ctor, superCtor) {
+ ctor.super_ = superCtor
+ var TempCtor = function () {}
+ TempCtor.prototype = superCtor.prototype
+ ctor.prototype = new TempCtor()
+ ctor.prototype.constructor = ctor
+ }
+}
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/inherits/package.json b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/inherits/package.json
new file mode 100644
index 0000000..235833b
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/inherits/package.json
@@ -0,0 +1,51 @@
+{
+ "name": "inherits",
+ "description": "Browser-friendly inheritance fully compatible with standard node.js inherits()",
+ "version": "2.0.1",
+ "keywords": [
+ "inheritance",
+ "class",
+ "klass",
+ "oop",
+ "object-oriented",
+ "inherits",
+ "browser",
+ "browserify"
+ ],
+ "main": "./inherits.js",
+ "browser": "./inherits_browser.js",
+ "repository": {
+ "type": "git",
+ "url": "git://github.com/isaacs/inherits"
+ },
+ "license": "ISC",
+ "scripts": {
+ "test": "node test"
+ },
+ "readme": "Browser-friendly inheritance fully compatible with standard node.js\n[inherits](http://nodejs.org/api/util.html#util_util_inherits_constructor_superconstructor).\n\nThis package exports standard `inherits` from node.js `util` module in\nnode environment, but also provides alternative browser-friendly\nimplementation through [browser\nfield](https://gist.github.com/shtylman/4339901). Alternative\nimplementation is a literal copy of standard one located in standalone\nmodule to avoid requiring of `util`. It also has a shim for old\nbrowsers with no `Object.create` support.\n\nWhile keeping you sure you are using standard `inherits`\nimplementation in node.js environment, it allows bundlers such as\n[browserify](https://github.com/substack/node-browserify) to not\ninclude full `util` package to your client code if all you need is\njust `inherits` function. It worth, because browser shim for `util`\npackage is large and `inherits` is often the single function you need\nfrom it.\n\nIt's recommended to use this package instead of\n`require('util').inherits` for any code that has chances to be used\nnot only in node.js but in browser too.\n\n## usage\n\n```js\nvar inherits = require('inherits');\n// then use exactly as the standard one\n```\n\n## note on version ~1.0\n\nVersion ~1.0 had completely different motivation and is not compatible\nneither with 2.0 nor with standard node.js `inherits`.\n\nIf you are using version ~1.0 and planning to switch to ~2.0, be\ncareful:\n\n* new version uses `super_` instead of `super` for referencing\n superclass\n* new version overwrites current prototype while old one preserves any\n existing fields on it\n",
+ "readmeFilename": "README.md",
+ "bugs": {
+ "url": "https://github.com/isaacs/inherits/issues"
+ },
+ "_id": "inherits@2.0.1",
+ "dist": {
+ "shasum": "b17d08d326b4423e568eff719f91b0b1cbdf69f1",
+ "tarball": "http://registry.npmjs.org/inherits/-/inherits-2.0.1.tgz"
+ },
+ "_from": "inherits@>=2.0.0 <3.0.0",
+ "_npmVersion": "1.3.8",
+ "_npmUser": {
+ "name": "isaacs",
+ "email": "i@izs.me"
+ },
+ "maintainers": [
+ {
+ "name": "isaacs",
+ "email": "i@izs.me"
+ }
+ ],
+ "directories": {},
+ "_shasum": "b17d08d326b4423e568eff719f91b0b1cbdf69f1",
+ "_resolved": "https://registry.npmjs.org/inherits/-/inherits-2.0.1.tgz",
+ "homepage": "https://github.com/isaacs/inherits"
+}
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/inherits/test.js b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/inherits/test.js
new file mode 100644
index 0000000..fc53012
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/inherits/test.js
@@ -0,0 +1,25 @@
+var inherits = require('./inherits.js')
+var assert = require('assert')
+
+function test(c) {
+ assert(c.constructor === Child)
+ assert(c.constructor.super_ === Parent)
+ assert(Object.getPrototypeOf(c) === Child.prototype)
+ assert(Object.getPrototypeOf(Object.getPrototypeOf(c)) === Parent.prototype)
+ assert(c instanceof Child)
+ assert(c instanceof Parent)
+}
+
+function Child() {
+ Parent.call(this)
+ test(this)
+}
+
+function Parent() {}
+
+inherits(Child, Parent)
+
+var c = new Child
+test(c)
+
+console.log('ok')
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/.npmignore b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/.npmignore
new file mode 100644
index 0000000..3c3629e
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/.npmignore
@@ -0,0 +1 @@
+node_modules
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/LICENSE b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/LICENSE
new file mode 100644
index 0000000..05a4010
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/LICENSE
@@ -0,0 +1,23 @@
+Copyright 2009, 2010, 2011 Isaac Z. Schlueter.
+All rights reserved.
+
+Permission is hereby granted, free of charge, to any person
+obtaining a copy of this software and associated documentation
+files (the "Software"), to deal in the Software without
+restriction, including without limitation the rights to use,
+copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the
+Software is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/README.md b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/README.md
new file mode 100644
index 0000000..5b3967e
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/README.md
@@ -0,0 +1,218 @@
+# minimatch
+
+A minimal matching utility.
+
+[](http://travis-ci.org/isaacs/minimatch)
+
+
+This is the matching library used internally by npm.
+
+Eventually, it will replace the C binding in node-glob.
+
+It works by converting glob expressions into JavaScript `RegExp`
+objects.
+
+## Usage
+
+```javascript
+var minimatch = require("minimatch")
+
+minimatch("bar.foo", "*.foo") // true!
+minimatch("bar.foo", "*.bar") // false!
+minimatch("bar.foo", "*.+(bar|foo)", { debug: true }) // true, and noisy!
+```
+
+## Features
+
+Supports these glob features:
+
+* Brace Expansion
+* Extended glob matching
+* "Globstar" `**` matching
+
+See:
+
+* `man sh`
+* `man bash`
+* `man 3 fnmatch`
+* `man 5 gitignore`
+
+## Minimatch Class
+
+Create a minimatch object by instanting the `minimatch.Minimatch` class.
+
+```javascript
+var Minimatch = require("minimatch").Minimatch
+var mm = new Minimatch(pattern, options)
+```
+
+### Properties
+
+* `pattern` The original pattern the minimatch object represents.
+* `options` The options supplied to the constructor.
+* `set` A 2-dimensional array of regexp or string expressions.
+ Each row in the
+ array corresponds to a brace-expanded pattern. Each item in the row
+ corresponds to a single path-part. For example, the pattern
+ `{a,b/c}/d` would expand to a set of patterns like:
+
+ [ [ a, d ]
+ , [ b, c, d ] ]
+
+ If a portion of the pattern doesn't have any "magic" in it
+ (that is, it's something like `"foo"` rather than `fo*o?`), then it
+ will be left as a string rather than converted to a regular
+ expression.
+
+* `regexp` Created by the `makeRe` method. A single regular expression
+ expressing the entire pattern. This is useful in cases where you wish
+ to use the pattern somewhat like `fnmatch(3)` with `FNM_PATH` enabled.
+* `negate` True if the pattern is negated.
+* `comment` True if the pattern is a comment.
+* `empty` True if the pattern is `""`.
+
+### Methods
+
+* `makeRe` Generate the `regexp` member if necessary, and return it.
+ Will return `false` if the pattern is invalid.
+* `match(fname)` Return true if the filename matches the pattern, or
+ false otherwise.
+* `matchOne(fileArray, patternArray, partial)` Take a `/`-split
+ filename, and match it against a single row in the `regExpSet`. This
+ method is mainly for internal use, but is exposed so that it can be
+ used by a glob-walker that needs to avoid excessive filesystem calls.
+
+All other methods are internal, and will be called as necessary.
+
+## Functions
+
+The top-level exported function has a `cache` property, which is an LRU
+cache set to store 100 items. So, calling these methods repeatedly
+with the same pattern and options will use the same Minimatch object,
+saving the cost of parsing it multiple times.
+
+### minimatch(path, pattern, options)
+
+Main export. Tests a path against the pattern using the options.
+
+```javascript
+var isJS = minimatch(file, "*.js", { matchBase: true })
+```
+
+### minimatch.filter(pattern, options)
+
+Returns a function that tests its
+supplied argument, suitable for use with `Array.filter`. Example:
+
+```javascript
+var javascripts = fileList.filter(minimatch.filter("*.js", {matchBase: true}))
+```
+
+### minimatch.match(list, pattern, options)
+
+Match against the list of
+files, in the style of fnmatch or glob. If nothing is matched, and
+options.nonull is set, then return a list containing the pattern itself.
+
+```javascript
+var javascripts = minimatch.match(fileList, "*.js", {matchBase: true}))
+```
+
+### minimatch.makeRe(pattern, options)
+
+Make a regular expression object from the pattern.
+
+## Options
+
+All options are `false` by default.
+
+### debug
+
+Dump a ton of stuff to stderr.
+
+### nobrace
+
+Do not expand `{a,b}` and `{1..3}` brace sets.
+
+### noglobstar
+
+Disable `**` matching against multiple folder names.
+
+### dot
+
+Allow patterns to match filenames starting with a period, even if
+the pattern does not explicitly have a period in that spot.
+
+Note that by default, `a/**/b` will **not** match `a/.d/b`, unless `dot`
+is set.
+
+### noext
+
+Disable "extglob" style patterns like `+(a|b)`.
+
+### nocase
+
+Perform a case-insensitive match.
+
+### nonull
+
+When a match is not found by `minimatch.match`, return a list containing
+the pattern itself if this option is set. When not set, an empty list
+is returned if there are no matches.
+
+### matchBase
+
+If set, then patterns without slashes will be matched
+against the basename of the path if it contains slashes. For example,
+`a?b` would match the path `/xyz/123/acb`, but not `/xyz/acb/123`.
+
+### nocomment
+
+Suppress the behavior of treating `#` at the start of a pattern as a
+comment.
+
+### nonegate
+
+Suppress the behavior of treating a leading `!` character as negation.
+
+### flipNegate
+
+Returns from negate expressions the same as if they were not negated.
+(Ie, true on a hit, false on a miss.)
+
+
+## Comparisons to other fnmatch/glob implementations
+
+While strict compliance with the existing standards is a worthwhile
+goal, some discrepancies exist between minimatch and other
+implementations, and are intentional.
+
+If the pattern starts with a `!` character, then it is negated. Set the
+`nonegate` flag to suppress this behavior, and treat leading `!`
+characters normally. This is perhaps relevant if you wish to start the
+pattern with a negative extglob pattern like `!(a|B)`. Multiple `!`
+characters at the start of a pattern will negate the pattern multiple
+times.
+
+If a pattern starts with `#`, then it is treated as a comment, and
+will not match anything. Use `\#` to match a literal `#` at the
+start of a line, or set the `nocomment` flag to suppress this behavior.
+
+The double-star character `**` is supported by default, unless the
+`noglobstar` flag is set. This is supported in the manner of bsdglob
+and bash 4.1, where `**` only has special significance if it is the only
+thing in a path part. That is, `a/**/b` will match `a/x/y/b`, but
+`a/**b` will not.
+
+If an escaped pattern has no matches, and the `nonull` flag is set,
+then minimatch.match returns the pattern as-provided, rather than
+interpreting the character escapes. For example,
+`minimatch.match([], "\\*a\\?")` will return `"\\*a\\?"` rather than
+`"*a?"`. This is akin to setting the `nullglob` option in bash, except
+that it does not resolve escaped pattern characters.
+
+If brace expansion is not disabled, then it is performed before any
+other interpretation of the glob pattern. Thus, a pattern like
+`+(a|{b),c)}`, which would not be valid in bash or zsh, is expanded
+**first** into the set of `+(a|b)` and `+(a|c)`, and those patterns are
+checked for validity. Since those two are valid, matching proceeds.
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/minimatch.js b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/minimatch.js
new file mode 100644
index 0000000..4539678
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/minimatch.js
@@ -0,0 +1,1061 @@
+;(function (require, exports, module, platform) {
+
+if (module) module.exports = minimatch
+else exports.minimatch = minimatch
+
+if (!require) {
+ require = function (id) {
+ switch (id) {
+ case "sigmund": return function sigmund (obj) {
+ return JSON.stringify(obj)
+ }
+ case "path": return { basename: function (f) {
+ f = f.split(/[\/\\]/)
+ var e = f.pop()
+ if (!e) e = f.pop()
+ return e
+ }}
+ case "lru-cache": return function LRUCache () {
+ // not quite an LRU, but still space-limited.
+ var cache = {}
+ var cnt = 0
+ this.set = function (k, v) {
+ cnt ++
+ if (cnt >= 100) cache = {}
+ cache[k] = v
+ }
+ this.get = function (k) { return cache[k] }
+ }
+ }
+ }
+}
+
+minimatch.Minimatch = Minimatch
+
+var LRU = require("lru-cache")
+ , cache = minimatch.cache = new LRU({max: 100})
+ , GLOBSTAR = minimatch.GLOBSTAR = Minimatch.GLOBSTAR = {}
+ , sigmund = require("sigmund")
+
+var path = require("path")
+ // any single thing other than /
+ // don't need to escape / when using new RegExp()
+ , qmark = "[^/]"
+
+ // * => any number of characters
+ , star = qmark + "*?"
+
+ // ** when dots are allowed. Anything goes, except .. and .
+ // not (^ or / followed by one or two dots followed by $ or /),
+ // followed by anything, any number of times.
+ , twoStarDot = "(?:(?!(?:\\\/|^)(?:\\.{1,2})($|\\\/)).)*?"
+
+ // not a ^ or / followed by a dot,
+ // followed by anything, any number of times.
+ , twoStarNoDot = "(?:(?!(?:\\\/|^)\\.).)*?"
+
+ // characters that need to be escaped in RegExp.
+ , reSpecials = charSet("().*{}+?[]^$\\!")
+
+// "abc" -> { a:true, b:true, c:true }
+function charSet (s) {
+ return s.split("").reduce(function (set, c) {
+ set[c] = true
+ return set
+ }, {})
+}
+
+// normalizes slashes.
+var slashSplit = /\/+/
+
+minimatch.filter = filter
+function filter (pattern, options) {
+ options = options || {}
+ return function (p, i, list) {
+ return minimatch(p, pattern, options)
+ }
+}
+
+function ext (a, b) {
+ a = a || {}
+ b = b || {}
+ var t = {}
+ Object.keys(b).forEach(function (k) {
+ t[k] = b[k]
+ })
+ Object.keys(a).forEach(function (k) {
+ t[k] = a[k]
+ })
+ return t
+}
+
+minimatch.defaults = function (def) {
+ if (!def || !Object.keys(def).length) return minimatch
+
+ var orig = minimatch
+
+ var m = function minimatch (p, pattern, options) {
+ return orig.minimatch(p, pattern, ext(def, options))
+ }
+
+ m.Minimatch = function Minimatch (pattern, options) {
+ return new orig.Minimatch(pattern, ext(def, options))
+ }
+
+ return m
+}
+
+Minimatch.defaults = function (def) {
+ if (!def || !Object.keys(def).length) return Minimatch
+ return minimatch.defaults(def).Minimatch
+}
+
+
+function minimatch (p, pattern, options) {
+ if (typeof pattern !== "string") {
+ throw new TypeError("glob pattern string required")
+ }
+
+ if (!options) options = {}
+
+ // shortcut: comments match nothing.
+ if (!options.nocomment && pattern.charAt(0) === "#") {
+ return false
+ }
+
+ // "" only matches ""
+ if (pattern.trim() === "") return p === ""
+
+ return new Minimatch(pattern, options).match(p)
+}
+
+function Minimatch (pattern, options) {
+ if (!(this instanceof Minimatch)) {
+ return new Minimatch(pattern, options, cache)
+ }
+
+ if (typeof pattern !== "string") {
+ throw new TypeError("glob pattern string required")
+ }
+
+ if (!options) options = {}
+ pattern = pattern.trim()
+
+ // windows: need to use /, not \
+ // On other platforms, \ is a valid (albeit bad) filename char.
+ if (platform === "win32") {
+ pattern = pattern.split("\\").join("/")
+ }
+
+ // lru storage.
+ // these things aren't particularly big, but walking down the string
+ // and turning it into a regexp can get pretty costly.
+ var cacheKey = pattern + "\n" + sigmund(options)
+ var cached = minimatch.cache.get(cacheKey)
+ if (cached) return cached
+ minimatch.cache.set(cacheKey, this)
+
+ this.options = options
+ this.set = []
+ this.pattern = pattern
+ this.regexp = null
+ this.negate = false
+ this.comment = false
+ this.empty = false
+
+ // make the set of regexps etc.
+ this.make()
+}
+
+Minimatch.prototype.debug = function() {}
+
+Minimatch.prototype.make = make
+function make () {
+ // don't do it more than once.
+ if (this._made) return
+
+ var pattern = this.pattern
+ var options = this.options
+
+ // empty patterns and comments match nothing.
+ if (!options.nocomment && pattern.charAt(0) === "#") {
+ this.comment = true
+ return
+ }
+ if (!pattern) {
+ this.empty = true
+ return
+ }
+
+ // step 1: figure out negation, etc.
+ this.parseNegate()
+
+ // step 2: expand braces
+ var set = this.globSet = this.braceExpand()
+
+ if (options.debug) this.debug = console.error
+
+ this.debug(this.pattern, set)
+
+ // step 3: now we have a set, so turn each one into a series of path-portion
+ // matching patterns.
+ // These will be regexps, except in the case of "**", which is
+ // set to the GLOBSTAR object for globstar behavior,
+ // and will not contain any / characters
+ set = this.globParts = set.map(function (s) {
+ return s.split(slashSplit)
+ })
+
+ this.debug(this.pattern, set)
+
+ // glob --> regexps
+ set = set.map(function (s, si, set) {
+ return s.map(this.parse, this)
+ }, this)
+
+ this.debug(this.pattern, set)
+
+ // filter out everything that didn't compile properly.
+ set = set.filter(function (s) {
+ return -1 === s.indexOf(false)
+ })
+
+ this.debug(this.pattern, set)
+
+ this.set = set
+}
+
+Minimatch.prototype.parseNegate = parseNegate
+function parseNegate () {
+ var pattern = this.pattern
+ , negate = false
+ , options = this.options
+ , negateOffset = 0
+
+ if (options.nonegate) return
+
+ for ( var i = 0, l = pattern.length
+ ; i < l && pattern.charAt(i) === "!"
+ ; i ++) {
+ negate = !negate
+ negateOffset ++
+ }
+
+ if (negateOffset) this.pattern = pattern.substr(negateOffset)
+ this.negate = negate
+}
+
+// Brace expansion:
+// a{b,c}d -> abd acd
+// a{b,}c -> abc ac
+// a{0..3}d -> a0d a1d a2d a3d
+// a{b,c{d,e}f}g -> abg acdfg acefg
+// a{b,c}d{e,f}g -> abdeg acdeg abdeg abdfg
+//
+// Invalid sets are not expanded.
+// a{2..}b -> a{2..}b
+// a{b}c -> a{b}c
+minimatch.braceExpand = function (pattern, options) {
+ return new Minimatch(pattern, options).braceExpand()
+}
+
+Minimatch.prototype.braceExpand = braceExpand
+function braceExpand (pattern, options) {
+ options = options || this.options
+ pattern = typeof pattern === "undefined"
+ ? this.pattern : pattern
+
+ if (typeof pattern === "undefined") {
+ throw new Error("undefined pattern")
+ }
+
+ if (options.nobrace ||
+ !pattern.match(/\{.*\}/)) {
+ // shortcut. no need to expand.
+ return [pattern]
+ }
+
+ var escaping = false
+
+ // examples and comments refer to this crazy pattern:
+ // a{b,c{d,e},{f,g}h}x{y,z}
+ // expected:
+ // abxy
+ // abxz
+ // acdxy
+ // acdxz
+ // acexy
+ // acexz
+ // afhxy
+ // afhxz
+ // aghxy
+ // aghxz
+
+ // everything before the first \{ is just a prefix.
+ // So, we pluck that off, and work with the rest,
+ // and then prepend it to everything we find.
+ if (pattern.charAt(0) !== "{") {
+ this.debug(pattern)
+ var prefix = null
+ for (var i = 0, l = pattern.length; i < l; i ++) {
+ var c = pattern.charAt(i)
+ this.debug(i, c)
+ if (c === "\\") {
+ escaping = !escaping
+ } else if (c === "{" && !escaping) {
+ prefix = pattern.substr(0, i)
+ break
+ }
+ }
+
+ // actually no sets, all { were escaped.
+ if (prefix === null) {
+ this.debug("no sets")
+ return [pattern]
+ }
+
+ var tail = braceExpand.call(this, pattern.substr(i), options)
+ return tail.map(function (t) {
+ return prefix + t
+ })
+ }
+
+ // now we have something like:
+ // {b,c{d,e},{f,g}h}x{y,z}
+ // walk through the set, expanding each part, until
+ // the set ends. then, we'll expand the suffix.
+ // If the set only has a single member, then'll put the {} back
+
+ // first, handle numeric sets, since they're easier
+ var numset = pattern.match(/^\{(-?[0-9]+)\.\.(-?[0-9]+)\}/)
+ if (numset) {
+ this.debug("numset", numset[1], numset[2])
+ var suf = braceExpand.call(this, pattern.substr(numset[0].length), options)
+ , start = +numset[1]
+ , end = +numset[2]
+ , inc = start > end ? -1 : 1
+ , set = []
+ for (var i = start; i != (end + inc); i += inc) {
+ // append all the suffixes
+ for (var ii = 0, ll = suf.length; ii < ll; ii ++) {
+ set.push(i + suf[ii])
+ }
+ }
+ return set
+ }
+
+ // ok, walk through the set
+ // We hope, somewhat optimistically, that there
+ // will be a } at the end.
+ // If the closing brace isn't found, then the pattern is
+ // interpreted as braceExpand("\\" + pattern) so that
+ // the leading \{ will be interpreted literally.
+ var i = 1 // skip the \{
+ , depth = 1
+ , set = []
+ , member = ""
+ , sawEnd = false
+ , escaping = false
+
+ function addMember () {
+ set.push(member)
+ member = ""
+ }
+
+ this.debug("Entering for")
+ FOR: for (i = 1, l = pattern.length; i < l; i ++) {
+ var c = pattern.charAt(i)
+ this.debug("", i, c)
+
+ if (escaping) {
+ escaping = false
+ member += "\\" + c
+ } else {
+ switch (c) {
+ case "\\":
+ escaping = true
+ continue
+
+ case "{":
+ depth ++
+ member += "{"
+ continue
+
+ case "}":
+ depth --
+ // if this closes the actual set, then we're done
+ if (depth === 0) {
+ addMember()
+ // pluck off the close-brace
+ i ++
+ break FOR
+ } else {
+ member += c
+ continue
+ }
+
+ case ",":
+ if (depth === 1) {
+ addMember()
+ } else {
+ member += c
+ }
+ continue
+
+ default:
+ member += c
+ continue
+ } // switch
+ } // else
+ } // for
+
+ // now we've either finished the set, and the suffix is
+ // pattern.substr(i), or we have *not* closed the set,
+ // and need to escape the leading brace
+ if (depth !== 0) {
+ this.debug("didn't close", pattern)
+ return braceExpand.call(this, "\\" + pattern, options)
+ }
+
+ // x{y,z} -> ["xy", "xz"]
+ this.debug("set", set)
+ this.debug("suffix", pattern.substr(i))
+ var suf = braceExpand.call(this, pattern.substr(i), options)
+ // ["b", "c{d,e}","{f,g}h"] ->
+ // [["b"], ["cd", "ce"], ["fh", "gh"]]
+ var addBraces = set.length === 1
+ this.debug("set pre-expanded", set)
+ set = set.map(function (p) {
+ return braceExpand.call(this, p, options)
+ }, this)
+ this.debug("set expanded", set)
+
+
+ // [["b"], ["cd", "ce"], ["fh", "gh"]] ->
+ // ["b", "cd", "ce", "fh", "gh"]
+ set = set.reduce(function (l, r) {
+ return l.concat(r)
+ })
+
+ if (addBraces) {
+ set = set.map(function (s) {
+ return "{" + s + "}"
+ })
+ }
+
+ // now attach the suffixes.
+ var ret = []
+ for (var i = 0, l = set.length; i < l; i ++) {
+ for (var ii = 0, ll = suf.length; ii < ll; ii ++) {
+ ret.push(set[i] + suf[ii])
+ }
+ }
+ return ret
+}
+
+// parse a component of the expanded set.
+// At this point, no pattern may contain "/" in it
+// so we're going to return a 2d array, where each entry is the full
+// pattern, split on '/', and then turned into a regular expression.
+// A regexp is made at the end which joins each array with an
+// escaped /, and another full one which joins each regexp with |.
+//
+// Following the lead of Bash 4.1, note that "**" only has special meaning
+// when it is the *only* thing in a path portion. Otherwise, any series
+// of * is equivalent to a single *. Globstar behavior is enabled by
+// default, and can be disabled by setting options.noglobstar.
+Minimatch.prototype.parse = parse
+var SUBPARSE = {}
+function parse (pattern, isSub) {
+ var options = this.options
+
+ // shortcuts
+ if (!options.noglobstar && pattern === "**") return GLOBSTAR
+ if (pattern === "") return ""
+
+ var re = ""
+ , hasMagic = !!options.nocase
+ , escaping = false
+ // ? => one single character
+ , patternListStack = []
+ , plType
+ , stateChar
+ , inClass = false
+ , reClassStart = -1
+ , classStart = -1
+ // . and .. never match anything that doesn't start with .,
+ // even when options.dot is set.
+ , patternStart = pattern.charAt(0) === "." ? "" // anything
+ // not (start or / followed by . or .. followed by / or end)
+ : options.dot ? "(?!(?:^|\\\/)\\.{1,2}(?:$|\\\/))"
+ : "(?!\\.)"
+ , self = this
+
+ function clearStateChar () {
+ if (stateChar) {
+ // we had some state-tracking character
+ // that wasn't consumed by this pass.
+ switch (stateChar) {
+ case "*":
+ re += star
+ hasMagic = true
+ break
+ case "?":
+ re += qmark
+ hasMagic = true
+ break
+ default:
+ re += "\\"+stateChar
+ break
+ }
+ self.debug('clearStateChar %j %j', stateChar, re)
+ stateChar = false
+ }
+ }
+
+ for ( var i = 0, len = pattern.length, c
+ ; (i < len) && (c = pattern.charAt(i))
+ ; i ++ ) {
+
+ this.debug("%s\t%s %s %j", pattern, i, re, c)
+
+ // skip over any that are escaped.
+ if (escaping && reSpecials[c]) {
+ re += "\\" + c
+ escaping = false
+ continue
+ }
+
+ SWITCH: switch (c) {
+ case "/":
+ // completely not allowed, even escaped.
+ // Should already be path-split by now.
+ return false
+
+ case "\\":
+ clearStateChar()
+ escaping = true
+ continue
+
+ // the various stateChar values
+ // for the "extglob" stuff.
+ case "?":
+ case "*":
+ case "+":
+ case "@":
+ case "!":
+ this.debug("%s\t%s %s %j <-- stateChar", pattern, i, re, c)
+
+ // all of those are literals inside a class, except that
+ // the glob [!a] means [^a] in regexp
+ if (inClass) {
+ this.debug(' in class')
+ if (c === "!" && i === classStart + 1) c = "^"
+ re += c
+ continue
+ }
+
+ // if we already have a stateChar, then it means
+ // that there was something like ** or +? in there.
+ // Handle the stateChar, then proceed with this one.
+ self.debug('call clearStateChar %j', stateChar)
+ clearStateChar()
+ stateChar = c
+ // if extglob is disabled, then +(asdf|foo) isn't a thing.
+ // just clear the statechar *now*, rather than even diving into
+ // the patternList stuff.
+ if (options.noext) clearStateChar()
+ continue
+
+ case "(":
+ if (inClass) {
+ re += "("
+ continue
+ }
+
+ if (!stateChar) {
+ re += "\\("
+ continue
+ }
+
+ plType = stateChar
+ patternListStack.push({ type: plType
+ , start: i - 1
+ , reStart: re.length })
+ // negation is (?:(?!js)[^/]*)
+ re += stateChar === "!" ? "(?:(?!" : "(?:"
+ this.debug('plType %j %j', stateChar, re)
+ stateChar = false
+ continue
+
+ case ")":
+ if (inClass || !patternListStack.length) {
+ re += "\\)"
+ continue
+ }
+
+ clearStateChar()
+ hasMagic = true
+ re += ")"
+ plType = patternListStack.pop().type
+ // negation is (?:(?!js)[^/]*)
+ // The others are (?:)
+ switch (plType) {
+ case "!":
+ re += "[^/]*?)"
+ break
+ case "?":
+ case "+":
+ case "*": re += plType
+ case "@": break // the default anyway
+ }
+ continue
+
+ case "|":
+ if (inClass || !patternListStack.length || escaping) {
+ re += "\\|"
+ escaping = false
+ continue
+ }
+
+ clearStateChar()
+ re += "|"
+ continue
+
+ // these are mostly the same in regexp and glob
+ case "[":
+ // swallow any state-tracking char before the [
+ clearStateChar()
+
+ if (inClass) {
+ re += "\\" + c
+ continue
+ }
+
+ inClass = true
+ classStart = i
+ reClassStart = re.length
+ re += c
+ continue
+
+ case "]":
+ // a right bracket shall lose its special
+ // meaning and represent itself in
+ // a bracket expression if it occurs
+ // first in the list. -- POSIX.2 2.8.3.2
+ if (i === classStart + 1 || !inClass) {
+ re += "\\" + c
+ escaping = false
+ continue
+ }
+
+ // finish up the class.
+ hasMagic = true
+ inClass = false
+ re += c
+ continue
+
+ default:
+ // swallow any state char that wasn't consumed
+ clearStateChar()
+
+ if (escaping) {
+ // no need
+ escaping = false
+ } else if (reSpecials[c]
+ && !(c === "^" && inClass)) {
+ re += "\\"
+ }
+
+ re += c
+
+ } // switch
+ } // for
+
+
+ // handle the case where we left a class open.
+ // "[abc" is valid, equivalent to "\[abc"
+ if (inClass) {
+ // split where the last [ was, and escape it
+ // this is a huge pita. We now have to re-walk
+ // the contents of the would-be class to re-translate
+ // any characters that were passed through as-is
+ var cs = pattern.substr(classStart + 1)
+ , sp = this.parse(cs, SUBPARSE)
+ re = re.substr(0, reClassStart) + "\\[" + sp[0]
+ hasMagic = hasMagic || sp[1]
+ }
+
+ // handle the case where we had a +( thing at the *end*
+ // of the pattern.
+ // each pattern list stack adds 3 chars, and we need to go through
+ // and escape any | chars that were passed through as-is for the regexp.
+ // Go through and escape them, taking care not to double-escape any
+ // | chars that were already escaped.
+ var pl
+ while (pl = patternListStack.pop()) {
+ var tail = re.slice(pl.reStart + 3)
+ // maybe some even number of \, then maybe 1 \, followed by a |
+ tail = tail.replace(/((?:\\{2})*)(\\?)\|/g, function (_, $1, $2) {
+ if (!$2) {
+ // the | isn't already escaped, so escape it.
+ $2 = "\\"
+ }
+
+ // need to escape all those slashes *again*, without escaping the
+ // one that we need for escaping the | character. As it works out,
+ // escaping an even number of slashes can be done by simply repeating
+ // it exactly after itself. That's why this trick works.
+ //
+ // I am sorry that you have to see this.
+ return $1 + $1 + $2 + "|"
+ })
+
+ this.debug("tail=%j\n %s", tail, tail)
+ var t = pl.type === "*" ? star
+ : pl.type === "?" ? qmark
+ : "\\" + pl.type
+
+ hasMagic = true
+ re = re.slice(0, pl.reStart)
+ + t + "\\("
+ + tail
+ }
+
+ // handle trailing things that only matter at the very end.
+ clearStateChar()
+ if (escaping) {
+ // trailing \\
+ re += "\\\\"
+ }
+
+ // only need to apply the nodot start if the re starts with
+ // something that could conceivably capture a dot
+ var addPatternStart = false
+ switch (re.charAt(0)) {
+ case ".":
+ case "[":
+ case "(": addPatternStart = true
+ }
+
+ // if the re is not "" at this point, then we need to make sure
+ // it doesn't match against an empty path part.
+ // Otherwise a/* will match a/, which it should not.
+ if (re !== "" && hasMagic) re = "(?=.)" + re
+
+ if (addPatternStart) re = patternStart + re
+
+ // parsing just a piece of a larger pattern.
+ if (isSub === SUBPARSE) {
+ return [ re, hasMagic ]
+ }
+
+ // skip the regexp for non-magical patterns
+ // unescape anything in it, though, so that it'll be
+ // an exact match against a file etc.
+ if (!hasMagic) {
+ return globUnescape(pattern)
+ }
+
+ var flags = options.nocase ? "i" : ""
+ , regExp = new RegExp("^" + re + "$", flags)
+
+ regExp._glob = pattern
+ regExp._src = re
+
+ return regExp
+}
+
+minimatch.makeRe = function (pattern, options) {
+ return new Minimatch(pattern, options || {}).makeRe()
+}
+
+Minimatch.prototype.makeRe = makeRe
+function makeRe () {
+ if (this.regexp || this.regexp === false) return this.regexp
+
+ // at this point, this.set is a 2d array of partial
+ // pattern strings, or "**".
+ //
+ // It's better to use .match(). This function shouldn't
+ // be used, really, but it's pretty convenient sometimes,
+ // when you just want to work with a regex.
+ var set = this.set
+
+ if (!set.length) return this.regexp = false
+ var options = this.options
+
+ var twoStar = options.noglobstar ? star
+ : options.dot ? twoStarDot
+ : twoStarNoDot
+ , flags = options.nocase ? "i" : ""
+
+ var re = set.map(function (pattern) {
+ return pattern.map(function (p) {
+ return (p === GLOBSTAR) ? twoStar
+ : (typeof p === "string") ? regExpEscape(p)
+ : p._src
+ }).join("\\\/")
+ }).join("|")
+
+ // must match entire pattern
+ // ending in a * or ** will make it less strict.
+ re = "^(?:" + re + ")$"
+
+ // can match anything, as long as it's not this.
+ if (this.negate) re = "^(?!" + re + ").*$"
+
+ try {
+ return this.regexp = new RegExp(re, flags)
+ } catch (ex) {
+ return this.regexp = false
+ }
+}
+
+minimatch.match = function (list, pattern, options) {
+ options = options || {}
+ var mm = new Minimatch(pattern, options)
+ list = list.filter(function (f) {
+ return mm.match(f)
+ })
+ if (mm.options.nonull && !list.length) {
+ list.push(pattern)
+ }
+ return list
+}
+
+Minimatch.prototype.match = match
+function match (f, partial) {
+ this.debug("match", f, this.pattern)
+ // short-circuit in the case of busted things.
+ // comments, etc.
+ if (this.comment) return false
+ if (this.empty) return f === ""
+
+ if (f === "/" && partial) return true
+
+ var options = this.options
+
+ // windows: need to use /, not \
+ // On other platforms, \ is a valid (albeit bad) filename char.
+ if (platform === "win32") {
+ f = f.split("\\").join("/")
+ }
+
+ // treat the test path as a set of pathparts.
+ f = f.split(slashSplit)
+ this.debug(this.pattern, "split", f)
+
+ // just ONE of the pattern sets in this.set needs to match
+ // in order for it to be valid. If negating, then just one
+ // match means that we have failed.
+ // Either way, return on the first hit.
+
+ var set = this.set
+ this.debug(this.pattern, "set", set)
+
+ // Find the basename of the path by looking for the last non-empty segment
+ var filename;
+ for (var i = f.length - 1; i >= 0; i--) {
+ filename = f[i]
+ if (filename) break
+ }
+
+ for (var i = 0, l = set.length; i < l; i ++) {
+ var pattern = set[i], file = f
+ if (options.matchBase && pattern.length === 1) {
+ file = [filename]
+ }
+ var hit = this.matchOne(file, pattern, partial)
+ if (hit) {
+ if (options.flipNegate) return true
+ return !this.negate
+ }
+ }
+
+ // didn't get any hits. this is success if it's a negative
+ // pattern, failure otherwise.
+ if (options.flipNegate) return false
+ return this.negate
+}
+
+// set partial to true to test if, for example,
+// "/a/b" matches the start of "/*/b/*/d"
+// Partial means, if you run out of file before you run
+// out of pattern, then that's fine, as long as all
+// the parts match.
+Minimatch.prototype.matchOne = function (file, pattern, partial) {
+ var options = this.options
+
+ this.debug("matchOne",
+ { "this": this
+ , file: file
+ , pattern: pattern })
+
+ this.debug("matchOne", file.length, pattern.length)
+
+ for ( var fi = 0
+ , pi = 0
+ , fl = file.length
+ , pl = pattern.length
+ ; (fi < fl) && (pi < pl)
+ ; fi ++, pi ++ ) {
+
+ this.debug("matchOne loop")
+ var p = pattern[pi]
+ , f = file[fi]
+
+ this.debug(pattern, p, f)
+
+ // should be impossible.
+ // some invalid regexp stuff in the set.
+ if (p === false) return false
+
+ if (p === GLOBSTAR) {
+ this.debug('GLOBSTAR', [pattern, p, f])
+
+ // "**"
+ // a/**/b/**/c would match the following:
+ // a/b/x/y/z/c
+ // a/x/y/z/b/c
+ // a/b/x/b/x/c
+ // a/b/c
+ // To do this, take the rest of the pattern after
+ // the **, and see if it would match the file remainder.
+ // If so, return success.
+ // If not, the ** "swallows" a segment, and try again.
+ // This is recursively awful.
+ //
+ // a/**/b/**/c matching a/b/x/y/z/c
+ // - a matches a
+ // - doublestar
+ // - matchOne(b/x/y/z/c, b/**/c)
+ // - b matches b
+ // - doublestar
+ // - matchOne(x/y/z/c, c) -> no
+ // - matchOne(y/z/c, c) -> no
+ // - matchOne(z/c, c) -> no
+ // - matchOne(c, c) yes, hit
+ var fr = fi
+ , pr = pi + 1
+ if (pr === pl) {
+ this.debug('** at the end')
+ // a ** at the end will just swallow the rest.
+ // We have found a match.
+ // however, it will not swallow /.x, unless
+ // options.dot is set.
+ // . and .. are *never* matched by **, for explosively
+ // exponential reasons.
+ for ( ; fi < fl; fi ++) {
+ if (file[fi] === "." || file[fi] === ".." ||
+ (!options.dot && file[fi].charAt(0) === ".")) return false
+ }
+ return true
+ }
+
+ // ok, let's see if we can swallow whatever we can.
+ WHILE: while (fr < fl) {
+ var swallowee = file[fr]
+
+ this.debug('\nglobstar while',
+ file, fr, pattern, pr, swallowee)
+
+ // XXX remove this slice. Just pass the start index.
+ if (this.matchOne(file.slice(fr), pattern.slice(pr), partial)) {
+ this.debug('globstar found match!', fr, fl, swallowee)
+ // found a match.
+ return true
+ } else {
+ // can't swallow "." or ".." ever.
+ // can only swallow ".foo" when explicitly asked.
+ if (swallowee === "." || swallowee === ".." ||
+ (!options.dot && swallowee.charAt(0) === ".")) {
+ this.debug("dot detected!", file, fr, pattern, pr)
+ break WHILE
+ }
+
+ // ** swallows a segment, and continue.
+ this.debug('globstar swallow a segment, and continue')
+ fr ++
+ }
+ }
+ // no match was found.
+ // However, in partial mode, we can't say this is necessarily over.
+ // If there's more *pattern* left, then
+ if (partial) {
+ // ran out of file
+ this.debug("\n>>> no match, partial?", file, fr, pattern, pr)
+ if (fr === fl) return true
+ }
+ return false
+ }
+
+ // something other than **
+ // non-magic patterns just have to match exactly
+ // patterns with magic have been turned into regexps.
+ var hit
+ if (typeof p === "string") {
+ if (options.nocase) {
+ hit = f.toLowerCase() === p.toLowerCase()
+ } else {
+ hit = f === p
+ }
+ this.debug("string match", p, f, hit)
+ } else {
+ hit = f.match(p)
+ this.debug("pattern match", p, f, hit)
+ }
+
+ if (!hit) return false
+ }
+
+ // Note: ending in / means that we'll get a final ""
+ // at the end of the pattern. This can only match a
+ // corresponding "" at the end of the file.
+ // If the file ends in /, then it can only match a
+ // a pattern that ends in /, unless the pattern just
+ // doesn't have any more for it. But, a/b/ should *not*
+ // match "a/b/*", even though "" matches against the
+ // [^/]*? pattern, except in partial mode, where it might
+ // simply not be reached yet.
+ // However, a/b/ should still satisfy a/*
+
+ // now either we fell off the end of the pattern, or we're done.
+ if (fi === fl && pi === pl) {
+ // ran out of pattern and filename at the same time.
+ // an exact hit!
+ return true
+ } else if (fi === fl) {
+ // ran out of file, but still had pattern left.
+ // this is ok if we're doing the match as part of
+ // a glob fs traversal.
+ return partial
+ } else if (pi === pl) {
+ // ran out of pattern, still have file left.
+ // this is only acceptable if we're on the very last
+ // empty segment of a file with a trailing slash.
+ // a/* should match a/b/
+ var emptyFileEnd = (fi === fl - 1) && (file[fi] === "")
+ return emptyFileEnd
+ }
+
+ // should be unreachable.
+ throw new Error("wtf?")
+}
+
+
+// replace stuff like \* with *
+function globUnescape (s) {
+ return s.replace(/\\(.)/g, "$1")
+}
+
+
+function regExpEscape (s) {
+ return s.replace(/[-[\]{}()*+?.,\\^$|#\s]/g, "\\$&")
+}
+
+})( typeof require === "function" ? require : null,
+ this,
+ typeof module === "object" ? module : null,
+ typeof process === "object" ? process.platform : "win32"
+ )
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/lru-cache/.npmignore b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/lru-cache/.npmignore
new file mode 100644
index 0000000..07e6e47
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/lru-cache/.npmignore
@@ -0,0 +1 @@
+/node_modules
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/lru-cache/CONTRIBUTORS b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/lru-cache/CONTRIBUTORS
new file mode 100644
index 0000000..4a0bc50
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/lru-cache/CONTRIBUTORS
@@ -0,0 +1,14 @@
+# Authors, sorted by whether or not they are me
+Isaac Z. Schlueter
+Brian Cottingham
+Carlos Brito Lage
+Jesse Dailey
+Kevin O'Hara
+Marco Rogers
+Mark Cavage
+Marko Mikulicic
+Nathan Rajlich
+Satheesh Natesan
+Trent Mick
+ashleybrener
+n4kz
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/lru-cache/LICENSE b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/lru-cache/LICENSE
new file mode 100644
index 0000000..05a4010
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/lru-cache/LICENSE
@@ -0,0 +1,23 @@
+Copyright 2009, 2010, 2011 Isaac Z. Schlueter.
+All rights reserved.
+
+Permission is hereby granted, free of charge, to any person
+obtaining a copy of this software and associated documentation
+files (the "Software"), to deal in the Software without
+restriction, including without limitation the rights to use,
+copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the
+Software is furnished to do so, subject to the following
+conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/lru-cache/README.md b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/lru-cache/README.md
new file mode 100644
index 0000000..03ee0f9
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/lru-cache/README.md
@@ -0,0 +1,97 @@
+# lru cache
+
+A cache object that deletes the least-recently-used items.
+
+## Usage:
+
+```javascript
+var LRU = require("lru-cache")
+ , options = { max: 500
+ , length: function (n) { return n * 2 }
+ , dispose: function (key, n) { n.close() }
+ , maxAge: 1000 * 60 * 60 }
+ , cache = LRU(options)
+ , otherCache = LRU(50) // sets just the max size
+
+cache.set("key", "value")
+cache.get("key") // "value"
+
+cache.reset() // empty the cache
+```
+
+If you put more stuff in it, then items will fall out.
+
+If you try to put an oversized thing in it, then it'll fall out right
+away.
+
+## Options
+
+* `max` The maximum size of the cache, checked by applying the length
+ function to all values in the cache. Not setting this is kind of
+ silly, since that's the whole purpose of this lib, but it defaults
+ to `Infinity`.
+* `maxAge` Maximum age in ms. Items are not pro-actively pruned out
+ as they age, but if you try to get an item that is too old, it'll
+ drop it and return undefined instead of giving it to you.
+* `length` Function that is used to calculate the length of stored
+ items. If you're storing strings or buffers, then you probably want
+ to do something like `function(n){return n.length}`. The default is
+ `function(n){return 1}`, which is fine if you want to store `n`
+ like-sized things.
+* `dispose` Function that is called on items when they are dropped
+ from the cache. This can be handy if you want to close file
+ descriptors or do other cleanup tasks when items are no longer
+ accessible. Called with `key, value`. It's called *before*
+ actually removing the item from the internal cache, so if you want
+ to immediately put it back in, you'll have to do that in a
+ `nextTick` or `setTimeout` callback or it won't do anything.
+* `stale` By default, if you set a `maxAge`, it'll only actually pull
+ stale items out of the cache when you `get(key)`. (That is, it's
+ not pre-emptively doing a `setTimeout` or anything.) If you set
+ `stale:true`, it'll return the stale value before deleting it. If
+ you don't set this, then it'll return `undefined` when you try to
+ get a stale entry, as if it had already been deleted.
+
+## API
+
+* `set(key, value)`
+* `get(key) => value`
+
+ Both of these will update the "recently used"-ness of the key.
+ They do what you think.
+
+* `peek(key)`
+
+ Returns the key value (or `undefined` if not found) without
+ updating the "recently used"-ness of the key.
+
+ (If you find yourself using this a lot, you *might* be using the
+ wrong sort of data structure, but there are some use cases where
+ it's handy.)
+
+* `del(key)`
+
+ Deletes a key out of the cache.
+
+* `reset()`
+
+ Clear the cache entirely, throwing away all values.
+
+* `has(key)`
+
+ Check if a key is in the cache, without updating the recent-ness
+ or deleting it for being stale.
+
+* `forEach(function(value,key,cache), [thisp])`
+
+ Just like `Array.prototype.forEach`. Iterates over all the keys
+ in the cache, in order of recent-ness. (Ie, more recently used
+ items are iterated over first.)
+
+* `keys()`
+
+ Return an array of the keys in the cache.
+
+* `values()`
+
+ Return an array of the values in the cache.
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/lru-cache/lib/lru-cache.js b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/lru-cache/lib/lru-cache.js
new file mode 100644
index 0000000..d1d1381
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/lru-cache/lib/lru-cache.js
@@ -0,0 +1,252 @@
+;(function () { // closure for web browsers
+
+if (typeof module === 'object' && module.exports) {
+ module.exports = LRUCache
+} else {
+ // just set the global for non-node platforms.
+ this.LRUCache = LRUCache
+}
+
+function hOP (obj, key) {
+ return Object.prototype.hasOwnProperty.call(obj, key)
+}
+
+function naiveLength () { return 1 }
+
+function LRUCache (options) {
+ if (!(this instanceof LRUCache))
+ return new LRUCache(options)
+
+ if (typeof options === 'number')
+ options = { max: options }
+
+ if (!options)
+ options = {}
+
+ this._max = options.max
+ // Kind of weird to have a default max of Infinity, but oh well.
+ if (!this._max || !(typeof this._max === "number") || this._max <= 0 )
+ this._max = Infinity
+
+ this._lengthCalculator = options.length || naiveLength
+ if (typeof this._lengthCalculator !== "function")
+ this._lengthCalculator = naiveLength
+
+ this._allowStale = options.stale || false
+ this._maxAge = options.maxAge || null
+ this._dispose = options.dispose
+ this.reset()
+}
+
+// resize the cache when the max changes.
+Object.defineProperty(LRUCache.prototype, "max",
+ { set : function (mL) {
+ if (!mL || !(typeof mL === "number") || mL <= 0 ) mL = Infinity
+ this._max = mL
+ if (this._length > this._max) trim(this)
+ }
+ , get : function () { return this._max }
+ , enumerable : true
+ })
+
+// resize the cache when the lengthCalculator changes.
+Object.defineProperty(LRUCache.prototype, "lengthCalculator",
+ { set : function (lC) {
+ if (typeof lC !== "function") {
+ this._lengthCalculator = naiveLength
+ this._length = this._itemCount
+ for (var key in this._cache) {
+ this._cache[key].length = 1
+ }
+ } else {
+ this._lengthCalculator = lC
+ this._length = 0
+ for (var key in this._cache) {
+ this._cache[key].length = this._lengthCalculator(this._cache[key].value)
+ this._length += this._cache[key].length
+ }
+ }
+
+ if (this._length > this._max) trim(this)
+ }
+ , get : function () { return this._lengthCalculator }
+ , enumerable : true
+ })
+
+Object.defineProperty(LRUCache.prototype, "length",
+ { get : function () { return this._length }
+ , enumerable : true
+ })
+
+
+Object.defineProperty(LRUCache.prototype, "itemCount",
+ { get : function () { return this._itemCount }
+ , enumerable : true
+ })
+
+LRUCache.prototype.forEach = function (fn, thisp) {
+ thisp = thisp || this
+ var i = 0;
+ for (var k = this._mru - 1; k >= 0 && i < this._itemCount; k--) if (this._lruList[k]) {
+ i++
+ var hit = this._lruList[k]
+ if (this._maxAge && (Date.now() - hit.now > this._maxAge)) {
+ del(this, hit)
+ if (!this._allowStale) hit = undefined
+ }
+ if (hit) {
+ fn.call(thisp, hit.value, hit.key, this)
+ }
+ }
+}
+
+LRUCache.prototype.keys = function () {
+ var keys = new Array(this._itemCount)
+ var i = 0
+ for (var k = this._mru - 1; k >= 0 && i < this._itemCount; k--) if (this._lruList[k]) {
+ var hit = this._lruList[k]
+ keys[i++] = hit.key
+ }
+ return keys
+}
+
+LRUCache.prototype.values = function () {
+ var values = new Array(this._itemCount)
+ var i = 0
+ for (var k = this._mru - 1; k >= 0 && i < this._itemCount; k--) if (this._lruList[k]) {
+ var hit = this._lruList[k]
+ values[i++] = hit.value
+ }
+ return values
+}
+
+LRUCache.prototype.reset = function () {
+ if (this._dispose && this._cache) {
+ for (var k in this._cache) {
+ this._dispose(k, this._cache[k].value)
+ }
+ }
+
+ this._cache = Object.create(null) // hash of items by key
+ this._lruList = Object.create(null) // list of items in order of use recency
+ this._mru = 0 // most recently used
+ this._lru = 0 // least recently used
+ this._length = 0 // number of items in the list
+ this._itemCount = 0
+}
+
+// Provided for debugging/dev purposes only. No promises whatsoever that
+// this API stays stable.
+LRUCache.prototype.dump = function () {
+ return this._cache
+}
+
+LRUCache.prototype.dumpLru = function () {
+ return this._lruList
+}
+
+LRUCache.prototype.set = function (key, value) {
+ if (hOP(this._cache, key)) {
+ // dispose of the old one before overwriting
+ if (this._dispose) this._dispose(key, this._cache[key].value)
+ if (this._maxAge) this._cache[key].now = Date.now()
+ this._cache[key].value = value
+ this.get(key)
+ return true
+ }
+
+ var len = this._lengthCalculator(value)
+ var age = this._maxAge ? Date.now() : 0
+ var hit = new Entry(key, value, this._mru++, len, age)
+
+ // oversized objects fall out of cache automatically.
+ if (hit.length > this._max) {
+ if (this._dispose) this._dispose(key, value)
+ return false
+ }
+
+ this._length += hit.length
+ this._lruList[hit.lu] = this._cache[key] = hit
+ this._itemCount ++
+
+ if (this._length > this._max) trim(this)
+ return true
+}
+
+LRUCache.prototype.has = function (key) {
+ if (!hOP(this._cache, key)) return false
+ var hit = this._cache[key]
+ if (this._maxAge && (Date.now() - hit.now > this._maxAge)) {
+ return false
+ }
+ return true
+}
+
+LRUCache.prototype.get = function (key) {
+ return get(this, key, true)
+}
+
+LRUCache.prototype.peek = function (key) {
+ return get(this, key, false)
+}
+
+LRUCache.prototype.pop = function () {
+ var hit = this._lruList[this._lru]
+ del(this, hit)
+ return hit || null
+}
+
+LRUCache.prototype.del = function (key) {
+ del(this, this._cache[key])
+}
+
+function get (self, key, doUse) {
+ var hit = self._cache[key]
+ if (hit) {
+ if (self._maxAge && (Date.now() - hit.now > self._maxAge)) {
+ del(self, hit)
+ if (!self._allowStale) hit = undefined
+ } else {
+ if (doUse) use(self, hit)
+ }
+ if (hit) hit = hit.value
+ }
+ return hit
+}
+
+function use (self, hit) {
+ shiftLU(self, hit)
+ hit.lu = self._mru ++
+ self._lruList[hit.lu] = hit
+}
+
+function trim (self) {
+ while (self._lru < self._mru && self._length > self._max)
+ del(self, self._lruList[self._lru])
+}
+
+function shiftLU (self, hit) {
+ delete self._lruList[ hit.lu ]
+ while (self._lru < self._mru && !self._lruList[self._lru]) self._lru ++
+}
+
+function del (self, hit) {
+ if (hit) {
+ if (self._dispose) self._dispose(hit.key, hit.value)
+ self._length -= hit.length
+ self._itemCount --
+ delete self._cache[ hit.key ]
+ shiftLU(self, hit)
+ }
+}
+
+// classy, since V8 prefers predictable objects.
+function Entry (key, value, lu, length, now) {
+ this.key = key
+ this.value = value
+ this.lu = lu
+ this.length = length
+ this.now = now
+}
+
+})()
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/lru-cache/package.json b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/lru-cache/package.json
new file mode 100644
index 0000000..8b8b014
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/lru-cache/package.json
@@ -0,0 +1,50 @@
+{
+ "name": "lru-cache",
+ "description": "A cache object that deletes the least-recently-used items.",
+ "version": "2.5.0",
+ "author": {
+ "name": "Isaac Z. Schlueter",
+ "email": "i@izs.me"
+ },
+ "scripts": {
+ "test": "tap test --gc"
+ },
+ "main": "lib/lru-cache.js",
+ "repository": {
+ "type": "git",
+ "url": "git://github.com/isaacs/node-lru-cache.git"
+ },
+ "devDependencies": {
+ "tap": "",
+ "weak": ""
+ },
+ "license": {
+ "type": "MIT",
+ "url": "http://github.com/isaacs/node-lru-cache/raw/master/LICENSE"
+ },
+ "bugs": {
+ "url": "https://github.com/isaacs/node-lru-cache/issues"
+ },
+ "homepage": "https://github.com/isaacs/node-lru-cache",
+ "_id": "lru-cache@2.5.0",
+ "dist": {
+ "shasum": "d82388ae9c960becbea0c73bb9eb79b6c6ce9aeb",
+ "tarball": "http://registry.npmjs.org/lru-cache/-/lru-cache-2.5.0.tgz"
+ },
+ "_from": "lru-cache@>=2.0.0 <3.0.0",
+ "_npmVersion": "1.3.15",
+ "_npmUser": {
+ "name": "isaacs",
+ "email": "i@izs.me"
+ },
+ "maintainers": [
+ {
+ "name": "isaacs",
+ "email": "i@izs.me"
+ }
+ ],
+ "directories": {},
+ "_shasum": "d82388ae9c960becbea0c73bb9eb79b6c6ce9aeb",
+ "_resolved": "https://registry.npmjs.org/lru-cache/-/lru-cache-2.5.0.tgz",
+ "readme": "ERROR: No README data found!"
+}
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/lru-cache/test/basic.js b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/lru-cache/test/basic.js
new file mode 100644
index 0000000..f72697c
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/lru-cache/test/basic.js
@@ -0,0 +1,369 @@
+var test = require("tap").test
+ , LRU = require("../")
+
+test("basic", function (t) {
+ var cache = new LRU({max: 10})
+ cache.set("key", "value")
+ t.equal(cache.get("key"), "value")
+ t.equal(cache.get("nada"), undefined)
+ t.equal(cache.length, 1)
+ t.equal(cache.max, 10)
+ t.end()
+})
+
+test("least recently set", function (t) {
+ var cache = new LRU(2)
+ cache.set("a", "A")
+ cache.set("b", "B")
+ cache.set("c", "C")
+ t.equal(cache.get("c"), "C")
+ t.equal(cache.get("b"), "B")
+ t.equal(cache.get("a"), undefined)
+ t.end()
+})
+
+test("lru recently gotten", function (t) {
+ var cache = new LRU(2)
+ cache.set("a", "A")
+ cache.set("b", "B")
+ cache.get("a")
+ cache.set("c", "C")
+ t.equal(cache.get("c"), "C")
+ t.equal(cache.get("b"), undefined)
+ t.equal(cache.get("a"), "A")
+ t.end()
+})
+
+test("del", function (t) {
+ var cache = new LRU(2)
+ cache.set("a", "A")
+ cache.del("a")
+ t.equal(cache.get("a"), undefined)
+ t.end()
+})
+
+test("max", function (t) {
+ var cache = new LRU(3)
+
+ // test changing the max, verify that the LRU items get dropped.
+ cache.max = 100
+ for (var i = 0; i < 100; i ++) cache.set(i, i)
+ t.equal(cache.length, 100)
+ for (var i = 0; i < 100; i ++) {
+ t.equal(cache.get(i), i)
+ }
+ cache.max = 3
+ t.equal(cache.length, 3)
+ for (var i = 0; i < 97; i ++) {
+ t.equal(cache.get(i), undefined)
+ }
+ for (var i = 98; i < 100; i ++) {
+ t.equal(cache.get(i), i)
+ }
+
+ // now remove the max restriction, and try again.
+ cache.max = "hello"
+ for (var i = 0; i < 100; i ++) cache.set(i, i)
+ t.equal(cache.length, 100)
+ for (var i = 0; i < 100; i ++) {
+ t.equal(cache.get(i), i)
+ }
+ // should trigger an immediate resize
+ cache.max = 3
+ t.equal(cache.length, 3)
+ for (var i = 0; i < 97; i ++) {
+ t.equal(cache.get(i), undefined)
+ }
+ for (var i = 98; i < 100; i ++) {
+ t.equal(cache.get(i), i)
+ }
+ t.end()
+})
+
+test("reset", function (t) {
+ var cache = new LRU(10)
+ cache.set("a", "A")
+ cache.set("b", "B")
+ cache.reset()
+ t.equal(cache.length, 0)
+ t.equal(cache.max, 10)
+ t.equal(cache.get("a"), undefined)
+ t.equal(cache.get("b"), undefined)
+ t.end()
+})
+
+
+// Note: `.dump()` is a debugging tool only. No guarantees are made
+// about the format/layout of the response.
+test("dump", function (t) {
+ var cache = new LRU(10)
+ var d = cache.dump();
+ t.equal(Object.keys(d).length, 0, "nothing in dump for empty cache")
+ cache.set("a", "A")
+ var d = cache.dump() // { a: { key: "a", value: "A", lu: 0 } }
+ t.ok(d.a)
+ t.equal(d.a.key, "a")
+ t.equal(d.a.value, "A")
+ t.equal(d.a.lu, 0)
+
+ cache.set("b", "B")
+ cache.get("b")
+ d = cache.dump()
+ t.ok(d.b)
+ t.equal(d.b.key, "b")
+ t.equal(d.b.value, "B")
+ t.equal(d.b.lu, 2)
+
+ t.end()
+})
+
+
+test("basic with weighed length", function (t) {
+ var cache = new LRU({
+ max: 100,
+ length: function (item) { return item.size }
+ })
+ cache.set("key", {val: "value", size: 50})
+ t.equal(cache.get("key").val, "value")
+ t.equal(cache.get("nada"), undefined)
+ t.equal(cache.lengthCalculator(cache.get("key")), 50)
+ t.equal(cache.length, 50)
+ t.equal(cache.max, 100)
+ t.end()
+})
+
+
+test("weighed length item too large", function (t) {
+ var cache = new LRU({
+ max: 10,
+ length: function (item) { return item.size }
+ })
+ t.equal(cache.max, 10)
+
+ // should fall out immediately
+ cache.set("key", {val: "value", size: 50})
+
+ t.equal(cache.length, 0)
+ t.equal(cache.get("key"), undefined)
+ t.end()
+})
+
+test("least recently set with weighed length", function (t) {
+ var cache = new LRU({
+ max:8,
+ length: function (item) { return item.length }
+ })
+ cache.set("a", "A")
+ cache.set("b", "BB")
+ cache.set("c", "CCC")
+ cache.set("d", "DDDD")
+ t.equal(cache.get("d"), "DDDD")
+ t.equal(cache.get("c"), "CCC")
+ t.equal(cache.get("b"), undefined)
+ t.equal(cache.get("a"), undefined)
+ t.end()
+})
+
+test("lru recently gotten with weighed length", function (t) {
+ var cache = new LRU({
+ max: 8,
+ length: function (item) { return item.length }
+ })
+ cache.set("a", "A")
+ cache.set("b", "BB")
+ cache.set("c", "CCC")
+ cache.get("a")
+ cache.get("b")
+ cache.set("d", "DDDD")
+ t.equal(cache.get("c"), undefined)
+ t.equal(cache.get("d"), "DDDD")
+ t.equal(cache.get("b"), "BB")
+ t.equal(cache.get("a"), "A")
+ t.end()
+})
+
+test("set returns proper booleans", function(t) {
+ var cache = new LRU({
+ max: 5,
+ length: function (item) { return item.length }
+ })
+
+ t.equal(cache.set("a", "A"), true)
+
+ // should return false for max exceeded
+ t.equal(cache.set("b", "donuts"), false)
+
+ t.equal(cache.set("b", "B"), true)
+ t.equal(cache.set("c", "CCCC"), true)
+ t.end()
+})
+
+test("drop the old items", function(t) {
+ var cache = new LRU({
+ max: 5,
+ maxAge: 50
+ })
+
+ cache.set("a", "A")
+
+ setTimeout(function () {
+ cache.set("b", "b")
+ t.equal(cache.get("a"), "A")
+ }, 25)
+
+ setTimeout(function () {
+ cache.set("c", "C")
+ // timed out
+ t.notOk(cache.get("a"))
+ }, 60)
+
+ setTimeout(function () {
+ t.notOk(cache.get("b"))
+ t.equal(cache.get("c"), "C")
+ }, 90)
+
+ setTimeout(function () {
+ t.notOk(cache.get("c"))
+ t.end()
+ }, 155)
+})
+
+test("disposal function", function(t) {
+ var disposed = false
+ var cache = new LRU({
+ max: 1,
+ dispose: function (k, n) {
+ disposed = n
+ }
+ })
+
+ cache.set(1, 1)
+ cache.set(2, 2)
+ t.equal(disposed, 1)
+ cache.set(3, 3)
+ t.equal(disposed, 2)
+ cache.reset()
+ t.equal(disposed, 3)
+ t.end()
+})
+
+test("disposal function on too big of item", function(t) {
+ var disposed = false
+ var cache = new LRU({
+ max: 1,
+ length: function (k) {
+ return k.length
+ },
+ dispose: function (k, n) {
+ disposed = n
+ }
+ })
+ var obj = [ 1, 2 ]
+
+ t.equal(disposed, false)
+ cache.set("obj", obj)
+ t.equal(disposed, obj)
+ t.end()
+})
+
+test("has()", function(t) {
+ var cache = new LRU({
+ max: 1,
+ maxAge: 10
+ })
+
+ cache.set('foo', 'bar')
+ t.equal(cache.has('foo'), true)
+ cache.set('blu', 'baz')
+ t.equal(cache.has('foo'), false)
+ t.equal(cache.has('blu'), true)
+ setTimeout(function() {
+ t.equal(cache.has('blu'), false)
+ t.end()
+ }, 15)
+})
+
+test("stale", function(t) {
+ var cache = new LRU({
+ maxAge: 10,
+ stale: true
+ })
+
+ cache.set('foo', 'bar')
+ t.equal(cache.get('foo'), 'bar')
+ t.equal(cache.has('foo'), true)
+ setTimeout(function() {
+ t.equal(cache.has('foo'), false)
+ t.equal(cache.get('foo'), 'bar')
+ t.equal(cache.get('foo'), undefined)
+ t.end()
+ }, 15)
+})
+
+test("lru update via set", function(t) {
+ var cache = LRU({ max: 2 });
+
+ cache.set('foo', 1);
+ cache.set('bar', 2);
+ cache.del('bar');
+ cache.set('baz', 3);
+ cache.set('qux', 4);
+
+ t.equal(cache.get('foo'), undefined)
+ t.equal(cache.get('bar'), undefined)
+ t.equal(cache.get('baz'), 3)
+ t.equal(cache.get('qux'), 4)
+ t.end()
+})
+
+test("least recently set w/ peek", function (t) {
+ var cache = new LRU(2)
+ cache.set("a", "A")
+ cache.set("b", "B")
+ t.equal(cache.peek("a"), "A")
+ cache.set("c", "C")
+ t.equal(cache.get("c"), "C")
+ t.equal(cache.get("b"), "B")
+ t.equal(cache.get("a"), undefined)
+ t.end()
+})
+
+test("pop the least used item", function (t) {
+ var cache = new LRU(3)
+ , last
+
+ cache.set("a", "A")
+ cache.set("b", "B")
+ cache.set("c", "C")
+
+ t.equal(cache.length, 3)
+ t.equal(cache.max, 3)
+
+ // Ensure we pop a, c, b
+ cache.get("b", "B")
+
+ last = cache.pop()
+ t.equal(last.key, "a")
+ t.equal(last.value, "A")
+ t.equal(cache.length, 2)
+ t.equal(cache.max, 3)
+
+ last = cache.pop()
+ t.equal(last.key, "c")
+ t.equal(last.value, "C")
+ t.equal(cache.length, 1)
+ t.equal(cache.max, 3)
+
+ last = cache.pop()
+ t.equal(last.key, "b")
+ t.equal(last.value, "B")
+ t.equal(cache.length, 0)
+ t.equal(cache.max, 3)
+
+ last = cache.pop()
+ t.equal(last, null)
+ t.equal(cache.length, 0)
+ t.equal(cache.max, 3)
+
+ t.end()
+})
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/lru-cache/test/foreach.js b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/lru-cache/test/foreach.js
new file mode 100644
index 0000000..eefb80d
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/lru-cache/test/foreach.js
@@ -0,0 +1,52 @@
+var test = require('tap').test
+var LRU = require('../')
+
+test('forEach', function (t) {
+ var l = new LRU(5)
+ for (var i = 0; i < 10; i ++) {
+ l.set(i.toString(), i.toString(2))
+ }
+
+ var i = 9
+ l.forEach(function (val, key, cache) {
+ t.equal(cache, l)
+ t.equal(key, i.toString())
+ t.equal(val, i.toString(2))
+ i -= 1
+ })
+
+ // get in order of most recently used
+ l.get(6)
+ l.get(8)
+
+ var order = [ 8, 6, 9, 7, 5 ]
+ var i = 0
+
+ l.forEach(function (val, key, cache) {
+ var j = order[i ++]
+ t.equal(cache, l)
+ t.equal(key, j.toString())
+ t.equal(val, j.toString(2))
+ })
+
+ t.end()
+})
+
+test('keys() and values()', function (t) {
+ var l = new LRU(5)
+ for (var i = 0; i < 10; i ++) {
+ l.set(i.toString(), i.toString(2))
+ }
+
+ t.similar(l.keys(), ['9', '8', '7', '6', '5'])
+ t.similar(l.values(), ['1001', '1000', '111', '110', '101'])
+
+ // get in order of most recently used
+ l.get(6)
+ l.get(8)
+
+ t.similar(l.keys(), ['8', '6', '9', '7', '5'])
+ t.similar(l.values(), ['1000', '110', '1001', '111', '101'])
+
+ t.end()
+})
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/lru-cache/test/memory-leak.js b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/lru-cache/test/memory-leak.js
new file mode 100644
index 0000000..7af45b0
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/lru-cache/test/memory-leak.js
@@ -0,0 +1,50 @@
+#!/usr/bin/env node --expose_gc
+
+var weak = require('weak');
+var test = require('tap').test
+var LRU = require('../')
+var l = new LRU({ max: 10 })
+var refs = 0
+function X() {
+ refs ++
+ weak(this, deref)
+}
+
+function deref() {
+ refs --
+}
+
+test('no leaks', function (t) {
+ // fill up the cache
+ for (var i = 0; i < 100; i++) {
+ l.set(i, new X);
+ // throw some gets in there, too.
+ if (i % 2 === 0)
+ l.get(i / 2)
+ }
+
+ gc()
+
+ var start = process.memoryUsage()
+
+ // capture the memory
+ var startRefs = refs
+
+ // do it again, but more
+ for (var i = 0; i < 10000; i++) {
+ l.set(i, new X);
+ // throw some gets in there, too.
+ if (i % 2 === 0)
+ l.get(i / 2)
+ }
+
+ gc()
+
+ var end = process.memoryUsage()
+ t.equal(refs, startRefs, 'no leaky refs')
+
+ console.error('start: %j\n' +
+ 'end: %j', start, end);
+ t.pass();
+ t.end();
+})
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/sigmund/LICENSE b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/sigmund/LICENSE
new file mode 100644
index 0000000..0c44ae7
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/sigmund/LICENSE
@@ -0,0 +1,27 @@
+Copyright (c) Isaac Z. Schlueter ("Author")
+All rights reserved.
+
+The BSD License
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+
+1. Redistributions of source code must retain the above copyright
+ notice, this list of conditions and the following disclaimer.
+
+2. Redistributions in binary form must reproduce the above copyright
+ notice, this list of conditions and the following disclaimer in the
+ documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS
+BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
+BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
+OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
+IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/sigmund/README.md b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/sigmund/README.md
new file mode 100644
index 0000000..7e36512
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/sigmund/README.md
@@ -0,0 +1,53 @@
+# sigmund
+
+Quick and dirty signatures for Objects.
+
+This is like a much faster `deepEquals` comparison, which returns a
+string key suitable for caches and the like.
+
+## Usage
+
+```javascript
+function doSomething (someObj) {
+ var key = sigmund(someObj, maxDepth) // max depth defaults to 10
+ var cached = cache.get(key)
+ if (cached) return cached)
+
+ var result = expensiveCalculation(someObj)
+ cache.set(key, result)
+ return result
+}
+```
+
+The resulting key will be as unique and reproducible as calling
+`JSON.stringify` or `util.inspect` on the object, but is much faster.
+In order to achieve this speed, some differences are glossed over.
+For example, the object `{0:'foo'}` will be treated identically to the
+array `['foo']`.
+
+Also, just as there is no way to summon the soul from the scribblings
+of a cocain-addled psychoanalyst, there is no way to revive the object
+from the signature string that sigmund gives you. In fact, it's
+barely even readable.
+
+As with `sys.inspect` and `JSON.stringify`, larger objects will
+produce larger signature strings.
+
+Because sigmund is a bit less strict than the more thorough
+alternatives, the strings will be shorter, and also there is a
+slightly higher chance for collisions. For example, these objects
+have the same signature:
+
+ var obj1 = {a:'b',c:/def/,g:['h','i',{j:'',k:'l'}]}
+ var obj2 = {a:'b',c:'/def/',g:['h','i','{jkl']}
+
+Like a good Freudian, sigmund is most effective when you already have
+some understanding of what you're looking for. It can help you help
+yourself, but you must be willing to do some work as well.
+
+Cycles are handled, and cyclical objects are silently omitted (though
+the key is included in the signature output.)
+
+The second argument is the maximum depth, which defaults to 10,
+because that is the maximum object traversal depth covered by most
+insurance carriers.
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/sigmund/bench.js b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/sigmund/bench.js
new file mode 100644
index 0000000..5acfd6d
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/sigmund/bench.js
@@ -0,0 +1,283 @@
+// different ways to id objects
+// use a req/res pair, since it's crazy deep and cyclical
+
+// sparseFE10 and sigmund are usually pretty close, which is to be expected,
+// since they are essentially the same algorithm, except that sigmund handles
+// regular expression objects properly.
+
+
+var http = require('http')
+var util = require('util')
+var sigmund = require('./sigmund.js')
+var sreq, sres, creq, cres, test
+
+http.createServer(function (q, s) {
+ sreq = q
+ sres = s
+ sres.end('ok')
+ this.close(function () { setTimeout(function () {
+ start()
+ }, 200) })
+}).listen(1337, function () {
+ creq = http.get({ port: 1337 })
+ creq.on('response', function (s) { cres = s })
+})
+
+function start () {
+ test = [sreq, sres, creq, cres]
+ // test = sreq
+ // sreq.sres = sres
+ // sreq.creq = creq
+ // sreq.cres = cres
+
+ for (var i in exports.compare) {
+ console.log(i)
+ var hash = exports.compare[i]()
+ console.log(hash)
+ console.log(hash.length)
+ console.log('')
+ }
+
+ require('bench').runMain()
+}
+
+function customWs (obj, md, d) {
+ d = d || 0
+ var to = typeof obj
+ if (to === 'undefined' || to === 'function' || to === null) return ''
+ if (d > md || !obj || to !== 'object') return ('' + obj).replace(/[\n ]+/g, '')
+
+ if (Array.isArray(obj)) {
+ return obj.map(function (i, _, __) {
+ return customWs(i, md, d + 1)
+ }).reduce(function (a, b) { return a + b }, '')
+ }
+
+ var keys = Object.keys(obj)
+ return keys.map(function (k, _, __) {
+ return k + ':' + customWs(obj[k], md, d + 1)
+ }).reduce(function (a, b) { return a + b }, '')
+}
+
+function custom (obj, md, d) {
+ d = d || 0
+ var to = typeof obj
+ if (to === 'undefined' || to === 'function' || to === null) return ''
+ if (d > md || !obj || to !== 'object') return '' + obj
+
+ if (Array.isArray(obj)) {
+ return obj.map(function (i, _, __) {
+ return custom(i, md, d + 1)
+ }).reduce(function (a, b) { return a + b }, '')
+ }
+
+ var keys = Object.keys(obj)
+ return keys.map(function (k, _, __) {
+ return k + ':' + custom(obj[k], md, d + 1)
+ }).reduce(function (a, b) { return a + b }, '')
+}
+
+function sparseFE2 (obj, maxDepth) {
+ var seen = []
+ var soFar = ''
+ function ch (v, depth) {
+ if (depth > maxDepth) return
+ if (typeof v === 'function' || typeof v === 'undefined') return
+ if (typeof v !== 'object' || !v) {
+ soFar += v
+ return
+ }
+ if (seen.indexOf(v) !== -1 || depth === maxDepth) return
+ seen.push(v)
+ soFar += '{'
+ Object.keys(v).forEach(function (k, _, __) {
+ // pseudo-private values. skip those.
+ if (k.charAt(0) === '_') return
+ var to = typeof v[k]
+ if (to === 'function' || to === 'undefined') return
+ soFar += k + ':'
+ ch(v[k], depth + 1)
+ })
+ soFar += '}'
+ }
+ ch(obj, 0)
+ return soFar
+}
+
+function sparseFE (obj, maxDepth) {
+ var seen = []
+ var soFar = ''
+ function ch (v, depth) {
+ if (depth > maxDepth) return
+ if (typeof v === 'function' || typeof v === 'undefined') return
+ if (typeof v !== 'object' || !v) {
+ soFar += v
+ return
+ }
+ if (seen.indexOf(v) !== -1 || depth === maxDepth) return
+ seen.push(v)
+ soFar += '{'
+ Object.keys(v).forEach(function (k, _, __) {
+ // pseudo-private values. skip those.
+ if (k.charAt(0) === '_') return
+ var to = typeof v[k]
+ if (to === 'function' || to === 'undefined') return
+ soFar += k
+ ch(v[k], depth + 1)
+ })
+ }
+ ch(obj, 0)
+ return soFar
+}
+
+function sparse (obj, maxDepth) {
+ var seen = []
+ var soFar = ''
+ function ch (v, depth) {
+ if (depth > maxDepth) return
+ if (typeof v === 'function' || typeof v === 'undefined') return
+ if (typeof v !== 'object' || !v) {
+ soFar += v
+ return
+ }
+ if (seen.indexOf(v) !== -1 || depth === maxDepth) return
+ seen.push(v)
+ soFar += '{'
+ for (var k in v) {
+ // pseudo-private values. skip those.
+ if (k.charAt(0) === '_') continue
+ var to = typeof v[k]
+ if (to === 'function' || to === 'undefined') continue
+ soFar += k
+ ch(v[k], depth + 1)
+ }
+ }
+ ch(obj, 0)
+ return soFar
+}
+
+function noCommas (obj, maxDepth) {
+ var seen = []
+ var soFar = ''
+ function ch (v, depth) {
+ if (depth > maxDepth) return
+ if (typeof v === 'function' || typeof v === 'undefined') return
+ if (typeof v !== 'object' || !v) {
+ soFar += v
+ return
+ }
+ if (seen.indexOf(v) !== -1 || depth === maxDepth) return
+ seen.push(v)
+ soFar += '{'
+ for (var k in v) {
+ // pseudo-private values. skip those.
+ if (k.charAt(0) === '_') continue
+ var to = typeof v[k]
+ if (to === 'function' || to === 'undefined') continue
+ soFar += k + ':'
+ ch(v[k], depth + 1)
+ }
+ soFar += '}'
+ }
+ ch(obj, 0)
+ return soFar
+}
+
+
+function flatten (obj, maxDepth) {
+ var seen = []
+ var soFar = ''
+ function ch (v, depth) {
+ if (depth > maxDepth) return
+ if (typeof v === 'function' || typeof v === 'undefined') return
+ if (typeof v !== 'object' || !v) {
+ soFar += v
+ return
+ }
+ if (seen.indexOf(v) !== -1 || depth === maxDepth) return
+ seen.push(v)
+ soFar += '{'
+ for (var k in v) {
+ // pseudo-private values. skip those.
+ if (k.charAt(0) === '_') continue
+ var to = typeof v[k]
+ if (to === 'function' || to === 'undefined') continue
+ soFar += k + ':'
+ ch(v[k], depth + 1)
+ soFar += ','
+ }
+ soFar += '}'
+ }
+ ch(obj, 0)
+ return soFar
+}
+
+exports.compare =
+{
+ // 'custom 2': function () {
+ // return custom(test, 2, 0)
+ // },
+ // 'customWs 2': function () {
+ // return customWs(test, 2, 0)
+ // },
+ 'JSON.stringify (guarded)': function () {
+ var seen = []
+ return JSON.stringify(test, function (k, v) {
+ if (typeof v !== 'object' || !v) return v
+ if (seen.indexOf(v) !== -1) return undefined
+ seen.push(v)
+ return v
+ })
+ },
+
+ 'flatten 10': function () {
+ return flatten(test, 10)
+ },
+
+ // 'flattenFE 10': function () {
+ // return flattenFE(test, 10)
+ // },
+
+ 'noCommas 10': function () {
+ return noCommas(test, 10)
+ },
+
+ 'sparse 10': function () {
+ return sparse(test, 10)
+ },
+
+ 'sparseFE 10': function () {
+ return sparseFE(test, 10)
+ },
+
+ 'sparseFE2 10': function () {
+ return sparseFE2(test, 10)
+ },
+
+ sigmund: function() {
+ return sigmund(test, 10)
+ },
+
+
+ // 'util.inspect 1': function () {
+ // return util.inspect(test, false, 1, false)
+ // },
+ // 'util.inspect undefined': function () {
+ // util.inspect(test)
+ // },
+ // 'util.inspect 2': function () {
+ // util.inspect(test, false, 2, false)
+ // },
+ // 'util.inspect 3': function () {
+ // util.inspect(test, false, 3, false)
+ // },
+ // 'util.inspect 4': function () {
+ // util.inspect(test, false, 4, false)
+ // },
+ // 'util.inspect Infinity': function () {
+ // util.inspect(test, false, Infinity, false)
+ // }
+}
+
+/** results
+**/
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/sigmund/package.json b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/sigmund/package.json
new file mode 100644
index 0000000..25e9658
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/sigmund/package.json
@@ -0,0 +1,58 @@
+{
+ "name": "sigmund",
+ "version": "1.0.0",
+ "description": "Quick and dirty signatures for Objects.",
+ "main": "sigmund.js",
+ "directories": {
+ "test": "test"
+ },
+ "dependencies": {},
+ "devDependencies": {
+ "tap": "~0.3.0"
+ },
+ "scripts": {
+ "test": "tap test/*.js",
+ "bench": "node bench.js"
+ },
+ "repository": {
+ "type": "git",
+ "url": "git://github.com/isaacs/sigmund"
+ },
+ "keywords": [
+ "object",
+ "signature",
+ "key",
+ "data",
+ "psychoanalysis"
+ ],
+ "author": {
+ "name": "Isaac Z. Schlueter",
+ "email": "i@izs.me",
+ "url": "http://blog.izs.me/"
+ },
+ "license": "BSD",
+ "readme": "# sigmund\n\nQuick and dirty signatures for Objects.\n\nThis is like a much faster `deepEquals` comparison, which returns a\nstring key suitable for caches and the like.\n\n## Usage\n\n```javascript\nfunction doSomething (someObj) {\n var key = sigmund(someObj, maxDepth) // max depth defaults to 10\n var cached = cache.get(key)\n if (cached) return cached)\n\n var result = expensiveCalculation(someObj)\n cache.set(key, result)\n return result\n}\n```\n\nThe resulting key will be as unique and reproducible as calling\n`JSON.stringify` or `util.inspect` on the object, but is much faster.\nIn order to achieve this speed, some differences are glossed over.\nFor example, the object `{0:'foo'}` will be treated identically to the\narray `['foo']`.\n\nAlso, just as there is no way to summon the soul from the scribblings\nof a cocain-addled psychoanalyst, there is no way to revive the object\nfrom the signature string that sigmund gives you. In fact, it's\nbarely even readable.\n\nAs with `sys.inspect` and `JSON.stringify`, larger objects will\nproduce larger signature strings.\n\nBecause sigmund is a bit less strict than the more thorough\nalternatives, the strings will be shorter, and also there is a\nslightly higher chance for collisions. For example, these objects\nhave the same signature:\n\n var obj1 = {a:'b',c:/def/,g:['h','i',{j:'',k:'l'}]}\n var obj2 = {a:'b',c:'/def/',g:['h','i','{jkl']}\n\nLike a good Freudian, sigmund is most effective when you already have\nsome understanding of what you're looking for. It can help you help\nyourself, but you must be willing to do some work as well.\n\nCycles are handled, and cyclical objects are silently omitted (though\nthe key is included in the signature output.)\n\nThe second argument is the maximum depth, which defaults to 10,\nbecause that is the maximum object traversal depth covered by most\ninsurance carriers.\n",
+ "_id": "sigmund@1.0.0",
+ "dist": {
+ "shasum": "66a2b3a749ae8b5fb89efd4fcc01dc94fbe02296",
+ "tarball": "http://registry.npmjs.org/sigmund/-/sigmund-1.0.0.tgz"
+ },
+ "_npmVersion": "1.1.48",
+ "_npmUser": {
+ "name": "isaacs",
+ "email": "i@izs.me"
+ },
+ "maintainers": [
+ {
+ "name": "isaacs",
+ "email": "i@izs.me"
+ }
+ ],
+ "_shasum": "66a2b3a749ae8b5fb89efd4fcc01dc94fbe02296",
+ "_from": "sigmund@>=1.0.0 <1.1.0",
+ "_resolved": "https://registry.npmjs.org/sigmund/-/sigmund-1.0.0.tgz",
+ "bugs": {
+ "url": "https://github.com/isaacs/sigmund/issues"
+ },
+ "homepage": "https://github.com/isaacs/sigmund"
+}
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/sigmund/sigmund.js b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/sigmund/sigmund.js
new file mode 100644
index 0000000..82c7ab8
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/sigmund/sigmund.js
@@ -0,0 +1,39 @@
+module.exports = sigmund
+function sigmund (subject, maxSessions) {
+ maxSessions = maxSessions || 10;
+ var notes = [];
+ var analysis = '';
+ var RE = RegExp;
+
+ function psychoAnalyze (subject, session) {
+ if (session > maxSessions) return;
+
+ if (typeof subject === 'function' ||
+ typeof subject === 'undefined') {
+ return;
+ }
+
+ if (typeof subject !== 'object' || !subject ||
+ (subject instanceof RE)) {
+ analysis += subject;
+ return;
+ }
+
+ if (notes.indexOf(subject) !== -1 || session === maxSessions) return;
+
+ notes.push(subject);
+ analysis += '{';
+ Object.keys(subject).forEach(function (issue, _, __) {
+ // pseudo-private values. skip those.
+ if (issue.charAt(0) === '_') return;
+ var to = typeof subject[issue];
+ if (to === 'function' || to === 'undefined') return;
+ analysis += issue;
+ psychoAnalyze(subject[issue], session + 1);
+ });
+ }
+ psychoAnalyze(subject, 0);
+ return analysis;
+}
+
+// vim: set softtabstop=4 shiftwidth=4:
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/sigmund/test/basic.js b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/sigmund/test/basic.js
new file mode 100644
index 0000000..50c53a1
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/node_modules/sigmund/test/basic.js
@@ -0,0 +1,24 @@
+var test = require('tap').test
+var sigmund = require('../sigmund.js')
+
+
+// occasionally there are duplicates
+// that's an acceptable edge-case. JSON.stringify and util.inspect
+// have some collision potential as well, though less, and collision
+// detection is expensive.
+var hash = '{abc/def/g{0h1i2{jkl'
+var obj1 = {a:'b',c:/def/,g:['h','i',{j:'',k:'l'}]}
+var obj2 = {a:'b',c:'/def/',g:['h','i','{jkl']}
+
+var obj3 = JSON.parse(JSON.stringify(obj1))
+obj3.c = /def/
+obj3.g[2].cycle = obj3
+var cycleHash = '{abc/def/g{0h1i2{jklcycle'
+
+test('basic', function (t) {
+ t.equal(sigmund(obj1), hash)
+ t.equal(sigmund(obj2), hash)
+ t.equal(sigmund(obj3), cycleHash)
+ t.end()
+})
+
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/package.json b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/package.json
new file mode 100644
index 0000000..b0691e5
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/package.json
@@ -0,0 +1,57 @@
+{
+ "author": {
+ "name": "Isaac Z. Schlueter",
+ "email": "i@izs.me",
+ "url": "http://blog.izs.me"
+ },
+ "name": "minimatch",
+ "description": "a glob matcher in javascript",
+ "version": "0.3.0",
+ "repository": {
+ "type": "git",
+ "url": "git://github.com/isaacs/minimatch.git"
+ },
+ "main": "minimatch.js",
+ "scripts": {
+ "test": "tap test/*.js"
+ },
+ "engines": {
+ "node": "*"
+ },
+ "dependencies": {
+ "lru-cache": "2",
+ "sigmund": "~1.0.0"
+ },
+ "devDependencies": {
+ "tap": ""
+ },
+ "license": {
+ "type": "MIT",
+ "url": "http://github.com/isaacs/minimatch/raw/master/LICENSE"
+ },
+ "bugs": {
+ "url": "https://github.com/isaacs/minimatch/issues"
+ },
+ "homepage": "https://github.com/isaacs/minimatch",
+ "_id": "minimatch@0.3.0",
+ "_shasum": "275d8edaac4f1bb3326472089e7949c8394699dd",
+ "_from": "minimatch@>=0.3.0 <0.4.0",
+ "_npmVersion": "1.4.10",
+ "_npmUser": {
+ "name": "isaacs",
+ "email": "i@izs.me"
+ },
+ "maintainers": [
+ {
+ "name": "isaacs",
+ "email": "i@izs.me"
+ }
+ ],
+ "dist": {
+ "shasum": "275d8edaac4f1bb3326472089e7949c8394699dd",
+ "tarball": "http://registry.npmjs.org/minimatch/-/minimatch-0.3.0.tgz"
+ },
+ "directories": {},
+ "_resolved": "https://registry.npmjs.org/minimatch/-/minimatch-0.3.0.tgz",
+ "readme": "ERROR: No README data found!"
+}
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/test/basic.js b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/test/basic.js
new file mode 100644
index 0000000..ae7ac73
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/test/basic.js
@@ -0,0 +1,399 @@
+// http://www.bashcookbook.com/bashinfo/source/bash-1.14.7/tests/glob-test
+//
+// TODO: Some of these tests do very bad things with backslashes, and will
+// most likely fail badly on windows. They should probably be skipped.
+
+var tap = require("tap")
+ , globalBefore = Object.keys(global)
+ , mm = require("../")
+ , files = [ "a", "b", "c", "d", "abc"
+ , "abd", "abe", "bb", "bcd"
+ , "ca", "cb", "dd", "de"
+ , "bdir/", "bdir/cfile"]
+ , next = files.concat([ "a-b", "aXb"
+ , ".x", ".y" ])
+
+
+var patterns =
+ [ "http://www.bashcookbook.com/bashinfo/source/bash-1.14.7/tests/glob-test"
+ , ["a*", ["a", "abc", "abd", "abe"]]
+ , ["X*", ["X*"], {nonull: true}]
+
+ // allow null glob expansion
+ , ["X*", []]
+
+ // isaacs: Slightly different than bash/sh/ksh
+ // \\* is not un-escaped to literal "*" in a failed match,
+ // but it does make it get treated as a literal star
+ , ["\\*", ["\\*"], {nonull: true}]
+ , ["\\**", ["\\**"], {nonull: true}]
+ , ["\\*\\*", ["\\*\\*"], {nonull: true}]
+
+ , ["b*/", ["bdir/"]]
+ , ["c*", ["c", "ca", "cb"]]
+ , ["**", files]
+
+ , ["\\.\\./*/", ["\\.\\./*/"], {nonull: true}]
+ , ["s/\\..*//", ["s/\\..*//"], {nonull: true}]
+
+ , "legendary larry crashes bashes"
+ , ["/^root:/{s/^[^:]*:[^:]*:\([^:]*\).*$/\\1/"
+ , ["/^root:/{s/^[^:]*:[^:]*:\([^:]*\).*$/\\1/"], {nonull: true}]
+ , ["/^root:/{s/^[^:]*:[^:]*:\([^:]*\).*$/\1/"
+ , ["/^root:/{s/^[^:]*:[^:]*:\([^:]*\).*$/\1/"], {nonull: true}]
+
+ , "character classes"
+ , ["[a-c]b*", ["abc", "abd", "abe", "bb", "cb"]]
+ , ["[a-y]*[^c]", ["abd", "abe", "bb", "bcd",
+ "bdir/", "ca", "cb", "dd", "de"]]
+ , ["a*[^c]", ["abd", "abe"]]
+ , function () { files.push("a-b", "aXb") }
+ , ["a[X-]b", ["a-b", "aXb"]]
+ , function () { files.push(".x", ".y") }
+ , ["[^a-c]*", ["d", "dd", "de"]]
+ , function () { files.push("a*b/", "a*b/ooo") }
+ , ["a\\*b/*", ["a*b/ooo"]]
+ , ["a\\*?/*", ["a*b/ooo"]]
+ , ["*\\\\!*", [], {null: true}, ["echo !7"]]
+ , ["*\\!*", ["echo !7"], null, ["echo !7"]]
+ , ["*.\\*", ["r.*"], null, ["r.*"]]
+ , ["a[b]c", ["abc"]]
+ , ["a[\\b]c", ["abc"]]
+ , ["a?c", ["abc"]]
+ , ["a\\*c", [], {null: true}, ["abc"]]
+ , ["", [""], { null: true }, [""]]
+
+ , "http://www.opensource.apple.com/source/bash/bash-23/" +
+ "bash/tests/glob-test"
+ , function () { files.push("man/", "man/man1/", "man/man1/bash.1") }
+ , ["*/man*/bash.*", ["man/man1/bash.1"]]
+ , ["man/man1/bash.1", ["man/man1/bash.1"]]
+ , ["a***c", ["abc"], null, ["abc"]]
+ , ["a*****?c", ["abc"], null, ["abc"]]
+ , ["?*****??", ["abc"], null, ["abc"]]
+ , ["*****??", ["abc"], null, ["abc"]]
+ , ["?*****?c", ["abc"], null, ["abc"]]
+ , ["?***?****c", ["abc"], null, ["abc"]]
+ , ["?***?****?", ["abc"], null, ["abc"]]
+ , ["?***?****", ["abc"], null, ["abc"]]
+ , ["*******c", ["abc"], null, ["abc"]]
+ , ["*******?", ["abc"], null, ["abc"]]
+ , ["a*cd**?**??k", ["abcdecdhjk"], null, ["abcdecdhjk"]]
+ , ["a**?**cd**?**??k", ["abcdecdhjk"], null, ["abcdecdhjk"]]
+ , ["a**?**cd**?**??k***", ["abcdecdhjk"], null, ["abcdecdhjk"]]
+ , ["a**?**cd**?**??***k", ["abcdecdhjk"], null, ["abcdecdhjk"]]
+ , ["a**?**cd**?**??***k**", ["abcdecdhjk"], null, ["abcdecdhjk"]]
+ , ["a****c**?**??*****", ["abcdecdhjk"], null, ["abcdecdhjk"]]
+ , ["[-abc]", ["-"], null, ["-"]]
+ , ["[abc-]", ["-"], null, ["-"]]
+ , ["\\", ["\\"], null, ["\\"]]
+ , ["[\\\\]", ["\\"], null, ["\\"]]
+ , ["[[]", ["["], null, ["["]]
+ , ["[", ["["], null, ["["]]
+ , ["[*", ["[abc"], null, ["[abc"]]
+ , "a right bracket shall lose its special meaning and\n" +
+ "represent itself in a bracket expression if it occurs\n" +
+ "first in the list. -- POSIX.2 2.8.3.2"
+ , ["[]]", ["]"], null, ["]"]]
+ , ["[]-]", ["]"], null, ["]"]]
+ , ["[a-\z]", ["p"], null, ["p"]]
+ , ["??**********?****?", [], { null: true }, ["abc"]]
+ , ["??**********?****c", [], { null: true }, ["abc"]]
+ , ["?************c****?****", [], { null: true }, ["abc"]]
+ , ["*c*?**", [], { null: true }, ["abc"]]
+ , ["a*****c*?**", [], { null: true }, ["abc"]]
+ , ["a********???*******", [], { null: true }, ["abc"]]
+ , ["[]", [], { null: true }, ["a"]]
+ , ["[abc", [], { null: true }, ["["]]
+
+ , "nocase tests"
+ , ["XYZ", ["xYz"], { nocase: true, null: true }
+ , ["xYz", "ABC", "IjK"]]
+ , ["ab*", ["ABC"], { nocase: true, null: true }
+ , ["xYz", "ABC", "IjK"]]
+ , ["[ia]?[ck]", ["ABC", "IjK"], { nocase: true, null: true }
+ , ["xYz", "ABC", "IjK"]]
+
+ // [ pattern, [matches], MM opts, files, TAP opts]
+ , "onestar/twostar"
+ , ["{/*,*}", [], {null: true}, ["/asdf/asdf/asdf"]]
+ , ["{/?,*}", ["/a", "bb"], {null: true}
+ , ["/a", "/b/b", "/a/b/c", "bb"]]
+
+ , "dots should not match unless requested"
+ , ["**", ["a/b"], {}, ["a/b", "a/.d", ".a/.d"]]
+
+ // .. and . can only match patterns starting with .,
+ // even when options.dot is set.
+ , function () {
+ files = ["a/./b", "a/../b", "a/c/b", "a/.d/b"]
+ }
+ , ["a/*/b", ["a/c/b", "a/.d/b"], {dot: true}]
+ , ["a/.*/b", ["a/./b", "a/../b", "a/.d/b"], {dot: true}]
+ , ["a/*/b", ["a/c/b"], {dot:false}]
+ , ["a/.*/b", ["a/./b", "a/../b", "a/.d/b"], {dot: false}]
+
+
+ // this also tests that changing the options needs
+ // to change the cache key, even if the pattern is
+ // the same!
+ , ["**", ["a/b","a/.d",".a/.d"], { dot: true }
+ , [ ".a/.d", "a/.d", "a/b"]]
+
+ , "paren sets cannot contain slashes"
+ , ["*(a/b)", ["*(a/b)"], {nonull: true}, ["a/b"]]
+
+ // brace sets trump all else.
+ //
+ // invalid glob pattern. fails on bash4 and bsdglob.
+ // however, in this implementation, it's easier just
+ // to do the intuitive thing, and let brace-expansion
+ // actually come before parsing any extglob patterns,
+ // like the documentation seems to say.
+ //
+ // XXX: if anyone complains about this, either fix it
+ // or tell them to grow up and stop complaining.
+ //
+ // bash/bsdglob says this:
+ // , ["*(a|{b),c)}", ["*(a|{b),c)}"], {}, ["a", "ab", "ac", "ad"]]
+ // but we do this instead:
+ , ["*(a|{b),c)}", ["a", "ab", "ac"], {}, ["a", "ab", "ac", "ad"]]
+
+ // test partial parsing in the presence of comment/negation chars
+ , ["[!a*", ["[!ab"], {}, ["[!ab", "[ab"]]
+ , ["[#a*", ["[#ab"], {}, ["[#ab", "[ab"]]
+
+ // like: {a,b|c\\,d\\\|e} except it's unclosed, so it has to be escaped.
+ , ["+(a|*\\|c\\\\|d\\\\\\|e\\\\\\\\|f\\\\\\\\\\|g"
+ , ["+(a|b\\|c\\\\|d\\\\|e\\\\\\\\|f\\\\\\\\|g"]
+ , {}
+ , ["+(a|b\\|c\\\\|d\\\\|e\\\\\\\\|f\\\\\\\\|g", "a", "b\\c"]]
+
+
+ // crazy nested {,,} and *(||) tests.
+ , function () {
+ files = [ "a", "b", "c", "d"
+ , "ab", "ac", "ad"
+ , "bc", "cb"
+ , "bc,d", "c,db", "c,d"
+ , "d)", "(b|c", "*(b|c"
+ , "b|c", "b|cc", "cb|c"
+ , "x(a|b|c)", "x(a|c)"
+ , "(a|b|c)", "(a|c)"]
+ }
+ , ["*(a|{b,c})", ["a", "b", "c", "ab", "ac"]]
+ , ["{a,*(b|c,d)}", ["a","(b|c", "*(b|c", "d)"]]
+ // a
+ // *(b|c)
+ // *(b|d)
+ , ["{a,*(b|{c,d})}", ["a","b", "bc", "cb", "c", "d"]]
+ , ["*(a|{b|c,c})", ["a", "b", "c", "ab", "ac", "bc", "cb"]]
+
+
+ // test various flag settings.
+ , [ "*(a|{b|c,c})", ["x(a|b|c)", "x(a|c)", "(a|b|c)", "(a|c)"]
+ , { noext: true } ]
+ , ["a?b", ["x/y/acb", "acb/"], {matchBase: true}
+ , ["x/y/acb", "acb/", "acb/d/e", "x/y/acb/d"] ]
+ , ["#*", ["#a", "#b"], {nocomment: true}, ["#a", "#b", "c#d"]]
+
+
+ // begin channelling Boole and deMorgan...
+ , "negation tests"
+ , function () {
+ files = ["d", "e", "!ab", "!abc", "a!b", "\\!a"]
+ }
+
+ // anything that is NOT a* matches.
+ , ["!a*", ["\\!a", "d", "e", "!ab", "!abc"]]
+
+ // anything that IS !a* matches.
+ , ["!a*", ["!ab", "!abc"], {nonegate: true}]
+
+ // anything that IS a* matches
+ , ["!!a*", ["a!b"]]
+
+ // anything that is NOT !a* matches
+ , ["!\\!a*", ["a!b", "d", "e", "\\!a"]]
+
+ // negation nestled within a pattern
+ , function () {
+ files = [ "foo.js"
+ , "foo.bar"
+ // can't match this one without negative lookbehind.
+ , "foo.js.js"
+ , "blar.js"
+ , "foo."
+ , "boo.js.boo" ]
+ }
+ , ["*.!(js)", ["foo.bar", "foo.", "boo.js.boo"] ]
+
+ // https://github.com/isaacs/minimatch/issues/5
+ , function () {
+ files = [ 'a/b/.x/c'
+ , 'a/b/.x/c/d'
+ , 'a/b/.x/c/d/e'
+ , 'a/b/.x'
+ , 'a/b/.x/'
+ , 'a/.x/b'
+ , '.x'
+ , '.x/'
+ , '.x/a'
+ , '.x/a/b'
+ , 'a/.x/b/.x/c'
+ , '.x/.x' ]
+ }
+ , ["**/.x/**", [ '.x/'
+ , '.x/a'
+ , '.x/a/b'
+ , 'a/.x/b'
+ , 'a/b/.x/'
+ , 'a/b/.x/c'
+ , 'a/b/.x/c/d'
+ , 'a/b/.x/c/d/e' ] ]
+
+ ]
+
+var regexps =
+ [ '/^(?:(?=.)a[^/]*?)$/',
+ '/^(?:(?=.)X[^/]*?)$/',
+ '/^(?:(?=.)X[^/]*?)$/',
+ '/^(?:\\*)$/',
+ '/^(?:(?=.)\\*[^/]*?)$/',
+ '/^(?:\\*\\*)$/',
+ '/^(?:(?=.)b[^/]*?\\/)$/',
+ '/^(?:(?=.)c[^/]*?)$/',
+ '/^(?:(?:(?!(?:\\/|^)\\.).)*?)$/',
+ '/^(?:\\.\\.\\/(?!\\.)(?=.)[^/]*?\\/)$/',
+ '/^(?:s\\/(?=.)\\.\\.[^/]*?\\/)$/',
+ '/^(?:\\/\\^root:\\/\\{s\\/(?=.)\\^[^:][^/]*?:[^:][^/]*?:\\([^:]\\)[^/]*?\\.[^/]*?\\$\\/1\\/)$/',
+ '/^(?:\\/\\^root:\\/\\{s\\/(?=.)\\^[^:][^/]*?:[^:][^/]*?:\\([^:]\\)[^/]*?\\.[^/]*?\\$\\/\u0001\\/)$/',
+ '/^(?:(?!\\.)(?=.)[a-c]b[^/]*?)$/',
+ '/^(?:(?!\\.)(?=.)[a-y][^/]*?[^c])$/',
+ '/^(?:(?=.)a[^/]*?[^c])$/',
+ '/^(?:(?=.)a[X-]b)$/',
+ '/^(?:(?!\\.)(?=.)[^a-c][^/]*?)$/',
+ '/^(?:a\\*b\\/(?!\\.)(?=.)[^/]*?)$/',
+ '/^(?:(?=.)a\\*[^/]\\/(?!\\.)(?=.)[^/]*?)$/',
+ '/^(?:(?!\\.)(?=.)[^/]*?\\\\\\![^/]*?)$/',
+ '/^(?:(?!\\.)(?=.)[^/]*?\\![^/]*?)$/',
+ '/^(?:(?!\\.)(?=.)[^/]*?\\.\\*)$/',
+ '/^(?:(?=.)a[b]c)$/',
+ '/^(?:(?=.)a[b]c)$/',
+ '/^(?:(?=.)a[^/]c)$/',
+ '/^(?:a\\*c)$/',
+ 'false',
+ '/^(?:(?!\\.)(?=.)[^/]*?\\/(?=.)man[^/]*?\\/(?=.)bash\\.[^/]*?)$/',
+ '/^(?:man\\/man1\\/bash\\.1)$/',
+ '/^(?:(?=.)a[^/]*?[^/]*?[^/]*?c)$/',
+ '/^(?:(?=.)a[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]c)$/',
+ '/^(?:(?!\\.)(?=.)[^/][^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/][^/])$/',
+ '/^(?:(?!\\.)(?=.)[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/][^/])$/',
+ '/^(?:(?!\\.)(?=.)[^/][^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]c)$/',
+ '/^(?:(?!\\.)(?=.)[^/][^/]*?[^/]*?[^/]*?[^/][^/]*?[^/]*?[^/]*?[^/]*?c)$/',
+ '/^(?:(?!\\.)(?=.)[^/][^/]*?[^/]*?[^/]*?[^/][^/]*?[^/]*?[^/]*?[^/]*?[^/])$/',
+ '/^(?:(?!\\.)(?=.)[^/][^/]*?[^/]*?[^/]*?[^/][^/]*?[^/]*?[^/]*?[^/]*?)$/',
+ '/^(?:(?!\\.)(?=.)[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?c)$/',
+ '/^(?:(?!\\.)(?=.)[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/])$/',
+ '/^(?:(?=.)a[^/]*?cd[^/]*?[^/]*?[^/][^/]*?[^/]*?[^/][^/]k)$/',
+ '/^(?:(?=.)a[^/]*?[^/]*?[^/][^/]*?[^/]*?cd[^/]*?[^/]*?[^/][^/]*?[^/]*?[^/][^/]k)$/',
+ '/^(?:(?=.)a[^/]*?[^/]*?[^/][^/]*?[^/]*?cd[^/]*?[^/]*?[^/][^/]*?[^/]*?[^/][^/]k[^/]*?[^/]*?[^/]*?)$/',
+ '/^(?:(?=.)a[^/]*?[^/]*?[^/][^/]*?[^/]*?cd[^/]*?[^/]*?[^/][^/]*?[^/]*?[^/][^/][^/]*?[^/]*?[^/]*?k)$/',
+ '/^(?:(?=.)a[^/]*?[^/]*?[^/][^/]*?[^/]*?cd[^/]*?[^/]*?[^/][^/]*?[^/]*?[^/][^/][^/]*?[^/]*?[^/]*?k[^/]*?[^/]*?)$/',
+ '/^(?:(?=.)a[^/]*?[^/]*?[^/]*?[^/]*?c[^/]*?[^/]*?[^/][^/]*?[^/]*?[^/][^/][^/]*?[^/]*?[^/]*?[^/]*?[^/]*?)$/',
+ '/^(?:(?!\\.)(?=.)[-abc])$/',
+ '/^(?:(?!\\.)(?=.)[abc-])$/',
+ '/^(?:\\\\)$/',
+ '/^(?:(?!\\.)(?=.)[\\\\])$/',
+ '/^(?:(?!\\.)(?=.)[\\[])$/',
+ '/^(?:\\[)$/',
+ '/^(?:(?=.)\\[(?!\\.)(?=.)[^/]*?)$/',
+ '/^(?:(?!\\.)(?=.)[\\]])$/',
+ '/^(?:(?!\\.)(?=.)[\\]-])$/',
+ '/^(?:(?!\\.)(?=.)[a-z])$/',
+ '/^(?:(?!\\.)(?=.)[^/][^/][^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/][^/]*?[^/]*?[^/]*?[^/]*?[^/])$/',
+ '/^(?:(?!\\.)(?=.)[^/][^/][^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/][^/]*?[^/]*?[^/]*?[^/]*?c)$/',
+ '/^(?:(?!\\.)(?=.)[^/][^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?c[^/]*?[^/]*?[^/]*?[^/]*?[^/][^/]*?[^/]*?[^/]*?[^/]*?)$/',
+ '/^(?:(?!\\.)(?=.)[^/]*?c[^/]*?[^/][^/]*?[^/]*?)$/',
+ '/^(?:(?=.)a[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?c[^/]*?[^/][^/]*?[^/]*?)$/',
+ '/^(?:(?=.)a[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/][^/][^/][^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?)$/',
+ '/^(?:\\[\\])$/',
+ '/^(?:\\[abc)$/',
+ '/^(?:(?=.)XYZ)$/i',
+ '/^(?:(?=.)ab[^/]*?)$/i',
+ '/^(?:(?!\\.)(?=.)[ia][^/][ck])$/i',
+ '/^(?:\\/(?!\\.)(?=.)[^/]*?|(?!\\.)(?=.)[^/]*?)$/',
+ '/^(?:\\/(?!\\.)(?=.)[^/]|(?!\\.)(?=.)[^/]*?)$/',
+ '/^(?:(?:(?!(?:\\/|^)\\.).)*?)$/',
+ '/^(?:a\\/(?!(?:^|\\/)\\.{1,2}(?:$|\\/))(?=.)[^/]*?\\/b)$/',
+ '/^(?:a\\/(?=.)\\.[^/]*?\\/b)$/',
+ '/^(?:a\\/(?!\\.)(?=.)[^/]*?\\/b)$/',
+ '/^(?:a\\/(?=.)\\.[^/]*?\\/b)$/',
+ '/^(?:(?:(?!(?:\\/|^)(?:\\.{1,2})($|\\/)).)*?)$/',
+ '/^(?:(?!\\.)(?=.)[^/]*?\\(a\\/b\\))$/',
+ '/^(?:(?!\\.)(?=.)(?:a|b)*|(?!\\.)(?=.)(?:a|c)*)$/',
+ '/^(?:(?=.)\\[(?=.)\\!a[^/]*?)$/',
+ '/^(?:(?=.)\\[(?=.)#a[^/]*?)$/',
+ '/^(?:(?=.)\\+\\(a\\|[^/]*?\\|c\\\\\\\\\\|d\\\\\\\\\\|e\\\\\\\\\\\\\\\\\\|f\\\\\\\\\\\\\\\\\\|g)$/',
+ '/^(?:(?!\\.)(?=.)(?:a|b)*|(?!\\.)(?=.)(?:a|c)*)$/',
+ '/^(?:a|(?!\\.)(?=.)[^/]*?\\(b\\|c|d\\))$/',
+ '/^(?:a|(?!\\.)(?=.)(?:b|c)*|(?!\\.)(?=.)(?:b|d)*)$/',
+ '/^(?:(?!\\.)(?=.)(?:a|b|c)*|(?!\\.)(?=.)(?:a|c)*)$/',
+ '/^(?:(?!\\.)(?=.)[^/]*?\\(a\\|b\\|c\\)|(?!\\.)(?=.)[^/]*?\\(a\\|c\\))$/',
+ '/^(?:(?=.)a[^/]b)$/',
+ '/^(?:(?=.)#[^/]*?)$/',
+ '/^(?!^(?:(?=.)a[^/]*?)$).*$/',
+ '/^(?:(?=.)\\!a[^/]*?)$/',
+ '/^(?:(?=.)a[^/]*?)$/',
+ '/^(?!^(?:(?=.)\\!a[^/]*?)$).*$/',
+ '/^(?:(?!\\.)(?=.)[^/]*?\\.(?:(?!js)[^/]*?))$/',
+ '/^(?:(?:(?!(?:\\/|^)\\.).)*?\\/\\.x\\/(?:(?!(?:\\/|^)\\.).)*?)$/' ]
+var re = 0;
+
+tap.test("basic tests", function (t) {
+ var start = Date.now()
+
+ // [ pattern, [matches], MM opts, files, TAP opts]
+ patterns.forEach(function (c) {
+ if (typeof c === "function") return c()
+ if (typeof c === "string") return t.comment(c)
+
+ var pattern = c[0]
+ , expect = c[1].sort(alpha)
+ , options = c[2] || {}
+ , f = c[3] || files
+ , tapOpts = c[4] || {}
+
+ // options.debug = true
+ var m = new mm.Minimatch(pattern, options)
+ var r = m.makeRe()
+ var expectRe = regexps[re++]
+ tapOpts.re = String(r) || JSON.stringify(r)
+ tapOpts.files = JSON.stringify(f)
+ tapOpts.pattern = pattern
+ tapOpts.set = m.set
+ tapOpts.negated = m.negate
+
+ var actual = mm.match(f, pattern, options)
+ actual.sort(alpha)
+
+ t.equivalent( actual, expect
+ , JSON.stringify(pattern) + " " + JSON.stringify(expect)
+ , tapOpts )
+
+ t.equal(tapOpts.re, expectRe, tapOpts)
+ })
+
+ t.comment("time=" + (Date.now() - start) + "ms")
+ t.end()
+})
+
+tap.test("global leak test", function (t) {
+ var globalAfter = Object.keys(global)
+ t.equivalent(globalAfter, globalBefore, "no new globals, please")
+ t.end()
+})
+
+function alpha (a, b) {
+ return a > b ? 1 : -1
+}
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/test/brace-expand.js b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/test/brace-expand.js
new file mode 100644
index 0000000..7ee278a
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/test/brace-expand.js
@@ -0,0 +1,33 @@
+var tap = require("tap")
+ , minimatch = require("../")
+
+tap.test("brace expansion", function (t) {
+ // [ pattern, [expanded] ]
+ ; [ [ "a{b,c{d,e},{f,g}h}x{y,z}"
+ , [ "abxy"
+ , "abxz"
+ , "acdxy"
+ , "acdxz"
+ , "acexy"
+ , "acexz"
+ , "afhxy"
+ , "afhxz"
+ , "aghxy"
+ , "aghxz" ] ]
+ , [ "a{1..5}b"
+ , [ "a1b"
+ , "a2b"
+ , "a3b"
+ , "a4b"
+ , "a5b" ] ]
+ , [ "a{b}c", ["a{b}c"] ]
+ ].forEach(function (tc) {
+ var p = tc[0]
+ , expect = tc[1]
+ t.equivalent(minimatch.braceExpand(p), expect, p)
+ })
+ console.error("ending")
+ t.end()
+})
+
+
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/test/caching.js b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/test/caching.js
new file mode 100644
index 0000000..0fec4b0
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/test/caching.js
@@ -0,0 +1,14 @@
+var Minimatch = require("../minimatch.js").Minimatch
+var tap = require("tap")
+tap.test("cache test", function (t) {
+ var mm1 = new Minimatch("a?b")
+ var mm2 = new Minimatch("a?b")
+ t.equal(mm1, mm2, "should get the same object")
+ // the lru should drop it after 100 entries
+ for (var i = 0; i < 100; i ++) {
+ new Minimatch("a"+i)
+ }
+ mm2 = new Minimatch("a?b")
+ t.notEqual(mm1, mm2, "cache should have dropped")
+ t.end()
+})
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/test/defaults.js b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/test/defaults.js
new file mode 100644
index 0000000..75e0571
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/test/defaults.js
@@ -0,0 +1,274 @@
+// http://www.bashcookbook.com/bashinfo/source/bash-1.14.7/tests/glob-test
+//
+// TODO: Some of these tests do very bad things with backslashes, and will
+// most likely fail badly on windows. They should probably be skipped.
+
+var tap = require("tap")
+ , globalBefore = Object.keys(global)
+ , mm = require("../")
+ , files = [ "a", "b", "c", "d", "abc"
+ , "abd", "abe", "bb", "bcd"
+ , "ca", "cb", "dd", "de"
+ , "bdir/", "bdir/cfile"]
+ , next = files.concat([ "a-b", "aXb"
+ , ".x", ".y" ])
+
+tap.test("basic tests", function (t) {
+ var start = Date.now()
+
+ // [ pattern, [matches], MM opts, files, TAP opts]
+ ; [ "http://www.bashcookbook.com/bashinfo" +
+ "/source/bash-1.14.7/tests/glob-test"
+ , ["a*", ["a", "abc", "abd", "abe"]]
+ , ["X*", ["X*"], {nonull: true}]
+
+ // allow null glob expansion
+ , ["X*", []]
+
+ // isaacs: Slightly different than bash/sh/ksh
+ // \\* is not un-escaped to literal "*" in a failed match,
+ // but it does make it get treated as a literal star
+ , ["\\*", ["\\*"], {nonull: true}]
+ , ["\\**", ["\\**"], {nonull: true}]
+ , ["\\*\\*", ["\\*\\*"], {nonull: true}]
+
+ , ["b*/", ["bdir/"]]
+ , ["c*", ["c", "ca", "cb"]]
+ , ["**", files]
+
+ , ["\\.\\./*/", ["\\.\\./*/"], {nonull: true}]
+ , ["s/\\..*//", ["s/\\..*//"], {nonull: true}]
+
+ , "legendary larry crashes bashes"
+ , ["/^root:/{s/^[^:]*:[^:]*:\([^:]*\).*$/\\1/"
+ , ["/^root:/{s/^[^:]*:[^:]*:\([^:]*\).*$/\\1/"], {nonull: true}]
+ , ["/^root:/{s/^[^:]*:[^:]*:\([^:]*\).*$/\1/"
+ , ["/^root:/{s/^[^:]*:[^:]*:\([^:]*\).*$/\1/"], {nonull: true}]
+
+ , "character classes"
+ , ["[a-c]b*", ["abc", "abd", "abe", "bb", "cb"]]
+ , ["[a-y]*[^c]", ["abd", "abe", "bb", "bcd",
+ "bdir/", "ca", "cb", "dd", "de"]]
+ , ["a*[^c]", ["abd", "abe"]]
+ , function () { files.push("a-b", "aXb") }
+ , ["a[X-]b", ["a-b", "aXb"]]
+ , function () { files.push(".x", ".y") }
+ , ["[^a-c]*", ["d", "dd", "de"]]
+ , function () { files.push("a*b/", "a*b/ooo") }
+ , ["a\\*b/*", ["a*b/ooo"]]
+ , ["a\\*?/*", ["a*b/ooo"]]
+ , ["*\\\\!*", [], {null: true}, ["echo !7"]]
+ , ["*\\!*", ["echo !7"], null, ["echo !7"]]
+ , ["*.\\*", ["r.*"], null, ["r.*"]]
+ , ["a[b]c", ["abc"]]
+ , ["a[\\b]c", ["abc"]]
+ , ["a?c", ["abc"]]
+ , ["a\\*c", [], {null: true}, ["abc"]]
+ , ["", [""], { null: true }, [""]]
+
+ , "http://www.opensource.apple.com/source/bash/bash-23/" +
+ "bash/tests/glob-test"
+ , function () { files.push("man/", "man/man1/", "man/man1/bash.1") }
+ , ["*/man*/bash.*", ["man/man1/bash.1"]]
+ , ["man/man1/bash.1", ["man/man1/bash.1"]]
+ , ["a***c", ["abc"], null, ["abc"]]
+ , ["a*****?c", ["abc"], null, ["abc"]]
+ , ["?*****??", ["abc"], null, ["abc"]]
+ , ["*****??", ["abc"], null, ["abc"]]
+ , ["?*****?c", ["abc"], null, ["abc"]]
+ , ["?***?****c", ["abc"], null, ["abc"]]
+ , ["?***?****?", ["abc"], null, ["abc"]]
+ , ["?***?****", ["abc"], null, ["abc"]]
+ , ["*******c", ["abc"], null, ["abc"]]
+ , ["*******?", ["abc"], null, ["abc"]]
+ , ["a*cd**?**??k", ["abcdecdhjk"], null, ["abcdecdhjk"]]
+ , ["a**?**cd**?**??k", ["abcdecdhjk"], null, ["abcdecdhjk"]]
+ , ["a**?**cd**?**??k***", ["abcdecdhjk"], null, ["abcdecdhjk"]]
+ , ["a**?**cd**?**??***k", ["abcdecdhjk"], null, ["abcdecdhjk"]]
+ , ["a**?**cd**?**??***k**", ["abcdecdhjk"], null, ["abcdecdhjk"]]
+ , ["a****c**?**??*****", ["abcdecdhjk"], null, ["abcdecdhjk"]]
+ , ["[-abc]", ["-"], null, ["-"]]
+ , ["[abc-]", ["-"], null, ["-"]]
+ , ["\\", ["\\"], null, ["\\"]]
+ , ["[\\\\]", ["\\"], null, ["\\"]]
+ , ["[[]", ["["], null, ["["]]
+ , ["[", ["["], null, ["["]]
+ , ["[*", ["[abc"], null, ["[abc"]]
+ , "a right bracket shall lose its special meaning and\n" +
+ "represent itself in a bracket expression if it occurs\n" +
+ "first in the list. -- POSIX.2 2.8.3.2"
+ , ["[]]", ["]"], null, ["]"]]
+ , ["[]-]", ["]"], null, ["]"]]
+ , ["[a-\z]", ["p"], null, ["p"]]
+ , ["??**********?****?", [], { null: true }, ["abc"]]
+ , ["??**********?****c", [], { null: true }, ["abc"]]
+ , ["?************c****?****", [], { null: true }, ["abc"]]
+ , ["*c*?**", [], { null: true }, ["abc"]]
+ , ["a*****c*?**", [], { null: true }, ["abc"]]
+ , ["a********???*******", [], { null: true }, ["abc"]]
+ , ["[]", [], { null: true }, ["a"]]
+ , ["[abc", [], { null: true }, ["["]]
+
+ , "nocase tests"
+ , ["XYZ", ["xYz"], { nocase: true, null: true }
+ , ["xYz", "ABC", "IjK"]]
+ , ["ab*", ["ABC"], { nocase: true, null: true }
+ , ["xYz", "ABC", "IjK"]]
+ , ["[ia]?[ck]", ["ABC", "IjK"], { nocase: true, null: true }
+ , ["xYz", "ABC", "IjK"]]
+
+ // [ pattern, [matches], MM opts, files, TAP opts]
+ , "onestar/twostar"
+ , ["{/*,*}", [], {null: true}, ["/asdf/asdf/asdf"]]
+ , ["{/?,*}", ["/a", "bb"], {null: true}
+ , ["/a", "/b/b", "/a/b/c", "bb"]]
+
+ , "dots should not match unless requested"
+ , ["**", ["a/b"], {}, ["a/b", "a/.d", ".a/.d"]]
+
+ // .. and . can only match patterns starting with .,
+ // even when options.dot is set.
+ , function () {
+ files = ["a/./b", "a/../b", "a/c/b", "a/.d/b"]
+ }
+ , ["a/*/b", ["a/c/b", "a/.d/b"], {dot: true}]
+ , ["a/.*/b", ["a/./b", "a/../b", "a/.d/b"], {dot: true}]
+ , ["a/*/b", ["a/c/b"], {dot:false}]
+ , ["a/.*/b", ["a/./b", "a/../b", "a/.d/b"], {dot: false}]
+
+
+ // this also tests that changing the options needs
+ // to change the cache key, even if the pattern is
+ // the same!
+ , ["**", ["a/b","a/.d",".a/.d"], { dot: true }
+ , [ ".a/.d", "a/.d", "a/b"]]
+
+ , "paren sets cannot contain slashes"
+ , ["*(a/b)", ["*(a/b)"], {nonull: true}, ["a/b"]]
+
+ // brace sets trump all else.
+ //
+ // invalid glob pattern. fails on bash4 and bsdglob.
+ // however, in this implementation, it's easier just
+ // to do the intuitive thing, and let brace-expansion
+ // actually come before parsing any extglob patterns,
+ // like the documentation seems to say.
+ //
+ // XXX: if anyone complains about this, either fix it
+ // or tell them to grow up and stop complaining.
+ //
+ // bash/bsdglob says this:
+ // , ["*(a|{b),c)}", ["*(a|{b),c)}"], {}, ["a", "ab", "ac", "ad"]]
+ // but we do this instead:
+ , ["*(a|{b),c)}", ["a", "ab", "ac"], {}, ["a", "ab", "ac", "ad"]]
+
+ // test partial parsing in the presence of comment/negation chars
+ , ["[!a*", ["[!ab"], {}, ["[!ab", "[ab"]]
+ , ["[#a*", ["[#ab"], {}, ["[#ab", "[ab"]]
+
+ // like: {a,b|c\\,d\\\|e} except it's unclosed, so it has to be escaped.
+ , ["+(a|*\\|c\\\\|d\\\\\\|e\\\\\\\\|f\\\\\\\\\\|g"
+ , ["+(a|b\\|c\\\\|d\\\\|e\\\\\\\\|f\\\\\\\\|g"]
+ , {}
+ , ["+(a|b\\|c\\\\|d\\\\|e\\\\\\\\|f\\\\\\\\|g", "a", "b\\c"]]
+
+
+ // crazy nested {,,} and *(||) tests.
+ , function () {
+ files = [ "a", "b", "c", "d"
+ , "ab", "ac", "ad"
+ , "bc", "cb"
+ , "bc,d", "c,db", "c,d"
+ , "d)", "(b|c", "*(b|c"
+ , "b|c", "b|cc", "cb|c"
+ , "x(a|b|c)", "x(a|c)"
+ , "(a|b|c)", "(a|c)"]
+ }
+ , ["*(a|{b,c})", ["a", "b", "c", "ab", "ac"]]
+ , ["{a,*(b|c,d)}", ["a","(b|c", "*(b|c", "d)"]]
+ // a
+ // *(b|c)
+ // *(b|d)
+ , ["{a,*(b|{c,d})}", ["a","b", "bc", "cb", "c", "d"]]
+ , ["*(a|{b|c,c})", ["a", "b", "c", "ab", "ac", "bc", "cb"]]
+
+
+ // test various flag settings.
+ , [ "*(a|{b|c,c})", ["x(a|b|c)", "x(a|c)", "(a|b|c)", "(a|c)"]
+ , { noext: true } ]
+ , ["a?b", ["x/y/acb", "acb/"], {matchBase: true}
+ , ["x/y/acb", "acb/", "acb/d/e", "x/y/acb/d"] ]
+ , ["#*", ["#a", "#b"], {nocomment: true}, ["#a", "#b", "c#d"]]
+
+
+ // begin channelling Boole and deMorgan...
+ , "negation tests"
+ , function () {
+ files = ["d", "e", "!ab", "!abc", "a!b", "\\!a"]
+ }
+
+ // anything that is NOT a* matches.
+ , ["!a*", ["\\!a", "d", "e", "!ab", "!abc"]]
+
+ // anything that IS !a* matches.
+ , ["!a*", ["!ab", "!abc"], {nonegate: true}]
+
+ // anything that IS a* matches
+ , ["!!a*", ["a!b"]]
+
+ // anything that is NOT !a* matches
+ , ["!\\!a*", ["a!b", "d", "e", "\\!a"]]
+
+ // negation nestled within a pattern
+ , function () {
+ files = [ "foo.js"
+ , "foo.bar"
+ // can't match this one without negative lookbehind.
+ , "foo.js.js"
+ , "blar.js"
+ , "foo."
+ , "boo.js.boo" ]
+ }
+ , ["*.!(js)", ["foo.bar", "foo.", "boo.js.boo"] ]
+
+ ].forEach(function (c) {
+ if (typeof c === "function") return c()
+ if (typeof c === "string") return t.comment(c)
+
+ var pattern = c[0]
+ , expect = c[1].sort(alpha)
+ , options = c[2]
+ , f = c[3] || files
+ , tapOpts = c[4] || {}
+
+ // options.debug = true
+ var Class = mm.defaults(options).Minimatch
+ var m = new Class(pattern, {})
+ var r = m.makeRe()
+ tapOpts.re = String(r) || JSON.stringify(r)
+ tapOpts.files = JSON.stringify(f)
+ tapOpts.pattern = pattern
+ tapOpts.set = m.set
+ tapOpts.negated = m.negate
+
+ var actual = mm.match(f, pattern, options)
+ actual.sort(alpha)
+
+ t.equivalent( actual, expect
+ , JSON.stringify(pattern) + " " + JSON.stringify(expect)
+ , tapOpts )
+ })
+
+ t.comment("time=" + (Date.now() - start) + "ms")
+ t.end()
+})
+
+tap.test("global leak test", function (t) {
+ var globalAfter = Object.keys(global)
+ t.equivalent(globalAfter, globalBefore, "no new globals, please")
+ t.end()
+})
+
+function alpha (a, b) {
+ return a > b ? 1 : -1
+}
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/test/extglob-ending-with-state-char.js b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/test/extglob-ending-with-state-char.js
new file mode 100644
index 0000000..6676e26
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/node_modules/minimatch/test/extglob-ending-with-state-char.js
@@ -0,0 +1,8 @@
+var test = require('tap').test
+var minimatch = require('../')
+
+test('extglob ending with statechar', function(t) {
+ t.notOk(minimatch('ax', 'a?(b*)'))
+ t.ok(minimatch('ax', '?(a*|b)'))
+ t.end()
+})
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/package.json b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/package.json
new file mode 100644
index 0000000..cbd0dd6
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/package.json
@@ -0,0 +1,58 @@
+{
+ "author": {
+ "name": "Isaac Z. Schlueter",
+ "email": "i@izs.me",
+ "url": "http://blog.izs.me/"
+ },
+ "name": "glob",
+ "description": "a little globber",
+ "version": "3.2.11",
+ "repository": {
+ "type": "git",
+ "url": "git://github.com/isaacs/node-glob.git"
+ },
+ "main": "glob.js",
+ "engines": {
+ "node": "*"
+ },
+ "dependencies": {
+ "inherits": "2",
+ "minimatch": "0.3"
+ },
+ "devDependencies": {
+ "tap": "~0.4.0",
+ "mkdirp": "0",
+ "rimraf": "1"
+ },
+ "scripts": {
+ "test": "tap test/*.js",
+ "test-regen": "TEST_REGEN=1 node test/00-setup.js"
+ },
+ "license": "BSD",
+ "gitHead": "73f57e99510582b2024b762305970ebcf9b70aa2",
+ "bugs": {
+ "url": "https://github.com/isaacs/node-glob/issues"
+ },
+ "homepage": "https://github.com/isaacs/node-glob",
+ "_id": "glob@3.2.11",
+ "_shasum": "4a973f635b9190f715d10987d5c00fd2815ebe3d",
+ "_from": "glob@>=3.2.9 <3.3.0",
+ "_npmVersion": "1.4.10",
+ "_npmUser": {
+ "name": "isaacs",
+ "email": "i@izs.me"
+ },
+ "maintainers": [
+ {
+ "name": "isaacs",
+ "email": "i@izs.me"
+ }
+ ],
+ "dist": {
+ "shasum": "4a973f635b9190f715d10987d5c00fd2815ebe3d",
+ "tarball": "http://registry.npmjs.org/glob/-/glob-3.2.11.tgz"
+ },
+ "directories": {},
+ "_resolved": "https://registry.npmjs.org/glob/-/glob-3.2.11.tgz",
+ "readme": "ERROR: No README data found!"
+}
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/00-setup.js b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/00-setup.js
new file mode 100644
index 0000000..245afaf
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/00-setup.js
@@ -0,0 +1,176 @@
+// just a little pre-run script to set up the fixtures.
+// zz-finish cleans it up
+
+var mkdirp = require("mkdirp")
+var path = require("path")
+var i = 0
+var tap = require("tap")
+var fs = require("fs")
+var rimraf = require("rimraf")
+
+var files =
+[ "a/.abcdef/x/y/z/a"
+, "a/abcdef/g/h"
+, "a/abcfed/g/h"
+, "a/b/c/d"
+, "a/bc/e/f"
+, "a/c/d/c/b"
+, "a/cb/e/f"
+]
+
+var symlinkTo = path.resolve(__dirname, "a/symlink/a/b/c")
+var symlinkFrom = "../.."
+
+files = files.map(function (f) {
+ return path.resolve(__dirname, f)
+})
+
+tap.test("remove fixtures", function (t) {
+ rimraf(path.resolve(__dirname, "a"), function (er) {
+ t.ifError(er, "remove fixtures")
+ t.end()
+ })
+})
+
+files.forEach(function (f) {
+ tap.test(f, function (t) {
+ var d = path.dirname(f)
+ mkdirp(d, 0755, function (er) {
+ if (er) {
+ t.fail(er)
+ return t.bailout()
+ }
+ fs.writeFile(f, "i like tests", function (er) {
+ t.ifError(er, "make file")
+ t.end()
+ })
+ })
+ })
+})
+
+if (process.platform !== "win32") {
+ tap.test("symlinky", function (t) {
+ var d = path.dirname(symlinkTo)
+ console.error("mkdirp", d)
+ mkdirp(d, 0755, function (er) {
+ t.ifError(er)
+ fs.symlink(symlinkFrom, symlinkTo, "dir", function (er) {
+ t.ifError(er, "make symlink")
+ t.end()
+ })
+ })
+ })
+}
+
+;["foo","bar","baz","asdf","quux","qwer","rewq"].forEach(function (w) {
+ w = "/tmp/glob-test/" + w
+ tap.test("create " + w, function (t) {
+ mkdirp(w, function (er) {
+ if (er)
+ throw er
+ t.pass(w)
+ t.end()
+ })
+ })
+})
+
+
+// generate the bash pattern test-fixtures if possible
+if (process.platform === "win32" || !process.env.TEST_REGEN) {
+ console.error("Windows, or TEST_REGEN unset. Using cached fixtures.")
+ return
+}
+
+var spawn = require("child_process").spawn;
+var globs =
+ // put more patterns here.
+ // anything that would be directly in / should be in /tmp/glob-test
+ ["test/a/*/+(c|g)/./d"
+ ,"test/a/**/[cg]/../[cg]"
+ ,"test/a/{b,c,d,e,f}/**/g"
+ ,"test/a/b/**"
+ ,"test/**/g"
+ ,"test/a/abc{fed,def}/g/h"
+ ,"test/a/abc{fed/g,def}/**/"
+ ,"test/a/abc{fed/g,def}/**///**/"
+ ,"test/**/a/**/"
+ ,"test/+(a|b|c)/a{/,bc*}/**"
+ ,"test/*/*/*/f"
+ ,"test/**/f"
+ ,"test/a/symlink/a/b/c/a/b/c/a/b/c//a/b/c////a/b/c/**/b/c/**"
+ ,"{./*/*,/tmp/glob-test/*}"
+ ,"{/tmp/glob-test/*,*}" // evil owl face! how you taunt me!
+ ,"test/a/!(symlink)/**"
+ ]
+var bashOutput = {}
+var fs = require("fs")
+
+globs.forEach(function (pattern) {
+ tap.test("generate fixture " + pattern, function (t) {
+ var cmd = "shopt -s globstar && " +
+ "shopt -s extglob && " +
+ "shopt -s nullglob && " +
+ // "shopt >&2; " +
+ "eval \'for i in " + pattern + "; do echo $i; done\'"
+ var cp = spawn("bash", ["-c", cmd], { cwd: path.dirname(__dirname) })
+ var out = []
+ cp.stdout.on("data", function (c) {
+ out.push(c)
+ })
+ cp.stderr.pipe(process.stderr)
+ cp.on("close", function (code) {
+ out = flatten(out)
+ if (!out)
+ out = []
+ else
+ out = cleanResults(out.split(/\r*\n/))
+
+ bashOutput[pattern] = out
+ t.notOk(code, "bash test should finish nicely")
+ t.end()
+ })
+ })
+})
+
+tap.test("save fixtures", function (t) {
+ var fname = path.resolve(__dirname, "bash-results.json")
+ var data = JSON.stringify(bashOutput, null, 2) + "\n"
+ fs.writeFile(fname, data, function (er) {
+ t.ifError(er)
+ t.end()
+ })
+})
+
+function cleanResults (m) {
+ // normalize discrepancies in ordering, duplication,
+ // and ending slashes.
+ return m.map(function (m) {
+ return m.replace(/\/+/g, "/").replace(/\/$/, "")
+ }).sort(alphasort).reduce(function (set, f) {
+ if (f !== set[set.length - 1]) set.push(f)
+ return set
+ }, []).sort(alphasort).map(function (f) {
+ // de-windows
+ return (process.platform !== 'win32') ? f
+ : f.replace(/^[a-zA-Z]:\\\\/, '/').replace(/\\/g, '/')
+ })
+}
+
+function flatten (chunks) {
+ var s = 0
+ chunks.forEach(function (c) { s += c.length })
+ var out = new Buffer(s)
+ s = 0
+ chunks.forEach(function (c) {
+ c.copy(out, s)
+ s += c.length
+ })
+
+ return out.toString().trim()
+}
+
+function alphasort (a, b) {
+ a = a.toLowerCase()
+ b = b.toLowerCase()
+ return a > b ? 1 : a < b ? -1 : 0
+}
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/bash-comparison.js b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/bash-comparison.js
new file mode 100644
index 0000000..239ed1a
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/bash-comparison.js
@@ -0,0 +1,63 @@
+// basic test
+// show that it does the same thing by default as the shell.
+var tap = require("tap")
+, child_process = require("child_process")
+, bashResults = require("./bash-results.json")
+, globs = Object.keys(bashResults)
+, glob = require("../")
+, path = require("path")
+
+// run from the root of the project
+// this is usually where you're at anyway, but be sure.
+process.chdir(path.resolve(__dirname, ".."))
+
+function alphasort (a, b) {
+ a = a.toLowerCase()
+ b = b.toLowerCase()
+ return a > b ? 1 : a < b ? -1 : 0
+}
+
+globs.forEach(function (pattern) {
+ var expect = bashResults[pattern]
+ // anything regarding the symlink thing will fail on windows, so just skip it
+ if (process.platform === "win32" &&
+ expect.some(function (m) {
+ return /\/symlink\//.test(m)
+ }))
+ return
+
+ tap.test(pattern, function (t) {
+ glob(pattern, function (er, matches) {
+ if (er)
+ throw er
+
+ // sort and unmark, just to match the shell results
+ matches = cleanResults(matches)
+
+ t.deepEqual(matches, expect, pattern)
+ t.end()
+ })
+ })
+
+ tap.test(pattern + " sync", function (t) {
+ var matches = cleanResults(glob.sync(pattern))
+
+ t.deepEqual(matches, expect, "should match shell")
+ t.end()
+ })
+})
+
+function cleanResults (m) {
+ // normalize discrepancies in ordering, duplication,
+ // and ending slashes.
+ return m.map(function (m) {
+ return m.replace(/\/+/g, "/").replace(/\/$/, "")
+ }).sort(alphasort).reduce(function (set, f) {
+ if (f !== set[set.length - 1]) set.push(f)
+ return set
+ }, []).sort(alphasort).map(function (f) {
+ // de-windows
+ return (process.platform !== 'win32') ? f
+ : f.replace(/^[a-zA-Z]:[\/\\]+/, '/').replace(/[\\\/]+/g, '/')
+ })
+}
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/bash-results.json b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/bash-results.json
new file mode 100644
index 0000000..8051c72
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/bash-results.json
@@ -0,0 +1,351 @@
+{
+ "test/a/*/+(c|g)/./d": [
+ "test/a/b/c/./d"
+ ],
+ "test/a/**/[cg]/../[cg]": [
+ "test/a/abcdef/g/../g",
+ "test/a/abcfed/g/../g",
+ "test/a/b/c/../c",
+ "test/a/c/../c",
+ "test/a/c/d/c/../c",
+ "test/a/symlink/a/b/c/../c",
+ "test/a/symlink/a/b/c/a/b/c/../c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/../c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/../c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/../c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/../c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/../c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/../c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/../c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/../c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/../c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/../c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/../c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/../c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/../c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/../c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/../c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/../c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/../c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/../c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/../c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/../c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/../c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/../c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/../c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/../c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/../c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/../c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/../c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/../c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/../c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/../c"
+ ],
+ "test/a/{b,c,d,e,f}/**/g": [],
+ "test/a/b/**": [
+ "test/a/b",
+ "test/a/b/c",
+ "test/a/b/c/d"
+ ],
+ "test/**/g": [
+ "test/a/abcdef/g",
+ "test/a/abcfed/g"
+ ],
+ "test/a/abc{fed,def}/g/h": [
+ "test/a/abcdef/g/h",
+ "test/a/abcfed/g/h"
+ ],
+ "test/a/abc{fed/g,def}/**/": [
+ "test/a/abcdef",
+ "test/a/abcdef/g",
+ "test/a/abcfed/g"
+ ],
+ "test/a/abc{fed/g,def}/**///**/": [
+ "test/a/abcdef",
+ "test/a/abcdef/g",
+ "test/a/abcfed/g"
+ ],
+ "test/**/a/**/": [
+ "test/a",
+ "test/a/abcdef",
+ "test/a/abcdef/g",
+ "test/a/abcfed",
+ "test/a/abcfed/g",
+ "test/a/b",
+ "test/a/b/c",
+ "test/a/bc",
+ "test/a/bc/e",
+ "test/a/c",
+ "test/a/c/d",
+ "test/a/c/d/c",
+ "test/a/cb",
+ "test/a/cb/e",
+ "test/a/symlink",
+ "test/a/symlink/a",
+ "test/a/symlink/a/b",
+ "test/a/symlink/a/b/c",
+ "test/a/symlink/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b"
+ ],
+ "test/+(a|b|c)/a{/,bc*}/**": [
+ "test/a/abcdef",
+ "test/a/abcdef/g",
+ "test/a/abcdef/g/h",
+ "test/a/abcfed",
+ "test/a/abcfed/g",
+ "test/a/abcfed/g/h"
+ ],
+ "test/*/*/*/f": [
+ "test/a/bc/e/f",
+ "test/a/cb/e/f"
+ ],
+ "test/**/f": [
+ "test/a/bc/e/f",
+ "test/a/cb/e/f"
+ ],
+ "test/a/symlink/a/b/c/a/b/c/a/b/c//a/b/c////a/b/c/**/b/c/**": [
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b",
+ "test/a/symlink/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c/a/b/c"
+ ],
+ "{./*/*,/tmp/glob-test/*}": [
+ "./examples/g.js",
+ "./examples/usr-local.js",
+ "./node_modules/inherits",
+ "./node_modules/minimatch",
+ "./node_modules/mkdirp",
+ "./node_modules/rimraf",
+ "./node_modules/tap",
+ "./test/00-setup.js",
+ "./test/a",
+ "./test/bash-comparison.js",
+ "./test/bash-results.json",
+ "./test/cwd-test.js",
+ "./test/globstar-match.js",
+ "./test/mark.js",
+ "./test/new-glob-optional-options.js",
+ "./test/nocase-nomagic.js",
+ "./test/pause-resume.js",
+ "./test/readme-issue.js",
+ "./test/root-nomount.js",
+ "./test/root.js",
+ "./test/stat.js",
+ "./test/zz-cleanup.js",
+ "/tmp/glob-test/asdf",
+ "/tmp/glob-test/bar",
+ "/tmp/glob-test/baz",
+ "/tmp/glob-test/foo",
+ "/tmp/glob-test/quux",
+ "/tmp/glob-test/qwer",
+ "/tmp/glob-test/rewq"
+ ],
+ "{/tmp/glob-test/*,*}": [
+ "/tmp/glob-test/asdf",
+ "/tmp/glob-test/bar",
+ "/tmp/glob-test/baz",
+ "/tmp/glob-test/foo",
+ "/tmp/glob-test/quux",
+ "/tmp/glob-test/qwer",
+ "/tmp/glob-test/rewq",
+ "examples",
+ "glob.js",
+ "LICENSE",
+ "node_modules",
+ "package.json",
+ "README.md",
+ "test"
+ ],
+ "test/a/!(symlink)/**": [
+ "test/a/abcdef",
+ "test/a/abcdef/g",
+ "test/a/abcdef/g/h",
+ "test/a/abcfed",
+ "test/a/abcfed/g",
+ "test/a/abcfed/g/h",
+ "test/a/b",
+ "test/a/b/c",
+ "test/a/b/c/d",
+ "test/a/bc",
+ "test/a/bc/e",
+ "test/a/bc/e/f",
+ "test/a/c",
+ "test/a/c/d",
+ "test/a/c/d/c",
+ "test/a/c/d/c/b",
+ "test/a/cb",
+ "test/a/cb/e",
+ "test/a/cb/e/f"
+ ]
+}
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/cwd-test.js b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/cwd-test.js
new file mode 100644
index 0000000..352c27e
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/cwd-test.js
@@ -0,0 +1,55 @@
+var tap = require("tap")
+
+var origCwd = process.cwd()
+process.chdir(__dirname)
+
+tap.test("changing cwd and searching for **/d", function (t) {
+ var glob = require('../')
+ var path = require('path')
+ t.test('.', function (t) {
+ glob('**/d', function (er, matches) {
+ t.ifError(er)
+ t.like(matches, [ 'a/b/c/d', 'a/c/d' ])
+ t.end()
+ })
+ })
+
+ t.test('a', function (t) {
+ glob('**/d', {cwd:path.resolve('a')}, function (er, matches) {
+ t.ifError(er)
+ t.like(matches, [ 'b/c/d', 'c/d' ])
+ t.end()
+ })
+ })
+
+ t.test('a/b', function (t) {
+ glob('**/d', {cwd:path.resolve('a/b')}, function (er, matches) {
+ t.ifError(er)
+ t.like(matches, [ 'c/d' ])
+ t.end()
+ })
+ })
+
+ t.test('a/b/', function (t) {
+ glob('**/d', {cwd:path.resolve('a/b/')}, function (er, matches) {
+ t.ifError(er)
+ t.like(matches, [ 'c/d' ])
+ t.end()
+ })
+ })
+
+ t.test('.', function (t) {
+ glob('**/d', {cwd: process.cwd()}, function (er, matches) {
+ t.ifError(er)
+ t.like(matches, [ 'a/b/c/d', 'a/c/d' ])
+ t.end()
+ })
+ })
+
+ t.test('cd -', function (t) {
+ process.chdir(origCwd)
+ t.end()
+ })
+
+ t.end()
+})
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/globstar-match.js b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/globstar-match.js
new file mode 100644
index 0000000..9b234fa
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/globstar-match.js
@@ -0,0 +1,19 @@
+var Glob = require("../glob.js").Glob
+var test = require('tap').test
+
+test('globstar should not have dupe matches', function(t) {
+ var pattern = 'a/**/[gh]'
+ var g = new Glob(pattern, { cwd: __dirname })
+ var matches = []
+ g.on('match', function(m) {
+ console.error('match %j', m)
+ matches.push(m)
+ })
+ g.on('end', function(set) {
+ console.error('set', set)
+ matches = matches.sort()
+ set = set.sort()
+ t.same(matches, set, 'should have same set of matches')
+ t.end()
+ })
+})
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/mark.js b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/mark.js
new file mode 100644
index 0000000..bf411c0
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/mark.js
@@ -0,0 +1,118 @@
+var test = require("tap").test
+var glob = require('../')
+process.chdir(__dirname)
+
+// expose timing issues
+var lag = 5
+glob.Glob.prototype._stat = function(o) { return function(f, cb) {
+ var args = arguments
+ setTimeout(function() {
+ o.call(this, f, cb)
+ }.bind(this), lag += 5)
+}}(glob.Glob.prototype._stat)
+
+
+test("mark, with **", function (t) {
+ glob("a/*b*/**", {mark: true}, function (er, results) {
+ if (er)
+ throw er
+ var expect =
+ [ 'a/abcdef/',
+ 'a/abcdef/g/',
+ 'a/abcdef/g/h',
+ 'a/abcfed/',
+ 'a/abcfed/g/',
+ 'a/abcfed/g/h',
+ 'a/b/',
+ 'a/b/c/',
+ 'a/b/c/d',
+ 'a/bc/',
+ 'a/bc/e/',
+ 'a/bc/e/f',
+ 'a/cb/',
+ 'a/cb/e/',
+ 'a/cb/e/f' ]
+
+ t.same(results, expect)
+ t.end()
+ })
+})
+
+test("mark, no / on pattern", function (t) {
+ glob("a/*", {mark: true}, function (er, results) {
+ if (er)
+ throw er
+ var expect = [ 'a/abcdef/',
+ 'a/abcfed/',
+ 'a/b/',
+ 'a/bc/',
+ 'a/c/',
+ 'a/cb/' ]
+
+ if (process.platform !== "win32")
+ expect.push('a/symlink/')
+
+ t.same(results, expect)
+ t.end()
+ }).on('match', function(m) {
+ t.similar(m, /\/$/)
+ })
+})
+
+test("mark=false, no / on pattern", function (t) {
+ glob("a/*", function (er, results) {
+ if (er)
+ throw er
+ var expect = [ 'a/abcdef',
+ 'a/abcfed',
+ 'a/b',
+ 'a/bc',
+ 'a/c',
+ 'a/cb' ]
+
+ if (process.platform !== "win32")
+ expect.push('a/symlink')
+ t.same(results, expect)
+ t.end()
+ }).on('match', function(m) {
+ t.similar(m, /[^\/]$/)
+ })
+})
+
+test("mark=true, / on pattern", function (t) {
+ glob("a/*/", {mark: true}, function (er, results) {
+ if (er)
+ throw er
+ var expect = [ 'a/abcdef/',
+ 'a/abcfed/',
+ 'a/b/',
+ 'a/bc/',
+ 'a/c/',
+ 'a/cb/' ]
+ if (process.platform !== "win32")
+ expect.push('a/symlink/')
+ t.same(results, expect)
+ t.end()
+ }).on('match', function(m) {
+ t.similar(m, /\/$/)
+ })
+})
+
+test("mark=false, / on pattern", function (t) {
+ glob("a/*/", function (er, results) {
+ if (er)
+ throw er
+ var expect = [ 'a/abcdef/',
+ 'a/abcfed/',
+ 'a/b/',
+ 'a/bc/',
+ 'a/c/',
+ 'a/cb/' ]
+ if (process.platform !== "win32")
+ expect.push('a/symlink/')
+ t.same(results, expect)
+ t.end()
+ }).on('match', function(m) {
+ t.similar(m, /\/$/)
+ })
+})
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/new-glob-optional-options.js b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/new-glob-optional-options.js
new file mode 100644
index 0000000..3e7dc5a
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/new-glob-optional-options.js
@@ -0,0 +1,10 @@
+var Glob = require('../glob.js').Glob;
+var test = require('tap').test;
+
+test('new glob, with cb, and no options', function (t) {
+ new Glob(__filename, function(er, results) {
+ if (er) throw er;
+ t.same(results, [__filename]);
+ t.end();
+ });
+});
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/nocase-nomagic.js b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/nocase-nomagic.js
new file mode 100644
index 0000000..2503f23
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/nocase-nomagic.js
@@ -0,0 +1,113 @@
+var fs = require('fs');
+var test = require('tap').test;
+var glob = require('../');
+
+test('mock fs', function(t) {
+ var stat = fs.stat
+ var statSync = fs.statSync
+ var readdir = fs.readdir
+ var readdirSync = fs.readdirSync
+
+ function fakeStat(path) {
+ var ret
+ switch (path.toLowerCase()) {
+ case '/tmp': case '/tmp/':
+ ret = { isDirectory: function() { return true } }
+ break
+ case '/tmp/a':
+ ret = { isDirectory: function() { return false } }
+ break
+ }
+ return ret
+ }
+
+ fs.stat = function(path, cb) {
+ var f = fakeStat(path);
+ if (f) {
+ process.nextTick(function() {
+ cb(null, f)
+ })
+ } else {
+ stat.call(fs, path, cb)
+ }
+ }
+
+ fs.statSync = function(path) {
+ return fakeStat(path) || statSync.call(fs, path)
+ }
+
+ function fakeReaddir(path) {
+ var ret
+ switch (path.toLowerCase()) {
+ case '/tmp': case '/tmp/':
+ ret = [ 'a', 'A' ]
+ break
+ case '/':
+ ret = ['tmp', 'tMp', 'tMP', 'TMP']
+ }
+ return ret
+ }
+
+ fs.readdir = function(path, cb) {
+ var f = fakeReaddir(path)
+ if (f)
+ process.nextTick(function() {
+ cb(null, f)
+ })
+ else
+ readdir.call(fs, path, cb)
+ }
+
+ fs.readdirSync = function(path) {
+ return fakeReaddir(path) || readdirSync.call(fs, path)
+ }
+
+ t.pass('mocked')
+ t.end()
+})
+
+test('nocase, nomagic', function(t) {
+ var n = 2
+ var want = [ '/TMP/A',
+ '/TMP/a',
+ '/tMP/A',
+ '/tMP/a',
+ '/tMp/A',
+ '/tMp/a',
+ '/tmp/A',
+ '/tmp/a' ]
+ glob('/tmp/a', { nocase: true }, function(er, res) {
+ if (er)
+ throw er
+ t.same(res.sort(), want)
+ if (--n === 0) t.end()
+ })
+ glob('/tmp/A', { nocase: true }, function(er, res) {
+ if (er)
+ throw er
+ t.same(res.sort(), want)
+ if (--n === 0) t.end()
+ })
+})
+
+test('nocase, with some magic', function(t) {
+ t.plan(2)
+ var want = [ '/TMP/A',
+ '/TMP/a',
+ '/tMP/A',
+ '/tMP/a',
+ '/tMp/A',
+ '/tMp/a',
+ '/tmp/A',
+ '/tmp/a' ]
+ glob('/tmp/*', { nocase: true }, function(er, res) {
+ if (er)
+ throw er
+ t.same(res.sort(), want)
+ })
+ glob('/tmp/*', { nocase: true }, function(er, res) {
+ if (er)
+ throw er
+ t.same(res.sort(), want)
+ })
+})
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/pause-resume.js b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/pause-resume.js
new file mode 100644
index 0000000..e1ffbab
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/pause-resume.js
@@ -0,0 +1,73 @@
+// show that no match events happen while paused.
+var tap = require("tap")
+, child_process = require("child_process")
+// just some gnarly pattern with lots of matches
+, pattern = "test/a/!(symlink)/**"
+, bashResults = require("./bash-results.json")
+, patterns = Object.keys(bashResults)
+, glob = require("../")
+, Glob = glob.Glob
+, path = require("path")
+
+// run from the root of the project
+// this is usually where you're at anyway, but be sure.
+process.chdir(path.resolve(__dirname, ".."))
+
+function alphasort (a, b) {
+ a = a.toLowerCase()
+ b = b.toLowerCase()
+ return a > b ? 1 : a < b ? -1 : 0
+}
+
+function cleanResults (m) {
+ // normalize discrepancies in ordering, duplication,
+ // and ending slashes.
+ return m.map(function (m) {
+ return m.replace(/\/+/g, "/").replace(/\/$/, "")
+ }).sort(alphasort).reduce(function (set, f) {
+ if (f !== set[set.length - 1]) set.push(f)
+ return set
+ }, []).sort(alphasort).map(function (f) {
+ // de-windows
+ return (process.platform !== 'win32') ? f
+ : f.replace(/^[a-zA-Z]:\\\\/, '/').replace(/\\/g, '/')
+ })
+}
+
+var globResults = []
+tap.test("use a Glob object, and pause/resume it", function (t) {
+ var g = new Glob(pattern)
+ , paused = false
+ , res = []
+ , expect = bashResults[pattern]
+
+ g.on("pause", function () {
+ console.error("pause")
+ })
+
+ g.on("resume", function () {
+ console.error("resume")
+ })
+
+ g.on("match", function (m) {
+ t.notOk(g.paused, "must not be paused")
+ globResults.push(m)
+ g.pause()
+ t.ok(g.paused, "must be paused")
+ setTimeout(g.resume.bind(g), 10)
+ })
+
+ g.on("end", function (matches) {
+ t.pass("reached glob end")
+ globResults = cleanResults(globResults)
+ matches = cleanResults(matches)
+ t.deepEqual(matches, globResults,
+ "end event matches should be the same as match events")
+
+ t.deepEqual(matches, expect,
+ "glob matches should be the same as bash results")
+
+ t.end()
+ })
+})
+
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/readme-issue.js b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/readme-issue.js
new file mode 100644
index 0000000..0b4e0be
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/readme-issue.js
@@ -0,0 +1,36 @@
+var test = require("tap").test
+var glob = require("../")
+
+var mkdirp = require("mkdirp")
+var fs = require("fs")
+var rimraf = require("rimraf")
+var dir = __dirname + "/package"
+
+test("setup", function (t) {
+ mkdirp.sync(dir)
+ fs.writeFileSync(dir + "/package.json", "{}", "ascii")
+ fs.writeFileSync(dir + "/README", "x", "ascii")
+ t.pass("setup done")
+ t.end()
+})
+
+test("glob", function (t) {
+ var opt = {
+ cwd: dir,
+ nocase: true,
+ mark: true
+ }
+
+ glob("README?(.*)", opt, function (er, files) {
+ if (er)
+ throw er
+ t.same(files, ["README"])
+ t.end()
+ })
+})
+
+test("cleanup", function (t) {
+ rimraf.sync(dir)
+ t.pass("clean")
+ t.end()
+})
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/root-nomount.js b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/root-nomount.js
new file mode 100644
index 0000000..3ac5979
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/root-nomount.js
@@ -0,0 +1,39 @@
+var tap = require("tap")
+
+var origCwd = process.cwd()
+process.chdir(__dirname)
+
+tap.test("changing root and searching for /b*/**", function (t) {
+ var glob = require('../')
+ var path = require('path')
+ t.test('.', function (t) {
+ glob('/b*/**', { globDebug: true, root: '.', nomount: true }, function (er, matches) {
+ t.ifError(er)
+ t.like(matches, [])
+ t.end()
+ })
+ })
+
+ t.test('a', function (t) {
+ glob('/b*/**', { globDebug: true, root: path.resolve('a'), nomount: true }, function (er, matches) {
+ t.ifError(er)
+ t.like(matches, [ '/b', '/b/c', '/b/c/d', '/bc', '/bc/e', '/bc/e/f' ])
+ t.end()
+ })
+ })
+
+ t.test('root=a, cwd=a/b', function (t) {
+ glob('/b*/**', { globDebug: true, root: 'a', cwd: path.resolve('a/b'), nomount: true }, function (er, matches) {
+ t.ifError(er)
+ t.like(matches, [ '/b', '/b/c', '/b/c/d', '/bc', '/bc/e', '/bc/e/f' ])
+ t.end()
+ })
+ })
+
+ t.test('cd -', function (t) {
+ process.chdir(origCwd)
+ t.end()
+ })
+
+ t.end()
+})
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/root.js b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/root.js
new file mode 100644
index 0000000..95c23f9
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/root.js
@@ -0,0 +1,46 @@
+var t = require("tap")
+
+var origCwd = process.cwd()
+process.chdir(__dirname)
+
+var glob = require('../')
+var path = require('path')
+
+t.test('.', function (t) {
+ glob('/b*/**', { globDebug: true, root: '.' }, function (er, matches) {
+ t.ifError(er)
+ t.like(matches, [])
+ t.end()
+ })
+})
+
+
+t.test('a', function (t) {
+ console.error("root=" + path.resolve('a'))
+ glob('/b*/**', { globDebug: true, root: path.resolve('a') }, function (er, matches) {
+ t.ifError(er)
+ var wanted = [
+ '/b', '/b/c', '/b/c/d', '/bc', '/bc/e', '/bc/e/f'
+ ].map(function (m) {
+ return path.join(path.resolve('a'), m).replace(/\\/g, '/')
+ })
+
+ t.like(matches, wanted)
+ t.end()
+ })
+})
+
+t.test('root=a, cwd=a/b', function (t) {
+ glob('/b*/**', { globDebug: true, root: 'a', cwd: path.resolve('a/b') }, function (er, matches) {
+ t.ifError(er)
+ t.like(matches, [ '/b', '/b/c', '/b/c/d', '/bc', '/bc/e', '/bc/e/f' ].map(function (m) {
+ return path.join(path.resolve('a'), m).replace(/\\/g, '/')
+ }))
+ t.end()
+ })
+})
+
+t.test('cd -', function (t) {
+ process.chdir(origCwd)
+ t.end()
+})
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/stat.js b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/stat.js
new file mode 100644
index 0000000..6291711
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/stat.js
@@ -0,0 +1,32 @@
+var glob = require('../')
+var test = require('tap').test
+var path = require('path')
+
+test('stat all the things', function(t) {
+ var g = new glob.Glob('a/*abc*/**', { stat: true, cwd: __dirname })
+ var matches = []
+ g.on('match', function(m) {
+ matches.push(m)
+ })
+ var stats = []
+ g.on('stat', function(m) {
+ stats.push(m)
+ })
+ g.on('end', function(eof) {
+ stats = stats.sort()
+ matches = matches.sort()
+ eof = eof.sort()
+ t.same(stats, matches)
+ t.same(eof, matches)
+ var cache = Object.keys(this.statCache)
+ t.same(cache.map(function (f) {
+ return path.relative(__dirname, f)
+ }).sort(), matches)
+
+ cache.forEach(function(c) {
+ t.equal(typeof this.statCache[c], 'object')
+ }, this)
+
+ t.end()
+ })
+})
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/zz-cleanup.js b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/zz-cleanup.js
new file mode 100644
index 0000000..e085f0f
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/glob/test/zz-cleanup.js
@@ -0,0 +1,11 @@
+// remove the fixtures
+var tap = require("tap")
+, rimraf = require("rimraf")
+, path = require("path")
+
+tap.test("cleanup fixtures", function (t) {
+ rimraf(path.resolve(__dirname, "a"), function (er) {
+ t.ifError(er, "removed")
+ t.end()
+ })
+})
diff --git a/node_modules/grunt/node_modules/findup-sync/node_modules/lodash/LICENSE.txt b/node_modules/grunt/node_modules/findup-sync/node_modules/lodash/LICENSE.txt
new file mode 100644
index 0000000..49869bb
--- /dev/null
+++ b/node_modules/grunt/node_modules/findup-sync/node_modules/lodash/LICENSE.txt
@@ -0,0 +1,22 @@
+Copyright 2012-2013 The Dojo Foundation DevDocs as a fast, organized, & searchable interface for our documentation.
+
+The full changelog for this release is available on our [wiki](https://github.com/lodash/lodash/wiki/Changelog).
+ * Copyright 2009-2013 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
+ * Available under MIT license
+ */
+;(function() {
+
+ /** Used as a safe reference for `undefined` in pre ES5 environments */
+ var undefined;
+
+ /** Used to pool arrays and objects used internally */
+ var arrayPool = [],
+ objectPool = [];
+
+ /** Used to generate unique IDs */
+ var idCounter = 0;
+
+ /** Used internally to indicate various things */
+ var indicatorObject = {};
+
+ /** Used to prefix keys to avoid issues with `__proto__` and properties on `Object.prototype` */
+ var keyPrefix = +new Date + '';
+
+ /** Used as the size when optimizations are enabled for large arrays */
+ var largeArraySize = 75;
+
+ /** Used as the max size of the `arrayPool` and `objectPool` */
+ var maxPoolSize = 40;
+
+ /** Used to detect and test whitespace */
+ var whitespace = (
+ // whitespace
+ ' \t\x0B\f\xA0\ufeff' +
+
+ // line terminators
+ '\n\r\u2028\u2029' +
+
+ // unicode category "Zs" space separators
+ '\u1680\u180e\u2000\u2001\u2002\u2003\u2004\u2005\u2006\u2007\u2008\u2009\u200a\u202f\u205f\u3000'
+ );
+
+ /** Used to match empty string literals in compiled template source */
+ var reEmptyStringLeading = /\b__p \+= '';/g,
+ reEmptyStringMiddle = /\b(__p \+=) '' \+/g,
+ reEmptyStringTrailing = /(__e\(.*?\)|\b__t\)) \+\n'';/g;
+
+ /**
+ * Used to match ES6 template delimiters
+ * http://people.mozilla.org/~jorendorff/es6-draft.html#sec-literals-string-literals
+ */
+ var reEsTemplate = /\$\{([^\\}]*(?:\\.[^\\}]*)*)\}/g;
+
+ /** Used to match regexp flags from their coerced string values */
+ var reFlags = /\w*$/;
+
+ /** Used to detected named functions */
+ var reFuncName = /^\s*function[ \n\r\t]+\w/;
+
+ /** Used to match "interpolate" template delimiters */
+ var reInterpolate = /<%=([\s\S]+?)%>/g;
+
+ /** Used to match leading whitespace and zeros to be removed */
+ var reLeadingSpacesAndZeros = RegExp('^[' + whitespace + ']*0+(?=.$)');
+
+ /** Used to ensure capturing order of template delimiters */
+ var reNoMatch = /($^)/;
+
+ /** Used to detect functions containing a `this` reference */
+ var reThis = /\bthis\b/;
+
+ /** Used to match unescaped characters in compiled string literals */
+ var reUnescapedString = /['\n\r\t\u2028\u2029\\]/g;
+
+ /** Used to assign default `context` object properties */
+ var contextProps = [
+ 'Array', 'Boolean', 'Date', 'Error', 'Function', 'Math', 'Number', 'Object',
+ 'RegExp', 'String', '_', 'attachEvent', 'clearTimeout', 'isFinite', 'isNaN',
+ 'parseInt', 'setTimeout'
+ ];
+
+ /** Used to fix the JScript [[DontEnum]] bug */
+ var shadowedProps = [
+ 'constructor', 'hasOwnProperty', 'isPrototypeOf', 'propertyIsEnumerable',
+ 'toLocaleString', 'toString', 'valueOf'
+ ];
+
+ /** Used to make template sourceURLs easier to identify */
+ var templateCounter = 0;
+
+ /** `Object#toString` result shortcuts */
+ var argsClass = '[object Arguments]',
+ arrayClass = '[object Array]',
+ boolClass = '[object Boolean]',
+ dateClass = '[object Date]',
+ errorClass = '[object Error]',
+ funcClass = '[object Function]',
+ numberClass = '[object Number]',
+ objectClass = '[object Object]',
+ regexpClass = '[object RegExp]',
+ stringClass = '[object String]';
+
+ /** Used to identify object classifications that `_.clone` supports */
+ var cloneableClasses = {};
+ cloneableClasses[funcClass] = false;
+ cloneableClasses[argsClass] = cloneableClasses[arrayClass] =
+ cloneableClasses[boolClass] = cloneableClasses[dateClass] =
+ cloneableClasses[numberClass] = cloneableClasses[objectClass] =
+ cloneableClasses[regexpClass] = cloneableClasses[stringClass] = true;
+
+ /** Used as an internal `_.debounce` options object */
+ var debounceOptions = {
+ 'leading': false,
+ 'maxWait': 0,
+ 'trailing': false
+ };
+
+ /** Used as the property descriptor for `__bindData__` */
+ var descriptor = {
+ 'configurable': false,
+ 'enumerable': false,
+ 'value': null,
+ 'writable': false
+ };
+
+ /** Used as the data object for `iteratorTemplate` */
+ var iteratorData = {
+ 'args': '',
+ 'array': null,
+ 'bottom': '',
+ 'firstArg': '',
+ 'init': '',
+ 'keys': null,
+ 'loop': '',
+ 'shadowedProps': null,
+ 'support': null,
+ 'top': '',
+ 'useHas': false
+ };
+
+ /** Used to determine if values are of the language type Object */
+ var objectTypes = {
+ 'boolean': false,
+ 'function': true,
+ 'object': true,
+ 'number': false,
+ 'string': false,
+ 'undefined': false
+ };
+
+ /** Used to escape characters for inclusion in compiled string literals */
+ var stringEscapes = {
+ '\\': '\\',
+ "'": "'",
+ '\n': 'n',
+ '\r': 'r',
+ '\t': 't',
+ '\u2028': 'u2028',
+ '\u2029': 'u2029'
+ };
+
+ /** Used as a reference to the global object */
+ var root = (objectTypes[typeof window] && window) || this;
+
+ /** Detect free variable `exports` */
+ var freeExports = objectTypes[typeof exports] && exports && !exports.nodeType && exports;
+
+ /** Detect free variable `module` */
+ var freeModule = objectTypes[typeof module] && module && !module.nodeType && module;
+
+ /** Detect the popular CommonJS extension `module.exports` */
+ var moduleExports = freeModule && freeModule.exports === freeExports && freeExports;
+
+ /** Detect free variable `global` from Node.js or Browserified code and use it as `root` */
+ var freeGlobal = objectTypes[typeof global] && global;
+ if (freeGlobal && (freeGlobal.global === freeGlobal || freeGlobal.window === freeGlobal)) {
+ root = freeGlobal;
+ }
+
+ /*--------------------------------------------------------------------------*/
+
+ /**
+ * The base implementation of `_.indexOf` without support for binary searches
+ * or `fromIndex` constraints.
+ *
+ * @private
+ * @param {Array} array The array to search.
+ * @param {*} value The value to search for.
+ * @param {number} [fromIndex=0] The index to search from.
+ * @returns {number} Returns the index of the matched value or `-1`.
+ */
+ function baseIndexOf(array, value, fromIndex) {
+ var index = (fromIndex || 0) - 1,
+ length = array ? array.length : 0;
+
+ while (++index < length) {
+ if (array[index] === value) {
+ return index;
+ }
+ }
+ return -1;
+ }
+
+ /**
+ * An implementation of `_.contains` for cache objects that mimics the return
+ * signature of `_.indexOf` by returning `0` if the value is found, else `-1`.
+ *
+ * @private
+ * @param {Object} cache The cache object to inspect.
+ * @param {*} value The value to search for.
+ * @returns {number} Returns `0` if `value` is found, else `-1`.
+ */
+ function cacheIndexOf(cache, value) {
+ var type = typeof value;
+ cache = cache.cache;
+
+ if (type == 'boolean' || value == null) {
+ return cache[value] ? 0 : -1;
+ }
+ if (type != 'number' && type != 'string') {
+ type = 'object';
+ }
+ var key = type == 'number' ? value : keyPrefix + value;
+ cache = (cache = cache[type]) && cache[key];
+
+ return type == 'object'
+ ? (cache && baseIndexOf(cache, value) > -1 ? 0 : -1)
+ : (cache ? 0 : -1);
+ }
+
+ /**
+ * Adds a given value to the corresponding cache object.
+ *
+ * @private
+ * @param {*} value The value to add to the cache.
+ */
+ function cachePush(value) {
+ var cache = this.cache,
+ type = typeof value;
+
+ if (type == 'boolean' || value == null) {
+ cache[value] = true;
+ } else {
+ if (type != 'number' && type != 'string') {
+ type = 'object';
+ }
+ var key = type == 'number' ? value : keyPrefix + value,
+ typeCache = cache[type] || (cache[type] = {});
+
+ if (type == 'object') {
+ (typeCache[key] || (typeCache[key] = [])).push(value);
+ } else {
+ typeCache[key] = true;
+ }
+ }
+ }
+
+ /**
+ * Used by `_.max` and `_.min` as the default callback when a given
+ * collection is a string value.
+ *
+ * @private
+ * @param {string} value The character to inspect.
+ * @returns {number} Returns the code unit of given character.
+ */
+ function charAtCallback(value) {
+ return value.charCodeAt(0);
+ }
+
+ /**
+ * Used by `sortBy` to compare transformed `collection` elements, stable sorting
+ * them in ascending order.
+ *
+ * @private
+ * @param {Object} a The object to compare to `b`.
+ * @param {Object} b The object to compare to `a`.
+ * @returns {number} Returns the sort order indicator of `1` or `-1`.
+ */
+ function compareAscending(a, b) {
+ var ac = a.criteria,
+ bc = b.criteria,
+ index = -1,
+ length = ac.length;
+
+ while (++index < length) {
+ var value = ac[index],
+ other = bc[index];
+
+ if (value !== other) {
+ if (value > other || typeof value == 'undefined') {
+ return 1;
+ }
+ if (value < other || typeof other == 'undefined') {
+ return -1;
+ }
+ }
+ }
+ // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications
+ // that causes it, under certain circumstances, to return the same value for
+ // `a` and `b`. See https://github.com/jashkenas/underscore/pull/1247
+ //
+ // This also ensures a stable sort in V8 and other engines.
+ // See http://code.google.com/p/v8/issues/detail?id=90
+ return a.index - b.index;
+ }
+
+ /**
+ * Creates a cache object to optimize linear searches of large arrays.
+ *
+ * @private
+ * @param {Array} [array=[]] The array to search.
+ * @returns {null|Object} Returns the cache object or `null` if caching should not be used.
+ */
+ function createCache(array) {
+ var index = -1,
+ length = array.length,
+ first = array[0],
+ mid = array[(length / 2) | 0],
+ last = array[length - 1];
+
+ if (first && typeof first == 'object' &&
+ mid && typeof mid == 'object' && last && typeof last == 'object') {
+ return false;
+ }
+ var cache = getObject();
+ cache['false'] = cache['null'] = cache['true'] = cache['undefined'] = false;
+
+ var result = getObject();
+ result.array = array;
+ result.cache = cache;
+ result.push = cachePush;
+
+ while (++index < length) {
+ result.push(array[index]);
+ }
+ return result;
+ }
+
+ /**
+ * Used by `template` to escape characters for inclusion in compiled
+ * string literals.
+ *
+ * @private
+ * @param {string} match The matched character to escape.
+ * @returns {string} Returns the escaped character.
+ */
+ function escapeStringChar(match) {
+ return '\\' + stringEscapes[match];
+ }
+
+ /**
+ * Gets an array from the array pool or creates a new one if the pool is empty.
+ *
+ * @private
+ * @returns {Array} The array from the pool.
+ */
+ function getArray() {
+ return arrayPool.pop() || [];
+ }
+
+ /**
+ * Gets an object from the object pool or creates a new one if the pool is empty.
+ *
+ * @private
+ * @returns {Object} The object from the pool.
+ */
+ function getObject() {
+ return objectPool.pop() || {
+ 'array': null,
+ 'cache': null,
+ 'criteria': null,
+ 'false': false,
+ 'index': 0,
+ 'null': false,
+ 'number': null,
+ 'object': null,
+ 'push': null,
+ 'string': null,
+ 'true': false,
+ 'undefined': false,
+ 'value': null
+ };
+ }
+
+ /**
+ * Checks if `value` is a DOM node in IE < 9.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if the `value` is a DOM node, else `false`.
+ */
+ function isNode(value) {
+ // IE < 9 presents DOM nodes as `Object` objects except they have `toString`
+ // methods that are `typeof` "string" and still can coerce nodes to strings
+ return typeof value.toString != 'function' && typeof (value + '') == 'string';
+ }
+
+ /**
+ * Releases the given array back to the array pool.
+ *
+ * @private
+ * @param {Array} [array] The array to release.
+ */
+ function releaseArray(array) {
+ array.length = 0;
+ if (arrayPool.length < maxPoolSize) {
+ arrayPool.push(array);
+ }
+ }
+
+ /**
+ * Releases the given object back to the object pool.
+ *
+ * @private
+ * @param {Object} [object] The object to release.
+ */
+ function releaseObject(object) {
+ var cache = object.cache;
+ if (cache) {
+ releaseObject(cache);
+ }
+ object.array = object.cache = object.criteria = object.object = object.number = object.string = object.value = null;
+ if (objectPool.length < maxPoolSize) {
+ objectPool.push(object);
+ }
+ }
+
+ /**
+ * Slices the `collection` from the `start` index up to, but not including,
+ * the `end` index.
+ *
+ * Note: This function is used instead of `Array#slice` to support node lists
+ * in IE < 9 and to ensure dense arrays are returned.
+ *
+ * @private
+ * @param {Array|Object|string} collection The collection to slice.
+ * @param {number} start The start index.
+ * @param {number} end The end index.
+ * @returns {Array} Returns the new array.
+ */
+ function slice(array, start, end) {
+ start || (start = 0);
+ if (typeof end == 'undefined') {
+ end = array ? array.length : 0;
+ }
+ var index = -1,
+ length = end - start || 0,
+ result = Array(length < 0 ? 0 : length);
+
+ while (++index < length) {
+ result[index] = array[start + index];
+ }
+ return result;
+ }
+
+ /*--------------------------------------------------------------------------*/
+
+ /**
+ * Create a new `lodash` function using the given context object.
+ *
+ * @static
+ * @memberOf _
+ * @category Utilities
+ * @param {Object} [context=root] The context object.
+ * @returns {Function} Returns the `lodash` function.
+ */
+ function runInContext(context) {
+ // Avoid issues with some ES3 environments that attempt to use values, named
+ // after built-in constructors like `Object`, for the creation of literals.
+ // ES5 clears this up by stating that literals must use built-in constructors.
+ // See http://es5.github.io/#x11.1.5.
+ context = context ? _.defaults(root.Object(), context, _.pick(root, contextProps)) : root;
+
+ /** Native constructor references */
+ var Array = context.Array,
+ Boolean = context.Boolean,
+ Date = context.Date,
+ Error = context.Error,
+ Function = context.Function,
+ Math = context.Math,
+ Number = context.Number,
+ Object = context.Object,
+ RegExp = context.RegExp,
+ String = context.String,
+ TypeError = context.TypeError;
+
+ /**
+ * Used for `Array` method references.
+ *
+ * Normally `Array.prototype` would suffice, however, using an array literal
+ * avoids issues in Narwhal.
+ */
+ var arrayRef = [];
+
+ /** Used for native method references */
+ var errorProto = Error.prototype,
+ objectProto = Object.prototype,
+ stringProto = String.prototype;
+
+ /** Used to restore the original `_` reference in `noConflict` */
+ var oldDash = context._;
+
+ /** Used to resolve the internal [[Class]] of values */
+ var toString = objectProto.toString;
+
+ /** Used to detect if a method is native */
+ var reNative = RegExp('^' +
+ String(toString)
+ .replace(/[.*+?^${}()|[\]\\]/g, '\\$&')
+ .replace(/toString| for [^\]]+/g, '.*?') + '$'
+ );
+
+ /** Native method shortcuts */
+ var ceil = Math.ceil,
+ clearTimeout = context.clearTimeout,
+ floor = Math.floor,
+ fnToString = Function.prototype.toString,
+ getPrototypeOf = isNative(getPrototypeOf = Object.getPrototypeOf) && getPrototypeOf,
+ hasOwnProperty = objectProto.hasOwnProperty,
+ push = arrayRef.push,
+ propertyIsEnumerable = objectProto.propertyIsEnumerable,
+ setTimeout = context.setTimeout,
+ splice = arrayRef.splice,
+ unshift = arrayRef.unshift;
+
+ /** Used to set meta data on functions */
+ var defineProperty = (function() {
+ // IE 8 only accepts DOM elements
+ try {
+ var o = {},
+ func = isNative(func = Object.defineProperty) && func,
+ result = func(o, o, o) && func;
+ } catch(e) { }
+ return result;
+ }());
+
+ /* Native method shortcuts for methods with the same name as other `lodash` methods */
+ var nativeCreate = isNative(nativeCreate = Object.create) && nativeCreate,
+ nativeIsArray = isNative(nativeIsArray = Array.isArray) && nativeIsArray,
+ nativeIsFinite = context.isFinite,
+ nativeIsNaN = context.isNaN,
+ nativeKeys = isNative(nativeKeys = Object.keys) && nativeKeys,
+ nativeMax = Math.max,
+ nativeMin = Math.min,
+ nativeParseInt = context.parseInt,
+ nativeRandom = Math.random;
+
+ /** Used to lookup a built-in constructor by [[Class]] */
+ var ctorByClass = {};
+ ctorByClass[arrayClass] = Array;
+ ctorByClass[boolClass] = Boolean;
+ ctorByClass[dateClass] = Date;
+ ctorByClass[funcClass] = Function;
+ ctorByClass[objectClass] = Object;
+ ctorByClass[numberClass] = Number;
+ ctorByClass[regexpClass] = RegExp;
+ ctorByClass[stringClass] = String;
+
+ /** Used to avoid iterating non-enumerable properties in IE < 9 */
+ var nonEnumProps = {};
+ nonEnumProps[arrayClass] = nonEnumProps[dateClass] = nonEnumProps[numberClass] = { 'constructor': true, 'toLocaleString': true, 'toString': true, 'valueOf': true };
+ nonEnumProps[boolClass] = nonEnumProps[stringClass] = { 'constructor': true, 'toString': true, 'valueOf': true };
+ nonEnumProps[errorClass] = nonEnumProps[funcClass] = nonEnumProps[regexpClass] = { 'constructor': true, 'toString': true };
+ nonEnumProps[objectClass] = { 'constructor': true };
+
+ (function() {
+ var length = shadowedProps.length;
+ while (length--) {
+ var key = shadowedProps[length];
+ for (var className in nonEnumProps) {
+ if (hasOwnProperty.call(nonEnumProps, className) && !hasOwnProperty.call(nonEnumProps[className], key)) {
+ nonEnumProps[className][key] = false;
+ }
+ }
+ }
+ }());
+
+ /*--------------------------------------------------------------------------*/
+
+ /**
+ * Creates a `lodash` object which wraps the given value to enable intuitive
+ * method chaining.
+ *
+ * In addition to Lo-Dash methods, wrappers also have the following `Array` methods:
+ * `concat`, `join`, `pop`, `push`, `reverse`, `shift`, `slice`, `sort`, `splice`,
+ * and `unshift`
+ *
+ * Chaining is supported in custom builds as long as the `value` method is
+ * implicitly or explicitly included in the build.
+ *
+ * The chainable wrapper functions are:
+ * `after`, `assign`, `bind`, `bindAll`, `bindKey`, `chain`, `compact`,
+ * `compose`, `concat`, `countBy`, `create`, `createCallback`, `curry`,
+ * `debounce`, `defaults`, `defer`, `delay`, `difference`, `filter`, `flatten`,
+ * `forEach`, `forEachRight`, `forIn`, `forInRight`, `forOwn`, `forOwnRight`,
+ * `functions`, `groupBy`, `indexBy`, `initial`, `intersection`, `invert`,
+ * `invoke`, `keys`, `map`, `max`, `memoize`, `merge`, `min`, `object`, `omit`,
+ * `once`, `pairs`, `partial`, `partialRight`, `pick`, `pluck`, `pull`, `push`,
+ * `range`, `reject`, `remove`, `rest`, `reverse`, `shuffle`, `slice`, `sort`,
+ * `sortBy`, `splice`, `tap`, `throttle`, `times`, `toArray`, `transform`,
+ * `union`, `uniq`, `unshift`, `unzip`, `values`, `where`, `without`, `wrap`,
+ * and `zip`
+ *
+ * The non-chainable wrapper functions are:
+ * `clone`, `cloneDeep`, `contains`, `escape`, `every`, `find`, `findIndex`,
+ * `findKey`, `findLast`, `findLastIndex`, `findLastKey`, `has`, `identity`,
+ * `indexOf`, `isArguments`, `isArray`, `isBoolean`, `isDate`, `isElement`,
+ * `isEmpty`, `isEqual`, `isFinite`, `isFunction`, `isNaN`, `isNull`, `isNumber`,
+ * `isObject`, `isPlainObject`, `isRegExp`, `isString`, `isUndefined`, `join`,
+ * `lastIndexOf`, `mixin`, `noConflict`, `parseInt`, `pop`, `random`, `reduce`,
+ * `reduceRight`, `result`, `shift`, `size`, `some`, `sortedIndex`, `runInContext`,
+ * `template`, `unescape`, `uniqueId`, and `value`
+ *
+ * The wrapper functions `first` and `last` return wrapped values when `n` is
+ * provided, otherwise they return unwrapped values.
+ *
+ * Explicit chaining can be enabled by using the `_.chain` method.
+ *
+ * @name _
+ * @constructor
+ * @category Chaining
+ * @param {*} value The value to wrap in a `lodash` instance.
+ * @returns {Object} Returns a `lodash` instance.
+ * @example
+ *
+ * var wrapped = _([1, 2, 3]);
+ *
+ * // returns an unwrapped value
+ * wrapped.reduce(function(sum, num) {
+ * return sum + num;
+ * });
+ * // => 6
+ *
+ * // returns a wrapped value
+ * var squares = wrapped.map(function(num) {
+ * return num * num;
+ * });
+ *
+ * _.isArray(squares);
+ * // => false
+ *
+ * _.isArray(squares.value());
+ * // => true
+ */
+ function lodash(value) {
+ // don't wrap if already wrapped, even if wrapped by a different `lodash` constructor
+ return (value && typeof value == 'object' && !isArray(value) && hasOwnProperty.call(value, '__wrapped__'))
+ ? value
+ : new lodashWrapper(value);
+ }
+
+ /**
+ * A fast path for creating `lodash` wrapper objects.
+ *
+ * @private
+ * @param {*} value The value to wrap in a `lodash` instance.
+ * @param {boolean} chainAll A flag to enable chaining for all methods
+ * @returns {Object} Returns a `lodash` instance.
+ */
+ function lodashWrapper(value, chainAll) {
+ this.__chain__ = !!chainAll;
+ this.__wrapped__ = value;
+ }
+ // ensure `new lodashWrapper` is an instance of `lodash`
+ lodashWrapper.prototype = lodash.prototype;
+
+ /**
+ * An object used to flag environments features.
+ *
+ * @static
+ * @memberOf _
+ * @type Object
+ */
+ var support = lodash.support = {};
+
+ (function() {
+ var ctor = function() { this.x = 1; },
+ object = { '0': 1, 'length': 1 },
+ props = [];
+
+ ctor.prototype = { 'valueOf': 1, 'y': 1 };
+ for (var key in new ctor) { props.push(key); }
+ for (key in arguments) { }
+
+ /**
+ * Detect if an `arguments` object's [[Class]] is resolvable (all but Firefox < 4, IE < 9).
+ *
+ * @memberOf _.support
+ * @type boolean
+ */
+ support.argsClass = toString.call(arguments) == argsClass;
+
+ /**
+ * Detect if `arguments` objects are `Object` objects (all but Narwhal and Opera < 10.5).
+ *
+ * @memberOf _.support
+ * @type boolean
+ */
+ support.argsObject = arguments.constructor == Object && !(arguments instanceof Array);
+
+ /**
+ * Detect if `name` or `message` properties of `Error.prototype` are
+ * enumerable by default. (IE < 9, Safari < 5.1)
+ *
+ * @memberOf _.support
+ * @type boolean
+ */
+ support.enumErrorProps = propertyIsEnumerable.call(errorProto, 'message') || propertyIsEnumerable.call(errorProto, 'name');
+
+ /**
+ * Detect if `prototype` properties are enumerable by default.
+ *
+ * Firefox < 3.6, Opera > 9.50 - Opera < 11.60, and Safari < 5.1
+ * (if the prototype or a property on the prototype has been set)
+ * incorrectly sets a function's `prototype` property [[Enumerable]]
+ * value to `true`.
+ *
+ * @memberOf _.support
+ * @type boolean
+ */
+ support.enumPrototypes = propertyIsEnumerable.call(ctor, 'prototype');
+
+ /**
+ * Detect if functions can be decompiled by `Function#toString`
+ * (all but PS3 and older Opera mobile browsers & avoided in Windows 8 apps).
+ *
+ * @memberOf _.support
+ * @type boolean
+ */
+ support.funcDecomp = !isNative(context.WinRTError) && reThis.test(runInContext);
+
+ /**
+ * Detect if `Function#name` is supported (all but IE).
+ *
+ * @memberOf _.support
+ * @type boolean
+ */
+ support.funcNames = typeof Function.name == 'string';
+
+ /**
+ * Detect if `arguments` object indexes are non-enumerable
+ * (Firefox < 4, IE < 9, PhantomJS, Safari < 5.1).
+ *
+ * @memberOf _.support
+ * @type boolean
+ */
+ support.nonEnumArgs = key != 0;
+
+ /**
+ * Detect if properties shadowing those on `Object.prototype` are non-enumerable.
+ *
+ * In IE < 9 an objects own properties, shadowing non-enumerable ones, are
+ * made non-enumerable as well (a.k.a the JScript [[DontEnum]] bug).
+ *
+ * @memberOf _.support
+ * @type boolean
+ */
+ support.nonEnumShadows = !/valueOf/.test(props);
+
+ /**
+ * Detect if own properties are iterated after inherited properties (all but IE < 9).
+ *
+ * @memberOf _.support
+ * @type boolean
+ */
+ support.ownLast = props[0] != 'x';
+
+ /**
+ * Detect if `Array#shift` and `Array#splice` augment array-like objects correctly.
+ *
+ * Firefox < 10, IE compatibility mode, and IE < 9 have buggy Array `shift()`
+ * and `splice()` functions that fail to remove the last element, `value[0]`,
+ * of array-like objects even though the `length` property is set to `0`.
+ * The `shift()` method is buggy in IE 8 compatibility mode, while `splice()`
+ * is buggy regardless of mode in IE < 9 and buggy in compatibility mode in IE 9.
+ *
+ * @memberOf _.support
+ * @type boolean
+ */
+ support.spliceObjects = (arrayRef.splice.call(object, 0, 1), !object[0]);
+
+ /**
+ * Detect lack of support for accessing string characters by index.
+ *
+ * IE < 8 can't access characters by index and IE 8 can only access
+ * characters by index on string literals.
+ *
+ * @memberOf _.support
+ * @type boolean
+ */
+ support.unindexedChars = ('x'[0] + Object('x')[0]) != 'xx';
+
+ /**
+ * Detect if a DOM node's [[Class]] is resolvable (all but IE < 9)
+ * and that the JS engine errors when attempting to coerce an object to
+ * a string without a `toString` function.
+ *
+ * @memberOf _.support
+ * @type boolean
+ */
+ try {
+ support.nodeClass = !(toString.call(document) == objectClass && !({ 'toString': 0 } + ''));
+ } catch(e) {
+ support.nodeClass = true;
+ }
+ }(1));
+
+ /**
+ * By default, the template delimiters used by Lo-Dash are similar to those in
+ * embedded Ruby (ERB). Change the following template settings to use alternative
+ * delimiters.
+ *
+ * @static
+ * @memberOf _
+ * @type Object
+ */
+ lodash.templateSettings = {
+
+ /**
+ * Used to detect `data` property values to be HTML-escaped.
+ *
+ * @memberOf _.templateSettings
+ * @type RegExp
+ */
+ 'escape': /<%-([\s\S]+?)%>/g,
+
+ /**
+ * Used to detect code to be evaluated.
+ *
+ * @memberOf _.templateSettings
+ * @type RegExp
+ */
+ 'evaluate': /<%([\s\S]+?)%>/g,
+
+ /**
+ * Used to detect `data` property values to inject.
+ *
+ * @memberOf _.templateSettings
+ * @type RegExp
+ */
+ 'interpolate': reInterpolate,
+
+ /**
+ * Used to reference the data object in the template text.
+ *
+ * @memberOf _.templateSettings
+ * @type string
+ */
+ 'variable': '',
+
+ /**
+ * Used to import variables into the compiled template.
+ *
+ * @memberOf _.templateSettings
+ * @type Object
+ */
+ 'imports': {
+
+ /**
+ * A reference to the `lodash` function.
+ *
+ * @memberOf _.templateSettings.imports
+ * @type Function
+ */
+ '_': lodash
+ }
+ };
+
+ /*--------------------------------------------------------------------------*/
+
+ /**
+ * The template used to create iterator functions.
+ *
+ * @private
+ * @param {Object} data The data object used to populate the text.
+ * @returns {string} Returns the interpolated text.
+ */
+ var iteratorTemplate = function(obj) {
+
+ var __p = 'var index, iterable = ' +
+ (obj.firstArg) +
+ ', result = ' +
+ (obj.init) +
+ ';\nif (!iterable) return result;\n' +
+ (obj.top) +
+ ';';
+ if (obj.array) {
+ __p += '\nvar length = iterable.length; index = -1;\nif (' +
+ (obj.array) +
+ ') { ';
+ if (support.unindexedChars) {
+ __p += '\n if (isString(iterable)) {\n iterable = iterable.split(\'\')\n } ';
+ }
+ __p += '\n while (++index < length) {\n ' +
+ (obj.loop) +
+ ';\n }\n}\nelse { ';
+ } else if (support.nonEnumArgs) {
+ __p += '\n var length = iterable.length; index = -1;\n if (length && isArguments(iterable)) {\n while (++index < length) {\n index += \'\';\n ' +
+ (obj.loop) +
+ ';\n }\n } else { ';
+ }
+
+ if (support.enumPrototypes) {
+ __p += '\n var skipProto = typeof iterable == \'function\';\n ';
+ }
+
+ if (support.enumErrorProps) {
+ __p += '\n var skipErrorProps = iterable === errorProto || iterable instanceof Error;\n ';
+ }
+
+ var conditions = []; if (support.enumPrototypes) { conditions.push('!(skipProto && index == "prototype")'); } if (support.enumErrorProps) { conditions.push('!(skipErrorProps && (index == "message" || index == "name"))'); }
+
+ if (obj.useHas && obj.keys) {
+ __p += '\n var ownIndex = -1,\n ownProps = objectTypes[typeof iterable] && keys(iterable),\n length = ownProps ? ownProps.length : 0;\n\n while (++ownIndex < length) {\n index = ownProps[ownIndex];\n';
+ if (conditions.length) {
+ __p += ' if (' +
+ (conditions.join(' && ')) +
+ ') {\n ';
+ }
+ __p +=
+ (obj.loop) +
+ '; ';
+ if (conditions.length) {
+ __p += '\n }';
+ }
+ __p += '\n } ';
+ } else {
+ __p += '\n for (index in iterable) {\n';
+ if (obj.useHas) { conditions.push("hasOwnProperty.call(iterable, index)"); } if (conditions.length) {
+ __p += ' if (' +
+ (conditions.join(' && ')) +
+ ') {\n ';
+ }
+ __p +=
+ (obj.loop) +
+ '; ';
+ if (conditions.length) {
+ __p += '\n }';
+ }
+ __p += '\n } ';
+ if (support.nonEnumShadows) {
+ __p += '\n\n if (iterable !== objectProto) {\n var ctor = iterable.constructor,\n isProto = iterable === (ctor && ctor.prototype),\n className = iterable === stringProto ? stringClass : iterable === errorProto ? errorClass : toString.call(iterable),\n nonEnum = nonEnumProps[className];\n ';
+ for (k = 0; k < 7; k++) {
+ __p += '\n index = \'' +
+ (obj.shadowedProps[k]) +
+ '\';\n if ((!(isProto && nonEnum[index]) && hasOwnProperty.call(iterable, index))';
+ if (!obj.useHas) {
+ __p += ' || (!nonEnum[index] && iterable[index] !== objectProto[index])';
+ }
+ __p += ') {\n ' +
+ (obj.loop) +
+ ';\n } ';
+ }
+ __p += '\n } ';
+ }
+
+ }
+
+ if (obj.array || support.nonEnumArgs) {
+ __p += '\n}';
+ }
+ __p +=
+ (obj.bottom) +
+ ';\nreturn result';
+
+ return __p
+ };
+
+ /*--------------------------------------------------------------------------*/
+
+ /**
+ * The base implementation of `_.bind` that creates the bound function and
+ * sets its meta data.
+ *
+ * @private
+ * @param {Array} bindData The bind data array.
+ * @returns {Function} Returns the new bound function.
+ */
+ function baseBind(bindData) {
+ var func = bindData[0],
+ partialArgs = bindData[2],
+ thisArg = bindData[4];
+
+ function bound() {
+ // `Function#bind` spec
+ // http://es5.github.io/#x15.3.4.5
+ if (partialArgs) {
+ // avoid `arguments` object deoptimizations by using `slice` instead
+ // of `Array.prototype.slice.call` and not assigning `arguments` to a
+ // variable as a ternary expression
+ var args = slice(partialArgs);
+ push.apply(args, arguments);
+ }
+ // mimic the constructor's `return` behavior
+ // http://es5.github.io/#x13.2.2
+ if (this instanceof bound) {
+ // ensure `new bound` is an instance of `func`
+ var thisBinding = baseCreate(func.prototype),
+ result = func.apply(thisBinding, args || arguments);
+ return isObject(result) ? result : thisBinding;
+ }
+ return func.apply(thisArg, args || arguments);
+ }
+ setBindData(bound, bindData);
+ return bound;
+ }
+
+ /**
+ * The base implementation of `_.clone` without argument juggling or support
+ * for `thisArg` binding.
+ *
+ * @private
+ * @param {*} value The value to clone.
+ * @param {boolean} [isDeep=false] Specify a deep clone.
+ * @param {Function} [callback] The function to customize cloning values.
+ * @param {Array} [stackA=[]] Tracks traversed source objects.
+ * @param {Array} [stackB=[]] Associates clones with source counterparts.
+ * @returns {*} Returns the cloned value.
+ */
+ function baseClone(value, isDeep, callback, stackA, stackB) {
+ if (callback) {
+ var result = callback(value);
+ if (typeof result != 'undefined') {
+ return result;
+ }
+ }
+ // inspect [[Class]]
+ var isObj = isObject(value);
+ if (isObj) {
+ var className = toString.call(value);
+ if (!cloneableClasses[className] || (!support.nodeClass && isNode(value))) {
+ return value;
+ }
+ var ctor = ctorByClass[className];
+ switch (className) {
+ case boolClass:
+ case dateClass:
+ return new ctor(+value);
+
+ case numberClass:
+ case stringClass:
+ return new ctor(value);
+
+ case regexpClass:
+ result = ctor(value.source, reFlags.exec(value));
+ result.lastIndex = value.lastIndex;
+ return result;
+ }
+ } else {
+ return value;
+ }
+ var isArr = isArray(value);
+ if (isDeep) {
+ // check for circular references and return corresponding clone
+ var initedStack = !stackA;
+ stackA || (stackA = getArray());
+ stackB || (stackB = getArray());
+
+ var length = stackA.length;
+ while (length--) {
+ if (stackA[length] == value) {
+ return stackB[length];
+ }
+ }
+ result = isArr ? ctor(value.length) : {};
+ }
+ else {
+ result = isArr ? slice(value) : assign({}, value);
+ }
+ // add array properties assigned by `RegExp#exec`
+ if (isArr) {
+ if (hasOwnProperty.call(value, 'index')) {
+ result.index = value.index;
+ }
+ if (hasOwnProperty.call(value, 'input')) {
+ result.input = value.input;
+ }
+ }
+ // exit for shallow clone
+ if (!isDeep) {
+ return result;
+ }
+ // add the source value to the stack of traversed objects
+ // and associate it with its clone
+ stackA.push(value);
+ stackB.push(result);
+
+ // recursively populate clone (susceptible to call stack limits)
+ (isArr ? baseEach : forOwn)(value, function(objValue, key) {
+ result[key] = baseClone(objValue, isDeep, callback, stackA, stackB);
+ });
+
+ if (initedStack) {
+ releaseArray(stackA);
+ releaseArray(stackB);
+ }
+ return result;
+ }
+
+ /**
+ * The base implementation of `_.create` without support for assigning
+ * properties to the created object.
+ *
+ * @private
+ * @param {Object} prototype The object to inherit from.
+ * @returns {Object} Returns the new object.
+ */
+ function baseCreate(prototype, properties) {
+ return isObject(prototype) ? nativeCreate(prototype) : {};
+ }
+ // fallback for browsers without `Object.create`
+ if (!nativeCreate) {
+ baseCreate = (function() {
+ function Object() {}
+ return function(prototype) {
+ if (isObject(prototype)) {
+ Object.prototype = prototype;
+ var result = new Object;
+ Object.prototype = null;
+ }
+ return result || context.Object();
+ };
+ }());
+ }
+
+ /**
+ * The base implementation of `_.createCallback` without support for creating
+ * "_.pluck" or "_.where" style callbacks.
+ *
+ * @private
+ * @param {*} [func=identity] The value to convert to a callback.
+ * @param {*} [thisArg] The `this` binding of the created callback.
+ * @param {number} [argCount] The number of arguments the callback accepts.
+ * @returns {Function} Returns a callback function.
+ */
+ function baseCreateCallback(func, thisArg, argCount) {
+ if (typeof func != 'function') {
+ return identity;
+ }
+ // exit early for no `thisArg` or already bound by `Function#bind`
+ if (typeof thisArg == 'undefined' || !('prototype' in func)) {
+ return func;
+ }
+ var bindData = func.__bindData__;
+ if (typeof bindData == 'undefined') {
+ if (support.funcNames) {
+ bindData = !func.name;
+ }
+ bindData = bindData || !support.funcDecomp;
+ if (!bindData) {
+ var source = fnToString.call(func);
+ if (!support.funcNames) {
+ bindData = !reFuncName.test(source);
+ }
+ if (!bindData) {
+ // checks if `func` references the `this` keyword and stores the result
+ bindData = reThis.test(source);
+ setBindData(func, bindData);
+ }
+ }
+ }
+ // exit early if there are no `this` references or `func` is bound
+ if (bindData === false || (bindData !== true && bindData[1] & 1)) {
+ return func;
+ }
+ switch (argCount) {
+ case 1: return function(value) {
+ return func.call(thisArg, value);
+ };
+ case 2: return function(a, b) {
+ return func.call(thisArg, a, b);
+ };
+ case 3: return function(value, index, collection) {
+ return func.call(thisArg, value, index, collection);
+ };
+ case 4: return function(accumulator, value, index, collection) {
+ return func.call(thisArg, accumulator, value, index, collection);
+ };
+ }
+ return bind(func, thisArg);
+ }
+
+ /**
+ * The base implementation of `createWrapper` that creates the wrapper and
+ * sets its meta data.
+ *
+ * @private
+ * @param {Array} bindData The bind data array.
+ * @returns {Function} Returns the new function.
+ */
+ function baseCreateWrapper(bindData) {
+ var func = bindData[0],
+ bitmask = bindData[1],
+ partialArgs = bindData[2],
+ partialRightArgs = bindData[3],
+ thisArg = bindData[4],
+ arity = bindData[5];
+
+ var isBind = bitmask & 1,
+ isBindKey = bitmask & 2,
+ isCurry = bitmask & 4,
+ isCurryBound = bitmask & 8,
+ key = func;
+
+ function bound() {
+ var thisBinding = isBind ? thisArg : this;
+ if (partialArgs) {
+ var args = slice(partialArgs);
+ push.apply(args, arguments);
+ }
+ if (partialRightArgs || isCurry) {
+ args || (args = slice(arguments));
+ if (partialRightArgs) {
+ push.apply(args, partialRightArgs);
+ }
+ if (isCurry && args.length < arity) {
+ bitmask |= 16 & ~32;
+ return baseCreateWrapper([func, (isCurryBound ? bitmask : bitmask & ~3), args, null, thisArg, arity]);
+ }
+ }
+ args || (args = arguments);
+ if (isBindKey) {
+ func = thisBinding[key];
+ }
+ if (this instanceof bound) {
+ thisBinding = baseCreate(func.prototype);
+ var result = func.apply(thisBinding, args);
+ return isObject(result) ? result : thisBinding;
+ }
+ return func.apply(thisBinding, args);
+ }
+ setBindData(bound, bindData);
+ return bound;
+ }
+
+ /**
+ * The base implementation of `_.difference` that accepts a single array
+ * of values to exclude.
+ *
+ * @private
+ * @param {Array} array The array to process.
+ * @param {Array} [values] The array of values to exclude.
+ * @returns {Array} Returns a new array of filtered values.
+ */
+ function baseDifference(array, values) {
+ var index = -1,
+ indexOf = getIndexOf(),
+ length = array ? array.length : 0,
+ isLarge = length >= largeArraySize && indexOf === baseIndexOf,
+ result = [];
+
+ if (isLarge) {
+ var cache = createCache(values);
+ if (cache) {
+ indexOf = cacheIndexOf;
+ values = cache;
+ } else {
+ isLarge = false;
+ }
+ }
+ while (++index < length) {
+ var value = array[index];
+ if (indexOf(values, value) < 0) {
+ result.push(value);
+ }
+ }
+ if (isLarge) {
+ releaseObject(values);
+ }
+ return result;
+ }
+
+ /**
+ * The base implementation of `_.flatten` without support for callback
+ * shorthands or `thisArg` binding.
+ *
+ * @private
+ * @param {Array} array The array to flatten.
+ * @param {boolean} [isShallow=false] A flag to restrict flattening to a single level.
+ * @param {boolean} [isStrict=false] A flag to restrict flattening to arrays and `arguments` objects.
+ * @param {number} [fromIndex=0] The index to start from.
+ * @returns {Array} Returns a new flattened array.
+ */
+ function baseFlatten(array, isShallow, isStrict, fromIndex) {
+ var index = (fromIndex || 0) - 1,
+ length = array ? array.length : 0,
+ result = [];
+
+ while (++index < length) {
+ var value = array[index];
+
+ if (value && typeof value == 'object' && typeof value.length == 'number'
+ && (isArray(value) || isArguments(value))) {
+ // recursively flatten arrays (susceptible to call stack limits)
+ if (!isShallow) {
+ value = baseFlatten(value, isShallow, isStrict);
+ }
+ var valIndex = -1,
+ valLength = value.length,
+ resIndex = result.length;
+
+ result.length += valLength;
+ while (++valIndex < valLength) {
+ result[resIndex++] = value[valIndex];
+ }
+ } else if (!isStrict) {
+ result.push(value);
+ }
+ }
+ return result;
+ }
+
+ /**
+ * The base implementation of `_.isEqual`, without support for `thisArg` binding,
+ * that allows partial "_.where" style comparisons.
+ *
+ * @private
+ * @param {*} a The value to compare.
+ * @param {*} b The other value to compare.
+ * @param {Function} [callback] The function to customize comparing values.
+ * @param {Function} [isWhere=false] A flag to indicate performing partial comparisons.
+ * @param {Array} [stackA=[]] Tracks traversed `a` objects.
+ * @param {Array} [stackB=[]] Tracks traversed `b` objects.
+ * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
+ */
+ function baseIsEqual(a, b, callback, isWhere, stackA, stackB) {
+ // used to indicate that when comparing objects, `a` has at least the properties of `b`
+ if (callback) {
+ var result = callback(a, b);
+ if (typeof result != 'undefined') {
+ return !!result;
+ }
+ }
+ // exit early for identical values
+ if (a === b) {
+ // treat `+0` vs. `-0` as not equal
+ return a !== 0 || (1 / a == 1 / b);
+ }
+ var type = typeof a,
+ otherType = typeof b;
+
+ // exit early for unlike primitive values
+ if (a === a &&
+ !(a && objectTypes[type]) &&
+ !(b && objectTypes[otherType])) {
+ return false;
+ }
+ // exit early for `null` and `undefined` avoiding ES3's Function#call behavior
+ // http://es5.github.io/#x15.3.4.4
+ if (a == null || b == null) {
+ return a === b;
+ }
+ // compare [[Class]] names
+ var className = toString.call(a),
+ otherClass = toString.call(b);
+
+ if (className == argsClass) {
+ className = objectClass;
+ }
+ if (otherClass == argsClass) {
+ otherClass = objectClass;
+ }
+ if (className != otherClass) {
+ return false;
+ }
+ switch (className) {
+ case boolClass:
+ case dateClass:
+ // coerce dates and booleans to numbers, dates to milliseconds and booleans
+ // to `1` or `0` treating invalid dates coerced to `NaN` as not equal
+ return +a == +b;
+
+ case numberClass:
+ // treat `NaN` vs. `NaN` as equal
+ return (a != +a)
+ ? b != +b
+ // but treat `+0` vs. `-0` as not equal
+ : (a == 0 ? (1 / a == 1 / b) : a == +b);
+
+ case regexpClass:
+ case stringClass:
+ // coerce regexes to strings (http://es5.github.io/#x15.10.6.4)
+ // treat string primitives and their corresponding object instances as equal
+ return a == String(b);
+ }
+ var isArr = className == arrayClass;
+ if (!isArr) {
+ // unwrap any `lodash` wrapped values
+ var aWrapped = hasOwnProperty.call(a, '__wrapped__'),
+ bWrapped = hasOwnProperty.call(b, '__wrapped__');
+
+ if (aWrapped || bWrapped) {
+ return baseIsEqual(aWrapped ? a.__wrapped__ : a, bWrapped ? b.__wrapped__ : b, callback, isWhere, stackA, stackB);
+ }
+ // exit for functions and DOM nodes
+ if (className != objectClass || (!support.nodeClass && (isNode(a) || isNode(b)))) {
+ return false;
+ }
+ // in older versions of Opera, `arguments` objects have `Array` constructors
+ var ctorA = !support.argsObject && isArguments(a) ? Object : a.constructor,
+ ctorB = !support.argsObject && isArguments(b) ? Object : b.constructor;
+
+ // non `Object` object instances with different constructors are not equal
+ if (ctorA != ctorB &&
+ !(isFunction(ctorA) && ctorA instanceof ctorA && isFunction(ctorB) && ctorB instanceof ctorB) &&
+ ('constructor' in a && 'constructor' in b)
+ ) {
+ return false;
+ }
+ }
+ // assume cyclic structures are equal
+ // the algorithm for detecting cyclic structures is adapted from ES 5.1
+ // section 15.12.3, abstract operation `JO` (http://es5.github.io/#x15.12.3)
+ var initedStack = !stackA;
+ stackA || (stackA = getArray());
+ stackB || (stackB = getArray());
+
+ var length = stackA.length;
+ while (length--) {
+ if (stackA[length] == a) {
+ return stackB[length] == b;
+ }
+ }
+ var size = 0;
+ result = true;
+
+ // add `a` and `b` to the stack of traversed objects
+ stackA.push(a);
+ stackB.push(b);
+
+ // recursively compare objects and arrays (susceptible to call stack limits)
+ if (isArr) {
+ // compare lengths to determine if a deep comparison is necessary
+ length = a.length;
+ size = b.length;
+ result = size == length;
+
+ if (result || isWhere) {
+ // deep compare the contents, ignoring non-numeric properties
+ while (size--) {
+ var index = length,
+ value = b[size];
+
+ if (isWhere) {
+ while (index--) {
+ if ((result = baseIsEqual(a[index], value, callback, isWhere, stackA, stackB))) {
+ break;
+ }
+ }
+ } else if (!(result = baseIsEqual(a[size], value, callback, isWhere, stackA, stackB))) {
+ break;
+ }
+ }
+ }
+ }
+ else {
+ // deep compare objects using `forIn`, instead of `forOwn`, to avoid `Object.keys`
+ // which, in this case, is more costly
+ forIn(b, function(value, key, b) {
+ if (hasOwnProperty.call(b, key)) {
+ // count the number of properties.
+ size++;
+ // deep compare each property value.
+ return (result = hasOwnProperty.call(a, key) && baseIsEqual(a[key], value, callback, isWhere, stackA, stackB));
+ }
+ });
+
+ if (result && !isWhere) {
+ // ensure both objects have the same number of properties
+ forIn(a, function(value, key, a) {
+ if (hasOwnProperty.call(a, key)) {
+ // `size` will be `-1` if `a` has more properties than `b`
+ return (result = --size > -1);
+ }
+ });
+ }
+ }
+ stackA.pop();
+ stackB.pop();
+
+ if (initedStack) {
+ releaseArray(stackA);
+ releaseArray(stackB);
+ }
+ return result;
+ }
+
+ /**
+ * The base implementation of `_.merge` without argument juggling or support
+ * for `thisArg` binding.
+ *
+ * @private
+ * @param {Object} object The destination object.
+ * @param {Object} source The source object.
+ * @param {Function} [callback] The function to customize merging properties.
+ * @param {Array} [stackA=[]] Tracks traversed source objects.
+ * @param {Array} [stackB=[]] Associates values with source counterparts.
+ */
+ function baseMerge(object, source, callback, stackA, stackB) {
+ (isArray(source) ? forEach : forOwn)(source, function(source, key) {
+ var found,
+ isArr,
+ result = source,
+ value = object[key];
+
+ if (source && ((isArr = isArray(source)) || isPlainObject(source))) {
+ // avoid merging previously merged cyclic sources
+ var stackLength = stackA.length;
+ while (stackLength--) {
+ if ((found = stackA[stackLength] == source)) {
+ value = stackB[stackLength];
+ break;
+ }
+ }
+ if (!found) {
+ var isShallow;
+ if (callback) {
+ result = callback(value, source);
+ if ((isShallow = typeof result != 'undefined')) {
+ value = result;
+ }
+ }
+ if (!isShallow) {
+ value = isArr
+ ? (isArray(value) ? value : [])
+ : (isPlainObject(value) ? value : {});
+ }
+ // add `source` and associated `value` to the stack of traversed objects
+ stackA.push(source);
+ stackB.push(value);
+
+ // recursively merge objects and arrays (susceptible to call stack limits)
+ if (!isShallow) {
+ baseMerge(value, source, callback, stackA, stackB);
+ }
+ }
+ }
+ else {
+ if (callback) {
+ result = callback(value, source);
+ if (typeof result == 'undefined') {
+ result = source;
+ }
+ }
+ if (typeof result != 'undefined') {
+ value = result;
+ }
+ }
+ object[key] = value;
+ });
+ }
+
+ /**
+ * The base implementation of `_.random` without argument juggling or support
+ * for returning floating-point numbers.
+ *
+ * @private
+ * @param {number} min The minimum possible value.
+ * @param {number} max The maximum possible value.
+ * @returns {number} Returns a random number.
+ */
+ function baseRandom(min, max) {
+ return min + floor(nativeRandom() * (max - min + 1));
+ }
+
+ /**
+ * The base implementation of `_.uniq` without support for callback shorthands
+ * or `thisArg` binding.
+ *
+ * @private
+ * @param {Array} array The array to process.
+ * @param {boolean} [isSorted=false] A flag to indicate that `array` is sorted.
+ * @param {Function} [callback] The function called per iteration.
+ * @returns {Array} Returns a duplicate-value-free array.
+ */
+ function baseUniq(array, isSorted, callback) {
+ var index = -1,
+ indexOf = getIndexOf(),
+ length = array ? array.length : 0,
+ result = [];
+
+ var isLarge = !isSorted && length >= largeArraySize && indexOf === baseIndexOf,
+ seen = (callback || isLarge) ? getArray() : result;
+
+ if (isLarge) {
+ var cache = createCache(seen);
+ indexOf = cacheIndexOf;
+ seen = cache;
+ }
+ while (++index < length) {
+ var value = array[index],
+ computed = callback ? callback(value, index, array) : value;
+
+ if (isSorted
+ ? !index || seen[seen.length - 1] !== computed
+ : indexOf(seen, computed) < 0
+ ) {
+ if (callback || isLarge) {
+ seen.push(computed);
+ }
+ result.push(value);
+ }
+ }
+ if (isLarge) {
+ releaseArray(seen.array);
+ releaseObject(seen);
+ } else if (callback) {
+ releaseArray(seen);
+ }
+ return result;
+ }
+
+ /**
+ * Creates a function that aggregates a collection, creating an object composed
+ * of keys generated from the results of running each element of the collection
+ * through a callback. The given `setter` function sets the keys and values
+ * of the composed object.
+ *
+ * @private
+ * @param {Function} setter The setter function.
+ * @returns {Function} Returns the new aggregator function.
+ */
+ function createAggregator(setter) {
+ return function(collection, callback, thisArg) {
+ var result = {};
+ callback = lodash.createCallback(callback, thisArg, 3);
+
+ if (isArray(collection)) {
+ var index = -1,
+ length = collection.length;
+
+ while (++index < length) {
+ var value = collection[index];
+ setter(result, value, callback(value, index, collection), collection);
+ }
+ } else {
+ baseEach(collection, function(value, key, collection) {
+ setter(result, value, callback(value, key, collection), collection);
+ });
+ }
+ return result;
+ };
+ }
+
+ /**
+ * Creates a function that, when called, either curries or invokes `func`
+ * with an optional `this` binding and partially applied arguments.
+ *
+ * @private
+ * @param {Function|string} func The function or method name to reference.
+ * @param {number} bitmask The bitmask of method flags to compose.
+ * The bitmask may be composed of the following flags:
+ * 1 - `_.bind`
+ * 2 - `_.bindKey`
+ * 4 - `_.curry`
+ * 8 - `_.curry` (bound)
+ * 16 - `_.partial`
+ * 32 - `_.partialRight`
+ * @param {Array} [partialArgs] An array of arguments to prepend to those
+ * provided to the new function.
+ * @param {Array} [partialRightArgs] An array of arguments to append to those
+ * provided to the new function.
+ * @param {*} [thisArg] The `this` binding of `func`.
+ * @param {number} [arity] The arity of `func`.
+ * @returns {Function} Returns the new function.
+ */
+ function createWrapper(func, bitmask, partialArgs, partialRightArgs, thisArg, arity) {
+ var isBind = bitmask & 1,
+ isBindKey = bitmask & 2,
+ isCurry = bitmask & 4,
+ isCurryBound = bitmask & 8,
+ isPartial = bitmask & 16,
+ isPartialRight = bitmask & 32;
+
+ if (!isBindKey && !isFunction(func)) {
+ throw new TypeError;
+ }
+ if (isPartial && !partialArgs.length) {
+ bitmask &= ~16;
+ isPartial = partialArgs = false;
+ }
+ if (isPartialRight && !partialRightArgs.length) {
+ bitmask &= ~32;
+ isPartialRight = partialRightArgs = false;
+ }
+ var bindData = func && func.__bindData__;
+ if (bindData && bindData !== true) {
+ // clone `bindData`
+ bindData = slice(bindData);
+ if (bindData[2]) {
+ bindData[2] = slice(bindData[2]);
+ }
+ if (bindData[3]) {
+ bindData[3] = slice(bindData[3]);
+ }
+ // set `thisBinding` is not previously bound
+ if (isBind && !(bindData[1] & 1)) {
+ bindData[4] = thisArg;
+ }
+ // set if previously bound but not currently (subsequent curried functions)
+ if (!isBind && bindData[1] & 1) {
+ bitmask |= 8;
+ }
+ // set curried arity if not yet set
+ if (isCurry && !(bindData[1] & 4)) {
+ bindData[5] = arity;
+ }
+ // append partial left arguments
+ if (isPartial) {
+ push.apply(bindData[2] || (bindData[2] = []), partialArgs);
+ }
+ // append partial right arguments
+ if (isPartialRight) {
+ unshift.apply(bindData[3] || (bindData[3] = []), partialRightArgs);
+ }
+ // merge flags
+ bindData[1] |= bitmask;
+ return createWrapper.apply(null, bindData);
+ }
+ // fast path for `_.bind`
+ var creater = (bitmask == 1 || bitmask === 17) ? baseBind : baseCreateWrapper;
+ return creater([func, bitmask, partialArgs, partialRightArgs, thisArg, arity]);
+ }
+
+ /**
+ * Creates compiled iteration functions.
+ *
+ * @private
+ * @param {...Object} [options] The compile options object(s).
+ * @param {string} [options.array] Code to determine if the iterable is an array or array-like.
+ * @param {boolean} [options.useHas] Specify using `hasOwnProperty` checks in the object loop.
+ * @param {Function} [options.keys] A reference to `_.keys` for use in own property iteration.
+ * @param {string} [options.args] A comma separated string of iteration function arguments.
+ * @param {string} [options.top] Code to execute before the iteration branches.
+ * @param {string} [options.loop] Code to execute in the object loop.
+ * @param {string} [options.bottom] Code to execute after the iteration branches.
+ * @returns {Function} Returns the compiled function.
+ */
+ function createIterator() {
+ // data properties
+ iteratorData.shadowedProps = shadowedProps;
+
+ // iterator options
+ iteratorData.array = iteratorData.bottom = iteratorData.loop = iteratorData.top = '';
+ iteratorData.init = 'iterable';
+ iteratorData.useHas = true;
+
+ // merge options into a template data object
+ for (var object, index = 0; object = arguments[index]; index++) {
+ for (var key in object) {
+ iteratorData[key] = object[key];
+ }
+ }
+ var args = iteratorData.args;
+ iteratorData.firstArg = /^[^,]+/.exec(args)[0];
+
+ // create the function factory
+ var factory = Function(
+ 'baseCreateCallback, errorClass, errorProto, hasOwnProperty, ' +
+ 'indicatorObject, isArguments, isArray, isString, keys, objectProto, ' +
+ 'objectTypes, nonEnumProps, stringClass, stringProto, toString',
+ 'return function(' + args + ') {\n' + iteratorTemplate(iteratorData) + '\n}'
+ );
+
+ // return the compiled function
+ return factory(
+ baseCreateCallback, errorClass, errorProto, hasOwnProperty,
+ indicatorObject, isArguments, isArray, isString, iteratorData.keys, objectProto,
+ objectTypes, nonEnumProps, stringClass, stringProto, toString
+ );
+ }
+
+ /**
+ * Used by `escape` to convert characters to HTML entities.
+ *
+ * @private
+ * @param {string} match The matched character to escape.
+ * @returns {string} Returns the escaped character.
+ */
+ function escapeHtmlChar(match) {
+ return htmlEscapes[match];
+ }
+
+ /**
+ * Gets the appropriate "indexOf" function. If the `_.indexOf` method is
+ * customized, this method returns the custom method, otherwise it returns
+ * the `baseIndexOf` function.
+ *
+ * @private
+ * @returns {Function} Returns the "indexOf" function.
+ */
+ function getIndexOf() {
+ var result = (result = lodash.indexOf) === indexOf ? baseIndexOf : result;
+ return result;
+ }
+
+ /**
+ * Checks if `value` is a native function.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if the `value` is a native function, else `false`.
+ */
+ function isNative(value) {
+ return typeof value == 'function' && reNative.test(value);
+ }
+
+ /**
+ * Sets `this` binding data on a given function.
+ *
+ * @private
+ * @param {Function} func The function to set data on.
+ * @param {Array} value The data array to set.
+ */
+ var setBindData = !defineProperty ? noop : function(func, value) {
+ descriptor.value = value;
+ defineProperty(func, '__bindData__', descriptor);
+ };
+
+ /**
+ * A fallback implementation of `isPlainObject` which checks if a given value
+ * is an object created by the `Object` constructor, assuming objects created
+ * by the `Object` constructor have no inherited enumerable properties and that
+ * there are no `Object.prototype` extensions.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.
+ */
+ function shimIsPlainObject(value) {
+ var ctor,
+ result;
+
+ // avoid non Object objects, `arguments` objects, and DOM elements
+ if (!(value && toString.call(value) == objectClass) ||
+ (ctor = value.constructor, isFunction(ctor) && !(ctor instanceof ctor)) ||
+ (!support.argsClass && isArguments(value)) ||
+ (!support.nodeClass && isNode(value))) {
+ return false;
+ }
+ // IE < 9 iterates inherited properties before own properties. If the first
+ // iterated property is an object's own property then there are no inherited
+ // enumerable properties.
+ if (support.ownLast) {
+ forIn(value, function(value, key, object) {
+ result = hasOwnProperty.call(object, key);
+ return false;
+ });
+ return result !== false;
+ }
+ // In most environments an object's own properties are iterated before
+ // its inherited properties. If the last iterated property is an object's
+ // own property then there are no inherited enumerable properties.
+ forIn(value, function(value, key) {
+ result = key;
+ });
+ return typeof result == 'undefined' || hasOwnProperty.call(value, result);
+ }
+
+ /**
+ * Used by `unescape` to convert HTML entities to characters.
+ *
+ * @private
+ * @param {string} match The matched character to unescape.
+ * @returns {string} Returns the unescaped character.
+ */
+ function unescapeHtmlChar(match) {
+ return htmlUnescapes[match];
+ }
+
+ /*--------------------------------------------------------------------------*/
+
+ /**
+ * Checks if `value` is an `arguments` object.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if the `value` is an `arguments` object, else `false`.
+ * @example
+ *
+ * (function() { return _.isArguments(arguments); })(1, 2, 3);
+ * // => true
+ *
+ * _.isArguments([1, 2, 3]);
+ * // => false
+ */
+ function isArguments(value) {
+ return value && typeof value == 'object' && typeof value.length == 'number' &&
+ toString.call(value) == argsClass || false;
+ }
+ // fallback for browsers that can't detect `arguments` objects by [[Class]]
+ if (!support.argsClass) {
+ isArguments = function(value) {
+ return value && typeof value == 'object' && typeof value.length == 'number' &&
+ hasOwnProperty.call(value, 'callee') && !propertyIsEnumerable.call(value, 'callee') || false;
+ };
+ }
+
+ /**
+ * Checks if `value` is an array.
+ *
+ * @static
+ * @memberOf _
+ * @type Function
+ * @category Objects
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if the `value` is an array, else `false`.
+ * @example
+ *
+ * (function() { return _.isArray(arguments); })();
+ * // => false
+ *
+ * _.isArray([1, 2, 3]);
+ * // => true
+ */
+ var isArray = nativeIsArray || function(value) {
+ return value && typeof value == 'object' && typeof value.length == 'number' &&
+ toString.call(value) == arrayClass || false;
+ };
+
+ /**
+ * A fallback implementation of `Object.keys` which produces an array of the
+ * given object's own enumerable property names.
+ *
+ * @private
+ * @type Function
+ * @param {Object} object The object to inspect.
+ * @returns {Array} Returns an array of property names.
+ */
+ var shimKeys = createIterator({
+ 'args': 'object',
+ 'init': '[]',
+ 'top': 'if (!(objectTypes[typeof object])) return result',
+ 'loop': 'result.push(index)'
+ });
+
+ /**
+ * Creates an array composed of the own enumerable property names of an object.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {Object} object The object to inspect.
+ * @returns {Array} Returns an array of property names.
+ * @example
+ *
+ * _.keys({ 'one': 1, 'two': 2, 'three': 3 });
+ * // => ['one', 'two', 'three'] (property order is not guaranteed across environments)
+ */
+ var keys = !nativeKeys ? shimKeys : function(object) {
+ if (!isObject(object)) {
+ return [];
+ }
+ if ((support.enumPrototypes && typeof object == 'function') ||
+ (support.nonEnumArgs && object.length && isArguments(object))) {
+ return shimKeys(object);
+ }
+ return nativeKeys(object);
+ };
+
+ /** Reusable iterator options shared by `each`, `forIn`, and `forOwn` */
+ var eachIteratorOptions = {
+ 'args': 'collection, callback, thisArg',
+ 'top': "callback = callback && typeof thisArg == 'undefined' ? callback : baseCreateCallback(callback, thisArg, 3)",
+ 'array': "typeof length == 'number'",
+ 'keys': keys,
+ 'loop': 'if (callback(iterable[index], index, collection) === false) return result'
+ };
+
+ /** Reusable iterator options for `assign` and `defaults` */
+ var defaultsIteratorOptions = {
+ 'args': 'object, source, guard',
+ 'top':
+ 'var args = arguments,\n' +
+ ' argsIndex = 0,\n' +
+ " argsLength = typeof guard == 'number' ? 2 : args.length;\n" +
+ 'while (++argsIndex < argsLength) {\n' +
+ ' iterable = args[argsIndex];\n' +
+ ' if (iterable && objectTypes[typeof iterable]) {',
+ 'keys': keys,
+ 'loop': "if (typeof result[index] == 'undefined') result[index] = iterable[index]",
+ 'bottom': ' }\n}'
+ };
+
+ /** Reusable iterator options for `forIn` and `forOwn` */
+ var forOwnIteratorOptions = {
+ 'top': 'if (!objectTypes[typeof iterable]) return result;\n' + eachIteratorOptions.top,
+ 'array': false
+ };
+
+ /**
+ * Used to convert characters to HTML entities:
+ *
+ * Though the `>` character is escaped for symmetry, characters like `>` and `/`
+ * don't require escaping in HTML and have no special meaning unless they're part
+ * of a tag or an unquoted attribute value.
+ * http://mathiasbynens.be/notes/ambiguous-ampersands (under "semi-related fun fact")
+ */
+ var htmlEscapes = {
+ '&': '&',
+ '<': '<',
+ '>': '>',
+ '"': '"',
+ "'": '''
+ };
+
+ /** Used to convert HTML entities to characters */
+ var htmlUnescapes = invert(htmlEscapes);
+
+ /** Used to match HTML entities and HTML characters */
+ var reEscapedHtml = RegExp('(' + keys(htmlUnescapes).join('|') + ')', 'g'),
+ reUnescapedHtml = RegExp('[' + keys(htmlEscapes).join('') + ']', 'g');
+
+ /**
+ * A function compiled to iterate `arguments` objects, arrays, objects, and
+ * strings consistenly across environments, executing the callback for each
+ * element in the collection. The callback is bound to `thisArg` and invoked
+ * with three arguments; (value, index|key, collection). Callbacks may exit
+ * iteration early by explicitly returning `false`.
+ *
+ * @private
+ * @type Function
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function} [callback=identity] The function called per iteration.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Array|Object|string} Returns `collection`.
+ */
+ var baseEach = createIterator(eachIteratorOptions);
+
+ /*--------------------------------------------------------------------------*/
+
+ /**
+ * Assigns own enumerable properties of source object(s) to the destination
+ * object. Subsequent sources will overwrite property assignments of previous
+ * sources. If a callback is provided it will be executed to produce the
+ * assigned values. The callback is bound to `thisArg` and invoked with two
+ * arguments; (objectValue, sourceValue).
+ *
+ * @static
+ * @memberOf _
+ * @type Function
+ * @alias extend
+ * @category Objects
+ * @param {Object} object The destination object.
+ * @param {...Object} [source] The source objects.
+ * @param {Function} [callback] The function to customize assigning values.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Object} Returns the destination object.
+ * @example
+ *
+ * _.assign({ 'name': 'fred' }, { 'employer': 'slate' });
+ * // => { 'name': 'fred', 'employer': 'slate' }
+ *
+ * var defaults = _.partialRight(_.assign, function(a, b) {
+ * return typeof a == 'undefined' ? b : a;
+ * });
+ *
+ * var object = { 'name': 'barney' };
+ * defaults(object, { 'name': 'fred', 'employer': 'slate' });
+ * // => { 'name': 'barney', 'employer': 'slate' }
+ */
+ var assign = createIterator(defaultsIteratorOptions, {
+ 'top':
+ defaultsIteratorOptions.top.replace(';',
+ ';\n' +
+ "if (argsLength > 3 && typeof args[argsLength - 2] == 'function') {\n" +
+ ' var callback = baseCreateCallback(args[--argsLength - 1], args[argsLength--], 2);\n' +
+ "} else if (argsLength > 2 && typeof args[argsLength - 1] == 'function') {\n" +
+ ' callback = args[--argsLength];\n' +
+ '}'
+ ),
+ 'loop': 'result[index] = callback ? callback(result[index], iterable[index]) : iterable[index]'
+ });
+
+ /**
+ * Creates a clone of `value`. If `isDeep` is `true` nested objects will also
+ * be cloned, otherwise they will be assigned by reference. If a callback
+ * is provided it will be executed to produce the cloned values. If the
+ * callback returns `undefined` cloning will be handled by the method instead.
+ * The callback is bound to `thisArg` and invoked with one argument; (value).
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} value The value to clone.
+ * @param {boolean} [isDeep=false] Specify a deep clone.
+ * @param {Function} [callback] The function to customize cloning values.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {*} Returns the cloned value.
+ * @example
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 36 },
+ * { 'name': 'fred', 'age': 40 }
+ * ];
+ *
+ * var shallow = _.clone(characters);
+ * shallow[0] === characters[0];
+ * // => true
+ *
+ * var deep = _.clone(characters, true);
+ * deep[0] === characters[0];
+ * // => false
+ *
+ * _.mixin({
+ * 'clone': _.partialRight(_.clone, function(value) {
+ * return _.isElement(value) ? value.cloneNode(false) : undefined;
+ * })
+ * });
+ *
+ * var clone = _.clone(document.body);
+ * clone.childNodes.length;
+ * // => 0
+ */
+ function clone(value, isDeep, callback, thisArg) {
+ // allows working with "Collections" methods without using their `index`
+ // and `collection` arguments for `isDeep` and `callback`
+ if (typeof isDeep != 'boolean' && isDeep != null) {
+ thisArg = callback;
+ callback = isDeep;
+ isDeep = false;
+ }
+ return baseClone(value, isDeep, typeof callback == 'function' && baseCreateCallback(callback, thisArg, 1));
+ }
+
+ /**
+ * Creates a deep clone of `value`. If a callback is provided it will be
+ * executed to produce the cloned values. If the callback returns `undefined`
+ * cloning will be handled by the method instead. The callback is bound to
+ * `thisArg` and invoked with one argument; (value).
+ *
+ * Note: This method is loosely based on the structured clone algorithm. Functions
+ * and DOM nodes are **not** cloned. The enumerable properties of `arguments` objects and
+ * objects created by constructors other than `Object` are cloned to plain `Object` objects.
+ * See http://www.w3.org/TR/html5/infrastructure.html#internal-structured-cloning-algorithm.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} value The value to deep clone.
+ * @param {Function} [callback] The function to customize cloning values.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {*} Returns the deep cloned value.
+ * @example
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 36 },
+ * { 'name': 'fred', 'age': 40 }
+ * ];
+ *
+ * var deep = _.cloneDeep(characters);
+ * deep[0] === characters[0];
+ * // => false
+ *
+ * var view = {
+ * 'label': 'docs',
+ * 'node': element
+ * };
+ *
+ * var clone = _.cloneDeep(view, function(value) {
+ * return _.isElement(value) ? value.cloneNode(true) : undefined;
+ * });
+ *
+ * clone.node == view.node;
+ * // => false
+ */
+ function cloneDeep(value, callback, thisArg) {
+ return baseClone(value, true, typeof callback == 'function' && baseCreateCallback(callback, thisArg, 1));
+ }
+
+ /**
+ * Creates an object that inherits from the given `prototype` object. If a
+ * `properties` object is provided its own enumerable properties are assigned
+ * to the created object.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {Object} prototype The object to inherit from.
+ * @param {Object} [properties] The properties to assign to the object.
+ * @returns {Object} Returns the new object.
+ * @example
+ *
+ * function Shape() {
+ * this.x = 0;
+ * this.y = 0;
+ * }
+ *
+ * function Circle() {
+ * Shape.call(this);
+ * }
+ *
+ * Circle.prototype = _.create(Shape.prototype, { 'constructor': Circle });
+ *
+ * var circle = new Circle;
+ * circle instanceof Circle;
+ * // => true
+ *
+ * circle instanceof Shape;
+ * // => true
+ */
+ function create(prototype, properties) {
+ var result = baseCreate(prototype);
+ return properties ? assign(result, properties) : result;
+ }
+
+ /**
+ * Assigns own enumerable properties of source object(s) to the destination
+ * object for all destination properties that resolve to `undefined`. Once a
+ * property is set, additional defaults of the same property will be ignored.
+ *
+ * @static
+ * @memberOf _
+ * @type Function
+ * @category Objects
+ * @param {Object} object The destination object.
+ * @param {...Object} [source] The source objects.
+ * @param- {Object} [guard] Allows working with `_.reduce` without using its
+ * `key` and `object` arguments as sources.
+ * @returns {Object} Returns the destination object.
+ * @example
+ *
+ * var object = { 'name': 'barney' };
+ * _.defaults(object, { 'name': 'fred', 'employer': 'slate' });
+ * // => { 'name': 'barney', 'employer': 'slate' }
+ */
+ var defaults = createIterator(defaultsIteratorOptions);
+
+ /**
+ * This method is like `_.findIndex` except that it returns the key of the
+ * first element that passes the callback check, instead of the element itself.
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {Object} object The object to search.
+ * @param {Function|Object|string} [callback=identity] The function called per
+ * iteration. If a property name or object is provided it will be used to
+ * create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {string|undefined} Returns the key of the found element, else `undefined`.
+ * @example
+ *
+ * var characters = {
+ * 'barney': { 'age': 36, 'blocked': false },
+ * 'fred': { 'age': 40, 'blocked': true },
+ * 'pebbles': { 'age': 1, 'blocked': false }
+ * };
+ *
+ * _.findKey(characters, function(chr) {
+ * return chr.age < 40;
+ * });
+ * // => 'barney' (property order is not guaranteed across environments)
+ *
+ * // using "_.where" callback shorthand
+ * _.findKey(characters, { 'age': 1 });
+ * // => 'pebbles'
+ *
+ * // using "_.pluck" callback shorthand
+ * _.findKey(characters, 'blocked');
+ * // => 'fred'
+ */
+ function findKey(object, callback, thisArg) {
+ var result;
+ callback = lodash.createCallback(callback, thisArg, 3);
+ forOwn(object, function(value, key, object) {
+ if (callback(value, key, object)) {
+ result = key;
+ return false;
+ }
+ });
+ return result;
+ }
+
+ /**
+ * This method is like `_.findKey` except that it iterates over elements
+ * of a `collection` in the opposite order.
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {Object} object The object to search.
+ * @param {Function|Object|string} [callback=identity] The function called per
+ * iteration. If a property name or object is provided it will be used to
+ * create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {string|undefined} Returns the key of the found element, else `undefined`.
+ * @example
+ *
+ * var characters = {
+ * 'barney': { 'age': 36, 'blocked': true },
+ * 'fred': { 'age': 40, 'blocked': false },
+ * 'pebbles': { 'age': 1, 'blocked': true }
+ * };
+ *
+ * _.findLastKey(characters, function(chr) {
+ * return chr.age < 40;
+ * });
+ * // => returns `pebbles`, assuming `_.findKey` returns `barney`
+ *
+ * // using "_.where" callback shorthand
+ * _.findLastKey(characters, { 'age': 40 });
+ * // => 'fred'
+ *
+ * // using "_.pluck" callback shorthand
+ * _.findLastKey(characters, 'blocked');
+ * // => 'pebbles'
+ */
+ function findLastKey(object, callback, thisArg) {
+ var result;
+ callback = lodash.createCallback(callback, thisArg, 3);
+ forOwnRight(object, function(value, key, object) {
+ if (callback(value, key, object)) {
+ result = key;
+ return false;
+ }
+ });
+ return result;
+ }
+
+ /**
+ * Iterates over own and inherited enumerable properties of an object,
+ * executing the callback for each property. The callback is bound to `thisArg`
+ * and invoked with three arguments; (value, key, object). Callbacks may exit
+ * iteration early by explicitly returning `false`.
+ *
+ * @static
+ * @memberOf _
+ * @type Function
+ * @category Objects
+ * @param {Object} object The object to iterate over.
+ * @param {Function} [callback=identity] The function called per iteration.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Object} Returns `object`.
+ * @example
+ *
+ * function Shape() {
+ * this.x = 0;
+ * this.y = 0;
+ * }
+ *
+ * Shape.prototype.move = function(x, y) {
+ * this.x += x;
+ * this.y += y;
+ * };
+ *
+ * _.forIn(new Shape, function(value, key) {
+ * console.log(key);
+ * });
+ * // => logs 'x', 'y', and 'move' (property order is not guaranteed across environments)
+ */
+ var forIn = createIterator(eachIteratorOptions, forOwnIteratorOptions, {
+ 'useHas': false
+ });
+
+ /**
+ * This method is like `_.forIn` except that it iterates over elements
+ * of a `collection` in the opposite order.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {Object} object The object to iterate over.
+ * @param {Function} [callback=identity] The function called per iteration.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Object} Returns `object`.
+ * @example
+ *
+ * function Shape() {
+ * this.x = 0;
+ * this.y = 0;
+ * }
+ *
+ * Shape.prototype.move = function(x, y) {
+ * this.x += x;
+ * this.y += y;
+ * };
+ *
+ * _.forInRight(new Shape, function(value, key) {
+ * console.log(key);
+ * });
+ * // => logs 'move', 'y', and 'x' assuming `_.forIn ` logs 'x', 'y', and 'move'
+ */
+ function forInRight(object, callback, thisArg) {
+ var pairs = [];
+
+ forIn(object, function(value, key) {
+ pairs.push(key, value);
+ });
+
+ var length = pairs.length;
+ callback = baseCreateCallback(callback, thisArg, 3);
+ while (length--) {
+ if (callback(pairs[length--], pairs[length], object) === false) {
+ break;
+ }
+ }
+ return object;
+ }
+
+ /**
+ * Iterates over own enumerable properties of an object, executing the callback
+ * for each property. The callback is bound to `thisArg` and invoked with three
+ * arguments; (value, key, object). Callbacks may exit iteration early by
+ * explicitly returning `false`.
+ *
+ * @static
+ * @memberOf _
+ * @type Function
+ * @category Objects
+ * @param {Object} object The object to iterate over.
+ * @param {Function} [callback=identity] The function called per iteration.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Object} Returns `object`.
+ * @example
+ *
+ * _.forOwn({ '0': 'zero', '1': 'one', 'length': 2 }, function(num, key) {
+ * console.log(key);
+ * });
+ * // => logs '0', '1', and 'length' (property order is not guaranteed across environments)
+ */
+ var forOwn = createIterator(eachIteratorOptions, forOwnIteratorOptions);
+
+ /**
+ * This method is like `_.forOwn` except that it iterates over elements
+ * of a `collection` in the opposite order.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {Object} object The object to iterate over.
+ * @param {Function} [callback=identity] The function called per iteration.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Object} Returns `object`.
+ * @example
+ *
+ * _.forOwnRight({ '0': 'zero', '1': 'one', 'length': 2 }, function(num, key) {
+ * console.log(key);
+ * });
+ * // => logs 'length', '1', and '0' assuming `_.forOwn` logs '0', '1', and 'length'
+ */
+ function forOwnRight(object, callback, thisArg) {
+ var props = keys(object),
+ length = props.length;
+
+ callback = baseCreateCallback(callback, thisArg, 3);
+ while (length--) {
+ var key = props[length];
+ if (callback(object[key], key, object) === false) {
+ break;
+ }
+ }
+ return object;
+ }
+
+ /**
+ * Creates a sorted array of property names of all enumerable properties,
+ * own and inherited, of `object` that have function values.
+ *
+ * @static
+ * @memberOf _
+ * @alias methods
+ * @category Objects
+ * @param {Object} object The object to inspect.
+ * @returns {Array} Returns an array of property names that have function values.
+ * @example
+ *
+ * _.functions(_);
+ * // => ['all', 'any', 'bind', 'bindAll', 'clone', 'compact', 'compose', ...]
+ */
+ function functions(object) {
+ var result = [];
+ forIn(object, function(value, key) {
+ if (isFunction(value)) {
+ result.push(key);
+ }
+ });
+ return result.sort();
+ }
+
+ /**
+ * Checks if the specified property name exists as a direct property of `object`,
+ * instead of an inherited property.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {Object} object The object to inspect.
+ * @param {string} key The name of the property to check.
+ * @returns {boolean} Returns `true` if key is a direct property, else `false`.
+ * @example
+ *
+ * _.has({ 'a': 1, 'b': 2, 'c': 3 }, 'b');
+ * // => true
+ */
+ function has(object, key) {
+ return object ? hasOwnProperty.call(object, key) : false;
+ }
+
+ /**
+ * Creates an object composed of the inverted keys and values of the given object.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {Object} object The object to invert.
+ * @returns {Object} Returns the created inverted object.
+ * @example
+ *
+ * _.invert({ 'first': 'fred', 'second': 'barney' });
+ * // => { 'fred': 'first', 'barney': 'second' }
+ */
+ function invert(object) {
+ var index = -1,
+ props = keys(object),
+ length = props.length,
+ result = {};
+
+ while (++index < length) {
+ var key = props[index];
+ result[object[key]] = key;
+ }
+ return result;
+ }
+
+ /**
+ * Checks if `value` is a boolean value.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if the `value` is a boolean value, else `false`.
+ * @example
+ *
+ * _.isBoolean(null);
+ * // => false
+ */
+ function isBoolean(value) {
+ return value === true || value === false ||
+ value && typeof value == 'object' && toString.call(value) == boolClass || false;
+ }
+
+ /**
+ * Checks if `value` is a date.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if the `value` is a date, else `false`.
+ * @example
+ *
+ * _.isDate(new Date);
+ * // => true
+ */
+ function isDate(value) {
+ return value && typeof value == 'object' && toString.call(value) == dateClass || false;
+ }
+
+ /**
+ * Checks if `value` is a DOM element.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if the `value` is a DOM element, else `false`.
+ * @example
+ *
+ * _.isElement(document.body);
+ * // => true
+ */
+ function isElement(value) {
+ return value && value.nodeType === 1 || false;
+ }
+
+ /**
+ * Checks if `value` is empty. Arrays, strings, or `arguments` objects with a
+ * length of `0` and objects with no own enumerable properties are considered
+ * "empty".
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {Array|Object|string} value The value to inspect.
+ * @returns {boolean} Returns `true` if the `value` is empty, else `false`.
+ * @example
+ *
+ * _.isEmpty([1, 2, 3]);
+ * // => false
+ *
+ * _.isEmpty({});
+ * // => true
+ *
+ * _.isEmpty('');
+ * // => true
+ */
+ function isEmpty(value) {
+ var result = true;
+ if (!value) {
+ return result;
+ }
+ var className = toString.call(value),
+ length = value.length;
+
+ if ((className == arrayClass || className == stringClass ||
+ (support.argsClass ? className == argsClass : isArguments(value))) ||
+ (className == objectClass && typeof length == 'number' && isFunction(value.splice))) {
+ return !length;
+ }
+ forOwn(value, function() {
+ return (result = false);
+ });
+ return result;
+ }
+
+ /**
+ * Performs a deep comparison between two values to determine if they are
+ * equivalent to each other. If a callback is provided it will be executed
+ * to compare values. If the callback returns `undefined` comparisons will
+ * be handled by the method instead. The callback is bound to `thisArg` and
+ * invoked with two arguments; (a, b).
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} a The value to compare.
+ * @param {*} b The other value to compare.
+ * @param {Function} [callback] The function to customize comparing values.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
+ * @example
+ *
+ * var object = { 'name': 'fred' };
+ * var copy = { 'name': 'fred' };
+ *
+ * object == copy;
+ * // => false
+ *
+ * _.isEqual(object, copy);
+ * // => true
+ *
+ * var words = ['hello', 'goodbye'];
+ * var otherWords = ['hi', 'goodbye'];
+ *
+ * _.isEqual(words, otherWords, function(a, b) {
+ * var reGreet = /^(?:hello|hi)$/i,
+ * aGreet = _.isString(a) && reGreet.test(a),
+ * bGreet = _.isString(b) && reGreet.test(b);
+ *
+ * return (aGreet || bGreet) ? (aGreet == bGreet) : undefined;
+ * });
+ * // => true
+ */
+ function isEqual(a, b, callback, thisArg) {
+ return baseIsEqual(a, b, typeof callback == 'function' && baseCreateCallback(callback, thisArg, 2));
+ }
+
+ /**
+ * Checks if `value` is, or can be coerced to, a finite number.
+ *
+ * Note: This is not the same as native `isFinite` which will return true for
+ * booleans and empty strings. See http://es5.github.io/#x15.1.2.5.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if the `value` is finite, else `false`.
+ * @example
+ *
+ * _.isFinite(-101);
+ * // => true
+ *
+ * _.isFinite('10');
+ * // => true
+ *
+ * _.isFinite(true);
+ * // => false
+ *
+ * _.isFinite('');
+ * // => false
+ *
+ * _.isFinite(Infinity);
+ * // => false
+ */
+ function isFinite(value) {
+ return nativeIsFinite(value) && !nativeIsNaN(parseFloat(value));
+ }
+
+ /**
+ * Checks if `value` is a function.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if the `value` is a function, else `false`.
+ * @example
+ *
+ * _.isFunction(_);
+ * // => true
+ */
+ function isFunction(value) {
+ return typeof value == 'function';
+ }
+ // fallback for older versions of Chrome and Safari
+ if (isFunction(/x/)) {
+ isFunction = function(value) {
+ return typeof value == 'function' && toString.call(value) == funcClass;
+ };
+ }
+
+ /**
+ * Checks if `value` is the language type of Object.
+ * (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if the `value` is an object, else `false`.
+ * @example
+ *
+ * _.isObject({});
+ * // => true
+ *
+ * _.isObject([1, 2, 3]);
+ * // => true
+ *
+ * _.isObject(1);
+ * // => false
+ */
+ function isObject(value) {
+ // check if the value is the ECMAScript language type of Object
+ // http://es5.github.io/#x8
+ // and avoid a V8 bug
+ // http://code.google.com/p/v8/issues/detail?id=2291
+ return !!(value && objectTypes[typeof value]);
+ }
+
+ /**
+ * Checks if `value` is `NaN`.
+ *
+ * Note: This is not the same as native `isNaN` which will return `true` for
+ * `undefined` and other non-numeric values. See http://es5.github.io/#x15.1.2.4.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if the `value` is `NaN`, else `false`.
+ * @example
+ *
+ * _.isNaN(NaN);
+ * // => true
+ *
+ * _.isNaN(new Number(NaN));
+ * // => true
+ *
+ * isNaN(undefined);
+ * // => true
+ *
+ * _.isNaN(undefined);
+ * // => false
+ */
+ function isNaN(value) {
+ // `NaN` as a primitive is the only value that is not equal to itself
+ // (perform the [[Class]] check first to avoid errors with some host objects in IE)
+ return isNumber(value) && value != +value;
+ }
+
+ /**
+ * Checks if `value` is `null`.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if the `value` is `null`, else `false`.
+ * @example
+ *
+ * _.isNull(null);
+ * // => true
+ *
+ * _.isNull(undefined);
+ * // => false
+ */
+ function isNull(value) {
+ return value === null;
+ }
+
+ /**
+ * Checks if `value` is a number.
+ *
+ * Note: `NaN` is considered a number. See http://es5.github.io/#x8.5.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if the `value` is a number, else `false`.
+ * @example
+ *
+ * _.isNumber(8.4 * 5);
+ * // => true
+ */
+ function isNumber(value) {
+ return typeof value == 'number' ||
+ value && typeof value == 'object' && toString.call(value) == numberClass || false;
+ }
+
+ /**
+ * Checks if `value` is an object created by the `Object` constructor.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.
+ * @example
+ *
+ * function Shape() {
+ * this.x = 0;
+ * this.y = 0;
+ * }
+ *
+ * _.isPlainObject(new Shape);
+ * // => false
+ *
+ * _.isPlainObject([1, 2, 3]);
+ * // => false
+ *
+ * _.isPlainObject({ 'x': 0, 'y': 0 });
+ * // => true
+ */
+ var isPlainObject = !getPrototypeOf ? shimIsPlainObject : function(value) {
+ if (!(value && toString.call(value) == objectClass) || (!support.argsClass && isArguments(value))) {
+ return false;
+ }
+ var valueOf = value.valueOf,
+ objProto = isNative(valueOf) && (objProto = getPrototypeOf(valueOf)) && getPrototypeOf(objProto);
+
+ return objProto
+ ? (value == objProto || getPrototypeOf(value) == objProto)
+ : shimIsPlainObject(value);
+ };
+
+ /**
+ * Checks if `value` is a regular expression.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if the `value` is a regular expression, else `false`.
+ * @example
+ *
+ * _.isRegExp(/fred/);
+ * // => true
+ */
+ function isRegExp(value) {
+ return value && objectTypes[typeof value] && toString.call(value) == regexpClass || false;
+ }
+
+ /**
+ * Checks if `value` is a string.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if the `value` is a string, else `false`.
+ * @example
+ *
+ * _.isString('fred');
+ * // => true
+ */
+ function isString(value) {
+ return typeof value == 'string' ||
+ value && typeof value == 'object' && toString.call(value) == stringClass || false;
+ }
+
+ /**
+ * Checks if `value` is `undefined`.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if the `value` is `undefined`, else `false`.
+ * @example
+ *
+ * _.isUndefined(void 0);
+ * // => true
+ */
+ function isUndefined(value) {
+ return typeof value == 'undefined';
+ }
+
+ /**
+ * Creates an object with the same keys as `object` and values generated by
+ * running each own enumerable property of `object` through the callback.
+ * The callback is bound to `thisArg` and invoked with three arguments;
+ * (value, key, object).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {Object} object The object to iterate over.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Array} Returns a new object with values of the results of each `callback` execution.
+ * @example
+ *
+ * _.mapValues({ 'a': 1, 'b': 2, 'c': 3} , function(num) { return num * 3; });
+ * // => { 'a': 3, 'b': 6, 'c': 9 }
+ *
+ * var characters = {
+ * 'fred': { 'name': 'fred', 'age': 40 },
+ * 'pebbles': { 'name': 'pebbles', 'age': 1 }
+ * };
+ *
+ * // using "_.pluck" callback shorthand
+ * _.mapValues(characters, 'age');
+ * // => { 'fred': 40, 'pebbles': 1 }
+ */
+ function mapValues(object, callback, thisArg) {
+ var result = {};
+ callback = lodash.createCallback(callback, thisArg, 3);
+
+ forOwn(object, function(value, key, object) {
+ result[key] = callback(value, key, object);
+ });
+ return result;
+ }
+
+ /**
+ * Recursively merges own enumerable properties of the source object(s), that
+ * don't resolve to `undefined` into the destination object. Subsequent sources
+ * will overwrite property assignments of previous sources. If a callback is
+ * provided it will be executed to produce the merged values of the destination
+ * and source properties. If the callback returns `undefined` merging will
+ * be handled by the method instead. The callback is bound to `thisArg` and
+ * invoked with two arguments; (objectValue, sourceValue).
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {Object} object The destination object.
+ * @param {...Object} [source] The source objects.
+ * @param {Function} [callback] The function to customize merging properties.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Object} Returns the destination object.
+ * @example
+ *
+ * var names = {
+ * 'characters': [
+ * { 'name': 'barney' },
+ * { 'name': 'fred' }
+ * ]
+ * };
+ *
+ * var ages = {
+ * 'characters': [
+ * { 'age': 36 },
+ * { 'age': 40 }
+ * ]
+ * };
+ *
+ * _.merge(names, ages);
+ * // => { 'characters': [{ 'name': 'barney', 'age': 36 }, { 'name': 'fred', 'age': 40 }] }
+ *
+ * var food = {
+ * 'fruits': ['apple'],
+ * 'vegetables': ['beet']
+ * };
+ *
+ * var otherFood = {
+ * 'fruits': ['banana'],
+ * 'vegetables': ['carrot']
+ * };
+ *
+ * _.merge(food, otherFood, function(a, b) {
+ * return _.isArray(a) ? a.concat(b) : undefined;
+ * });
+ * // => { 'fruits': ['apple', 'banana'], 'vegetables': ['beet', 'carrot] }
+ */
+ function merge(object) {
+ var args = arguments,
+ length = 2;
+
+ if (!isObject(object)) {
+ return object;
+ }
+ // allows working with `_.reduce` and `_.reduceRight` without using
+ // their `index` and `collection` arguments
+ if (typeof args[2] != 'number') {
+ length = args.length;
+ }
+ if (length > 3 && typeof args[length - 2] == 'function') {
+ var callback = baseCreateCallback(args[--length - 1], args[length--], 2);
+ } else if (length > 2 && typeof args[length - 1] == 'function') {
+ callback = args[--length];
+ }
+ var sources = slice(arguments, 1, length),
+ index = -1,
+ stackA = getArray(),
+ stackB = getArray();
+
+ while (++index < length) {
+ baseMerge(object, sources[index], callback, stackA, stackB);
+ }
+ releaseArray(stackA);
+ releaseArray(stackB);
+ return object;
+ }
+
+ /**
+ * Creates a shallow clone of `object` excluding the specified properties.
+ * Property names may be specified as individual arguments or as arrays of
+ * property names. If a callback is provided it will be executed for each
+ * property of `object` omitting the properties the callback returns truey
+ * for. The callback is bound to `thisArg` and invoked with three arguments;
+ * (value, key, object).
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {Object} object The source object.
+ * @param {Function|...string|string[]} [callback] The properties to omit or the
+ * function called per iteration.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Object} Returns an object without the omitted properties.
+ * @example
+ *
+ * _.omit({ 'name': 'fred', 'age': 40 }, 'age');
+ * // => { 'name': 'fred' }
+ *
+ * _.omit({ 'name': 'fred', 'age': 40 }, function(value) {
+ * return typeof value == 'number';
+ * });
+ * // => { 'name': 'fred' }
+ */
+ function omit(object, callback, thisArg) {
+ var result = {};
+ if (typeof callback != 'function') {
+ var props = [];
+ forIn(object, function(value, key) {
+ props.push(key);
+ });
+ props = baseDifference(props, baseFlatten(arguments, true, false, 1));
+
+ var index = -1,
+ length = props.length;
+
+ while (++index < length) {
+ var key = props[index];
+ result[key] = object[key];
+ }
+ } else {
+ callback = lodash.createCallback(callback, thisArg, 3);
+ forIn(object, function(value, key, object) {
+ if (!callback(value, key, object)) {
+ result[key] = value;
+ }
+ });
+ }
+ return result;
+ }
+
+ /**
+ * Creates a two dimensional array of an object's key-value pairs,
+ * i.e. `[[key1, value1], [key2, value2]]`.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {Object} object The object to inspect.
+ * @returns {Array} Returns new array of key-value pairs.
+ * @example
+ *
+ * _.pairs({ 'barney': 36, 'fred': 40 });
+ * // => [['barney', 36], ['fred', 40]] (property order is not guaranteed across environments)
+ */
+ function pairs(object) {
+ var index = -1,
+ props = keys(object),
+ length = props.length,
+ result = Array(length);
+
+ while (++index < length) {
+ var key = props[index];
+ result[index] = [key, object[key]];
+ }
+ return result;
+ }
+
+ /**
+ * Creates a shallow clone of `object` composed of the specified properties.
+ * Property names may be specified as individual arguments or as arrays of
+ * property names. If a callback is provided it will be executed for each
+ * property of `object` picking the properties the callback returns truey
+ * for. The callback is bound to `thisArg` and invoked with three arguments;
+ * (value, key, object).
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {Object} object The source object.
+ * @param {Function|...string|string[]} [callback] The function called per
+ * iteration or property names to pick, specified as individual property
+ * names or arrays of property names.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Object} Returns an object composed of the picked properties.
+ * @example
+ *
+ * _.pick({ 'name': 'fred', '_userid': 'fred1' }, 'name');
+ * // => { 'name': 'fred' }
+ *
+ * _.pick({ 'name': 'fred', '_userid': 'fred1' }, function(value, key) {
+ * return key.charAt(0) != '_';
+ * });
+ * // => { 'name': 'fred' }
+ */
+ function pick(object, callback, thisArg) {
+ var result = {};
+ if (typeof callback != 'function') {
+ var index = -1,
+ props = baseFlatten(arguments, true, false, 1),
+ length = isObject(object) ? props.length : 0;
+
+ while (++index < length) {
+ var key = props[index];
+ if (key in object) {
+ result[key] = object[key];
+ }
+ }
+ } else {
+ callback = lodash.createCallback(callback, thisArg, 3);
+ forIn(object, function(value, key, object) {
+ if (callback(value, key, object)) {
+ result[key] = value;
+ }
+ });
+ }
+ return result;
+ }
+
+ /**
+ * An alternative to `_.reduce` this method transforms `object` to a new
+ * `accumulator` object which is the result of running each of its own
+ * enumerable properties through a callback, with each callback execution
+ * potentially mutating the `accumulator` object. The callback is bound to
+ * `thisArg` and invoked with four arguments; (accumulator, value, key, object).
+ * Callbacks may exit iteration early by explicitly returning `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {Array|Object} object The object to iterate over.
+ * @param {Function} [callback=identity] The function called per iteration.
+ * @param {*} [accumulator] The custom accumulator value.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {*} Returns the accumulated value.
+ * @example
+ *
+ * var squares = _.transform([1, 2, 3, 4, 5, 6, 7, 8, 9, 10], function(result, num) {
+ * num *= num;
+ * if (num % 2) {
+ * return result.push(num) < 3;
+ * }
+ * });
+ * // => [1, 9, 25]
+ *
+ * var mapped = _.transform({ 'a': 1, 'b': 2, 'c': 3 }, function(result, num, key) {
+ * result[key] = num * 3;
+ * });
+ * // => { 'a': 3, 'b': 6, 'c': 9 }
+ */
+ function transform(object, callback, accumulator, thisArg) {
+ var isArr = isArray(object);
+ if (accumulator == null) {
+ if (isArr) {
+ accumulator = [];
+ } else {
+ var ctor = object && object.constructor,
+ proto = ctor && ctor.prototype;
+
+ accumulator = baseCreate(proto);
+ }
+ }
+ if (callback) {
+ callback = lodash.createCallback(callback, thisArg, 4);
+ (isArr ? baseEach : forOwn)(object, function(value, index, object) {
+ return callback(accumulator, value, index, object);
+ });
+ }
+ return accumulator;
+ }
+
+ /**
+ * Creates an array composed of the own enumerable property values of `object`.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {Object} object The object to inspect.
+ * @returns {Array} Returns an array of property values.
+ * @example
+ *
+ * _.values({ 'one': 1, 'two': 2, 'three': 3 });
+ * // => [1, 2, 3] (property order is not guaranteed across environments)
+ */
+ function values(object) {
+ var index = -1,
+ props = keys(object),
+ length = props.length,
+ result = Array(length);
+
+ while (++index < length) {
+ result[index] = object[props[index]];
+ }
+ return result;
+ }
+
+ /*--------------------------------------------------------------------------*/
+
+ /**
+ * Creates an array of elements from the specified indexes, or keys, of the
+ * `collection`. Indexes may be specified as individual arguments or as arrays
+ * of indexes.
+ *
+ * @static
+ * @memberOf _
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {...(number|number[]|string|string[])} [index] The indexes of `collection`
+ * to retrieve, specified as individual indexes or arrays of indexes.
+ * @returns {Array} Returns a new array of elements corresponding to the
+ * provided indexes.
+ * @example
+ *
+ * _.at(['a', 'b', 'c', 'd', 'e'], [0, 2, 4]);
+ * // => ['a', 'c', 'e']
+ *
+ * _.at(['fred', 'barney', 'pebbles'], 0, 2);
+ * // => ['fred', 'pebbles']
+ */
+ function at(collection) {
+ var args = arguments,
+ index = -1,
+ props = baseFlatten(args, true, false, 1),
+ length = (args[2] && args[2][args[1]] === collection) ? 1 : props.length,
+ result = Array(length);
+
+ if (support.unindexedChars && isString(collection)) {
+ collection = collection.split('');
+ }
+ while(++index < length) {
+ result[index] = collection[props[index]];
+ }
+ return result;
+ }
+
+ /**
+ * Checks if a given value is present in a collection using strict equality
+ * for comparisons, i.e. `===`. If `fromIndex` is negative, it is used as the
+ * offset from the end of the collection.
+ *
+ * @static
+ * @memberOf _
+ * @alias include
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {*} target The value to check for.
+ * @param {number} [fromIndex=0] The index to search from.
+ * @returns {boolean} Returns `true` if the `target` element is found, else `false`.
+ * @example
+ *
+ * _.contains([1, 2, 3], 1);
+ * // => true
+ *
+ * _.contains([1, 2, 3], 1, 2);
+ * // => false
+ *
+ * _.contains({ 'name': 'fred', 'age': 40 }, 'fred');
+ * // => true
+ *
+ * _.contains('pebbles', 'eb');
+ * // => true
+ */
+ function contains(collection, target, fromIndex) {
+ var index = -1,
+ indexOf = getIndexOf(),
+ length = collection ? collection.length : 0,
+ result = false;
+
+ fromIndex = (fromIndex < 0 ? nativeMax(0, length + fromIndex) : fromIndex) || 0;
+ if (isArray(collection)) {
+ result = indexOf(collection, target, fromIndex) > -1;
+ } else if (typeof length == 'number') {
+ result = (isString(collection) ? collection.indexOf(target, fromIndex) : indexOf(collection, target, fromIndex)) > -1;
+ } else {
+ baseEach(collection, function(value) {
+ if (++index >= fromIndex) {
+ return !(result = value === target);
+ }
+ });
+ }
+ return result;
+ }
+
+ /**
+ * Creates an object composed of keys generated from the results of running
+ * each element of `collection` through the callback. The corresponding value
+ * of each key is the number of times the key was returned by the callback.
+ * The callback is bound to `thisArg` and invoked with three arguments;
+ * (value, index|key, collection).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Object} Returns the composed aggregate object.
+ * @example
+ *
+ * _.countBy([4.3, 6.1, 6.4], function(num) { return Math.floor(num); });
+ * // => { '4': 1, '6': 2 }
+ *
+ * _.countBy([4.3, 6.1, 6.4], function(num) { return this.floor(num); }, Math);
+ * // => { '4': 1, '6': 2 }
+ *
+ * _.countBy(['one', 'two', 'three'], 'length');
+ * // => { '3': 2, '5': 1 }
+ */
+ var countBy = createAggregator(function(result, value, key) {
+ (hasOwnProperty.call(result, key) ? result[key]++ : result[key] = 1);
+ });
+
+ /**
+ * Checks if the given callback returns truey value for **all** elements of
+ * a collection. The callback is bound to `thisArg` and invoked with three
+ * arguments; (value, index|key, collection).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @alias all
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {boolean} Returns `true` if all elements passed the callback check,
+ * else `false`.
+ * @example
+ *
+ * _.every([true, 1, null, 'yes']);
+ * // => false
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 36 },
+ * { 'name': 'fred', 'age': 40 }
+ * ];
+ *
+ * // using "_.pluck" callback shorthand
+ * _.every(characters, 'age');
+ * // => true
+ *
+ * // using "_.where" callback shorthand
+ * _.every(characters, { 'age': 36 });
+ * // => false
+ */
+ function every(collection, callback, thisArg) {
+ var result = true;
+ callback = lodash.createCallback(callback, thisArg, 3);
+
+ if (isArray(collection)) {
+ var index = -1,
+ length = collection.length;
+
+ while (++index < length) {
+ if (!(result = !!callback(collection[index], index, collection))) {
+ break;
+ }
+ }
+ } else {
+ baseEach(collection, function(value, index, collection) {
+ return (result = !!callback(value, index, collection));
+ });
+ }
+ return result;
+ }
+
+ /**
+ * Iterates over elements of a collection, returning an array of all elements
+ * the callback returns truey for. The callback is bound to `thisArg` and
+ * invoked with three arguments; (value, index|key, collection).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @alias select
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Array} Returns a new array of elements that passed the callback check.
+ * @example
+ *
+ * var evens = _.filter([1, 2, 3, 4, 5, 6], function(num) { return num % 2 == 0; });
+ * // => [2, 4, 6]
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 36, 'blocked': false },
+ * { 'name': 'fred', 'age': 40, 'blocked': true }
+ * ];
+ *
+ * // using "_.pluck" callback shorthand
+ * _.filter(characters, 'blocked');
+ * // => [{ 'name': 'fred', 'age': 40, 'blocked': true }]
+ *
+ * // using "_.where" callback shorthand
+ * _.filter(characters, { 'age': 36 });
+ * // => [{ 'name': 'barney', 'age': 36, 'blocked': false }]
+ */
+ function filter(collection, callback, thisArg) {
+ var result = [];
+ callback = lodash.createCallback(callback, thisArg, 3);
+
+ if (isArray(collection)) {
+ var index = -1,
+ length = collection.length;
+
+ while (++index < length) {
+ var value = collection[index];
+ if (callback(value, index, collection)) {
+ result.push(value);
+ }
+ }
+ } else {
+ baseEach(collection, function(value, index, collection) {
+ if (callback(value, index, collection)) {
+ result.push(value);
+ }
+ });
+ }
+ return result;
+ }
+
+ /**
+ * Iterates over elements of a collection, returning the first element that
+ * the callback returns truey for. The callback is bound to `thisArg` and
+ * invoked with three arguments; (value, index|key, collection).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @alias detect, findWhere
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {*} Returns the found element, else `undefined`.
+ * @example
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 36, 'blocked': false },
+ * { 'name': 'fred', 'age': 40, 'blocked': true },
+ * { 'name': 'pebbles', 'age': 1, 'blocked': false }
+ * ];
+ *
+ * _.find(characters, function(chr) {
+ * return chr.age < 40;
+ * });
+ * // => { 'name': 'barney', 'age': 36, 'blocked': false }
+ *
+ * // using "_.where" callback shorthand
+ * _.find(characters, { 'age': 1 });
+ * // => { 'name': 'pebbles', 'age': 1, 'blocked': false }
+ *
+ * // using "_.pluck" callback shorthand
+ * _.find(characters, 'blocked');
+ * // => { 'name': 'fred', 'age': 40, 'blocked': true }
+ */
+ function find(collection, callback, thisArg) {
+ callback = lodash.createCallback(callback, thisArg, 3);
+
+ if (isArray(collection)) {
+ var index = -1,
+ length = collection.length;
+
+ while (++index < length) {
+ var value = collection[index];
+ if (callback(value, index, collection)) {
+ return value;
+ }
+ }
+ } else {
+ var result;
+ baseEach(collection, function(value, index, collection) {
+ if (callback(value, index, collection)) {
+ result = value;
+ return false;
+ }
+ });
+ return result;
+ }
+ }
+
+ /**
+ * This method is like `_.find` except that it iterates over elements
+ * of a `collection` from right to left.
+ *
+ * @static
+ * @memberOf _
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {*} Returns the found element, else `undefined`.
+ * @example
+ *
+ * _.findLast([1, 2, 3, 4], function(num) {
+ * return num % 2 == 1;
+ * });
+ * // => 3
+ */
+ function findLast(collection, callback, thisArg) {
+ var result;
+ callback = lodash.createCallback(callback, thisArg, 3);
+ forEachRight(collection, function(value, index, collection) {
+ if (callback(value, index, collection)) {
+ result = value;
+ return false;
+ }
+ });
+ return result;
+ }
+
+ /**
+ * Iterates over elements of a collection, executing the callback for each
+ * element. The callback is bound to `thisArg` and invoked with three arguments;
+ * (value, index|key, collection). Callbacks may exit iteration early by
+ * explicitly returning `false`.
+ *
+ * Note: As with other "Collections" methods, objects with a `length` property
+ * are iterated like arrays. To avoid this behavior `_.forIn` or `_.forOwn`
+ * may be used for object iteration.
+ *
+ * @static
+ * @memberOf _
+ * @alias each
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function} [callback=identity] The function called per iteration.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Array|Object|string} Returns `collection`.
+ * @example
+ *
+ * _([1, 2, 3]).forEach(function(num) { console.log(num); }).join(',');
+ * // => logs each number and returns '1,2,3'
+ *
+ * _.forEach({ 'one': 1, 'two': 2, 'three': 3 }, function(num) { console.log(num); });
+ * // => logs each number and returns the object (property order is not guaranteed across environments)
+ */
+ function forEach(collection, callback, thisArg) {
+ if (callback && typeof thisArg == 'undefined' && isArray(collection)) {
+ var index = -1,
+ length = collection.length;
+
+ while (++index < length) {
+ if (callback(collection[index], index, collection) === false) {
+ break;
+ }
+ }
+ } else {
+ baseEach(collection, callback, thisArg);
+ }
+ return collection;
+ }
+
+ /**
+ * This method is like `_.forEach` except that it iterates over elements
+ * of a `collection` from right to left.
+ *
+ * @static
+ * @memberOf _
+ * @alias eachRight
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function} [callback=identity] The function called per iteration.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Array|Object|string} Returns `collection`.
+ * @example
+ *
+ * _([1, 2, 3]).forEachRight(function(num) { console.log(num); }).join(',');
+ * // => logs each number from right to left and returns '3,2,1'
+ */
+ function forEachRight(collection, callback, thisArg) {
+ var iterable = collection,
+ length = collection ? collection.length : 0;
+
+ callback = callback && typeof thisArg == 'undefined' ? callback : baseCreateCallback(callback, thisArg, 3);
+ if (isArray(collection)) {
+ while (length--) {
+ if (callback(collection[length], length, collection) === false) {
+ break;
+ }
+ }
+ } else {
+ if (typeof length != 'number') {
+ var props = keys(collection);
+ length = props.length;
+ } else if (support.unindexedChars && isString(collection)) {
+ iterable = collection.split('');
+ }
+ baseEach(collection, function(value, key, collection) {
+ key = props ? props[--length] : --length;
+ return callback(iterable[key], key, collection);
+ });
+ }
+ return collection;
+ }
+
+ /**
+ * Creates an object composed of keys generated from the results of running
+ * each element of a collection through the callback. The corresponding value
+ * of each key is an array of the elements responsible for generating the key.
+ * The callback is bound to `thisArg` and invoked with three arguments;
+ * (value, index|key, collection).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`
+ *
+ * @static
+ * @memberOf _
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Object} Returns the composed aggregate object.
+ * @example
+ *
+ * _.groupBy([4.2, 6.1, 6.4], function(num) { return Math.floor(num); });
+ * // => { '4': [4.2], '6': [6.1, 6.4] }
+ *
+ * _.groupBy([4.2, 6.1, 6.4], function(num) { return this.floor(num); }, Math);
+ * // => { '4': [4.2], '6': [6.1, 6.4] }
+ *
+ * // using "_.pluck" callback shorthand
+ * _.groupBy(['one', 'two', 'three'], 'length');
+ * // => { '3': ['one', 'two'], '5': ['three'] }
+ */
+ var groupBy = createAggregator(function(result, value, key) {
+ (hasOwnProperty.call(result, key) ? result[key] : result[key] = []).push(value);
+ });
+
+ /**
+ * Creates an object composed of keys generated from the results of running
+ * each element of the collection through the given callback. The corresponding
+ * value of each key is the last element responsible for generating the key.
+ * The callback is bound to `thisArg` and invoked with three arguments;
+ * (value, index|key, collection).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Object} Returns the composed aggregate object.
+ * @example
+ *
+ * var keys = [
+ * { 'dir': 'left', 'code': 97 },
+ * { 'dir': 'right', 'code': 100 }
+ * ];
+ *
+ * _.indexBy(keys, 'dir');
+ * // => { 'left': { 'dir': 'left', 'code': 97 }, 'right': { 'dir': 'right', 'code': 100 } }
+ *
+ * _.indexBy(keys, function(key) { return String.fromCharCode(key.code); });
+ * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } }
+ *
+ * _.indexBy(characters, function(key) { this.fromCharCode(key.code); }, String);
+ * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } }
+ */
+ var indexBy = createAggregator(function(result, value, key) {
+ result[key] = value;
+ });
+
+ /**
+ * Invokes the method named by `methodName` on each element in the `collection`
+ * returning an array of the results of each invoked method. Additional arguments
+ * will be provided to each invoked method. If `methodName` is a function it
+ * will be invoked for, and `this` bound to, each element in the `collection`.
+ *
+ * @static
+ * @memberOf _
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|string} methodName The name of the method to invoke or
+ * the function invoked per iteration.
+ * @param {...*} [arg] Arguments to invoke the method with.
+ * @returns {Array} Returns a new array of the results of each invoked method.
+ * @example
+ *
+ * _.invoke([[5, 1, 7], [3, 2, 1]], 'sort');
+ * // => [[1, 5, 7], [1, 2, 3]]
+ *
+ * _.invoke([123, 456], String.prototype.split, '');
+ * // => [['1', '2', '3'], ['4', '5', '6']]
+ */
+ function invoke(collection, methodName) {
+ var args = slice(arguments, 2),
+ index = -1,
+ isFunc = typeof methodName == 'function',
+ length = collection ? collection.length : 0,
+ result = Array(typeof length == 'number' ? length : 0);
+
+ forEach(collection, function(value) {
+ result[++index] = (isFunc ? methodName : value[methodName]).apply(value, args);
+ });
+ return result;
+ }
+
+ /**
+ * Creates an array of values by running each element in the collection
+ * through the callback. The callback is bound to `thisArg` and invoked with
+ * three arguments; (value, index|key, collection).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @alias collect
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Array} Returns a new array of the results of each `callback` execution.
+ * @example
+ *
+ * _.map([1, 2, 3], function(num) { return num * 3; });
+ * // => [3, 6, 9]
+ *
+ * _.map({ 'one': 1, 'two': 2, 'three': 3 }, function(num) { return num * 3; });
+ * // => [3, 6, 9] (property order is not guaranteed across environments)
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 36 },
+ * { 'name': 'fred', 'age': 40 }
+ * ];
+ *
+ * // using "_.pluck" callback shorthand
+ * _.map(characters, 'name');
+ * // => ['barney', 'fred']
+ */
+ function map(collection, callback, thisArg) {
+ var index = -1,
+ length = collection ? collection.length : 0,
+ result = Array(typeof length == 'number' ? length : 0);
+
+ callback = lodash.createCallback(callback, thisArg, 3);
+ if (isArray(collection)) {
+ while (++index < length) {
+ result[index] = callback(collection[index], index, collection);
+ }
+ } else {
+ baseEach(collection, function(value, key, collection) {
+ result[++index] = callback(value, key, collection);
+ });
+ }
+ return result;
+ }
+
+ /**
+ * Retrieves the maximum value of a collection. If the collection is empty or
+ * falsey `-Infinity` is returned. If a callback is provided it will be executed
+ * for each value in the collection to generate the criterion by which the value
+ * is ranked. The callback is bound to `thisArg` and invoked with three
+ * arguments; (value, index, collection).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {*} Returns the maximum value.
+ * @example
+ *
+ * _.max([4, 2, 8, 6]);
+ * // => 8
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 36 },
+ * { 'name': 'fred', 'age': 40 }
+ * ];
+ *
+ * _.max(characters, function(chr) { return chr.age; });
+ * // => { 'name': 'fred', 'age': 40 };
+ *
+ * // using "_.pluck" callback shorthand
+ * _.max(characters, 'age');
+ * // => { 'name': 'fred', 'age': 40 };
+ */
+ function max(collection, callback, thisArg) {
+ var computed = -Infinity,
+ result = computed;
+
+ // allows working with functions like `_.map` without using
+ // their `index` argument as a callback
+ if (typeof callback != 'function' && thisArg && thisArg[callback] === collection) {
+ callback = null;
+ }
+ if (callback == null && isArray(collection)) {
+ var index = -1,
+ length = collection.length;
+
+ while (++index < length) {
+ var value = collection[index];
+ if (value > result) {
+ result = value;
+ }
+ }
+ } else {
+ callback = (callback == null && isString(collection))
+ ? charAtCallback
+ : lodash.createCallback(callback, thisArg, 3);
+
+ baseEach(collection, function(value, index, collection) {
+ var current = callback(value, index, collection);
+ if (current > computed) {
+ computed = current;
+ result = value;
+ }
+ });
+ }
+ return result;
+ }
+
+ /**
+ * Retrieves the minimum value of a collection. If the collection is empty or
+ * falsey `Infinity` is returned. If a callback is provided it will be executed
+ * for each value in the collection to generate the criterion by which the value
+ * is ranked. The callback is bound to `thisArg` and invoked with three
+ * arguments; (value, index, collection).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {*} Returns the minimum value.
+ * @example
+ *
+ * _.min([4, 2, 8, 6]);
+ * // => 2
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 36 },
+ * { 'name': 'fred', 'age': 40 }
+ * ];
+ *
+ * _.min(characters, function(chr) { return chr.age; });
+ * // => { 'name': 'barney', 'age': 36 };
+ *
+ * // using "_.pluck" callback shorthand
+ * _.min(characters, 'age');
+ * // => { 'name': 'barney', 'age': 36 };
+ */
+ function min(collection, callback, thisArg) {
+ var computed = Infinity,
+ result = computed;
+
+ // allows working with functions like `_.map` without using
+ // their `index` argument as a callback
+ if (typeof callback != 'function' && thisArg && thisArg[callback] === collection) {
+ callback = null;
+ }
+ if (callback == null && isArray(collection)) {
+ var index = -1,
+ length = collection.length;
+
+ while (++index < length) {
+ var value = collection[index];
+ if (value < result) {
+ result = value;
+ }
+ }
+ } else {
+ callback = (callback == null && isString(collection))
+ ? charAtCallback
+ : lodash.createCallback(callback, thisArg, 3);
+
+ baseEach(collection, function(value, index, collection) {
+ var current = callback(value, index, collection);
+ if (current < computed) {
+ computed = current;
+ result = value;
+ }
+ });
+ }
+ return result;
+ }
+
+ /**
+ * Retrieves the value of a specified property from all elements in the collection.
+ *
+ * @static
+ * @memberOf _
+ * @type Function
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {string} property The name of the property to pluck.
+ * @returns {Array} Returns a new array of property values.
+ * @example
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 36 },
+ * { 'name': 'fred', 'age': 40 }
+ * ];
+ *
+ * _.pluck(characters, 'name');
+ * // => ['barney', 'fred']
+ */
+ var pluck = map;
+
+ /**
+ * Reduces a collection to a value which is the accumulated result of running
+ * each element in the collection through the callback, where each successive
+ * callback execution consumes the return value of the previous execution. If
+ * `accumulator` is not provided the first element of the collection will be
+ * used as the initial `accumulator` value. The callback is bound to `thisArg`
+ * and invoked with four arguments; (accumulator, value, index|key, collection).
+ *
+ * @static
+ * @memberOf _
+ * @alias foldl, inject
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function} [callback=identity] The function called per iteration.
+ * @param {*} [accumulator] Initial value of the accumulator.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {*} Returns the accumulated value.
+ * @example
+ *
+ * var sum = _.reduce([1, 2, 3], function(sum, num) {
+ * return sum + num;
+ * });
+ * // => 6
+ *
+ * var mapped = _.reduce({ 'a': 1, 'b': 2, 'c': 3 }, function(result, num, key) {
+ * result[key] = num * 3;
+ * return result;
+ * }, {});
+ * // => { 'a': 3, 'b': 6, 'c': 9 }
+ */
+ function reduce(collection, callback, accumulator, thisArg) {
+ var noaccum = arguments.length < 3;
+ callback = lodash.createCallback(callback, thisArg, 4);
+
+ if (isArray(collection)) {
+ var index = -1,
+ length = collection.length;
+
+ if (noaccum) {
+ accumulator = collection[++index];
+ }
+ while (++index < length) {
+ accumulator = callback(accumulator, collection[index], index, collection);
+ }
+ } else {
+ baseEach(collection, function(value, index, collection) {
+ accumulator = noaccum
+ ? (noaccum = false, value)
+ : callback(accumulator, value, index, collection)
+ });
+ }
+ return accumulator;
+ }
+
+ /**
+ * This method is like `_.reduce` except that it iterates over elements
+ * of a `collection` from right to left.
+ *
+ * @static
+ * @memberOf _
+ * @alias foldr
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function} [callback=identity] The function called per iteration.
+ * @param {*} [accumulator] Initial value of the accumulator.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {*} Returns the accumulated value.
+ * @example
+ *
+ * var list = [[0, 1], [2, 3], [4, 5]];
+ * var flat = _.reduceRight(list, function(a, b) { return a.concat(b); }, []);
+ * // => [4, 5, 2, 3, 0, 1]
+ */
+ function reduceRight(collection, callback, accumulator, thisArg) {
+ var noaccum = arguments.length < 3;
+ callback = lodash.createCallback(callback, thisArg, 4);
+ forEachRight(collection, function(value, index, collection) {
+ accumulator = noaccum
+ ? (noaccum = false, value)
+ : callback(accumulator, value, index, collection);
+ });
+ return accumulator;
+ }
+
+ /**
+ * The opposite of `_.filter` this method returns the elements of a
+ * collection that the callback does **not** return truey for.
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Array} Returns a new array of elements that failed the callback check.
+ * @example
+ *
+ * var odds = _.reject([1, 2, 3, 4, 5, 6], function(num) { return num % 2 == 0; });
+ * // => [1, 3, 5]
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 36, 'blocked': false },
+ * { 'name': 'fred', 'age': 40, 'blocked': true }
+ * ];
+ *
+ * // using "_.pluck" callback shorthand
+ * _.reject(characters, 'blocked');
+ * // => [{ 'name': 'barney', 'age': 36, 'blocked': false }]
+ *
+ * // using "_.where" callback shorthand
+ * _.reject(characters, { 'age': 36 });
+ * // => [{ 'name': 'fred', 'age': 40, 'blocked': true }]
+ */
+ function reject(collection, callback, thisArg) {
+ callback = lodash.createCallback(callback, thisArg, 3);
+ return filter(collection, function(value, index, collection) {
+ return !callback(value, index, collection);
+ });
+ }
+
+ /**
+ * Retrieves a random element or `n` random elements from a collection.
+ *
+ * @static
+ * @memberOf _
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to sample.
+ * @param {number} [n] The number of elements to sample.
+ * @param- {Object} [guard] Allows working with functions like `_.map`
+ * without using their `index` arguments as `n`.
+ * @returns {Array} Returns the random sample(s) of `collection`.
+ * @example
+ *
+ * _.sample([1, 2, 3, 4]);
+ * // => 2
+ *
+ * _.sample([1, 2, 3, 4], 2);
+ * // => [3, 1]
+ */
+ function sample(collection, n, guard) {
+ if (collection && typeof collection.length != 'number') {
+ collection = values(collection);
+ } else if (support.unindexedChars && isString(collection)) {
+ collection = collection.split('');
+ }
+ if (n == null || guard) {
+ return collection ? collection[baseRandom(0, collection.length - 1)] : undefined;
+ }
+ var result = shuffle(collection);
+ result.length = nativeMin(nativeMax(0, n), result.length);
+ return result;
+ }
+
+ /**
+ * Creates an array of shuffled values, using a version of the Fisher-Yates
+ * shuffle. See http://en.wikipedia.org/wiki/Fisher-Yates_shuffle.
+ *
+ * @static
+ * @memberOf _
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to shuffle.
+ * @returns {Array} Returns a new shuffled collection.
+ * @example
+ *
+ * _.shuffle([1, 2, 3, 4, 5, 6]);
+ * // => [4, 1, 6, 3, 5, 2]
+ */
+ function shuffle(collection) {
+ var index = -1,
+ length = collection ? collection.length : 0,
+ result = Array(typeof length == 'number' ? length : 0);
+
+ forEach(collection, function(value) {
+ var rand = baseRandom(0, ++index);
+ result[index] = result[rand];
+ result[rand] = value;
+ });
+ return result;
+ }
+
+ /**
+ * Gets the size of the `collection` by returning `collection.length` for arrays
+ * and array-like objects or the number of own enumerable properties for objects.
+ *
+ * @static
+ * @memberOf _
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to inspect.
+ * @returns {number} Returns `collection.length` or number of own enumerable properties.
+ * @example
+ *
+ * _.size([1, 2]);
+ * // => 2
+ *
+ * _.size({ 'one': 1, 'two': 2, 'three': 3 });
+ * // => 3
+ *
+ * _.size('pebbles');
+ * // => 7
+ */
+ function size(collection) {
+ var length = collection ? collection.length : 0;
+ return typeof length == 'number' ? length : keys(collection).length;
+ }
+
+ /**
+ * Checks if the callback returns a truey value for **any** element of a
+ * collection. The function returns as soon as it finds a passing value and
+ * does not iterate over the entire collection. The callback is bound to
+ * `thisArg` and invoked with three arguments; (value, index|key, collection).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @alias any
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {boolean} Returns `true` if any element passed the callback check,
+ * else `false`.
+ * @example
+ *
+ * _.some([null, 0, 'yes', false], Boolean);
+ * // => true
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 36, 'blocked': false },
+ * { 'name': 'fred', 'age': 40, 'blocked': true }
+ * ];
+ *
+ * // using "_.pluck" callback shorthand
+ * _.some(characters, 'blocked');
+ * // => true
+ *
+ * // using "_.where" callback shorthand
+ * _.some(characters, { 'age': 1 });
+ * // => false
+ */
+ function some(collection, callback, thisArg) {
+ var result;
+ callback = lodash.createCallback(callback, thisArg, 3);
+
+ if (isArray(collection)) {
+ var index = -1,
+ length = collection.length;
+
+ while (++index < length) {
+ if ((result = callback(collection[index], index, collection))) {
+ break;
+ }
+ }
+ } else {
+ baseEach(collection, function(value, index, collection) {
+ return !(result = callback(value, index, collection));
+ });
+ }
+ return !!result;
+ }
+
+ /**
+ * Creates an array of elements, sorted in ascending order by the results of
+ * running each element in a collection through the callback. This method
+ * performs a stable sort, that is, it will preserve the original sort order
+ * of equal elements. The callback is bound to `thisArg` and invoked with
+ * three arguments; (value, index|key, collection).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an array of property names is provided for `callback` the collection
+ * will be sorted by each property value.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Array|Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Array} Returns a new array of sorted elements.
+ * @example
+ *
+ * _.sortBy([1, 2, 3], function(num) { return Math.sin(num); });
+ * // => [3, 1, 2]
+ *
+ * _.sortBy([1, 2, 3], function(num) { return this.sin(num); }, Math);
+ * // => [3, 1, 2]
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 36 },
+ * { 'name': 'fred', 'age': 40 },
+ * { 'name': 'barney', 'age': 26 },
+ * { 'name': 'fred', 'age': 30 }
+ * ];
+ *
+ * // using "_.pluck" callback shorthand
+ * _.map(_.sortBy(characters, 'age'), _.values);
+ * // => [['barney', 26], ['fred', 30], ['barney', 36], ['fred', 40]]
+ *
+ * // sorting by multiple properties
+ * _.map(_.sortBy(characters, ['name', 'age']), _.values);
+ * // = > [['barney', 26], ['barney', 36], ['fred', 30], ['fred', 40]]
+ */
+ function sortBy(collection, callback, thisArg) {
+ var index = -1,
+ isArr = isArray(callback),
+ length = collection ? collection.length : 0,
+ result = Array(typeof length == 'number' ? length : 0);
+
+ if (!isArr) {
+ callback = lodash.createCallback(callback, thisArg, 3);
+ }
+ forEach(collection, function(value, key, collection) {
+ var object = result[++index] = getObject();
+ if (isArr) {
+ object.criteria = map(callback, function(key) { return value[key]; });
+ } else {
+ (object.criteria = getArray())[0] = callback(value, key, collection);
+ }
+ object.index = index;
+ object.value = value;
+ });
+
+ length = result.length;
+ result.sort(compareAscending);
+ while (length--) {
+ var object = result[length];
+ result[length] = object.value;
+ if (!isArr) {
+ releaseArray(object.criteria);
+ }
+ releaseObject(object);
+ }
+ return result;
+ }
+
+ /**
+ * Converts the `collection` to an array.
+ *
+ * @static
+ * @memberOf _
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to convert.
+ * @returns {Array} Returns the new converted array.
+ * @example
+ *
+ * (function() { return _.toArray(arguments).slice(1); })(1, 2, 3, 4);
+ * // => [2, 3, 4]
+ */
+ function toArray(collection) {
+ if (collection && typeof collection.length == 'number') {
+ return (support.unindexedChars && isString(collection))
+ ? collection.split('')
+ : slice(collection);
+ }
+ return values(collection);
+ }
+
+ /**
+ * Performs a deep comparison of each element in a `collection` to the given
+ * `properties` object, returning an array of all elements that have equivalent
+ * property values.
+ *
+ * @static
+ * @memberOf _
+ * @type Function
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Object} props The object of property values to filter by.
+ * @returns {Array} Returns a new array of elements that have the given properties.
+ * @example
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 36, 'pets': ['hoppy'] },
+ * { 'name': 'fred', 'age': 40, 'pets': ['baby puss', 'dino'] }
+ * ];
+ *
+ * _.where(characters, { 'age': 36 });
+ * // => [{ 'name': 'barney', 'age': 36, 'pets': ['hoppy'] }]
+ *
+ * _.where(characters, { 'pets': ['dino'] });
+ * // => [{ 'name': 'fred', 'age': 40, 'pets': ['baby puss', 'dino'] }]
+ */
+ var where = filter;
+
+ /*--------------------------------------------------------------------------*/
+
+ /**
+ * Creates an array with all falsey values removed. The values `false`, `null`,
+ * `0`, `""`, `undefined`, and `NaN` are all falsey.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {Array} array The array to compact.
+ * @returns {Array} Returns a new array of filtered values.
+ * @example
+ *
+ * _.compact([0, 1, false, 2, '', 3]);
+ * // => [1, 2, 3]
+ */
+ function compact(array) {
+ var index = -1,
+ length = array ? array.length : 0,
+ result = [];
+
+ while (++index < length) {
+ var value = array[index];
+ if (value) {
+ result.push(value);
+ }
+ }
+ return result;
+ }
+
+ /**
+ * Creates an array excluding all values of the provided arrays using strict
+ * equality for comparisons, i.e. `===`.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {Array} array The array to process.
+ * @param {...Array} [values] The arrays of values to exclude.
+ * @returns {Array} Returns a new array of filtered values.
+ * @example
+ *
+ * _.difference([1, 2, 3, 4, 5], [5, 2, 10]);
+ * // => [1, 3, 4]
+ */
+ function difference(array) {
+ return baseDifference(array, baseFlatten(arguments, true, true, 1));
+ }
+
+ /**
+ * This method is like `_.find` except that it returns the index of the first
+ * element that passes the callback check, instead of the element itself.
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {Array} array The array to search.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {number} Returns the index of the found element, else `-1`.
+ * @example
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 36, 'blocked': false },
+ * { 'name': 'fred', 'age': 40, 'blocked': true },
+ * { 'name': 'pebbles', 'age': 1, 'blocked': false }
+ * ];
+ *
+ * _.findIndex(characters, function(chr) {
+ * return chr.age < 20;
+ * });
+ * // => 2
+ *
+ * // using "_.where" callback shorthand
+ * _.findIndex(characters, { 'age': 36 });
+ * // => 0
+ *
+ * // using "_.pluck" callback shorthand
+ * _.findIndex(characters, 'blocked');
+ * // => 1
+ */
+ function findIndex(array, callback, thisArg) {
+ var index = -1,
+ length = array ? array.length : 0;
+
+ callback = lodash.createCallback(callback, thisArg, 3);
+ while (++index < length) {
+ if (callback(array[index], index, array)) {
+ return index;
+ }
+ }
+ return -1;
+ }
+
+ /**
+ * This method is like `_.findIndex` except that it iterates over elements
+ * of a `collection` from right to left.
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {Array} array The array to search.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {number} Returns the index of the found element, else `-1`.
+ * @example
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 36, 'blocked': true },
+ * { 'name': 'fred', 'age': 40, 'blocked': false },
+ * { 'name': 'pebbles', 'age': 1, 'blocked': true }
+ * ];
+ *
+ * _.findLastIndex(characters, function(chr) {
+ * return chr.age > 30;
+ * });
+ * // => 1
+ *
+ * // using "_.where" callback shorthand
+ * _.findLastIndex(characters, { 'age': 36 });
+ * // => 0
+ *
+ * // using "_.pluck" callback shorthand
+ * _.findLastIndex(characters, 'blocked');
+ * // => 2
+ */
+ function findLastIndex(array, callback, thisArg) {
+ var length = array ? array.length : 0;
+ callback = lodash.createCallback(callback, thisArg, 3);
+ while (length--) {
+ if (callback(array[length], length, array)) {
+ return length;
+ }
+ }
+ return -1;
+ }
+
+ /**
+ * Gets the first element or first `n` elements of an array. If a callback
+ * is provided elements at the beginning of the array are returned as long
+ * as the callback returns truey. The callback is bound to `thisArg` and
+ * invoked with three arguments; (value, index, array).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @alias head, take
+ * @category Arrays
+ * @param {Array} array The array to query.
+ * @param {Function|Object|number|string} [callback] The function called
+ * per element or the number of elements to return. If a property name or
+ * object is provided it will be used to create a "_.pluck" or "_.where"
+ * style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {*} Returns the first element(s) of `array`.
+ * @example
+ *
+ * _.first([1, 2, 3]);
+ * // => 1
+ *
+ * _.first([1, 2, 3], 2);
+ * // => [1, 2]
+ *
+ * _.first([1, 2, 3], function(num) {
+ * return num < 3;
+ * });
+ * // => [1, 2]
+ *
+ * var characters = [
+ * { 'name': 'barney', 'blocked': true, 'employer': 'slate' },
+ * { 'name': 'fred', 'blocked': false, 'employer': 'slate' },
+ * { 'name': 'pebbles', 'blocked': true, 'employer': 'na' }
+ * ];
+ *
+ * // using "_.pluck" callback shorthand
+ * _.first(characters, 'blocked');
+ * // => [{ 'name': 'barney', 'blocked': true, 'employer': 'slate' }]
+ *
+ * // using "_.where" callback shorthand
+ * _.pluck(_.first(characters, { 'employer': 'slate' }), 'name');
+ * // => ['barney', 'fred']
+ */
+ function first(array, callback, thisArg) {
+ var n = 0,
+ length = array ? array.length : 0;
+
+ if (typeof callback != 'number' && callback != null) {
+ var index = -1;
+ callback = lodash.createCallback(callback, thisArg, 3);
+ while (++index < length && callback(array[index], index, array)) {
+ n++;
+ }
+ } else {
+ n = callback;
+ if (n == null || thisArg) {
+ return array ? array[0] : undefined;
+ }
+ }
+ return slice(array, 0, nativeMin(nativeMax(0, n), length));
+ }
+
+ /**
+ * Flattens a nested array (the nesting can be to any depth). If `isShallow`
+ * is truey, the array will only be flattened a single level. If a callback
+ * is provided each element of the array is passed through the callback before
+ * flattening. The callback is bound to `thisArg` and invoked with three
+ * arguments; (value, index, array).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {Array} array The array to flatten.
+ * @param {boolean} [isShallow=false] A flag to restrict flattening to a single level.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Array} Returns a new flattened array.
+ * @example
+ *
+ * _.flatten([1, [2], [3, [[4]]]]);
+ * // => [1, 2, 3, 4];
+ *
+ * _.flatten([1, [2], [3, [[4]]]], true);
+ * // => [1, 2, 3, [[4]]];
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 30, 'pets': ['hoppy'] },
+ * { 'name': 'fred', 'age': 40, 'pets': ['baby puss', 'dino'] }
+ * ];
+ *
+ * // using "_.pluck" callback shorthand
+ * _.flatten(characters, 'pets');
+ * // => ['hoppy', 'baby puss', 'dino']
+ */
+ function flatten(array, isShallow, callback, thisArg) {
+ // juggle arguments
+ if (typeof isShallow != 'boolean' && isShallow != null) {
+ thisArg = callback;
+ callback = (typeof isShallow != 'function' && thisArg && thisArg[isShallow] === array) ? null : isShallow;
+ isShallow = false;
+ }
+ if (callback != null) {
+ array = map(array, callback, thisArg);
+ }
+ return baseFlatten(array, isShallow);
+ }
+
+ /**
+ * Gets the index at which the first occurrence of `value` is found using
+ * strict equality for comparisons, i.e. `===`. If the array is already sorted
+ * providing `true` for `fromIndex` will run a faster binary search.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {Array} array The array to search.
+ * @param {*} value The value to search for.
+ * @param {boolean|number} [fromIndex=0] The index to search from or `true`
+ * to perform a binary search on a sorted array.
+ * @returns {number} Returns the index of the matched value or `-1`.
+ * @example
+ *
+ * _.indexOf([1, 2, 3, 1, 2, 3], 2);
+ * // => 1
+ *
+ * _.indexOf([1, 2, 3, 1, 2, 3], 2, 3);
+ * // => 4
+ *
+ * _.indexOf([1, 1, 2, 2, 3, 3], 2, true);
+ * // => 2
+ */
+ function indexOf(array, value, fromIndex) {
+ if (typeof fromIndex == 'number') {
+ var length = array ? array.length : 0;
+ fromIndex = (fromIndex < 0 ? nativeMax(0, length + fromIndex) : fromIndex || 0);
+ } else if (fromIndex) {
+ var index = sortedIndex(array, value);
+ return array[index] === value ? index : -1;
+ }
+ return baseIndexOf(array, value, fromIndex);
+ }
+
+ /**
+ * Gets all but the last element or last `n` elements of an array. If a
+ * callback is provided elements at the end of the array are excluded from
+ * the result as long as the callback returns truey. The callback is bound
+ * to `thisArg` and invoked with three arguments; (value, index, array).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {Array} array The array to query.
+ * @param {Function|Object|number|string} [callback=1] The function called
+ * per element or the number of elements to exclude. If a property name or
+ * object is provided it will be used to create a "_.pluck" or "_.where"
+ * style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Array} Returns a slice of `array`.
+ * @example
+ *
+ * _.initial([1, 2, 3]);
+ * // => [1, 2]
+ *
+ * _.initial([1, 2, 3], 2);
+ * // => [1]
+ *
+ * _.initial([1, 2, 3], function(num) {
+ * return num > 1;
+ * });
+ * // => [1]
+ *
+ * var characters = [
+ * { 'name': 'barney', 'blocked': false, 'employer': 'slate' },
+ * { 'name': 'fred', 'blocked': true, 'employer': 'slate' },
+ * { 'name': 'pebbles', 'blocked': true, 'employer': 'na' }
+ * ];
+ *
+ * // using "_.pluck" callback shorthand
+ * _.initial(characters, 'blocked');
+ * // => [{ 'name': 'barney', 'blocked': false, 'employer': 'slate' }]
+ *
+ * // using "_.where" callback shorthand
+ * _.pluck(_.initial(characters, { 'employer': 'na' }), 'name');
+ * // => ['barney', 'fred']
+ */
+ function initial(array, callback, thisArg) {
+ var n = 0,
+ length = array ? array.length : 0;
+
+ if (typeof callback != 'number' && callback != null) {
+ var index = length;
+ callback = lodash.createCallback(callback, thisArg, 3);
+ while (index-- && callback(array[index], index, array)) {
+ n++;
+ }
+ } else {
+ n = (callback == null || thisArg) ? 1 : callback || n;
+ }
+ return slice(array, 0, nativeMin(nativeMax(0, length - n), length));
+ }
+
+ /**
+ * Creates an array of unique values present in all provided arrays using
+ * strict equality for comparisons, i.e. `===`.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {...Array} [array] The arrays to inspect.
+ * @returns {Array} Returns an array of shared values.
+ * @example
+ *
+ * _.intersection([1, 2, 3], [5, 2, 1, 4], [2, 1]);
+ * // => [1, 2]
+ */
+ function intersection() {
+ var args = [],
+ argsIndex = -1,
+ argsLength = arguments.length,
+ caches = getArray(),
+ indexOf = getIndexOf(),
+ trustIndexOf = indexOf === baseIndexOf,
+ seen = getArray();
+
+ while (++argsIndex < argsLength) {
+ var value = arguments[argsIndex];
+ if (isArray(value) || isArguments(value)) {
+ args.push(value);
+ caches.push(trustIndexOf && value.length >= largeArraySize &&
+ createCache(argsIndex ? args[argsIndex] : seen));
+ }
+ }
+ var array = args[0],
+ index = -1,
+ length = array ? array.length : 0,
+ result = [];
+
+ outer:
+ while (++index < length) {
+ var cache = caches[0];
+ value = array[index];
+
+ if ((cache ? cacheIndexOf(cache, value) : indexOf(seen, value)) < 0) {
+ argsIndex = argsLength;
+ (cache || seen).push(value);
+ while (--argsIndex) {
+ cache = caches[argsIndex];
+ if ((cache ? cacheIndexOf(cache, value) : indexOf(args[argsIndex], value)) < 0) {
+ continue outer;
+ }
+ }
+ result.push(value);
+ }
+ }
+ while (argsLength--) {
+ cache = caches[argsLength];
+ if (cache) {
+ releaseObject(cache);
+ }
+ }
+ releaseArray(caches);
+ releaseArray(seen);
+ return result;
+ }
+
+ /**
+ * Gets the last element or last `n` elements of an array. If a callback is
+ * provided elements at the end of the array are returned as long as the
+ * callback returns truey. The callback is bound to `thisArg` and invoked
+ * with three arguments; (value, index, array).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {Array} array The array to query.
+ * @param {Function|Object|number|string} [callback] The function called
+ * per element or the number of elements to return. If a property name or
+ * object is provided it will be used to create a "_.pluck" or "_.where"
+ * style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {*} Returns the last element(s) of `array`.
+ * @example
+ *
+ * _.last([1, 2, 3]);
+ * // => 3
+ *
+ * _.last([1, 2, 3], 2);
+ * // => [2, 3]
+ *
+ * _.last([1, 2, 3], function(num) {
+ * return num > 1;
+ * });
+ * // => [2, 3]
+ *
+ * var characters = [
+ * { 'name': 'barney', 'blocked': false, 'employer': 'slate' },
+ * { 'name': 'fred', 'blocked': true, 'employer': 'slate' },
+ * { 'name': 'pebbles', 'blocked': true, 'employer': 'na' }
+ * ];
+ *
+ * // using "_.pluck" callback shorthand
+ * _.pluck(_.last(characters, 'blocked'), 'name');
+ * // => ['fred', 'pebbles']
+ *
+ * // using "_.where" callback shorthand
+ * _.last(characters, { 'employer': 'na' });
+ * // => [{ 'name': 'pebbles', 'blocked': true, 'employer': 'na' }]
+ */
+ function last(array, callback, thisArg) {
+ var n = 0,
+ length = array ? array.length : 0;
+
+ if (typeof callback != 'number' && callback != null) {
+ var index = length;
+ callback = lodash.createCallback(callback, thisArg, 3);
+ while (index-- && callback(array[index], index, array)) {
+ n++;
+ }
+ } else {
+ n = callback;
+ if (n == null || thisArg) {
+ return array ? array[length - 1] : undefined;
+ }
+ }
+ return slice(array, nativeMax(0, length - n));
+ }
+
+ /**
+ * Gets the index at which the last occurrence of `value` is found using strict
+ * equality for comparisons, i.e. `===`. If `fromIndex` is negative, it is used
+ * as the offset from the end of the collection.
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {Array} array The array to search.
+ * @param {*} value The value to search for.
+ * @param {number} [fromIndex=array.length-1] The index to search from.
+ * @returns {number} Returns the index of the matched value or `-1`.
+ * @example
+ *
+ * _.lastIndexOf([1, 2, 3, 1, 2, 3], 2);
+ * // => 4
+ *
+ * _.lastIndexOf([1, 2, 3, 1, 2, 3], 2, 3);
+ * // => 1
+ */
+ function lastIndexOf(array, value, fromIndex) {
+ var index = array ? array.length : 0;
+ if (typeof fromIndex == 'number') {
+ index = (fromIndex < 0 ? nativeMax(0, index + fromIndex) : nativeMin(fromIndex, index - 1)) + 1;
+ }
+ while (index--) {
+ if (array[index] === value) {
+ return index;
+ }
+ }
+ return -1;
+ }
+
+ /**
+ * Removes all provided values from the given array using strict equality for
+ * comparisons, i.e. `===`.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {Array} array The array to modify.
+ * @param {...*} [value] The values to remove.
+ * @returns {Array} Returns `array`.
+ * @example
+ *
+ * var array = [1, 2, 3, 1, 2, 3];
+ * _.pull(array, 2, 3);
+ * console.log(array);
+ * // => [1, 1]
+ */
+ function pull(array) {
+ var args = arguments,
+ argsIndex = 0,
+ argsLength = args.length,
+ length = array ? array.length : 0;
+
+ while (++argsIndex < argsLength) {
+ var index = -1,
+ value = args[argsIndex];
+ while (++index < length) {
+ if (array[index] === value) {
+ splice.call(array, index--, 1);
+ length--;
+ }
+ }
+ }
+ return array;
+ }
+
+ /**
+ * Creates an array of numbers (positive and/or negative) progressing from
+ * `start` up to but not including `end`. If `start` is less than `stop` a
+ * zero-length range is created unless a negative `step` is specified.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {number} [start=0] The start of the range.
+ * @param {number} end The end of the range.
+ * @param {number} [step=1] The value to increment or decrement by.
+ * @returns {Array} Returns a new range array.
+ * @example
+ *
+ * _.range(4);
+ * // => [0, 1, 2, 3]
+ *
+ * _.range(1, 5);
+ * // => [1, 2, 3, 4]
+ *
+ * _.range(0, 20, 5);
+ * // => [0, 5, 10, 15]
+ *
+ * _.range(0, -4, -1);
+ * // => [0, -1, -2, -3]
+ *
+ * _.range(1, 4, 0);
+ * // => [1, 1, 1]
+ *
+ * _.range(0);
+ * // => []
+ */
+ function range(start, end, step) {
+ start = +start || 0;
+ step = typeof step == 'number' ? step : (+step || 1);
+
+ if (end == null) {
+ end = start;
+ start = 0;
+ }
+ // use `Array(length)` so engines like Chakra and V8 avoid slower modes
+ // http://youtu.be/XAqIpGU8ZZk#t=17m25s
+ var index = -1,
+ length = nativeMax(0, ceil((end - start) / (step || 1))),
+ result = Array(length);
+
+ while (++index < length) {
+ result[index] = start;
+ start += step;
+ }
+ return result;
+ }
+
+ /**
+ * Removes all elements from an array that the callback returns truey for
+ * and returns an array of removed elements. The callback is bound to `thisArg`
+ * and invoked with three arguments; (value, index, array).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {Array} array The array to modify.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Array} Returns a new array of removed elements.
+ * @example
+ *
+ * var array = [1, 2, 3, 4, 5, 6];
+ * var evens = _.remove(array, function(num) { return num % 2 == 0; });
+ *
+ * console.log(array);
+ * // => [1, 3, 5]
+ *
+ * console.log(evens);
+ * // => [2, 4, 6]
+ */
+ function remove(array, callback, thisArg) {
+ var index = -1,
+ length = array ? array.length : 0,
+ result = [];
+
+ callback = lodash.createCallback(callback, thisArg, 3);
+ while (++index < length) {
+ var value = array[index];
+ if (callback(value, index, array)) {
+ result.push(value);
+ splice.call(array, index--, 1);
+ length--;
+ }
+ }
+ return result;
+ }
+
+ /**
+ * The opposite of `_.initial` this method gets all but the first element or
+ * first `n` elements of an array. If a callback function is provided elements
+ * at the beginning of the array are excluded from the result as long as the
+ * callback returns truey. The callback is bound to `thisArg` and invoked
+ * with three arguments; (value, index, array).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @alias drop, tail
+ * @category Arrays
+ * @param {Array} array The array to query.
+ * @param {Function|Object|number|string} [callback=1] The function called
+ * per element or the number of elements to exclude. If a property name or
+ * object is provided it will be used to create a "_.pluck" or "_.where"
+ * style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Array} Returns a slice of `array`.
+ * @example
+ *
+ * _.rest([1, 2, 3]);
+ * // => [2, 3]
+ *
+ * _.rest([1, 2, 3], 2);
+ * // => [3]
+ *
+ * _.rest([1, 2, 3], function(num) {
+ * return num < 3;
+ * });
+ * // => [3]
+ *
+ * var characters = [
+ * { 'name': 'barney', 'blocked': true, 'employer': 'slate' },
+ * { 'name': 'fred', 'blocked': false, 'employer': 'slate' },
+ * { 'name': 'pebbles', 'blocked': true, 'employer': 'na' }
+ * ];
+ *
+ * // using "_.pluck" callback shorthand
+ * _.pluck(_.rest(characters, 'blocked'), 'name');
+ * // => ['fred', 'pebbles']
+ *
+ * // using "_.where" callback shorthand
+ * _.rest(characters, { 'employer': 'slate' });
+ * // => [{ 'name': 'pebbles', 'blocked': true, 'employer': 'na' }]
+ */
+ function rest(array, callback, thisArg) {
+ if (typeof callback != 'number' && callback != null) {
+ var n = 0,
+ index = -1,
+ length = array ? array.length : 0;
+
+ callback = lodash.createCallback(callback, thisArg, 3);
+ while (++index < length && callback(array[index], index, array)) {
+ n++;
+ }
+ } else {
+ n = (callback == null || thisArg) ? 1 : nativeMax(0, callback);
+ }
+ return slice(array, n);
+ }
+
+ /**
+ * Uses a binary search to determine the smallest index at which a value
+ * should be inserted into a given sorted array in order to maintain the sort
+ * order of the array. If a callback is provided it will be executed for
+ * `value` and each element of `array` to compute their sort ranking. The
+ * callback is bound to `thisArg` and invoked with one argument; (value).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {Array} array The array to inspect.
+ * @param {*} value The value to evaluate.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {number} Returns the index at which `value` should be inserted
+ * into `array`.
+ * @example
+ *
+ * _.sortedIndex([20, 30, 50], 40);
+ * // => 2
+ *
+ * // using "_.pluck" callback shorthand
+ * _.sortedIndex([{ 'x': 20 }, { 'x': 30 }, { 'x': 50 }], { 'x': 40 }, 'x');
+ * // => 2
+ *
+ * var dict = {
+ * 'wordToNumber': { 'twenty': 20, 'thirty': 30, 'fourty': 40, 'fifty': 50 }
+ * };
+ *
+ * _.sortedIndex(['twenty', 'thirty', 'fifty'], 'fourty', function(word) {
+ * return dict.wordToNumber[word];
+ * });
+ * // => 2
+ *
+ * _.sortedIndex(['twenty', 'thirty', 'fifty'], 'fourty', function(word) {
+ * return this.wordToNumber[word];
+ * }, dict);
+ * // => 2
+ */
+ function sortedIndex(array, value, callback, thisArg) {
+ var low = 0,
+ high = array ? array.length : low;
+
+ // explicitly reference `identity` for better inlining in Firefox
+ callback = callback ? lodash.createCallback(callback, thisArg, 1) : identity;
+ value = callback(value);
+
+ while (low < high) {
+ var mid = (low + high) >>> 1;
+ (callback(array[mid]) < value)
+ ? low = mid + 1
+ : high = mid;
+ }
+ return low;
+ }
+
+ /**
+ * Creates an array of unique values, in order, of the provided arrays using
+ * strict equality for comparisons, i.e. `===`.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {...Array} [array] The arrays to inspect.
+ * @returns {Array} Returns an array of combined values.
+ * @example
+ *
+ * _.union([1, 2, 3], [5, 2, 1, 4], [2, 1]);
+ * // => [1, 2, 3, 5, 4]
+ */
+ function union() {
+ return baseUniq(baseFlatten(arguments, true, true));
+ }
+
+ /**
+ * Creates a duplicate-value-free version of an array using strict equality
+ * for comparisons, i.e. `===`. If the array is sorted, providing
+ * `true` for `isSorted` will use a faster algorithm. If a callback is provided
+ * each element of `array` is passed through the callback before uniqueness
+ * is computed. The callback is bound to `thisArg` and invoked with three
+ * arguments; (value, index, array).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @alias unique
+ * @category Arrays
+ * @param {Array} array The array to process.
+ * @param {boolean} [isSorted=false] A flag to indicate that `array` is sorted.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Array} Returns a duplicate-value-free array.
+ * @example
+ *
+ * _.uniq([1, 2, 1, 3, 1]);
+ * // => [1, 2, 3]
+ *
+ * _.uniq([1, 1, 2, 2, 3], true);
+ * // => [1, 2, 3]
+ *
+ * _.uniq(['A', 'b', 'C', 'a', 'B', 'c'], function(letter) { return letter.toLowerCase(); });
+ * // => ['A', 'b', 'C']
+ *
+ * _.uniq([1, 2.5, 3, 1.5, 2, 3.5], function(num) { return this.floor(num); }, Math);
+ * // => [1, 2.5, 3]
+ *
+ * // using "_.pluck" callback shorthand
+ * _.uniq([{ 'x': 1 }, { 'x': 2 }, { 'x': 1 }], 'x');
+ * // => [{ 'x': 1 }, { 'x': 2 }]
+ */
+ function uniq(array, isSorted, callback, thisArg) {
+ // juggle arguments
+ if (typeof isSorted != 'boolean' && isSorted != null) {
+ thisArg = callback;
+ callback = (typeof isSorted != 'function' && thisArg && thisArg[isSorted] === array) ? null : isSorted;
+ isSorted = false;
+ }
+ if (callback != null) {
+ callback = lodash.createCallback(callback, thisArg, 3);
+ }
+ return baseUniq(array, isSorted, callback);
+ }
+
+ /**
+ * Creates an array excluding all provided values using strict equality for
+ * comparisons, i.e. `===`.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {Array} array The array to filter.
+ * @param {...*} [value] The values to exclude.
+ * @returns {Array} Returns a new array of filtered values.
+ * @example
+ *
+ * _.without([1, 2, 1, 0, 3, 1, 4], 0, 1);
+ * // => [2, 3, 4]
+ */
+ function without(array) {
+ return baseDifference(array, slice(arguments, 1));
+ }
+
+ /**
+ * Creates an array that is the symmetric difference of the provided arrays.
+ * See http://en.wikipedia.org/wiki/Symmetric_difference.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {...Array} [array] The arrays to inspect.
+ * @returns {Array} Returns an array of values.
+ * @example
+ *
+ * _.xor([1, 2, 3], [5, 2, 1, 4]);
+ * // => [3, 5, 4]
+ *
+ * _.xor([1, 2, 5], [2, 3, 5], [3, 4, 5]);
+ * // => [1, 4, 5]
+ */
+ function xor() {
+ var index = -1,
+ length = arguments.length;
+
+ while (++index < length) {
+ var array = arguments[index];
+ if (isArray(array) || isArguments(array)) {
+ var result = result
+ ? baseUniq(baseDifference(result, array).concat(baseDifference(array, result)))
+ : array;
+ }
+ }
+ return result || [];
+ }
+
+ /**
+ * Creates an array of grouped elements, the first of which contains the first
+ * elements of the given arrays, the second of which contains the second
+ * elements of the given arrays, and so on.
+ *
+ * @static
+ * @memberOf _
+ * @alias unzip
+ * @category Arrays
+ * @param {...Array} [array] Arrays to process.
+ * @returns {Array} Returns a new array of grouped elements.
+ * @example
+ *
+ * _.zip(['fred', 'barney'], [30, 40], [true, false]);
+ * // => [['fred', 30, true], ['barney', 40, false]]
+ */
+ function zip() {
+ var array = arguments.length > 1 ? arguments : arguments[0],
+ index = -1,
+ length = array ? max(pluck(array, 'length')) : 0,
+ result = Array(length < 0 ? 0 : length);
+
+ while (++index < length) {
+ result[index] = pluck(array, index);
+ }
+ return result;
+ }
+
+ /**
+ * Creates an object composed from arrays of `keys` and `values`. Provide
+ * either a single two dimensional array, i.e. `[[key1, value1], [key2, value2]]`
+ * or two arrays, one of `keys` and one of corresponding `values`.
+ *
+ * @static
+ * @memberOf _
+ * @alias object
+ * @category Arrays
+ * @param {Array} keys The array of keys.
+ * @param {Array} [values=[]] The array of values.
+ * @returns {Object} Returns an object composed of the given keys and
+ * corresponding values.
+ * @example
+ *
+ * _.zipObject(['fred', 'barney'], [30, 40]);
+ * // => { 'fred': 30, 'barney': 40 }
+ */
+ function zipObject(keys, values) {
+ var index = -1,
+ length = keys ? keys.length : 0,
+ result = {};
+
+ if (!values && length && !isArray(keys[0])) {
+ values = [];
+ }
+ while (++index < length) {
+ var key = keys[index];
+ if (values) {
+ result[key] = values[index];
+ } else if (key) {
+ result[key[0]] = key[1];
+ }
+ }
+ return result;
+ }
+
+ /*--------------------------------------------------------------------------*/
+
+ /**
+ * Creates a function that executes `func`, with the `this` binding and
+ * arguments of the created function, only after being called `n` times.
+ *
+ * @static
+ * @memberOf _
+ * @category Functions
+ * @param {number} n The number of times the function must be called before
+ * `func` is executed.
+ * @param {Function} func The function to restrict.
+ * @returns {Function} Returns the new restricted function.
+ * @example
+ *
+ * var saves = ['profile', 'settings'];
+ *
+ * var done = _.after(saves.length, function() {
+ * console.log('Done saving!');
+ * });
+ *
+ * _.forEach(saves, function(type) {
+ * asyncSave({ 'type': type, 'complete': done });
+ * });
+ * // => logs 'Done saving!', after all saves have completed
+ */
+ function after(n, func) {
+ if (!isFunction(func)) {
+ throw new TypeError;
+ }
+ return function() {
+ if (--n < 1) {
+ return func.apply(this, arguments);
+ }
+ };
+ }
+
+ /**
+ * Creates a function that, when called, invokes `func` with the `this`
+ * binding of `thisArg` and prepends any additional `bind` arguments to those
+ * provided to the bound function.
+ *
+ * @static
+ * @memberOf _
+ * @category Functions
+ * @param {Function} func The function to bind.
+ * @param {*} [thisArg] The `this` binding of `func`.
+ * @param {...*} [arg] Arguments to be partially applied.
+ * @returns {Function} Returns the new bound function.
+ * @example
+ *
+ * var func = function(greeting) {
+ * return greeting + ' ' + this.name;
+ * };
+ *
+ * func = _.bind(func, { 'name': 'fred' }, 'hi');
+ * func();
+ * // => 'hi fred'
+ */
+ function bind(func, thisArg) {
+ return arguments.length > 2
+ ? createWrapper(func, 17, slice(arguments, 2), null, thisArg)
+ : createWrapper(func, 1, null, null, thisArg);
+ }
+
+ /**
+ * Binds methods of an object to the object itself, overwriting the existing
+ * method. Method names may be specified as individual arguments or as arrays
+ * of method names. If no method names are provided all the function properties
+ * of `object` will be bound.
+ *
+ * @static
+ * @memberOf _
+ * @category Functions
+ * @param {Object} object The object to bind and assign the bound methods to.
+ * @param {...string} [methodName] The object method names to
+ * bind, specified as individual method names or arrays of method names.
+ * @returns {Object} Returns `object`.
+ * @example
+ *
+ * var view = {
+ * 'label': 'docs',
+ * 'onClick': function() { console.log('clicked ' + this.label); }
+ * };
+ *
+ * _.bindAll(view);
+ * jQuery('#docs').on('click', view.onClick);
+ * // => logs 'clicked docs', when the button is clicked
+ */
+ function bindAll(object) {
+ var funcs = arguments.length > 1 ? baseFlatten(arguments, true, false, 1) : functions(object),
+ index = -1,
+ length = funcs.length;
+
+ while (++index < length) {
+ var key = funcs[index];
+ object[key] = createWrapper(object[key], 1, null, null, object);
+ }
+ return object;
+ }
+
+ /**
+ * Creates a function that, when called, invokes the method at `object[key]`
+ * and prepends any additional `bindKey` arguments to those provided to the bound
+ * function. This method differs from `_.bind` by allowing bound functions to
+ * reference methods that will be redefined or don't yet exist.
+ * See http://michaux.ca/articles/lazy-function-definition-pattern.
+ *
+ * @static
+ * @memberOf _
+ * @category Functions
+ * @param {Object} object The object the method belongs to.
+ * @param {string} key The key of the method.
+ * @param {...*} [arg] Arguments to be partially applied.
+ * @returns {Function} Returns the new bound function.
+ * @example
+ *
+ * var object = {
+ * 'name': 'fred',
+ * 'greet': function(greeting) {
+ * return greeting + ' ' + this.name;
+ * }
+ * };
+ *
+ * var func = _.bindKey(object, 'greet', 'hi');
+ * func();
+ * // => 'hi fred'
+ *
+ * object.greet = function(greeting) {
+ * return greeting + 'ya ' + this.name + '!';
+ * };
+ *
+ * func();
+ * // => 'hiya fred!'
+ */
+ function bindKey(object, key) {
+ return arguments.length > 2
+ ? createWrapper(key, 19, slice(arguments, 2), null, object)
+ : createWrapper(key, 3, null, null, object);
+ }
+
+ /**
+ * Creates a function that is the composition of the provided functions,
+ * where each function consumes the return value of the function that follows.
+ * For example, composing the functions `f()`, `g()`, and `h()` produces `f(g(h()))`.
+ * Each function is executed with the `this` binding of the composed function.
+ *
+ * @static
+ * @memberOf _
+ * @category Functions
+ * @param {...Function} [func] Functions to compose.
+ * @returns {Function} Returns the new composed function.
+ * @example
+ *
+ * var realNameMap = {
+ * 'pebbles': 'penelope'
+ * };
+ *
+ * var format = function(name) {
+ * name = realNameMap[name.toLowerCase()] || name;
+ * return name.charAt(0).toUpperCase() + name.slice(1).toLowerCase();
+ * };
+ *
+ * var greet = function(formatted) {
+ * return 'Hiya ' + formatted + '!';
+ * };
+ *
+ * var welcome = _.compose(greet, format);
+ * welcome('pebbles');
+ * // => 'Hiya Penelope!'
+ */
+ function compose() {
+ var funcs = arguments,
+ length = funcs.length;
+
+ while (length--) {
+ if (!isFunction(funcs[length])) {
+ throw new TypeError;
+ }
+ }
+ return function() {
+ var args = arguments,
+ length = funcs.length;
+
+ while (length--) {
+ args = [funcs[length].apply(this, args)];
+ }
+ return args[0];
+ };
+ }
+
+ /**
+ * Creates a function which accepts one or more arguments of `func` that when
+ * invoked either executes `func` returning its result, if all `func` arguments
+ * have been provided, or returns a function that accepts one or more of the
+ * remaining `func` arguments, and so on. The arity of `func` can be specified
+ * if `func.length` is not sufficient.
+ *
+ * @static
+ * @memberOf _
+ * @category Functions
+ * @param {Function} func The function to curry.
+ * @param {number} [arity=func.length] The arity of `func`.
+ * @returns {Function} Returns the new curried function.
+ * @example
+ *
+ * var curried = _.curry(function(a, b, c) {
+ * console.log(a + b + c);
+ * });
+ *
+ * curried(1)(2)(3);
+ * // => 6
+ *
+ * curried(1, 2)(3);
+ * // => 6
+ *
+ * curried(1, 2, 3);
+ * // => 6
+ */
+ function curry(func, arity) {
+ arity = typeof arity == 'number' ? arity : (+arity || func.length);
+ return createWrapper(func, 4, null, null, null, arity);
+ }
+
+ /**
+ * Creates a function that will delay the execution of `func` until after
+ * `wait` milliseconds have elapsed since the last time it was invoked.
+ * Provide an options object to indicate that `func` should be invoked on
+ * the leading and/or trailing edge of the `wait` timeout. Subsequent calls
+ * to the debounced function will return the result of the last `func` call.
+ *
+ * Note: If `leading` and `trailing` options are `true` `func` will be called
+ * on the trailing edge of the timeout only if the the debounced function is
+ * invoked more than once during the `wait` timeout.
+ *
+ * @static
+ * @memberOf _
+ * @category Functions
+ * @param {Function} func The function to debounce.
+ * @param {number} wait The number of milliseconds to delay.
+ * @param {Object} [options] The options object.
+ * @param {boolean} [options.leading=false] Specify execution on the leading edge of the timeout.
+ * @param {number} [options.maxWait] The maximum time `func` is allowed to be delayed before it's called.
+ * @param {boolean} [options.trailing=true] Specify execution on the trailing edge of the timeout.
+ * @returns {Function} Returns the new debounced function.
+ * @example
+ *
+ * // avoid costly calculations while the window size is in flux
+ * var lazyLayout = _.debounce(calculateLayout, 150);
+ * jQuery(window).on('resize', lazyLayout);
+ *
+ * // execute `sendMail` when the click event is fired, debouncing subsequent calls
+ * jQuery('#postbox').on('click', _.debounce(sendMail, 300, {
+ * 'leading': true,
+ * 'trailing': false
+ * });
+ *
+ * // ensure `batchLog` is executed once after 1 second of debounced calls
+ * var source = new EventSource('/stream');
+ * source.addEventListener('message', _.debounce(batchLog, 250, {
+ * 'maxWait': 1000
+ * }, false);
+ */
+ function debounce(func, wait, options) {
+ var args,
+ maxTimeoutId,
+ result,
+ stamp,
+ thisArg,
+ timeoutId,
+ trailingCall,
+ lastCalled = 0,
+ maxWait = false,
+ trailing = true;
+
+ if (!isFunction(func)) {
+ throw new TypeError;
+ }
+ wait = nativeMax(0, wait) || 0;
+ if (options === true) {
+ var leading = true;
+ trailing = false;
+ } else if (isObject(options)) {
+ leading = options.leading;
+ maxWait = 'maxWait' in options && (nativeMax(wait, options.maxWait) || 0);
+ trailing = 'trailing' in options ? options.trailing : trailing;
+ }
+ var delayed = function() {
+ var remaining = wait - (now() - stamp);
+ if (remaining <= 0) {
+ if (maxTimeoutId) {
+ clearTimeout(maxTimeoutId);
+ }
+ var isCalled = trailingCall;
+ maxTimeoutId = timeoutId = trailingCall = undefined;
+ if (isCalled) {
+ lastCalled = now();
+ result = func.apply(thisArg, args);
+ if (!timeoutId && !maxTimeoutId) {
+ args = thisArg = null;
+ }
+ }
+ } else {
+ timeoutId = setTimeout(delayed, remaining);
+ }
+ };
+
+ var maxDelayed = function() {
+ if (timeoutId) {
+ clearTimeout(timeoutId);
+ }
+ maxTimeoutId = timeoutId = trailingCall = undefined;
+ if (trailing || (maxWait !== wait)) {
+ lastCalled = now();
+ result = func.apply(thisArg, args);
+ if (!timeoutId && !maxTimeoutId) {
+ args = thisArg = null;
+ }
+ }
+ };
+
+ return function() {
+ args = arguments;
+ stamp = now();
+ thisArg = this;
+ trailingCall = trailing && (timeoutId || !leading);
+
+ if (maxWait === false) {
+ var leadingCall = leading && !timeoutId;
+ } else {
+ if (!maxTimeoutId && !leading) {
+ lastCalled = stamp;
+ }
+ var remaining = maxWait - (stamp - lastCalled),
+ isCalled = remaining <= 0;
+
+ if (isCalled) {
+ if (maxTimeoutId) {
+ maxTimeoutId = clearTimeout(maxTimeoutId);
+ }
+ lastCalled = stamp;
+ result = func.apply(thisArg, args);
+ }
+ else if (!maxTimeoutId) {
+ maxTimeoutId = setTimeout(maxDelayed, remaining);
+ }
+ }
+ if (isCalled && timeoutId) {
+ timeoutId = clearTimeout(timeoutId);
+ }
+ else if (!timeoutId && wait !== maxWait) {
+ timeoutId = setTimeout(delayed, wait);
+ }
+ if (leadingCall) {
+ isCalled = true;
+ result = func.apply(thisArg, args);
+ }
+ if (isCalled && !timeoutId && !maxTimeoutId) {
+ args = thisArg = null;
+ }
+ return result;
+ };
+ }
+
+ /**
+ * Defers executing the `func` function until the current call stack has cleared.
+ * Additional arguments will be provided to `func` when it is invoked.
+ *
+ * @static
+ * @memberOf _
+ * @category Functions
+ * @param {Function} func The function to defer.
+ * @param {...*} [arg] Arguments to invoke the function with.
+ * @returns {number} Returns the timer id.
+ * @example
+ *
+ * _.defer(function(text) { console.log(text); }, 'deferred');
+ * // logs 'deferred' after one or more milliseconds
+ */
+ function defer(func) {
+ if (!isFunction(func)) {
+ throw new TypeError;
+ }
+ var args = slice(arguments, 1);
+ return setTimeout(function() { func.apply(undefined, args); }, 1);
+ }
+
+ /**
+ * Executes the `func` function after `wait` milliseconds. Additional arguments
+ * will be provided to `func` when it is invoked.
+ *
+ * @static
+ * @memberOf _
+ * @category Functions
+ * @param {Function} func The function to delay.
+ * @param {number} wait The number of milliseconds to delay execution.
+ * @param {...*} [arg] Arguments to invoke the function with.
+ * @returns {number} Returns the timer id.
+ * @example
+ *
+ * _.delay(function(text) { console.log(text); }, 1000, 'later');
+ * // => logs 'later' after one second
+ */
+ function delay(func, wait) {
+ if (!isFunction(func)) {
+ throw new TypeError;
+ }
+ var args = slice(arguments, 2);
+ return setTimeout(function() { func.apply(undefined, args); }, wait);
+ }
+
+ /**
+ * Creates a function that memoizes the result of `func`. If `resolver` is
+ * provided it will be used to determine the cache key for storing the result
+ * based on the arguments provided to the memoized function. By default, the
+ * first argument provided to the memoized function is used as the cache key.
+ * The `func` is executed with the `this` binding of the memoized function.
+ * The result cache is exposed as the `cache` property on the memoized function.
+ *
+ * @static
+ * @memberOf _
+ * @category Functions
+ * @param {Function} func The function to have its output memoized.
+ * @param {Function} [resolver] A function used to resolve the cache key.
+ * @returns {Function} Returns the new memoizing function.
+ * @example
+ *
+ * var fibonacci = _.memoize(function(n) {
+ * return n < 2 ? n : fibonacci(n - 1) + fibonacci(n - 2);
+ * });
+ *
+ * fibonacci(9)
+ * // => 34
+ *
+ * var data = {
+ * 'fred': { 'name': 'fred', 'age': 40 },
+ * 'pebbles': { 'name': 'pebbles', 'age': 1 }
+ * };
+ *
+ * // modifying the result cache
+ * var get = _.memoize(function(name) { return data[name]; }, _.identity);
+ * get('pebbles');
+ * // => { 'name': 'pebbles', 'age': 1 }
+ *
+ * get.cache.pebbles.name = 'penelope';
+ * get('pebbles');
+ * // => { 'name': 'penelope', 'age': 1 }
+ */
+ function memoize(func, resolver) {
+ if (!isFunction(func)) {
+ throw new TypeError;
+ }
+ var memoized = function() {
+ var cache = memoized.cache,
+ key = resolver ? resolver.apply(this, arguments) : keyPrefix + arguments[0];
+
+ return hasOwnProperty.call(cache, key)
+ ? cache[key]
+ : (cache[key] = func.apply(this, arguments));
+ }
+ memoized.cache = {};
+ return memoized;
+ }
+
+ /**
+ * Creates a function that is restricted to execute `func` once. Repeat calls to
+ * the function will return the value of the first call. The `func` is executed
+ * with the `this` binding of the created function.
+ *
+ * @static
+ * @memberOf _
+ * @category Functions
+ * @param {Function} func The function to restrict.
+ * @returns {Function} Returns the new restricted function.
+ * @example
+ *
+ * var initialize = _.once(createApplication);
+ * initialize();
+ * initialize();
+ * // `initialize` executes `createApplication` once
+ */
+ function once(func) {
+ var ran,
+ result;
+
+ if (!isFunction(func)) {
+ throw new TypeError;
+ }
+ return function() {
+ if (ran) {
+ return result;
+ }
+ ran = true;
+ result = func.apply(this, arguments);
+
+ // clear the `func` variable so the function may be garbage collected
+ func = null;
+ return result;
+ };
+ }
+
+ /**
+ * Creates a function that, when called, invokes `func` with any additional
+ * `partial` arguments prepended to those provided to the new function. This
+ * method is similar to `_.bind` except it does **not** alter the `this` binding.
+ *
+ * @static
+ * @memberOf _
+ * @category Functions
+ * @param {Function} func The function to partially apply arguments to.
+ * @param {...*} [arg] Arguments to be partially applied.
+ * @returns {Function} Returns the new partially applied function.
+ * @example
+ *
+ * var greet = function(greeting, name) { return greeting + ' ' + name; };
+ * var hi = _.partial(greet, 'hi');
+ * hi('fred');
+ * // => 'hi fred'
+ */
+ function partial(func) {
+ return createWrapper(func, 16, slice(arguments, 1));
+ }
+
+ /**
+ * This method is like `_.partial` except that `partial` arguments are
+ * appended to those provided to the new function.
+ *
+ * @static
+ * @memberOf _
+ * @category Functions
+ * @param {Function} func The function to partially apply arguments to.
+ * @param {...*} [arg] Arguments to be partially applied.
+ * @returns {Function} Returns the new partially applied function.
+ * @example
+ *
+ * var defaultsDeep = _.partialRight(_.merge, _.defaults);
+ *
+ * var options = {
+ * 'variable': 'data',
+ * 'imports': { 'jq': $ }
+ * };
+ *
+ * defaultsDeep(options, _.templateSettings);
+ *
+ * options.variable
+ * // => 'data'
+ *
+ * options.imports
+ * // => { '_': _, 'jq': $ }
+ */
+ function partialRight(func) {
+ return createWrapper(func, 32, null, slice(arguments, 1));
+ }
+
+ /**
+ * Creates a function that, when executed, will only call the `func` function
+ * at most once per every `wait` milliseconds. Provide an options object to
+ * indicate that `func` should be invoked on the leading and/or trailing edge
+ * of the `wait` timeout. Subsequent calls to the throttled function will
+ * return the result of the last `func` call.
+ *
+ * Note: If `leading` and `trailing` options are `true` `func` will be called
+ * on the trailing edge of the timeout only if the the throttled function is
+ * invoked more than once during the `wait` timeout.
+ *
+ * @static
+ * @memberOf _
+ * @category Functions
+ * @param {Function} func The function to throttle.
+ * @param {number} wait The number of milliseconds to throttle executions to.
+ * @param {Object} [options] The options object.
+ * @param {boolean} [options.leading=true] Specify execution on the leading edge of the timeout.
+ * @param {boolean} [options.trailing=true] Specify execution on the trailing edge of the timeout.
+ * @returns {Function} Returns the new throttled function.
+ * @example
+ *
+ * // avoid excessively updating the position while scrolling
+ * var throttled = _.throttle(updatePosition, 100);
+ * jQuery(window).on('scroll', throttled);
+ *
+ * // execute `renewToken` when the click event is fired, but not more than once every 5 minutes
+ * jQuery('.interactive').on('click', _.throttle(renewToken, 300000, {
+ * 'trailing': false
+ * }));
+ */
+ function throttle(func, wait, options) {
+ var leading = true,
+ trailing = true;
+
+ if (!isFunction(func)) {
+ throw new TypeError;
+ }
+ if (options === false) {
+ leading = false;
+ } else if (isObject(options)) {
+ leading = 'leading' in options ? options.leading : leading;
+ trailing = 'trailing' in options ? options.trailing : trailing;
+ }
+ debounceOptions.leading = leading;
+ debounceOptions.maxWait = wait;
+ debounceOptions.trailing = trailing;
+
+ return debounce(func, wait, debounceOptions);
+ }
+
+ /**
+ * Creates a function that provides `value` to the wrapper function as its
+ * first argument. Additional arguments provided to the function are appended
+ * to those provided to the wrapper function. The wrapper is executed with
+ * the `this` binding of the created function.
+ *
+ * @static
+ * @memberOf _
+ * @category Functions
+ * @param {*} value The value to wrap.
+ * @param {Function} wrapper The wrapper function.
+ * @returns {Function} Returns the new function.
+ * @example
+ *
+ * var p = _.wrap(_.escape, function(func, text) {
+ * return '' + func(text) + '
';
+ * });
+ *
+ * p('Fred, Wilma, & Pebbles');
+ * // => 'Fred, Wilma, & Pebbles
'
+ */
+ function wrap(value, wrapper) {
+ return createWrapper(wrapper, 16, [value]);
+ }
+
+ /*--------------------------------------------------------------------------*/
+
+ /**
+ * Creates a function that returns `value`.
+ *
+ * @static
+ * @memberOf _
+ * @category Utilities
+ * @param {*} value The value to return from the new function.
+ * @returns {Function} Returns the new function.
+ * @example
+ *
+ * var object = { 'name': 'fred' };
+ * var getter = _.constant(object);
+ * getter() === object;
+ * // => true
+ */
+ function constant(value) {
+ return function() {
+ return value;
+ };
+ }
+
+ /**
+ * Produces a callback bound to an optional `thisArg`. If `func` is a property
+ * name the created callback will return the property value for a given element.
+ * If `func` is an object the created callback will return `true` for elements
+ * that contain the equivalent object properties, otherwise it will return `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Utilities
+ * @param {*} [func=identity] The value to convert to a callback.
+ * @param {*} [thisArg] The `this` binding of the created callback.
+ * @param {number} [argCount] The number of arguments the callback accepts.
+ * @returns {Function} Returns a callback function.
+ * @example
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 36 },
+ * { 'name': 'fred', 'age': 40 }
+ * ];
+ *
+ * // wrap to create custom callback shorthands
+ * _.createCallback = _.wrap(_.createCallback, function(func, callback, thisArg) {
+ * var match = /^(.+?)__([gl]t)(.+)$/.exec(callback);
+ * return !match ? func(callback, thisArg) : function(object) {
+ * return match[2] == 'gt' ? object[match[1]] > match[3] : object[match[1]] < match[3];
+ * };
+ * });
+ *
+ * _.filter(characters, 'age__gt38');
+ * // => [{ 'name': 'fred', 'age': 40 }]
+ */
+ function createCallback(func, thisArg, argCount) {
+ var type = typeof func;
+ if (func == null || type == 'function') {
+ return baseCreateCallback(func, thisArg, argCount);
+ }
+ // handle "_.pluck" style callback shorthands
+ if (type != 'object') {
+ return property(func);
+ }
+ var props = keys(func),
+ key = props[0],
+ a = func[key];
+
+ // handle "_.where" style callback shorthands
+ if (props.length == 1 && a === a && !isObject(a)) {
+ // fast path the common case of providing an object with a single
+ // property containing a primitive value
+ return function(object) {
+ var b = object[key];
+ return a === b && (a !== 0 || (1 / a == 1 / b));
+ };
+ }
+ return function(object) {
+ var length = props.length,
+ result = false;
+
+ while (length--) {
+ if (!(result = baseIsEqual(object[props[length]], func[props[length]], null, true))) {
+ break;
+ }
+ }
+ return result;
+ };
+ }
+
+ /**
+ * Converts the characters `&`, `<`, `>`, `"`, and `'` in `string` to their
+ * corresponding HTML entities.
+ *
+ * @static
+ * @memberOf _
+ * @category Utilities
+ * @param {string} string The string to escape.
+ * @returns {string} Returns the escaped string.
+ * @example
+ *
+ * _.escape('Fred, Wilma, & Pebbles');
+ * // => 'Fred, Wilma, & Pebbles'
+ */
+ function escape(string) {
+ return string == null ? '' : String(string).replace(reUnescapedHtml, escapeHtmlChar);
+ }
+
+ /**
+ * This method returns the first argument provided to it.
+ *
+ * @static
+ * @memberOf _
+ * @category Utilities
+ * @param {*} value Any value.
+ * @returns {*} Returns `value`.
+ * @example
+ *
+ * var object = { 'name': 'fred' };
+ * _.identity(object) === object;
+ * // => true
+ */
+ function identity(value) {
+ return value;
+ }
+
+ /**
+ * Adds function properties of a source object to the destination object.
+ * If `object` is a function methods will be added to its prototype as well.
+ *
+ * @static
+ * @memberOf _
+ * @category Utilities
+ * @param {Function|Object} [object=lodash] object The destination object.
+ * @param {Object} source The object of functions to add.
+ * @param {Object} [options] The options object.
+ * @param {boolean} [options.chain=true] Specify whether the functions added are chainable.
+ * @example
+ *
+ * function capitalize(string) {
+ * return string.charAt(0).toUpperCase() + string.slice(1).toLowerCase();
+ * }
+ *
+ * _.mixin({ 'capitalize': capitalize });
+ * _.capitalize('fred');
+ * // => 'Fred'
+ *
+ * _('fred').capitalize().value();
+ * // => 'Fred'
+ *
+ * _.mixin({ 'capitalize': capitalize }, { 'chain': false });
+ * _('fred').capitalize();
+ * // => 'Fred'
+ */
+ function mixin(object, source, options) {
+ var chain = true,
+ methodNames = source && functions(source);
+
+ if (!source || (!options && !methodNames.length)) {
+ if (options == null) {
+ options = source;
+ }
+ ctor = lodashWrapper;
+ source = object;
+ object = lodash;
+ methodNames = functions(source);
+ }
+ if (options === false) {
+ chain = false;
+ } else if (isObject(options) && 'chain' in options) {
+ chain = options.chain;
+ }
+ var ctor = object,
+ isFunc = isFunction(ctor);
+
+ forEach(methodNames, function(methodName) {
+ var func = object[methodName] = source[methodName];
+ if (isFunc) {
+ ctor.prototype[methodName] = function() {
+ var chainAll = this.__chain__,
+ value = this.__wrapped__,
+ args = [value];
+
+ push.apply(args, arguments);
+ var result = func.apply(object, args);
+ if (chain || chainAll) {
+ if (value === result && isObject(result)) {
+ return this;
+ }
+ result = new ctor(result);
+ result.__chain__ = chainAll;
+ }
+ return result;
+ };
+ }
+ });
+ }
+
+ /**
+ * Reverts the '_' variable to its previous value and returns a reference to
+ * the `lodash` function.
+ *
+ * @static
+ * @memberOf _
+ * @category Utilities
+ * @returns {Function} Returns the `lodash` function.
+ * @example
+ *
+ * var lodash = _.noConflict();
+ */
+ function noConflict() {
+ context._ = oldDash;
+ return this;
+ }
+
+ /**
+ * A no-operation function.
+ *
+ * @static
+ * @memberOf _
+ * @category Utilities
+ * @example
+ *
+ * var object = { 'name': 'fred' };
+ * _.noop(object) === undefined;
+ * // => true
+ */
+ function noop() {
+ // no operation performed
+ }
+
+ /**
+ * Gets the number of milliseconds that have elapsed since the Unix epoch
+ * (1 January 1970 00:00:00 UTC).
+ *
+ * @static
+ * @memberOf _
+ * @category Utilities
+ * @example
+ *
+ * var stamp = _.now();
+ * _.defer(function() { console.log(_.now() - stamp); });
+ * // => logs the number of milliseconds it took for the deferred function to be called
+ */
+ var now = isNative(now = Date.now) && now || function() {
+ return new Date().getTime();
+ };
+
+ /**
+ * Converts the given value into an integer of the specified radix.
+ * If `radix` is `undefined` or `0` a `radix` of `10` is used unless the
+ * `value` is a hexadecimal, in which case a `radix` of `16` is used.
+ *
+ * Note: This method avoids differences in native ES3 and ES5 `parseInt`
+ * implementations. See http://es5.github.io/#E.
+ *
+ * @static
+ * @memberOf _
+ * @category Utilities
+ * @param {string} value The value to parse.
+ * @param {number} [radix] The radix used to interpret the value to parse.
+ * @returns {number} Returns the new integer value.
+ * @example
+ *
+ * _.parseInt('08');
+ * // => 8
+ */
+ var parseInt = nativeParseInt(whitespace + '08') == 8 ? nativeParseInt : function(value, radix) {
+ // Firefox < 21 and Opera < 15 follow the ES3 specified implementation of `parseInt`
+ return nativeParseInt(isString(value) ? value.replace(reLeadingSpacesAndZeros, '') : value, radix || 0);
+ };
+
+ /**
+ * Creates a "_.pluck" style function, which returns the `key` value of a
+ * given object.
+ *
+ * @static
+ * @memberOf _
+ * @category Utilities
+ * @param {string} key The name of the property to retrieve.
+ * @returns {Function} Returns the new function.
+ * @example
+ *
+ * var characters = [
+ * { 'name': 'fred', 'age': 40 },
+ * { 'name': 'barney', 'age': 36 }
+ * ];
+ *
+ * var getName = _.property('name');
+ *
+ * _.map(characters, getName);
+ * // => ['barney', 'fred']
+ *
+ * _.sortBy(characters, getName);
+ * // => [{ 'name': 'barney', 'age': 36 }, { 'name': 'fred', 'age': 40 }]
+ */
+ function property(key) {
+ return function(object) {
+ return object[key];
+ };
+ }
+
+ /**
+ * Produces a random number between `min` and `max` (inclusive). If only one
+ * argument is provided a number between `0` and the given number will be
+ * returned. If `floating` is truey or either `min` or `max` are floats a
+ * floating-point number will be returned instead of an integer.
+ *
+ * @static
+ * @memberOf _
+ * @category Utilities
+ * @param {number} [min=0] The minimum possible value.
+ * @param {number} [max=1] The maximum possible value.
+ * @param {boolean} [floating=false] Specify returning a floating-point number.
+ * @returns {number} Returns a random number.
+ * @example
+ *
+ * _.random(0, 5);
+ * // => an integer between 0 and 5
+ *
+ * _.random(5);
+ * // => also an integer between 0 and 5
+ *
+ * _.random(5, true);
+ * // => a floating-point number between 0 and 5
+ *
+ * _.random(1.2, 5.2);
+ * // => a floating-point number between 1.2 and 5.2
+ */
+ function random(min, max, floating) {
+ var noMin = min == null,
+ noMax = max == null;
+
+ if (floating == null) {
+ if (typeof min == 'boolean' && noMax) {
+ floating = min;
+ min = 1;
+ }
+ else if (!noMax && typeof max == 'boolean') {
+ floating = max;
+ noMax = true;
+ }
+ }
+ if (noMin && noMax) {
+ max = 1;
+ }
+ min = +min || 0;
+ if (noMax) {
+ max = min;
+ min = 0;
+ } else {
+ max = +max || 0;
+ }
+ if (floating || min % 1 || max % 1) {
+ var rand = nativeRandom();
+ return nativeMin(min + (rand * (max - min + parseFloat('1e-' + ((rand +'').length - 1)))), max);
+ }
+ return baseRandom(min, max);
+ }
+
+ /**
+ * Resolves the value of property `key` on `object`. If `key` is a function
+ * it will be invoked with the `this` binding of `object` and its result returned,
+ * else the property value is returned. If `object` is falsey then `undefined`
+ * is returned.
+ *
+ * @static
+ * @memberOf _
+ * @category Utilities
+ * @param {Object} object The object to inspect.
+ * @param {string} key The name of the property to resolve.
+ * @returns {*} Returns the resolved value.
+ * @example
+ *
+ * var object = {
+ * 'cheese': 'crumpets',
+ * 'stuff': function() {
+ * return 'nonsense';
+ * }
+ * };
+ *
+ * _.result(object, 'cheese');
+ * // => 'crumpets'
+ *
+ * _.result(object, 'stuff');
+ * // => 'nonsense'
+ */
+ function result(object, key) {
+ if (object) {
+ var value = object[key];
+ return isFunction(value) ? object[key]() : value;
+ }
+ }
+
+ /**
+ * A micro-templating method that handles arbitrary delimiters, preserves
+ * whitespace, and correctly escapes quotes within interpolated code.
+ *
+ * Note: In the development build, `_.template` utilizes sourceURLs for easier
+ * debugging. See http://www.html5rocks.com/en/tutorials/developertools/sourcemaps/#toc-sourceurl
+ *
+ * For more information on precompiling templates see:
+ * http://lodash.com/custom-builds
+ *
+ * For more information on Chrome extension sandboxes see:
+ * http://developer.chrome.com/stable/extensions/sandboxingEval.html
+ *
+ * @static
+ * @memberOf _
+ * @category Utilities
+ * @param {string} text The template text.
+ * @param {Object} data The data object used to populate the text.
+ * @param {Object} [options] The options object.
+ * @param {RegExp} [options.escape] The "escape" delimiter.
+ * @param {RegExp} [options.evaluate] The "evaluate" delimiter.
+ * @param {Object} [options.imports] An object to import into the template as local variables.
+ * @param {RegExp} [options.interpolate] The "interpolate" delimiter.
+ * @param {string} [sourceURL] The sourceURL of the template's compiled source.
+ * @param {string} [variable] The data object variable name.
+ * @returns {Function|string} Returns a compiled function when no `data` object
+ * is given, else it returns the interpolated text.
+ * @example
+ *
+ * // using the "interpolate" delimiter to create a compiled template
+ * var compiled = _.template('hello <%= name %>');
+ * compiled({ 'name': 'fred' });
+ * // => 'hello fred'
+ *
+ * // using the "escape" delimiter to escape HTML in data property values
+ * _.template('<%- value %> ', { 'value': '
+```
+
+Using [`npm`](http://npmjs.org/):
+
+```bash
+npm i --save lodash
+
+{sudo} npm i -g lodash
+npm ln lodash
+```
+
+In [Node.js](http://nodejs.org/) & [Ringo](http://ringojs.org/):
+
+```js
+var _ = require('lodash');
+// or as Underscore
+var _ = require('lodash/dist/lodash.underscore');
+```
+
+**Notes:**
+ * Don’t assign values to [special variable](http://nodejs.org/api/repl.html#repl_repl_features) `_` when in the REPL
+ * If Lo-Dash is installed globally, run [`npm ln lodash`](http://blog.nodejs.org/2011/03/23/npm-1-0-global-vs-local-installation/) in your project’s root directory *before* requiring it
+
+In [Rhino](http://www.mozilla.org/rhino/):
+
+```js
+load('lodash.js');
+```
+
+In an AMD loader:
+
+```js
+require({
+ 'packages': [
+ { 'name': 'lodash', 'location': 'path/to/lodash', 'main': 'lodash' }
+ ]
+},
+['lodash'], function(_) {
+ console.log(_.VERSION);
+});
+```
+
+## Author
+
+| [](https://twitter.com/jdalton "Follow @jdalton on Twitter") |
+|---|
+| [John-David Dalton](http://allyoucanleet.com/) |
+
+## Contributors
+
+| [](https://twitter.com/blainebublitz "Follow @BlaineBublitz on Twitter") | [](https://twitter.com/kitcambridge "Follow @kitcambridge on Twitter") | [](https://twitter.com/mathias "Follow @mathias on Twitter") |
+|---|---|---|
+| [Blaine Bublitz](http://www.iceddev.com/) | [Kit Cambridge](http://kitcambridge.be/) | [Mathias Bynens](http://mathiasbynens.be/) |
+
+[](https://bitdeli.com/free "Bitdeli Badge")
diff --git a/node_modules/grunt/node_modules/grunt-legacy-log/node_modules/lodash/dist/lodash.compat.js b/node_modules/grunt/node_modules/grunt-legacy-log/node_modules/lodash/dist/lodash.compat.js
new file mode 100644
index 0000000..23798ba
--- /dev/null
+++ b/node_modules/grunt/node_modules/grunt-legacy-log/node_modules/lodash/dist/lodash.compat.js
@@ -0,0 +1,7157 @@
+/**
+ * @license
+ * Lo-Dash 2.4.1 (Custom Build)
+ * Copyright 2009-2013 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
+ * Available under MIT license
+ */
+;(function() {
+
+ /** Used as a safe reference for `undefined` in pre ES5 environments */
+ var undefined;
+
+ /** Used to pool arrays and objects used internally */
+ var arrayPool = [],
+ objectPool = [];
+
+ /** Used to generate unique IDs */
+ var idCounter = 0;
+
+ /** Used internally to indicate various things */
+ var indicatorObject = {};
+
+ /** Used to prefix keys to avoid issues with `__proto__` and properties on `Object.prototype` */
+ var keyPrefix = +new Date + '';
+
+ /** Used as the size when optimizations are enabled for large arrays */
+ var largeArraySize = 75;
+
+ /** Used as the max size of the `arrayPool` and `objectPool` */
+ var maxPoolSize = 40;
+
+ /** Used to detect and test whitespace */
+ var whitespace = (
+ // whitespace
+ ' \t\x0B\f\xA0\ufeff' +
+
+ // line terminators
+ '\n\r\u2028\u2029' +
+
+ // unicode category "Zs" space separators
+ '\u1680\u180e\u2000\u2001\u2002\u2003\u2004\u2005\u2006\u2007\u2008\u2009\u200a\u202f\u205f\u3000'
+ );
+
+ /** Used to match empty string literals in compiled template source */
+ var reEmptyStringLeading = /\b__p \+= '';/g,
+ reEmptyStringMiddle = /\b(__p \+=) '' \+/g,
+ reEmptyStringTrailing = /(__e\(.*?\)|\b__t\)) \+\n'';/g;
+
+ /**
+ * Used to match ES6 template delimiters
+ * http://people.mozilla.org/~jorendorff/es6-draft.html#sec-literals-string-literals
+ */
+ var reEsTemplate = /\$\{([^\\}]*(?:\\.[^\\}]*)*)\}/g;
+
+ /** Used to match regexp flags from their coerced string values */
+ var reFlags = /\w*$/;
+
+ /** Used to detected named functions */
+ var reFuncName = /^\s*function[ \n\r\t]+\w/;
+
+ /** Used to match "interpolate" template delimiters */
+ var reInterpolate = /<%=([\s\S]+?)%>/g;
+
+ /** Used to match leading whitespace and zeros to be removed */
+ var reLeadingSpacesAndZeros = RegExp('^[' + whitespace + ']*0+(?=.$)');
+
+ /** Used to ensure capturing order of template delimiters */
+ var reNoMatch = /($^)/;
+
+ /** Used to detect functions containing a `this` reference */
+ var reThis = /\bthis\b/;
+
+ /** Used to match unescaped characters in compiled string literals */
+ var reUnescapedString = /['\n\r\t\u2028\u2029\\]/g;
+
+ /** Used to assign default `context` object properties */
+ var contextProps = [
+ 'Array', 'Boolean', 'Date', 'Error', 'Function', 'Math', 'Number', 'Object',
+ 'RegExp', 'String', '_', 'attachEvent', 'clearTimeout', 'isFinite', 'isNaN',
+ 'parseInt', 'setTimeout'
+ ];
+
+ /** Used to fix the JScript [[DontEnum]] bug */
+ var shadowedProps = [
+ 'constructor', 'hasOwnProperty', 'isPrototypeOf', 'propertyIsEnumerable',
+ 'toLocaleString', 'toString', 'valueOf'
+ ];
+
+ /** Used to make template sourceURLs easier to identify */
+ var templateCounter = 0;
+
+ /** `Object#toString` result shortcuts */
+ var argsClass = '[object Arguments]',
+ arrayClass = '[object Array]',
+ boolClass = '[object Boolean]',
+ dateClass = '[object Date]',
+ errorClass = '[object Error]',
+ funcClass = '[object Function]',
+ numberClass = '[object Number]',
+ objectClass = '[object Object]',
+ regexpClass = '[object RegExp]',
+ stringClass = '[object String]';
+
+ /** Used to identify object classifications that `_.clone` supports */
+ var cloneableClasses = {};
+ cloneableClasses[funcClass] = false;
+ cloneableClasses[argsClass] = cloneableClasses[arrayClass] =
+ cloneableClasses[boolClass] = cloneableClasses[dateClass] =
+ cloneableClasses[numberClass] = cloneableClasses[objectClass] =
+ cloneableClasses[regexpClass] = cloneableClasses[stringClass] = true;
+
+ /** Used as an internal `_.debounce` options object */
+ var debounceOptions = {
+ 'leading': false,
+ 'maxWait': 0,
+ 'trailing': false
+ };
+
+ /** Used as the property descriptor for `__bindData__` */
+ var descriptor = {
+ 'configurable': false,
+ 'enumerable': false,
+ 'value': null,
+ 'writable': false
+ };
+
+ /** Used as the data object for `iteratorTemplate` */
+ var iteratorData = {
+ 'args': '',
+ 'array': null,
+ 'bottom': '',
+ 'firstArg': '',
+ 'init': '',
+ 'keys': null,
+ 'loop': '',
+ 'shadowedProps': null,
+ 'support': null,
+ 'top': '',
+ 'useHas': false
+ };
+
+ /** Used to determine if values are of the language type Object */
+ var objectTypes = {
+ 'boolean': false,
+ 'function': true,
+ 'object': true,
+ 'number': false,
+ 'string': false,
+ 'undefined': false
+ };
+
+ /** Used to escape characters for inclusion in compiled string literals */
+ var stringEscapes = {
+ '\\': '\\',
+ "'": "'",
+ '\n': 'n',
+ '\r': 'r',
+ '\t': 't',
+ '\u2028': 'u2028',
+ '\u2029': 'u2029'
+ };
+
+ /** Used as a reference to the global object */
+ var root = (objectTypes[typeof window] && window) || this;
+
+ /** Detect free variable `exports` */
+ var freeExports = objectTypes[typeof exports] && exports && !exports.nodeType && exports;
+
+ /** Detect free variable `module` */
+ var freeModule = objectTypes[typeof module] && module && !module.nodeType && module;
+
+ /** Detect the popular CommonJS extension `module.exports` */
+ var moduleExports = freeModule && freeModule.exports === freeExports && freeExports;
+
+ /** Detect free variable `global` from Node.js or Browserified code and use it as `root` */
+ var freeGlobal = objectTypes[typeof global] && global;
+ if (freeGlobal && (freeGlobal.global === freeGlobal || freeGlobal.window === freeGlobal)) {
+ root = freeGlobal;
+ }
+
+ /*--------------------------------------------------------------------------*/
+
+ /**
+ * The base implementation of `_.indexOf` without support for binary searches
+ * or `fromIndex` constraints.
+ *
+ * @private
+ * @param {Array} array The array to search.
+ * @param {*} value The value to search for.
+ * @param {number} [fromIndex=0] The index to search from.
+ * @returns {number} Returns the index of the matched value or `-1`.
+ */
+ function baseIndexOf(array, value, fromIndex) {
+ var index = (fromIndex || 0) - 1,
+ length = array ? array.length : 0;
+
+ while (++index < length) {
+ if (array[index] === value) {
+ return index;
+ }
+ }
+ return -1;
+ }
+
+ /**
+ * An implementation of `_.contains` for cache objects that mimics the return
+ * signature of `_.indexOf` by returning `0` if the value is found, else `-1`.
+ *
+ * @private
+ * @param {Object} cache The cache object to inspect.
+ * @param {*} value The value to search for.
+ * @returns {number} Returns `0` if `value` is found, else `-1`.
+ */
+ function cacheIndexOf(cache, value) {
+ var type = typeof value;
+ cache = cache.cache;
+
+ if (type == 'boolean' || value == null) {
+ return cache[value] ? 0 : -1;
+ }
+ if (type != 'number' && type != 'string') {
+ type = 'object';
+ }
+ var key = type == 'number' ? value : keyPrefix + value;
+ cache = (cache = cache[type]) && cache[key];
+
+ return type == 'object'
+ ? (cache && baseIndexOf(cache, value) > -1 ? 0 : -1)
+ : (cache ? 0 : -1);
+ }
+
+ /**
+ * Adds a given value to the corresponding cache object.
+ *
+ * @private
+ * @param {*} value The value to add to the cache.
+ */
+ function cachePush(value) {
+ var cache = this.cache,
+ type = typeof value;
+
+ if (type == 'boolean' || value == null) {
+ cache[value] = true;
+ } else {
+ if (type != 'number' && type != 'string') {
+ type = 'object';
+ }
+ var key = type == 'number' ? value : keyPrefix + value,
+ typeCache = cache[type] || (cache[type] = {});
+
+ if (type == 'object') {
+ (typeCache[key] || (typeCache[key] = [])).push(value);
+ } else {
+ typeCache[key] = true;
+ }
+ }
+ }
+
+ /**
+ * Used by `_.max` and `_.min` as the default callback when a given
+ * collection is a string value.
+ *
+ * @private
+ * @param {string} value The character to inspect.
+ * @returns {number} Returns the code unit of given character.
+ */
+ function charAtCallback(value) {
+ return value.charCodeAt(0);
+ }
+
+ /**
+ * Used by `sortBy` to compare transformed `collection` elements, stable sorting
+ * them in ascending order.
+ *
+ * @private
+ * @param {Object} a The object to compare to `b`.
+ * @param {Object} b The object to compare to `a`.
+ * @returns {number} Returns the sort order indicator of `1` or `-1`.
+ */
+ function compareAscending(a, b) {
+ var ac = a.criteria,
+ bc = b.criteria,
+ index = -1,
+ length = ac.length;
+
+ while (++index < length) {
+ var value = ac[index],
+ other = bc[index];
+
+ if (value !== other) {
+ if (value > other || typeof value == 'undefined') {
+ return 1;
+ }
+ if (value < other || typeof other == 'undefined') {
+ return -1;
+ }
+ }
+ }
+ // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications
+ // that causes it, under certain circumstances, to return the same value for
+ // `a` and `b`. See https://github.com/jashkenas/underscore/pull/1247
+ //
+ // This also ensures a stable sort in V8 and other engines.
+ // See http://code.google.com/p/v8/issues/detail?id=90
+ return a.index - b.index;
+ }
+
+ /**
+ * Creates a cache object to optimize linear searches of large arrays.
+ *
+ * @private
+ * @param {Array} [array=[]] The array to search.
+ * @returns {null|Object} Returns the cache object or `null` if caching should not be used.
+ */
+ function createCache(array) {
+ var index = -1,
+ length = array.length,
+ first = array[0],
+ mid = array[(length / 2) | 0],
+ last = array[length - 1];
+
+ if (first && typeof first == 'object' &&
+ mid && typeof mid == 'object' && last && typeof last == 'object') {
+ return false;
+ }
+ var cache = getObject();
+ cache['false'] = cache['null'] = cache['true'] = cache['undefined'] = false;
+
+ var result = getObject();
+ result.array = array;
+ result.cache = cache;
+ result.push = cachePush;
+
+ while (++index < length) {
+ result.push(array[index]);
+ }
+ return result;
+ }
+
+ /**
+ * Used by `template` to escape characters for inclusion in compiled
+ * string literals.
+ *
+ * @private
+ * @param {string} match The matched character to escape.
+ * @returns {string} Returns the escaped character.
+ */
+ function escapeStringChar(match) {
+ return '\\' + stringEscapes[match];
+ }
+
+ /**
+ * Gets an array from the array pool or creates a new one if the pool is empty.
+ *
+ * @private
+ * @returns {Array} The array from the pool.
+ */
+ function getArray() {
+ return arrayPool.pop() || [];
+ }
+
+ /**
+ * Gets an object from the object pool or creates a new one if the pool is empty.
+ *
+ * @private
+ * @returns {Object} The object from the pool.
+ */
+ function getObject() {
+ return objectPool.pop() || {
+ 'array': null,
+ 'cache': null,
+ 'criteria': null,
+ 'false': false,
+ 'index': 0,
+ 'null': false,
+ 'number': null,
+ 'object': null,
+ 'push': null,
+ 'string': null,
+ 'true': false,
+ 'undefined': false,
+ 'value': null
+ };
+ }
+
+ /**
+ * Checks if `value` is a DOM node in IE < 9.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if the `value` is a DOM node, else `false`.
+ */
+ function isNode(value) {
+ // IE < 9 presents DOM nodes as `Object` objects except they have `toString`
+ // methods that are `typeof` "string" and still can coerce nodes to strings
+ return typeof value.toString != 'function' && typeof (value + '') == 'string';
+ }
+
+ /**
+ * Releases the given array back to the array pool.
+ *
+ * @private
+ * @param {Array} [array] The array to release.
+ */
+ function releaseArray(array) {
+ array.length = 0;
+ if (arrayPool.length < maxPoolSize) {
+ arrayPool.push(array);
+ }
+ }
+
+ /**
+ * Releases the given object back to the object pool.
+ *
+ * @private
+ * @param {Object} [object] The object to release.
+ */
+ function releaseObject(object) {
+ var cache = object.cache;
+ if (cache) {
+ releaseObject(cache);
+ }
+ object.array = object.cache = object.criteria = object.object = object.number = object.string = object.value = null;
+ if (objectPool.length < maxPoolSize) {
+ objectPool.push(object);
+ }
+ }
+
+ /**
+ * Slices the `collection` from the `start` index up to, but not including,
+ * the `end` index.
+ *
+ * Note: This function is used instead of `Array#slice` to support node lists
+ * in IE < 9 and to ensure dense arrays are returned.
+ *
+ * @private
+ * @param {Array|Object|string} collection The collection to slice.
+ * @param {number} start The start index.
+ * @param {number} end The end index.
+ * @returns {Array} Returns the new array.
+ */
+ function slice(array, start, end) {
+ start || (start = 0);
+ if (typeof end == 'undefined') {
+ end = array ? array.length : 0;
+ }
+ var index = -1,
+ length = end - start || 0,
+ result = Array(length < 0 ? 0 : length);
+
+ while (++index < length) {
+ result[index] = array[start + index];
+ }
+ return result;
+ }
+
+ /*--------------------------------------------------------------------------*/
+
+ /**
+ * Create a new `lodash` function using the given context object.
+ *
+ * @static
+ * @memberOf _
+ * @category Utilities
+ * @param {Object} [context=root] The context object.
+ * @returns {Function} Returns the `lodash` function.
+ */
+ function runInContext(context) {
+ // Avoid issues with some ES3 environments that attempt to use values, named
+ // after built-in constructors like `Object`, for the creation of literals.
+ // ES5 clears this up by stating that literals must use built-in constructors.
+ // See http://es5.github.io/#x11.1.5.
+ context = context ? _.defaults(root.Object(), context, _.pick(root, contextProps)) : root;
+
+ /** Native constructor references */
+ var Array = context.Array,
+ Boolean = context.Boolean,
+ Date = context.Date,
+ Error = context.Error,
+ Function = context.Function,
+ Math = context.Math,
+ Number = context.Number,
+ Object = context.Object,
+ RegExp = context.RegExp,
+ String = context.String,
+ TypeError = context.TypeError;
+
+ /**
+ * Used for `Array` method references.
+ *
+ * Normally `Array.prototype` would suffice, however, using an array literal
+ * avoids issues in Narwhal.
+ */
+ var arrayRef = [];
+
+ /** Used for native method references */
+ var errorProto = Error.prototype,
+ objectProto = Object.prototype,
+ stringProto = String.prototype;
+
+ /** Used to restore the original `_` reference in `noConflict` */
+ var oldDash = context._;
+
+ /** Used to resolve the internal [[Class]] of values */
+ var toString = objectProto.toString;
+
+ /** Used to detect if a method is native */
+ var reNative = RegExp('^' +
+ String(toString)
+ .replace(/[.*+?^${}()|[\]\\]/g, '\\$&')
+ .replace(/toString| for [^\]]+/g, '.*?') + '$'
+ );
+
+ /** Native method shortcuts */
+ var ceil = Math.ceil,
+ clearTimeout = context.clearTimeout,
+ floor = Math.floor,
+ fnToString = Function.prototype.toString,
+ getPrototypeOf = isNative(getPrototypeOf = Object.getPrototypeOf) && getPrototypeOf,
+ hasOwnProperty = objectProto.hasOwnProperty,
+ push = arrayRef.push,
+ propertyIsEnumerable = objectProto.propertyIsEnumerable,
+ setTimeout = context.setTimeout,
+ splice = arrayRef.splice,
+ unshift = arrayRef.unshift;
+
+ /** Used to set meta data on functions */
+ var defineProperty = (function() {
+ // IE 8 only accepts DOM elements
+ try {
+ var o = {},
+ func = isNative(func = Object.defineProperty) && func,
+ result = func(o, o, o) && func;
+ } catch(e) { }
+ return result;
+ }());
+
+ /* Native method shortcuts for methods with the same name as other `lodash` methods */
+ var nativeCreate = isNative(nativeCreate = Object.create) && nativeCreate,
+ nativeIsArray = isNative(nativeIsArray = Array.isArray) && nativeIsArray,
+ nativeIsFinite = context.isFinite,
+ nativeIsNaN = context.isNaN,
+ nativeKeys = isNative(nativeKeys = Object.keys) && nativeKeys,
+ nativeMax = Math.max,
+ nativeMin = Math.min,
+ nativeParseInt = context.parseInt,
+ nativeRandom = Math.random;
+
+ /** Used to lookup a built-in constructor by [[Class]] */
+ var ctorByClass = {};
+ ctorByClass[arrayClass] = Array;
+ ctorByClass[boolClass] = Boolean;
+ ctorByClass[dateClass] = Date;
+ ctorByClass[funcClass] = Function;
+ ctorByClass[objectClass] = Object;
+ ctorByClass[numberClass] = Number;
+ ctorByClass[regexpClass] = RegExp;
+ ctorByClass[stringClass] = String;
+
+ /** Used to avoid iterating non-enumerable properties in IE < 9 */
+ var nonEnumProps = {};
+ nonEnumProps[arrayClass] = nonEnumProps[dateClass] = nonEnumProps[numberClass] = { 'constructor': true, 'toLocaleString': true, 'toString': true, 'valueOf': true };
+ nonEnumProps[boolClass] = nonEnumProps[stringClass] = { 'constructor': true, 'toString': true, 'valueOf': true };
+ nonEnumProps[errorClass] = nonEnumProps[funcClass] = nonEnumProps[regexpClass] = { 'constructor': true, 'toString': true };
+ nonEnumProps[objectClass] = { 'constructor': true };
+
+ (function() {
+ var length = shadowedProps.length;
+ while (length--) {
+ var key = shadowedProps[length];
+ for (var className in nonEnumProps) {
+ if (hasOwnProperty.call(nonEnumProps, className) && !hasOwnProperty.call(nonEnumProps[className], key)) {
+ nonEnumProps[className][key] = false;
+ }
+ }
+ }
+ }());
+
+ /*--------------------------------------------------------------------------*/
+
+ /**
+ * Creates a `lodash` object which wraps the given value to enable intuitive
+ * method chaining.
+ *
+ * In addition to Lo-Dash methods, wrappers also have the following `Array` methods:
+ * `concat`, `join`, `pop`, `push`, `reverse`, `shift`, `slice`, `sort`, `splice`,
+ * and `unshift`
+ *
+ * Chaining is supported in custom builds as long as the `value` method is
+ * implicitly or explicitly included in the build.
+ *
+ * The chainable wrapper functions are:
+ * `after`, `assign`, `bind`, `bindAll`, `bindKey`, `chain`, `compact`,
+ * `compose`, `concat`, `countBy`, `create`, `createCallback`, `curry`,
+ * `debounce`, `defaults`, `defer`, `delay`, `difference`, `filter`, `flatten`,
+ * `forEach`, `forEachRight`, `forIn`, `forInRight`, `forOwn`, `forOwnRight`,
+ * `functions`, `groupBy`, `indexBy`, `initial`, `intersection`, `invert`,
+ * `invoke`, `keys`, `map`, `max`, `memoize`, `merge`, `min`, `object`, `omit`,
+ * `once`, `pairs`, `partial`, `partialRight`, `pick`, `pluck`, `pull`, `push`,
+ * `range`, `reject`, `remove`, `rest`, `reverse`, `shuffle`, `slice`, `sort`,
+ * `sortBy`, `splice`, `tap`, `throttle`, `times`, `toArray`, `transform`,
+ * `union`, `uniq`, `unshift`, `unzip`, `values`, `where`, `without`, `wrap`,
+ * and `zip`
+ *
+ * The non-chainable wrapper functions are:
+ * `clone`, `cloneDeep`, `contains`, `escape`, `every`, `find`, `findIndex`,
+ * `findKey`, `findLast`, `findLastIndex`, `findLastKey`, `has`, `identity`,
+ * `indexOf`, `isArguments`, `isArray`, `isBoolean`, `isDate`, `isElement`,
+ * `isEmpty`, `isEqual`, `isFinite`, `isFunction`, `isNaN`, `isNull`, `isNumber`,
+ * `isObject`, `isPlainObject`, `isRegExp`, `isString`, `isUndefined`, `join`,
+ * `lastIndexOf`, `mixin`, `noConflict`, `parseInt`, `pop`, `random`, `reduce`,
+ * `reduceRight`, `result`, `shift`, `size`, `some`, `sortedIndex`, `runInContext`,
+ * `template`, `unescape`, `uniqueId`, and `value`
+ *
+ * The wrapper functions `first` and `last` return wrapped values when `n` is
+ * provided, otherwise they return unwrapped values.
+ *
+ * Explicit chaining can be enabled by using the `_.chain` method.
+ *
+ * @name _
+ * @constructor
+ * @category Chaining
+ * @param {*} value The value to wrap in a `lodash` instance.
+ * @returns {Object} Returns a `lodash` instance.
+ * @example
+ *
+ * var wrapped = _([1, 2, 3]);
+ *
+ * // returns an unwrapped value
+ * wrapped.reduce(function(sum, num) {
+ * return sum + num;
+ * });
+ * // => 6
+ *
+ * // returns a wrapped value
+ * var squares = wrapped.map(function(num) {
+ * return num * num;
+ * });
+ *
+ * _.isArray(squares);
+ * // => false
+ *
+ * _.isArray(squares.value());
+ * // => true
+ */
+ function lodash(value) {
+ // don't wrap if already wrapped, even if wrapped by a different `lodash` constructor
+ return (value && typeof value == 'object' && !isArray(value) && hasOwnProperty.call(value, '__wrapped__'))
+ ? value
+ : new lodashWrapper(value);
+ }
+
+ /**
+ * A fast path for creating `lodash` wrapper objects.
+ *
+ * @private
+ * @param {*} value The value to wrap in a `lodash` instance.
+ * @param {boolean} chainAll A flag to enable chaining for all methods
+ * @returns {Object} Returns a `lodash` instance.
+ */
+ function lodashWrapper(value, chainAll) {
+ this.__chain__ = !!chainAll;
+ this.__wrapped__ = value;
+ }
+ // ensure `new lodashWrapper` is an instance of `lodash`
+ lodashWrapper.prototype = lodash.prototype;
+
+ /**
+ * An object used to flag environments features.
+ *
+ * @static
+ * @memberOf _
+ * @type Object
+ */
+ var support = lodash.support = {};
+
+ (function() {
+ var ctor = function() { this.x = 1; },
+ object = { '0': 1, 'length': 1 },
+ props = [];
+
+ ctor.prototype = { 'valueOf': 1, 'y': 1 };
+ for (var key in new ctor) { props.push(key); }
+ for (key in arguments) { }
+
+ /**
+ * Detect if an `arguments` object's [[Class]] is resolvable (all but Firefox < 4, IE < 9).
+ *
+ * @memberOf _.support
+ * @type boolean
+ */
+ support.argsClass = toString.call(arguments) == argsClass;
+
+ /**
+ * Detect if `arguments` objects are `Object` objects (all but Narwhal and Opera < 10.5).
+ *
+ * @memberOf _.support
+ * @type boolean
+ */
+ support.argsObject = arguments.constructor == Object && !(arguments instanceof Array);
+
+ /**
+ * Detect if `name` or `message` properties of `Error.prototype` are
+ * enumerable by default. (IE < 9, Safari < 5.1)
+ *
+ * @memberOf _.support
+ * @type boolean
+ */
+ support.enumErrorProps = propertyIsEnumerable.call(errorProto, 'message') || propertyIsEnumerable.call(errorProto, 'name');
+
+ /**
+ * Detect if `prototype` properties are enumerable by default.
+ *
+ * Firefox < 3.6, Opera > 9.50 - Opera < 11.60, and Safari < 5.1
+ * (if the prototype or a property on the prototype has been set)
+ * incorrectly sets a function's `prototype` property [[Enumerable]]
+ * value to `true`.
+ *
+ * @memberOf _.support
+ * @type boolean
+ */
+ support.enumPrototypes = propertyIsEnumerable.call(ctor, 'prototype');
+
+ /**
+ * Detect if functions can be decompiled by `Function#toString`
+ * (all but PS3 and older Opera mobile browsers & avoided in Windows 8 apps).
+ *
+ * @memberOf _.support
+ * @type boolean
+ */
+ support.funcDecomp = !isNative(context.WinRTError) && reThis.test(runInContext);
+
+ /**
+ * Detect if `Function#name` is supported (all but IE).
+ *
+ * @memberOf _.support
+ * @type boolean
+ */
+ support.funcNames = typeof Function.name == 'string';
+
+ /**
+ * Detect if `arguments` object indexes are non-enumerable
+ * (Firefox < 4, IE < 9, PhantomJS, Safari < 5.1).
+ *
+ * @memberOf _.support
+ * @type boolean
+ */
+ support.nonEnumArgs = key != 0;
+
+ /**
+ * Detect if properties shadowing those on `Object.prototype` are non-enumerable.
+ *
+ * In IE < 9 an objects own properties, shadowing non-enumerable ones, are
+ * made non-enumerable as well (a.k.a the JScript [[DontEnum]] bug).
+ *
+ * @memberOf _.support
+ * @type boolean
+ */
+ support.nonEnumShadows = !/valueOf/.test(props);
+
+ /**
+ * Detect if own properties are iterated after inherited properties (all but IE < 9).
+ *
+ * @memberOf _.support
+ * @type boolean
+ */
+ support.ownLast = props[0] != 'x';
+
+ /**
+ * Detect if `Array#shift` and `Array#splice` augment array-like objects correctly.
+ *
+ * Firefox < 10, IE compatibility mode, and IE < 9 have buggy Array `shift()`
+ * and `splice()` functions that fail to remove the last element, `value[0]`,
+ * of array-like objects even though the `length` property is set to `0`.
+ * The `shift()` method is buggy in IE 8 compatibility mode, while `splice()`
+ * is buggy regardless of mode in IE < 9 and buggy in compatibility mode in IE 9.
+ *
+ * @memberOf _.support
+ * @type boolean
+ */
+ support.spliceObjects = (arrayRef.splice.call(object, 0, 1), !object[0]);
+
+ /**
+ * Detect lack of support for accessing string characters by index.
+ *
+ * IE < 8 can't access characters by index and IE 8 can only access
+ * characters by index on string literals.
+ *
+ * @memberOf _.support
+ * @type boolean
+ */
+ support.unindexedChars = ('x'[0] + Object('x')[0]) != 'xx';
+
+ /**
+ * Detect if a DOM node's [[Class]] is resolvable (all but IE < 9)
+ * and that the JS engine errors when attempting to coerce an object to
+ * a string without a `toString` function.
+ *
+ * @memberOf _.support
+ * @type boolean
+ */
+ try {
+ support.nodeClass = !(toString.call(document) == objectClass && !({ 'toString': 0 } + ''));
+ } catch(e) {
+ support.nodeClass = true;
+ }
+ }(1));
+
+ /**
+ * By default, the template delimiters used by Lo-Dash are similar to those in
+ * embedded Ruby (ERB). Change the following template settings to use alternative
+ * delimiters.
+ *
+ * @static
+ * @memberOf _
+ * @type Object
+ */
+ lodash.templateSettings = {
+
+ /**
+ * Used to detect `data` property values to be HTML-escaped.
+ *
+ * @memberOf _.templateSettings
+ * @type RegExp
+ */
+ 'escape': /<%-([\s\S]+?)%>/g,
+
+ /**
+ * Used to detect code to be evaluated.
+ *
+ * @memberOf _.templateSettings
+ * @type RegExp
+ */
+ 'evaluate': /<%([\s\S]+?)%>/g,
+
+ /**
+ * Used to detect `data` property values to inject.
+ *
+ * @memberOf _.templateSettings
+ * @type RegExp
+ */
+ 'interpolate': reInterpolate,
+
+ /**
+ * Used to reference the data object in the template text.
+ *
+ * @memberOf _.templateSettings
+ * @type string
+ */
+ 'variable': '',
+
+ /**
+ * Used to import variables into the compiled template.
+ *
+ * @memberOf _.templateSettings
+ * @type Object
+ */
+ 'imports': {
+
+ /**
+ * A reference to the `lodash` function.
+ *
+ * @memberOf _.templateSettings.imports
+ * @type Function
+ */
+ '_': lodash
+ }
+ };
+
+ /*--------------------------------------------------------------------------*/
+
+ /**
+ * The template used to create iterator functions.
+ *
+ * @private
+ * @param {Object} data The data object used to populate the text.
+ * @returns {string} Returns the interpolated text.
+ */
+ var iteratorTemplate = function(obj) {
+
+ var __p = 'var index, iterable = ' +
+ (obj.firstArg) +
+ ', result = ' +
+ (obj.init) +
+ ';\nif (!iterable) return result;\n' +
+ (obj.top) +
+ ';';
+ if (obj.array) {
+ __p += '\nvar length = iterable.length; index = -1;\nif (' +
+ (obj.array) +
+ ') { ';
+ if (support.unindexedChars) {
+ __p += '\n if (isString(iterable)) {\n iterable = iterable.split(\'\')\n } ';
+ }
+ __p += '\n while (++index < length) {\n ' +
+ (obj.loop) +
+ ';\n }\n}\nelse { ';
+ } else if (support.nonEnumArgs) {
+ __p += '\n var length = iterable.length; index = -1;\n if (length && isArguments(iterable)) {\n while (++index < length) {\n index += \'\';\n ' +
+ (obj.loop) +
+ ';\n }\n } else { ';
+ }
+
+ if (support.enumPrototypes) {
+ __p += '\n var skipProto = typeof iterable == \'function\';\n ';
+ }
+
+ if (support.enumErrorProps) {
+ __p += '\n var skipErrorProps = iterable === errorProto || iterable instanceof Error;\n ';
+ }
+
+ var conditions = []; if (support.enumPrototypes) { conditions.push('!(skipProto && index == "prototype")'); } if (support.enumErrorProps) { conditions.push('!(skipErrorProps && (index == "message" || index == "name"))'); }
+
+ if (obj.useHas && obj.keys) {
+ __p += '\n var ownIndex = -1,\n ownProps = objectTypes[typeof iterable] && keys(iterable),\n length = ownProps ? ownProps.length : 0;\n\n while (++ownIndex < length) {\n index = ownProps[ownIndex];\n';
+ if (conditions.length) {
+ __p += ' if (' +
+ (conditions.join(' && ')) +
+ ') {\n ';
+ }
+ __p +=
+ (obj.loop) +
+ '; ';
+ if (conditions.length) {
+ __p += '\n }';
+ }
+ __p += '\n } ';
+ } else {
+ __p += '\n for (index in iterable) {\n';
+ if (obj.useHas) { conditions.push("hasOwnProperty.call(iterable, index)"); } if (conditions.length) {
+ __p += ' if (' +
+ (conditions.join(' && ')) +
+ ') {\n ';
+ }
+ __p +=
+ (obj.loop) +
+ '; ';
+ if (conditions.length) {
+ __p += '\n }';
+ }
+ __p += '\n } ';
+ if (support.nonEnumShadows) {
+ __p += '\n\n if (iterable !== objectProto) {\n var ctor = iterable.constructor,\n isProto = iterable === (ctor && ctor.prototype),\n className = iterable === stringProto ? stringClass : iterable === errorProto ? errorClass : toString.call(iterable),\n nonEnum = nonEnumProps[className];\n ';
+ for (k = 0; k < 7; k++) {
+ __p += '\n index = \'' +
+ (obj.shadowedProps[k]) +
+ '\';\n if ((!(isProto && nonEnum[index]) && hasOwnProperty.call(iterable, index))';
+ if (!obj.useHas) {
+ __p += ' || (!nonEnum[index] && iterable[index] !== objectProto[index])';
+ }
+ __p += ') {\n ' +
+ (obj.loop) +
+ ';\n } ';
+ }
+ __p += '\n } ';
+ }
+
+ }
+
+ if (obj.array || support.nonEnumArgs) {
+ __p += '\n}';
+ }
+ __p +=
+ (obj.bottom) +
+ ';\nreturn result';
+
+ return __p
+ };
+
+ /*--------------------------------------------------------------------------*/
+
+ /**
+ * The base implementation of `_.bind` that creates the bound function and
+ * sets its meta data.
+ *
+ * @private
+ * @param {Array} bindData The bind data array.
+ * @returns {Function} Returns the new bound function.
+ */
+ function baseBind(bindData) {
+ var func = bindData[0],
+ partialArgs = bindData[2],
+ thisArg = bindData[4];
+
+ function bound() {
+ // `Function#bind` spec
+ // http://es5.github.io/#x15.3.4.5
+ if (partialArgs) {
+ // avoid `arguments` object deoptimizations by using `slice` instead
+ // of `Array.prototype.slice.call` and not assigning `arguments` to a
+ // variable as a ternary expression
+ var args = slice(partialArgs);
+ push.apply(args, arguments);
+ }
+ // mimic the constructor's `return` behavior
+ // http://es5.github.io/#x13.2.2
+ if (this instanceof bound) {
+ // ensure `new bound` is an instance of `func`
+ var thisBinding = baseCreate(func.prototype),
+ result = func.apply(thisBinding, args || arguments);
+ return isObject(result) ? result : thisBinding;
+ }
+ return func.apply(thisArg, args || arguments);
+ }
+ setBindData(bound, bindData);
+ return bound;
+ }
+
+ /**
+ * The base implementation of `_.clone` without argument juggling or support
+ * for `thisArg` binding.
+ *
+ * @private
+ * @param {*} value The value to clone.
+ * @param {boolean} [isDeep=false] Specify a deep clone.
+ * @param {Function} [callback] The function to customize cloning values.
+ * @param {Array} [stackA=[]] Tracks traversed source objects.
+ * @param {Array} [stackB=[]] Associates clones with source counterparts.
+ * @returns {*} Returns the cloned value.
+ */
+ function baseClone(value, isDeep, callback, stackA, stackB) {
+ if (callback) {
+ var result = callback(value);
+ if (typeof result != 'undefined') {
+ return result;
+ }
+ }
+ // inspect [[Class]]
+ var isObj = isObject(value);
+ if (isObj) {
+ var className = toString.call(value);
+ if (!cloneableClasses[className] || (!support.nodeClass && isNode(value))) {
+ return value;
+ }
+ var ctor = ctorByClass[className];
+ switch (className) {
+ case boolClass:
+ case dateClass:
+ return new ctor(+value);
+
+ case numberClass:
+ case stringClass:
+ return new ctor(value);
+
+ case regexpClass:
+ result = ctor(value.source, reFlags.exec(value));
+ result.lastIndex = value.lastIndex;
+ return result;
+ }
+ } else {
+ return value;
+ }
+ var isArr = isArray(value);
+ if (isDeep) {
+ // check for circular references and return corresponding clone
+ var initedStack = !stackA;
+ stackA || (stackA = getArray());
+ stackB || (stackB = getArray());
+
+ var length = stackA.length;
+ while (length--) {
+ if (stackA[length] == value) {
+ return stackB[length];
+ }
+ }
+ result = isArr ? ctor(value.length) : {};
+ }
+ else {
+ result = isArr ? slice(value) : assign({}, value);
+ }
+ // add array properties assigned by `RegExp#exec`
+ if (isArr) {
+ if (hasOwnProperty.call(value, 'index')) {
+ result.index = value.index;
+ }
+ if (hasOwnProperty.call(value, 'input')) {
+ result.input = value.input;
+ }
+ }
+ // exit for shallow clone
+ if (!isDeep) {
+ return result;
+ }
+ // add the source value to the stack of traversed objects
+ // and associate it with its clone
+ stackA.push(value);
+ stackB.push(result);
+
+ // recursively populate clone (susceptible to call stack limits)
+ (isArr ? baseEach : forOwn)(value, function(objValue, key) {
+ result[key] = baseClone(objValue, isDeep, callback, stackA, stackB);
+ });
+
+ if (initedStack) {
+ releaseArray(stackA);
+ releaseArray(stackB);
+ }
+ return result;
+ }
+
+ /**
+ * The base implementation of `_.create` without support for assigning
+ * properties to the created object.
+ *
+ * @private
+ * @param {Object} prototype The object to inherit from.
+ * @returns {Object} Returns the new object.
+ */
+ function baseCreate(prototype, properties) {
+ return isObject(prototype) ? nativeCreate(prototype) : {};
+ }
+ // fallback for browsers without `Object.create`
+ if (!nativeCreate) {
+ baseCreate = (function() {
+ function Object() {}
+ return function(prototype) {
+ if (isObject(prototype)) {
+ Object.prototype = prototype;
+ var result = new Object;
+ Object.prototype = null;
+ }
+ return result || context.Object();
+ };
+ }());
+ }
+
+ /**
+ * The base implementation of `_.createCallback` without support for creating
+ * "_.pluck" or "_.where" style callbacks.
+ *
+ * @private
+ * @param {*} [func=identity] The value to convert to a callback.
+ * @param {*} [thisArg] The `this` binding of the created callback.
+ * @param {number} [argCount] The number of arguments the callback accepts.
+ * @returns {Function} Returns a callback function.
+ */
+ function baseCreateCallback(func, thisArg, argCount) {
+ if (typeof func != 'function') {
+ return identity;
+ }
+ // exit early for no `thisArg` or already bound by `Function#bind`
+ if (typeof thisArg == 'undefined' || !('prototype' in func)) {
+ return func;
+ }
+ var bindData = func.__bindData__;
+ if (typeof bindData == 'undefined') {
+ if (support.funcNames) {
+ bindData = !func.name;
+ }
+ bindData = bindData || !support.funcDecomp;
+ if (!bindData) {
+ var source = fnToString.call(func);
+ if (!support.funcNames) {
+ bindData = !reFuncName.test(source);
+ }
+ if (!bindData) {
+ // checks if `func` references the `this` keyword and stores the result
+ bindData = reThis.test(source);
+ setBindData(func, bindData);
+ }
+ }
+ }
+ // exit early if there are no `this` references or `func` is bound
+ if (bindData === false || (bindData !== true && bindData[1] & 1)) {
+ return func;
+ }
+ switch (argCount) {
+ case 1: return function(value) {
+ return func.call(thisArg, value);
+ };
+ case 2: return function(a, b) {
+ return func.call(thisArg, a, b);
+ };
+ case 3: return function(value, index, collection) {
+ return func.call(thisArg, value, index, collection);
+ };
+ case 4: return function(accumulator, value, index, collection) {
+ return func.call(thisArg, accumulator, value, index, collection);
+ };
+ }
+ return bind(func, thisArg);
+ }
+
+ /**
+ * The base implementation of `createWrapper` that creates the wrapper and
+ * sets its meta data.
+ *
+ * @private
+ * @param {Array} bindData The bind data array.
+ * @returns {Function} Returns the new function.
+ */
+ function baseCreateWrapper(bindData) {
+ var func = bindData[0],
+ bitmask = bindData[1],
+ partialArgs = bindData[2],
+ partialRightArgs = bindData[3],
+ thisArg = bindData[4],
+ arity = bindData[5];
+
+ var isBind = bitmask & 1,
+ isBindKey = bitmask & 2,
+ isCurry = bitmask & 4,
+ isCurryBound = bitmask & 8,
+ key = func;
+
+ function bound() {
+ var thisBinding = isBind ? thisArg : this;
+ if (partialArgs) {
+ var args = slice(partialArgs);
+ push.apply(args, arguments);
+ }
+ if (partialRightArgs || isCurry) {
+ args || (args = slice(arguments));
+ if (partialRightArgs) {
+ push.apply(args, partialRightArgs);
+ }
+ if (isCurry && args.length < arity) {
+ bitmask |= 16 & ~32;
+ return baseCreateWrapper([func, (isCurryBound ? bitmask : bitmask & ~3), args, null, thisArg, arity]);
+ }
+ }
+ args || (args = arguments);
+ if (isBindKey) {
+ func = thisBinding[key];
+ }
+ if (this instanceof bound) {
+ thisBinding = baseCreate(func.prototype);
+ var result = func.apply(thisBinding, args);
+ return isObject(result) ? result : thisBinding;
+ }
+ return func.apply(thisBinding, args);
+ }
+ setBindData(bound, bindData);
+ return bound;
+ }
+
+ /**
+ * The base implementation of `_.difference` that accepts a single array
+ * of values to exclude.
+ *
+ * @private
+ * @param {Array} array The array to process.
+ * @param {Array} [values] The array of values to exclude.
+ * @returns {Array} Returns a new array of filtered values.
+ */
+ function baseDifference(array, values) {
+ var index = -1,
+ indexOf = getIndexOf(),
+ length = array ? array.length : 0,
+ isLarge = length >= largeArraySize && indexOf === baseIndexOf,
+ result = [];
+
+ if (isLarge) {
+ var cache = createCache(values);
+ if (cache) {
+ indexOf = cacheIndexOf;
+ values = cache;
+ } else {
+ isLarge = false;
+ }
+ }
+ while (++index < length) {
+ var value = array[index];
+ if (indexOf(values, value) < 0) {
+ result.push(value);
+ }
+ }
+ if (isLarge) {
+ releaseObject(values);
+ }
+ return result;
+ }
+
+ /**
+ * The base implementation of `_.flatten` without support for callback
+ * shorthands or `thisArg` binding.
+ *
+ * @private
+ * @param {Array} array The array to flatten.
+ * @param {boolean} [isShallow=false] A flag to restrict flattening to a single level.
+ * @param {boolean} [isStrict=false] A flag to restrict flattening to arrays and `arguments` objects.
+ * @param {number} [fromIndex=0] The index to start from.
+ * @returns {Array} Returns a new flattened array.
+ */
+ function baseFlatten(array, isShallow, isStrict, fromIndex) {
+ var index = (fromIndex || 0) - 1,
+ length = array ? array.length : 0,
+ result = [];
+
+ while (++index < length) {
+ var value = array[index];
+
+ if (value && typeof value == 'object' && typeof value.length == 'number'
+ && (isArray(value) || isArguments(value))) {
+ // recursively flatten arrays (susceptible to call stack limits)
+ if (!isShallow) {
+ value = baseFlatten(value, isShallow, isStrict);
+ }
+ var valIndex = -1,
+ valLength = value.length,
+ resIndex = result.length;
+
+ result.length += valLength;
+ while (++valIndex < valLength) {
+ result[resIndex++] = value[valIndex];
+ }
+ } else if (!isStrict) {
+ result.push(value);
+ }
+ }
+ return result;
+ }
+
+ /**
+ * The base implementation of `_.isEqual`, without support for `thisArg` binding,
+ * that allows partial "_.where" style comparisons.
+ *
+ * @private
+ * @param {*} a The value to compare.
+ * @param {*} b The other value to compare.
+ * @param {Function} [callback] The function to customize comparing values.
+ * @param {Function} [isWhere=false] A flag to indicate performing partial comparisons.
+ * @param {Array} [stackA=[]] Tracks traversed `a` objects.
+ * @param {Array} [stackB=[]] Tracks traversed `b` objects.
+ * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
+ */
+ function baseIsEqual(a, b, callback, isWhere, stackA, stackB) {
+ // used to indicate that when comparing objects, `a` has at least the properties of `b`
+ if (callback) {
+ var result = callback(a, b);
+ if (typeof result != 'undefined') {
+ return !!result;
+ }
+ }
+ // exit early for identical values
+ if (a === b) {
+ // treat `+0` vs. `-0` as not equal
+ return a !== 0 || (1 / a == 1 / b);
+ }
+ var type = typeof a,
+ otherType = typeof b;
+
+ // exit early for unlike primitive values
+ if (a === a &&
+ !(a && objectTypes[type]) &&
+ !(b && objectTypes[otherType])) {
+ return false;
+ }
+ // exit early for `null` and `undefined` avoiding ES3's Function#call behavior
+ // http://es5.github.io/#x15.3.4.4
+ if (a == null || b == null) {
+ return a === b;
+ }
+ // compare [[Class]] names
+ var className = toString.call(a),
+ otherClass = toString.call(b);
+
+ if (className == argsClass) {
+ className = objectClass;
+ }
+ if (otherClass == argsClass) {
+ otherClass = objectClass;
+ }
+ if (className != otherClass) {
+ return false;
+ }
+ switch (className) {
+ case boolClass:
+ case dateClass:
+ // coerce dates and booleans to numbers, dates to milliseconds and booleans
+ // to `1` or `0` treating invalid dates coerced to `NaN` as not equal
+ return +a == +b;
+
+ case numberClass:
+ // treat `NaN` vs. `NaN` as equal
+ return (a != +a)
+ ? b != +b
+ // but treat `+0` vs. `-0` as not equal
+ : (a == 0 ? (1 / a == 1 / b) : a == +b);
+
+ case regexpClass:
+ case stringClass:
+ // coerce regexes to strings (http://es5.github.io/#x15.10.6.4)
+ // treat string primitives and their corresponding object instances as equal
+ return a == String(b);
+ }
+ var isArr = className == arrayClass;
+ if (!isArr) {
+ // unwrap any `lodash` wrapped values
+ var aWrapped = hasOwnProperty.call(a, '__wrapped__'),
+ bWrapped = hasOwnProperty.call(b, '__wrapped__');
+
+ if (aWrapped || bWrapped) {
+ return baseIsEqual(aWrapped ? a.__wrapped__ : a, bWrapped ? b.__wrapped__ : b, callback, isWhere, stackA, stackB);
+ }
+ // exit for functions and DOM nodes
+ if (className != objectClass || (!support.nodeClass && (isNode(a) || isNode(b)))) {
+ return false;
+ }
+ // in older versions of Opera, `arguments` objects have `Array` constructors
+ var ctorA = !support.argsObject && isArguments(a) ? Object : a.constructor,
+ ctorB = !support.argsObject && isArguments(b) ? Object : b.constructor;
+
+ // non `Object` object instances with different constructors are not equal
+ if (ctorA != ctorB &&
+ !(isFunction(ctorA) && ctorA instanceof ctorA && isFunction(ctorB) && ctorB instanceof ctorB) &&
+ ('constructor' in a && 'constructor' in b)
+ ) {
+ return false;
+ }
+ }
+ // assume cyclic structures are equal
+ // the algorithm for detecting cyclic structures is adapted from ES 5.1
+ // section 15.12.3, abstract operation `JO` (http://es5.github.io/#x15.12.3)
+ var initedStack = !stackA;
+ stackA || (stackA = getArray());
+ stackB || (stackB = getArray());
+
+ var length = stackA.length;
+ while (length--) {
+ if (stackA[length] == a) {
+ return stackB[length] == b;
+ }
+ }
+ var size = 0;
+ result = true;
+
+ // add `a` and `b` to the stack of traversed objects
+ stackA.push(a);
+ stackB.push(b);
+
+ // recursively compare objects and arrays (susceptible to call stack limits)
+ if (isArr) {
+ // compare lengths to determine if a deep comparison is necessary
+ length = a.length;
+ size = b.length;
+ result = size == length;
+
+ if (result || isWhere) {
+ // deep compare the contents, ignoring non-numeric properties
+ while (size--) {
+ var index = length,
+ value = b[size];
+
+ if (isWhere) {
+ while (index--) {
+ if ((result = baseIsEqual(a[index], value, callback, isWhere, stackA, stackB))) {
+ break;
+ }
+ }
+ } else if (!(result = baseIsEqual(a[size], value, callback, isWhere, stackA, stackB))) {
+ break;
+ }
+ }
+ }
+ }
+ else {
+ // deep compare objects using `forIn`, instead of `forOwn`, to avoid `Object.keys`
+ // which, in this case, is more costly
+ forIn(b, function(value, key, b) {
+ if (hasOwnProperty.call(b, key)) {
+ // count the number of properties.
+ size++;
+ // deep compare each property value.
+ return (result = hasOwnProperty.call(a, key) && baseIsEqual(a[key], value, callback, isWhere, stackA, stackB));
+ }
+ });
+
+ if (result && !isWhere) {
+ // ensure both objects have the same number of properties
+ forIn(a, function(value, key, a) {
+ if (hasOwnProperty.call(a, key)) {
+ // `size` will be `-1` if `a` has more properties than `b`
+ return (result = --size > -1);
+ }
+ });
+ }
+ }
+ stackA.pop();
+ stackB.pop();
+
+ if (initedStack) {
+ releaseArray(stackA);
+ releaseArray(stackB);
+ }
+ return result;
+ }
+
+ /**
+ * The base implementation of `_.merge` without argument juggling or support
+ * for `thisArg` binding.
+ *
+ * @private
+ * @param {Object} object The destination object.
+ * @param {Object} source The source object.
+ * @param {Function} [callback] The function to customize merging properties.
+ * @param {Array} [stackA=[]] Tracks traversed source objects.
+ * @param {Array} [stackB=[]] Associates values with source counterparts.
+ */
+ function baseMerge(object, source, callback, stackA, stackB) {
+ (isArray(source) ? forEach : forOwn)(source, function(source, key) {
+ var found,
+ isArr,
+ result = source,
+ value = object[key];
+
+ if (source && ((isArr = isArray(source)) || isPlainObject(source))) {
+ // avoid merging previously merged cyclic sources
+ var stackLength = stackA.length;
+ while (stackLength--) {
+ if ((found = stackA[stackLength] == source)) {
+ value = stackB[stackLength];
+ break;
+ }
+ }
+ if (!found) {
+ var isShallow;
+ if (callback) {
+ result = callback(value, source);
+ if ((isShallow = typeof result != 'undefined')) {
+ value = result;
+ }
+ }
+ if (!isShallow) {
+ value = isArr
+ ? (isArray(value) ? value : [])
+ : (isPlainObject(value) ? value : {});
+ }
+ // add `source` and associated `value` to the stack of traversed objects
+ stackA.push(source);
+ stackB.push(value);
+
+ // recursively merge objects and arrays (susceptible to call stack limits)
+ if (!isShallow) {
+ baseMerge(value, source, callback, stackA, stackB);
+ }
+ }
+ }
+ else {
+ if (callback) {
+ result = callback(value, source);
+ if (typeof result == 'undefined') {
+ result = source;
+ }
+ }
+ if (typeof result != 'undefined') {
+ value = result;
+ }
+ }
+ object[key] = value;
+ });
+ }
+
+ /**
+ * The base implementation of `_.random` without argument juggling or support
+ * for returning floating-point numbers.
+ *
+ * @private
+ * @param {number} min The minimum possible value.
+ * @param {number} max The maximum possible value.
+ * @returns {number} Returns a random number.
+ */
+ function baseRandom(min, max) {
+ return min + floor(nativeRandom() * (max - min + 1));
+ }
+
+ /**
+ * The base implementation of `_.uniq` without support for callback shorthands
+ * or `thisArg` binding.
+ *
+ * @private
+ * @param {Array} array The array to process.
+ * @param {boolean} [isSorted=false] A flag to indicate that `array` is sorted.
+ * @param {Function} [callback] The function called per iteration.
+ * @returns {Array} Returns a duplicate-value-free array.
+ */
+ function baseUniq(array, isSorted, callback) {
+ var index = -1,
+ indexOf = getIndexOf(),
+ length = array ? array.length : 0,
+ result = [];
+
+ var isLarge = !isSorted && length >= largeArraySize && indexOf === baseIndexOf,
+ seen = (callback || isLarge) ? getArray() : result;
+
+ if (isLarge) {
+ var cache = createCache(seen);
+ indexOf = cacheIndexOf;
+ seen = cache;
+ }
+ while (++index < length) {
+ var value = array[index],
+ computed = callback ? callback(value, index, array) : value;
+
+ if (isSorted
+ ? !index || seen[seen.length - 1] !== computed
+ : indexOf(seen, computed) < 0
+ ) {
+ if (callback || isLarge) {
+ seen.push(computed);
+ }
+ result.push(value);
+ }
+ }
+ if (isLarge) {
+ releaseArray(seen.array);
+ releaseObject(seen);
+ } else if (callback) {
+ releaseArray(seen);
+ }
+ return result;
+ }
+
+ /**
+ * Creates a function that aggregates a collection, creating an object composed
+ * of keys generated from the results of running each element of the collection
+ * through a callback. The given `setter` function sets the keys and values
+ * of the composed object.
+ *
+ * @private
+ * @param {Function} setter The setter function.
+ * @returns {Function} Returns the new aggregator function.
+ */
+ function createAggregator(setter) {
+ return function(collection, callback, thisArg) {
+ var result = {};
+ callback = lodash.createCallback(callback, thisArg, 3);
+
+ if (isArray(collection)) {
+ var index = -1,
+ length = collection.length;
+
+ while (++index < length) {
+ var value = collection[index];
+ setter(result, value, callback(value, index, collection), collection);
+ }
+ } else {
+ baseEach(collection, function(value, key, collection) {
+ setter(result, value, callback(value, key, collection), collection);
+ });
+ }
+ return result;
+ };
+ }
+
+ /**
+ * Creates a function that, when called, either curries or invokes `func`
+ * with an optional `this` binding and partially applied arguments.
+ *
+ * @private
+ * @param {Function|string} func The function or method name to reference.
+ * @param {number} bitmask The bitmask of method flags to compose.
+ * The bitmask may be composed of the following flags:
+ * 1 - `_.bind`
+ * 2 - `_.bindKey`
+ * 4 - `_.curry`
+ * 8 - `_.curry` (bound)
+ * 16 - `_.partial`
+ * 32 - `_.partialRight`
+ * @param {Array} [partialArgs] An array of arguments to prepend to those
+ * provided to the new function.
+ * @param {Array} [partialRightArgs] An array of arguments to append to those
+ * provided to the new function.
+ * @param {*} [thisArg] The `this` binding of `func`.
+ * @param {number} [arity] The arity of `func`.
+ * @returns {Function} Returns the new function.
+ */
+ function createWrapper(func, bitmask, partialArgs, partialRightArgs, thisArg, arity) {
+ var isBind = bitmask & 1,
+ isBindKey = bitmask & 2,
+ isCurry = bitmask & 4,
+ isCurryBound = bitmask & 8,
+ isPartial = bitmask & 16,
+ isPartialRight = bitmask & 32;
+
+ if (!isBindKey && !isFunction(func)) {
+ throw new TypeError;
+ }
+ if (isPartial && !partialArgs.length) {
+ bitmask &= ~16;
+ isPartial = partialArgs = false;
+ }
+ if (isPartialRight && !partialRightArgs.length) {
+ bitmask &= ~32;
+ isPartialRight = partialRightArgs = false;
+ }
+ var bindData = func && func.__bindData__;
+ if (bindData && bindData !== true) {
+ // clone `bindData`
+ bindData = slice(bindData);
+ if (bindData[2]) {
+ bindData[2] = slice(bindData[2]);
+ }
+ if (bindData[3]) {
+ bindData[3] = slice(bindData[3]);
+ }
+ // set `thisBinding` is not previously bound
+ if (isBind && !(bindData[1] & 1)) {
+ bindData[4] = thisArg;
+ }
+ // set if previously bound but not currently (subsequent curried functions)
+ if (!isBind && bindData[1] & 1) {
+ bitmask |= 8;
+ }
+ // set curried arity if not yet set
+ if (isCurry && !(bindData[1] & 4)) {
+ bindData[5] = arity;
+ }
+ // append partial left arguments
+ if (isPartial) {
+ push.apply(bindData[2] || (bindData[2] = []), partialArgs);
+ }
+ // append partial right arguments
+ if (isPartialRight) {
+ unshift.apply(bindData[3] || (bindData[3] = []), partialRightArgs);
+ }
+ // merge flags
+ bindData[1] |= bitmask;
+ return createWrapper.apply(null, bindData);
+ }
+ // fast path for `_.bind`
+ var creater = (bitmask == 1 || bitmask === 17) ? baseBind : baseCreateWrapper;
+ return creater([func, bitmask, partialArgs, partialRightArgs, thisArg, arity]);
+ }
+
+ /**
+ * Creates compiled iteration functions.
+ *
+ * @private
+ * @param {...Object} [options] The compile options object(s).
+ * @param {string} [options.array] Code to determine if the iterable is an array or array-like.
+ * @param {boolean} [options.useHas] Specify using `hasOwnProperty` checks in the object loop.
+ * @param {Function} [options.keys] A reference to `_.keys` for use in own property iteration.
+ * @param {string} [options.args] A comma separated string of iteration function arguments.
+ * @param {string} [options.top] Code to execute before the iteration branches.
+ * @param {string} [options.loop] Code to execute in the object loop.
+ * @param {string} [options.bottom] Code to execute after the iteration branches.
+ * @returns {Function} Returns the compiled function.
+ */
+ function createIterator() {
+ // data properties
+ iteratorData.shadowedProps = shadowedProps;
+
+ // iterator options
+ iteratorData.array = iteratorData.bottom = iteratorData.loop = iteratorData.top = '';
+ iteratorData.init = 'iterable';
+ iteratorData.useHas = true;
+
+ // merge options into a template data object
+ for (var object, index = 0; object = arguments[index]; index++) {
+ for (var key in object) {
+ iteratorData[key] = object[key];
+ }
+ }
+ var args = iteratorData.args;
+ iteratorData.firstArg = /^[^,]+/.exec(args)[0];
+
+ // create the function factory
+ var factory = Function(
+ 'baseCreateCallback, errorClass, errorProto, hasOwnProperty, ' +
+ 'indicatorObject, isArguments, isArray, isString, keys, objectProto, ' +
+ 'objectTypes, nonEnumProps, stringClass, stringProto, toString',
+ 'return function(' + args + ') {\n' + iteratorTemplate(iteratorData) + '\n}'
+ );
+
+ // return the compiled function
+ return factory(
+ baseCreateCallback, errorClass, errorProto, hasOwnProperty,
+ indicatorObject, isArguments, isArray, isString, iteratorData.keys, objectProto,
+ objectTypes, nonEnumProps, stringClass, stringProto, toString
+ );
+ }
+
+ /**
+ * Used by `escape` to convert characters to HTML entities.
+ *
+ * @private
+ * @param {string} match The matched character to escape.
+ * @returns {string} Returns the escaped character.
+ */
+ function escapeHtmlChar(match) {
+ return htmlEscapes[match];
+ }
+
+ /**
+ * Gets the appropriate "indexOf" function. If the `_.indexOf` method is
+ * customized, this method returns the custom method, otherwise it returns
+ * the `baseIndexOf` function.
+ *
+ * @private
+ * @returns {Function} Returns the "indexOf" function.
+ */
+ function getIndexOf() {
+ var result = (result = lodash.indexOf) === indexOf ? baseIndexOf : result;
+ return result;
+ }
+
+ /**
+ * Checks if `value` is a native function.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if the `value` is a native function, else `false`.
+ */
+ function isNative(value) {
+ return typeof value == 'function' && reNative.test(value);
+ }
+
+ /**
+ * Sets `this` binding data on a given function.
+ *
+ * @private
+ * @param {Function} func The function to set data on.
+ * @param {Array} value The data array to set.
+ */
+ var setBindData = !defineProperty ? noop : function(func, value) {
+ descriptor.value = value;
+ defineProperty(func, '__bindData__', descriptor);
+ };
+
+ /**
+ * A fallback implementation of `isPlainObject` which checks if a given value
+ * is an object created by the `Object` constructor, assuming objects created
+ * by the `Object` constructor have no inherited enumerable properties and that
+ * there are no `Object.prototype` extensions.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.
+ */
+ function shimIsPlainObject(value) {
+ var ctor,
+ result;
+
+ // avoid non Object objects, `arguments` objects, and DOM elements
+ if (!(value && toString.call(value) == objectClass) ||
+ (ctor = value.constructor, isFunction(ctor) && !(ctor instanceof ctor)) ||
+ (!support.argsClass && isArguments(value)) ||
+ (!support.nodeClass && isNode(value))) {
+ return false;
+ }
+ // IE < 9 iterates inherited properties before own properties. If the first
+ // iterated property is an object's own property then there are no inherited
+ // enumerable properties.
+ if (support.ownLast) {
+ forIn(value, function(value, key, object) {
+ result = hasOwnProperty.call(object, key);
+ return false;
+ });
+ return result !== false;
+ }
+ // In most environments an object's own properties are iterated before
+ // its inherited properties. If the last iterated property is an object's
+ // own property then there are no inherited enumerable properties.
+ forIn(value, function(value, key) {
+ result = key;
+ });
+ return typeof result == 'undefined' || hasOwnProperty.call(value, result);
+ }
+
+ /**
+ * Used by `unescape` to convert HTML entities to characters.
+ *
+ * @private
+ * @param {string} match The matched character to unescape.
+ * @returns {string} Returns the unescaped character.
+ */
+ function unescapeHtmlChar(match) {
+ return htmlUnescapes[match];
+ }
+
+ /*--------------------------------------------------------------------------*/
+
+ /**
+ * Checks if `value` is an `arguments` object.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if the `value` is an `arguments` object, else `false`.
+ * @example
+ *
+ * (function() { return _.isArguments(arguments); })(1, 2, 3);
+ * // => true
+ *
+ * _.isArguments([1, 2, 3]);
+ * // => false
+ */
+ function isArguments(value) {
+ return value && typeof value == 'object' && typeof value.length == 'number' &&
+ toString.call(value) == argsClass || false;
+ }
+ // fallback for browsers that can't detect `arguments` objects by [[Class]]
+ if (!support.argsClass) {
+ isArguments = function(value) {
+ return value && typeof value == 'object' && typeof value.length == 'number' &&
+ hasOwnProperty.call(value, 'callee') && !propertyIsEnumerable.call(value, 'callee') || false;
+ };
+ }
+
+ /**
+ * Checks if `value` is an array.
+ *
+ * @static
+ * @memberOf _
+ * @type Function
+ * @category Objects
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if the `value` is an array, else `false`.
+ * @example
+ *
+ * (function() { return _.isArray(arguments); })();
+ * // => false
+ *
+ * _.isArray([1, 2, 3]);
+ * // => true
+ */
+ var isArray = nativeIsArray || function(value) {
+ return value && typeof value == 'object' && typeof value.length == 'number' &&
+ toString.call(value) == arrayClass || false;
+ };
+
+ /**
+ * A fallback implementation of `Object.keys` which produces an array of the
+ * given object's own enumerable property names.
+ *
+ * @private
+ * @type Function
+ * @param {Object} object The object to inspect.
+ * @returns {Array} Returns an array of property names.
+ */
+ var shimKeys = createIterator({
+ 'args': 'object',
+ 'init': '[]',
+ 'top': 'if (!(objectTypes[typeof object])) return result',
+ 'loop': 'result.push(index)'
+ });
+
+ /**
+ * Creates an array composed of the own enumerable property names of an object.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {Object} object The object to inspect.
+ * @returns {Array} Returns an array of property names.
+ * @example
+ *
+ * _.keys({ 'one': 1, 'two': 2, 'three': 3 });
+ * // => ['one', 'two', 'three'] (property order is not guaranteed across environments)
+ */
+ var keys = !nativeKeys ? shimKeys : function(object) {
+ if (!isObject(object)) {
+ return [];
+ }
+ if ((support.enumPrototypes && typeof object == 'function') ||
+ (support.nonEnumArgs && object.length && isArguments(object))) {
+ return shimKeys(object);
+ }
+ return nativeKeys(object);
+ };
+
+ /** Reusable iterator options shared by `each`, `forIn`, and `forOwn` */
+ var eachIteratorOptions = {
+ 'args': 'collection, callback, thisArg',
+ 'top': "callback = callback && typeof thisArg == 'undefined' ? callback : baseCreateCallback(callback, thisArg, 3)",
+ 'array': "typeof length == 'number'",
+ 'keys': keys,
+ 'loop': 'if (callback(iterable[index], index, collection) === false) return result'
+ };
+
+ /** Reusable iterator options for `assign` and `defaults` */
+ var defaultsIteratorOptions = {
+ 'args': 'object, source, guard',
+ 'top':
+ 'var args = arguments,\n' +
+ ' argsIndex = 0,\n' +
+ " argsLength = typeof guard == 'number' ? 2 : args.length;\n" +
+ 'while (++argsIndex < argsLength) {\n' +
+ ' iterable = args[argsIndex];\n' +
+ ' if (iterable && objectTypes[typeof iterable]) {',
+ 'keys': keys,
+ 'loop': "if (typeof result[index] == 'undefined') result[index] = iterable[index]",
+ 'bottom': ' }\n}'
+ };
+
+ /** Reusable iterator options for `forIn` and `forOwn` */
+ var forOwnIteratorOptions = {
+ 'top': 'if (!objectTypes[typeof iterable]) return result;\n' + eachIteratorOptions.top,
+ 'array': false
+ };
+
+ /**
+ * Used to convert characters to HTML entities:
+ *
+ * Though the `>` character is escaped for symmetry, characters like `>` and `/`
+ * don't require escaping in HTML and have no special meaning unless they're part
+ * of a tag or an unquoted attribute value.
+ * http://mathiasbynens.be/notes/ambiguous-ampersands (under "semi-related fun fact")
+ */
+ var htmlEscapes = {
+ '&': '&',
+ '<': '<',
+ '>': '>',
+ '"': '"',
+ "'": '''
+ };
+
+ /** Used to convert HTML entities to characters */
+ var htmlUnescapes = invert(htmlEscapes);
+
+ /** Used to match HTML entities and HTML characters */
+ var reEscapedHtml = RegExp('(' + keys(htmlUnescapes).join('|') + ')', 'g'),
+ reUnescapedHtml = RegExp('[' + keys(htmlEscapes).join('') + ']', 'g');
+
+ /**
+ * A function compiled to iterate `arguments` objects, arrays, objects, and
+ * strings consistenly across environments, executing the callback for each
+ * element in the collection. The callback is bound to `thisArg` and invoked
+ * with three arguments; (value, index|key, collection). Callbacks may exit
+ * iteration early by explicitly returning `false`.
+ *
+ * @private
+ * @type Function
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function} [callback=identity] The function called per iteration.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Array|Object|string} Returns `collection`.
+ */
+ var baseEach = createIterator(eachIteratorOptions);
+
+ /*--------------------------------------------------------------------------*/
+
+ /**
+ * Assigns own enumerable properties of source object(s) to the destination
+ * object. Subsequent sources will overwrite property assignments of previous
+ * sources. If a callback is provided it will be executed to produce the
+ * assigned values. The callback is bound to `thisArg` and invoked with two
+ * arguments; (objectValue, sourceValue).
+ *
+ * @static
+ * @memberOf _
+ * @type Function
+ * @alias extend
+ * @category Objects
+ * @param {Object} object The destination object.
+ * @param {...Object} [source] The source objects.
+ * @param {Function} [callback] The function to customize assigning values.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Object} Returns the destination object.
+ * @example
+ *
+ * _.assign({ 'name': 'fred' }, { 'employer': 'slate' });
+ * // => { 'name': 'fred', 'employer': 'slate' }
+ *
+ * var defaults = _.partialRight(_.assign, function(a, b) {
+ * return typeof a == 'undefined' ? b : a;
+ * });
+ *
+ * var object = { 'name': 'barney' };
+ * defaults(object, { 'name': 'fred', 'employer': 'slate' });
+ * // => { 'name': 'barney', 'employer': 'slate' }
+ */
+ var assign = createIterator(defaultsIteratorOptions, {
+ 'top':
+ defaultsIteratorOptions.top.replace(';',
+ ';\n' +
+ "if (argsLength > 3 && typeof args[argsLength - 2] == 'function') {\n" +
+ ' var callback = baseCreateCallback(args[--argsLength - 1], args[argsLength--], 2);\n' +
+ "} else if (argsLength > 2 && typeof args[argsLength - 1] == 'function') {\n" +
+ ' callback = args[--argsLength];\n' +
+ '}'
+ ),
+ 'loop': 'result[index] = callback ? callback(result[index], iterable[index]) : iterable[index]'
+ });
+
+ /**
+ * Creates a clone of `value`. If `isDeep` is `true` nested objects will also
+ * be cloned, otherwise they will be assigned by reference. If a callback
+ * is provided it will be executed to produce the cloned values. If the
+ * callback returns `undefined` cloning will be handled by the method instead.
+ * The callback is bound to `thisArg` and invoked with one argument; (value).
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} value The value to clone.
+ * @param {boolean} [isDeep=false] Specify a deep clone.
+ * @param {Function} [callback] The function to customize cloning values.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {*} Returns the cloned value.
+ * @example
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 36 },
+ * { 'name': 'fred', 'age': 40 }
+ * ];
+ *
+ * var shallow = _.clone(characters);
+ * shallow[0] === characters[0];
+ * // => true
+ *
+ * var deep = _.clone(characters, true);
+ * deep[0] === characters[0];
+ * // => false
+ *
+ * _.mixin({
+ * 'clone': _.partialRight(_.clone, function(value) {
+ * return _.isElement(value) ? value.cloneNode(false) : undefined;
+ * })
+ * });
+ *
+ * var clone = _.clone(document.body);
+ * clone.childNodes.length;
+ * // => 0
+ */
+ function clone(value, isDeep, callback, thisArg) {
+ // allows working with "Collections" methods without using their `index`
+ // and `collection` arguments for `isDeep` and `callback`
+ if (typeof isDeep != 'boolean' && isDeep != null) {
+ thisArg = callback;
+ callback = isDeep;
+ isDeep = false;
+ }
+ return baseClone(value, isDeep, typeof callback == 'function' && baseCreateCallback(callback, thisArg, 1));
+ }
+
+ /**
+ * Creates a deep clone of `value`. If a callback is provided it will be
+ * executed to produce the cloned values. If the callback returns `undefined`
+ * cloning will be handled by the method instead. The callback is bound to
+ * `thisArg` and invoked with one argument; (value).
+ *
+ * Note: This method is loosely based on the structured clone algorithm. Functions
+ * and DOM nodes are **not** cloned. The enumerable properties of `arguments` objects and
+ * objects created by constructors other than `Object` are cloned to plain `Object` objects.
+ * See http://www.w3.org/TR/html5/infrastructure.html#internal-structured-cloning-algorithm.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} value The value to deep clone.
+ * @param {Function} [callback] The function to customize cloning values.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {*} Returns the deep cloned value.
+ * @example
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 36 },
+ * { 'name': 'fred', 'age': 40 }
+ * ];
+ *
+ * var deep = _.cloneDeep(characters);
+ * deep[0] === characters[0];
+ * // => false
+ *
+ * var view = {
+ * 'label': 'docs',
+ * 'node': element
+ * };
+ *
+ * var clone = _.cloneDeep(view, function(value) {
+ * return _.isElement(value) ? value.cloneNode(true) : undefined;
+ * });
+ *
+ * clone.node == view.node;
+ * // => false
+ */
+ function cloneDeep(value, callback, thisArg) {
+ return baseClone(value, true, typeof callback == 'function' && baseCreateCallback(callback, thisArg, 1));
+ }
+
+ /**
+ * Creates an object that inherits from the given `prototype` object. If a
+ * `properties` object is provided its own enumerable properties are assigned
+ * to the created object.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {Object} prototype The object to inherit from.
+ * @param {Object} [properties] The properties to assign to the object.
+ * @returns {Object} Returns the new object.
+ * @example
+ *
+ * function Shape() {
+ * this.x = 0;
+ * this.y = 0;
+ * }
+ *
+ * function Circle() {
+ * Shape.call(this);
+ * }
+ *
+ * Circle.prototype = _.create(Shape.prototype, { 'constructor': Circle });
+ *
+ * var circle = new Circle;
+ * circle instanceof Circle;
+ * // => true
+ *
+ * circle instanceof Shape;
+ * // => true
+ */
+ function create(prototype, properties) {
+ var result = baseCreate(prototype);
+ return properties ? assign(result, properties) : result;
+ }
+
+ /**
+ * Assigns own enumerable properties of source object(s) to the destination
+ * object for all destination properties that resolve to `undefined`. Once a
+ * property is set, additional defaults of the same property will be ignored.
+ *
+ * @static
+ * @memberOf _
+ * @type Function
+ * @category Objects
+ * @param {Object} object The destination object.
+ * @param {...Object} [source] The source objects.
+ * @param- {Object} [guard] Allows working with `_.reduce` without using its
+ * `key` and `object` arguments as sources.
+ * @returns {Object} Returns the destination object.
+ * @example
+ *
+ * var object = { 'name': 'barney' };
+ * _.defaults(object, { 'name': 'fred', 'employer': 'slate' });
+ * // => { 'name': 'barney', 'employer': 'slate' }
+ */
+ var defaults = createIterator(defaultsIteratorOptions);
+
+ /**
+ * This method is like `_.findIndex` except that it returns the key of the
+ * first element that passes the callback check, instead of the element itself.
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {Object} object The object to search.
+ * @param {Function|Object|string} [callback=identity] The function called per
+ * iteration. If a property name or object is provided it will be used to
+ * create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {string|undefined} Returns the key of the found element, else `undefined`.
+ * @example
+ *
+ * var characters = {
+ * 'barney': { 'age': 36, 'blocked': false },
+ * 'fred': { 'age': 40, 'blocked': true },
+ * 'pebbles': { 'age': 1, 'blocked': false }
+ * };
+ *
+ * _.findKey(characters, function(chr) {
+ * return chr.age < 40;
+ * });
+ * // => 'barney' (property order is not guaranteed across environments)
+ *
+ * // using "_.where" callback shorthand
+ * _.findKey(characters, { 'age': 1 });
+ * // => 'pebbles'
+ *
+ * // using "_.pluck" callback shorthand
+ * _.findKey(characters, 'blocked');
+ * // => 'fred'
+ */
+ function findKey(object, callback, thisArg) {
+ var result;
+ callback = lodash.createCallback(callback, thisArg, 3);
+ forOwn(object, function(value, key, object) {
+ if (callback(value, key, object)) {
+ result = key;
+ return false;
+ }
+ });
+ return result;
+ }
+
+ /**
+ * This method is like `_.findKey` except that it iterates over elements
+ * of a `collection` in the opposite order.
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {Object} object The object to search.
+ * @param {Function|Object|string} [callback=identity] The function called per
+ * iteration. If a property name or object is provided it will be used to
+ * create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {string|undefined} Returns the key of the found element, else `undefined`.
+ * @example
+ *
+ * var characters = {
+ * 'barney': { 'age': 36, 'blocked': true },
+ * 'fred': { 'age': 40, 'blocked': false },
+ * 'pebbles': { 'age': 1, 'blocked': true }
+ * };
+ *
+ * _.findLastKey(characters, function(chr) {
+ * return chr.age < 40;
+ * });
+ * // => returns `pebbles`, assuming `_.findKey` returns `barney`
+ *
+ * // using "_.where" callback shorthand
+ * _.findLastKey(characters, { 'age': 40 });
+ * // => 'fred'
+ *
+ * // using "_.pluck" callback shorthand
+ * _.findLastKey(characters, 'blocked');
+ * // => 'pebbles'
+ */
+ function findLastKey(object, callback, thisArg) {
+ var result;
+ callback = lodash.createCallback(callback, thisArg, 3);
+ forOwnRight(object, function(value, key, object) {
+ if (callback(value, key, object)) {
+ result = key;
+ return false;
+ }
+ });
+ return result;
+ }
+
+ /**
+ * Iterates over own and inherited enumerable properties of an object,
+ * executing the callback for each property. The callback is bound to `thisArg`
+ * and invoked with three arguments; (value, key, object). Callbacks may exit
+ * iteration early by explicitly returning `false`.
+ *
+ * @static
+ * @memberOf _
+ * @type Function
+ * @category Objects
+ * @param {Object} object The object to iterate over.
+ * @param {Function} [callback=identity] The function called per iteration.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Object} Returns `object`.
+ * @example
+ *
+ * function Shape() {
+ * this.x = 0;
+ * this.y = 0;
+ * }
+ *
+ * Shape.prototype.move = function(x, y) {
+ * this.x += x;
+ * this.y += y;
+ * };
+ *
+ * _.forIn(new Shape, function(value, key) {
+ * console.log(key);
+ * });
+ * // => logs 'x', 'y', and 'move' (property order is not guaranteed across environments)
+ */
+ var forIn = createIterator(eachIteratorOptions, forOwnIteratorOptions, {
+ 'useHas': false
+ });
+
+ /**
+ * This method is like `_.forIn` except that it iterates over elements
+ * of a `collection` in the opposite order.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {Object} object The object to iterate over.
+ * @param {Function} [callback=identity] The function called per iteration.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Object} Returns `object`.
+ * @example
+ *
+ * function Shape() {
+ * this.x = 0;
+ * this.y = 0;
+ * }
+ *
+ * Shape.prototype.move = function(x, y) {
+ * this.x += x;
+ * this.y += y;
+ * };
+ *
+ * _.forInRight(new Shape, function(value, key) {
+ * console.log(key);
+ * });
+ * // => logs 'move', 'y', and 'x' assuming `_.forIn ` logs 'x', 'y', and 'move'
+ */
+ function forInRight(object, callback, thisArg) {
+ var pairs = [];
+
+ forIn(object, function(value, key) {
+ pairs.push(key, value);
+ });
+
+ var length = pairs.length;
+ callback = baseCreateCallback(callback, thisArg, 3);
+ while (length--) {
+ if (callback(pairs[length--], pairs[length], object) === false) {
+ break;
+ }
+ }
+ return object;
+ }
+
+ /**
+ * Iterates over own enumerable properties of an object, executing the callback
+ * for each property. The callback is bound to `thisArg` and invoked with three
+ * arguments; (value, key, object). Callbacks may exit iteration early by
+ * explicitly returning `false`.
+ *
+ * @static
+ * @memberOf _
+ * @type Function
+ * @category Objects
+ * @param {Object} object The object to iterate over.
+ * @param {Function} [callback=identity] The function called per iteration.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Object} Returns `object`.
+ * @example
+ *
+ * _.forOwn({ '0': 'zero', '1': 'one', 'length': 2 }, function(num, key) {
+ * console.log(key);
+ * });
+ * // => logs '0', '1', and 'length' (property order is not guaranteed across environments)
+ */
+ var forOwn = createIterator(eachIteratorOptions, forOwnIteratorOptions);
+
+ /**
+ * This method is like `_.forOwn` except that it iterates over elements
+ * of a `collection` in the opposite order.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {Object} object The object to iterate over.
+ * @param {Function} [callback=identity] The function called per iteration.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Object} Returns `object`.
+ * @example
+ *
+ * _.forOwnRight({ '0': 'zero', '1': 'one', 'length': 2 }, function(num, key) {
+ * console.log(key);
+ * });
+ * // => logs 'length', '1', and '0' assuming `_.forOwn` logs '0', '1', and 'length'
+ */
+ function forOwnRight(object, callback, thisArg) {
+ var props = keys(object),
+ length = props.length;
+
+ callback = baseCreateCallback(callback, thisArg, 3);
+ while (length--) {
+ var key = props[length];
+ if (callback(object[key], key, object) === false) {
+ break;
+ }
+ }
+ return object;
+ }
+
+ /**
+ * Creates a sorted array of property names of all enumerable properties,
+ * own and inherited, of `object` that have function values.
+ *
+ * @static
+ * @memberOf _
+ * @alias methods
+ * @category Objects
+ * @param {Object} object The object to inspect.
+ * @returns {Array} Returns an array of property names that have function values.
+ * @example
+ *
+ * _.functions(_);
+ * // => ['all', 'any', 'bind', 'bindAll', 'clone', 'compact', 'compose', ...]
+ */
+ function functions(object) {
+ var result = [];
+ forIn(object, function(value, key) {
+ if (isFunction(value)) {
+ result.push(key);
+ }
+ });
+ return result.sort();
+ }
+
+ /**
+ * Checks if the specified property name exists as a direct property of `object`,
+ * instead of an inherited property.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {Object} object The object to inspect.
+ * @param {string} key The name of the property to check.
+ * @returns {boolean} Returns `true` if key is a direct property, else `false`.
+ * @example
+ *
+ * _.has({ 'a': 1, 'b': 2, 'c': 3 }, 'b');
+ * // => true
+ */
+ function has(object, key) {
+ return object ? hasOwnProperty.call(object, key) : false;
+ }
+
+ /**
+ * Creates an object composed of the inverted keys and values of the given object.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {Object} object The object to invert.
+ * @returns {Object} Returns the created inverted object.
+ * @example
+ *
+ * _.invert({ 'first': 'fred', 'second': 'barney' });
+ * // => { 'fred': 'first', 'barney': 'second' }
+ */
+ function invert(object) {
+ var index = -1,
+ props = keys(object),
+ length = props.length,
+ result = {};
+
+ while (++index < length) {
+ var key = props[index];
+ result[object[key]] = key;
+ }
+ return result;
+ }
+
+ /**
+ * Checks if `value` is a boolean value.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if the `value` is a boolean value, else `false`.
+ * @example
+ *
+ * _.isBoolean(null);
+ * // => false
+ */
+ function isBoolean(value) {
+ return value === true || value === false ||
+ value && typeof value == 'object' && toString.call(value) == boolClass || false;
+ }
+
+ /**
+ * Checks if `value` is a date.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if the `value` is a date, else `false`.
+ * @example
+ *
+ * _.isDate(new Date);
+ * // => true
+ */
+ function isDate(value) {
+ return value && typeof value == 'object' && toString.call(value) == dateClass || false;
+ }
+
+ /**
+ * Checks if `value` is a DOM element.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if the `value` is a DOM element, else `false`.
+ * @example
+ *
+ * _.isElement(document.body);
+ * // => true
+ */
+ function isElement(value) {
+ return value && value.nodeType === 1 || false;
+ }
+
+ /**
+ * Checks if `value` is empty. Arrays, strings, or `arguments` objects with a
+ * length of `0` and objects with no own enumerable properties are considered
+ * "empty".
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {Array|Object|string} value The value to inspect.
+ * @returns {boolean} Returns `true` if the `value` is empty, else `false`.
+ * @example
+ *
+ * _.isEmpty([1, 2, 3]);
+ * // => false
+ *
+ * _.isEmpty({});
+ * // => true
+ *
+ * _.isEmpty('');
+ * // => true
+ */
+ function isEmpty(value) {
+ var result = true;
+ if (!value) {
+ return result;
+ }
+ var className = toString.call(value),
+ length = value.length;
+
+ if ((className == arrayClass || className == stringClass ||
+ (support.argsClass ? className == argsClass : isArguments(value))) ||
+ (className == objectClass && typeof length == 'number' && isFunction(value.splice))) {
+ return !length;
+ }
+ forOwn(value, function() {
+ return (result = false);
+ });
+ return result;
+ }
+
+ /**
+ * Performs a deep comparison between two values to determine if they are
+ * equivalent to each other. If a callback is provided it will be executed
+ * to compare values. If the callback returns `undefined` comparisons will
+ * be handled by the method instead. The callback is bound to `thisArg` and
+ * invoked with two arguments; (a, b).
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} a The value to compare.
+ * @param {*} b The other value to compare.
+ * @param {Function} [callback] The function to customize comparing values.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
+ * @example
+ *
+ * var object = { 'name': 'fred' };
+ * var copy = { 'name': 'fred' };
+ *
+ * object == copy;
+ * // => false
+ *
+ * _.isEqual(object, copy);
+ * // => true
+ *
+ * var words = ['hello', 'goodbye'];
+ * var otherWords = ['hi', 'goodbye'];
+ *
+ * _.isEqual(words, otherWords, function(a, b) {
+ * var reGreet = /^(?:hello|hi)$/i,
+ * aGreet = _.isString(a) && reGreet.test(a),
+ * bGreet = _.isString(b) && reGreet.test(b);
+ *
+ * return (aGreet || bGreet) ? (aGreet == bGreet) : undefined;
+ * });
+ * // => true
+ */
+ function isEqual(a, b, callback, thisArg) {
+ return baseIsEqual(a, b, typeof callback == 'function' && baseCreateCallback(callback, thisArg, 2));
+ }
+
+ /**
+ * Checks if `value` is, or can be coerced to, a finite number.
+ *
+ * Note: This is not the same as native `isFinite` which will return true for
+ * booleans and empty strings. See http://es5.github.io/#x15.1.2.5.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if the `value` is finite, else `false`.
+ * @example
+ *
+ * _.isFinite(-101);
+ * // => true
+ *
+ * _.isFinite('10');
+ * // => true
+ *
+ * _.isFinite(true);
+ * // => false
+ *
+ * _.isFinite('');
+ * // => false
+ *
+ * _.isFinite(Infinity);
+ * // => false
+ */
+ function isFinite(value) {
+ return nativeIsFinite(value) && !nativeIsNaN(parseFloat(value));
+ }
+
+ /**
+ * Checks if `value` is a function.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if the `value` is a function, else `false`.
+ * @example
+ *
+ * _.isFunction(_);
+ * // => true
+ */
+ function isFunction(value) {
+ return typeof value == 'function';
+ }
+ // fallback for older versions of Chrome and Safari
+ if (isFunction(/x/)) {
+ isFunction = function(value) {
+ return typeof value == 'function' && toString.call(value) == funcClass;
+ };
+ }
+
+ /**
+ * Checks if `value` is the language type of Object.
+ * (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if the `value` is an object, else `false`.
+ * @example
+ *
+ * _.isObject({});
+ * // => true
+ *
+ * _.isObject([1, 2, 3]);
+ * // => true
+ *
+ * _.isObject(1);
+ * // => false
+ */
+ function isObject(value) {
+ // check if the value is the ECMAScript language type of Object
+ // http://es5.github.io/#x8
+ // and avoid a V8 bug
+ // http://code.google.com/p/v8/issues/detail?id=2291
+ return !!(value && objectTypes[typeof value]);
+ }
+
+ /**
+ * Checks if `value` is `NaN`.
+ *
+ * Note: This is not the same as native `isNaN` which will return `true` for
+ * `undefined` and other non-numeric values. See http://es5.github.io/#x15.1.2.4.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if the `value` is `NaN`, else `false`.
+ * @example
+ *
+ * _.isNaN(NaN);
+ * // => true
+ *
+ * _.isNaN(new Number(NaN));
+ * // => true
+ *
+ * isNaN(undefined);
+ * // => true
+ *
+ * _.isNaN(undefined);
+ * // => false
+ */
+ function isNaN(value) {
+ // `NaN` as a primitive is the only value that is not equal to itself
+ // (perform the [[Class]] check first to avoid errors with some host objects in IE)
+ return isNumber(value) && value != +value;
+ }
+
+ /**
+ * Checks if `value` is `null`.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if the `value` is `null`, else `false`.
+ * @example
+ *
+ * _.isNull(null);
+ * // => true
+ *
+ * _.isNull(undefined);
+ * // => false
+ */
+ function isNull(value) {
+ return value === null;
+ }
+
+ /**
+ * Checks if `value` is a number.
+ *
+ * Note: `NaN` is considered a number. See http://es5.github.io/#x8.5.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if the `value` is a number, else `false`.
+ * @example
+ *
+ * _.isNumber(8.4 * 5);
+ * // => true
+ */
+ function isNumber(value) {
+ return typeof value == 'number' ||
+ value && typeof value == 'object' && toString.call(value) == numberClass || false;
+ }
+
+ /**
+ * Checks if `value` is an object created by the `Object` constructor.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.
+ * @example
+ *
+ * function Shape() {
+ * this.x = 0;
+ * this.y = 0;
+ * }
+ *
+ * _.isPlainObject(new Shape);
+ * // => false
+ *
+ * _.isPlainObject([1, 2, 3]);
+ * // => false
+ *
+ * _.isPlainObject({ 'x': 0, 'y': 0 });
+ * // => true
+ */
+ var isPlainObject = !getPrototypeOf ? shimIsPlainObject : function(value) {
+ if (!(value && toString.call(value) == objectClass) || (!support.argsClass && isArguments(value))) {
+ return false;
+ }
+ var valueOf = value.valueOf,
+ objProto = isNative(valueOf) && (objProto = getPrototypeOf(valueOf)) && getPrototypeOf(objProto);
+
+ return objProto
+ ? (value == objProto || getPrototypeOf(value) == objProto)
+ : shimIsPlainObject(value);
+ };
+
+ /**
+ * Checks if `value` is a regular expression.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if the `value` is a regular expression, else `false`.
+ * @example
+ *
+ * _.isRegExp(/fred/);
+ * // => true
+ */
+ function isRegExp(value) {
+ return value && objectTypes[typeof value] && toString.call(value) == regexpClass || false;
+ }
+
+ /**
+ * Checks if `value` is a string.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if the `value` is a string, else `false`.
+ * @example
+ *
+ * _.isString('fred');
+ * // => true
+ */
+ function isString(value) {
+ return typeof value == 'string' ||
+ value && typeof value == 'object' && toString.call(value) == stringClass || false;
+ }
+
+ /**
+ * Checks if `value` is `undefined`.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if the `value` is `undefined`, else `false`.
+ * @example
+ *
+ * _.isUndefined(void 0);
+ * // => true
+ */
+ function isUndefined(value) {
+ return typeof value == 'undefined';
+ }
+
+ /**
+ * Creates an object with the same keys as `object` and values generated by
+ * running each own enumerable property of `object` through the callback.
+ * The callback is bound to `thisArg` and invoked with three arguments;
+ * (value, key, object).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {Object} object The object to iterate over.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Array} Returns a new object with values of the results of each `callback` execution.
+ * @example
+ *
+ * _.mapValues({ 'a': 1, 'b': 2, 'c': 3} , function(num) { return num * 3; });
+ * // => { 'a': 3, 'b': 6, 'c': 9 }
+ *
+ * var characters = {
+ * 'fred': { 'name': 'fred', 'age': 40 },
+ * 'pebbles': { 'name': 'pebbles', 'age': 1 }
+ * };
+ *
+ * // using "_.pluck" callback shorthand
+ * _.mapValues(characters, 'age');
+ * // => { 'fred': 40, 'pebbles': 1 }
+ */
+ function mapValues(object, callback, thisArg) {
+ var result = {};
+ callback = lodash.createCallback(callback, thisArg, 3);
+
+ forOwn(object, function(value, key, object) {
+ result[key] = callback(value, key, object);
+ });
+ return result;
+ }
+
+ /**
+ * Recursively merges own enumerable properties of the source object(s), that
+ * don't resolve to `undefined` into the destination object. Subsequent sources
+ * will overwrite property assignments of previous sources. If a callback is
+ * provided it will be executed to produce the merged values of the destination
+ * and source properties. If the callback returns `undefined` merging will
+ * be handled by the method instead. The callback is bound to `thisArg` and
+ * invoked with two arguments; (objectValue, sourceValue).
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {Object} object The destination object.
+ * @param {...Object} [source] The source objects.
+ * @param {Function} [callback] The function to customize merging properties.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Object} Returns the destination object.
+ * @example
+ *
+ * var names = {
+ * 'characters': [
+ * { 'name': 'barney' },
+ * { 'name': 'fred' }
+ * ]
+ * };
+ *
+ * var ages = {
+ * 'characters': [
+ * { 'age': 36 },
+ * { 'age': 40 }
+ * ]
+ * };
+ *
+ * _.merge(names, ages);
+ * // => { 'characters': [{ 'name': 'barney', 'age': 36 }, { 'name': 'fred', 'age': 40 }] }
+ *
+ * var food = {
+ * 'fruits': ['apple'],
+ * 'vegetables': ['beet']
+ * };
+ *
+ * var otherFood = {
+ * 'fruits': ['banana'],
+ * 'vegetables': ['carrot']
+ * };
+ *
+ * _.merge(food, otherFood, function(a, b) {
+ * return _.isArray(a) ? a.concat(b) : undefined;
+ * });
+ * // => { 'fruits': ['apple', 'banana'], 'vegetables': ['beet', 'carrot] }
+ */
+ function merge(object) {
+ var args = arguments,
+ length = 2;
+
+ if (!isObject(object)) {
+ return object;
+ }
+ // allows working with `_.reduce` and `_.reduceRight` without using
+ // their `index` and `collection` arguments
+ if (typeof args[2] != 'number') {
+ length = args.length;
+ }
+ if (length > 3 && typeof args[length - 2] == 'function') {
+ var callback = baseCreateCallback(args[--length - 1], args[length--], 2);
+ } else if (length > 2 && typeof args[length - 1] == 'function') {
+ callback = args[--length];
+ }
+ var sources = slice(arguments, 1, length),
+ index = -1,
+ stackA = getArray(),
+ stackB = getArray();
+
+ while (++index < length) {
+ baseMerge(object, sources[index], callback, stackA, stackB);
+ }
+ releaseArray(stackA);
+ releaseArray(stackB);
+ return object;
+ }
+
+ /**
+ * Creates a shallow clone of `object` excluding the specified properties.
+ * Property names may be specified as individual arguments or as arrays of
+ * property names. If a callback is provided it will be executed for each
+ * property of `object` omitting the properties the callback returns truey
+ * for. The callback is bound to `thisArg` and invoked with three arguments;
+ * (value, key, object).
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {Object} object The source object.
+ * @param {Function|...string|string[]} [callback] The properties to omit or the
+ * function called per iteration.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Object} Returns an object without the omitted properties.
+ * @example
+ *
+ * _.omit({ 'name': 'fred', 'age': 40 }, 'age');
+ * // => { 'name': 'fred' }
+ *
+ * _.omit({ 'name': 'fred', 'age': 40 }, function(value) {
+ * return typeof value == 'number';
+ * });
+ * // => { 'name': 'fred' }
+ */
+ function omit(object, callback, thisArg) {
+ var result = {};
+ if (typeof callback != 'function') {
+ var props = [];
+ forIn(object, function(value, key) {
+ props.push(key);
+ });
+ props = baseDifference(props, baseFlatten(arguments, true, false, 1));
+
+ var index = -1,
+ length = props.length;
+
+ while (++index < length) {
+ var key = props[index];
+ result[key] = object[key];
+ }
+ } else {
+ callback = lodash.createCallback(callback, thisArg, 3);
+ forIn(object, function(value, key, object) {
+ if (!callback(value, key, object)) {
+ result[key] = value;
+ }
+ });
+ }
+ return result;
+ }
+
+ /**
+ * Creates a two dimensional array of an object's key-value pairs,
+ * i.e. `[[key1, value1], [key2, value2]]`.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {Object} object The object to inspect.
+ * @returns {Array} Returns new array of key-value pairs.
+ * @example
+ *
+ * _.pairs({ 'barney': 36, 'fred': 40 });
+ * // => [['barney', 36], ['fred', 40]] (property order is not guaranteed across environments)
+ */
+ function pairs(object) {
+ var index = -1,
+ props = keys(object),
+ length = props.length,
+ result = Array(length);
+
+ while (++index < length) {
+ var key = props[index];
+ result[index] = [key, object[key]];
+ }
+ return result;
+ }
+
+ /**
+ * Creates a shallow clone of `object` composed of the specified properties.
+ * Property names may be specified as individual arguments or as arrays of
+ * property names. If a callback is provided it will be executed for each
+ * property of `object` picking the properties the callback returns truey
+ * for. The callback is bound to `thisArg` and invoked with three arguments;
+ * (value, key, object).
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {Object} object The source object.
+ * @param {Function|...string|string[]} [callback] The function called per
+ * iteration or property names to pick, specified as individual property
+ * names or arrays of property names.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Object} Returns an object composed of the picked properties.
+ * @example
+ *
+ * _.pick({ 'name': 'fred', '_userid': 'fred1' }, 'name');
+ * // => { 'name': 'fred' }
+ *
+ * _.pick({ 'name': 'fred', '_userid': 'fred1' }, function(value, key) {
+ * return key.charAt(0) != '_';
+ * });
+ * // => { 'name': 'fred' }
+ */
+ function pick(object, callback, thisArg) {
+ var result = {};
+ if (typeof callback != 'function') {
+ var index = -1,
+ props = baseFlatten(arguments, true, false, 1),
+ length = isObject(object) ? props.length : 0;
+
+ while (++index < length) {
+ var key = props[index];
+ if (key in object) {
+ result[key] = object[key];
+ }
+ }
+ } else {
+ callback = lodash.createCallback(callback, thisArg, 3);
+ forIn(object, function(value, key, object) {
+ if (callback(value, key, object)) {
+ result[key] = value;
+ }
+ });
+ }
+ return result;
+ }
+
+ /**
+ * An alternative to `_.reduce` this method transforms `object` to a new
+ * `accumulator` object which is the result of running each of its own
+ * enumerable properties through a callback, with each callback execution
+ * potentially mutating the `accumulator` object. The callback is bound to
+ * `thisArg` and invoked with four arguments; (accumulator, value, key, object).
+ * Callbacks may exit iteration early by explicitly returning `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {Array|Object} object The object to iterate over.
+ * @param {Function} [callback=identity] The function called per iteration.
+ * @param {*} [accumulator] The custom accumulator value.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {*} Returns the accumulated value.
+ * @example
+ *
+ * var squares = _.transform([1, 2, 3, 4, 5, 6, 7, 8, 9, 10], function(result, num) {
+ * num *= num;
+ * if (num % 2) {
+ * return result.push(num) < 3;
+ * }
+ * });
+ * // => [1, 9, 25]
+ *
+ * var mapped = _.transform({ 'a': 1, 'b': 2, 'c': 3 }, function(result, num, key) {
+ * result[key] = num * 3;
+ * });
+ * // => { 'a': 3, 'b': 6, 'c': 9 }
+ */
+ function transform(object, callback, accumulator, thisArg) {
+ var isArr = isArray(object);
+ if (accumulator == null) {
+ if (isArr) {
+ accumulator = [];
+ } else {
+ var ctor = object && object.constructor,
+ proto = ctor && ctor.prototype;
+
+ accumulator = baseCreate(proto);
+ }
+ }
+ if (callback) {
+ callback = lodash.createCallback(callback, thisArg, 4);
+ (isArr ? baseEach : forOwn)(object, function(value, index, object) {
+ return callback(accumulator, value, index, object);
+ });
+ }
+ return accumulator;
+ }
+
+ /**
+ * Creates an array composed of the own enumerable property values of `object`.
+ *
+ * @static
+ * @memberOf _
+ * @category Objects
+ * @param {Object} object The object to inspect.
+ * @returns {Array} Returns an array of property values.
+ * @example
+ *
+ * _.values({ 'one': 1, 'two': 2, 'three': 3 });
+ * // => [1, 2, 3] (property order is not guaranteed across environments)
+ */
+ function values(object) {
+ var index = -1,
+ props = keys(object),
+ length = props.length,
+ result = Array(length);
+
+ while (++index < length) {
+ result[index] = object[props[index]];
+ }
+ return result;
+ }
+
+ /*--------------------------------------------------------------------------*/
+
+ /**
+ * Creates an array of elements from the specified indexes, or keys, of the
+ * `collection`. Indexes may be specified as individual arguments or as arrays
+ * of indexes.
+ *
+ * @static
+ * @memberOf _
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {...(number|number[]|string|string[])} [index] The indexes of `collection`
+ * to retrieve, specified as individual indexes or arrays of indexes.
+ * @returns {Array} Returns a new array of elements corresponding to the
+ * provided indexes.
+ * @example
+ *
+ * _.at(['a', 'b', 'c', 'd', 'e'], [0, 2, 4]);
+ * // => ['a', 'c', 'e']
+ *
+ * _.at(['fred', 'barney', 'pebbles'], 0, 2);
+ * // => ['fred', 'pebbles']
+ */
+ function at(collection) {
+ var args = arguments,
+ index = -1,
+ props = baseFlatten(args, true, false, 1),
+ length = (args[2] && args[2][args[1]] === collection) ? 1 : props.length,
+ result = Array(length);
+
+ if (support.unindexedChars && isString(collection)) {
+ collection = collection.split('');
+ }
+ while(++index < length) {
+ result[index] = collection[props[index]];
+ }
+ return result;
+ }
+
+ /**
+ * Checks if a given value is present in a collection using strict equality
+ * for comparisons, i.e. `===`. If `fromIndex` is negative, it is used as the
+ * offset from the end of the collection.
+ *
+ * @static
+ * @memberOf _
+ * @alias include
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {*} target The value to check for.
+ * @param {number} [fromIndex=0] The index to search from.
+ * @returns {boolean} Returns `true` if the `target` element is found, else `false`.
+ * @example
+ *
+ * _.contains([1, 2, 3], 1);
+ * // => true
+ *
+ * _.contains([1, 2, 3], 1, 2);
+ * // => false
+ *
+ * _.contains({ 'name': 'fred', 'age': 40 }, 'fred');
+ * // => true
+ *
+ * _.contains('pebbles', 'eb');
+ * // => true
+ */
+ function contains(collection, target, fromIndex) {
+ var index = -1,
+ indexOf = getIndexOf(),
+ length = collection ? collection.length : 0,
+ result = false;
+
+ fromIndex = (fromIndex < 0 ? nativeMax(0, length + fromIndex) : fromIndex) || 0;
+ if (isArray(collection)) {
+ result = indexOf(collection, target, fromIndex) > -1;
+ } else if (typeof length == 'number') {
+ result = (isString(collection) ? collection.indexOf(target, fromIndex) : indexOf(collection, target, fromIndex)) > -1;
+ } else {
+ baseEach(collection, function(value) {
+ if (++index >= fromIndex) {
+ return !(result = value === target);
+ }
+ });
+ }
+ return result;
+ }
+
+ /**
+ * Creates an object composed of keys generated from the results of running
+ * each element of `collection` through the callback. The corresponding value
+ * of each key is the number of times the key was returned by the callback.
+ * The callback is bound to `thisArg` and invoked with three arguments;
+ * (value, index|key, collection).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Object} Returns the composed aggregate object.
+ * @example
+ *
+ * _.countBy([4.3, 6.1, 6.4], function(num) { return Math.floor(num); });
+ * // => { '4': 1, '6': 2 }
+ *
+ * _.countBy([4.3, 6.1, 6.4], function(num) { return this.floor(num); }, Math);
+ * // => { '4': 1, '6': 2 }
+ *
+ * _.countBy(['one', 'two', 'three'], 'length');
+ * // => { '3': 2, '5': 1 }
+ */
+ var countBy = createAggregator(function(result, value, key) {
+ (hasOwnProperty.call(result, key) ? result[key]++ : result[key] = 1);
+ });
+
+ /**
+ * Checks if the given callback returns truey value for **all** elements of
+ * a collection. The callback is bound to `thisArg` and invoked with three
+ * arguments; (value, index|key, collection).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @alias all
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {boolean} Returns `true` if all elements passed the callback check,
+ * else `false`.
+ * @example
+ *
+ * _.every([true, 1, null, 'yes']);
+ * // => false
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 36 },
+ * { 'name': 'fred', 'age': 40 }
+ * ];
+ *
+ * // using "_.pluck" callback shorthand
+ * _.every(characters, 'age');
+ * // => true
+ *
+ * // using "_.where" callback shorthand
+ * _.every(characters, { 'age': 36 });
+ * // => false
+ */
+ function every(collection, callback, thisArg) {
+ var result = true;
+ callback = lodash.createCallback(callback, thisArg, 3);
+
+ if (isArray(collection)) {
+ var index = -1,
+ length = collection.length;
+
+ while (++index < length) {
+ if (!(result = !!callback(collection[index], index, collection))) {
+ break;
+ }
+ }
+ } else {
+ baseEach(collection, function(value, index, collection) {
+ return (result = !!callback(value, index, collection));
+ });
+ }
+ return result;
+ }
+
+ /**
+ * Iterates over elements of a collection, returning an array of all elements
+ * the callback returns truey for. The callback is bound to `thisArg` and
+ * invoked with three arguments; (value, index|key, collection).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @alias select
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Array} Returns a new array of elements that passed the callback check.
+ * @example
+ *
+ * var evens = _.filter([1, 2, 3, 4, 5, 6], function(num) { return num % 2 == 0; });
+ * // => [2, 4, 6]
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 36, 'blocked': false },
+ * { 'name': 'fred', 'age': 40, 'blocked': true }
+ * ];
+ *
+ * // using "_.pluck" callback shorthand
+ * _.filter(characters, 'blocked');
+ * // => [{ 'name': 'fred', 'age': 40, 'blocked': true }]
+ *
+ * // using "_.where" callback shorthand
+ * _.filter(characters, { 'age': 36 });
+ * // => [{ 'name': 'barney', 'age': 36, 'blocked': false }]
+ */
+ function filter(collection, callback, thisArg) {
+ var result = [];
+ callback = lodash.createCallback(callback, thisArg, 3);
+
+ if (isArray(collection)) {
+ var index = -1,
+ length = collection.length;
+
+ while (++index < length) {
+ var value = collection[index];
+ if (callback(value, index, collection)) {
+ result.push(value);
+ }
+ }
+ } else {
+ baseEach(collection, function(value, index, collection) {
+ if (callback(value, index, collection)) {
+ result.push(value);
+ }
+ });
+ }
+ return result;
+ }
+
+ /**
+ * Iterates over elements of a collection, returning the first element that
+ * the callback returns truey for. The callback is bound to `thisArg` and
+ * invoked with three arguments; (value, index|key, collection).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @alias detect, findWhere
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {*} Returns the found element, else `undefined`.
+ * @example
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 36, 'blocked': false },
+ * { 'name': 'fred', 'age': 40, 'blocked': true },
+ * { 'name': 'pebbles', 'age': 1, 'blocked': false }
+ * ];
+ *
+ * _.find(characters, function(chr) {
+ * return chr.age < 40;
+ * });
+ * // => { 'name': 'barney', 'age': 36, 'blocked': false }
+ *
+ * // using "_.where" callback shorthand
+ * _.find(characters, { 'age': 1 });
+ * // => { 'name': 'pebbles', 'age': 1, 'blocked': false }
+ *
+ * // using "_.pluck" callback shorthand
+ * _.find(characters, 'blocked');
+ * // => { 'name': 'fred', 'age': 40, 'blocked': true }
+ */
+ function find(collection, callback, thisArg) {
+ callback = lodash.createCallback(callback, thisArg, 3);
+
+ if (isArray(collection)) {
+ var index = -1,
+ length = collection.length;
+
+ while (++index < length) {
+ var value = collection[index];
+ if (callback(value, index, collection)) {
+ return value;
+ }
+ }
+ } else {
+ var result;
+ baseEach(collection, function(value, index, collection) {
+ if (callback(value, index, collection)) {
+ result = value;
+ return false;
+ }
+ });
+ return result;
+ }
+ }
+
+ /**
+ * This method is like `_.find` except that it iterates over elements
+ * of a `collection` from right to left.
+ *
+ * @static
+ * @memberOf _
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {*} Returns the found element, else `undefined`.
+ * @example
+ *
+ * _.findLast([1, 2, 3, 4], function(num) {
+ * return num % 2 == 1;
+ * });
+ * // => 3
+ */
+ function findLast(collection, callback, thisArg) {
+ var result;
+ callback = lodash.createCallback(callback, thisArg, 3);
+ forEachRight(collection, function(value, index, collection) {
+ if (callback(value, index, collection)) {
+ result = value;
+ return false;
+ }
+ });
+ return result;
+ }
+
+ /**
+ * Iterates over elements of a collection, executing the callback for each
+ * element. The callback is bound to `thisArg` and invoked with three arguments;
+ * (value, index|key, collection). Callbacks may exit iteration early by
+ * explicitly returning `false`.
+ *
+ * Note: As with other "Collections" methods, objects with a `length` property
+ * are iterated like arrays. To avoid this behavior `_.forIn` or `_.forOwn`
+ * may be used for object iteration.
+ *
+ * @static
+ * @memberOf _
+ * @alias each
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function} [callback=identity] The function called per iteration.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Array|Object|string} Returns `collection`.
+ * @example
+ *
+ * _([1, 2, 3]).forEach(function(num) { console.log(num); }).join(',');
+ * // => logs each number and returns '1,2,3'
+ *
+ * _.forEach({ 'one': 1, 'two': 2, 'three': 3 }, function(num) { console.log(num); });
+ * // => logs each number and returns the object (property order is not guaranteed across environments)
+ */
+ function forEach(collection, callback, thisArg) {
+ if (callback && typeof thisArg == 'undefined' && isArray(collection)) {
+ var index = -1,
+ length = collection.length;
+
+ while (++index < length) {
+ if (callback(collection[index], index, collection) === false) {
+ break;
+ }
+ }
+ } else {
+ baseEach(collection, callback, thisArg);
+ }
+ return collection;
+ }
+
+ /**
+ * This method is like `_.forEach` except that it iterates over elements
+ * of a `collection` from right to left.
+ *
+ * @static
+ * @memberOf _
+ * @alias eachRight
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function} [callback=identity] The function called per iteration.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Array|Object|string} Returns `collection`.
+ * @example
+ *
+ * _([1, 2, 3]).forEachRight(function(num) { console.log(num); }).join(',');
+ * // => logs each number from right to left and returns '3,2,1'
+ */
+ function forEachRight(collection, callback, thisArg) {
+ var iterable = collection,
+ length = collection ? collection.length : 0;
+
+ callback = callback && typeof thisArg == 'undefined' ? callback : baseCreateCallback(callback, thisArg, 3);
+ if (isArray(collection)) {
+ while (length--) {
+ if (callback(collection[length], length, collection) === false) {
+ break;
+ }
+ }
+ } else {
+ if (typeof length != 'number') {
+ var props = keys(collection);
+ length = props.length;
+ } else if (support.unindexedChars && isString(collection)) {
+ iterable = collection.split('');
+ }
+ baseEach(collection, function(value, key, collection) {
+ key = props ? props[--length] : --length;
+ return callback(iterable[key], key, collection);
+ });
+ }
+ return collection;
+ }
+
+ /**
+ * Creates an object composed of keys generated from the results of running
+ * each element of a collection through the callback. The corresponding value
+ * of each key is an array of the elements responsible for generating the key.
+ * The callback is bound to `thisArg` and invoked with three arguments;
+ * (value, index|key, collection).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`
+ *
+ * @static
+ * @memberOf _
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Object} Returns the composed aggregate object.
+ * @example
+ *
+ * _.groupBy([4.2, 6.1, 6.4], function(num) { return Math.floor(num); });
+ * // => { '4': [4.2], '6': [6.1, 6.4] }
+ *
+ * _.groupBy([4.2, 6.1, 6.4], function(num) { return this.floor(num); }, Math);
+ * // => { '4': [4.2], '6': [6.1, 6.4] }
+ *
+ * // using "_.pluck" callback shorthand
+ * _.groupBy(['one', 'two', 'three'], 'length');
+ * // => { '3': ['one', 'two'], '5': ['three'] }
+ */
+ var groupBy = createAggregator(function(result, value, key) {
+ (hasOwnProperty.call(result, key) ? result[key] : result[key] = []).push(value);
+ });
+
+ /**
+ * Creates an object composed of keys generated from the results of running
+ * each element of the collection through the given callback. The corresponding
+ * value of each key is the last element responsible for generating the key.
+ * The callback is bound to `thisArg` and invoked with three arguments;
+ * (value, index|key, collection).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Object} Returns the composed aggregate object.
+ * @example
+ *
+ * var keys = [
+ * { 'dir': 'left', 'code': 97 },
+ * { 'dir': 'right', 'code': 100 }
+ * ];
+ *
+ * _.indexBy(keys, 'dir');
+ * // => { 'left': { 'dir': 'left', 'code': 97 }, 'right': { 'dir': 'right', 'code': 100 } }
+ *
+ * _.indexBy(keys, function(key) { return String.fromCharCode(key.code); });
+ * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } }
+ *
+ * _.indexBy(characters, function(key) { this.fromCharCode(key.code); }, String);
+ * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } }
+ */
+ var indexBy = createAggregator(function(result, value, key) {
+ result[key] = value;
+ });
+
+ /**
+ * Invokes the method named by `methodName` on each element in the `collection`
+ * returning an array of the results of each invoked method. Additional arguments
+ * will be provided to each invoked method. If `methodName` is a function it
+ * will be invoked for, and `this` bound to, each element in the `collection`.
+ *
+ * @static
+ * @memberOf _
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|string} methodName The name of the method to invoke or
+ * the function invoked per iteration.
+ * @param {...*} [arg] Arguments to invoke the method with.
+ * @returns {Array} Returns a new array of the results of each invoked method.
+ * @example
+ *
+ * _.invoke([[5, 1, 7], [3, 2, 1]], 'sort');
+ * // => [[1, 5, 7], [1, 2, 3]]
+ *
+ * _.invoke([123, 456], String.prototype.split, '');
+ * // => [['1', '2', '3'], ['4', '5', '6']]
+ */
+ function invoke(collection, methodName) {
+ var args = slice(arguments, 2),
+ index = -1,
+ isFunc = typeof methodName == 'function',
+ length = collection ? collection.length : 0,
+ result = Array(typeof length == 'number' ? length : 0);
+
+ forEach(collection, function(value) {
+ result[++index] = (isFunc ? methodName : value[methodName]).apply(value, args);
+ });
+ return result;
+ }
+
+ /**
+ * Creates an array of values by running each element in the collection
+ * through the callback. The callback is bound to `thisArg` and invoked with
+ * three arguments; (value, index|key, collection).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @alias collect
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Array} Returns a new array of the results of each `callback` execution.
+ * @example
+ *
+ * _.map([1, 2, 3], function(num) { return num * 3; });
+ * // => [3, 6, 9]
+ *
+ * _.map({ 'one': 1, 'two': 2, 'three': 3 }, function(num) { return num * 3; });
+ * // => [3, 6, 9] (property order is not guaranteed across environments)
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 36 },
+ * { 'name': 'fred', 'age': 40 }
+ * ];
+ *
+ * // using "_.pluck" callback shorthand
+ * _.map(characters, 'name');
+ * // => ['barney', 'fred']
+ */
+ function map(collection, callback, thisArg) {
+ var index = -1,
+ length = collection ? collection.length : 0,
+ result = Array(typeof length == 'number' ? length : 0);
+
+ callback = lodash.createCallback(callback, thisArg, 3);
+ if (isArray(collection)) {
+ while (++index < length) {
+ result[index] = callback(collection[index], index, collection);
+ }
+ } else {
+ baseEach(collection, function(value, key, collection) {
+ result[++index] = callback(value, key, collection);
+ });
+ }
+ return result;
+ }
+
+ /**
+ * Retrieves the maximum value of a collection. If the collection is empty or
+ * falsey `-Infinity` is returned. If a callback is provided it will be executed
+ * for each value in the collection to generate the criterion by which the value
+ * is ranked. The callback is bound to `thisArg` and invoked with three
+ * arguments; (value, index, collection).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {*} Returns the maximum value.
+ * @example
+ *
+ * _.max([4, 2, 8, 6]);
+ * // => 8
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 36 },
+ * { 'name': 'fred', 'age': 40 }
+ * ];
+ *
+ * _.max(characters, function(chr) { return chr.age; });
+ * // => { 'name': 'fred', 'age': 40 };
+ *
+ * // using "_.pluck" callback shorthand
+ * _.max(characters, 'age');
+ * // => { 'name': 'fred', 'age': 40 };
+ */
+ function max(collection, callback, thisArg) {
+ var computed = -Infinity,
+ result = computed;
+
+ // allows working with functions like `_.map` without using
+ // their `index` argument as a callback
+ if (typeof callback != 'function' && thisArg && thisArg[callback] === collection) {
+ callback = null;
+ }
+ if (callback == null && isArray(collection)) {
+ var index = -1,
+ length = collection.length;
+
+ while (++index < length) {
+ var value = collection[index];
+ if (value > result) {
+ result = value;
+ }
+ }
+ } else {
+ callback = (callback == null && isString(collection))
+ ? charAtCallback
+ : lodash.createCallback(callback, thisArg, 3);
+
+ baseEach(collection, function(value, index, collection) {
+ var current = callback(value, index, collection);
+ if (current > computed) {
+ computed = current;
+ result = value;
+ }
+ });
+ }
+ return result;
+ }
+
+ /**
+ * Retrieves the minimum value of a collection. If the collection is empty or
+ * falsey `Infinity` is returned. If a callback is provided it will be executed
+ * for each value in the collection to generate the criterion by which the value
+ * is ranked. The callback is bound to `thisArg` and invoked with three
+ * arguments; (value, index, collection).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {*} Returns the minimum value.
+ * @example
+ *
+ * _.min([4, 2, 8, 6]);
+ * // => 2
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 36 },
+ * { 'name': 'fred', 'age': 40 }
+ * ];
+ *
+ * _.min(characters, function(chr) { return chr.age; });
+ * // => { 'name': 'barney', 'age': 36 };
+ *
+ * // using "_.pluck" callback shorthand
+ * _.min(characters, 'age');
+ * // => { 'name': 'barney', 'age': 36 };
+ */
+ function min(collection, callback, thisArg) {
+ var computed = Infinity,
+ result = computed;
+
+ // allows working with functions like `_.map` without using
+ // their `index` argument as a callback
+ if (typeof callback != 'function' && thisArg && thisArg[callback] === collection) {
+ callback = null;
+ }
+ if (callback == null && isArray(collection)) {
+ var index = -1,
+ length = collection.length;
+
+ while (++index < length) {
+ var value = collection[index];
+ if (value < result) {
+ result = value;
+ }
+ }
+ } else {
+ callback = (callback == null && isString(collection))
+ ? charAtCallback
+ : lodash.createCallback(callback, thisArg, 3);
+
+ baseEach(collection, function(value, index, collection) {
+ var current = callback(value, index, collection);
+ if (current < computed) {
+ computed = current;
+ result = value;
+ }
+ });
+ }
+ return result;
+ }
+
+ /**
+ * Retrieves the value of a specified property from all elements in the collection.
+ *
+ * @static
+ * @memberOf _
+ * @type Function
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {string} property The name of the property to pluck.
+ * @returns {Array} Returns a new array of property values.
+ * @example
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 36 },
+ * { 'name': 'fred', 'age': 40 }
+ * ];
+ *
+ * _.pluck(characters, 'name');
+ * // => ['barney', 'fred']
+ */
+ var pluck = map;
+
+ /**
+ * Reduces a collection to a value which is the accumulated result of running
+ * each element in the collection through the callback, where each successive
+ * callback execution consumes the return value of the previous execution. If
+ * `accumulator` is not provided the first element of the collection will be
+ * used as the initial `accumulator` value. The callback is bound to `thisArg`
+ * and invoked with four arguments; (accumulator, value, index|key, collection).
+ *
+ * @static
+ * @memberOf _
+ * @alias foldl, inject
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function} [callback=identity] The function called per iteration.
+ * @param {*} [accumulator] Initial value of the accumulator.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {*} Returns the accumulated value.
+ * @example
+ *
+ * var sum = _.reduce([1, 2, 3], function(sum, num) {
+ * return sum + num;
+ * });
+ * // => 6
+ *
+ * var mapped = _.reduce({ 'a': 1, 'b': 2, 'c': 3 }, function(result, num, key) {
+ * result[key] = num * 3;
+ * return result;
+ * }, {});
+ * // => { 'a': 3, 'b': 6, 'c': 9 }
+ */
+ function reduce(collection, callback, accumulator, thisArg) {
+ var noaccum = arguments.length < 3;
+ callback = lodash.createCallback(callback, thisArg, 4);
+
+ if (isArray(collection)) {
+ var index = -1,
+ length = collection.length;
+
+ if (noaccum) {
+ accumulator = collection[++index];
+ }
+ while (++index < length) {
+ accumulator = callback(accumulator, collection[index], index, collection);
+ }
+ } else {
+ baseEach(collection, function(value, index, collection) {
+ accumulator = noaccum
+ ? (noaccum = false, value)
+ : callback(accumulator, value, index, collection)
+ });
+ }
+ return accumulator;
+ }
+
+ /**
+ * This method is like `_.reduce` except that it iterates over elements
+ * of a `collection` from right to left.
+ *
+ * @static
+ * @memberOf _
+ * @alias foldr
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function} [callback=identity] The function called per iteration.
+ * @param {*} [accumulator] Initial value of the accumulator.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {*} Returns the accumulated value.
+ * @example
+ *
+ * var list = [[0, 1], [2, 3], [4, 5]];
+ * var flat = _.reduceRight(list, function(a, b) { return a.concat(b); }, []);
+ * // => [4, 5, 2, 3, 0, 1]
+ */
+ function reduceRight(collection, callback, accumulator, thisArg) {
+ var noaccum = arguments.length < 3;
+ callback = lodash.createCallback(callback, thisArg, 4);
+ forEachRight(collection, function(value, index, collection) {
+ accumulator = noaccum
+ ? (noaccum = false, value)
+ : callback(accumulator, value, index, collection);
+ });
+ return accumulator;
+ }
+
+ /**
+ * The opposite of `_.filter` this method returns the elements of a
+ * collection that the callback does **not** return truey for.
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Array} Returns a new array of elements that failed the callback check.
+ * @example
+ *
+ * var odds = _.reject([1, 2, 3, 4, 5, 6], function(num) { return num % 2 == 0; });
+ * // => [1, 3, 5]
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 36, 'blocked': false },
+ * { 'name': 'fred', 'age': 40, 'blocked': true }
+ * ];
+ *
+ * // using "_.pluck" callback shorthand
+ * _.reject(characters, 'blocked');
+ * // => [{ 'name': 'barney', 'age': 36, 'blocked': false }]
+ *
+ * // using "_.where" callback shorthand
+ * _.reject(characters, { 'age': 36 });
+ * // => [{ 'name': 'fred', 'age': 40, 'blocked': true }]
+ */
+ function reject(collection, callback, thisArg) {
+ callback = lodash.createCallback(callback, thisArg, 3);
+ return filter(collection, function(value, index, collection) {
+ return !callback(value, index, collection);
+ });
+ }
+
+ /**
+ * Retrieves a random element or `n` random elements from a collection.
+ *
+ * @static
+ * @memberOf _
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to sample.
+ * @param {number} [n] The number of elements to sample.
+ * @param- {Object} [guard] Allows working with functions like `_.map`
+ * without using their `index` arguments as `n`.
+ * @returns {Array} Returns the random sample(s) of `collection`.
+ * @example
+ *
+ * _.sample([1, 2, 3, 4]);
+ * // => 2
+ *
+ * _.sample([1, 2, 3, 4], 2);
+ * // => [3, 1]
+ */
+ function sample(collection, n, guard) {
+ if (collection && typeof collection.length != 'number') {
+ collection = values(collection);
+ } else if (support.unindexedChars && isString(collection)) {
+ collection = collection.split('');
+ }
+ if (n == null || guard) {
+ return collection ? collection[baseRandom(0, collection.length - 1)] : undefined;
+ }
+ var result = shuffle(collection);
+ result.length = nativeMin(nativeMax(0, n), result.length);
+ return result;
+ }
+
+ /**
+ * Creates an array of shuffled values, using a version of the Fisher-Yates
+ * shuffle. See http://en.wikipedia.org/wiki/Fisher-Yates_shuffle.
+ *
+ * @static
+ * @memberOf _
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to shuffle.
+ * @returns {Array} Returns a new shuffled collection.
+ * @example
+ *
+ * _.shuffle([1, 2, 3, 4, 5, 6]);
+ * // => [4, 1, 6, 3, 5, 2]
+ */
+ function shuffle(collection) {
+ var index = -1,
+ length = collection ? collection.length : 0,
+ result = Array(typeof length == 'number' ? length : 0);
+
+ forEach(collection, function(value) {
+ var rand = baseRandom(0, ++index);
+ result[index] = result[rand];
+ result[rand] = value;
+ });
+ return result;
+ }
+
+ /**
+ * Gets the size of the `collection` by returning `collection.length` for arrays
+ * and array-like objects or the number of own enumerable properties for objects.
+ *
+ * @static
+ * @memberOf _
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to inspect.
+ * @returns {number} Returns `collection.length` or number of own enumerable properties.
+ * @example
+ *
+ * _.size([1, 2]);
+ * // => 2
+ *
+ * _.size({ 'one': 1, 'two': 2, 'three': 3 });
+ * // => 3
+ *
+ * _.size('pebbles');
+ * // => 7
+ */
+ function size(collection) {
+ var length = collection ? collection.length : 0;
+ return typeof length == 'number' ? length : keys(collection).length;
+ }
+
+ /**
+ * Checks if the callback returns a truey value for **any** element of a
+ * collection. The function returns as soon as it finds a passing value and
+ * does not iterate over the entire collection. The callback is bound to
+ * `thisArg` and invoked with three arguments; (value, index|key, collection).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @alias any
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {boolean} Returns `true` if any element passed the callback check,
+ * else `false`.
+ * @example
+ *
+ * _.some([null, 0, 'yes', false], Boolean);
+ * // => true
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 36, 'blocked': false },
+ * { 'name': 'fred', 'age': 40, 'blocked': true }
+ * ];
+ *
+ * // using "_.pluck" callback shorthand
+ * _.some(characters, 'blocked');
+ * // => true
+ *
+ * // using "_.where" callback shorthand
+ * _.some(characters, { 'age': 1 });
+ * // => false
+ */
+ function some(collection, callback, thisArg) {
+ var result;
+ callback = lodash.createCallback(callback, thisArg, 3);
+
+ if (isArray(collection)) {
+ var index = -1,
+ length = collection.length;
+
+ while (++index < length) {
+ if ((result = callback(collection[index], index, collection))) {
+ break;
+ }
+ }
+ } else {
+ baseEach(collection, function(value, index, collection) {
+ return !(result = callback(value, index, collection));
+ });
+ }
+ return !!result;
+ }
+
+ /**
+ * Creates an array of elements, sorted in ascending order by the results of
+ * running each element in a collection through the callback. This method
+ * performs a stable sort, that is, it will preserve the original sort order
+ * of equal elements. The callback is bound to `thisArg` and invoked with
+ * three arguments; (value, index|key, collection).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an array of property names is provided for `callback` the collection
+ * will be sorted by each property value.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Array|Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Array} Returns a new array of sorted elements.
+ * @example
+ *
+ * _.sortBy([1, 2, 3], function(num) { return Math.sin(num); });
+ * // => [3, 1, 2]
+ *
+ * _.sortBy([1, 2, 3], function(num) { return this.sin(num); }, Math);
+ * // => [3, 1, 2]
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 36 },
+ * { 'name': 'fred', 'age': 40 },
+ * { 'name': 'barney', 'age': 26 },
+ * { 'name': 'fred', 'age': 30 }
+ * ];
+ *
+ * // using "_.pluck" callback shorthand
+ * _.map(_.sortBy(characters, 'age'), _.values);
+ * // => [['barney', 26], ['fred', 30], ['barney', 36], ['fred', 40]]
+ *
+ * // sorting by multiple properties
+ * _.map(_.sortBy(characters, ['name', 'age']), _.values);
+ * // = > [['barney', 26], ['barney', 36], ['fred', 30], ['fred', 40]]
+ */
+ function sortBy(collection, callback, thisArg) {
+ var index = -1,
+ isArr = isArray(callback),
+ length = collection ? collection.length : 0,
+ result = Array(typeof length == 'number' ? length : 0);
+
+ if (!isArr) {
+ callback = lodash.createCallback(callback, thisArg, 3);
+ }
+ forEach(collection, function(value, key, collection) {
+ var object = result[++index] = getObject();
+ if (isArr) {
+ object.criteria = map(callback, function(key) { return value[key]; });
+ } else {
+ (object.criteria = getArray())[0] = callback(value, key, collection);
+ }
+ object.index = index;
+ object.value = value;
+ });
+
+ length = result.length;
+ result.sort(compareAscending);
+ while (length--) {
+ var object = result[length];
+ result[length] = object.value;
+ if (!isArr) {
+ releaseArray(object.criteria);
+ }
+ releaseObject(object);
+ }
+ return result;
+ }
+
+ /**
+ * Converts the `collection` to an array.
+ *
+ * @static
+ * @memberOf _
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to convert.
+ * @returns {Array} Returns the new converted array.
+ * @example
+ *
+ * (function() { return _.toArray(arguments).slice(1); })(1, 2, 3, 4);
+ * // => [2, 3, 4]
+ */
+ function toArray(collection) {
+ if (collection && typeof collection.length == 'number') {
+ return (support.unindexedChars && isString(collection))
+ ? collection.split('')
+ : slice(collection);
+ }
+ return values(collection);
+ }
+
+ /**
+ * Performs a deep comparison of each element in a `collection` to the given
+ * `properties` object, returning an array of all elements that have equivalent
+ * property values.
+ *
+ * @static
+ * @memberOf _
+ * @type Function
+ * @category Collections
+ * @param {Array|Object|string} collection The collection to iterate over.
+ * @param {Object} props The object of property values to filter by.
+ * @returns {Array} Returns a new array of elements that have the given properties.
+ * @example
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 36, 'pets': ['hoppy'] },
+ * { 'name': 'fred', 'age': 40, 'pets': ['baby puss', 'dino'] }
+ * ];
+ *
+ * _.where(characters, { 'age': 36 });
+ * // => [{ 'name': 'barney', 'age': 36, 'pets': ['hoppy'] }]
+ *
+ * _.where(characters, { 'pets': ['dino'] });
+ * // => [{ 'name': 'fred', 'age': 40, 'pets': ['baby puss', 'dino'] }]
+ */
+ var where = filter;
+
+ /*--------------------------------------------------------------------------*/
+
+ /**
+ * Creates an array with all falsey values removed. The values `false`, `null`,
+ * `0`, `""`, `undefined`, and `NaN` are all falsey.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {Array} array The array to compact.
+ * @returns {Array} Returns a new array of filtered values.
+ * @example
+ *
+ * _.compact([0, 1, false, 2, '', 3]);
+ * // => [1, 2, 3]
+ */
+ function compact(array) {
+ var index = -1,
+ length = array ? array.length : 0,
+ result = [];
+
+ while (++index < length) {
+ var value = array[index];
+ if (value) {
+ result.push(value);
+ }
+ }
+ return result;
+ }
+
+ /**
+ * Creates an array excluding all values of the provided arrays using strict
+ * equality for comparisons, i.e. `===`.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {Array} array The array to process.
+ * @param {...Array} [values] The arrays of values to exclude.
+ * @returns {Array} Returns a new array of filtered values.
+ * @example
+ *
+ * _.difference([1, 2, 3, 4, 5], [5, 2, 10]);
+ * // => [1, 3, 4]
+ */
+ function difference(array) {
+ return baseDifference(array, baseFlatten(arguments, true, true, 1));
+ }
+
+ /**
+ * This method is like `_.find` except that it returns the index of the first
+ * element that passes the callback check, instead of the element itself.
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {Array} array The array to search.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {number} Returns the index of the found element, else `-1`.
+ * @example
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 36, 'blocked': false },
+ * { 'name': 'fred', 'age': 40, 'blocked': true },
+ * { 'name': 'pebbles', 'age': 1, 'blocked': false }
+ * ];
+ *
+ * _.findIndex(characters, function(chr) {
+ * return chr.age < 20;
+ * });
+ * // => 2
+ *
+ * // using "_.where" callback shorthand
+ * _.findIndex(characters, { 'age': 36 });
+ * // => 0
+ *
+ * // using "_.pluck" callback shorthand
+ * _.findIndex(characters, 'blocked');
+ * // => 1
+ */
+ function findIndex(array, callback, thisArg) {
+ var index = -1,
+ length = array ? array.length : 0;
+
+ callback = lodash.createCallback(callback, thisArg, 3);
+ while (++index < length) {
+ if (callback(array[index], index, array)) {
+ return index;
+ }
+ }
+ return -1;
+ }
+
+ /**
+ * This method is like `_.findIndex` except that it iterates over elements
+ * of a `collection` from right to left.
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {Array} array The array to search.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {number} Returns the index of the found element, else `-1`.
+ * @example
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 36, 'blocked': true },
+ * { 'name': 'fred', 'age': 40, 'blocked': false },
+ * { 'name': 'pebbles', 'age': 1, 'blocked': true }
+ * ];
+ *
+ * _.findLastIndex(characters, function(chr) {
+ * return chr.age > 30;
+ * });
+ * // => 1
+ *
+ * // using "_.where" callback shorthand
+ * _.findLastIndex(characters, { 'age': 36 });
+ * // => 0
+ *
+ * // using "_.pluck" callback shorthand
+ * _.findLastIndex(characters, 'blocked');
+ * // => 2
+ */
+ function findLastIndex(array, callback, thisArg) {
+ var length = array ? array.length : 0;
+ callback = lodash.createCallback(callback, thisArg, 3);
+ while (length--) {
+ if (callback(array[length], length, array)) {
+ return length;
+ }
+ }
+ return -1;
+ }
+
+ /**
+ * Gets the first element or first `n` elements of an array. If a callback
+ * is provided elements at the beginning of the array are returned as long
+ * as the callback returns truey. The callback is bound to `thisArg` and
+ * invoked with three arguments; (value, index, array).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @alias head, take
+ * @category Arrays
+ * @param {Array} array The array to query.
+ * @param {Function|Object|number|string} [callback] The function called
+ * per element or the number of elements to return. If a property name or
+ * object is provided it will be used to create a "_.pluck" or "_.where"
+ * style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {*} Returns the first element(s) of `array`.
+ * @example
+ *
+ * _.first([1, 2, 3]);
+ * // => 1
+ *
+ * _.first([1, 2, 3], 2);
+ * // => [1, 2]
+ *
+ * _.first([1, 2, 3], function(num) {
+ * return num < 3;
+ * });
+ * // => [1, 2]
+ *
+ * var characters = [
+ * { 'name': 'barney', 'blocked': true, 'employer': 'slate' },
+ * { 'name': 'fred', 'blocked': false, 'employer': 'slate' },
+ * { 'name': 'pebbles', 'blocked': true, 'employer': 'na' }
+ * ];
+ *
+ * // using "_.pluck" callback shorthand
+ * _.first(characters, 'blocked');
+ * // => [{ 'name': 'barney', 'blocked': true, 'employer': 'slate' }]
+ *
+ * // using "_.where" callback shorthand
+ * _.pluck(_.first(characters, { 'employer': 'slate' }), 'name');
+ * // => ['barney', 'fred']
+ */
+ function first(array, callback, thisArg) {
+ var n = 0,
+ length = array ? array.length : 0;
+
+ if (typeof callback != 'number' && callback != null) {
+ var index = -1;
+ callback = lodash.createCallback(callback, thisArg, 3);
+ while (++index < length && callback(array[index], index, array)) {
+ n++;
+ }
+ } else {
+ n = callback;
+ if (n == null || thisArg) {
+ return array ? array[0] : undefined;
+ }
+ }
+ return slice(array, 0, nativeMin(nativeMax(0, n), length));
+ }
+
+ /**
+ * Flattens a nested array (the nesting can be to any depth). If `isShallow`
+ * is truey, the array will only be flattened a single level. If a callback
+ * is provided each element of the array is passed through the callback before
+ * flattening. The callback is bound to `thisArg` and invoked with three
+ * arguments; (value, index, array).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {Array} array The array to flatten.
+ * @param {boolean} [isShallow=false] A flag to restrict flattening to a single level.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Array} Returns a new flattened array.
+ * @example
+ *
+ * _.flatten([1, [2], [3, [[4]]]]);
+ * // => [1, 2, 3, 4];
+ *
+ * _.flatten([1, [2], [3, [[4]]]], true);
+ * // => [1, 2, 3, [[4]]];
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 30, 'pets': ['hoppy'] },
+ * { 'name': 'fred', 'age': 40, 'pets': ['baby puss', 'dino'] }
+ * ];
+ *
+ * // using "_.pluck" callback shorthand
+ * _.flatten(characters, 'pets');
+ * // => ['hoppy', 'baby puss', 'dino']
+ */
+ function flatten(array, isShallow, callback, thisArg) {
+ // juggle arguments
+ if (typeof isShallow != 'boolean' && isShallow != null) {
+ thisArg = callback;
+ callback = (typeof isShallow != 'function' && thisArg && thisArg[isShallow] === array) ? null : isShallow;
+ isShallow = false;
+ }
+ if (callback != null) {
+ array = map(array, callback, thisArg);
+ }
+ return baseFlatten(array, isShallow);
+ }
+
+ /**
+ * Gets the index at which the first occurrence of `value` is found using
+ * strict equality for comparisons, i.e. `===`. If the array is already sorted
+ * providing `true` for `fromIndex` will run a faster binary search.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {Array} array The array to search.
+ * @param {*} value The value to search for.
+ * @param {boolean|number} [fromIndex=0] The index to search from or `true`
+ * to perform a binary search on a sorted array.
+ * @returns {number} Returns the index of the matched value or `-1`.
+ * @example
+ *
+ * _.indexOf([1, 2, 3, 1, 2, 3], 2);
+ * // => 1
+ *
+ * _.indexOf([1, 2, 3, 1, 2, 3], 2, 3);
+ * // => 4
+ *
+ * _.indexOf([1, 1, 2, 2, 3, 3], 2, true);
+ * // => 2
+ */
+ function indexOf(array, value, fromIndex) {
+ if (typeof fromIndex == 'number') {
+ var length = array ? array.length : 0;
+ fromIndex = (fromIndex < 0 ? nativeMax(0, length + fromIndex) : fromIndex || 0);
+ } else if (fromIndex) {
+ var index = sortedIndex(array, value);
+ return array[index] === value ? index : -1;
+ }
+ return baseIndexOf(array, value, fromIndex);
+ }
+
+ /**
+ * Gets all but the last element or last `n` elements of an array. If a
+ * callback is provided elements at the end of the array are excluded from
+ * the result as long as the callback returns truey. The callback is bound
+ * to `thisArg` and invoked with three arguments; (value, index, array).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {Array} array The array to query.
+ * @param {Function|Object|number|string} [callback=1] The function called
+ * per element or the number of elements to exclude. If a property name or
+ * object is provided it will be used to create a "_.pluck" or "_.where"
+ * style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Array} Returns a slice of `array`.
+ * @example
+ *
+ * _.initial([1, 2, 3]);
+ * // => [1, 2]
+ *
+ * _.initial([1, 2, 3], 2);
+ * // => [1]
+ *
+ * _.initial([1, 2, 3], function(num) {
+ * return num > 1;
+ * });
+ * // => [1]
+ *
+ * var characters = [
+ * { 'name': 'barney', 'blocked': false, 'employer': 'slate' },
+ * { 'name': 'fred', 'blocked': true, 'employer': 'slate' },
+ * { 'name': 'pebbles', 'blocked': true, 'employer': 'na' }
+ * ];
+ *
+ * // using "_.pluck" callback shorthand
+ * _.initial(characters, 'blocked');
+ * // => [{ 'name': 'barney', 'blocked': false, 'employer': 'slate' }]
+ *
+ * // using "_.where" callback shorthand
+ * _.pluck(_.initial(characters, { 'employer': 'na' }), 'name');
+ * // => ['barney', 'fred']
+ */
+ function initial(array, callback, thisArg) {
+ var n = 0,
+ length = array ? array.length : 0;
+
+ if (typeof callback != 'number' && callback != null) {
+ var index = length;
+ callback = lodash.createCallback(callback, thisArg, 3);
+ while (index-- && callback(array[index], index, array)) {
+ n++;
+ }
+ } else {
+ n = (callback == null || thisArg) ? 1 : callback || n;
+ }
+ return slice(array, 0, nativeMin(nativeMax(0, length - n), length));
+ }
+
+ /**
+ * Creates an array of unique values present in all provided arrays using
+ * strict equality for comparisons, i.e. `===`.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {...Array} [array] The arrays to inspect.
+ * @returns {Array} Returns an array of shared values.
+ * @example
+ *
+ * _.intersection([1, 2, 3], [5, 2, 1, 4], [2, 1]);
+ * // => [1, 2]
+ */
+ function intersection() {
+ var args = [],
+ argsIndex = -1,
+ argsLength = arguments.length,
+ caches = getArray(),
+ indexOf = getIndexOf(),
+ trustIndexOf = indexOf === baseIndexOf,
+ seen = getArray();
+
+ while (++argsIndex < argsLength) {
+ var value = arguments[argsIndex];
+ if (isArray(value) || isArguments(value)) {
+ args.push(value);
+ caches.push(trustIndexOf && value.length >= largeArraySize &&
+ createCache(argsIndex ? args[argsIndex] : seen));
+ }
+ }
+ var array = args[0],
+ index = -1,
+ length = array ? array.length : 0,
+ result = [];
+
+ outer:
+ while (++index < length) {
+ var cache = caches[0];
+ value = array[index];
+
+ if ((cache ? cacheIndexOf(cache, value) : indexOf(seen, value)) < 0) {
+ argsIndex = argsLength;
+ (cache || seen).push(value);
+ while (--argsIndex) {
+ cache = caches[argsIndex];
+ if ((cache ? cacheIndexOf(cache, value) : indexOf(args[argsIndex], value)) < 0) {
+ continue outer;
+ }
+ }
+ result.push(value);
+ }
+ }
+ while (argsLength--) {
+ cache = caches[argsLength];
+ if (cache) {
+ releaseObject(cache);
+ }
+ }
+ releaseArray(caches);
+ releaseArray(seen);
+ return result;
+ }
+
+ /**
+ * Gets the last element or last `n` elements of an array. If a callback is
+ * provided elements at the end of the array are returned as long as the
+ * callback returns truey. The callback is bound to `thisArg` and invoked
+ * with three arguments; (value, index, array).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {Array} array The array to query.
+ * @param {Function|Object|number|string} [callback] The function called
+ * per element or the number of elements to return. If a property name or
+ * object is provided it will be used to create a "_.pluck" or "_.where"
+ * style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {*} Returns the last element(s) of `array`.
+ * @example
+ *
+ * _.last([1, 2, 3]);
+ * // => 3
+ *
+ * _.last([1, 2, 3], 2);
+ * // => [2, 3]
+ *
+ * _.last([1, 2, 3], function(num) {
+ * return num > 1;
+ * });
+ * // => [2, 3]
+ *
+ * var characters = [
+ * { 'name': 'barney', 'blocked': false, 'employer': 'slate' },
+ * { 'name': 'fred', 'blocked': true, 'employer': 'slate' },
+ * { 'name': 'pebbles', 'blocked': true, 'employer': 'na' }
+ * ];
+ *
+ * // using "_.pluck" callback shorthand
+ * _.pluck(_.last(characters, 'blocked'), 'name');
+ * // => ['fred', 'pebbles']
+ *
+ * // using "_.where" callback shorthand
+ * _.last(characters, { 'employer': 'na' });
+ * // => [{ 'name': 'pebbles', 'blocked': true, 'employer': 'na' }]
+ */
+ function last(array, callback, thisArg) {
+ var n = 0,
+ length = array ? array.length : 0;
+
+ if (typeof callback != 'number' && callback != null) {
+ var index = length;
+ callback = lodash.createCallback(callback, thisArg, 3);
+ while (index-- && callback(array[index], index, array)) {
+ n++;
+ }
+ } else {
+ n = callback;
+ if (n == null || thisArg) {
+ return array ? array[length - 1] : undefined;
+ }
+ }
+ return slice(array, nativeMax(0, length - n));
+ }
+
+ /**
+ * Gets the index at which the last occurrence of `value` is found using strict
+ * equality for comparisons, i.e. `===`. If `fromIndex` is negative, it is used
+ * as the offset from the end of the collection.
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {Array} array The array to search.
+ * @param {*} value The value to search for.
+ * @param {number} [fromIndex=array.length-1] The index to search from.
+ * @returns {number} Returns the index of the matched value or `-1`.
+ * @example
+ *
+ * _.lastIndexOf([1, 2, 3, 1, 2, 3], 2);
+ * // => 4
+ *
+ * _.lastIndexOf([1, 2, 3, 1, 2, 3], 2, 3);
+ * // => 1
+ */
+ function lastIndexOf(array, value, fromIndex) {
+ var index = array ? array.length : 0;
+ if (typeof fromIndex == 'number') {
+ index = (fromIndex < 0 ? nativeMax(0, index + fromIndex) : nativeMin(fromIndex, index - 1)) + 1;
+ }
+ while (index--) {
+ if (array[index] === value) {
+ return index;
+ }
+ }
+ return -1;
+ }
+
+ /**
+ * Removes all provided values from the given array using strict equality for
+ * comparisons, i.e. `===`.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {Array} array The array to modify.
+ * @param {...*} [value] The values to remove.
+ * @returns {Array} Returns `array`.
+ * @example
+ *
+ * var array = [1, 2, 3, 1, 2, 3];
+ * _.pull(array, 2, 3);
+ * console.log(array);
+ * // => [1, 1]
+ */
+ function pull(array) {
+ var args = arguments,
+ argsIndex = 0,
+ argsLength = args.length,
+ length = array ? array.length : 0;
+
+ while (++argsIndex < argsLength) {
+ var index = -1,
+ value = args[argsIndex];
+ while (++index < length) {
+ if (array[index] === value) {
+ splice.call(array, index--, 1);
+ length--;
+ }
+ }
+ }
+ return array;
+ }
+
+ /**
+ * Creates an array of numbers (positive and/or negative) progressing from
+ * `start` up to but not including `end`. If `start` is less than `stop` a
+ * zero-length range is created unless a negative `step` is specified.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {number} [start=0] The start of the range.
+ * @param {number} end The end of the range.
+ * @param {number} [step=1] The value to increment or decrement by.
+ * @returns {Array} Returns a new range array.
+ * @example
+ *
+ * _.range(4);
+ * // => [0, 1, 2, 3]
+ *
+ * _.range(1, 5);
+ * // => [1, 2, 3, 4]
+ *
+ * _.range(0, 20, 5);
+ * // => [0, 5, 10, 15]
+ *
+ * _.range(0, -4, -1);
+ * // => [0, -1, -2, -3]
+ *
+ * _.range(1, 4, 0);
+ * // => [1, 1, 1]
+ *
+ * _.range(0);
+ * // => []
+ */
+ function range(start, end, step) {
+ start = +start || 0;
+ step = typeof step == 'number' ? step : (+step || 1);
+
+ if (end == null) {
+ end = start;
+ start = 0;
+ }
+ // use `Array(length)` so engines like Chakra and V8 avoid slower modes
+ // http://youtu.be/XAqIpGU8ZZk#t=17m25s
+ var index = -1,
+ length = nativeMax(0, ceil((end - start) / (step || 1))),
+ result = Array(length);
+
+ while (++index < length) {
+ result[index] = start;
+ start += step;
+ }
+ return result;
+ }
+
+ /**
+ * Removes all elements from an array that the callback returns truey for
+ * and returns an array of removed elements. The callback is bound to `thisArg`
+ * and invoked with three arguments; (value, index, array).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {Array} array The array to modify.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Array} Returns a new array of removed elements.
+ * @example
+ *
+ * var array = [1, 2, 3, 4, 5, 6];
+ * var evens = _.remove(array, function(num) { return num % 2 == 0; });
+ *
+ * console.log(array);
+ * // => [1, 3, 5]
+ *
+ * console.log(evens);
+ * // => [2, 4, 6]
+ */
+ function remove(array, callback, thisArg) {
+ var index = -1,
+ length = array ? array.length : 0,
+ result = [];
+
+ callback = lodash.createCallback(callback, thisArg, 3);
+ while (++index < length) {
+ var value = array[index];
+ if (callback(value, index, array)) {
+ result.push(value);
+ splice.call(array, index--, 1);
+ length--;
+ }
+ }
+ return result;
+ }
+
+ /**
+ * The opposite of `_.initial` this method gets all but the first element or
+ * first `n` elements of an array. If a callback function is provided elements
+ * at the beginning of the array are excluded from the result as long as the
+ * callback returns truey. The callback is bound to `thisArg` and invoked
+ * with three arguments; (value, index, array).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @alias drop, tail
+ * @category Arrays
+ * @param {Array} array The array to query.
+ * @param {Function|Object|number|string} [callback=1] The function called
+ * per element or the number of elements to exclude. If a property name or
+ * object is provided it will be used to create a "_.pluck" or "_.where"
+ * style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Array} Returns a slice of `array`.
+ * @example
+ *
+ * _.rest([1, 2, 3]);
+ * // => [2, 3]
+ *
+ * _.rest([1, 2, 3], 2);
+ * // => [3]
+ *
+ * _.rest([1, 2, 3], function(num) {
+ * return num < 3;
+ * });
+ * // => [3]
+ *
+ * var characters = [
+ * { 'name': 'barney', 'blocked': true, 'employer': 'slate' },
+ * { 'name': 'fred', 'blocked': false, 'employer': 'slate' },
+ * { 'name': 'pebbles', 'blocked': true, 'employer': 'na' }
+ * ];
+ *
+ * // using "_.pluck" callback shorthand
+ * _.pluck(_.rest(characters, 'blocked'), 'name');
+ * // => ['fred', 'pebbles']
+ *
+ * // using "_.where" callback shorthand
+ * _.rest(characters, { 'employer': 'slate' });
+ * // => [{ 'name': 'pebbles', 'blocked': true, 'employer': 'na' }]
+ */
+ function rest(array, callback, thisArg) {
+ if (typeof callback != 'number' && callback != null) {
+ var n = 0,
+ index = -1,
+ length = array ? array.length : 0;
+
+ callback = lodash.createCallback(callback, thisArg, 3);
+ while (++index < length && callback(array[index], index, array)) {
+ n++;
+ }
+ } else {
+ n = (callback == null || thisArg) ? 1 : nativeMax(0, callback);
+ }
+ return slice(array, n);
+ }
+
+ /**
+ * Uses a binary search to determine the smallest index at which a value
+ * should be inserted into a given sorted array in order to maintain the sort
+ * order of the array. If a callback is provided it will be executed for
+ * `value` and each element of `array` to compute their sort ranking. The
+ * callback is bound to `thisArg` and invoked with one argument; (value).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {Array} array The array to inspect.
+ * @param {*} value The value to evaluate.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {number} Returns the index at which `value` should be inserted
+ * into `array`.
+ * @example
+ *
+ * _.sortedIndex([20, 30, 50], 40);
+ * // => 2
+ *
+ * // using "_.pluck" callback shorthand
+ * _.sortedIndex([{ 'x': 20 }, { 'x': 30 }, { 'x': 50 }], { 'x': 40 }, 'x');
+ * // => 2
+ *
+ * var dict = {
+ * 'wordToNumber': { 'twenty': 20, 'thirty': 30, 'fourty': 40, 'fifty': 50 }
+ * };
+ *
+ * _.sortedIndex(['twenty', 'thirty', 'fifty'], 'fourty', function(word) {
+ * return dict.wordToNumber[word];
+ * });
+ * // => 2
+ *
+ * _.sortedIndex(['twenty', 'thirty', 'fifty'], 'fourty', function(word) {
+ * return this.wordToNumber[word];
+ * }, dict);
+ * // => 2
+ */
+ function sortedIndex(array, value, callback, thisArg) {
+ var low = 0,
+ high = array ? array.length : low;
+
+ // explicitly reference `identity` for better inlining in Firefox
+ callback = callback ? lodash.createCallback(callback, thisArg, 1) : identity;
+ value = callback(value);
+
+ while (low < high) {
+ var mid = (low + high) >>> 1;
+ (callback(array[mid]) < value)
+ ? low = mid + 1
+ : high = mid;
+ }
+ return low;
+ }
+
+ /**
+ * Creates an array of unique values, in order, of the provided arrays using
+ * strict equality for comparisons, i.e. `===`.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {...Array} [array] The arrays to inspect.
+ * @returns {Array} Returns an array of combined values.
+ * @example
+ *
+ * _.union([1, 2, 3], [5, 2, 1, 4], [2, 1]);
+ * // => [1, 2, 3, 5, 4]
+ */
+ function union() {
+ return baseUniq(baseFlatten(arguments, true, true));
+ }
+
+ /**
+ * Creates a duplicate-value-free version of an array using strict equality
+ * for comparisons, i.e. `===`. If the array is sorted, providing
+ * `true` for `isSorted` will use a faster algorithm. If a callback is provided
+ * each element of `array` is passed through the callback before uniqueness
+ * is computed. The callback is bound to `thisArg` and invoked with three
+ * arguments; (value, index, array).
+ *
+ * If a property name is provided for `callback` the created "_.pluck" style
+ * callback will return the property value of the given element.
+ *
+ * If an object is provided for `callback` the created "_.where" style callback
+ * will return `true` for elements that have the properties of the given object,
+ * else `false`.
+ *
+ * @static
+ * @memberOf _
+ * @alias unique
+ * @category Arrays
+ * @param {Array} array The array to process.
+ * @param {boolean} [isSorted=false] A flag to indicate that `array` is sorted.
+ * @param {Function|Object|string} [callback=identity] The function called
+ * per iteration. If a property name or object is provided it will be used
+ * to create a "_.pluck" or "_.where" style callback, respectively.
+ * @param {*} [thisArg] The `this` binding of `callback`.
+ * @returns {Array} Returns a duplicate-value-free array.
+ * @example
+ *
+ * _.uniq([1, 2, 1, 3, 1]);
+ * // => [1, 2, 3]
+ *
+ * _.uniq([1, 1, 2, 2, 3], true);
+ * // => [1, 2, 3]
+ *
+ * _.uniq(['A', 'b', 'C', 'a', 'B', 'c'], function(letter) { return letter.toLowerCase(); });
+ * // => ['A', 'b', 'C']
+ *
+ * _.uniq([1, 2.5, 3, 1.5, 2, 3.5], function(num) { return this.floor(num); }, Math);
+ * // => [1, 2.5, 3]
+ *
+ * // using "_.pluck" callback shorthand
+ * _.uniq([{ 'x': 1 }, { 'x': 2 }, { 'x': 1 }], 'x');
+ * // => [{ 'x': 1 }, { 'x': 2 }]
+ */
+ function uniq(array, isSorted, callback, thisArg) {
+ // juggle arguments
+ if (typeof isSorted != 'boolean' && isSorted != null) {
+ thisArg = callback;
+ callback = (typeof isSorted != 'function' && thisArg && thisArg[isSorted] === array) ? null : isSorted;
+ isSorted = false;
+ }
+ if (callback != null) {
+ callback = lodash.createCallback(callback, thisArg, 3);
+ }
+ return baseUniq(array, isSorted, callback);
+ }
+
+ /**
+ * Creates an array excluding all provided values using strict equality for
+ * comparisons, i.e. `===`.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {Array} array The array to filter.
+ * @param {...*} [value] The values to exclude.
+ * @returns {Array} Returns a new array of filtered values.
+ * @example
+ *
+ * _.without([1, 2, 1, 0, 3, 1, 4], 0, 1);
+ * // => [2, 3, 4]
+ */
+ function without(array) {
+ return baseDifference(array, slice(arguments, 1));
+ }
+
+ /**
+ * Creates an array that is the symmetric difference of the provided arrays.
+ * See http://en.wikipedia.org/wiki/Symmetric_difference.
+ *
+ * @static
+ * @memberOf _
+ * @category Arrays
+ * @param {...Array} [array] The arrays to inspect.
+ * @returns {Array} Returns an array of values.
+ * @example
+ *
+ * _.xor([1, 2, 3], [5, 2, 1, 4]);
+ * // => [3, 5, 4]
+ *
+ * _.xor([1, 2, 5], [2, 3, 5], [3, 4, 5]);
+ * // => [1, 4, 5]
+ */
+ function xor() {
+ var index = -1,
+ length = arguments.length;
+
+ while (++index < length) {
+ var array = arguments[index];
+ if (isArray(array) || isArguments(array)) {
+ var result = result
+ ? baseUniq(baseDifference(result, array).concat(baseDifference(array, result)))
+ : array;
+ }
+ }
+ return result || [];
+ }
+
+ /**
+ * Creates an array of grouped elements, the first of which contains the first
+ * elements of the given arrays, the second of which contains the second
+ * elements of the given arrays, and so on.
+ *
+ * @static
+ * @memberOf _
+ * @alias unzip
+ * @category Arrays
+ * @param {...Array} [array] Arrays to process.
+ * @returns {Array} Returns a new array of grouped elements.
+ * @example
+ *
+ * _.zip(['fred', 'barney'], [30, 40], [true, false]);
+ * // => [['fred', 30, true], ['barney', 40, false]]
+ */
+ function zip() {
+ var array = arguments.length > 1 ? arguments : arguments[0],
+ index = -1,
+ length = array ? max(pluck(array, 'length')) : 0,
+ result = Array(length < 0 ? 0 : length);
+
+ while (++index < length) {
+ result[index] = pluck(array, index);
+ }
+ return result;
+ }
+
+ /**
+ * Creates an object composed from arrays of `keys` and `values`. Provide
+ * either a single two dimensional array, i.e. `[[key1, value1], [key2, value2]]`
+ * or two arrays, one of `keys` and one of corresponding `values`.
+ *
+ * @static
+ * @memberOf _
+ * @alias object
+ * @category Arrays
+ * @param {Array} keys The array of keys.
+ * @param {Array} [values=[]] The array of values.
+ * @returns {Object} Returns an object composed of the given keys and
+ * corresponding values.
+ * @example
+ *
+ * _.zipObject(['fred', 'barney'], [30, 40]);
+ * // => { 'fred': 30, 'barney': 40 }
+ */
+ function zipObject(keys, values) {
+ var index = -1,
+ length = keys ? keys.length : 0,
+ result = {};
+
+ if (!values && length && !isArray(keys[0])) {
+ values = [];
+ }
+ while (++index < length) {
+ var key = keys[index];
+ if (values) {
+ result[key] = values[index];
+ } else if (key) {
+ result[key[0]] = key[1];
+ }
+ }
+ return result;
+ }
+
+ /*--------------------------------------------------------------------------*/
+
+ /**
+ * Creates a function that executes `func`, with the `this` binding and
+ * arguments of the created function, only after being called `n` times.
+ *
+ * @static
+ * @memberOf _
+ * @category Functions
+ * @param {number} n The number of times the function must be called before
+ * `func` is executed.
+ * @param {Function} func The function to restrict.
+ * @returns {Function} Returns the new restricted function.
+ * @example
+ *
+ * var saves = ['profile', 'settings'];
+ *
+ * var done = _.after(saves.length, function() {
+ * console.log('Done saving!');
+ * });
+ *
+ * _.forEach(saves, function(type) {
+ * asyncSave({ 'type': type, 'complete': done });
+ * });
+ * // => logs 'Done saving!', after all saves have completed
+ */
+ function after(n, func) {
+ if (!isFunction(func)) {
+ throw new TypeError;
+ }
+ return function() {
+ if (--n < 1) {
+ return func.apply(this, arguments);
+ }
+ };
+ }
+
+ /**
+ * Creates a function that, when called, invokes `func` with the `this`
+ * binding of `thisArg` and prepends any additional `bind` arguments to those
+ * provided to the bound function.
+ *
+ * @static
+ * @memberOf _
+ * @category Functions
+ * @param {Function} func The function to bind.
+ * @param {*} [thisArg] The `this` binding of `func`.
+ * @param {...*} [arg] Arguments to be partially applied.
+ * @returns {Function} Returns the new bound function.
+ * @example
+ *
+ * var func = function(greeting) {
+ * return greeting + ' ' + this.name;
+ * };
+ *
+ * func = _.bind(func, { 'name': 'fred' }, 'hi');
+ * func();
+ * // => 'hi fred'
+ */
+ function bind(func, thisArg) {
+ return arguments.length > 2
+ ? createWrapper(func, 17, slice(arguments, 2), null, thisArg)
+ : createWrapper(func, 1, null, null, thisArg);
+ }
+
+ /**
+ * Binds methods of an object to the object itself, overwriting the existing
+ * method. Method names may be specified as individual arguments or as arrays
+ * of method names. If no method names are provided all the function properties
+ * of `object` will be bound.
+ *
+ * @static
+ * @memberOf _
+ * @category Functions
+ * @param {Object} object The object to bind and assign the bound methods to.
+ * @param {...string} [methodName] The object method names to
+ * bind, specified as individual method names or arrays of method names.
+ * @returns {Object} Returns `object`.
+ * @example
+ *
+ * var view = {
+ * 'label': 'docs',
+ * 'onClick': function() { console.log('clicked ' + this.label); }
+ * };
+ *
+ * _.bindAll(view);
+ * jQuery('#docs').on('click', view.onClick);
+ * // => logs 'clicked docs', when the button is clicked
+ */
+ function bindAll(object) {
+ var funcs = arguments.length > 1 ? baseFlatten(arguments, true, false, 1) : functions(object),
+ index = -1,
+ length = funcs.length;
+
+ while (++index < length) {
+ var key = funcs[index];
+ object[key] = createWrapper(object[key], 1, null, null, object);
+ }
+ return object;
+ }
+
+ /**
+ * Creates a function that, when called, invokes the method at `object[key]`
+ * and prepends any additional `bindKey` arguments to those provided to the bound
+ * function. This method differs from `_.bind` by allowing bound functions to
+ * reference methods that will be redefined or don't yet exist.
+ * See http://michaux.ca/articles/lazy-function-definition-pattern.
+ *
+ * @static
+ * @memberOf _
+ * @category Functions
+ * @param {Object} object The object the method belongs to.
+ * @param {string} key The key of the method.
+ * @param {...*} [arg] Arguments to be partially applied.
+ * @returns {Function} Returns the new bound function.
+ * @example
+ *
+ * var object = {
+ * 'name': 'fred',
+ * 'greet': function(greeting) {
+ * return greeting + ' ' + this.name;
+ * }
+ * };
+ *
+ * var func = _.bindKey(object, 'greet', 'hi');
+ * func();
+ * // => 'hi fred'
+ *
+ * object.greet = function(greeting) {
+ * return greeting + 'ya ' + this.name + '!';
+ * };
+ *
+ * func();
+ * // => 'hiya fred!'
+ */
+ function bindKey(object, key) {
+ return arguments.length > 2
+ ? createWrapper(key, 19, slice(arguments, 2), null, object)
+ : createWrapper(key, 3, null, null, object);
+ }
+
+ /**
+ * Creates a function that is the composition of the provided functions,
+ * where each function consumes the return value of the function that follows.
+ * For example, composing the functions `f()`, `g()`, and `h()` produces `f(g(h()))`.
+ * Each function is executed with the `this` binding of the composed function.
+ *
+ * @static
+ * @memberOf _
+ * @category Functions
+ * @param {...Function} [func] Functions to compose.
+ * @returns {Function} Returns the new composed function.
+ * @example
+ *
+ * var realNameMap = {
+ * 'pebbles': 'penelope'
+ * };
+ *
+ * var format = function(name) {
+ * name = realNameMap[name.toLowerCase()] || name;
+ * return name.charAt(0).toUpperCase() + name.slice(1).toLowerCase();
+ * };
+ *
+ * var greet = function(formatted) {
+ * return 'Hiya ' + formatted + '!';
+ * };
+ *
+ * var welcome = _.compose(greet, format);
+ * welcome('pebbles');
+ * // => 'Hiya Penelope!'
+ */
+ function compose() {
+ var funcs = arguments,
+ length = funcs.length;
+
+ while (length--) {
+ if (!isFunction(funcs[length])) {
+ throw new TypeError;
+ }
+ }
+ return function() {
+ var args = arguments,
+ length = funcs.length;
+
+ while (length--) {
+ args = [funcs[length].apply(this, args)];
+ }
+ return args[0];
+ };
+ }
+
+ /**
+ * Creates a function which accepts one or more arguments of `func` that when
+ * invoked either executes `func` returning its result, if all `func` arguments
+ * have been provided, or returns a function that accepts one or more of the
+ * remaining `func` arguments, and so on. The arity of `func` can be specified
+ * if `func.length` is not sufficient.
+ *
+ * @static
+ * @memberOf _
+ * @category Functions
+ * @param {Function} func The function to curry.
+ * @param {number} [arity=func.length] The arity of `func`.
+ * @returns {Function} Returns the new curried function.
+ * @example
+ *
+ * var curried = _.curry(function(a, b, c) {
+ * console.log(a + b + c);
+ * });
+ *
+ * curried(1)(2)(3);
+ * // => 6
+ *
+ * curried(1, 2)(3);
+ * // => 6
+ *
+ * curried(1, 2, 3);
+ * // => 6
+ */
+ function curry(func, arity) {
+ arity = typeof arity == 'number' ? arity : (+arity || func.length);
+ return createWrapper(func, 4, null, null, null, arity);
+ }
+
+ /**
+ * Creates a function that will delay the execution of `func` until after
+ * `wait` milliseconds have elapsed since the last time it was invoked.
+ * Provide an options object to indicate that `func` should be invoked on
+ * the leading and/or trailing edge of the `wait` timeout. Subsequent calls
+ * to the debounced function will return the result of the last `func` call.
+ *
+ * Note: If `leading` and `trailing` options are `true` `func` will be called
+ * on the trailing edge of the timeout only if the the debounced function is
+ * invoked more than once during the `wait` timeout.
+ *
+ * @static
+ * @memberOf _
+ * @category Functions
+ * @param {Function} func The function to debounce.
+ * @param {number} wait The number of milliseconds to delay.
+ * @param {Object} [options] The options object.
+ * @param {boolean} [options.leading=false] Specify execution on the leading edge of the timeout.
+ * @param {number} [options.maxWait] The maximum time `func` is allowed to be delayed before it's called.
+ * @param {boolean} [options.trailing=true] Specify execution on the trailing edge of the timeout.
+ * @returns {Function} Returns the new debounced function.
+ * @example
+ *
+ * // avoid costly calculations while the window size is in flux
+ * var lazyLayout = _.debounce(calculateLayout, 150);
+ * jQuery(window).on('resize', lazyLayout);
+ *
+ * // execute `sendMail` when the click event is fired, debouncing subsequent calls
+ * jQuery('#postbox').on('click', _.debounce(sendMail, 300, {
+ * 'leading': true,
+ * 'trailing': false
+ * });
+ *
+ * // ensure `batchLog` is executed once after 1 second of debounced calls
+ * var source = new EventSource('/stream');
+ * source.addEventListener('message', _.debounce(batchLog, 250, {
+ * 'maxWait': 1000
+ * }, false);
+ */
+ function debounce(func, wait, options) {
+ var args,
+ maxTimeoutId,
+ result,
+ stamp,
+ thisArg,
+ timeoutId,
+ trailingCall,
+ lastCalled = 0,
+ maxWait = false,
+ trailing = true;
+
+ if (!isFunction(func)) {
+ throw new TypeError;
+ }
+ wait = nativeMax(0, wait) || 0;
+ if (options === true) {
+ var leading = true;
+ trailing = false;
+ } else if (isObject(options)) {
+ leading = options.leading;
+ maxWait = 'maxWait' in options && (nativeMax(wait, options.maxWait) || 0);
+ trailing = 'trailing' in options ? options.trailing : trailing;
+ }
+ var delayed = function() {
+ var remaining = wait - (now() - stamp);
+ if (remaining <= 0) {
+ if (maxTimeoutId) {
+ clearTimeout(maxTimeoutId);
+ }
+ var isCalled = trailingCall;
+ maxTimeoutId = timeoutId = trailingCall = undefined;
+ if (isCalled) {
+ lastCalled = now();
+ result = func.apply(thisArg, args);
+ if (!timeoutId && !maxTimeoutId) {
+ args = thisArg = null;
+ }
+ }
+ } else {
+ timeoutId = setTimeout(delayed, remaining);
+ }
+ };
+
+ var maxDelayed = function() {
+ if (timeoutId) {
+ clearTimeout(timeoutId);
+ }
+ maxTimeoutId = timeoutId = trailingCall = undefined;
+ if (trailing || (maxWait !== wait)) {
+ lastCalled = now();
+ result = func.apply(thisArg, args);
+ if (!timeoutId && !maxTimeoutId) {
+ args = thisArg = null;
+ }
+ }
+ };
+
+ return function() {
+ args = arguments;
+ stamp = now();
+ thisArg = this;
+ trailingCall = trailing && (timeoutId || !leading);
+
+ if (maxWait === false) {
+ var leadingCall = leading && !timeoutId;
+ } else {
+ if (!maxTimeoutId && !leading) {
+ lastCalled = stamp;
+ }
+ var remaining = maxWait - (stamp - lastCalled),
+ isCalled = remaining <= 0;
+
+ if (isCalled) {
+ if (maxTimeoutId) {
+ maxTimeoutId = clearTimeout(maxTimeoutId);
+ }
+ lastCalled = stamp;
+ result = func.apply(thisArg, args);
+ }
+ else if (!maxTimeoutId) {
+ maxTimeoutId = setTimeout(maxDelayed, remaining);
+ }
+ }
+ if (isCalled && timeoutId) {
+ timeoutId = clearTimeout(timeoutId);
+ }
+ else if (!timeoutId && wait !== maxWait) {
+ timeoutId = setTimeout(delayed, wait);
+ }
+ if (leadingCall) {
+ isCalled = true;
+ result = func.apply(thisArg, args);
+ }
+ if (isCalled && !timeoutId && !maxTimeoutId) {
+ args = thisArg = null;
+ }
+ return result;
+ };
+ }
+
+ /**
+ * Defers executing the `func` function until the current call stack has cleared.
+ * Additional arguments will be provided to `func` when it is invoked.
+ *
+ * @static
+ * @memberOf _
+ * @category Functions
+ * @param {Function} func The function to defer.
+ * @param {...*} [arg] Arguments to invoke the function with.
+ * @returns {number} Returns the timer id.
+ * @example
+ *
+ * _.defer(function(text) { console.log(text); }, 'deferred');
+ * // logs 'deferred' after one or more milliseconds
+ */
+ function defer(func) {
+ if (!isFunction(func)) {
+ throw new TypeError;
+ }
+ var args = slice(arguments, 1);
+ return setTimeout(function() { func.apply(undefined, args); }, 1);
+ }
+
+ /**
+ * Executes the `func` function after `wait` milliseconds. Additional arguments
+ * will be provided to `func` when it is invoked.
+ *
+ * @static
+ * @memberOf _
+ * @category Functions
+ * @param {Function} func The function to delay.
+ * @param {number} wait The number of milliseconds to delay execution.
+ * @param {...*} [arg] Arguments to invoke the function with.
+ * @returns {number} Returns the timer id.
+ * @example
+ *
+ * _.delay(function(text) { console.log(text); }, 1000, 'later');
+ * // => logs 'later' after one second
+ */
+ function delay(func, wait) {
+ if (!isFunction(func)) {
+ throw new TypeError;
+ }
+ var args = slice(arguments, 2);
+ return setTimeout(function() { func.apply(undefined, args); }, wait);
+ }
+
+ /**
+ * Creates a function that memoizes the result of `func`. If `resolver` is
+ * provided it will be used to determine the cache key for storing the result
+ * based on the arguments provided to the memoized function. By default, the
+ * first argument provided to the memoized function is used as the cache key.
+ * The `func` is executed with the `this` binding of the memoized function.
+ * The result cache is exposed as the `cache` property on the memoized function.
+ *
+ * @static
+ * @memberOf _
+ * @category Functions
+ * @param {Function} func The function to have its output memoized.
+ * @param {Function} [resolver] A function used to resolve the cache key.
+ * @returns {Function} Returns the new memoizing function.
+ * @example
+ *
+ * var fibonacci = _.memoize(function(n) {
+ * return n < 2 ? n : fibonacci(n - 1) + fibonacci(n - 2);
+ * });
+ *
+ * fibonacci(9)
+ * // => 34
+ *
+ * var data = {
+ * 'fred': { 'name': 'fred', 'age': 40 },
+ * 'pebbles': { 'name': 'pebbles', 'age': 1 }
+ * };
+ *
+ * // modifying the result cache
+ * var get = _.memoize(function(name) { return data[name]; }, _.identity);
+ * get('pebbles');
+ * // => { 'name': 'pebbles', 'age': 1 }
+ *
+ * get.cache.pebbles.name = 'penelope';
+ * get('pebbles');
+ * // => { 'name': 'penelope', 'age': 1 }
+ */
+ function memoize(func, resolver) {
+ if (!isFunction(func)) {
+ throw new TypeError;
+ }
+ var memoized = function() {
+ var cache = memoized.cache,
+ key = resolver ? resolver.apply(this, arguments) : keyPrefix + arguments[0];
+
+ return hasOwnProperty.call(cache, key)
+ ? cache[key]
+ : (cache[key] = func.apply(this, arguments));
+ }
+ memoized.cache = {};
+ return memoized;
+ }
+
+ /**
+ * Creates a function that is restricted to execute `func` once. Repeat calls to
+ * the function will return the value of the first call. The `func` is executed
+ * with the `this` binding of the created function.
+ *
+ * @static
+ * @memberOf _
+ * @category Functions
+ * @param {Function} func The function to restrict.
+ * @returns {Function} Returns the new restricted function.
+ * @example
+ *
+ * var initialize = _.once(createApplication);
+ * initialize();
+ * initialize();
+ * // `initialize` executes `createApplication` once
+ */
+ function once(func) {
+ var ran,
+ result;
+
+ if (!isFunction(func)) {
+ throw new TypeError;
+ }
+ return function() {
+ if (ran) {
+ return result;
+ }
+ ran = true;
+ result = func.apply(this, arguments);
+
+ // clear the `func` variable so the function may be garbage collected
+ func = null;
+ return result;
+ };
+ }
+
+ /**
+ * Creates a function that, when called, invokes `func` with any additional
+ * `partial` arguments prepended to those provided to the new function. This
+ * method is similar to `_.bind` except it does **not** alter the `this` binding.
+ *
+ * @static
+ * @memberOf _
+ * @category Functions
+ * @param {Function} func The function to partially apply arguments to.
+ * @param {...*} [arg] Arguments to be partially applied.
+ * @returns {Function} Returns the new partially applied function.
+ * @example
+ *
+ * var greet = function(greeting, name) { return greeting + ' ' + name; };
+ * var hi = _.partial(greet, 'hi');
+ * hi('fred');
+ * // => 'hi fred'
+ */
+ function partial(func) {
+ return createWrapper(func, 16, slice(arguments, 1));
+ }
+
+ /**
+ * This method is like `_.partial` except that `partial` arguments are
+ * appended to those provided to the new function.
+ *
+ * @static
+ * @memberOf _
+ * @category Functions
+ * @param {Function} func The function to partially apply arguments to.
+ * @param {...*} [arg] Arguments to be partially applied.
+ * @returns {Function} Returns the new partially applied function.
+ * @example
+ *
+ * var defaultsDeep = _.partialRight(_.merge, _.defaults);
+ *
+ * var options = {
+ * 'variable': 'data',
+ * 'imports': { 'jq': $ }
+ * };
+ *
+ * defaultsDeep(options, _.templateSettings);
+ *
+ * options.variable
+ * // => 'data'
+ *
+ * options.imports
+ * // => { '_': _, 'jq': $ }
+ */
+ function partialRight(func) {
+ return createWrapper(func, 32, null, slice(arguments, 1));
+ }
+
+ /**
+ * Creates a function that, when executed, will only call the `func` function
+ * at most once per every `wait` milliseconds. Provide an options object to
+ * indicate that `func` should be invoked on the leading and/or trailing edge
+ * of the `wait` timeout. Subsequent calls to the throttled function will
+ * return the result of the last `func` call.
+ *
+ * Note: If `leading` and `trailing` options are `true` `func` will be called
+ * on the trailing edge of the timeout only if the the throttled function is
+ * invoked more than once during the `wait` timeout.
+ *
+ * @static
+ * @memberOf _
+ * @category Functions
+ * @param {Function} func The function to throttle.
+ * @param {number} wait The number of milliseconds to throttle executions to.
+ * @param {Object} [options] The options object.
+ * @param {boolean} [options.leading=true] Specify execution on the leading edge of the timeout.
+ * @param {boolean} [options.trailing=true] Specify execution on the trailing edge of the timeout.
+ * @returns {Function} Returns the new throttled function.
+ * @example
+ *
+ * // avoid excessively updating the position while scrolling
+ * var throttled = _.throttle(updatePosition, 100);
+ * jQuery(window).on('scroll', throttled);
+ *
+ * // execute `renewToken` when the click event is fired, but not more than once every 5 minutes
+ * jQuery('.interactive').on('click', _.throttle(renewToken, 300000, {
+ * 'trailing': false
+ * }));
+ */
+ function throttle(func, wait, options) {
+ var leading = true,
+ trailing = true;
+
+ if (!isFunction(func)) {
+ throw new TypeError;
+ }
+ if (options === false) {
+ leading = false;
+ } else if (isObject(options)) {
+ leading = 'leading' in options ? options.leading : leading;
+ trailing = 'trailing' in options ? options.trailing : trailing;
+ }
+ debounceOptions.leading = leading;
+ debounceOptions.maxWait = wait;
+ debounceOptions.trailing = trailing;
+
+ return debounce(func, wait, debounceOptions);
+ }
+
+ /**
+ * Creates a function that provides `value` to the wrapper function as its
+ * first argument. Additional arguments provided to the function are appended
+ * to those provided to the wrapper function. The wrapper is executed with
+ * the `this` binding of the created function.
+ *
+ * @static
+ * @memberOf _
+ * @category Functions
+ * @param {*} value The value to wrap.
+ * @param {Function} wrapper The wrapper function.
+ * @returns {Function} Returns the new function.
+ * @example
+ *
+ * var p = _.wrap(_.escape, function(func, text) {
+ * return '' + func(text) + '
';
+ * });
+ *
+ * p('Fred, Wilma, & Pebbles');
+ * // => 'Fred, Wilma, & Pebbles
'
+ */
+ function wrap(value, wrapper) {
+ return createWrapper(wrapper, 16, [value]);
+ }
+
+ /*--------------------------------------------------------------------------*/
+
+ /**
+ * Creates a function that returns `value`.
+ *
+ * @static
+ * @memberOf _
+ * @category Utilities
+ * @param {*} value The value to return from the new function.
+ * @returns {Function} Returns the new function.
+ * @example
+ *
+ * var object = { 'name': 'fred' };
+ * var getter = _.constant(object);
+ * getter() === object;
+ * // => true
+ */
+ function constant(value) {
+ return function() {
+ return value;
+ };
+ }
+
+ /**
+ * Produces a callback bound to an optional `thisArg`. If `func` is a property
+ * name the created callback will return the property value for a given element.
+ * If `func` is an object the created callback will return `true` for elements
+ * that contain the equivalent object properties, otherwise it will return `false`.
+ *
+ * @static
+ * @memberOf _
+ * @category Utilities
+ * @param {*} [func=identity] The value to convert to a callback.
+ * @param {*} [thisArg] The `this` binding of the created callback.
+ * @param {number} [argCount] The number of arguments the callback accepts.
+ * @returns {Function} Returns a callback function.
+ * @example
+ *
+ * var characters = [
+ * { 'name': 'barney', 'age': 36 },
+ * { 'name': 'fred', 'age': 40 }
+ * ];
+ *
+ * // wrap to create custom callback shorthands
+ * _.createCallback = _.wrap(_.createCallback, function(func, callback, thisArg) {
+ * var match = /^(.+?)__([gl]t)(.+)$/.exec(callback);
+ * return !match ? func(callback, thisArg) : function(object) {
+ * return match[2] == 'gt' ? object[match[1]] > match[3] : object[match[1]] < match[3];
+ * };
+ * });
+ *
+ * _.filter(characters, 'age__gt38');
+ * // => [{ 'name': 'fred', 'age': 40 }]
+ */
+ function createCallback(func, thisArg, argCount) {
+ var type = typeof func;
+ if (func == null || type == 'function') {
+ return baseCreateCallback(func, thisArg, argCount);
+ }
+ // handle "_.pluck" style callback shorthands
+ if (type != 'object') {
+ return property(func);
+ }
+ var props = keys(func),
+ key = props[0],
+ a = func[key];
+
+ // handle "_.where" style callback shorthands
+ if (props.length == 1 && a === a && !isObject(a)) {
+ // fast path the common case of providing an object with a single
+ // property containing a primitive value
+ return function(object) {
+ var b = object[key];
+ return a === b && (a !== 0 || (1 / a == 1 / b));
+ };
+ }
+ return function(object) {
+ var length = props.length,
+ result = false;
+
+ while (length--) {
+ if (!(result = baseIsEqual(object[props[length]], func[props[length]], null, true))) {
+ break;
+ }
+ }
+ return result;
+ };
+ }
+
+ /**
+ * Converts the characters `&`, `<`, `>`, `"`, and `'` in `string` to their
+ * corresponding HTML entities.
+ *
+ * @static
+ * @memberOf _
+ * @category Utilities
+ * @param {string} string The string to escape.
+ * @returns {string} Returns the escaped string.
+ * @example
+ *
+ * _.escape('Fred, Wilma, & Pebbles');
+ * // => 'Fred, Wilma, & Pebbles'
+ */
+ function escape(string) {
+ return string == null ? '' : String(string).replace(reUnescapedHtml, escapeHtmlChar);
+ }
+
+ /**
+ * This method returns the first argument provided to it.
+ *
+ * @static
+ * @memberOf _
+ * @category Utilities
+ * @param {*} value Any value.
+ * @returns {*} Returns `value`.
+ * @example
+ *
+ * var object = { 'name': 'fred' };
+ * _.identity(object) === object;
+ * // => true
+ */
+ function identity(value) {
+ return value;
+ }
+
+ /**
+ * Adds function properties of a source object to the destination object.
+ * If `object` is a function methods will be added to its prototype as well.
+ *
+ * @static
+ * @memberOf _
+ * @category Utilities
+ * @param {Function|Object} [object=lodash] object The destination object.
+ * @param {Object} source The object of functions to add.
+ * @param {Object} [options] The options object.
+ * @param {boolean} [options.chain=true] Specify whether the functions added are chainable.
+ * @example
+ *
+ * function capitalize(string) {
+ * return string.charAt(0).toUpperCase() + string.slice(1).toLowerCase();
+ * }
+ *
+ * _.mixin({ 'capitalize': capitalize });
+ * _.capitalize('fred');
+ * // => 'Fred'
+ *
+ * _('fred').capitalize().value();
+ * // => 'Fred'
+ *
+ * _.mixin({ 'capitalize': capitalize }, { 'chain': false });
+ * _('fred').capitalize();
+ * // => 'Fred'
+ */
+ function mixin(object, source, options) {
+ var chain = true,
+ methodNames = source && functions(source);
+
+ if (!source || (!options && !methodNames.length)) {
+ if (options == null) {
+ options = source;
+ }
+ ctor = lodashWrapper;
+ source = object;
+ object = lodash;
+ methodNames = functions(source);
+ }
+ if (options === false) {
+ chain = false;
+ } else if (isObject(options) && 'chain' in options) {
+ chain = options.chain;
+ }
+ var ctor = object,
+ isFunc = isFunction(ctor);
+
+ forEach(methodNames, function(methodName) {
+ var func = object[methodName] = source[methodName];
+ if (isFunc) {
+ ctor.prototype[methodName] = function() {
+ var chainAll = this.__chain__,
+ value = this.__wrapped__,
+ args = [value];
+
+ push.apply(args, arguments);
+ var result = func.apply(object, args);
+ if (chain || chainAll) {
+ if (value === result && isObject(result)) {
+ return this;
+ }
+ result = new ctor(result);
+ result.__chain__ = chainAll;
+ }
+ return result;
+ };
+ }
+ });
+ }
+
+ /**
+ * Reverts the '_' variable to its previous value and returns a reference to
+ * the `lodash` function.
+ *
+ * @static
+ * @memberOf _
+ * @category Utilities
+ * @returns {Function} Returns the `lodash` function.
+ * @example
+ *
+ * var lodash = _.noConflict();
+ */
+ function noConflict() {
+ context._ = oldDash;
+ return this;
+ }
+
+ /**
+ * A no-operation function.
+ *
+ * @static
+ * @memberOf _
+ * @category Utilities
+ * @example
+ *
+ * var object = { 'name': 'fred' };
+ * _.noop(object) === undefined;
+ * // => true
+ */
+ function noop() {
+ // no operation performed
+ }
+
+ /**
+ * Gets the number of milliseconds that have elapsed since the Unix epoch
+ * (1 January 1970 00:00:00 UTC).
+ *
+ * @static
+ * @memberOf _
+ * @category Utilities
+ * @example
+ *
+ * var stamp = _.now();
+ * _.defer(function() { console.log(_.now() - stamp); });
+ * // => logs the number of milliseconds it took for the deferred function to be called
+ */
+ var now = isNative(now = Date.now) && now || function() {
+ return new Date().getTime();
+ };
+
+ /**
+ * Converts the given value into an integer of the specified radix.
+ * If `radix` is `undefined` or `0` a `radix` of `10` is used unless the
+ * `value` is a hexadecimal, in which case a `radix` of `16` is used.
+ *
+ * Note: This method avoids differences in native ES3 and ES5 `parseInt`
+ * implementations. See http://es5.github.io/#E.
+ *
+ * @static
+ * @memberOf _
+ * @category Utilities
+ * @param {string} value The value to parse.
+ * @param {number} [radix] The radix used to interpret the value to parse.
+ * @returns {number} Returns the new integer value.
+ * @example
+ *
+ * _.parseInt('08');
+ * // => 8
+ */
+ var parseInt = nativeParseInt(whitespace + '08') == 8 ? nativeParseInt : function(value, radix) {
+ // Firefox < 21 and Opera < 15 follow the ES3 specified implementation of `parseInt`
+ return nativeParseInt(isString(value) ? value.replace(reLeadingSpacesAndZeros, '') : value, radix || 0);
+ };
+
+ /**
+ * Creates a "_.pluck" style function, which returns the `key` value of a
+ * given object.
+ *
+ * @static
+ * @memberOf _
+ * @category Utilities
+ * @param {string} key The name of the property to retrieve.
+ * @returns {Function} Returns the new function.
+ * @example
+ *
+ * var characters = [
+ * { 'name': 'fred', 'age': 40 },
+ * { 'name': 'barney', 'age': 36 }
+ * ];
+ *
+ * var getName = _.property('name');
+ *
+ * _.map(characters, getName);
+ * // => ['barney', 'fred']
+ *
+ * _.sortBy(characters, getName);
+ * // => [{ 'name': 'barney', 'age': 36 }, { 'name': 'fred', 'age': 40 }]
+ */
+ function property(key) {
+ return function(object) {
+ return object[key];
+ };
+ }
+
+ /**
+ * Produces a random number between `min` and `max` (inclusive). If only one
+ * argument is provided a number between `0` and the given number will be
+ * returned. If `floating` is truey or either `min` or `max` are floats a
+ * floating-point number will be returned instead of an integer.
+ *
+ * @static
+ * @memberOf _
+ * @category Utilities
+ * @param {number} [min=0] The minimum possible value.
+ * @param {number} [max=1] The maximum possible value.
+ * @param {boolean} [floating=false] Specify returning a floating-point number.
+ * @returns {number} Returns a random number.
+ * @example
+ *
+ * _.random(0, 5);
+ * // => an integer between 0 and 5
+ *
+ * _.random(5);
+ * // => also an integer between 0 and 5
+ *
+ * _.random(5, true);
+ * // => a floating-point number between 0 and 5
+ *
+ * _.random(1.2, 5.2);
+ * // => a floating-point number between 1.2 and 5.2
+ */
+ function random(min, max, floating) {
+ var noMin = min == null,
+ noMax = max == null;
+
+ if (floating == null) {
+ if (typeof min == 'boolean' && noMax) {
+ floating = min;
+ min = 1;
+ }
+ else if (!noMax && typeof max == 'boolean') {
+ floating = max;
+ noMax = true;
+ }
+ }
+ if (noMin && noMax) {
+ max = 1;
+ }
+ min = +min || 0;
+ if (noMax) {
+ max = min;
+ min = 0;
+ } else {
+ max = +max || 0;
+ }
+ if (floating || min % 1 || max % 1) {
+ var rand = nativeRandom();
+ return nativeMin(min + (rand * (max - min + parseFloat('1e-' + ((rand +'').length - 1)))), max);
+ }
+ return baseRandom(min, max);
+ }
+
+ /**
+ * Resolves the value of property `key` on `object`. If `key` is a function
+ * it will be invoked with the `this` binding of `object` and its result returned,
+ * else the property value is returned. If `object` is falsey then `undefined`
+ * is returned.
+ *
+ * @static
+ * @memberOf _
+ * @category Utilities
+ * @param {Object} object The object to inspect.
+ * @param {string} key The name of the property to resolve.
+ * @returns {*} Returns the resolved value.
+ * @example
+ *
+ * var object = {
+ * 'cheese': 'crumpets',
+ * 'stuff': function() {
+ * return 'nonsense';
+ * }
+ * };
+ *
+ * _.result(object, 'cheese');
+ * // => 'crumpets'
+ *
+ * _.result(object, 'stuff');
+ * // => 'nonsense'
+ */
+ function result(object, key) {
+ if (object) {
+ var value = object[key];
+ return isFunction(value) ? object[key]() : value;
+ }
+ }
+
+ /**
+ * A micro-templating method that handles arbitrary delimiters, preserves
+ * whitespace, and correctly escapes quotes within interpolated code.
+ *
+ * Note: In the development build, `_.template` utilizes sourceURLs for easier
+ * debugging. See http://www.html5rocks.com/en/tutorials/developertools/sourcemaps/#toc-sourceurl
+ *
+ * For more information on precompiling templates see:
+ * http://lodash.com/custom-builds
+ *
+ * For more information on Chrome extension sandboxes see:
+ * http://developer.chrome.com/stable/extensions/sandboxingEval.html
+ *
+ * @static
+ * @memberOf _
+ * @category Utilities
+ * @param {string} text The template text.
+ * @param {Object} data The data object used to populate the text.
+ * @param {Object} [options] The options object.
+ * @param {RegExp} [options.escape] The "escape" delimiter.
+ * @param {RegExp} [options.evaluate] The "evaluate" delimiter.
+ * @param {Object} [options.imports] An object to import into the template as local variables.
+ * @param {RegExp} [options.interpolate] The "interpolate" delimiter.
+ * @param {string} [sourceURL] The sourceURL of the template's compiled source.
+ * @param {string} [variable] The data object variable name.
+ * @returns {Function|string} Returns a compiled function when no `data` object
+ * is given, else it returns the interpolated text.
+ * @example
+ *
+ * // using the "interpolate" delimiter to create a compiled template
+ * var compiled = _.template('hello <%= name %>');
+ * compiled({ 'name': 'fred' });
+ * // => 'hello fred'
+ *
+ * // using the "escape" delimiter to escape HTML in data property values
+ * _.template('<%- value %> ', { 'value': '').stripTags()
+=> 'a linkalert("hello world!")'
+```
+
+**toSentence** _.toSentence(array, [delimiter, lastDelimiter])
+
+Join an array into a human readable sentence.
+
+```javascript
+_.toSentence(['jQuery', 'Mootools', 'Prototype'])
+=> 'jQuery, Mootools and Prototype';
+
+_.toSentence(['jQuery', 'Mootools', 'Prototype'], ', ', ' unt ')
+=> 'jQuery, Mootools unt Prototype';
+```
+
+**toSentenceSerial** _.toSentenceSerial(array, [delimiter, lastDelimiter])
+
+The same as `toSentence`, but adjusts delimeters to use [Serial comma](http://en.wikipedia.org/wiki/Serial_comma).
+
+```javascript
+_.toSentenceSerial(['jQuery', 'Mootools'])
+=> 'jQuery and Mootools';
+
+_.toSentenceSerial(['jQuery', 'Mootools', 'Prototype'])
+=> 'jQuery, Mootools, and Prototype'
+
+_.toSentenceSerial(['jQuery', 'Mootools', 'Prototype'], ', ', ' unt ');
+=> 'jQuery, Mootools, unt Prototype';
+```
+
+**repeat** _.repeat(string, count, [separator])
+
+Repeats a string count times.
+
+```javascript
+_.repeat("foo", 3)
+=> 'foofoofoo';
+
+_.repeat("foo", 3, "bar")
+=> 'foobarfoobarfoo'
+```
+
+**surround** _.surround(string, wrap)
+
+Surround a string with another string.
+
+```javascript
+_.surround("foo", "ab")
+=> 'abfooab';
+```
+
+**quote** _.quote(string, quoteChar) or _.q(string, quoteChar)
+
+Quotes a string. `quoteChar` defaults to `"`.
+
+```javascript
+_.quote('foo', quoteChar)
+=> '"foo"';
+```
+**unquote** _.unquote(string, quoteChar)
+
+Unquotes a string. `quoteChar` defaults to `"`.
+
+```javascript
+_.unquote('"foo"')
+=> 'foo';
+_.unquote("'foo'", "'")
+=> 'foo';
+```
+
+
+**slugify** _.slugify(string)
+
+Transform text into a URL slug. Replaces whitespaces, accentuated, and special characters with a dash.
+
+```javascript
+_.slugify("Un éléphant à l'orée du bois")
+=> 'un-elephant-a-loree-du-bois';
+```
+
+***Caution: this function is charset dependent***
+
+**naturalCmp** array.sort(_.naturalCmp)
+
+Naturally sort strings like humans would do.
+
+```javascript
+['foo20', 'foo5'].sort(_.naturalCmp)
+=> [ 'foo5', 'foo20' ]
+```
+
+**toBoolean** _.toBoolean(string) or _.toBool(string)
+
+Turn strings that can be commonly considered as booleas to real booleans. Such as "true", "false", "1" and "0". This function is case insensitive.
+
+```javascript
+_.toBoolean("true")
+=> true
+_.toBoolean("FALSE")
+=> false
+_.toBoolean("random")
+=> undefined
+```
+
+It can be customized by giving arrays of truth and falsy value matcher as parameters. Matchers can be also RegExp objects.
+
+```javascript
+_.toBoolean("truthy", ["truthy"], ["falsy"])
+=> true
+_.toBoolean("true only at start", [/^true/])
+=> true
+```
+
+## Roadmap ##
+
+Any suggestions or bug reports are welcome. Just email me or more preferably open an issue.
+
+#### Problems
+
+We lose two things for `include` and `reverse` methods from `_.string`:
+
+* Calls like `_('foobar').include('bar')` aren't available;
+* Chaining isn't available too.
+
+But if you need this functionality you can create aliases for conflict functions which will be convenient for you:
+
+```javascript
+_.mixin({
+ includeString: _.str.include,
+ reverseString: _.str.reverse
+})
+
+// Now wrapper calls and chaining are available.
+_('foobar').chain().reverseString().includeString('rab').value()
+```
+
+#### Standalone Usage
+
+If you are using Underscore.string without Underscore. You also have `_.string` namespace for it and `_.str` alias
+But of course you can just reassign `_` variable with `_.string`
+
+```javascript
+_ = _.string
+```
+
+## Changelog ##
+
+### 2.3.3 ###
+
+* Add `toBoolean`
+* Add `unquote`
+* Add quote char option to `quote`
+* Support dash-separated words in `titleize`
+
+### 2.3.2 ###
+
+* Add `naturalCmp`
+* Bug fix to `camelize`
+* Add ă, ș, ț and ś to `slugify`
+* Doc updates
+* Add support for [component](http://component.io/)
+* [Full changelog](https://github.com/epeli/underscore.string/compare/v2.3.1...v2.3.2)
+
+### 2.3.1 ###
+
+* Bug fixes to `escapeHTML`, `classify`, `substr`
+* Faster `count`
+* Documentation fixes
+* [Full changelog](https://github.com/epeli/underscore.string/compare/v2.3.0...v2.3.1)
+
+### 2.3.0 ###
+
+* Added `numberformat` method
+* Added `levenshtein` method (Levenshtein distance calculation)
+* Added `swapCase` method
+* Changed default behavior of `words` method
+* Added `toSentenceSerial` method
+* Added `surround` and `quote` methods
+
+### 2.2.1 ###
+
+* Same as 2.2.0 (2.2.0rc on npm) to fix some npm drama
+
+### 2.2.0 ###
+
+* Capitalize method behavior changed
+* Various perfomance tweaks
+
+### 2.1.1###
+
+* Fixed words method bug
+* Added classify method
+
+### 2.1.0 ###
+
+* AMD support
+* Added toSentence method
+* Added slugify method
+* Lots of speed optimizations
+
+### 2.0.0 ###
+
+* Added prune, humanize functions
+* Added _.string (_.str) namespace for Underscore.string library
+* Removed includes function
+
+For upgrading to this version you need to mix in Underscore.string library to Underscore object:
+
+```javascript
+_.mixin(_.string.exports());
+```
+
+and all non-conflict Underscore.string functions will be available through Underscore object.
+Also function `includes` has been removed, you should replace this function by `_.str.include`
+or create alias `_.includes = _.str.include` and all your code will work fine.
+
+### 1.1.6 ###
+
+* Fixed reverse and truncate
+* Added isBlank, stripTags, inlude(alias for includes)
+* Added uglifier compression
+
+### 1.1.5 ###
+
+* Added strRight, strRightBack, strLeft, strLeftBack
+
+### 1.1.4 ###
+
+* Added pad, lpad, rpad, lrpad methods and aliases center, ljust, rjust
+* Integration with Underscore 1.1.6
+
+### 1.1.3 ###
+
+* Added methods: underscored, camelize, dasherize
+* Support newer version of npm
+
+### 1.1.2 ###
+
+* Created functions: lines, chars, words functions
+
+### 1.0.2 ###
+
+* Created integration test suite with underscore.js 1.1.4 (now it's absolutely compatible)
+* Removed 'reverse' function, because this function override underscore.js 'reverse'
+
+## Contribute ##
+
+* Fork & pull request. Don't forget about tests.
+* If you planning add some feature please create issue before.
+
+Otherwise changes will be rejected.
+
+## Contributors list ##
+[Can be found here](https://github.com/epeli/underscore.string/graphs/contributors).
+
+
+## Licence ##
+
+The MIT License
+
+Copyright (c) 2011 Esa-Matti Suuronen esa-matti@suuronen.org
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
diff --git a/node_modules/grunt/node_modules/grunt-legacy-log/node_modules/underscore.string/Rakefile b/node_modules/grunt/node_modules/grunt-legacy-log/node_modules/underscore.string/Rakefile
new file mode 100644
index 0000000..2cd9eed
--- /dev/null
+++ b/node_modules/grunt/node_modules/grunt-legacy-log/node_modules/underscore.string/Rakefile
@@ -0,0 +1,23 @@
+# encoding: utf-8
+task default: :test
+
+desc 'Use UglifyJS to compress Underscore.string'
+task :build do
+ require 'uglifier'
+ source = File.read('lib/underscore.string.js', :encoding => 'utf-8')
+ compressed = Uglifier.compile(source, copyright: false)
+ File.open('dist/underscore.string.min.js', 'w'){ |f| f.write compressed }
+ compression_rate = compressed.length.to_f/source.length
+ puts "compressed dist/underscore.string.min.js: #{compressed.length}/#{source.length} #{(compression_rate * 100).round}%"
+end
+
+desc 'Run tests'
+task :test do
+ puts "Running underscore.string test suite."
+ result1 = system %{phantomjs ./test/run-qunit.js "test/test.html"}
+
+ puts "Running Underscore test suite."
+ result2 = system %{phantomjs ./test/run-qunit.js "test/test_underscore/index.html"}
+
+ exit(result1 && result2 ? 0 : 1)
+end
diff --git a/node_modules/grunt/node_modules/grunt-legacy-log/node_modules/underscore.string/component.json b/node_modules/grunt/node_modules/grunt-legacy-log/node_modules/underscore.string/component.json
new file mode 100644
index 0000000..ae91b65
--- /dev/null
+++ b/node_modules/grunt/node_modules/grunt-legacy-log/node_modules/underscore.string/component.json
@@ -0,0 +1,11 @@
+{
+ "name": "underscore.string",
+ "repo": "epeli/underscore.string",
+ "description": "String manipulation extensions for Underscore.js javascript library",
+ "version": "2.3.3",
+ "keywords": ["underscore", "string"],
+ "dependencies": {},
+ "development": {},
+ "main": "lib/underscore.string.js",
+ "scripts": ["lib/underscore.string.js"]
+}
diff --git a/node_modules/grunt/node_modules/grunt-legacy-log/node_modules/underscore.string/dist/underscore.string.min.js b/node_modules/grunt/node_modules/grunt-legacy-log/node_modules/underscore.string/dist/underscore.string.min.js
new file mode 100644
index 0000000..4f6b2b9
--- /dev/null
+++ b/node_modules/grunt/node_modules/grunt-legacy-log/node_modules/underscore.string/dist/underscore.string.min.js
@@ -0,0 +1 @@
+!function(e,n){"use strict";function r(e,n){var r,t,u=e.toLowerCase();for(n=[].concat(n),r=0;n.length>r;r+=1)if(t=n[r]){if(t.test&&t.test(e))return!0;if(t.toLowerCase()===u)return!0}}var t=n.prototype.trim,u=n.prototype.trimRight,i=n.prototype.trimLeft,l=function(e){return 1*e||0},o=function(e,n){if(1>n)return"";for(var r="";n>0;)1&n&&(r+=e),n>>=1,e+=e;return r},a=[].slice,c=function(e){return null==e?"\\s":e.source?e.source:"["+g.escapeRegExp(e)+"]"},s={lt:"<",gt:">",quot:'"',amp:"&",apos:"'"},f={};for(var p in s)f[s[p]]=p;f["'"]="#39";var h=function(){function e(e){return Object.prototype.toString.call(e).slice(8,-1).toLowerCase()}var r=o,t=function(){return t.cache.hasOwnProperty(arguments[0])||(t.cache[arguments[0]]=t.parse(arguments[0])),t.format.call(null,t.cache[arguments[0]],arguments)};return t.format=function(t,u){var i,l,o,a,c,s,f,p=1,g=t.length,d="",m=[];for(l=0;g>l;l++)if(d=e(t[l]),"string"===d)m.push(t[l]);else if("array"===d){if(a=t[l],a[2])for(i=u[p],o=0;a[2].length>o;o++){if(!i.hasOwnProperty(a[2][o]))throw new Error(h('[_.sprintf] property "%s" does not exist',a[2][o]));i=i[a[2][o]]}else i=a[1]?u[a[1]]:u[p++];if(/[^s]/.test(a[8])&&"number"!=e(i))throw new Error(h("[_.sprintf] expecting number but found %s",e(i)));switch(a[8]){case"b":i=i.toString(2);break;case"c":i=n.fromCharCode(i);break;case"d":i=parseInt(i,10);break;case"e":i=a[7]?i.toExponential(a[7]):i.toExponential();break;case"f":i=a[7]?parseFloat(i).toFixed(a[7]):parseFloat(i);break;case"o":i=i.toString(8);break;case"s":i=(i=n(i))&&a[7]?i.substring(0,a[7]):i;break;case"u":i=Math.abs(i);break;case"x":i=i.toString(16);break;case"X":i=i.toString(16).toUpperCase()}i=/[def]/.test(a[8])&&a[3]&&i>=0?"+"+i:i,s=a[4]?"0"==a[4]?"0":a[4].charAt(1):" ",f=a[6]-n(i).length,c=a[6]?r(s,f):"",m.push(a[5]?i+c:c+i)}return m.join("")},t.cache={},t.parse=function(e){for(var n=e,r=[],t=[],u=0;n;){if(null!==(r=/^[^\x25]+/.exec(n)))t.push(r[0]);else if(null!==(r=/^\x25{2}/.exec(n)))t.push("%");else{if(null===(r=/^\x25(?:([1-9]\d*)\$|\(([^\)]+)\))?(\+)?(0|'[^$])?(-)?(\d+)?(?:\.(\d+))?([b-fosuxX])/.exec(n)))throw new Error("[_.sprintf] huh?");if(r[2]){u|=1;var i=[],l=r[2],o=[];if(null===(o=/^([a-z_][a-z_\d]*)/i.exec(l)))throw new Error("[_.sprintf] huh?");for(i.push(o[1]);""!==(l=l.substring(o[0].length));)if(null!==(o=/^\.([a-z_][a-z_\d]*)/i.exec(l)))i.push(o[1]);else{if(null===(o=/^\[(\d+)\]/.exec(l)))throw new Error("[_.sprintf] huh?");i.push(o[1])}r[2]=i}else u|=2;if(3===u)throw new Error("[_.sprintf] mixing positional and named placeholders is not (yet) supported");t.push(r)}n=n.substring(r[0].length)}return t},t}(),g={VERSION:"2.3.0",isBlank:function(e){return null==e&&(e=""),/^\s*$/.test(e)},stripTags:function(e){return null==e?"":n(e).replace(/<\/?[^>]+>/g,"")},capitalize:function(e){return e=null==e?"":n(e),e.charAt(0).toUpperCase()+e.slice(1)},chop:function(e,r){return null==e?[]:(e=n(e),r=~~r,r>0?e.match(new RegExp(".{1,"+r+"}","g")):[e])},clean:function(e){return g.strip(e).replace(/\s+/g," ")},count:function(e,r){if(null==e||null==r)return 0;e=n(e),r=n(r);for(var t=0,u=0,i=r.length;;){if(u=e.indexOf(r,u),-1===u)break;t++,u+=i}return t},chars:function(e){return null==e?[]:n(e).split("")},swapCase:function(e){return null==e?"":n(e).replace(/\S/g,function(e){return e===e.toUpperCase()?e.toLowerCase():e.toUpperCase()})},escapeHTML:function(e){return null==e?"":n(e).replace(/[&<>"']/g,function(e){return"&"+f[e]+";"})},unescapeHTML:function(e){return null==e?"":n(e).replace(/\&([^;]+);/g,function(e,r){var t;return r in s?s[r]:(t=r.match(/^#x([\da-fA-F]+)$/))?n.fromCharCode(parseInt(t[1],16)):(t=r.match(/^#(\d+)$/))?n.fromCharCode(~~t[1]):e})},escapeRegExp:function(e){return null==e?"":n(e).replace(/([.*+?^=!:${}()|[\]\/\\])/g,"\\$1")},splice:function(e,n,r,t){var u=g.chars(e);return u.splice(~~n,~~r,t),u.join("")},insert:function(e,n,r){return g.splice(e,n,0,r)},include:function(e,r){return""===r?!0:null==e?!1:-1!==n(e).indexOf(r)},join:function(){var e=a.call(arguments),n=e.shift();return null==n&&(n=""),e.join(n)},lines:function(e){return null==e?[]:n(e).split("\n")},reverse:function(e){return g.chars(e).reverse().join("")},startsWith:function(e,r){return""===r?!0:null==e||null==r?!1:(e=n(e),r=n(r),e.length>=r.length&&e.slice(0,r.length)===r)},endsWith:function(e,r){return""===r?!0:null==e||null==r?!1:(e=n(e),r=n(r),e.length>=r.length&&e.slice(e.length-r.length)===r)},succ:function(e){return null==e?"":(e=n(e),e.slice(0,-1)+n.fromCharCode(e.charCodeAt(e.length-1)+1))},titleize:function(e){return null==e?"":(e=n(e).toLowerCase(),e.replace(/(?:^|\s|-)\S/g,function(e){return e.toUpperCase()}))},camelize:function(e){return g.trim(e).replace(/[-_\s]+(.)?/g,function(e,n){return n?n.toUpperCase():""})},underscored:function(e){return g.trim(e).replace(/([a-z\d])([A-Z]+)/g,"$1_$2").replace(/[-\s]+/g,"_").toLowerCase()},dasherize:function(e){return g.trim(e).replace(/([A-Z])/g,"-$1").replace(/[-_\s]+/g,"-").toLowerCase()},classify:function(e){return g.titleize(n(e).replace(/[\W_]/g," ")).replace(/\s/g,"")},humanize:function(e){return g.capitalize(g.underscored(e).replace(/_id$/,"").replace(/_/g," "))},trim:function(e,r){return null==e?"":!r&&t?t.call(e):(r=c(r),n(e).replace(new RegExp("^"+r+"+|"+r+"+$","g"),""))},ltrim:function(e,r){return null==e?"":!r&&i?i.call(e):(r=c(r),n(e).replace(new RegExp("^"+r+"+"),""))},rtrim:function(e,r){return null==e?"":!r&&u?u.call(e):(r=c(r),n(e).replace(new RegExp(r+"+$"),""))},truncate:function(e,r,t){return null==e?"":(e=n(e),t=t||"...",r=~~r,e.length>r?e.slice(0,r)+t:e)},prune:function(e,r,t){if(null==e)return"";if(e=n(e),r=~~r,t=null!=t?n(t):"...",r>=e.length)return e;var u=function(e){return e.toUpperCase()!==e.toLowerCase()?"A":" "},i=e.slice(0,r+1).replace(/.(?=\W*\w*$)/g,u);return i=i.slice(i.length-2).match(/\w\w/)?i.replace(/\s*\S+$/,""):g.rtrim(i.slice(0,i.length-1)),(i+t).length>e.length?e:e.slice(0,i.length)+t},words:function(e,n){return g.isBlank(e)?[]:g.trim(e,n).split(n||/\s+/)},pad:function(e,r,t,u){e=null==e?"":n(e),r=~~r;var i=0;switch(t?t.length>1&&(t=t.charAt(0)):t=" ",u){case"right":return i=r-e.length,e+o(t,i);case"both":return i=r-e.length,o(t,Math.ceil(i/2))+e+o(t,Math.floor(i/2));default:return i=r-e.length,o(t,i)+e}},lpad:function(e,n,r){return g.pad(e,n,r)},rpad:function(e,n,r){return g.pad(e,n,r,"right")},lrpad:function(e,n,r){return g.pad(e,n,r,"both")},sprintf:h,vsprintf:function(e,n){return n.unshift(e),h.apply(null,n)},toNumber:function(e,n){return e?(e=g.trim(e),e.match(/^-?\d+(?:\.\d+)?$/)?l(l(e).toFixed(~~n)):0/0):0},numberFormat:function(e,n,r,t){if(isNaN(e)||null==e)return"";e=e.toFixed(~~n),t="string"==typeof t?t:",";var u=e.split("."),i=u[0],l=u[1]?(r||".")+u[1]:"";return i.replace(/(\d)(?=(?:\d{3})+$)/g,"$1"+t)+l},strRight:function(e,r){if(null==e)return"";e=n(e),r=null!=r?n(r):r;var t=r?e.indexOf(r):-1;return~t?e.slice(t+r.length,e.length):e},strRightBack:function(e,r){if(null==e)return"";e=n(e),r=null!=r?n(r):r;var t=r?e.lastIndexOf(r):-1;return~t?e.slice(t+r.length,e.length):e},strLeft:function(e,r){if(null==e)return"";e=n(e),r=null!=r?n(r):r;var t=r?e.indexOf(r):-1;return~t?e.slice(0,t):e},strLeftBack:function(e,n){if(null==e)return"";e+="",n=null!=n?""+n:n;var r=e.lastIndexOf(n);return~r?e.slice(0,r):e},toSentence:function(e,n,r,t){n=n||", ",r=r||" and ";var u=e.slice(),i=u.pop();return e.length>2&&t&&(r=g.rtrim(n)+r),u.length?u.join(n)+r+i:i},toSentenceSerial:function(){var e=a.call(arguments);return e[3]=!0,g.toSentence.apply(g,e)},slugify:function(e){if(null==e)return"";var r="ąàáäâãåæăćęèéëêìíïîłńòóöôõøśșțùúüûñçżź",t="aaaaaaaaaceeeeeiiiilnoooooosstuuuunczz",u=new RegExp(c(r),"g");return e=n(e).toLowerCase().replace(u,function(e){var n=r.indexOf(e);return t.charAt(n)||"-"}),g.dasherize(e.replace(/[^\w\s-]/g,""))},surround:function(e,n){return[n,e,n].join("")},quote:function(e,n){return g.surround(e,n||'"')},unquote:function(e,n){return n=n||'"',e[0]===n&&e[e.length-1]===n?e.slice(1,e.length-1):e},exports:function(){var e={};for(var n in this)this.hasOwnProperty(n)&&!n.match(/^(?:include|contains|reverse)$/)&&(e[n]=this[n]);return e},repeat:function(e,r,t){if(null==e)return"";if(r=~~r,null==t)return o(n(e),r);for(var u=[];r>0;u[--r]=e);return u.join(t)},naturalCmp:function(e,r){if(e==r)return 0;if(!e)return-1;if(!r)return 1;for(var t=/(\.\d+)|(\d+)|(\D+)/g,u=n(e).toLowerCase().match(t),i=n(r).toLowerCase().match(t),l=Math.min(u.length,i.length),o=0;l>o;o++){var a=u[o],c=i[o];if(a!==c){var s=parseInt(a,10);if(!isNaN(s)){var f=parseInt(c,10);if(!isNaN(f)&&s-f)return s-f}return c>a?-1:1}}return u.length===i.length?u.length-i.length:r>e?-1:1},levenshtein:function(e,r){if(null==e&&null==r)return 0;if(null==e)return n(r).length;if(null==r)return n(e).length;e=n(e),r=n(r);for(var t,u,i=[],l=0;r.length>=l;l++)for(var o=0;e.length>=o;o++)u=l&&o?e.charAt(o-1)===r.charAt(l-1)?t:Math.min(i[o],i[o-1],t)+1:l+o,t=i[o],i[o]=u;return i.pop()},toBoolean:function(e,n,t){return"number"==typeof e&&(e=""+e),"string"!=typeof e?!!e:(e=g.trim(e),r(e,n||["true","1"])?!0:r(e,t||["false","0"])?!1:void 0)}};g.strip=g.trim,g.lstrip=g.ltrim,g.rstrip=g.rtrim,g.center=g.lrpad,g.rjust=g.lpad,g.ljust=g.rpad,g.contains=g.include,g.q=g.quote,g.toBool=g.toBoolean,"undefined"!=typeof exports&&("undefined"!=typeof module&&module.exports&&(module.exports=g),exports._s=g),"function"==typeof define&&define.amd&&define("underscore.string",[],function(){return g}),e._=e._||{},e._.string=e._.str=g}(this,String);
\ No newline at end of file
diff --git a/node_modules/grunt/node_modules/grunt-legacy-log/node_modules/underscore.string/lib/underscore.string.js b/node_modules/grunt/node_modules/grunt-legacy-log/node_modules/underscore.string/lib/underscore.string.js
new file mode 100644
index 0000000..8761117
--- /dev/null
+++ b/node_modules/grunt/node_modules/grunt-legacy-log/node_modules/underscore.string/lib/underscore.string.js
@@ -0,0 +1,673 @@
+// Underscore.string
+// (c) 2010 Esa-Matti Suuronen
+// Underscore.string is freely distributable under the terms of the MIT license.
+// Documentation: https://github.com/epeli/underscore.string
+// Some code is borrowed from MooTools and Alexandru Marasteanu.
+// Version '2.3.2'
+
+!function(root, String){
+ 'use strict';
+
+ // Defining helper functions.
+
+ var nativeTrim = String.prototype.trim;
+ var nativeTrimRight = String.prototype.trimRight;
+ var nativeTrimLeft = String.prototype.trimLeft;
+
+ var parseNumber = function(source) { return source * 1 || 0; };
+
+ var strRepeat = function(str, qty){
+ if (qty < 1) return '';
+ var result = '';
+ while (qty > 0) {
+ if (qty & 1) result += str;
+ qty >>= 1, str += str;
+ }
+ return result;
+ };
+
+ var slice = [].slice;
+
+ var defaultToWhiteSpace = function(characters) {
+ if (characters == null)
+ return '\\s';
+ else if (characters.source)
+ return characters.source;
+ else
+ return '[' + _s.escapeRegExp(characters) + ']';
+ };
+
+ // Helper for toBoolean
+ function boolMatch(s, matchers) {
+ var i, matcher, down = s.toLowerCase();
+ matchers = [].concat(matchers);
+ for (i = 0; i < matchers.length; i += 1) {
+ matcher = matchers[i];
+ if (!matcher) continue;
+ if (matcher.test && matcher.test(s)) return true;
+ if (matcher.toLowerCase() === down) return true;
+ }
+ }
+
+ var escapeChars = {
+ lt: '<',
+ gt: '>',
+ quot: '"',
+ amp: '&',
+ apos: "'"
+ };
+
+ var reversedEscapeChars = {};
+ for(var key in escapeChars) reversedEscapeChars[escapeChars[key]] = key;
+ reversedEscapeChars["'"] = '#39';
+
+ // sprintf() for JavaScript 0.7-beta1
+ // http://www.diveintojavascript.com/projects/javascript-sprintf
+ //
+ // Copyright (c) Alexandru Marasteanu
+ // All rights reserved.
+
+ var sprintf = (function() {
+ function get_type(variable) {
+ return Object.prototype.toString.call(variable).slice(8, -1).toLowerCase();
+ }
+
+ var str_repeat = strRepeat;
+
+ var str_format = function() {
+ if (!str_format.cache.hasOwnProperty(arguments[0])) {
+ str_format.cache[arguments[0]] = str_format.parse(arguments[0]);
+ }
+ return str_format.format.call(null, str_format.cache[arguments[0]], arguments);
+ };
+
+ str_format.format = function(parse_tree, argv) {
+ var cursor = 1, tree_length = parse_tree.length, node_type = '', arg, output = [], i, k, match, pad, pad_character, pad_length;
+ for (i = 0; i < tree_length; i++) {
+ node_type = get_type(parse_tree[i]);
+ if (node_type === 'string') {
+ output.push(parse_tree[i]);
+ }
+ else if (node_type === 'array') {
+ match = parse_tree[i]; // convenience purposes only
+ if (match[2]) { // keyword argument
+ arg = argv[cursor];
+ for (k = 0; k < match[2].length; k++) {
+ if (!arg.hasOwnProperty(match[2][k])) {
+ throw new Error(sprintf('[_.sprintf] property "%s" does not exist', match[2][k]));
+ }
+ arg = arg[match[2][k]];
+ }
+ } else if (match[1]) { // positional argument (explicit)
+ arg = argv[match[1]];
+ }
+ else { // positional argument (implicit)
+ arg = argv[cursor++];
+ }
+
+ if (/[^s]/.test(match[8]) && (get_type(arg) != 'number')) {
+ throw new Error(sprintf('[_.sprintf] expecting number but found %s', get_type(arg)));
+ }
+ switch (match[8]) {
+ case 'b': arg = arg.toString(2); break;
+ case 'c': arg = String.fromCharCode(arg); break;
+ case 'd': arg = parseInt(arg, 10); break;
+ case 'e': arg = match[7] ? arg.toExponential(match[7]) : arg.toExponential(); break;
+ case 'f': arg = match[7] ? parseFloat(arg).toFixed(match[7]) : parseFloat(arg); break;
+ case 'o': arg = arg.toString(8); break;
+ case 's': arg = ((arg = String(arg)) && match[7] ? arg.substring(0, match[7]) : arg); break;
+ case 'u': arg = Math.abs(arg); break;
+ case 'x': arg = arg.toString(16); break;
+ case 'X': arg = arg.toString(16).toUpperCase(); break;
+ }
+ arg = (/[def]/.test(match[8]) && match[3] && arg >= 0 ? '+'+ arg : arg);
+ pad_character = match[4] ? match[4] == '0' ? '0' : match[4].charAt(1) : ' ';
+ pad_length = match[6] - String(arg).length;
+ pad = match[6] ? str_repeat(pad_character, pad_length) : '';
+ output.push(match[5] ? arg + pad : pad + arg);
+ }
+ }
+ return output.join('');
+ };
+
+ str_format.cache = {};
+
+ str_format.parse = function(fmt) {
+ var _fmt = fmt, match = [], parse_tree = [], arg_names = 0;
+ while (_fmt) {
+ if ((match = /^[^\x25]+/.exec(_fmt)) !== null) {
+ parse_tree.push(match[0]);
+ }
+ else if ((match = /^\x25{2}/.exec(_fmt)) !== null) {
+ parse_tree.push('%');
+ }
+ else if ((match = /^\x25(?:([1-9]\d*)\$|\(([^\)]+)\))?(\+)?(0|'[^$])?(-)?(\d+)?(?:\.(\d+))?([b-fosuxX])/.exec(_fmt)) !== null) {
+ if (match[2]) {
+ arg_names |= 1;
+ var field_list = [], replacement_field = match[2], field_match = [];
+ if ((field_match = /^([a-z_][a-z_\d]*)/i.exec(replacement_field)) !== null) {
+ field_list.push(field_match[1]);
+ while ((replacement_field = replacement_field.substring(field_match[0].length)) !== '') {
+ if ((field_match = /^\.([a-z_][a-z_\d]*)/i.exec(replacement_field)) !== null) {
+ field_list.push(field_match[1]);
+ }
+ else if ((field_match = /^\[(\d+)\]/.exec(replacement_field)) !== null) {
+ field_list.push(field_match[1]);
+ }
+ else {
+ throw new Error('[_.sprintf] huh?');
+ }
+ }
+ }
+ else {
+ throw new Error('[_.sprintf] huh?');
+ }
+ match[2] = field_list;
+ }
+ else {
+ arg_names |= 2;
+ }
+ if (arg_names === 3) {
+ throw new Error('[_.sprintf] mixing positional and named placeholders is not (yet) supported');
+ }
+ parse_tree.push(match);
+ }
+ else {
+ throw new Error('[_.sprintf] huh?');
+ }
+ _fmt = _fmt.substring(match[0].length);
+ }
+ return parse_tree;
+ };
+
+ return str_format;
+ })();
+
+
+
+ // Defining underscore.string
+
+ var _s = {
+
+ VERSION: '2.3.0',
+
+ isBlank: function(str){
+ if (str == null) str = '';
+ return (/^\s*$/).test(str);
+ },
+
+ stripTags: function(str){
+ if (str == null) return '';
+ return String(str).replace(/<\/?[^>]+>/g, '');
+ },
+
+ capitalize : function(str){
+ str = str == null ? '' : String(str);
+ return str.charAt(0).toUpperCase() + str.slice(1);
+ },
+
+ chop: function(str, step){
+ if (str == null) return [];
+ str = String(str);
+ step = ~~step;
+ return step > 0 ? str.match(new RegExp('.{1,' + step + '}', 'g')) : [str];
+ },
+
+ clean: function(str){
+ return _s.strip(str).replace(/\s+/g, ' ');
+ },
+
+ count: function(str, substr){
+ if (str == null || substr == null) return 0;
+
+ str = String(str);
+ substr = String(substr);
+
+ var count = 0,
+ pos = 0,
+ length = substr.length;
+
+ while (true) {
+ pos = str.indexOf(substr, pos);
+ if (pos === -1) break;
+ count++;
+ pos += length;
+ }
+
+ return count;
+ },
+
+ chars: function(str) {
+ if (str == null) return [];
+ return String(str).split('');
+ },
+
+ swapCase: function(str) {
+ if (str == null) return '';
+ return String(str).replace(/\S/g, function(c){
+ return c === c.toUpperCase() ? c.toLowerCase() : c.toUpperCase();
+ });
+ },
+
+ escapeHTML: function(str) {
+ if (str == null) return '';
+ return String(str).replace(/[&<>"']/g, function(m){ return '&' + reversedEscapeChars[m] + ';'; });
+ },
+
+ unescapeHTML: function(str) {
+ if (str == null) return '';
+ return String(str).replace(/\&([^;]+);/g, function(entity, entityCode){
+ var match;
+
+ if (entityCode in escapeChars) {
+ return escapeChars[entityCode];
+ } else if (match = entityCode.match(/^#x([\da-fA-F]+)$/)) {
+ return String.fromCharCode(parseInt(match[1], 16));
+ } else if (match = entityCode.match(/^#(\d+)$/)) {
+ return String.fromCharCode(~~match[1]);
+ } else {
+ return entity;
+ }
+ });
+ },
+
+ escapeRegExp: function(str){
+ if (str == null) return '';
+ return String(str).replace(/([.*+?^=!:${}()|[\]\/\\])/g, '\\$1');
+ },
+
+ splice: function(str, i, howmany, substr){
+ var arr = _s.chars(str);
+ arr.splice(~~i, ~~howmany, substr);
+ return arr.join('');
+ },
+
+ insert: function(str, i, substr){
+ return _s.splice(str, i, 0, substr);
+ },
+
+ include: function(str, needle){
+ if (needle === '') return true;
+ if (str == null) return false;
+ return String(str).indexOf(needle) !== -1;
+ },
+
+ join: function() {
+ var args = slice.call(arguments),
+ separator = args.shift();
+
+ if (separator == null) separator = '';
+
+ return args.join(separator);
+ },
+
+ lines: function(str) {
+ if (str == null) return [];
+ return String(str).split("\n");
+ },
+
+ reverse: function(str){
+ return _s.chars(str).reverse().join('');
+ },
+
+ startsWith: function(str, starts){
+ if (starts === '') return true;
+ if (str == null || starts == null) return false;
+ str = String(str); starts = String(starts);
+ return str.length >= starts.length && str.slice(0, starts.length) === starts;
+ },
+
+ endsWith: function(str, ends){
+ if (ends === '') return true;
+ if (str == null || ends == null) return false;
+ str = String(str); ends = String(ends);
+ return str.length >= ends.length && str.slice(str.length - ends.length) === ends;
+ },
+
+ succ: function(str){
+ if (str == null) return '';
+ str = String(str);
+ return str.slice(0, -1) + String.fromCharCode(str.charCodeAt(str.length-1) + 1);
+ },
+
+ titleize: function(str){
+ if (str == null) return '';
+ str = String(str).toLowerCase();
+ return str.replace(/(?:^|\s|-)\S/g, function(c){ return c.toUpperCase(); });
+ },
+
+ camelize: function(str){
+ return _s.trim(str).replace(/[-_\s]+(.)?/g, function(match, c){ return c ? c.toUpperCase() : ""; });
+ },
+
+ underscored: function(str){
+ return _s.trim(str).replace(/([a-z\d])([A-Z]+)/g, '$1_$2').replace(/[-\s]+/g, '_').toLowerCase();
+ },
+
+ dasherize: function(str){
+ return _s.trim(str).replace(/([A-Z])/g, '-$1').replace(/[-_\s]+/g, '-').toLowerCase();
+ },
+
+ classify: function(str){
+ return _s.titleize(String(str).replace(/[\W_]/g, ' ')).replace(/\s/g, '');
+ },
+
+ humanize: function(str){
+ return _s.capitalize(_s.underscored(str).replace(/_id$/,'').replace(/_/g, ' '));
+ },
+
+ trim: function(str, characters){
+ if (str == null) return '';
+ if (!characters && nativeTrim) return nativeTrim.call(str);
+ characters = defaultToWhiteSpace(characters);
+ return String(str).replace(new RegExp('\^' + characters + '+|' + characters + '+$', 'g'), '');
+ },
+
+ ltrim: function(str, characters){
+ if (str == null) return '';
+ if (!characters && nativeTrimLeft) return nativeTrimLeft.call(str);
+ characters = defaultToWhiteSpace(characters);
+ return String(str).replace(new RegExp('^' + characters + '+'), '');
+ },
+
+ rtrim: function(str, characters){
+ if (str == null) return '';
+ if (!characters && nativeTrimRight) return nativeTrimRight.call(str);
+ characters = defaultToWhiteSpace(characters);
+ return String(str).replace(new RegExp(characters + '+$'), '');
+ },
+
+ truncate: function(str, length, truncateStr){
+ if (str == null) return '';
+ str = String(str); truncateStr = truncateStr || '...';
+ length = ~~length;
+ return str.length > length ? str.slice(0, length) + truncateStr : str;
+ },
+
+ /**
+ * _s.prune: a more elegant version of truncate
+ * prune extra chars, never leaving a half-chopped word.
+ * @author github.com/rwz
+ */
+ prune: function(str, length, pruneStr){
+ if (str == null) return '';
+
+ str = String(str); length = ~~length;
+ pruneStr = pruneStr != null ? String(pruneStr) : '...';
+
+ if (str.length <= length) return str;
+
+ var tmpl = function(c){ return c.toUpperCase() !== c.toLowerCase() ? 'A' : ' '; },
+ template = str.slice(0, length+1).replace(/.(?=\W*\w*$)/g, tmpl); // 'Hello, world' -> 'HellAA AAAAA'
+
+ if (template.slice(template.length-2).match(/\w\w/))
+ template = template.replace(/\s*\S+$/, '');
+ else
+ template = _s.rtrim(template.slice(0, template.length-1));
+
+ return (template+pruneStr).length > str.length ? str : str.slice(0, template.length)+pruneStr;
+ },
+
+ words: function(str, delimiter) {
+ if (_s.isBlank(str)) return [];
+ return _s.trim(str, delimiter).split(delimiter || /\s+/);
+ },
+
+ pad: function(str, length, padStr, type) {
+ str = str == null ? '' : String(str);
+ length = ~~length;
+
+ var padlen = 0;
+
+ if (!padStr)
+ padStr = ' ';
+ else if (padStr.length > 1)
+ padStr = padStr.charAt(0);
+
+ switch(type) {
+ case 'right':
+ padlen = length - str.length;
+ return str + strRepeat(padStr, padlen);
+ case 'both':
+ padlen = length - str.length;
+ return strRepeat(padStr, Math.ceil(padlen/2)) + str
+ + strRepeat(padStr, Math.floor(padlen/2));
+ default: // 'left'
+ padlen = length - str.length;
+ return strRepeat(padStr, padlen) + str;
+ }
+ },
+
+ lpad: function(str, length, padStr) {
+ return _s.pad(str, length, padStr);
+ },
+
+ rpad: function(str, length, padStr) {
+ return _s.pad(str, length, padStr, 'right');
+ },
+
+ lrpad: function(str, length, padStr) {
+ return _s.pad(str, length, padStr, 'both');
+ },
+
+ sprintf: sprintf,
+
+ vsprintf: function(fmt, argv){
+ argv.unshift(fmt);
+ return sprintf.apply(null, argv);
+ },
+
+ toNumber: function(str, decimals) {
+ if (!str) return 0;
+ str = _s.trim(str);
+ if (!str.match(/^-?\d+(?:\.\d+)?$/)) return NaN;
+ return parseNumber(parseNumber(str).toFixed(~~decimals));
+ },
+
+ numberFormat : function(number, dec, dsep, tsep) {
+ if (isNaN(number) || number == null) return '';
+
+ number = number.toFixed(~~dec);
+ tsep = typeof tsep == 'string' ? tsep : ',';
+
+ var parts = number.split('.'), fnums = parts[0],
+ decimals = parts[1] ? (dsep || '.') + parts[1] : '';
+
+ return fnums.replace(/(\d)(?=(?:\d{3})+$)/g, '$1' + tsep) + decimals;
+ },
+
+ strRight: function(str, sep){
+ if (str == null) return '';
+ str = String(str); sep = sep != null ? String(sep) : sep;
+ var pos = !sep ? -1 : str.indexOf(sep);
+ return ~pos ? str.slice(pos+sep.length, str.length) : str;
+ },
+
+ strRightBack: function(str, sep){
+ if (str == null) return '';
+ str = String(str); sep = sep != null ? String(sep) : sep;
+ var pos = !sep ? -1 : str.lastIndexOf(sep);
+ return ~pos ? str.slice(pos+sep.length, str.length) : str;
+ },
+
+ strLeft: function(str, sep){
+ if (str == null) return '';
+ str = String(str); sep = sep != null ? String(sep) : sep;
+ var pos = !sep ? -1 : str.indexOf(sep);
+ return ~pos ? str.slice(0, pos) : str;
+ },
+
+ strLeftBack: function(str, sep){
+ if (str == null) return '';
+ str += ''; sep = sep != null ? ''+sep : sep;
+ var pos = str.lastIndexOf(sep);
+ return ~pos ? str.slice(0, pos) : str;
+ },
+
+ toSentence: function(array, separator, lastSeparator, serial) {
+ separator = separator || ', ';
+ lastSeparator = lastSeparator || ' and ';
+ var a = array.slice(), lastMember = a.pop();
+
+ if (array.length > 2 && serial) lastSeparator = _s.rtrim(separator) + lastSeparator;
+
+ return a.length ? a.join(separator) + lastSeparator + lastMember : lastMember;
+ },
+
+ toSentenceSerial: function() {
+ var args = slice.call(arguments);
+ args[3] = true;
+ return _s.toSentence.apply(_s, args);
+ },
+
+ slugify: function(str) {
+ if (str == null) return '';
+
+ var from = "ąàáäâãåæăćęèéëêìíïîłńòóöôõøśșțùúüûñçżź",
+ to = "aaaaaaaaaceeeeeiiiilnoooooosstuuuunczz",
+ regex = new RegExp(defaultToWhiteSpace(from), 'g');
+
+ str = String(str).toLowerCase().replace(regex, function(c){
+ var index = from.indexOf(c);
+ return to.charAt(index) || '-';
+ });
+
+ return _s.dasherize(str.replace(/[^\w\s-]/g, ''));
+ },
+
+ surround: function(str, wrapper) {
+ return [wrapper, str, wrapper].join('');
+ },
+
+ quote: function(str, quoteChar) {
+ return _s.surround(str, quoteChar || '"');
+ },
+
+ unquote: function(str, quoteChar) {
+ quoteChar = quoteChar || '"';
+ if (str[0] === quoteChar && str[str.length-1] === quoteChar)
+ return str.slice(1,str.length-1);
+ else return str;
+ },
+
+ exports: function() {
+ var result = {};
+
+ for (var prop in this) {
+ if (!this.hasOwnProperty(prop) || prop.match(/^(?:include|contains|reverse)$/)) continue;
+ result[prop] = this[prop];
+ }
+
+ return result;
+ },
+
+ repeat: function(str, qty, separator){
+ if (str == null) return '';
+
+ qty = ~~qty;
+
+ // using faster implementation if separator is not needed;
+ if (separator == null) return strRepeat(String(str), qty);
+
+ // this one is about 300x slower in Google Chrome
+ for (var repeat = []; qty > 0; repeat[--qty] = str) {}
+ return repeat.join(separator);
+ },
+
+ naturalCmp: function(str1, str2){
+ if (str1 == str2) return 0;
+ if (!str1) return -1;
+ if (!str2) return 1;
+
+ var cmpRegex = /(\.\d+)|(\d+)|(\D+)/g,
+ tokens1 = String(str1).toLowerCase().match(cmpRegex),
+ tokens2 = String(str2).toLowerCase().match(cmpRegex),
+ count = Math.min(tokens1.length, tokens2.length);
+
+ for(var i = 0; i < count; i++) {
+ var a = tokens1[i], b = tokens2[i];
+
+ if (a !== b){
+ var num1 = parseInt(a, 10);
+ if (!isNaN(num1)){
+ var num2 = parseInt(b, 10);
+ if (!isNaN(num2) && num1 - num2)
+ return num1 - num2;
+ }
+ return a < b ? -1 : 1;
+ }
+ }
+
+ if (tokens1.length === tokens2.length)
+ return tokens1.length - tokens2.length;
+
+ return str1 < str2 ? -1 : 1;
+ },
+
+ levenshtein: function(str1, str2) {
+ if (str1 == null && str2 == null) return 0;
+ if (str1 == null) return String(str2).length;
+ if (str2 == null) return String(str1).length;
+
+ str1 = String(str1); str2 = String(str2);
+
+ var current = [], prev, value;
+
+ for (var i = 0; i <= str2.length; i++)
+ for (var j = 0; j <= str1.length; j++) {
+ if (i && j)
+ if (str1.charAt(j - 1) === str2.charAt(i - 1))
+ value = prev;
+ else
+ value = Math.min(current[j], current[j - 1], prev) + 1;
+ else
+ value = i + j;
+
+ prev = current[j];
+ current[j] = value;
+ }
+
+ return current.pop();
+ },
+
+ toBoolean: function(str, trueValues, falseValues) {
+ if (typeof str === "number") str = "" + str;
+ if (typeof str !== "string") return !!str;
+ str = _s.trim(str);
+ if (boolMatch(str, trueValues || ["true", "1"])) return true;
+ if (boolMatch(str, falseValues || ["false", "0"])) return false;
+ }
+ };
+
+ // Aliases
+
+ _s.strip = _s.trim;
+ _s.lstrip = _s.ltrim;
+ _s.rstrip = _s.rtrim;
+ _s.center = _s.lrpad;
+ _s.rjust = _s.lpad;
+ _s.ljust = _s.rpad;
+ _s.contains = _s.include;
+ _s.q = _s.quote;
+ _s.toBool = _s.toBoolean;
+
+ // Exporting
+
+ // CommonJS module is defined
+ if (typeof exports !== 'undefined') {
+ if (typeof module !== 'undefined' && module.exports)
+ module.exports = _s;
+
+ exports._s = _s;
+ }
+
+ // Register as a named module with AMD.
+ if (typeof define === 'function' && define.amd)
+ define('underscore.string', [], function(){ return _s; });
+
+
+ // Integrate with Underscore.js if defined
+ // or create our own underscore object.
+ root._ = root._ || {};
+ root._.string = root._.str = _s;
+}(this, String);
diff --git a/node_modules/grunt/node_modules/grunt-legacy-log/node_modules/underscore.string/libpeerconnection.log b/node_modules/grunt/node_modules/grunt-legacy-log/node_modules/underscore.string/libpeerconnection.log
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/grunt/node_modules/grunt-legacy-log/node_modules/underscore.string/package.json b/node_modules/grunt/node_modules/grunt-legacy-log/node_modules/underscore.string/package.json
new file mode 100644
index 0000000..a97273b
--- /dev/null
+++ b/node_modules/grunt/node_modules/grunt-legacy-log/node_modules/underscore.string/package.json
@@ -0,0 +1,97 @@
+{
+ "name": "underscore.string",
+ "version": "2.3.3",
+ "description": "String manipulation extensions for Underscore.js javascript library.",
+ "homepage": "http://epeli.github.com/underscore.string/",
+ "contributors": [
+ {
+ "name": "Esa-Matti Suuronen",
+ "email": "esa-matti@suuronen.org",
+ "url": "http://esa-matti.suuronen.org/"
+ },
+ {
+ "name": "Edward Tsech",
+ "email": "edtsech@gmail.com"
+ },
+ {
+ "name": "Pavel Pravosud",
+ "email": "pavel@pravosud.com",
+ "url": ""
+ },
+ {
+ "name": "Sasha Koss",
+ "email": "kossnocorp@gmail.com",
+ "url": "http://koss.nocorp.me/"
+ },
+ {
+ "name": "Vladimir Dronnikov",
+ "email": "dronnikov@gmail.com"
+ },
+ {
+ "name": "Pete Kruckenberg",
+ "email": "https://github.com/kruckenb",
+ "url": ""
+ },
+ {
+ "name": "Paul Chavard",
+ "email": "paul@chavard.net",
+ "url": ""
+ },
+ {
+ "name": "Ed Finkler",
+ "email": "coj@funkatron.com",
+ "url": ""
+ }
+ ],
+ "keywords": [
+ "underscore",
+ "string"
+ ],
+ "main": "./lib/underscore.string",
+ "directories": {
+ "lib": "./lib"
+ },
+ "engines": {
+ "node": "*"
+ },
+ "repository": {
+ "type": "git",
+ "url": "https://github.com/epeli/underscore.string.git"
+ },
+ "bugs": {
+ "url": "https://github.com/epeli/underscore.string/issues"
+ },
+ "licenses": [
+ {
+ "type": "MIT"
+ }
+ ],
+ "_id": "underscore.string@2.3.3",
+ "dist": {
+ "shasum": "71c08bf6b428b1133f37e78fa3a21c82f7329b0d",
+ "tarball": "http://registry.npmjs.org/underscore.string/-/underscore.string-2.3.3.tgz"
+ },
+ "_from": "underscore.string@>=2.3.3 <2.4.0",
+ "_npmVersion": "1.2.32",
+ "_npmUser": {
+ "name": "epeli",
+ "email": "esa-matti@suuronen.org"
+ },
+ "maintainers": [
+ {
+ "name": "edtsech",
+ "email": "edtsech@gmail.com"
+ },
+ {
+ "name": "rwz",
+ "email": "rwz@duckroll.ru"
+ },
+ {
+ "name": "epeli",
+ "email": "esa-matti@suuronen.org"
+ }
+ ],
+ "_shasum": "71c08bf6b428b1133f37e78fa3a21c82f7329b0d",
+ "_resolved": "https://registry.npmjs.org/underscore.string/-/underscore.string-2.3.3.tgz",
+ "readme": "ERROR: No README data found!"
+}
diff --git a/node_modules/grunt/node_modules/grunt-legacy-log/node_modules/underscore.string/test/run-qunit.js b/node_modules/grunt/node_modules/grunt-legacy-log/node_modules/underscore.string/test/run-qunit.js
new file mode 100644
index 0000000..44a2167
--- /dev/null
+++ b/node_modules/grunt/node_modules/grunt-legacy-log/node_modules/underscore.string/test/run-qunit.js
@@ -0,0 +1,45 @@
+function waitFor(test, complete, timeout) {
+ var result, start = new Date().getTime()
+ setInterval(function interval() {
+ if ((new Date().getTime() - start < timeout) && !result) {
+ result = test()
+ } else {
+ if (!result) {
+ phantom.exit(1)
+ } else {
+ complete()
+ clearInterval(interval)
+ }
+ }
+ }, 100)
+}
+
+
+var fs = require('fs'), page = require('webpage').create();
+var url = 'file://localhost' + fs.workingDirectory + '/' + phantom.args[0];
+
+page.onConsoleMessage = function(msg) {
+ console.log(msg)
+}
+
+page.open(url, function(status) {
+ waitFor(function() {
+ return page.evaluate(function(){
+ var el = document.getElementById('qunit-testresult')
+ return el && el.innerText.match('completed')
+ })
+ }, function() {
+ var failures = page.evaluate(function() {
+ var el = document.getElementById('qunit-testresult'),
+ fails = document.getElementsByClassName('fail')
+
+ for (var i = 0; i < fails.length; i++)
+ console.log(fails[i].innerText)
+
+ console.log(el.innerText)
+
+ return parseInt(el.getElementsByClassName('failed')[0].innerHTML)
+ })
+ phantom.exit(failures > 0 ? 1 : 0)
+ }, 10000)
+})
\ No newline at end of file
diff --git a/node_modules/grunt/node_modules/grunt-legacy-log/node_modules/underscore.string/test/speed.js b/node_modules/grunt/node_modules/grunt-legacy-log/node_modules/underscore.string/test/speed.js
new file mode 100644
index 0000000..9ceeea7
--- /dev/null
+++ b/node_modules/grunt/node_modules/grunt-legacy-log/node_modules/underscore.string/test/speed.js
@@ -0,0 +1,148 @@
+(function() {
+
+ JSLitmus.test('levenshtein', function() {
+ return [
+ _.levenshtein('pineapple', 'potato'),
+ _.levenshtein('seven', 'eight'),
+ _.levenshtein('the very same string', 'the very same string'),
+ _.levenshtein('very very very long string', 'something completely different')
+ ];
+ });
+
+
+ JSLitmus.test('trimNoNative', function() {
+ return _.trim(" foobar ", " ");
+ });
+
+ JSLitmus.test('trim', function() {
+ return _.trim(" foobar ");
+ });
+
+ JSLitmus.test('trim object-oriented', function() {
+ return _(" foobar ").trim();
+ });
+
+ JSLitmus.test('trim jQuery', function() {
+ return jQuery.trim(" foobar ");
+ });
+
+ JSLitmus.test('ltrimp', function() {
+ return _.ltrim(" foobar ", " ");
+ });
+
+ JSLitmus.test('rtrimp', function() {
+ return _.rtrim(" foobar ", " ");
+ });
+
+ JSLitmus.test('startsWith', function() {
+ return _.startsWith("foobar", "foo");
+ });
+
+ JSLitmus.test('endsWith', function() {
+ return _.endsWith("foobar", "xx");
+ });
+
+ JSLitmus.test('chop', function(){
+ return _('whitespace').chop(2);
+ });
+
+ JSLitmus.test('count', function(){
+ return _('Hello worls').count('l');
+ });
+
+ JSLitmus.test('insert', function() {
+ return _('Hello ').insert(6, 'world');
+ });
+
+ JSLitmus.test('splice', function() {
+ return _('https://edtsech@bitbucket.org/edtsech/underscore.strings').splice(30, 7, 'epeli');
+ });
+
+ JSLitmus.test('succ', function(){
+ var let = 'a', alphabet = [];
+
+ for (var i=0; i < 26; i++) {
+ alphabet.push(let);
+ let = _(let).succ();
+ }
+
+ return alphabet;
+ });
+
+ JSLitmus.test('titleize', function(){
+ return _('the titleize string method').titleize();
+ });
+
+ JSLitmus.test('truncate', function(){
+ return _('Hello world').truncate(5);
+ });
+
+ JSLitmus.test('prune', function(){
+ return _('Hello world').prune(5);
+ });
+
+ JSLitmus.test('isBlank', function(){
+ return _('').isBlank();
+ });
+
+ JSLitmus.test('escapeHTML', function(){
+ _('Blah blah blah
').escapeHTML();
+ });
+
+ JSLitmus.test('unescapeHTML', function(){
+ _('<div>Blah blah blah</div>').unescapeHTML();
+ });
+
+ JSLitmus.test('reverse', function(){
+ _('Hello World').reverse();
+ });
+
+ JSLitmus.test('pad default', function(){
+ _('foo').pad(12);
+ });
+
+ JSLitmus.test('pad hash left', function(){
+ _('foo').pad(12, '#');
+ });
+
+ JSLitmus.test('pad hash right', function(){
+ _('foo').pad(12, '#', 'right');
+ });
+
+ JSLitmus.test('pad hash both', function(){
+ _('foo').pad(12, '#', 'both');
+ });
+
+ JSLitmus.test('pad hash both longPad', function(){
+ _('foo').pad(12, 'f00f00f00', 'both');
+ });
+
+ JSLitmus.test('toNumber', function(){
+ _('10.232323').toNumber(2);
+ });
+
+ JSLitmus.test('strRight', function(){
+ _('aaa_bbb_ccc').strRight('_');
+ });
+
+ JSLitmus.test('strRightBack', function(){
+ _('aaa_bbb_ccc').strRightBack('_');
+ });
+
+ JSLitmus.test('strLeft', function(){
+ _('aaa_bbb_ccc').strLeft('_');
+ });
+
+ JSLitmus.test('strLeftBack', function(){
+ _('aaa_bbb_ccc').strLeftBack('_');
+ });
+
+ JSLitmus.test('join', function(){
+ _('separator').join(1, 2, 3, 4, 5, 6, 7, 8, 'foo', 'bar', 'lol', 'wut');
+ });
+
+ JSLitmus.test('slugify', function(){
+ _("Un éléphant à l'orée du bois").slugify();
+ });
+
+})();
diff --git a/node_modules/grunt/node_modules/grunt-legacy-log/node_modules/underscore.string/test/strings.js b/node_modules/grunt/node_modules/grunt-legacy-log/node_modules/underscore.string/test/strings.js
new file mode 100644
index 0000000..77364f2
--- /dev/null
+++ b/node_modules/grunt/node_modules/grunt-legacy-log/node_modules/underscore.string/test/strings.js
@@ -0,0 +1,685 @@
+$(document).ready(function() {
+
+ // Include Underscore.string methods to Underscore namespace
+ _.mixin(_.str.exports());
+
+ module('String extensions');
+
+ test('Strings: naturalSort', function() {
+ var arr = ['foo2', 'foo1', 'foo10', 'foo30', 'foo100', 'foo10bar'],
+ sorted = ['foo1', 'foo2', 'foo10', 'foo10bar', 'foo30', 'foo100'];
+ deepEqual(arr.sort(_.naturalCmp), sorted);
+ });
+
+ test('Strings: trim', function() {
+ equal(_.trim(123), '123', 'Non string');
+ equal(_(' foo').trim(), 'foo');
+ equal(_('foo ').trim(), 'foo');
+ equal(_(' foo ').trim(), 'foo');
+ equal(_(' foo ').trim(), 'foo');
+ equal(_(' foo ').trim(' '), 'foo', 'Manually set whitespace');
+ equal(_('\t foo \t ').trim(/\s/), 'foo', 'Manually set RegExp /\\s+/');
+
+ equal(_('ffoo').trim('f'), 'oo');
+ equal(_('ooff').trim('f'), 'oo');
+ equal(_('ffooff').trim('f'), 'oo');
+
+
+ equal(_('_-foobar-_').trim('_-'), 'foobar');
+
+ equal(_('http://foo/').trim('/'), 'http://foo');
+ equal(_('c:\\').trim('\\'), 'c:');
+
+ equal(_(123).trim(), '123');
+ equal(_(123).trim(3), '12');
+ equal(_('').trim(), '', 'Trim empty string should return empty string');
+ equal(_(null).trim(), '', 'Trim null should return empty string');
+ equal(_(undefined).trim(), '', 'Trim undefined should return empty string');
+ });
+
+ test('String: levenshtein', function() {
+ equal(_.levenshtein('Godfather', 'Godfather'), 0);
+ equal(_.levenshtein('Godfather', 'Godfathe'), 1);
+ equal(_.levenshtein('Godfather', 'odfather'), 1);
+ equal(_.levenshtein('Godfather', 'Gdfthr'), 3);
+ equal(_.levenshtein('seven', 'eight'), 5);
+ equal(_.levenshtein('123', 123), 0);
+ equal(_.levenshtein(321, '321'), 0);
+ equal(_.levenshtein('lol', null), 3);
+ equal(_.levenshtein('lol'), 3);
+ equal(_.levenshtein(null, 'lol'), 3);
+ equal(_.levenshtein(undefined, 'lol'), 3);
+ equal(_.levenshtein(), 0);
+ });
+
+ test('Strings: ltrim', function() {
+ equal(_(' foo').ltrim(), 'foo');
+ equal(_(' foo').ltrim(), 'foo');
+ equal(_('foo ').ltrim(), 'foo ');
+ equal(_(' foo ').ltrim(), 'foo ');
+ equal(_('').ltrim(), '', 'ltrim empty string should return empty string');
+ equal(_(null).ltrim(), '', 'ltrim null should return empty string');
+ equal(_(undefined).ltrim(), '', 'ltrim undefined should return empty string');
+
+ equal(_('ffoo').ltrim('f'), 'oo');
+ equal(_('ooff').ltrim('f'), 'ooff');
+ equal(_('ffooff').ltrim('f'), 'ooff');
+
+ equal(_('_-foobar-_').ltrim('_-'), 'foobar-_');
+
+ equal(_(123).ltrim(1), '23');
+ });
+
+ test('Strings: rtrim', function() {
+ equal(_('http://foo/').rtrim('/'), 'http://foo', 'clean trailing slash');
+ equal(_(' foo').rtrim(), ' foo');
+ equal(_('foo ').rtrim(), 'foo');
+ equal(_('foo ').rtrim(), 'foo');
+ equal(_('foo bar ').rtrim(), 'foo bar');
+ equal(_(' foo ').rtrim(), ' foo');
+
+ equal(_('ffoo').rtrim('f'), 'ffoo');
+ equal(_('ooff').rtrim('f'), 'oo');
+ equal(_('ffooff').rtrim('f'), 'ffoo');
+
+ equal(_('_-foobar-_').rtrim('_-'), '_-foobar');
+
+ equal(_(123).rtrim(3), '12');
+ equal(_('').rtrim(), '', 'rtrim empty string should return empty string');
+ equal(_(null).rtrim(), '', 'rtrim null should return empty string');
+ });
+
+ test('Strings: capitalize', function() {
+ equal(_('fabio').capitalize(), 'Fabio', 'First letter is upper case');
+ equal(_.capitalize('fabio'), 'Fabio', 'First letter is upper case');
+ equal(_.capitalize('FOO'), 'FOO', 'Other letters unchanged');
+ equal(_(123).capitalize(), '123', 'Non string');
+ equal(_.capitalize(''), '', 'Capitalizing empty string returns empty string');
+ equal(_.capitalize(null), '', 'Capitalizing null returns empty string');
+ equal(_.capitalize(undefined), '', 'Capitalizing undefined returns empty string');
+ });
+
+ test('Strings: join', function() {
+ equal(_.join('', 'foo', 'bar'), 'foobar', 'basic join');
+ equal(_.join('', 1, 'foo', 2), '1foo2', 'join numbers and strings');
+ equal(_.join(' ','foo', 'bar'), 'foo bar', 'join with spaces');
+ equal(_.join('1', '2', '2'), '212', 'join number strings');
+ equal(_.join(1, 2, 2), '212', 'join numbers');
+ equal(_.join('','foo', null), 'foo', 'join null with string returns string');
+ equal(_.join(null,'foo', 'bar'), 'foobar', 'join strings with null returns string');
+ equal(_(' ').join('foo', 'bar'), 'foo bar', 'join object oriented');
+ });
+
+ test('Strings: reverse', function() {
+ equal(_.str.reverse('foo'), 'oof' );
+ equal(_.str.reverse('foobar'), 'raboof' );
+ equal(_.str.reverse('foo bar'), 'rab oof' );
+ equal(_.str.reverse('saippuakauppias'), 'saippuakauppias' );
+ equal(_.str.reverse(123), '321', 'Non string');
+ equal(_.str.reverse(123.45), '54.321', 'Non string');
+ equal(_.str.reverse(''), '', 'reversing empty string returns empty string' );
+ equal(_.str.reverse(null), '', 'reversing null returns empty string' );
+ equal(_.str.reverse(undefined), '', 'reversing undefined returns empty string' );
+ });
+
+ test('Strings: clean', function() {
+ equal(_(' foo bar ').clean(), 'foo bar');
+ equal(_(123).clean(), '123');
+ equal(_('').clean(), '', 'claning empty string returns empty string');
+ equal(_(null).clean(), '', 'claning null returns empty string');
+ equal(_(undefined).clean(), '', 'claning undefined returns empty string');
+ });
+
+ test('Strings: sprintf', function() {
+ // Should be very tested function already. Thanks to
+ // http://www.diveintojavascript.com/projects/sprintf-for-javascript
+ equal(_.sprintf('Hello %s', 'me'), 'Hello me', 'basic');
+ equal(_('Hello %s').sprintf('me'), 'Hello me', 'object');
+ equal(_('hello %s').chain().sprintf('me').capitalize().value(), 'Hello me', 'Chaining works');
+ equal(_.sprintf('%.1f', 1.22222), '1.2', 'round');
+ equal(_.sprintf('%.1f', 1.17), '1.2', 'round 2');
+ equal(_.sprintf('%(id)d - %(name)s', {id: 824, name: 'Hello World'}), '824 - Hello World', 'Named replacements work');
+ equal(_.sprintf('%(args[0].id)d - %(args[1].name)s', {args: [{id: 824}, {name: 'Hello World'}]}), '824 - Hello World', 'Named replacements with arrays work');
+ });
+
+
+ test('Strings: vsprintf', function() {
+ equal(_.vsprintf('Hello %s', ['me']), 'Hello me', 'basic');
+ equal(_('Hello %s').vsprintf(['me']), 'Hello me', 'object');
+ equal(_('hello %s').chain().vsprintf(['me']).capitalize().value(), 'Hello me', 'Chaining works');
+ equal(_.vsprintf('%.1f', [1.22222]), '1.2', 'round');
+ equal(_.vsprintf('%.1f', [1.17]), '1.2', 'round 2');
+ equal(_.vsprintf('%(id)d - %(name)s', [{id: 824, name: 'Hello World'}]), '824 - Hello World', 'Named replacement works');
+ equal(_.vsprintf('%(args[0].id)d - %(args[1].name)s', [{args: [{id: 824}, {name: 'Hello World'}]}]), '824 - Hello World', 'Named replacement with arrays works');
+ });
+
+ test('Strings: startsWith', function() {
+ ok(_('foobar').startsWith('foo'), 'foobar starts with foo');
+ ok(!_('oobar').startsWith('foo'), 'oobar does not start with foo');
+ ok(_(12345).startsWith(123), '12345 starts with 123');
+ ok(!_(2345).startsWith(123), '2345 does not start with 123');
+ ok(_('').startsWith(''), 'empty string starts with empty string');
+ ok(_(null).startsWith(''), 'null starts with empty string');
+ ok(!_(null).startsWith('foo'), 'null starts with foo');
+ });
+
+ test('Strings: endsWith', function() {
+ ok(_('foobar').endsWith('bar'), 'foobar ends with bar');
+ ok(_.endsWith('foobar', 'bar'), 'foobar ends with bar');
+ ok(_.endsWith('00018-0000062.Plone.sdh264.1a7264e6912a91aa4a81b64dc5517df7b8875994.mp4', 'mp4'), 'endsWith .mp4');
+ ok(!_('fooba').endsWith('bar'), 'fooba does not end with bar');
+ ok(_.endsWith(12345, 45), '12345 ends with 45');
+ ok(!_.endsWith(12345, 6), '12345 does not end with 6');
+ ok(_('').endsWith(''), 'empty string ends with empty string');
+ ok(_(null).endsWith(''), 'null ends with empty string');
+ ok(!_(null).endsWith('foo'), 'null ends with foo');
+ });
+
+ test('Strings: include', function() {
+ ok(_.str.include('foobar', 'bar'), 'foobar includes bar');
+ ok(!_.str.include('foobar', 'buzz'), 'foobar does not includes buzz');
+ ok(_.str.include(12345, 34), '12345 includes 34');
+ ok(!_.str.contains(12345, 6), '12345 does not includes 6');
+ ok(!_.str.include('', 34), 'empty string includes 34');
+ ok(!_.str.include(null, 34), 'null includes 34');
+ ok(_.str.include(null, ''), 'null includes empty string');
+ });
+
+ test('String: chop', function(){
+ ok(_('whitespace').chop(2).length === 5, 'output [wh, it, es, pa, ce]');
+ ok(_('whitespace').chop(3).length === 4, 'output [whi, tes, pac, e]');
+ ok(_('whitespace').chop()[0].length === 10, 'output [whitespace]');
+ ok(_(12345).chop(1).length === 5, 'output [1, 2, 3, 4, 5]');
+ });
+
+ test('String: clean', function(){
+ equal(_.clean(' foo bar '), 'foo bar');
+ equal(_.clean(''), '');
+ equal(_.clean(null), '');
+ equal(_.clean(1), '1');
+ });
+
+ test('String: count', function(){
+ equal(_('Hello world').count('l'), 3);
+ equal(_('Hello world').count('Hello'), 1);
+ equal(_('Hello world').count('foo'), 0);
+ equal(_('x.xx....x.x').count('x'), 5);
+ equal(_('').count('x'), 0);
+ equal(_(null).count('x'), 0);
+ equal(_(undefined).count('x'), 0);
+ equal(_(12345).count(1), 1);
+ equal(_(11345).count(1), 2);
+ });
+
+ test('String: insert', function(){
+ equal(_('Hello ').insert(6, 'Jessy'), 'Hello Jessy');
+ equal(_('Hello ').insert(100, 'Jessy'), 'Hello Jessy');
+ equal(_('').insert(100, 'Jessy'), 'Jessy');
+ equal(_(null).insert(100, 'Jessy'), 'Jessy');
+ equal(_(undefined).insert(100, 'Jessy'), 'Jessy');
+ equal(_(12345).insert(6, 'Jessy'), '12345Jessy');
+ });
+
+ test('String: splice', function(){
+ equal(_('https://edtsech@bitbucket.org/edtsech/underscore.strings').splice(30, 7, 'epeli'),
+ 'https://edtsech@bitbucket.org/epeli/underscore.strings');
+ equal(_.splice(12345, 1, 2, 321), '132145', 'Non strings');
+ });
+
+ test('String: succ', function(){
+ equal(_('a').succ(), 'b');
+ equal(_('A').succ(), 'B');
+ equal(_('+').succ(), ',');
+ equal(_(1).succ(), '2');
+ });
+
+ test('String: titleize', function(){
+ equal(_('the titleize string method').titleize(), 'The Titleize String Method');
+ equal(_('the titleize string method').titleize(), 'The Titleize String Method');
+ equal(_('').titleize(), '', 'Titleize empty string returns empty string');
+ equal(_(null).titleize(), '', 'Titleize null returns empty string');
+ equal(_(undefined).titleize(), '', 'Titleize undefined returns empty string');
+ equal(_('let\'s have some fun').titleize(), 'Let\'s Have Some Fun');
+ equal(_('a-dash-separated-string').titleize(), 'A-Dash-Separated-String');
+ equal(_('A-DASH-SEPARATED-STRING').titleize(), 'A-Dash-Separated-String');
+ equal(_(123).titleize(), '123');
+ });
+
+ test('String: camelize', function(){
+ equal(_('the_camelize_string_method').camelize(), 'theCamelizeStringMethod');
+ equal(_('-the-camelize-string-method').camelize(), 'TheCamelizeStringMethod');
+ equal(_('the camelize string method').camelize(), 'theCamelizeStringMethod');
+ equal(_(' the camelize string method').camelize(), 'theCamelizeStringMethod');
+ equal(_('the camelize string method').camelize(), 'theCamelizeStringMethod');
+ equal(_('').camelize(), '', 'Camelize empty string returns empty string');
+ equal(_(null).camelize(), '', 'Camelize null returns empty string');
+ equal(_(undefined).camelize(), '', 'Camelize undefined returns empty string');
+ equal(_(123).camelize(), '123');
+ });
+
+ test('String: underscored', function(){
+ equal(_('the-underscored-string-method').underscored(), 'the_underscored_string_method');
+ equal(_('theUnderscoredStringMethod').underscored(), 'the_underscored_string_method');
+ equal(_('TheUnderscoredStringMethod').underscored(), 'the_underscored_string_method');
+ equal(_(' the underscored string method').underscored(), 'the_underscored_string_method');
+ equal(_('').underscored(), '');
+ equal(_(null).underscored(), '');
+ equal(_(undefined).underscored(), '');
+ equal(_(123).underscored(), '123');
+ });
+
+ test('String: dasherize', function(){
+ equal(_('the_dasherize_string_method').dasherize(), 'the-dasherize-string-method');
+ equal(_('TheDasherizeStringMethod').dasherize(), '-the-dasherize-string-method');
+ equal(_('thisIsATest').dasherize(), 'this-is-a-test');
+ equal(_('this Is A Test').dasherize(), 'this-is-a-test');
+ equal(_('thisIsATest123').dasherize(), 'this-is-a-test123');
+ equal(_('123thisIsATest').dasherize(), '123this-is-a-test');
+ equal(_('the dasherize string method').dasherize(), 'the-dasherize-string-method');
+ equal(_('the dasherize string method ').dasherize(), 'the-dasherize-string-method');
+ equal(_('téléphone').dasherize(), 'téléphone');
+ equal(_('foo$bar').dasherize(), 'foo$bar');
+ equal(_('').dasherize(), '');
+ equal(_(null).dasherize(), '');
+ equal(_(undefined).dasherize(), '');
+ equal(_(123).dasherize(), '123');
+ });
+
+ test('String: camelize', function(){
+ equal(_.camelize('-moz-transform'), 'MozTransform');
+ equal(_.camelize('webkit-transform'), 'webkitTransform');
+ equal(_.camelize('under_scored'), 'underScored');
+ equal(_.camelize(' with spaces'), 'withSpaces');
+ equal(_('').camelize(), '');
+ equal(_(null).camelize(), '');
+ equal(_(undefined).camelize(), '');
+ equal(_("_som eWeird---name-").camelize(), 'SomEWeirdName');
+ });
+
+ test('String: join', function(){
+ equal(_.join(1, 2, 3, 4), '21314');
+ equal(_.join('|', 'foo', 'bar', 'baz'), 'foo|bar|baz');
+ equal(_.join('',2,3,null), '23');
+ equal(_.join(null,2,3), '23');
+ });
+
+ test('String: classify', function(){
+ equal(_.classify(1), '1');
+ equal(_('some_class_name').classify(), 'SomeClassName');
+ equal(_('my wonderfull class_name').classify(), 'MyWonderfullClassName');
+ equal(_('my wonderfull.class.name').classify(), 'MyWonderfullClassName');
+ });
+
+ test('String: humanize', function(){
+ equal(_('the_humanize_string_method').humanize(), 'The humanize string method');
+ equal(_('ThehumanizeStringMethod').humanize(), 'Thehumanize string method');
+ equal(_('the humanize string method').humanize(), 'The humanize string method');
+ equal(_('the humanize_id string method_id').humanize(), 'The humanize id string method');
+ equal(_('the humanize string method ').humanize(), 'The humanize string method');
+ equal(_(' capitalize dash-CamelCase_underscore trim ').humanize(), 'Capitalize dash camel case underscore trim');
+ equal(_(123).humanize(), '123');
+ equal(_('').humanize(), '');
+ equal(_(null).humanize(), '');
+ equal(_(undefined).humanize(), '');
+ });
+
+ test('String: truncate', function(){
+ equal(_('Hello world').truncate(6, 'read more'), 'Hello read more');
+ equal(_('Hello world').truncate(5), 'Hello...');
+ equal(_('Hello').truncate(10), 'Hello');
+ equal(_('').truncate(10), '');
+ equal(_(null).truncate(10), '');
+ equal(_(undefined).truncate(10), '');
+ equal(_(1234567890).truncate(5), '12345...');
+ });
+
+ test('String: prune', function(){
+ equal(_('Hello, cruel world').prune(6, ' read more'), 'Hello read more');
+ equal(_('Hello, world').prune(5, 'read a lot more'), 'Hello, world');
+ equal(_('Hello, world').prune(5), 'Hello...');
+ equal(_('Hello, world').prune(8), 'Hello...');
+ equal(_('Hello, cruel world').prune(15), 'Hello, cruel...');
+ equal(_('Hello world').prune(22), 'Hello world');
+ equal(_('Привет, жестокий мир').prune(6, ' read more'), 'Привет read more');
+ equal(_('Привет, мир').prune(6, 'read a lot more'), 'Привет, мир');
+ equal(_('Привет, мир').prune(6), 'Привет...');
+ equal(_('Привет, мир').prune(8), 'Привет...');
+ equal(_('Привет, жестокий мир').prune(16), 'Привет, жестокий...');
+ equal(_('Привет, мир').prune(22), 'Привет, мир');
+ equal(_('alksjd!!!!!!....').prune(100, ''), 'alksjd!!!!!!....');
+ equal(_(123).prune(10), '123');
+ equal(_(123).prune(1, 321), '321');
+ equal(_('').prune(5), '');
+ equal(_(null).prune(5), '');
+ equal(_(undefined).prune(5), '');
+ });
+
+ test('String: isBlank', function(){
+ ok(_('').isBlank());
+ ok(_(' ').isBlank());
+ ok(_('\n').isBlank());
+ ok(!_('a').isBlank());
+ ok(!_('0').isBlank());
+ ok(!_(0).isBlank());
+ ok(_('').isBlank());
+ ok(_(null).isBlank());
+ ok(_(undefined).isBlank());
+ });
+
+ test('String: escapeRegExp', function(){
+ equal(_.escapeRegExp(/hello(?=\sworld)/.source), 'hello\\(\\?\\=\\\\sworld\\)', 'with lookahead');
+ equal(_.escapeRegExp(/hello(?!\shell)/.source), 'hello\\(\\?\\!\\\\shell\\)', 'with negative lookahead');
+ });
+
+ test('String: escapeHTML', function(){
+ equal(_('Blah & "blah" & \'blah\'
').escapeHTML(),
+ '<div>Blah & "blah" & 'blah'</div>');
+ equal(_('<').escapeHTML(), '<');
+ equal(_(5).escapeHTML(), '5');
+ equal(_('').escapeHTML(), '');
+ equal(_(null).escapeHTML(), '');
+ equal(_(undefined).escapeHTML(), '');
+ });
+
+ test('String: unescapeHTML', function(){
+ equal(_('<div>Blah & "blah" & 'blah'</div>').unescapeHTML(),
+ 'Blah & "blah" & \'blah\'
');
+ equal(_('<').unescapeHTML(), '<');
+ equal(_(''').unescapeHTML(), '\'');
+ equal(_(''').unescapeHTML(), '\'');
+ equal(_(''').unescapeHTML(), '\'');
+ equal(_('J').unescapeHTML(), 'J');
+ equal(_('J').unescapeHTML(), 'J');
+ equal(_('J').unescapeHTML(), 'J');
+ equal(_('&_#39;').unescapeHTML(), '&_#39;');
+ equal(_(''_;').unescapeHTML(), ''_;');
+ equal(_('&').unescapeHTML(), '&');
+ equal(_('&').unescapeHTML(), '&');
+ equal(_('').unescapeHTML(), '');
+ equal(_(null).unescapeHTML(), '');
+ equal(_(undefined).unescapeHTML(), '');
+ equal(_(5).unescapeHTML(), '5');
+ // equal(_(undefined).unescapeHTML(), '');
+ });
+
+ test('String: words', function() {
+ deepEqual(_('I love you!').words(), ['I', 'love', 'you!']);
+ deepEqual(_(' I love you! ').words(), ['I', 'love', 'you!']);
+ deepEqual(_('I_love_you!').words('_'), ['I', 'love', 'you!']);
+ deepEqual(_('I-love-you!').words(/-/), ['I', 'love', 'you!']);
+ deepEqual(_(123).words(), ['123'], '123 number has one word "123".');
+ deepEqual(_(0).words(), ['0'], 'Zero number has one word "0".');
+ deepEqual(_('').words(), [], 'Empty strings has no words.');
+ deepEqual(_(' ').words(), [], 'Blank strings has no words.');
+ deepEqual(_(null).words(), [], 'null has no words.');
+ deepEqual(_(undefined).words(), [], 'undefined has no words.');
+ });
+
+ test('String: chars', function() {
+ equal(_('Hello').chars().length, 5);
+ equal(_(123).chars().length, 3);
+ equal(_('').chars().length, 0);
+ equal(_(null).chars().length, 0);
+ equal(_(undefined).chars().length, 0);
+ });
+
+ test('String: swapCase', function(){
+ equal(_('AaBbCcDdEe').swapCase(), 'aAbBcCdDeE');
+ equal(_('Hello World').swapCase(), 'hELLO wORLD');
+ equal(_('').swapCase(), '');
+ equal(_(null).swapCase(), '');
+ equal(_(undefined).swapCase(), '');
+ });
+
+ test('String: lines', function() {
+ equal(_('Hello\nWorld').lines().length, 2);
+ equal(_('Hello World').lines().length, 1);
+ equal(_(123).lines().length, 1);
+ equal(_('').lines().length, 1);
+ equal(_(null).lines().length, 0);
+ equal(_(undefined).lines().length, 0);
+ });
+
+ test('String: pad', function() {
+ equal(_('1').pad(8), ' 1');
+ equal(_(1).pad(8), ' 1');
+ equal(_('1').pad(8, '0'), '00000001');
+ equal(_('1').pad(8, '0', 'left'), '00000001');
+ equal(_('1').pad(8, '0', 'right'), '10000000');
+ equal(_('1').pad(8, '0', 'both'), '00001000');
+ equal(_('foo').pad(8, '0', 'both'), '000foo00');
+ equal(_('foo').pad(7, '0', 'both'), '00foo00');
+ equal(_('foo').pad(7, '!@$%dofjrofj', 'both'), '!!foo!!');
+ equal(_('').pad(2), ' ');
+ equal(_(null).pad(2), ' ');
+ equal(_(undefined).pad(2), ' ');
+ });
+
+ test('String: lpad', function() {
+ equal(_('1').lpad(8), ' 1');
+ equal(_(1).lpad(8), ' 1');
+ equal(_('1').lpad(8, '0'), '00000001');
+ equal(_('1').lpad(8, '0', 'left'), '00000001');
+ equal(_('').lpad(2), ' ');
+ equal(_(null).lpad(2), ' ');
+ equal(_(undefined).lpad(2), ' ');
+ });
+
+ test('String: rpad', function() {
+ equal(_('1').rpad(8), '1 ');
+ equal(_(1).lpad(8), ' 1');
+ equal(_('1').rpad(8, '0'), '10000000');
+ equal(_('foo').rpad(8, '0'), 'foo00000');
+ equal(_('foo').rpad(7, '0'), 'foo0000');
+ equal(_('').rpad(2), ' ');
+ equal(_(null).rpad(2), ' ');
+ equal(_(undefined).rpad(2), ' ');
+ });
+
+ test('String: lrpad', function() {
+ equal(_('1').lrpad(8), ' 1 ');
+ equal(_(1).lrpad(8), ' 1 ');
+ equal(_('1').lrpad(8, '0'), '00001000');
+ equal(_('foo').lrpad(8, '0'), '000foo00');
+ equal(_('foo').lrpad(7, '0'), '00foo00');
+ equal(_('foo').lrpad(7, '!@$%dofjrofj'), '!!foo!!');
+ equal(_('').lrpad(2), ' ');
+ equal(_(null).lrpad(2), ' ');
+ equal(_(undefined).lrpad(2), ' ');
+ });
+
+ test('String: toNumber', function() {
+ deepEqual(_('not a number').toNumber(), NaN);
+ equal(_(0).toNumber(), 0);
+ equal(_('0').toNumber(), 0);
+ equal(_('0.0').toNumber(), 0);
+ equal(_('0.1').toNumber(), 0);
+ equal(_('0.1').toNumber(1), 0.1);
+ equal(_(' 0.1 ').toNumber(1), 0.1);
+ equal(_('0000').toNumber(), 0);
+ equal(_('2.345').toNumber(), 2);
+ equal(_('2.345').toNumber(NaN), 2);
+ equal(_('2.345').toNumber(2), 2.35);
+ equal(_('2.344').toNumber(2), 2.34);
+ equal(_('2').toNumber(2), 2.00);
+ equal(_(2).toNumber(2), 2.00);
+ equal(_(-2).toNumber(), -2);
+ equal(_('-2').toNumber(), -2);
+ equal(_('').toNumber(), 0);
+ equal(_(null).toNumber(), 0);
+ equal(_(undefined).toNumber(), 0);
+ });
+
+ test('String: numberFormat', function() {
+ equal(_.numberFormat(9000), '9,000');
+ equal(_.numberFormat(9000, 0), '9,000');
+ equal(_.numberFormat(9000, 0, '', ''), '9000');
+ equal(_.numberFormat(90000, 2), '90,000.00');
+ equal(_.numberFormat(1000.754), '1,001');
+ equal(_.numberFormat(1000.754, 2), '1,000.75');
+ equal(_.numberFormat(1000.754, 0, ',', '.'), '1.001');
+ equal(_.numberFormat(1000.754, 2, ',', '.'), '1.000,75');
+ equal(_.numberFormat(1000000.754, 2, ',', '.'), '1.000.000,75');
+ equal(_.numberFormat(1000000000), '1,000,000,000');
+ equal(_.numberFormat(100000000), '100,000,000');
+ equal(_.numberFormat('not number'), '');
+ equal(_.numberFormat(), '');
+ equal(_.numberFormat(null, '.', ','), '');
+ equal(_.numberFormat(undefined, '.', ','), '');
+ equal(_.numberFormat(new Number(5000)), '5,000');
+ });
+
+ test('String: strRight', function() {
+ equal(_('This_is_a_test_string').strRight('_'), 'is_a_test_string');
+ equal(_('This_is_a_test_string').strRight('string'), '');
+ equal(_('This_is_a_test_string').strRight(), 'This_is_a_test_string');
+ equal(_('This_is_a_test_string').strRight(''), 'This_is_a_test_string');
+ equal(_('This_is_a_test_string').strRight('-'), 'This_is_a_test_string');
+ equal(_('This_is_a_test_string').strRight(''), 'This_is_a_test_string');
+ equal(_('').strRight('foo'), '');
+ equal(_(null).strRight('foo'), '');
+ equal(_(undefined).strRight('foo'), '');
+ equal(_(12345).strRight(2), '345');
+ });
+
+ test('String: strRightBack', function() {
+ equal(_('This_is_a_test_string').strRightBack('_'), 'string');
+ equal(_('This_is_a_test_string').strRightBack('string'), '');
+ equal(_('This_is_a_test_string').strRightBack(), 'This_is_a_test_string');
+ equal(_('This_is_a_test_string').strRightBack(''), 'This_is_a_test_string');
+ equal(_('This_is_a_test_string').strRightBack('-'), 'This_is_a_test_string');
+ equal(_('').strRightBack('foo'), '');
+ equal(_(null).strRightBack('foo'), '');
+ equal(_(undefined).strRightBack('foo'), '');
+ equal(_(12345).strRightBack(2), '345');
+ });
+
+ test('String: strLeft', function() {
+ equal(_('This_is_a_test_string').strLeft('_'), 'This');
+ equal(_('This_is_a_test_string').strLeft('This'), '');
+ equal(_('This_is_a_test_string').strLeft(), 'This_is_a_test_string');
+ equal(_('This_is_a_test_string').strLeft(''), 'This_is_a_test_string');
+ equal(_('This_is_a_test_string').strLeft('-'), 'This_is_a_test_string');
+ equal(_('').strLeft('foo'), '');
+ equal(_(null).strLeft('foo'), '');
+ equal(_(undefined).strLeft('foo'), '');
+ equal(_(123454321).strLeft(3), '12');
+ });
+
+ test('String: strLeftBack', function() {
+ equal(_('This_is_a_test_string').strLeftBack('_'), 'This_is_a_test');
+ equal(_('This_is_a_test_string').strLeftBack('This'), '');
+ equal(_('This_is_a_test_string').strLeftBack(), 'This_is_a_test_string');
+ equal(_('This_is_a_test_string').strLeftBack(''), 'This_is_a_test_string');
+ equal(_('This_is_a_test_string').strLeftBack('-'), 'This_is_a_test_string');
+ equal(_('').strLeftBack('foo'), '');
+ equal(_(null).strLeftBack('foo'), '');
+ equal(_(undefined).strLeftBack('foo'), '');
+ equal(_(123454321).strLeftBack(3), '123454');
+ });
+
+ test('Strings: stripTags', function() {
+ equal(_('a link ').stripTags(), 'a link');
+ equal(_('a link
+
+
+
+
+
+
+
+
+
+ 
- 
- 
- 
- 
- 
- 
- 
- 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+ 
+
+
+### Documentation
+
+Visit the [gruntjs.com](http://gruntjs.com/) website for all the things.
+
+### Support / Contributing
+Before you make an issue, please read our [Contributing](http://gruntjs.com/contributing) guide.
+
+You can find the grunt team in [#grunt on irc.freenode.net](http://webchat.freenode.net/?channels=grunt).
+
+### Release History
+See the [CHANGELOG](CHANGELOG).
diff --git a/node_modules/grunt/appveyor.yml b/node_modules/grunt/appveyor.yml
new file mode 100644
index 0000000..4cbe6d9
--- /dev/null
+++ b/node_modules/grunt/appveyor.yml
@@ -0,0 +1,43 @@
+# http://www.appveyor.com/docs/appveyor-yml
+
+# Fix line endings in Windows. (runs before repo cloning)
+init:
+ - git config --global core.autocrlf input
+
+# Test against these versions of Node.js.
+environment:
+ matrix:
+ - nodejs_version: "0.10"
+ - nodejs_version: "0.8"
+ - nodejs_version: "0.11"
+
+# Allow failing jobs for bleeding-edge Node.js versions.
+matrix:
+ allow_failures:
+ - nodejs_version: "0.11"
+
+# Install scripts. (runs after repo cloning)
+install:
+ # Get the latest stable version of Node 0.STABLE.latest
+ - ps: Update-NodeJsInstallation (Get-NodeJsLatestBuild $env:nodejs_version)
+ # Typical npm stuff.
+ - npm install
+ # Grunt-specific stuff.
+ - npm install -g grunt-cli
+ - npm uninstall grunt # https://github.com/npm/npm/issues/3958
+
+# Post-install test scripts.
+test_script:
+ # Output useful info for debugging.
+ - node --version
+ - npm --version
+ # We test multiple Windows shells because of prior stdout buffering issues
+ # filed against Grunt. https://github.com/joyent/node/issues/3584
+ - ps: "npm test # PowerShell" # Pass comment to PS for easier debugging
+ - cmd: npm test
+
+# Don't actually build.
+build: off
+
+# Set build version format here instead of in the admin panel.
+version: "{build}"
diff --git a/node_modules/grunt/internal-tasks/bump.js b/node_modules/grunt/internal-tasks/bump.js
new file mode 100644
index 0000000..d690bc4
--- /dev/null
+++ b/node_modules/grunt/internal-tasks/bump.js
@@ -0,0 +1,151 @@
+/*
+ * grunt-contrib-bump
+ * http://gruntjs.com/
+ *
+ * Copyright (c) 2014 "Cowboy" Ben Alman, contributors
+ * Licensed under the MIT license.
+ */
+
+'use strict';
+
+var semver = require('semver');
+var shell = require('shelljs');
+
+module.exports = function(grunt) {
+
+ grunt.registerTask('bump', 'Bump the version property of a JSON file.', function() {
+ // Validate specified semver increment modes.
+ var valids = ['major', 'minor', 'patch', 'prerelease'];
+ var modes = [];
+ this.args.forEach(function(mode) {
+ var matches = [];
+ valids.forEach(function(valid) {
+ if (valid.indexOf(mode) === 0) { matches.push(valid); }
+ });
+ if (matches.length === 0) {
+ grunt.log.error('Error: mode "' + mode + '" does not match any known modes.');
+ } else if (matches.length > 1) {
+ grunt.log.error('Error: mode "' + mode + '" is ambiguous (possibly: ' + matches.join(', ') + ').');
+ } else {
+ modes.push(matches[0]);
+ }
+ });
+ if (this.errorCount === 0 && modes.length === 0) {
+ grunt.log.error('Error: no modes specified.');
+ }
+ if (this.errorCount > 0) {
+ grunt.log.error('Valid modes are: ' + valids.join(', ') + '.');
+ throw new Error('Use valid modes (or unambiguous mode abbreviations).');
+ }
+ // Options.
+ var options = this.options({
+ filepaths: ['package.json'],
+ syncVersions: false,
+ commit: true,
+ commitMessage: 'Bumping version to {%= version %}.',
+ tag: true,
+ tagName: 'v{%= version %}',
+ tagMessage: 'Version {%= version %}',
+ tagPrerelease: false,
+ });
+ // Normalize filepaths to array.
+ var filepaths = Array.isArray(options.filepaths) ? options.filepaths : [options.filepaths];
+ // Process JSON files, in-order.
+ var versions = {};
+ filepaths.forEach(function(filepath) {
+ var o = grunt.file.readJSON(filepath);
+ var origVersion = o.version;
+ // If syncVersions is enabled, only grab version from the first file,
+ // guaranteeing new versions will always be in sync.
+ var firstVersion = Object.keys(versions)[0];
+ if (options.syncVersions && firstVersion) {
+ o.version = firstVersion;
+ }
+ modes.forEach(function(mode) {
+ var orig = o.version;
+ var s = semver.parse(o.version);
+ s.inc(mode);
+ o.version = String(s);
+ // Workaround for https://github.com/isaacs/node-semver/issues/50
+ if (/-/.test(orig) && mode === 'patch') {
+ o.version = o.version.replace(/\d+$/, function(n) { return n - 1; });
+ }
+ // If prerelease on an un-prerelease version, bump patch version first
+ if (!/-/.test(orig) && mode === 'prerelease') {
+ s.inc('patch');
+ s.inc('prerelease');
+ o.version = String(s);
+ }
+ });
+ if (versions[origVersion]) {
+ versions[origVersion].filepaths.push(filepath);
+ } else {
+ versions[origVersion] = {version: o.version, filepaths: [filepath]};
+ }
+ // Actually *do* something.
+ grunt.log.write('Bumping version in ' + filepath + ' from ' + origVersion + ' to ' + o.version + '...');
+ grunt.file.write(filepath, JSON.stringify(o, null, 2));
+ grunt.log.ok();
+ });
+ // Commit changed files?
+ if (options.commit) {
+ Object.keys(versions).forEach(function(origVersion) {
+ var o = versions[origVersion];
+ commit(o.filepaths, processTemplate(options.commitMessage, {
+ version: o.version,
+ origVersion: origVersion
+ }));
+ });
+ }
+ // We're only going to create one tag. And it's going to be the new
+ // version of the first bumped file. Because, sanity.
+ var newVersion = versions[Object.keys(versions)[0]].version;
+ if (options.tag) {
+ if (options.tagPrerelease || modes.indexOf('prerelease') === -1) {
+ tag(
+ processTemplate(options.tagName, {version: newVersion}),
+ processTemplate(options.tagMessage, {version: newVersion})
+ );
+ } else {
+ grunt.log.writeln('Not tagging (prerelease version).');
+ }
+ }
+ if (this.errorCount > 0) {
+ grunt.warn('There were errors.');
+ }
+ });
+
+ // Using custom delimiters keeps templates from being auto-processed.
+ grunt.template.addDelimiters('bump', '{%', '%}');
+
+ function processTemplate(message, data) {
+ return grunt.template.process(message, {
+ delimiters: 'bump',
+ data: data,
+ });
+ }
+
+ // Kinda borrowed from https://github.com/geddski/grunt-release
+ function commit(filepaths, message) {
+ grunt.log.writeln('Committing ' + filepaths.join(', ') + ' with message: ' + message);
+ run("git commit -m '" + message + "' '" + filepaths.join("' '") + "'");
+ }
+
+ function tag(name, message) {
+ grunt.log.writeln('Tagging ' + name + ' with message: ' + message);
+ run("git tag '" + name + "' -m '" + message + "'");
+ }
+
+ function run(cmd) {
+ if (grunt.option('no-write')) {
+ grunt.verbose.writeln('Not actually running: ' + cmd);
+ } else {
+ grunt.verbose.writeln('Running: ' + cmd);
+ var result = shell.exec(cmd, {silent:true});
+ if (result.code !== 0) {
+ grunt.log.error('Error (' + result.code + ') ' + result.output);
+ }
+ }
+ }
+
+};
\ No newline at end of file
diff --git a/node_modules/grunt/internal-tasks/subgrunt.js b/node_modules/grunt/internal-tasks/subgrunt.js
new file mode 100644
index 0000000..95b5c67
--- /dev/null
+++ b/node_modules/grunt/internal-tasks/subgrunt.js
@@ -0,0 +1,34 @@
+/*
+ * grunt
+ * http://gruntjs.com/
+ *
+ * Copyright (c) 2014 "Cowboy" Ben Alman
+ * Licensed under the MIT license.
+ * https://github.com/gruntjs/grunt/blob/master/LICENSE-MIT
+ */
+
+'use strict';
+
+module.exports = function(grunt) {
+
+ // Run sub-grunt files, because right now, testing tasks is a pain.
+ grunt.registerMultiTask('subgrunt', 'Run a sub-gruntfile.', function() {
+ var path = require('path');
+ grunt.util.async.forEachSeries(this.filesSrc, function(gruntfile, next) {
+ grunt.log.write('Loading ' + gruntfile + '...');
+ grunt.util.spawn({
+ grunt: true,
+ args: ['--gruntfile', path.resolve(gruntfile)],
+ }, function(error, result) {
+ if (error) {
+ grunt.log.error().error(result.stdout).writeln();
+ next(new Error('Error running sub-gruntfile "' + gruntfile + '".'));
+ } else {
+ grunt.log.ok().verbose.ok(result.stdout);
+ next();
+ }
+ });
+ }, this.async());
+ });
+
+};
diff --git a/node_modules/grunt/lib/grunt.js b/node_modules/grunt/lib/grunt.js
new file mode 100644
index 0000000..611799a
--- /dev/null
+++ b/node_modules/grunt/lib/grunt.js
@@ -0,0 +1,165 @@
+/*
+ * grunt
+ * http://gruntjs.com/
+ *
+ * Copyright (c) 2014 "Cowboy" Ben Alman
+ * Licensed under the MIT license.
+ * https://github.com/gruntjs/grunt/blob/master/LICENSE-MIT
+ */
+
+'use strict';
+
+// Nodejs libs.
+var path = require('path');
+
+// This allows grunt to require() .coffee files.
+require('coffee-script');
+
+// The module to be exported.
+var grunt = module.exports = {};
+
+// Expose internal grunt libs.
+function gRequire(name) {
+ return grunt[name] = require('./grunt/' + name);
+}
+
+var util = require('grunt-legacy-util');
+grunt.util = util;
+grunt.util.task = require('./util/task');
+
+var Log = require('grunt-legacy-log').Log;
+var log = new Log({grunt: grunt});
+grunt.log = log;
+
+gRequire('template');
+gRequire('event');
+var fail = gRequire('fail');
+gRequire('file');
+var option = gRequire('option');
+var config = gRequire('config');
+var task = gRequire('task');
+var help = gRequire('help');
+gRequire('cli');
+var verbose = grunt.verbose = log.verbose;
+
+// Expose some grunt metadata.
+grunt.package = require('../package.json');
+grunt.version = grunt.package.version;
+
+// Expose specific grunt lib methods on grunt.
+function gExpose(obj, methodName, newMethodName) {
+ grunt[newMethodName || methodName] = obj[methodName].bind(obj);
+}
+gExpose(task, 'registerTask');
+gExpose(task, 'registerMultiTask');
+gExpose(task, 'registerInitTask');
+gExpose(task, 'renameTask');
+gExpose(task, 'loadTasks');
+gExpose(task, 'loadNpmTasks');
+gExpose(config, 'init', 'initConfig');
+gExpose(fail, 'warn');
+gExpose(fail, 'fatal');
+
+// Expose the task interface. I've never called this manually, and have no idea
+// how it will work. But it might.
+grunt.tasks = function(tasks, options, done) {
+ // Update options with passed-in options.
+ option.init(options);
+
+ // Display the grunt version and quit if the user did --version.
+ var _tasks, _options;
+ if (option('version')) {
+ // Not --verbose.
+ log.writeln('grunt v' + grunt.version);
+
+ if (option('verbose')) {
+ // --verbose
+ verbose.writeln('Install path: ' + path.resolve(__dirname, '..'));
+ // Yes, this is a total hack, but we don't want to log all that verbose
+ // task initialization stuff here.
+ grunt.log.muted = true;
+ // Initialize task system so that available tasks can be listed.
+ grunt.task.init([], {help: true});
+ // Re-enable logging.
+ grunt.log.muted = false;
+
+ // Display available tasks (for shell completion, etc).
+ _tasks = Object.keys(grunt.task._tasks).sort();
+ verbose.writeln('Available tasks: ' + _tasks.join(' '));
+
+ // Display available options (for shell completion, etc).
+ _options = [];
+ Object.keys(grunt.cli.optlist).forEach(function(long) {
+ var o = grunt.cli.optlist[long];
+ _options.push('--' + (o.negate ? 'no-' : '') + long);
+ if (o.short) { _options.push('-' + o.short); }
+ });
+ verbose.writeln('Available options: ' + _options.join(' '));
+ }
+
+ return;
+ }
+
+ // Init colors.
+ log.initColors();
+
+ // Display help and quit if the user did --help.
+ if (option('help')) {
+ help.display();
+ return;
+ }
+
+ // A little header stuff.
+ verbose.header('Initializing').writeflags(option.flags(), 'Command-line options');
+
+ // Determine and output which tasks will be run.
+ var tasksSpecified = tasks && tasks.length > 0;
+ tasks = task.parseArgs([tasksSpecified ? tasks : 'default']);
+
+ // Initialize tasks.
+ task.init(tasks);
+
+ verbose.writeln();
+ if (!tasksSpecified) {
+ verbose.writeln('No tasks specified, running default tasks.');
+ }
+ verbose.writeflags(tasks, 'Running tasks');
+
+ // Handle otherwise unhandleable (probably asynchronous) exceptions.
+ var uncaughtHandler = function(e) {
+ fail.fatal(e, fail.code.TASK_FAILURE);
+ };
+ process.on('uncaughtException', uncaughtHandler);
+
+ // Report, etc when all tasks have completed.
+ task.options({
+ error: function(e) {
+ fail.warn(e, fail.code.TASK_FAILURE);
+ },
+ done: function() {
+ // Stop handling uncaught exceptions so that we don't leave any
+ // unwanted process-level side effects behind. There is no need to do
+ // this in the error callback, because fail.warn() will either kill
+ // the process, or with --force keep on going all the way here.
+ process.removeListener('uncaughtException', uncaughtHandler);
+
+ // Output a final fail / success report.
+ fail.report();
+
+ if (done) {
+ // Execute "done" function when done (only if passed, of course).
+ done();
+ } else {
+ // Otherwise, explicitly exit.
+ util.exit(0);
+ }
+ }
+ });
+
+ // Execute all tasks, in order. Passing each task individually in a forEach
+ // allows the error callback to execute multiple times.
+ tasks.forEach(function(name) { task.run(name); });
+ // Run tasks async internally to reduce call-stack, per:
+ // https://github.com/gruntjs/grunt/pull/1026
+ task.start({asyncDone:true});
+};
diff --git a/node_modules/grunt/lib/grunt/cli.js b/node_modules/grunt/lib/grunt/cli.js
new file mode 100644
index 0000000..7938cf1
--- /dev/null
+++ b/node_modules/grunt/lib/grunt/cli.js
@@ -0,0 +1,128 @@
+/*
+ * grunt
+ * http://gruntjs.com/
+ *
+ * Copyright (c) 2014 "Cowboy" Ben Alman
+ * Licensed under the MIT license.
+ * https://github.com/gruntjs/grunt/blob/master/LICENSE-MIT
+ */
+
+'use strict';
+
+var grunt = require('../grunt');
+
+// Nodejs libs.
+var path = require('path');
+
+// External libs.
+var nopt = require('nopt');
+
+// This is only executed when run via command line.
+var cli = module.exports = function(options, done) {
+ // CLI-parsed options override any passed-in "default" options.
+ if (options) {
+ // For each default option...
+ Object.keys(options).forEach(function(key) {
+ if (!(key in cli.options)) {
+ // If this option doesn't exist in the parsed cli.options, add it in.
+ cli.options[key] = options[key];
+ } else if (cli.optlist[key].type === Array) {
+ // If this option's type is Array, append it to any existing array
+ // (or create a new array).
+ [].push.apply(cli.options[key], options[key]);
+ }
+ });
+ }
+
+ // Run tasks.
+ grunt.tasks(cli.tasks, cli.options, done);
+};
+
+// Default options.
+var optlist = cli.optlist = {
+ help: {
+ short: 'h',
+ info: 'Display this help text.',
+ type: Boolean
+ },
+ base: {
+ info: 'Specify an alternate base path. By default, all file paths are relative to the Gruntfile. (grunt.file.setBase) *',
+ type: path
+ },
+ color: {
+ info: 'Disable colored output.',
+ type: Boolean,
+ negate: true
+ },
+ gruntfile: {
+ info: 'Specify an alternate Gruntfile. By default, grunt looks in the current or parent directories for the nearest Gruntfile.js or Gruntfile.coffee file.',
+ type: path
+ },
+ debug: {
+ short: 'd',
+ info: 'Enable debugging mode for tasks that support it.',
+ type: [Number, Boolean]
+ },
+ stack: {
+ info: 'Print a stack trace when exiting with a warning or fatal error.',
+ type: Boolean
+ },
+ force: {
+ short: 'f',
+ info: 'A way to force your way past warnings. Want a suggestion? Don\'t use this option, fix your code.',
+ type: Boolean
+ },
+ tasks: {
+ info: 'Additional directory paths to scan for task and "extra" files. (grunt.loadTasks) *',
+ type: Array
+ },
+ npm: {
+ info: 'Npm-installed grunt plugins to scan for task and "extra" files. (grunt.loadNpmTasks) *',
+ type: Array
+ },
+ write: {
+ info: 'Disable writing files (dry run).',
+ type: Boolean,
+ negate: true
+ },
+ verbose: {
+ short: 'v',
+ info: 'Verbose mode. A lot more information output.',
+ type: Boolean
+ },
+ version: {
+ short: 'V',
+ info: 'Print the grunt version. Combine with --verbose for more info.',
+ type: Boolean
+ },
+ // Even though shell auto-completion is now handled by grunt-cli, leave this
+ // option here for display in the --help screen.
+ completion: {
+ info: 'Output shell auto-completion rules. See the grunt-cli documentation for more information.',
+ type: String
+ },
+};
+
+// Parse `optlist` into a form that nopt can handle.
+var aliases = {};
+var known = {};
+
+Object.keys(optlist).forEach(function(key) {
+ var short = optlist[key].short;
+ if (short) {
+ aliases[short] = '--' + key;
+ }
+ known[key] = optlist[key].type;
+});
+
+var parsed = nopt(known, aliases, process.argv, 2);
+cli.tasks = parsed.argv.remain;
+cli.options = parsed;
+delete parsed.argv;
+
+// Initialize any Array options that weren't initialized.
+Object.keys(optlist).forEach(function(key) {
+ if (optlist[key].type === Array && !(key in cli.options)) {
+ cli.options[key] = [];
+ }
+});
diff --git a/node_modules/grunt/lib/grunt/config.js b/node_modules/grunt/lib/grunt/config.js
new file mode 100644
index 0000000..59b8242
--- /dev/null
+++ b/node_modules/grunt/lib/grunt/config.js
@@ -0,0 +1,124 @@
+/*
+ * grunt
+ * http://gruntjs.com/
+ *
+ * Copyright (c) 2014 "Cowboy" Ben Alman
+ * Licensed under the MIT license.
+ * https://github.com/gruntjs/grunt/blob/master/LICENSE-MIT
+ */
+
+'use strict';
+
+var grunt = require('../grunt');
+
+// Get/set config data. If value was passed, set. Otherwise, get.
+var config = module.exports = function(prop, value) {
+ if (arguments.length === 2) {
+ // Two arguments were passed, set the property's value.
+ return config.set(prop, value);
+ } else {
+ // Get the property's value (or the entire data object).
+ return config.get(prop);
+ }
+};
+
+// The actual config data.
+config.data = {};
+
+// Escape any . in name with \. so dot-based namespacing works properly.
+config.escape = function(str) {
+ return str.replace(/\./g, '\\.');
+};
+
+// Return prop as a string.
+config.getPropString = function(prop) {
+ return Array.isArray(prop) ? prop.map(config.escape).join('.') : prop;
+};
+
+// Get raw, unprocessed config data.
+config.getRaw = function(prop) {
+ if (prop) {
+ // Prop was passed, get that specific property's value.
+ return grunt.util.namespace.get(config.data, config.getPropString(prop));
+ } else {
+ // No prop was passed, return the entire config.data object.
+ return config.data;
+ }
+};
+
+// Match '<%= FOO %>' where FOO is a propString, eg. foo or foo.bar but not
+// a method call like foo() or foo.bar().
+var propStringTmplRe = /^<%=\s*([a-z0-9_$]+(?:\.[a-z0-9_$]+)*)\s*%>$/i;
+
+// Get config data, recursively processing templates.
+config.get = function(prop) {
+ return config.process(config.getRaw(prop));
+};
+
+// Expand a config value recursively. Used for post-processing raw values
+// already retrieved from the config.
+config.process = function(raw) {
+ return grunt.util.recurse(raw, function(value) {
+ // If the value is not a string, return it.
+ if (typeof value !== 'string') { return value; }
+ // If possible, access the specified property via config.get, in case it
+ // doesn't refer to a string, but instead refers to an object or array.
+ var matches = value.match(propStringTmplRe);
+ var result;
+ if (matches) {
+ result = config.get(matches[1]);
+ // If the result retrieved from the config data wasn't null or undefined,
+ // return it.
+ if (result != null) { return result; }
+ }
+ // Process the string as a template.
+ return grunt.template.process(value, {data: config.data});
+ });
+};
+
+// Set config data.
+config.set = function(prop, value) {
+ return grunt.util.namespace.set(config.data, config.getPropString(prop), value);
+};
+
+// Deep merge config data.
+config.merge = function(obj) {
+ grunt.util._.merge(config.data, obj);
+ return config.data;
+};
+
+// Initialize config data.
+config.init = function(obj) {
+ grunt.verbose.write('Initializing config...').ok();
+ // Initialize and return data.
+ return (config.data = obj || {});
+};
+
+// Test to see if required config params have been defined. If not, throw an
+// exception (use this inside of a task).
+config.requires = function() {
+ var p = grunt.util.pluralize;
+ var props = grunt.util.toArray(arguments).map(config.getPropString);
+ var msg = 'Verifying propert' + p(props.length, 'y/ies') +
+ ' ' + grunt.log.wordlist(props) + ' exist' + p(props.length, 's') +
+ ' in config...';
+ grunt.verbose.write(msg);
+ var failProps = config.data && props.filter(function(prop) {
+ return config.get(prop) == null;
+ }).map(function(prop) {
+ return '"' + prop + '"';
+ });
+ if (config.data && failProps.length === 0) {
+ grunt.verbose.ok();
+ return true;
+ } else {
+ grunt.verbose.or.write(msg);
+ grunt.log.error().error('Unable to process task.');
+ if (!config.data) {
+ throw grunt.util.error('Unable to load config.');
+ } else {
+ throw grunt.util.error('Required config propert' +
+ p(failProps.length, 'y/ies') + ' ' + failProps.join(', ') + ' missing.');
+ }
+ }
+};
diff --git a/node_modules/grunt/lib/grunt/event.js b/node_modules/grunt/lib/grunt/event.js
new file mode 100644
index 0000000..f9ed336
--- /dev/null
+++ b/node_modules/grunt/lib/grunt/event.js
@@ -0,0 +1,16 @@
+/*
+ * grunt
+ * http://gruntjs.com/
+ *
+ * Copyright (c) 2014 "Cowboy" Ben Alman
+ * Licensed under the MIT license.
+ * https://github.com/gruntjs/grunt/blob/master/LICENSE-MIT
+ */
+
+'use strict';
+
+// External lib.
+var EventEmitter2 = require('eventemitter2').EventEmitter2;
+
+// Awesome.
+module.exports = new EventEmitter2({wildcard: true});
diff --git a/node_modules/grunt/lib/grunt/fail.js b/node_modules/grunt/lib/grunt/fail.js
new file mode 100644
index 0000000..f53c65c
--- /dev/null
+++ b/node_modules/grunt/lib/grunt/fail.js
@@ -0,0 +1,84 @@
+/*
+ * grunt
+ * http://gruntjs.com/
+ *
+ * Copyright (c) 2014 "Cowboy" Ben Alman
+ * Licensed under the MIT license.
+ * https://github.com/gruntjs/grunt/blob/master/LICENSE-MIT
+ */
+
+'use strict';
+
+var grunt = require('../grunt');
+
+// The module to be exported.
+var fail = module.exports = {};
+
+// Error codes.
+fail.code = {
+ FATAL_ERROR: 1,
+ MISSING_GRUNTFILE: 2,
+ TASK_FAILURE: 3,
+ TEMPLATE_ERROR: 4,
+ INVALID_AUTOCOMPLETE: 5,
+ WARNING: 6,
+};
+
+// DRY it up!
+function writeln(e, mode) {
+ grunt.log.muted = false;
+ var msg = String(e.message || e);
+ if (!grunt.option('no-color')) { msg += '\x07'; } // Beep!
+ if (mode === 'warn') {
+ msg = 'Warning: ' + msg + ' ';
+ msg += (grunt.option('force') ? 'Used --force, continuing.'.underline : 'Use --force to continue.');
+ msg = msg.yellow;
+ } else {
+ msg = ('Fatal error: ' + msg).red;
+ }
+ grunt.log.writeln(msg);
+}
+
+// If --stack is enabled, log the appropriate error stack (if it exists).
+function dumpStack(e) {
+ if (grunt.option('stack')) {
+ if (e.origError && e.origError.stack) {
+ console.log(e.origError.stack);
+ } else if (e.stack) {
+ console.log(e.stack);
+ }
+ }
+}
+
+// A fatal error occurred. Abort immediately.
+fail.fatal = function(e, errcode) {
+ writeln(e, 'fatal');
+ dumpStack(e);
+ grunt.util.exit(typeof errcode === 'number' ? errcode : fail.code.FATAL_ERROR);
+};
+
+// Keep track of error and warning counts.
+fail.errorcount = 0;
+fail.warncount = 0;
+
+// A warning occurred. Abort immediately unless -f or --force was used.
+fail.warn = function(e, errcode) {
+ var message = typeof e === 'string' ? e : e.message;
+ fail.warncount++;
+ writeln(message, 'warn');
+ // If -f or --force aren't used, stop script processing.
+ if (!grunt.option('force')) {
+ dumpStack(e);
+ grunt.log.writeln().fail('Aborted due to warnings.');
+ grunt.util.exit(typeof errcode === 'number' ? errcode : fail.code.WARNING);
+ }
+};
+
+// This gets called at the very end.
+fail.report = function() {
+ if (fail.warncount > 0) {
+ grunt.log.writeln().fail('Done, but with warnings.');
+ } else {
+ grunt.log.writeln().success('Done, without errors.');
+ }
+};
diff --git a/node_modules/grunt/lib/grunt/file.js b/node_modules/grunt/lib/grunt/file.js
new file mode 100644
index 0000000..100561d
--- /dev/null
+++ b/node_modules/grunt/lib/grunt/file.js
@@ -0,0 +1,448 @@
+/*
+ * grunt
+ * http://gruntjs.com/
+ *
+ * Copyright (c) 2014 "Cowboy" Ben Alman
+ * Licensed under the MIT license.
+ * https://github.com/gruntjs/grunt/blob/master/LICENSE-MIT
+ */
+
+'use strict';
+
+var grunt = require('../grunt');
+
+// Nodejs libs.
+var fs = require('fs');
+var path = require('path');
+
+// The module to be exported.
+var file = module.exports = {};
+
+// External libs.
+file.glob = require('glob');
+file.minimatch = require('minimatch');
+file.findup = require('findup-sync');
+var YAML = require('js-yaml');
+var rimraf = require('rimraf');
+var iconv = require('iconv-lite');
+
+// Windows?
+var win32 = process.platform === 'win32';
+
+// Normalize \\ paths to / paths.
+var unixifyPath = function(filepath) {
+ if (win32) {
+ return filepath.replace(/\\/g, '/');
+ } else {
+ return filepath;
+ }
+};
+
+// Change the current base path (ie, CWD) to the specified path.
+file.setBase = function() {
+ var dirpath = path.join.apply(path, arguments);
+ process.chdir(dirpath);
+};
+
+// Process specified wildcard glob patterns or filenames against a
+// callback, excluding and uniquing files in the result set.
+var processPatterns = function(patterns, fn) {
+ // Filepaths to return.
+ var result = [];
+ // Iterate over flattened patterns array.
+ grunt.util._.flatten(patterns).forEach(function(pattern) {
+ // If the first character is ! it should be omitted
+ var exclusion = pattern.indexOf('!') === 0;
+ // If the pattern is an exclusion, remove the !
+ if (exclusion) { pattern = pattern.slice(1); }
+ // Find all matching files for this pattern.
+ var matches = fn(pattern);
+ if (exclusion) {
+ // If an exclusion, remove matching files.
+ result = grunt.util._.difference(result, matches);
+ } else {
+ // Otherwise add matching files.
+ result = grunt.util._.union(result, matches);
+ }
+ });
+ return result;
+};
+
+// Match a filepath or filepaths against one or more wildcard patterns. Returns
+// all matching filepaths.
+file.match = function(options, patterns, filepaths) {
+ if (grunt.util.kindOf(options) !== 'object') {
+ filepaths = patterns;
+ patterns = options;
+ options = {};
+ }
+ // Return empty set if either patterns or filepaths was omitted.
+ if (patterns == null || filepaths == null) { return []; }
+ // Normalize patterns and filepaths to arrays.
+ if (!Array.isArray(patterns)) { patterns = [patterns]; }
+ if (!Array.isArray(filepaths)) { filepaths = [filepaths]; }
+ // Return empty set if there are no patterns or filepaths.
+ if (patterns.length === 0 || filepaths.length === 0) { return []; }
+ // Return all matching filepaths.
+ return processPatterns(patterns, function(pattern) {
+ return file.minimatch.match(filepaths, pattern, options);
+ });
+};
+
+// Match a filepath or filepaths against one or more wildcard patterns. Returns
+// true if any of the patterns match.
+file.isMatch = function() {
+ return file.match.apply(file, arguments).length > 0;
+};
+
+// Return an array of all file paths that match the given wildcard patterns.
+file.expand = function() {
+ var args = grunt.util.toArray(arguments);
+ // If the first argument is an options object, save those options to pass
+ // into the file.glob.sync method.
+ var options = grunt.util.kindOf(args[0]) === 'object' ? args.shift() : {};
+ // Use the first argument if it's an Array, otherwise convert the arguments
+ // object to an array and use that.
+ var patterns = Array.isArray(args[0]) ? args[0] : args;
+ // Return empty set if there are no patterns or filepaths.
+ if (patterns.length === 0) { return []; }
+ // Return all matching filepaths.
+ var matches = processPatterns(patterns, function(pattern) {
+ // Find all matching files for this pattern.
+ return file.glob.sync(pattern, options);
+ });
+ // Filter result set?
+ if (options.filter) {
+ matches = matches.filter(function(filepath) {
+ filepath = path.join(options.cwd || '', filepath);
+ try {
+ if (typeof options.filter === 'function') {
+ return options.filter(filepath);
+ } else {
+ // If the file is of the right type and exists, this should work.
+ return fs.statSync(filepath)[options.filter]();
+ }
+ } catch(e) {
+ // Otherwise, it's probably not the right type.
+ return false;
+ }
+ });
+ }
+ return matches;
+};
+
+var pathSeparatorRe = /[\/\\]/g;
+
+// The "ext" option refers to either everything after the first dot (default)
+// or everything after the last dot.
+var extDotRe = {
+ first: /(\.[^\/]*)?$/,
+ last: /(\.[^\/\.]*)?$/,
+};
+
+// Build a multi task "files" object dynamically.
+file.expandMapping = function(patterns, destBase, options) {
+ options = grunt.util._.defaults({}, options, {
+ extDot: 'first',
+ rename: function(destBase, destPath) {
+ return path.join(destBase || '', destPath);
+ }
+ });
+ var files = [];
+ var fileByDest = {};
+ // Find all files matching pattern, using passed-in options.
+ file.expand(options, patterns).forEach(function(src) {
+ var destPath = src;
+ // Flatten?
+ if (options.flatten) {
+ destPath = path.basename(destPath);
+ }
+ // Change the extension?
+ if ('ext' in options) {
+ destPath = destPath.replace(extDotRe[options.extDot], options.ext);
+ }
+ // Generate destination filename.
+ var dest = options.rename(destBase, destPath, options);
+ // Prepend cwd to src path if necessary.
+ if (options.cwd) { src = path.join(options.cwd, src); }
+ // Normalize filepaths to be unix-style.
+ dest = dest.replace(pathSeparatorRe, '/');
+ src = src.replace(pathSeparatorRe, '/');
+ // Map correct src path to dest path.
+ if (fileByDest[dest]) {
+ // If dest already exists, push this src onto that dest's src array.
+ fileByDest[dest].src.push(src);
+ } else {
+ // Otherwise create a new src-dest file mapping object.
+ files.push({
+ src: [src],
+ dest: dest,
+ });
+ // And store a reference for later use.
+ fileByDest[dest] = files[files.length - 1];
+ }
+ });
+ return files;
+};
+
+// Like mkdir -p. Create a directory and any intermediary directories.
+file.mkdir = function(dirpath, mode) {
+ if (grunt.option('no-write')) { return; }
+ // Set directory mode in a strict-mode-friendly way.
+ if (mode == null) {
+ mode = parseInt('0777', 8) & (~process.umask());
+ }
+ dirpath.split(pathSeparatorRe).reduce(function(parts, part) {
+ parts += part + '/';
+ var subpath = path.resolve(parts);
+ if (!file.exists(subpath)) {
+ try {
+ fs.mkdirSync(subpath, mode);
+ } catch(e) {
+ throw grunt.util.error('Unable to create directory "' + subpath + '" (Error code: ' + e.code + ').', e);
+ }
+ }
+ return parts;
+ }, '');
+};
+
+// Recurse into a directory, executing callback for each file.
+file.recurse = function recurse(rootdir, callback, subdir) {
+ var abspath = subdir ? path.join(rootdir, subdir) : rootdir;
+ fs.readdirSync(abspath).forEach(function(filename) {
+ var filepath = path.join(abspath, filename);
+ if (fs.statSync(filepath).isDirectory()) {
+ recurse(rootdir, callback, unixifyPath(path.join(subdir || '', filename || '')));
+ } else {
+ callback(unixifyPath(filepath), rootdir, subdir, filename);
+ }
+ });
+};
+
+// The default file encoding to use.
+file.defaultEncoding = 'utf8';
+// Whether to preserve the BOM on file.read rather than strip it.
+file.preserveBOM = false;
+
+// Read a file, return its contents.
+file.read = function(filepath, options) {
+ if (!options) { options = {}; }
+ var contents;
+ grunt.verbose.write('Reading ' + filepath + '...');
+ try {
+ contents = fs.readFileSync(String(filepath));
+ // If encoding is not explicitly null, convert from encoded buffer to a
+ // string. If no encoding was specified, use the default.
+ if (options.encoding !== null) {
+ contents = iconv.decode(contents, options.encoding || file.defaultEncoding);
+ // Strip any BOM that might exist.
+ if (!file.preserveBOM && contents.charCodeAt(0) === 0xFEFF) {
+ contents = contents.substring(1);
+ }
+ }
+ grunt.verbose.ok();
+ return contents;
+ } catch(e) {
+ grunt.verbose.error();
+ throw grunt.util.error('Unable to read "' + filepath + '" file (Error code: ' + e.code + ').', e);
+ }
+};
+
+// Read a file, parse its contents, return an object.
+file.readJSON = function(filepath, options) {
+ var src = file.read(filepath, options);
+ var result;
+ grunt.verbose.write('Parsing ' + filepath + '...');
+ try {
+ result = JSON.parse(src);
+ grunt.verbose.ok();
+ return result;
+ } catch(e) {
+ grunt.verbose.error();
+ throw grunt.util.error('Unable to parse "' + filepath + '" file (' + e.message + ').', e);
+ }
+};
+
+// Read a YAML file, parse its contents, return an object.
+file.readYAML = function(filepath, options) {
+ var src = file.read(filepath, options);
+ var result;
+ grunt.verbose.write('Parsing ' + filepath + '...');
+ try {
+ result = YAML.load(src);
+ grunt.verbose.ok();
+ return result;
+ } catch(e) {
+ grunt.verbose.error();
+ throw grunt.util.error('Unable to parse "' + filepath + '" file (' + e.problem + ').', e);
+ }
+};
+
+// Write a file.
+file.write = function(filepath, contents, options) {
+ if (!options) { options = {}; }
+ var nowrite = grunt.option('no-write');
+ grunt.verbose.write((nowrite ? 'Not actually writing ' : 'Writing ') + filepath + '...');
+ // Create path, if necessary.
+ file.mkdir(path.dirname(filepath));
+ try {
+ // If contents is already a Buffer, don't try to encode it. If no encoding
+ // was specified, use the default.
+ if (!Buffer.isBuffer(contents)) {
+ contents = iconv.encode(contents, options.encoding || file.defaultEncoding);
+ }
+ // Actually write file.
+ if (!nowrite) {
+ fs.writeFileSync(filepath, contents);
+ }
+ grunt.verbose.ok();
+ return true;
+ } catch(e) {
+ grunt.verbose.error();
+ throw grunt.util.error('Unable to write "' + filepath + '" file (Error code: ' + e.code + ').', e);
+ }
+};
+
+// Read a file, optionally processing its content, then write the output.
+file.copy = function(srcpath, destpath, options) {
+ if (!options) { options = {}; }
+ // If a process function was specified, and noProcess isn't true or doesn't
+ // match the srcpath, process the file's source.
+ var process = options.process && options.noProcess !== true &&
+ !(options.noProcess && file.isMatch(options.noProcess, srcpath));
+ // If the file will be processed, use the encoding as-specified. Otherwise,
+ // use an encoding of null to force the file to be read/written as a Buffer.
+ var readWriteOptions = process ? options : {encoding: null};
+ // Actually read the file.
+ var contents = file.read(srcpath, readWriteOptions);
+ if (process) {
+ grunt.verbose.write('Processing source...');
+ try {
+ contents = options.process(contents, srcpath);
+ grunt.verbose.ok();
+ } catch(e) {
+ grunt.verbose.error();
+ throw grunt.util.error('Error while processing "' + srcpath + '" file.', e);
+ }
+ }
+ // Abort copy if the process function returns false.
+ if (contents === false) {
+ grunt.verbose.writeln('Write aborted.');
+ } else {
+ file.write(destpath, contents, readWriteOptions);
+ }
+};
+
+// Delete folders and files recursively
+file.delete = function(filepath, options) {
+ filepath = String(filepath);
+
+ var nowrite = grunt.option('no-write');
+ if (!options) {
+ options = {force: grunt.option('force') || false};
+ }
+
+ grunt.verbose.write((nowrite ? 'Not actually deleting ' : 'Deleting ') + filepath + '...');
+
+ if (!file.exists(filepath)) {
+ grunt.verbose.error();
+ grunt.log.warn('Cannot delete nonexistent file.');
+ return false;
+ }
+
+ // Only delete cwd or outside cwd if --force enabled. Be careful, people!
+ if (!options.force) {
+ if (file.isPathCwd(filepath)) {
+ grunt.verbose.error();
+ grunt.fail.warn('Cannot delete the current working directory.');
+ return false;
+ } else if (!file.isPathInCwd(filepath)) {
+ grunt.verbose.error();
+ grunt.fail.warn('Cannot delete files outside the current working directory.');
+ return false;
+ }
+ }
+
+ try {
+ // Actually delete. Or not.
+ if (!nowrite) {
+ rimraf.sync(filepath);
+ }
+ grunt.verbose.ok();
+ return true;
+ } catch(e) {
+ grunt.verbose.error();
+ throw grunt.util.error('Unable to delete "' + filepath + '" file (' + e.message + ').', e);
+ }
+};
+
+// True if the file path exists.
+file.exists = function() {
+ var filepath = path.join.apply(path, arguments);
+ return fs.existsSync(filepath);
+};
+
+// True if the file is a symbolic link.
+file.isLink = function() {
+ var filepath = path.join.apply(path, arguments);
+ return file.exists(filepath) && fs.lstatSync(filepath).isSymbolicLink();
+};
+
+// True if the path is a directory.
+file.isDir = function() {
+ var filepath = path.join.apply(path, arguments);
+ return file.exists(filepath) && fs.statSync(filepath).isDirectory();
+};
+
+// True if the path is a file.
+file.isFile = function() {
+ var filepath = path.join.apply(path, arguments);
+ return file.exists(filepath) && fs.statSync(filepath).isFile();
+};
+
+// Is a given file path absolute?
+file.isPathAbsolute = function() {
+ var filepath = path.join.apply(path, arguments);
+ return path.resolve(filepath) === filepath.replace(/[\/\\]+$/, '');
+};
+
+// Do all the specified paths refer to the same path?
+file.arePathsEquivalent = function(first) {
+ first = path.resolve(first);
+ for (var i = 1; i < arguments.length; i++) {
+ if (first !== path.resolve(arguments[i])) { return false; }
+ }
+ return true;
+};
+
+// Are descendant path(s) contained within ancestor path? Note: does not test
+// if paths actually exist.
+file.doesPathContain = function(ancestor) {
+ ancestor = path.resolve(ancestor);
+ var relative;
+ for (var i = 1; i < arguments.length; i++) {
+ relative = path.relative(path.resolve(arguments[i]), ancestor);
+ if (relative === '' || /\w+/.test(relative)) { return false; }
+ }
+ return true;
+};
+
+// Test to see if a filepath is the CWD.
+file.isPathCwd = function() {
+ var filepath = path.join.apply(path, arguments);
+ try {
+ return file.arePathsEquivalent(fs.realpathSync(process.cwd()), fs.realpathSync(filepath));
+ } catch(e) {
+ return false;
+ }
+};
+
+// Test to see if a filepath is contained within the CWD.
+file.isPathInCwd = function() {
+ var filepath = path.join.apply(path, arguments);
+ try {
+ return file.doesPathContain(fs.realpathSync(process.cwd()), fs.realpathSync(filepath));
+ } catch(e) {
+ return false;
+ }
+};
diff --git a/node_modules/grunt/lib/grunt/help.js b/node_modules/grunt/lib/grunt/help.js
new file mode 100644
index 0000000..37b1ad2
--- /dev/null
+++ b/node_modules/grunt/lib/grunt/help.js
@@ -0,0 +1,129 @@
+/*
+ * grunt
+ * http://gruntjs.com/
+ *
+ * Copyright (c) 2014 "Cowboy" Ben Alman
+ * Licensed under the MIT license.
+ * https://github.com/gruntjs/grunt/blob/master/LICENSE-MIT
+ */
+
+'use strict';
+
+var grunt = require('../grunt');
+
+// Nodejs libs.
+var path = require('path');
+
+// Set column widths.
+var col1len = 0;
+exports.initCol1 = function(str) {
+ col1len = Math.max(col1len, str.length);
+};
+exports.initWidths = function() {
+ // Widths for options/tasks table output.
+ exports.widths = [1, col1len, 2, 76 - col1len];
+};
+
+// Render an array in table form.
+exports.table = function(arr) {
+ arr.forEach(function(item) {
+ grunt.log.writetableln(exports.widths, ['', grunt.util._.pad(item[0], col1len), '', item[1]]);
+ });
+};
+
+// Methods to run, in-order.
+exports.queue = [
+ 'initOptions',
+ 'initTasks',
+ 'initWidths',
+ 'header',
+ 'usage',
+ 'options',
+ 'optionsFooter',
+ 'tasks',
+ 'footer',
+];
+
+// Actually display stuff.
+exports.display = function() {
+ exports.queue.forEach(function(name) { exports[name](); });
+};
+
+
+// Header.
+exports.header = function() {
+ grunt.log.writeln('Grunt: The JavaScript Task Runner (v' + grunt.version + ')');
+};
+
+// Usage info.
+exports.usage = function() {
+ grunt.log.header('Usage');
+ grunt.log.writeln(' ' + path.basename(process.argv[1]) + ' [options] [task [task ...]]');
+};
+
+// Options.
+exports.initOptions = function() {
+ // Build 2-column array for table view.
+ exports._options = Object.keys(grunt.cli.optlist).map(function(long) {
+ var o = grunt.cli.optlist[long];
+ var col1 = '--' + (o.negate ? 'no-' : '') + long + (o.short ? ', -' + o.short : '');
+ exports.initCol1(col1);
+ return [col1, o.info];
+ });
+};
+
+exports.options = function() {
+ grunt.log.header('Options');
+ exports.table(exports._options);
+};
+
+exports.optionsFooter = function() {
+ grunt.log.writeln().writelns(
+ 'Options marked with * have methods exposed via the grunt API and should ' +
+ 'instead be specified inside the Gruntfile wherever possible.'
+ );
+};
+
+// Tasks.
+exports.initTasks = function() {
+ // Initialize task system so that the tasks can be listed.
+ grunt.task.init([], {help: true});
+
+ // Build object of tasks by info (where they were loaded from).
+ exports._tasks = [];
+ Object.keys(grunt.task._tasks).forEach(function(name) {
+ exports.initCol1(name);
+ var task = grunt.task._tasks[name];
+ exports._tasks.push(task);
+ });
+};
+
+exports.tasks = function() {
+ grunt.log.header('Available tasks');
+ if (exports._tasks.length === 0) {
+ grunt.log.writeln('(no tasks found)');
+ } else {
+ exports.table(exports._tasks.map(function(task) {
+ var info = task.info;
+ if (task.multi) { info += ' *'; }
+ return [task.name, info];
+ }));
+
+ grunt.log.writeln().writelns(
+ 'Tasks run in the order specified. Arguments may be passed to tasks that ' +
+ 'accept them by using colons, like "lint:files". Tasks marked with * are ' +
+ '"multi tasks" and will iterate over all sub-targets if no argument is ' +
+ 'specified.'
+ );
+ }
+
+ grunt.log.writeln().writelns(
+ 'The list of available tasks may change based on tasks directories or ' +
+ 'grunt plugins specified in the Gruntfile or via command-line options.'
+ );
+};
+
+// Footer.
+exports.footer = function() {
+ grunt.log.writeln().writeln('For more information, see http://gruntjs.com/');
+};
diff --git a/node_modules/grunt/lib/grunt/option.js b/node_modules/grunt/lib/grunt/option.js
new file mode 100644
index 0000000..10eb123
--- /dev/null
+++ b/node_modules/grunt/lib/grunt/option.js
@@ -0,0 +1,42 @@
+/*
+ * grunt
+ * http://gruntjs.com/
+ *
+ * Copyright (c) 2014 "Cowboy" Ben Alman
+ * Licensed under the MIT license.
+ * https://github.com/gruntjs/grunt/blob/master/LICENSE-MIT
+ */
+
+'use strict';
+
+// The actual option data.
+var data = {};
+
+// Get or set an option value.
+var option = module.exports = function(key, value) {
+ var no = key.match(/^no-(.+)$/);
+ if (arguments.length === 2) {
+ return (data[key] = value);
+ } else if (no) {
+ return data[no[1]] === false;
+ } else {
+ return data[key];
+ }
+};
+
+// Initialize option data.
+option.init = function(obj) {
+ return (data = obj || {});
+};
+
+// List of options as flags.
+option.flags = function() {
+ return Object.keys(data).filter(function(key) {
+ // Don't display empty arrays.
+ return !(Array.isArray(data[key]) && data[key].length === 0);
+ }).map(function(key) {
+ var val = data[key];
+ return '--' + (val === false ? 'no-' : '') + key +
+ (typeof val === 'boolean' ? '' : '=' + val);
+ });
+};
diff --git a/node_modules/grunt/lib/grunt/task.js b/node_modules/grunt/lib/grunt/task.js
new file mode 100644
index 0000000..5d1ac8b
--- /dev/null
+++ b/node_modules/grunt/lib/grunt/task.js
@@ -0,0 +1,458 @@
+/*
+ * grunt
+ * http://gruntjs.com/
+ *
+ * Copyright (c) 2014 "Cowboy" Ben Alman
+ * Licensed under the MIT license.
+ * https://github.com/gruntjs/grunt/blob/master/LICENSE-MIT
+ */
+
+'use strict';
+
+var grunt = require('../grunt');
+
+// Nodejs libs.
+var path = require('path');
+
+// Extend generic "task" util lib.
+var parent = grunt.util.task.create();
+
+// The module to be exported.
+var task = module.exports = Object.create(parent);
+
+// A temporary registry of tasks and metadata.
+var registry = {tasks: [], untasks: [], meta: {}};
+
+// The last specified tasks message.
+var lastInfo;
+
+// Number of levels of recursion when loading tasks in collections.
+var loadTaskDepth = 0;
+
+// Keep track of the number of log.error() calls.
+var errorcount;
+
+// Override built-in registerTask.
+task.registerTask = function(name) {
+ // Add task to registry.
+ registry.tasks.push(name);
+ // Register task.
+ parent.registerTask.apply(task, arguments);
+ // This task, now that it's been registered.
+ var thisTask = task._tasks[name];
+ // Metadata about the current task.
+ thisTask.meta = grunt.util._.clone(registry.meta);
+ // Override task function.
+ var _fn = thisTask.fn;
+ thisTask.fn = function(arg) {
+ // Guaranteed to always be the actual task name.
+ var name = thisTask.name;
+ // Initialize the errorcount for this task.
+ errorcount = grunt.fail.errorcount;
+ // Return the number of errors logged during this task.
+ Object.defineProperty(this, 'errorCount', {
+ enumerable: true,
+ get: function() {
+ return grunt.fail.errorcount - errorcount;
+ }
+ });
+ // Expose task.requires on `this`.
+ this.requires = task.requires.bind(task);
+ // Expose config.requires on `this`.
+ this.requiresConfig = grunt.config.requires;
+ // Return an options object with the specified defaults overwritten by task-
+ // specific overrides, via the "options" property.
+ this.options = function() {
+ var args = [{}].concat(grunt.util.toArray(arguments)).concat([
+ grunt.config([name, 'options'])
+ ]);
+ var options = grunt.util._.extend.apply(null, args);
+ grunt.verbose.writeflags(options, 'Options');
+ return options;
+ };
+ // If this task was an alias or a multi task called without a target,
+ // only log if in verbose mode.
+ var logger = _fn.alias || (thisTask.multi && (!arg || arg === '*')) ? 'verbose' : 'log';
+ // Actually log.
+ grunt[logger].header('Running "' + this.nameArgs + '"' +
+ (this.name !== this.nameArgs ? ' (' + this.name + ')' : '') + ' task');
+ // If --debug was specified, log the path to this task's source file.
+ grunt[logger].debug('Task source: ' + thisTask.meta.filepath);
+ // Actually run the task.
+ return _fn.apply(this, arguments);
+ };
+ return task;
+};
+
+// Multi task targets can't start with _ or be a reserved property (options).
+function isValidMultiTaskTarget(target) {
+ return !/^_|^options$/.test(target);
+}
+
+// Normalize multi task files.
+task.normalizeMultiTaskFiles = function(data, target) {
+ var prop, obj;
+ var files = [];
+ if (grunt.util.kindOf(data) === 'object') {
+ if ('src' in data || 'dest' in data) {
+ obj = {};
+ for (prop in data) {
+ if (prop !== 'options') {
+ obj[prop] = data[prop];
+ }
+ }
+ files.push(obj);
+ } else if (grunt.util.kindOf(data.files) === 'object') {
+ for (prop in data.files) {
+ files.push({src: data.files[prop], dest: grunt.config.process(prop)});
+ }
+ } else if (Array.isArray(data.files)) {
+ grunt.util._.flatten(data.files).forEach(function(obj) {
+ var prop;
+ if ('src' in obj || 'dest' in obj) {
+ files.push(obj);
+ } else {
+ for (prop in obj) {
+ files.push({src: obj[prop], dest: grunt.config.process(prop)});
+ }
+ }
+ });
+ }
+ } else {
+ files.push({src: data, dest: grunt.config.process(target)});
+ }
+
+ // If no src/dest or files were specified, return an empty files array.
+ if (files.length === 0) {
+ grunt.verbose.writeln('File: ' + '[no files]'.yellow);
+ return [];
+ }
+
+ // Process all normalized file objects.
+ files = grunt.util._(files).chain().forEach(function(obj) {
+ if (!('src' in obj) || !obj.src) { return; }
+ // Normalize .src properties to flattened array.
+ if (Array.isArray(obj.src)) {
+ obj.src = grunt.util._.flatten(obj.src);
+ } else {
+ obj.src = [obj.src];
+ }
+ }).map(function(obj) {
+ // Build options object, removing unwanted properties.
+ var expandOptions = grunt.util._.extend({}, obj);
+ delete expandOptions.src;
+ delete expandOptions.dest;
+
+ // Expand file mappings.
+ if (obj.expand) {
+ return grunt.file.expandMapping(obj.src, obj.dest, expandOptions).map(function(mapObj) {
+ // Copy obj properties to result.
+ var result = grunt.util._.extend({}, obj);
+ // Make a clone of the orig obj available.
+ result.orig = grunt.util._.extend({}, obj);
+ // Set .src and .dest, processing both as templates.
+ result.src = grunt.config.process(mapObj.src);
+ result.dest = grunt.config.process(mapObj.dest);
+ // Remove unwanted properties.
+ ['expand', 'cwd', 'flatten', 'rename', 'ext'].forEach(function(prop) {
+ delete result[prop];
+ });
+ return result;
+ });
+ }
+
+ // Copy obj properties to result, adding an .orig property.
+ var result = grunt.util._.extend({}, obj);
+ // Make a clone of the orig obj available.
+ result.orig = grunt.util._.extend({}, obj);
+
+ if ('src' in result) {
+ // Expose an expand-on-demand getter method as .src.
+ Object.defineProperty(result, 'src', {
+ enumerable: true,
+ get: function fn() {
+ var src;
+ if (!('result' in fn)) {
+ src = obj.src;
+ // If src is an array, flatten it. Otherwise, make it into an array.
+ src = Array.isArray(src) ? grunt.util._.flatten(src) : [src];
+ // Expand src files, memoizing result.
+ fn.result = grunt.file.expand(expandOptions, src);
+ }
+ return fn.result;
+ }
+ });
+ }
+
+ if ('dest' in result) {
+ result.dest = obj.dest;
+ }
+
+ return result;
+ }).flatten().value();
+
+ // Log this.file src and dest properties when --verbose is specified.
+ if (grunt.option('verbose')) {
+ files.forEach(function(obj) {
+ var output = [];
+ if ('src' in obj) {
+ output.push(obj.src.length > 0 ? grunt.log.wordlist(obj.src) : '[no src]'.yellow);
+ }
+ if ('dest' in obj) {
+ output.push('-> ' + (obj.dest ? String(obj.dest).cyan : '[no dest]'.yellow));
+ }
+ if (output.length > 0) {
+ grunt.verbose.writeln('Files: ' + output.join(' '));
+ }
+ });
+ }
+
+ return files;
+};
+
+// This is the most common "multi task" pattern.
+task.registerMultiTask = function(name, info, fn) {
+ // If optional "info" string is omitted, shuffle arguments a bit.
+ if (fn == null) {
+ fn = info;
+ info = 'Custom multi task.';
+ }
+ // Store a reference to the task object, in case the task gets renamed.
+ var thisTask;
+ task.registerTask(name, info, function(target) {
+ // Guaranteed to always be the actual task name.
+ var name = thisTask.name;
+ // Arguments (sans target) as an array.
+ this.args = grunt.util.toArray(arguments).slice(1);
+ // If a target wasn't specified, run this task once for each target.
+ if (!target || target === '*') {
+ return task.runAllTargets(name, this.args);
+ } else if (!isValidMultiTaskTarget(target)) {
+ throw new Error('Invalid target "' + target + '" specified.');
+ }
+ // Fail if any required config properties have been omitted.
+ this.requiresConfig([name, target]);
+ // Return an options object with the specified defaults overwritten by task-
+ // and/or target-specific overrides, via the "options" property.
+ this.options = function() {
+ var targetObj = grunt.config([name, target]);
+ var args = [{}].concat(grunt.util.toArray(arguments)).concat([
+ grunt.config([name, 'options']),
+ grunt.util.kindOf(targetObj) === 'object' ? targetObj.options : {}
+ ]);
+ var options = grunt.util._.extend.apply(null, args);
+ grunt.verbose.writeflags(options, 'Options');
+ return options;
+ };
+ // Expose the current target.
+ this.target = target;
+ // Recreate flags object so that the target isn't set as a flag.
+ this.flags = {};
+ this.args.forEach(function(arg) { this.flags[arg] = true; }, this);
+ // Expose data on `this` (as well as task.current).
+ this.data = grunt.config([name, target]);
+ // Expose normalized files object.
+ this.files = task.normalizeMultiTaskFiles(this.data, target);
+ // Expose normalized, flattened, uniqued array of src files.
+ Object.defineProperty(this, 'filesSrc', {
+ enumerable: true,
+ get: function() {
+ return grunt.util._(this.files).chain().pluck('src').flatten().uniq().value();
+ }.bind(this)
+ });
+ // Call original task function, passing in the target and any other args.
+ return fn.apply(this, this.args);
+ });
+
+ thisTask = task._tasks[name];
+ thisTask.multi = true;
+};
+
+// Init tasks don't require properties in config, and as such will preempt
+// config loading errors.
+task.registerInitTask = function(name, info, fn) {
+ task.registerTask(name, info, fn);
+ task._tasks[name].init = true;
+};
+
+// Override built-in renameTask to use the registry.
+task.renameTask = function(oldname, newname) {
+ var result;
+ try {
+ // Actually rename task.
+ result = parent.renameTask.apply(task, arguments);
+ // Add and remove task.
+ registry.untasks.push(oldname);
+ registry.tasks.push(newname);
+ // Return result.
+ return result;
+ } catch(e) {
+ grunt.log.error(e.message);
+ }
+};
+
+// If a property wasn't passed, run all task targets in turn.
+task.runAllTargets = function(taskname, args) {
+ // Get an array of sub-property keys under the given config object.
+ var targets = Object.keys(grunt.config.getRaw(taskname) || {});
+ // Fail if there are no actual properties to iterate over.
+ if (targets.length === 0) {
+ grunt.log.error('No "' + taskname + '" targets found.');
+ return false;
+ }
+ // Iterate over all valid target properties, running a task for each.
+ targets.filter(isValidMultiTaskTarget).forEach(function(target) {
+ // Be sure to pass in any additionally specified args.
+ task.run([taskname, target].concat(args || []).join(':'));
+ });
+};
+
+// Load tasks and handlers from a given tasks file.
+var loadTaskStack = [];
+function loadTask(filepath) {
+ // In case this was called recursively, save registry for later.
+ loadTaskStack.push(registry);
+ // Reset registry.
+ registry = {tasks: [], untasks: [], meta: {info: lastInfo, filepath: filepath}};
+ var filename = path.basename(filepath);
+ var msg = 'Loading "' + filename + '" tasks...';
+ var regCount = 0;
+ var fn;
+ try {
+ // Load taskfile.
+ fn = require(path.resolve(filepath));
+ if (typeof fn === 'function') {
+ fn.call(grunt, grunt);
+ }
+ grunt.verbose.write(msg).ok();
+ // Log registered/renamed/unregistered tasks.
+ ['un', ''].forEach(function(prefix) {
+ var list = grunt.util._.chain(registry[prefix + 'tasks']).uniq().sort().value();
+ if (list.length > 0) {
+ regCount++;
+ grunt.verbose.writeln((prefix ? '- ' : '+ ') + grunt.log.wordlist(list));
+ }
+ });
+ if (regCount === 0) {
+ grunt.verbose.warn('No tasks were registered or unregistered.');
+ }
+ } catch(e) {
+ // Something went wrong.
+ grunt.log.write(msg).error().verbose.error(e.stack).or.error(e);
+ }
+ // Restore registry.
+ registry = loadTaskStack.pop() || {};
+}
+
+// Log a message when loading tasks.
+function loadTasksMessage(info) {
+ // Only keep track of names of top-level loaded tasks and collections,
+ // not sub-tasks.
+ if (loadTaskDepth === 0) { lastInfo = info; }
+ grunt.verbose.subhead('Registering ' + info + ' tasks.');
+}
+
+// Load tasks and handlers from a given directory.
+function loadTasks(tasksdir) {
+ try {
+ var files = grunt.file.glob.sync('*.{js,coffee}', {cwd: tasksdir, maxDepth: 1});
+ // Load tasks from files.
+ files.forEach(function(filename) {
+ loadTask(path.join(tasksdir, filename));
+ });
+ } catch(e) {
+ grunt.log.verbose.error(e.stack).or.error(e);
+ }
+}
+
+// Load tasks and handlers from a given directory.
+task.loadTasks = function(tasksdir) {
+ loadTasksMessage('"' + tasksdir + '"');
+ if (grunt.file.exists(tasksdir)) {
+ loadTasks(tasksdir);
+ } else {
+ grunt.log.error('Tasks directory "' + tasksdir + '" not found.');
+ }
+};
+
+// Load tasks and handlers from a given locally-installed Npm module (installed
+// relative to the base dir).
+task.loadNpmTasks = function(name) {
+ loadTasksMessage('"' + name + '" local Npm module');
+ var root = path.resolve('node_modules');
+ var pkgfile = path.join(root, name, 'package.json');
+ var pkg = grunt.file.exists(pkgfile) ? grunt.file.readJSON(pkgfile) : {keywords: []};
+
+ // Process collection plugins.
+ if (pkg.keywords && pkg.keywords.indexOf('gruntcollection') !== -1) {
+ loadTaskDepth++;
+ Object.keys(pkg.dependencies).forEach(function(depName) {
+ // Npm sometimes pulls dependencies out if they're shared, so find
+ // upwards if not found locally.
+ var filepath = grunt.file.findup('node_modules/' + depName, {
+ cwd: path.resolve('node_modules', name),
+ nocase: true
+ });
+ if (filepath) {
+ // Load this task plugin recursively.
+ task.loadNpmTasks(path.relative(root, filepath));
+ }
+ });
+ loadTaskDepth--;
+ return;
+ }
+
+ // Process task plugins.
+ var tasksdir = path.join(root, name, 'tasks');
+ if (grunt.file.exists(tasksdir)) {
+ loadTasks(tasksdir);
+ } else {
+ grunt.log.error('Local Npm module "' + name + '" not found. Is it installed?');
+ }
+};
+
+// Initialize tasks.
+task.init = function(tasks, options) {
+ if (!options) { options = {}; }
+
+ // Were only init tasks specified?
+ var allInit = tasks.length > 0 && tasks.every(function(name) {
+ var obj = task._taskPlusArgs(name).task;
+ return obj && obj.init;
+ });
+
+ // Get any local Gruntfile or tasks that might exist. Use --gruntfile override
+ // if specified, otherwise search the current directory or any parent.
+ var gruntfile = allInit ? null : grunt.option('gruntfile') ||
+ grunt.file.findup('Gruntfile.{js,coffee}', {nocase: true});
+
+ var msg = 'Reading "' + (gruntfile ? path.basename(gruntfile) : '???') + '" Gruntfile...';
+ if (gruntfile && grunt.file.exists(gruntfile)) {
+ grunt.verbose.writeln().write(msg).ok();
+ // Change working directory so that all paths are relative to the
+ // Gruntfile's location (or the --base option, if specified).
+ process.chdir(grunt.option('base') || path.dirname(gruntfile));
+ // Load local tasks, if the file exists.
+ loadTasksMessage('Gruntfile');
+ loadTask(gruntfile);
+ } else if (options.help || allInit) {
+ // Don't complain about missing Gruntfile.
+ } else if (grunt.option('gruntfile')) {
+ // If --config override was specified and it doesn't exist, complain.
+ grunt.log.writeln().write(msg).error();
+ grunt.fatal('Unable to find "' + gruntfile + '" Gruntfile.', grunt.fail.code.MISSING_GRUNTFILE);
+ } else if (!grunt.option('help')) {
+ grunt.verbose.writeln().write(msg).error();
+ grunt.log.writelns(
+ 'A valid Gruntfile could not be found. Please see the getting ' +
+ 'started guide for more information on how to configure grunt: ' +
+ 'http://gruntjs.com/getting-started'
+ );
+ grunt.fatal('Unable to find Gruntfile.', grunt.fail.code.MISSING_GRUNTFILE);
+ }
+
+ // Load all user-specified --npm tasks.
+ (grunt.option('npm') || []).forEach(task.loadNpmTasks);
+ // Load all user-specified --tasks.
+ (grunt.option('tasks') || []).forEach(task.loadTasks);
+};
diff --git a/node_modules/grunt/lib/grunt/template.js b/node_modules/grunt/lib/grunt/template.js
new file mode 100644
index 0000000..5cdc981
--- /dev/null
+++ b/node_modules/grunt/lib/grunt/template.js
@@ -0,0 +1,95 @@
+/*
+ * grunt
+ * http://gruntjs.com/
+ *
+ * Copyright (c) 2014 "Cowboy" Ben Alman
+ * Licensed under the MIT license.
+ * https://github.com/gruntjs/grunt/blob/master/LICENSE-MIT
+ */
+
+'use strict';
+
+var grunt = require('../grunt');
+
+// The module to be exported.
+var template = module.exports = {};
+
+// External libs.
+template.date = require('dateformat');
+
+// Format today's date.
+template.today = function(format) {
+ return template.date(new Date(), format);
+};
+
+// Template delimiters.
+var allDelimiters = {};
+
+// Initialize template delimiters.
+template.addDelimiters = function(name, opener, closer) {
+ var delimiters = allDelimiters[name] = {};
+ // Used by grunt.
+ delimiters.opener = opener;
+ delimiters.closer = closer;
+ // Generate RegExp patterns dynamically.
+ var a = delimiters.opener.replace(/(.)/g, '\\$1');
+ var b = '([\\s\\S]+?)' + delimiters.closer.replace(/(.)/g, '\\$1');
+ // Used by Lo-Dash.
+ delimiters.lodash = {
+ evaluate: new RegExp(a + b, 'g'),
+ interpolate: new RegExp(a + '=' + b, 'g'),
+ escape: new RegExp(a + '-' + b, 'g')
+ };
+};
+
+// The underscore default template syntax should be a pretty sane default for
+// the config system.
+template.addDelimiters('config', '<%', '%>');
+
+// Set Lo-Dash template delimiters.
+template.setDelimiters = function(name) {
+ // Get the appropriate delimiters.
+ var delimiters = allDelimiters[name in allDelimiters ? name : 'config'];
+ // Tell Lo-Dash which delimiters to use.
+ grunt.util._.templateSettings = delimiters.lodash;
+ // Return the delimiters.
+ return delimiters;
+};
+
+// Process template + data with Lo-Dash.
+template.process = function(tmpl, options) {
+ if (!options) { options = {}; }
+ // Set delimiters, and get a opening match character.
+ var delimiters = template.setDelimiters(options.delimiters);
+ // Clone data, initializing to config data or empty object if omitted.
+ var data = Object.create(options.data || grunt.config.data || {});
+ // Expose grunt so that grunt utilities can be accessed, but only if it
+ // doesn't conflict with an existing .grunt property.
+ if (!('grunt' in data)) { data.grunt = grunt; }
+ // Keep track of last change.
+ var last = tmpl;
+ try {
+ // As long as tmpl contains template tags, render it and get the result,
+ // otherwise just use the template string.
+ while (tmpl.indexOf(delimiters.opener) >= 0) {
+ tmpl = grunt.util._.template(tmpl, data);
+ // Abort if template didn't change - nothing left to process!
+ if (tmpl === last) { break; }
+ last = tmpl;
+ }
+ } catch (e) {
+ // In upgrading to Lo-Dash (or Underscore.js 1.3.3), \n and \r in template
+ // tags now causes an exception to be thrown. Warn the user why this is
+ // happening. https://github.com/documentcloud/underscore/issues/553
+ if (String(e) === 'SyntaxError: Unexpected token ILLEGAL' && /\n|\r/.test(tmpl)) {
+ grunt.log.errorlns('A special character was detected in this template. ' +
+ 'Inside template tags, the \\n and \\r special characters must be ' +
+ 'escaped as \\\\n and \\\\r. (grunt 0.4.0+)');
+ }
+ // Slightly better error message.
+ e.message = 'An error occurred while processing a template (' + e.message + ').';
+ grunt.warn(e, grunt.fail.code.TEMPLATE_ERROR);
+ }
+ // Normalize linefeeds and return.
+ return grunt.util.normalizelf(tmpl);
+};
diff --git a/node_modules/grunt/lib/util/task.js b/node_modules/grunt/lib/util/task.js
new file mode 100644
index 0000000..61a004d
--- /dev/null
+++ b/node_modules/grunt/lib/util/task.js
@@ -0,0 +1,342 @@
+/*
+ * grunt
+ * http://gruntjs.com/
+ *
+ * Copyright (c) 2014 "Cowboy" Ben Alman
+ * Licensed under the MIT license.
+ * https://github.com/gruntjs/grunt/blob/master/LICENSE-MIT
+ */
+
+(function(exports) {
+
+ 'use strict';
+
+ // Construct-o-rama.
+ function Task() {
+ // Information about the currently-running task.
+ this.current = {};
+ // Tasks.
+ this._tasks = {};
+ // Task queue.
+ this._queue = [];
+ // Queue placeholder (for dealing with nested tasks).
+ this._placeholder = {placeholder: true};
+ // Queue marker (for clearing the queue programmatically).
+ this._marker = {marker: true};
+ // Options.
+ this._options = {};
+ // Is the queue running?
+ this._running = false;
+ // Success status of completed tasks.
+ this._success = {};
+ }
+
+ // Expose the constructor function.
+ exports.Task = Task;
+
+ // Create a new Task instance.
+ exports.create = function() {
+ return new Task();
+ };
+
+ // If the task runner is running or an error handler is not defined, throw
+ // an exception. Otherwise, call the error handler directly.
+ Task.prototype._throwIfRunning = function(obj) {
+ if (this._running || !this._options.error) {
+ // Throw an exception that the task runner will catch.
+ throw obj;
+ } else {
+ // Not inside the task runner. Call the error handler and abort.
+ this._options.error.call({name: null}, obj);
+ }
+ };
+
+ // Register a new task.
+ Task.prototype.registerTask = function(name, info, fn) {
+ // If optional "info" string is omitted, shuffle arguments a bit.
+ if (fn == null) {
+ fn = info;
+ info = null;
+ }
+ // String or array of strings was passed instead of fn.
+ var tasks;
+ if (typeof fn !== 'function') {
+ // Array of task names.
+ tasks = this.parseArgs([fn]);
+ // This task function just runs the specified tasks.
+ fn = this.run.bind(this, fn);
+ fn.alias = true;
+ // Generate an info string if one wasn't explicitly passed.
+ if (!info) {
+ info = 'Alias for "' + tasks.join('", "') + '" task' +
+ (tasks.length === 1 ? '' : 's') + '.';
+ }
+ } else if (!info) {
+ info = 'Custom task.';
+ }
+ // Add task into cache.
+ this._tasks[name] = {name: name, info: info, fn: fn};
+ // Make chainable!
+ return this;
+ };
+
+ // Is the specified task an alias?
+ Task.prototype.isTaskAlias = function(name) {
+ return !!this._tasks[name].fn.alias;
+ };
+
+ // Has the specified task been registered?
+ Task.prototype.exists = function(name) {
+ return name in this._tasks;
+ };
+
+ // Rename a task. This might be useful if you want to override the default
+ // behavior of a task, while retaining the old name. This is a billion times
+ // easier to implement than some kind of in-task "super" functionality.
+ Task.prototype.renameTask = function(oldname, newname) {
+ if (!this._tasks[oldname]) {
+ throw new Error('Cannot rename missing "' + oldname + '" task.');
+ }
+ // Rename task.
+ this._tasks[newname] = this._tasks[oldname];
+ // Update name property of task.
+ this._tasks[newname].name = newname;
+ // Remove old name.
+ delete this._tasks[oldname];
+ // Make chainable!
+ return this;
+ };
+
+ // Argument parsing helper. Supports these signatures:
+ // fn('foo') // ['foo']
+ // fn('foo', 'bar', 'baz') // ['foo', 'bar', 'baz']
+ // fn(['foo', 'bar', 'baz']) // ['foo', 'bar', 'baz']
+ Task.prototype.parseArgs = function(args) {
+ // Return the first argument if it's an array, otherwise return an array
+ // of all arguments.
+ return Array.isArray(args[0]) ? args[0] : [].slice.call(args);
+ };
+
+ // Split a colon-delimited string into an array, unescaping (but not
+ // splitting on) any \: escaped colons.
+ Task.prototype.splitArgs = function(str) {
+ if (!str) { return []; }
+ // Store placeholder for \\ followed by \:
+ str = str.replace(/\\\\/g, '\uFFFF').replace(/\\:/g, '\uFFFE');
+ // Split on :
+ return str.split(':').map(function(s) {
+ // Restore place-held : followed by \\
+ return s.replace(/\uFFFE/g, ':').replace(/\uFFFF/g, '\\');
+ });
+ };
+
+ // Given a task name, determine which actual task will be called, and what
+ // arguments will be passed into the task callback. "foo" -> task "foo", no
+ // args. "foo:bar:baz" -> task "foo:bar:baz" with no args (if "foo:bar:baz"
+ // task exists), otherwise task "foo:bar" with arg "baz" (if "foo:bar" task
+ // exists), otherwise task "foo" with args "bar" and "baz".
+ Task.prototype._taskPlusArgs = function(name) {
+ // Get task name / argument parts.
+ var parts = this.splitArgs(name);
+ // Start from the end, not the beginning!
+ var i = parts.length;
+ var task;
+ do {
+ // Get a task.
+ task = this._tasks[parts.slice(0, i).join(':')];
+ // If the task doesn't exist, decrement `i`, and if `i` is greater than
+ // 0, repeat.
+ } while (!task && --i > 0);
+ // Just the args.
+ var args = parts.slice(i);
+ // Maybe you want to use them as flags instead of as positional args?
+ var flags = {};
+ args.forEach(function(arg) { flags[arg] = true; });
+ // The task to run and the args to run it with.
+ return {task: task, nameArgs: name, args: args, flags: flags};
+ };
+
+ // Append things to queue in the correct spot.
+ Task.prototype._push = function(things) {
+ // Get current placeholder index.
+ var index = this._queue.indexOf(this._placeholder);
+ if (index === -1) {
+ // No placeholder, add task+args objects to end of queue.
+ this._queue = this._queue.concat(things);
+ } else {
+ // Placeholder exists, add task+args objects just before placeholder.
+ [].splice.apply(this._queue, [index, 0].concat(things));
+ }
+ };
+
+ // Enqueue a task.
+ Task.prototype.run = function() {
+ // Parse arguments into an array, returning an array of task+args objects.
+ var things = this.parseArgs(arguments).map(this._taskPlusArgs, this);
+ // Throw an exception if any tasks weren't found.
+ var fails = things.filter(function(thing) { return !thing.task; });
+ if (fails.length > 0) {
+ this._throwIfRunning(new Error('Task "' + fails[0].nameArgs + '" not found.'));
+ return this;
+ }
+ // Append things to queue in the correct spot.
+ this._push(things);
+ // Make chainable!
+ return this;
+ };
+
+ // Add a marker to the queue to facilitate clearing it programmatically.
+ Task.prototype.mark = function() {
+ this._push(this._marker);
+ // Make chainable!
+ return this;
+ };
+
+ // Run a task function, handling this.async / return value.
+ Task.prototype.runTaskFn = function(context, fn, done, asyncDone) {
+ // Async flag.
+ var async = false;
+
+ // Update the internal status object and run the next task.
+ var complete = function(success) {
+ var err = null;
+ if (success === false) {
+ // Since false was passed, the task failed generically.
+ err = new Error('Task "' + context.nameArgs + '" failed.');
+ } else if (success instanceof Error || {}.toString.call(success) === '[object Error]') {
+ // An error object was passed, so the task failed specifically.
+ err = success;
+ success = false;
+ } else {
+ // The task succeeded.
+ success = true;
+ }
+ // The task has ended, reset the current task object.
+ this.current = {};
+ // A task has "failed" only if it returns false (async) or if the
+ // function returned by .async is passed false.
+ this._success[context.nameArgs] = success;
+ // If task failed, call error handler.
+ if (!success && this._options.error) {
+ this._options.error.call({name: context.name, nameArgs: context.nameArgs}, err);
+ }
+ // only call done async if explicitly requested to
+ // see: https://github.com/gruntjs/grunt/pull/1026
+ if (asyncDone) {
+ process.nextTick(function () {
+ done(err, success);
+ });
+ } else {
+ done(err, success);
+ }
+ }.bind(this);
+
+ // When called, sets the async flag and returns a function that can
+ // be used to continue processing the queue.
+ context.async = function() {
+ async = true;
+ // The returned function should execute asynchronously in case
+ // someone tries to do this.async()(); inside a task (WTF).
+ return function(success) {
+ setTimeout(function() { complete(success); }, 1);
+ };
+ };
+
+ // Expose some information about the currently-running task.
+ this.current = context;
+
+ try {
+ // Get the current task and run it, setting `this` inside the task
+ // function to be something useful.
+ var success = fn.call(context);
+ // If the async flag wasn't set, process the next task in the queue.
+ if (!async) {
+ complete(success);
+ }
+ } catch (err) {
+ complete(err);
+ }
+ };
+
+ // Begin task queue processing. Ie. run all tasks.
+ Task.prototype.start = function(opts) {
+ if (!opts) {
+ opts = {};
+ }
+ // Abort if already running.
+ if (this._running) { return false; }
+ // Actually process the next task.
+ var nextTask = function() {
+ // Get next task+args object from queue.
+ var thing;
+ // Skip any placeholders or markers.
+ do {
+ thing = this._queue.shift();
+ } while (thing === this._placeholder || thing === this._marker);
+ // If queue was empty, we're all done.
+ if (!thing) {
+ this._running = false;
+ if (this._options.done) {
+ this._options.done();
+ }
+ return;
+ }
+ // Add a placeholder to the front of the queue.
+ this._queue.unshift(this._placeholder);
+
+ // Expose some information about the currently-running task.
+ var context = {
+ // The current task name plus args, as-passed.
+ nameArgs: thing.nameArgs,
+ // The current task name.
+ name: thing.task.name,
+ // The current task arguments.
+ args: thing.args,
+ // The current arguments, available as named flags.
+ flags: thing.flags
+ };
+
+ // Actually run the task function (handling this.async, etc)
+ this.runTaskFn(context, function() {
+ return thing.task.fn.apply(this, this.args);
+ }, nextTask, !!opts.asyncDone);
+
+ }.bind(this);
+
+ // Update flag.
+ this._running = true;
+ // Process the next task.
+ nextTask();
+ };
+
+ // Clear remaining tasks from the queue.
+ Task.prototype.clearQueue = function(options) {
+ if (!options) { options = {}; }
+ if (options.untilMarker) {
+ this._queue.splice(0, this._queue.indexOf(this._marker) + 1);
+ } else {
+ this._queue = [];
+ }
+ // Make chainable!
+ return this;
+ };
+
+ // Test to see if all of the given tasks have succeeded.
+ Task.prototype.requires = function() {
+ this.parseArgs(arguments).forEach(function(name) {
+ var success = this._success[name];
+ if (!success) {
+ throw new Error('Required task "' + name +
+ '" ' + (success === false ? 'failed' : 'must be run first') + '.');
+ }
+ }.bind(this));
+ };
+
+ // Override default options.
+ Task.prototype.options = function(options) {
+ Object.keys(options).forEach(function(name) {
+ this._options[name] = options[name];
+ }.bind(this));
+ };
+
+}(typeof exports === 'object' && exports || this));
diff --git a/node_modules/grunt/node_modules/.bin/cake b/node_modules/grunt/node_modules/.bin/cake
new file mode 100644
index 0000000..da84bdc
--- /dev/null
+++ b/node_modules/grunt/node_modules/.bin/cake
@@ -0,0 +1,15 @@
+#!/bin/sh
+basedir=`dirname "$0"`
+
+case `uname` in
+ *CYGWIN*) basedir=`cygpath -w "$basedir"`;;
+esac
+
+if [ -x "$basedir/node" ]; then
+ "$basedir/node" "$basedir/../coffee-script/bin/cake" "$@"
+ ret=$?
+else
+ node "$basedir/../coffee-script/bin/cake" "$@"
+ ret=$?
+fi
+exit $ret
diff --git a/node_modules/grunt/node_modules/.bin/cake.cmd b/node_modules/grunt/node_modules/.bin/cake.cmd
new file mode 100644
index 0000000..5053d93
--- /dev/null
+++ b/node_modules/grunt/node_modules/.bin/cake.cmd
@@ -0,0 +1,7 @@
+@IF EXIST "%~dp0\node.exe" (
+ "%~dp0\node.exe" "%~dp0\..\coffee-script\bin\cake" %*
+) ELSE (
+ @SETLOCAL
+ @SET PATHEXT=%PATHEXT:;.JS;=;%
+ node "%~dp0\..\coffee-script\bin\cake" %*
+)
\ No newline at end of file
diff --git a/node_modules/grunt/node_modules/.bin/coffee b/node_modules/grunt/node_modules/.bin/coffee
new file mode 100644
index 0000000..04d88bf
--- /dev/null
+++ b/node_modules/grunt/node_modules/.bin/coffee
@@ -0,0 +1,15 @@
+#!/bin/sh
+basedir=`dirname "$0"`
+
+case `uname` in
+ *CYGWIN*) basedir=`cygpath -w "$basedir"`;;
+esac
+
+if [ -x "$basedir/node" ]; then
+ "$basedir/node" "$basedir/../coffee-script/bin/coffee" "$@"
+ ret=$?
+else
+ node "$basedir/../coffee-script/bin/coffee" "$@"
+ ret=$?
+fi
+exit $ret
diff --git a/node_modules/grunt/node_modules/.bin/coffee.cmd b/node_modules/grunt/node_modules/.bin/coffee.cmd
new file mode 100644
index 0000000..72881d8
--- /dev/null
+++ b/node_modules/grunt/node_modules/.bin/coffee.cmd
@@ -0,0 +1,7 @@
+@IF EXIST "%~dp0\node.exe" (
+ "%~dp0\node.exe" "%~dp0\..\coffee-script\bin\coffee" %*
+) ELSE (
+ @SETLOCAL
+ @SET PATHEXT=%PATHEXT:;.JS;=;%
+ node "%~dp0\..\coffee-script\bin\coffee" %*
+)
\ No newline at end of file
diff --git a/node_modules/grunt/node_modules/.bin/js-yaml b/node_modules/grunt/node_modules/.bin/js-yaml
new file mode 100644
index 0000000..2dd4d29
--- /dev/null
+++ b/node_modules/grunt/node_modules/.bin/js-yaml
@@ -0,0 +1,15 @@
+#!/bin/sh
+basedir=`dirname "$0"`
+
+case `uname` in
+ *CYGWIN*) basedir=`cygpath -w "$basedir"`;;
+esac
+
+if [ -x "$basedir/node" ]; then
+ "$basedir/node" "$basedir/../js-yaml/bin/js-yaml.js" "$@"
+ ret=$?
+else
+ node "$basedir/../js-yaml/bin/js-yaml.js" "$@"
+ ret=$?
+fi
+exit $ret
diff --git a/node_modules/grunt/node_modules/.bin/js-yaml.cmd b/node_modules/grunt/node_modules/.bin/js-yaml.cmd
new file mode 100644
index 0000000..ae8e7bc
--- /dev/null
+++ b/node_modules/grunt/node_modules/.bin/js-yaml.cmd
@@ -0,0 +1,7 @@
+@IF EXIST "%~dp0\node.exe" (
+ "%~dp0\node.exe" "%~dp0\..\js-yaml\bin\js-yaml.js" %*
+) ELSE (
+ @SETLOCAL
+ @SET PATHEXT=%PATHEXT:;.JS;=;%
+ node "%~dp0\..\js-yaml\bin\js-yaml.js" %*
+)
\ No newline at end of file
diff --git a/node_modules/grunt/node_modules/.bin/nopt b/node_modules/grunt/node_modules/.bin/nopt
new file mode 100644
index 0000000..25995f3
--- /dev/null
+++ b/node_modules/grunt/node_modules/.bin/nopt
@@ -0,0 +1,15 @@
+#!/bin/sh
+basedir=`dirname "$0"`
+
+case `uname` in
+ *CYGWIN*) basedir=`cygpath -w "$basedir"`;;
+esac
+
+if [ -x "$basedir/node" ]; then
+ "$basedir/node" "$basedir/../nopt/bin/nopt.js" "$@"
+ ret=$?
+else
+ node "$basedir/../nopt/bin/nopt.js" "$@"
+ ret=$?
+fi
+exit $ret
diff --git a/node_modules/grunt/node_modules/.bin/nopt.cmd b/node_modules/grunt/node_modules/.bin/nopt.cmd
new file mode 100644
index 0000000..1626454
--- /dev/null
+++ b/node_modules/grunt/node_modules/.bin/nopt.cmd
@@ -0,0 +1,7 @@
+@IF EXIST "%~dp0\node.exe" (
+ "%~dp0\node.exe" "%~dp0\..\nopt\bin\nopt.js" %*
+) ELSE (
+ @SETLOCAL
+ @SET PATHEXT=%PATHEXT:;.JS;=;%
+ node "%~dp0\..\nopt\bin\nopt.js" %*
+)
\ No newline at end of file
diff --git a/node_modules/grunt/node_modules/.bin/rimraf b/node_modules/grunt/node_modules/.bin/rimraf
new file mode 100644
index 0000000..71c3553
--- /dev/null
+++ b/node_modules/grunt/node_modules/.bin/rimraf
@@ -0,0 +1,15 @@
+#!/bin/sh
+basedir=`dirname "$0"`
+
+case `uname` in
+ *CYGWIN*) basedir=`cygpath -w "$basedir"`;;
+esac
+
+if [ -x "$basedir/node" ]; then
+ "$basedir/node" "$basedir/../rimraf/bin.js" "$@"
+ ret=$?
+else
+ node "$basedir/../rimraf/bin.js" "$@"
+ ret=$?
+fi
+exit $ret
diff --git a/node_modules/grunt/node_modules/.bin/rimraf.cmd b/node_modules/grunt/node_modules/.bin/rimraf.cmd
new file mode 100644
index 0000000..9333ec6
--- /dev/null
+++ b/node_modules/grunt/node_modules/.bin/rimraf.cmd
@@ -0,0 +1,7 @@
+@IF EXIST "%~dp0\node.exe" (
+ "%~dp0\node.exe" "%~dp0\..\rimraf\bin.js" %*
+) ELSE (
+ @SETLOCAL
+ @SET PATHEXT=%PATHEXT:;.JS;=;%
+ node "%~dp0\..\rimraf\bin.js" %*
+)
\ No newline at end of file
diff --git a/node_modules/grunt/node_modules/.bin/which b/node_modules/grunt/node_modules/.bin/which
new file mode 100644
index 0000000..9c7f24b
--- /dev/null
+++ b/node_modules/grunt/node_modules/.bin/which
@@ -0,0 +1,15 @@
+#!/bin/sh
+basedir=`dirname "$0"`
+
+case `uname` in
+ *CYGWIN*) basedir=`cygpath -w "$basedir"`;;
+esac
+
+if [ -x "$basedir/node" ]; then
+ "$basedir/node" "$basedir/../which/bin/which" "$@"
+ ret=$?
+else
+ node "$basedir/../which/bin/which" "$@"
+ ret=$?
+fi
+exit $ret
diff --git a/node_modules/grunt/node_modules/.bin/which.cmd b/node_modules/grunt/node_modules/.bin/which.cmd
new file mode 100644
index 0000000..588f44d
--- /dev/null
+++ b/node_modules/grunt/node_modules/.bin/which.cmd
@@ -0,0 +1,7 @@
+@IF EXIST "%~dp0\node.exe" (
+ "%~dp0\node.exe" "%~dp0\..\which\bin\which" %*
+) ELSE (
+ @SETLOCAL
+ @SET PATHEXT=%PATHEXT:;.JS;=;%
+ node "%~dp0\..\which\bin\which" %*
+)
\ No newline at end of file
diff --git a/node_modules/grunt/node_modules/async/.gitmodules b/node_modules/grunt/node_modules/async/.gitmodules
new file mode 100644
index 0000000..a9aae98
--- /dev/null
+++ b/node_modules/grunt/node_modules/async/.gitmodules
@@ -0,0 +1,9 @@
+[submodule "deps/nodeunit"]
+ path = deps/nodeunit
+ url = git://github.com/caolan/nodeunit.git
+[submodule "deps/UglifyJS"]
+ path = deps/UglifyJS
+ url = https://github.com/mishoo/UglifyJS.git
+[submodule "deps/nodelint"]
+ path = deps/nodelint
+ url = https://github.com/tav/nodelint.git
diff --git a/node_modules/grunt/node_modules/async/.npmignore b/node_modules/grunt/node_modules/async/.npmignore
new file mode 100644
index 0000000..9bdfc97
--- /dev/null
+++ b/node_modules/grunt/node_modules/async/.npmignore
@@ -0,0 +1,4 @@
+deps
+dist
+test
+nodelint.cfg
\ No newline at end of file
diff --git a/node_modules/grunt/node_modules/async/LICENSE b/node_modules/grunt/node_modules/async/LICENSE
new file mode 100644
index 0000000..b7f9d50
--- /dev/null
+++ b/node_modules/grunt/node_modules/async/LICENSE
@@ -0,0 +1,19 @@
+Copyright (c) 2010 Caolan McMahon
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
diff --git a/node_modules/grunt/node_modules/async/Makefile b/node_modules/grunt/node_modules/async/Makefile
new file mode 100644
index 0000000..bad647c
--- /dev/null
+++ b/node_modules/grunt/node_modules/async/Makefile
@@ -0,0 +1,25 @@
+PACKAGE = asyncjs
+NODEJS = $(if $(shell test -f /usr/bin/nodejs && echo "true"),nodejs,node)
+CWD := $(shell pwd)
+NODEUNIT = $(CWD)/node_modules/nodeunit/bin/nodeunit
+UGLIFY = $(CWD)/node_modules/uglify-js/bin/uglifyjs
+NODELINT = $(CWD)/node_modules/nodelint/nodelint
+
+BUILDDIR = dist
+
+all: clean test build
+
+build: $(wildcard lib/*.js)
+ mkdir -p $(BUILDDIR)
+ $(UGLIFY) lib/async.js > $(BUILDDIR)/async.min.js
+
+test:
+ $(NODEUNIT) test
+
+clean:
+ rm -rf $(BUILDDIR)
+
+lint:
+ $(NODELINT) --config nodelint.cfg lib/async.js
+
+.PHONY: test build all
diff --git a/node_modules/grunt/node_modules/async/README.md b/node_modules/grunt/node_modules/async/README.md
new file mode 100644
index 0000000..1bbbc47
--- /dev/null
+++ b/node_modules/grunt/node_modules/async/README.md
@@ -0,0 +1,1021 @@
+# Async.js
+
+Async is a utility module which provides straight-forward, powerful functions
+for working with asynchronous JavaScript. Although originally designed for
+use with [node.js](http://nodejs.org), it can also be used directly in the
+browser.
+
+Async provides around 20 functions that include the usual 'functional'
+suspects (map, reduce, filter, forEach…) as well as some common patterns
+for asynchronous control flow (parallel, series, waterfall…). All these
+functions assume you follow the node.js convention of providing a single
+callback as the last argument of your async function.
+
+
+## Quick Examples
+
+ async.map(['file1','file2','file3'], fs.stat, function(err, results){
+ // results is now an array of stats for each file
+ });
+
+ async.filter(['file1','file2','file3'], path.exists, function(results){
+ // results now equals an array of the existing files
+ });
+
+ async.parallel([
+ function(){ ... },
+ function(){ ... }
+ ], callback);
+
+ async.series([
+ function(){ ... },
+ function(){ ... }
+ ]);
+
+There are many more functions available so take a look at the docs below for a
+full list. This module aims to be comprehensive, so if you feel anything is
+missing please create a GitHub issue for it.
+
+
+## Download
+
+Releases are available for download from
+[GitHub](http://github.com/caolan/async/downloads).
+Alternatively, you can install using Node Package Manager (npm):
+
+ npm install async
+
+
+__Development:__ [async.js](https://github.com/caolan/async/raw/master/lib/async.js) - 17.5kb Uncompressed
+
+__Production:__ [async.min.js](https://github.com/caolan/async/raw/master/dist/async.min.js) - 1.7kb Packed and Gzipped
+
+
+## In the Browser
+
+So far its been tested in IE6, IE7, IE8, FF3.6 and Chrome 5. Usage:
+
+
+
+
+
+## Documentation
+
+### Collections
+
+* [forEach](#forEach)
+* [map](#map)
+* [filter](#filter)
+* [reject](#reject)
+* [reduce](#reduce)
+* [detect](#detect)
+* [sortBy](#sortBy)
+* [some](#some)
+* [every](#every)
+* [concat](#concat)
+
+### Control Flow
+
+* [series](#series)
+* [parallel](#parallel)
+* [whilst](#whilst)
+* [until](#until)
+* [waterfall](#waterfall)
+* [queue](#queue)
+* [auto](#auto)
+* [iterator](#iterator)
+* [apply](#apply)
+* [nextTick](#nextTick)
+
+### Utils
+
+* [memoize](#memoize)
+* [unmemoize](#unmemoize)
+* [log](#log)
+* [dir](#dir)
+* [noConflict](#noConflict)
+
+
+## Collections
+
+
+
+
+## Installation
+
+ npm install colors
+
+## colors and styles!
+
+- bold
+- italic
+- underline
+- inverse
+- yellow
+- cyan
+- white
+- magenta
+- green
+- red
+- grey
+- blue
+- rainbow
+- zebra
+- random
+
+## Usage
+
+``` js
+var colors = require('./colors');
+
+console.log('hello'.green); // outputs green text
+console.log('i like cake and pies'.underline.red) // outputs red underlined text
+console.log('inverse the color'.inverse); // inverses the color
+console.log('OMG Rainbows!'.rainbow); // rainbow (ignores spaces)
+```
+
+# Creating Custom themes
+
+```js
+
+var colors = require('colors');
+
+colors.setTheme({
+ silly: 'rainbow',
+ input: 'grey',
+ verbose: 'cyan',
+ prompt: 'grey',
+ info: 'green',
+ data: 'grey',
+ help: 'cyan',
+ warn: 'yellow',
+ debug: 'blue',
+ error: 'red'
+});
+
+// outputs red text
+console.log("this is an error".error);
+
+// outputs yellow text
+console.log("this is a warning".warn);
+```
+
+
+### Contributors
+
+Marak (Marak Squires)
+Alexis Sellier (cloudhead)
+mmalecki (Maciej Małecki)
+nicoreed (Nico Reed)
+morganrallen (Morgan Allen)
+JustinCampbell (Justin Campbell)
+ded (Dustin Diaz)
+
+
+#### , Marak Squires , Justin Campbell, Dustin Diaz (@ded)
diff --git a/node_modules/grunt/node_modules/colors/colors.js b/node_modules/grunt/node_modules/colors/colors.js
new file mode 100644
index 0000000..7a537d8
--- /dev/null
+++ b/node_modules/grunt/node_modules/colors/colors.js
@@ -0,0 +1,342 @@
+/*
+colors.js
+
+Copyright (c) 2010
+
+Marak Squires
+Alexis Sellier (cloudhead)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
+
+*/
+
+var isHeadless = false;
+
+if (typeof module !== 'undefined') {
+ isHeadless = true;
+}
+
+if (!isHeadless) {
+ var exports = {};
+ var module = {};
+ var colors = exports;
+ exports.mode = "browser";
+} else {
+ exports.mode = "console";
+}
+
+//
+// Prototypes the string object to have additional method calls that add terminal colors
+//
+var addProperty = function (color, func) {
+ exports[color] = function (str) {
+ return func.apply(str);
+ };
+ String.prototype.__defineGetter__(color, func);
+};
+
+function stylize(str, style) {
+
+ var styles;
+
+ if (exports.mode === 'console') {
+ styles = {
+ //styles
+ 'bold' : ['\x1B[1m', '\x1B[22m'],
+ 'italic' : ['\x1B[3m', '\x1B[23m'],
+ 'underline' : ['\x1B[4m', '\x1B[24m'],
+ 'inverse' : ['\x1B[7m', '\x1B[27m'],
+ 'strikethrough' : ['\x1B[9m', '\x1B[29m'],
+ //text colors
+ //grayscale
+ 'white' : ['\x1B[37m', '\x1B[39m'],
+ 'grey' : ['\x1B[90m', '\x1B[39m'],
+ 'black' : ['\x1B[30m', '\x1B[39m'],
+ //colors
+ 'blue' : ['\x1B[34m', '\x1B[39m'],
+ 'cyan' : ['\x1B[36m', '\x1B[39m'],
+ 'green' : ['\x1B[32m', '\x1B[39m'],
+ 'magenta' : ['\x1B[35m', '\x1B[39m'],
+ 'red' : ['\x1B[31m', '\x1B[39m'],
+ 'yellow' : ['\x1B[33m', '\x1B[39m'],
+ //background colors
+ //grayscale
+ 'whiteBG' : ['\x1B[47m', '\x1B[49m'],
+ 'greyBG' : ['\x1B[49;5;8m', '\x1B[49m'],
+ 'blackBG' : ['\x1B[40m', '\x1B[49m'],
+ //colors
+ 'blueBG' : ['\x1B[44m', '\x1B[49m'],
+ 'cyanBG' : ['\x1B[46m', '\x1B[49m'],
+ 'greenBG' : ['\x1B[42m', '\x1B[49m'],
+ 'magentaBG' : ['\x1B[45m', '\x1B[49m'],
+ 'redBG' : ['\x1B[41m', '\x1B[49m'],
+ 'yellowBG' : ['\x1B[43m', '\x1B[49m']
+ };
+ } else if (exports.mode === 'browser') {
+ styles = {
+ //styles
+ 'bold' : ['', ''],
+ 'italic' : ['', ''],
+ 'underline' : ['', ''],
+ 'inverse' : ['