Function to generate basic header

src/Bedgraph.jl

@@ -47,7 +47,7 @@ function Base.convert(::Type{Track}, str::String)
     return convert(Track, data)
 end
 
-# Check if the track data in four column BED format.
+# Check if the track data is in the four column BED format.
 function isLikeTrack(line::String) :: Bool
     return  ismatch(r"^\s*([A-Za-z]+\S*)\s+(\d+)\s+(\d+)\s+(\S*\d)\s*$", line) # Note: is like a Track.
 end
@@ -286,6 +286,17 @@ end
 
 expand(chromStart::DataArrays.DataArray{Any,1}, chromEnd::DataArrays.DataArray{Any,1}, dataValue::DataArrays.DataArray{Any,1}) = expand(nucleotides(chromStart), nucleotides(chromEnd), dataValues(dataValue))
 
+function generateBasicHeader(chrom::String, pos_start::Int, pos_end::Int; bump_forward=true) :: Vector{String}
+
+    if bump_forward
+        pos_start += 1
+        pos_end += 1
+    end
+
+    return ["browser position $chrom:$pos_start-$pos_end", "track type=bedGraph"]
+end
+
+
 # chrom  chromStart  chromEnd  dataValue
 function write(chrom::Vector{String}, chromStart::Vector{Int}, chromEnd::Vector{Int}, dataValue::Vector{T} ; outfile="out.bedgraph") where {T<:Real}
 

test/runtests.jl

@@ -51,6 +51,7 @@ const parameter_line_long = "track type=bedGraph name=track_label description=ce
 const file = joinpath(@__DIR__, "data.bedgraph")
 const file_headerless = joinpath(@__DIR__, "data-headerless.bedgraph")
 
+const header = [browser1, browser2, browser3, browser4, comment1, comment2, comment3, comment4, parameter_line]
 const tracks = [Track(track1), Track(line2), Track(line3), Track(line4), Track(line5), Track(line6), Track(line7), Track(line8), Track(line9)]
 
 @testset "I/O" begin
@@ -73,7 +74,7 @@ end
 
 open(file, "r") do io # Note: reading tracks first to check seek.
     @test Bedgraph.readTracks(io) ==  tracks
-    @test Bedgraph.readHeader(io) == [browser1, browser2, browser3, browser4, comment1, comment2, comment3, comment4, parameter_line]
+    @test Bedgraph.readHeader(io) == header
 end
 
 open(file_headerless, "r") do io # Note: reading tracks first to check seek.