Remove deprecated Location field and consolidate JSON Pointer construction + other final cleanup

.github/workflows/build.yaml

@@ -24,15 +24,15 @@ jobs:
       - name: golangci-lint
         uses: golangci/golangci-lint-action@v8
         with:
-          version: v2.1
+          version: v2.7
   build:
     name: Build
     runs-on: ubuntu-latest
     steps:
       - name: Set up Go 1.x
         uses: actions/setup-go@v3
         with:
-          go-version: 1.24.7
+          go-version: 1.25
         id: go
 
       - name: Checkout code

.pre-commit-config.yaml

@@ -0,0 +1,14 @@
+# See https://pre-commit.com for more information
+# See https://pre-commit.com/hooks.html for more hooks
+repos:
+
+  # Run golangci-lint as a pre-commit hook to catch issues before they are pushed
+  # See https://golangci-lint.run/ for more information
+  - repo: local
+    hooks:
+      - id: golangci-lint
+        name: Lint Go code
+        entry: go tool golangci-lint run
+        language: system
+        pass_filenames: false
+        types: [go]

README.md

@@ -31,8 +31,20 @@ go get github.com/pb33f/libopenapi-validator
 ## Validate OpenAPI Document
 
 ```bash
-go run github.com/pb33f/libopenapi-validator/cmd/validate@latest [--regexengine] <file>
+go run github.com/pb33f/libopenapi-validator/cmd/validate@latest [--regexengine] [--yaml2json] <file>
 ```
