def _split_overlap(a, n, OL):
	"""
	:param a: array to split and overlap.
	:param n: number of splits of a.
	:param OL: overlap.
	:return: c, a list of the splits of a in function of n and OL
	"""
	splits_size = int(round(a.size/n))
	nOL = int(round(splits_size * OL))
	skip = splits_size - nOL
	b = [a[i: i + splits_size] for i in range(0, len(a), skip)]
	c = []
	for i, item in enumerate(b):
		if len(item) == splits_size:
			c.append(item)
	return c