#!/usr/bin/env rspec

# Copyright, 2012, by Samuel G. D. Williams. <http://www.codeotaku.com>
# 
# 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.

require 'utopia/path'

module Utopia::PathSpec
	describe Utopia::Path do
		it "should be root path" do
			root = Utopia::Path["/"]
			
			expect(root.components).to be == ['', '']
			expect(root.to_local_path).to be == '/'
		end
		
		it "should concatenate absolute paths" do
			root = Utopia::Path["/"]
			
			expect(root).to be_absolute
			expect(root + Utopia::Path["foo/bar"]).to be == Utopia::Path["/foo/bar"]
		end
		
		it "should compute all descendant paths" do
			root = Utopia::Path["/foo/bar"]
			
			descendants = root.descend.to_a
			
			expect(descendants[0].components).to be == [""]
			expect(descendants[1].components).to be == ["", "foo"]
			expect(descendants[2].components).to be == ["", "foo", "bar"]
			
			ascendants = root.ascend.to_a
			
			expect(descendants.reverse).to be == ascendants
		end
		
		it "should be able to remove relative path entries" do
			path = Utopia::Path["/foo/bar/../baz/."]
			expect(path.simplify.components).to be == ['', 'foo', 'baz']
			
			path = Utopia::Path["/foo/bar/../baz/./"]
			expect(path.simplify.components).to be == ['', 'foo', 'baz', '']
		end
		
		it "should remove the extension from the basename" do
			path = Utopia::Path["dir/foo.html"]
			
			basename = path.basename("html")
			
			expect(basename.name).to be == 'foo'
			expect(basename.extension).to be == 'html'
		end
		
		it "should be able to convert into a directory" do
			path = Utopia::Path["foo/bar"]
			
			expect(path).to_not be_directory
			
			expect(path.to_directory).to be_directory
			
			dir_path = path.to_directory
			expect(dir_path.to_directory).to be == dir_path
		end
		
		it "should start with the given path" do
			path = Utopia::Path["/a/b/c/d/e"]
			
			expect(path.start_with?(path.dirname)).to be true
		end
		
		it "should split at the specified point" do
			path = Utopia::Path["/a/b/c/d/e"]
			
			expect(path.split('c')).to be == [Utopia::Path['/a/b'], Utopia::Path['d/e']]
		end
		
		it "shouldn't be able to modify frozen paths" do
			path = Utopia::Path["dir/foo.html"]
			
			path.freeze
			
			expect(path.frozen?).to be true
			
			expect{path[0] = 'bob'}.to raise_exception(RuntimeError)
		end
		
		it "should give the correct locale" do
			path = Utopia::Path["foo.en"]
			
			expect(path.basename.locale).to be == 'en'
		end
		
		it "should give no locale" do
			path = Utopia::Path["foo"]
			
			expect(path.basename.locale).to be == nil
		end
		
		it "should expand relative paths" do
			root = Utopia::Path['/root']
			path = Utopia::Path["dir/foo.html"]
			
			expect(path.expand(root)).to be == (root + path)
		end
		
		it "shouldn't expand absolute paths" do
			root = Utopia::Path['/root']
			path = Utopia::Path["dir/foo.html"]
			
			expect(root.expand(root)).to be == root
		end
		
		it "should give the shortest path for outer paths" do
			input = Utopia::Path.create("/a/b/c/index")
			output = Utopia::Path.create("/a/b/c/d/e/")
			
			short = input.shortest_path(output)
			
			expect(short.components).to be == ["..", "..", "index"]
			
			expect((output + short).simplify).to be == input
		end
		
		it "should give the shortest path for inner paths" do
			input = Utopia::Path.create("/a/b/c/index")
			output = Utopia::Path.create("/a/")
			
			short = input.shortest_path(output)
			
			expect(short.components).to be == ["b", "c", "index"]
			
			expect((output + short).simplify).to be == input
		end
	end
end