+
+## Install pre-commit hook
+
+To install the pre-commit hook, run the following command in your terminal:
+
+```bash
+pre-commit install
+```
+
+### Options
+
+#### --regexengine
 🔍 Example: Use a custom regex engine/flag (e.g., ecmascript)
 ```bash
 go run github.com/pb33f/libopenapi-validator/cmd/validate@latest --regexengine=ecmascript <file>
@@ -51,6 +63,26 @@ go run github.com/pb33f/libopenapi-validator/cmd/validate@latest --regexengine=e
 - re2
 - unicode
 
+#### --yaml2json
+🔍 Convert YAML files to JSON before validation (ℹ️ Default: false)
+
+[libopenapi](https://github.com/pb33f/libopenapi/blob/main/datamodel/spec_info.go#L115) passes `map[interface{}]interface{}` structures for deeply nested objects or complex mappings in the OpenAPI specification, which are not allowed in JSON.
+These structures cannot be properly converted to JSON by libopenapi and cannot be validated by jsonschema, resulting in ambiguous errors.
+
+This flag allows pre-converting from YAML to JSON to bypass this limitation of the libopenapi.
+
+**When does this happen?**
+- OpenAPI specs with deeply nested schema definitions
+- Complex `allOf`, `oneOf`, or `anyOf` structures with multiple levels
+- Specifications with intricate object mappings in examples or schema properties
+
+Enabling this flag pre-converts the YAML document from YAML to JSON, ensuring a clean JSON structure before validation.
+
+Example:
+```bash
+go run github.com/pb33f/libopenapi-validator/cmd/validate@latest --yaml2json <file>
+```
+
 ## Documentation
 
 - [The structure of the validator](https://pb33f.io/libopenapi/validation/#the-structure-of-the-validator)

cache/cache.go

@@ -6,6 +6,7 @@ package cache
 import (
 	"github.com/pb33f/libopenapi/datamodel/high/base"
 	"github.com/santhosh-tekuri/jsonschema/v6"
+	"go.yaml.in/yaml/v4"
 )
 
 // SchemaCacheEntry holds a compiled schema and its intermediate representations.
@@ -16,12 +17,13 @@ type SchemaCacheEntry struct {
 	ReferenceSchema string // String version of RenderedInline
 	RenderedJSON    []byte
 	CompiledSchema  *jsonschema.Schema
+	RenderedNode    *yaml.Node
 }
 
 // SchemaCache defines the interface for schema caching implementations.
-// The key is a [32]byte hash of the schema (from schema.GoLow().Hash()).
+// The key is a uint64 hash of the schema (from schema.GoLow().Hash()).
 type SchemaCache interface {
-	Load(key [32]byte) (*SchemaCacheEntry, bool)
-	Store(key [32]byte, value *SchemaCacheEntry)
-	Range(f func(key [32]byte, value *SchemaCacheEntry) bool)
+	Load(key uint64) (*SchemaCacheEntry, bool)
+	Store(key uint64, value *SchemaCacheEntry)
+	Range(f func(key uint64, value *SchemaCacheEntry) bool)
 }

cache/cache_test.go

@@ -29,9 +29,8 @@ func TestDefaultCache_StoreAndLoad(t *testing.T) {
 		CompiledSchema: &jsonschema.Schema{},
 	}
 
-	// Create a test key (32-byte hash)
-	var key [32]byte
-	copy(key[:], []byte("test-schema-hash-12345678901234"))
+	// Create a test key (uint64 hash)
+	key := uint64(0x123456789abcdef0)
 
 	// Store the schema
 	cache.Store(key, testSchema)
@@ -49,8 +48,7 @@ func TestDefaultCache_LoadMissing(t *testing.T) {
 	cache := NewDefaultCache()
 
 	// Try to load a key that doesn't exist
-	var key [32]byte
-	copy(key[:], []byte("nonexistent-key-12345678901234"))
+	key := uint64(0xdeadbeef)
 
 	loaded, ok := cache.Load(key)
 	assert.False(t, ok, "Should not find non-existent key")
@@ -60,7 +58,7 @@ func TestDefaultCache_LoadMissing(t *testing.T) {
 func TestDefaultCache_LoadNilCache(t *testing.T) {
 	var cache *DefaultCache
 
-	var key [32]byte
+	key := uint64(0)
 	loaded, ok := cache.Load(key)
 
 	assert.False(t, ok)
@@ -71,7 +69,7 @@ func TestDefaultCache_StoreNilCache(t *testing.T) {
 	var cache *DefaultCache
 
 	// Should not panic
-	var key [32]byte
+	key := uint64(0)
 	cache.Store(key, &SchemaCacheEntry{})
 
 	// Verify nothing was stored (cache is nil)
@@ -82,10 +80,9 @@ func TestDefaultCache_Range(t *testing.T) {
 	cache := NewDefaultCache()
 
 	// Store multiple entries
-	entries := make(map[[32]byte]*SchemaCacheEntry)
+	entries := make(map[uint64]*SchemaCacheEntry)
 	for i := 0; i < 5; i++ {
-		var key [32]byte
-		copy(key[:], []byte{byte(i)})
+		key := uint64(i)
 
 		entry := &SchemaCacheEntry{
 			RenderedInline: []byte{byte(i)},
@@ -97,8 +94,8 @@ func TestDefaultCache_Range(t *testing.T) {
 
 	// Range over all entries
 	count := 0
-	foundKeys := make(map[[32]byte]bool)
-	cache.Range(func(key [32]byte, value *SchemaCacheEntry) bool {
+	foundKeys := make(map[uint64]bool)
+	cache.Range(func(key uint64, value *SchemaCacheEntry) bool {
 		count++
 		foundKeys[key] = true
 
@@ -118,14 +115,13 @@ func TestDefaultCache_RangeEarlyTermination(t *testing.T) {
 
 	// Store multiple entries
 	for i := 0; i < 10; i++ {
-		var key [32]byte
-		copy(key[:], []byte{byte(i)})
+		key := uint64(i)
 		cache.Store(key, &SchemaCacheEntry{})
 	}
 
 	// Range but stop after 3 iterations
 	count := 0
-	cache.Range(func(key [32]byte, value *SchemaCacheEntry) bool {
+	cache.Range(func(key uint64, value *SchemaCacheEntry) bool {
 		count++
 		return count < 3 // Stop after 3
 	})
@@ -138,7 +134,7 @@ func TestDefaultCache_RangeNilCache(t *testing.T) {
 
 	// Should not panic
 	called := false
-	cache.Range(func(key [32]byte, value *SchemaCacheEntry) bool {
+	cache.Range(func(key uint64, value *SchemaCacheEntry) bool {
 		called = true
 		return true
 	})
@@ -151,7 +147,7 @@ func TestDefaultCache_RangeEmpty(t *testing.T) {
 
 	// Range over empty cache
 	count := 0
-	cache.Range(func(key [32]byte, value *SchemaCacheEntry) bool {
+	cache.Range(func(key uint64, value *SchemaCacheEntry) bool {
 		count++
 		return true
 	})
@@ -162,8 +158,7 @@ func TestDefaultCache_RangeEmpty(t *testing.T) {
 func TestDefaultCache_Overwrite(t *testing.T) {
 	cache := NewDefaultCache()
 
-	var key [32]byte
-	copy(key[:], []byte("test-key"))
+	key := uint64(0x12345678)
 
 	// Store first value
 	first := &SchemaCacheEntry{
@@ -188,10 +183,9 @@ func TestDefaultCache_MultipleKeys(t *testing.T) {
 	cache := NewDefaultCache()
 
 	// Store with different keys
-	var key1, key2, key3 [32]byte
-	copy(key1[:], []byte("key1"))
-	copy(key2[:], []byte("key2"))
-	copy(key3[:], []byte("key3"))
+	key1 := uint64(1)
+	key2 := uint64(2)
+	key3 := uint64(3)
 
 	cache.Store(key1, &SchemaCacheEntry{RenderedInline: []byte("value1")})
 	cache.Store(key2, &SchemaCacheEntry{RenderedInline: []byte("value2")})
@@ -218,8 +212,7 @@ func TestDefaultCache_ThreadSafety(t *testing.T) {
 	done := make(chan bool, 10)
 	for i := 0; i < 10; i++ {
 		go func(val int) {
-			var key [32]byte
-			copy(key[:], []byte{byte(val)})
+			key := uint64(val)
 			cache.Store(key, &SchemaCacheEntry{
 				RenderedInline: []byte{byte(val)},
 			})
@@ -235,8 +228,7 @@ func TestDefaultCache_ThreadSafety(t *testing.T) {
 	// Concurrent reads
 	for i := 0; i < 10; i++ {
 		go func(val int) {
-			var key [32]byte
-			copy(key[:], []byte{byte(val)})
+			key := uint64(val)
 			loaded, ok := cache.Load(key)
 			assert.True(t, ok)
 			assert.NotNil(t, loaded)
@@ -251,7 +243,7 @@ func TestDefaultCache_ThreadSafety(t *testing.T) {
 
 	// Verify all entries exist
 	count := 0
-	cache.Range(func(key [32]byte, value *SchemaCacheEntry) bool {
+	cache.Range(func(key uint64, value *SchemaCacheEntry) bool {
 		count++
 		return true
 	})
@@ -284,20 +276,18 @@ func TestDefaultCache_RangeWithInvalidTypes(t *testing.T) {
 	cache.m.Store("invalid-key-type", &SchemaCacheEntry{})
 
 	// Store an entry with wrong value type
-	var validKey [32]byte
-	copy(validKey[:], []byte{1})
+	validKey := uint64(1)
 	cache.m.Store(validKey, "invalid-value-type")
 
 	// Store a valid entry
-	var validKey2 [32]byte
-	copy(validKey2[:], []byte{2})
+	validKey2 := uint64(2)
 	validEntry := &SchemaCacheEntry{RenderedInline: []byte("valid")}
 	cache.Store(validKey2, validEntry)
 
 	// Range should skip invalid entries and only process valid ones
 	count := 0
 	var seenEntry *SchemaCacheEntry
-	cache.Range(func(key [32]byte, value *SchemaCacheEntry) bool {
+	cache.Range(func(key uint64, value *SchemaCacheEntry) bool {
 		count++
 		seenEntry = value
 		return true

cache/default_cache.go

@@ -15,7 +15,7 @@ func NewDefaultCache() *DefaultCache {
 }
 
 // Load retrieves a schema from the cache.
-func (c *DefaultCache) Load(key [32]byte) (*SchemaCacheEntry, bool) {
+func (c *DefaultCache) Load(key uint64) (*SchemaCacheEntry, bool) {
 	if c == nil || c.m == nil {
 		return nil, false
 	}
@@ -28,20 +28,20 @@ func (c *DefaultCache) Load(key [32]byte) (*SchemaCacheEntry, bool) {
 }
 
 // Store saves a schema to the cache.
-func (c *DefaultCache) Store(key [32]byte, value *SchemaCacheEntry) {
+func (c *DefaultCache) Store(key uint64, value *SchemaCacheEntry) {
 	if c == nil || c.m == nil {
 		return
 	}
 	c.m.Store(key, value)
 }
 
 // Range calls f for each entry in the cache (for testing/inspection).
-func (c *DefaultCache) Range(f func(key [32]byte, value *SchemaCacheEntry) bool) {
+func (c *DefaultCache) Range(f func(key uint64, value *SchemaCacheEntry) bool) {
 	if c == nil || c.m == nil {
 		return
 	}
 	c.m.Range(func(k, v interface{}) bool {
-		key, ok := k.([32]byte)
+		key, ok := k.(uint64)
 		if !ok {
 			return true
 		}