topology: []cadvisorapi.Node{
				{
					Id: 0,
					Distances: []uint64{
						10,
						11,
						12,
						12,
					},
				},
				{
					Id: 1,
					Distances: []uint64{
						11,
						10,
						12,
						12,
					},
				},
				{
					Id: 2,
					Distances: []uint64{
						12,
						12,
						10,
						11,
					},
				},

	var numaNodes []int
	distances := map[int][]uint64{}
	for _, node := range topology {
		numaNodes = append(numaNodes, node.Id)

		var nodeDistance []uint64
		if opts.PreferClosestNUMA {
			nodeDistance = node.Distances
			if nodeDistance == nil {
				return nil, fmt.Errorf("error getting NUMA distances from cadvisor")
			}
		}
		distances[node.Id] = nodeDistance
	}

	numaInfo := &NUMAInfo{

        int len1 = rhs.length + 1;

        // the array of distances
        int[] cost = new int[len0];
        int[] newcost = new int[len0];

        // initial cost of skipping prefix in byte[] s0
        for (int i = 0; i < len0; i++) {
            cost[i] = i
        }

        // dynamically computing the array of distances

        // transformation cost for each letter in s1

limitations under the License.
*/

package topologymanager

type singleNumaNodePolicy struct {
	// numaInfo represents list of NUMA Nodes available on the underlying machine and distances between them
	numaInfo *NUMAInfo
	opts     PolicyOptions
}

var _ Policy = &singleNumaNodePolicy{}

// PolicySingleNumaNode policy name.
const PolicySingleNumaNode string = "single-numa-node"

limitations under the License.
*/

package topologymanager

type bestEffortPolicy struct {
	// numaInfo represents list of NUMA Nodes available on the underlying machine and distances between them
	numaInfo *NUMAInfo
	opts     PolicyOptions
}

var _ Policy = &bestEffortPolicy{}

// PolicyBestEffort policy name.
const PolicyBestEffort string = "best-effort"

				"unknown-option": "true",
			},
		},
		{
			description:    "can't get NUMA distances",
			policyName:     "best-effort",
			expectedPolicy: "best-effort",
			policyOptions: map[string]string{
				PreferClosestNUMANodes: "true",
			},
			expectedError: fmt.Errorf("error getting NUMA distances from cadvisor"),
			topology: []cadvisorapi.Node{
				{
					Id: 0,
				},
			},
		},
		{

		for posdegree.size() > 0 {
			cid := posdegree.pop()
			if !scheduled[cid] {
				bid = cid
				continue blockloop
			}
		}
		// Pick any exit block.
		// TODO: Order these to minimize jump distances?
		for {
			cid := exit.pop()
			if !scheduled[cid] {
				bid = cid
				continue blockloop
			}
		}
	}
	f.laidout = true
	return order
	//f.Blocks = order

	}

	dd.wrPos = dstPos
	return dstPos - dstBase
}

// tryWriteCopy tries to copy a string at a given (distance, length) to the
// output. This specialized version is optimized for short distances.
//
// This method is designed to be inlined for performance reasons.
//
// This invariant must be kept: 0 < dist <= histSize()

semicircular Ends into Circles, when either of the observed Colours fell within those Circles, I measured the distance of that Colour from the semicircular End of the Spectrum, and subducting half this distance from the measured distance of the two Colours, I took the Remainder for their corrected distance; and in these Observations set down this corrected distance for the difference of the distances of their Foci from the Lens. For, as the Length of the Rectilinear Sides of the Spectrum would be the whole...

Circles, when either of the observed Colours fell within those Circles,
I measured the distance of that Colour from the semicircular End of the
Spectrum, and subducting half this distance from the measured distance
of the two Colours, I took the Remainder for their corrected distance;
and in these Observations set down this corrected distance for the
difference of the distances of their Foci from the Lens. For, as the