wehub-resource-sync
49 lines
1.9 KiB
Swift
49 lines
1.9 KiB
Swift
import CodexBarCore
|
|
import Testing
|
|
@testable import CodexBar
|
|
|
|
struct ProviderRegistryTests {
|
|
@Test
|
|
func `descriptor registry is complete and deterministic`() {
|
|
let descriptors = ProviderDescriptorRegistry.all
|
|
let ids = descriptors.map(\.id)
|
|
|
|
#expect(!descriptors.isEmpty, "ProviderDescriptorRegistry must not be empty.")
|
|
#expect(Set(ids).count == ids.count, "ProviderDescriptorRegistry contains duplicate IDs.")
|
|
|
|
let missing = Set(UsageProvider.allCases).subtracting(ids)
|
|
#expect(missing.isEmpty, "Missing descriptors for providers: \(missing).")
|
|
|
|
let secondPass = ProviderDescriptorRegistry.all.map(\.id)
|
|
#expect(ids == secondPass, "ProviderDescriptorRegistry order changed between reads.")
|
|
}
|
|
|
|
@Test
|
|
func `implementation registry is complete and deterministic`() {
|
|
let implementations = ProviderImplementationRegistry.all
|
|
let ids = implementations.map(\.id)
|
|
|
|
#expect(!implementations.isEmpty, "ProviderImplementationRegistry must not be empty.")
|
|
#expect(Set(ids).count == ids.count, "ProviderImplementationRegistry contains duplicate IDs.")
|
|
|
|
let missing = Set(UsageProvider.allCases).subtracting(ids)
|
|
#expect(missing.isEmpty, "Missing implementations for providers: \(missing).")
|
|
|
|
let secondPass = ProviderImplementationRegistry.all.map(\.id)
|
|
#expect(ids == secondPass, "ProviderImplementationRegistry order changed between reads.")
|
|
}
|
|
|
|
@Test
|
|
func `minimax sorts after zai in registry`() {
|
|
let ids = ProviderDescriptorRegistry.all.map(\.id)
|
|
guard let zaiIndex = ids.firstIndex(of: .zai),
|
|
let minimaxIndex = ids.firstIndex(of: .minimax)
|
|
else {
|
|
Issue.record("Missing z.ai or MiniMax provider in registry order.")
|
|
return
|
|
}
|
|
|
|
#expect(zaiIndex < minimaxIndex)
|
|
}
|
|
}
|