```python
def swap_count(s):
    """
    Calculates the minimum number of swaps required to balance a bracket string.
    A swap can be between any two characters.
    """
    
    # This counter tracks the balance of brackets.
    # It increments for '[' and decrements for ']'.
    # A balanced prefix never has a negative balance.
    balance = 0
    
    # This counts the minimum number of swaps required.
    swaps = 0
    
    for char in s:
        if char == '[':
            balance += 1
        else:  # char == ']'
            balance -= 1
        
        # If the balance becomes negative, it means we have an excess of ']'
        # characters in the prefix processed so far. This is an imbalance.
        if balance < 0:
            # To fix this imbalance, we must swap the current ']' with a '['
            # from a later position in the string. This action costs one swap.
            swaps += 1
            
            # After this conceptual swap, the character at the current position
            # is now a '[', which resolves the imbalance for the prefix.
            # The balance, which just decreased by 1 (for the ']'), should have
            # increased by 1 (for the new '['). The net correction is +2.
            balance += 2
            
    return swaps
```