github.com/vescale/zgraph@v0.0.0-20230410094002-959c02d50f95/codec/edge_key_test.go (about)

     1  // Copyright 2022 zGraph Authors. All rights reserved.
     2  //
     3  // Licensed under the Apache License, Version 2.0 (the "License");
     4  // you may not use this file except in compliance with the License.
     5  // You may obtain a copy of the License at
     6  //
     7  //     http://www.apache.org/licenses/LICENSE-2.0
     8  //
     9  // Unless required by applicable law or agreed to in writing, software
    10  // distributed under the License is distributed on an "AS IS" BASIS,
    11  // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
    12  // See the License for the specific language governing permissions and
    13  // limitations under the License.
    14  
    15  package codec
    16  
    17  import (
    18  	"math"
    19  	"testing"
    20  
    21  	"github.com/stretchr/testify/require"
    22  )
    23  
    24  func TestEdgeKey(t *testing.T) {
    25  	cases := []struct {
    26  		graphID     int64
    27  		srcVertexID int64
    28  		dstVertexID int64
    29  	}{
    30  		{
    31  			graphID:     100,
    32  			srcVertexID: 200,
    33  			dstVertexID: 300,
    34  		},
    35  		{
    36  			graphID:     math.MaxInt64,
    37  			srcVertexID: math.MaxInt64,
    38  			dstVertexID: math.MaxInt64,
    39  		},
    40  	}
    41  	for _, c := range cases {
    42  		incomingEdgeKey := IncomingEdgeKey(c.graphID, c.srcVertexID, c.dstVertexID)
    43  		graphID, srcVertexID, dstVertexID, err := ParseIncomingEdgeKey(incomingEdgeKey)
    44  		require.NoError(t, err)
    45  		require.Equal(t, c.graphID, graphID)
    46  		require.Equal(t, c.srcVertexID, srcVertexID)
    47  		require.Equal(t, c.dstVertexID, dstVertexID)
    48  
    49  		outgoingEdgeKey := OutgoingEdgeKey(c.graphID, c.srcVertexID, c.dstVertexID)
    50  		graphID, srcVertexID, dstVertexID, err = ParseOutgoingEdgeKey(outgoingEdgeKey)
    51  		require.NoError(t, err)
    52  		require.Equal(t, c.graphID, graphID)
    53  		require.Equal(t, c.srcVertexID, srcVertexID)
    54  		require.Equal(t, c.dstVertexID, dstVertexID)
    55  
    56  		require.NotEqual(t, incomingEdgeKey, outgoingEdgeKey)
    57  	}
    58  }