```python
import heapq

def heap_assending(nums):
    """
    Sorts a given list of elements in ascending order using the heap queue algorithm.

    Args:
        nums: A list of comparable elements.

    Returns:
        A new list containing the elements of nums in ascending order.
    """
    heap = []
    for element in nums:
        heapq.heappush(heap, element)
    
    sorted_list = []
    while heap:
        sorted_list.append(heapq.heappop(heap))
        
    return sorted_list

```