/barrelfish-2018-10-04/include/hashtable/ |
H A D | hashtable.h | 45 int capacity; member in struct:hashtable 50 * \brief create an empty hashtable with a given capacity and load factor 51 * \param capacity the capacity 55 struct hashtable* create_hashtable2(int capacity, int loadFactor); 58 * \brief create an empty hashtable with default capacity and load factor
|
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/ilog/ |
H A D | sched_cstrs.cc | 100 IlcInt capacity = EC_long(EC_argument(C, 3)); local 104 return activity.consumes(resource, capacity); 109 return activity.consumes(resource, capacity); 116 IlcInt capacity = EC_long(EC_argument(C, 3)); local 120 return activity.requires(resource, capacity); 125 return activity.requires(resource, capacity); 169 IlcInt capacity = EC_long(EC_argument(C, 4)); local 170 discrete_resource_of_handle(EC_argument(C, 1)).setCapacityMax(min, max, capacity);
|
H A D | scheduler.cc | 108 IlcInt capacity = EC_long(EC_arg(2)); local 112 if (capacity == 1) // More efficient: 2 times faster on bridge problem 115 resource = IlcDiscreteResource(schedule, capacity);
|
/barrelfish-2018-10-04/usr/eclipseclp/Visualisation/src/com/parctechnologies/eclipse/visualisation/viewers/ |
H A D | GraphViewerFactory.java | 46 private boolean capacity; field in class:GraphViewerFactory 51 boolean zeroOne, boolean capacity, 57 this.capacity = capacity; 95 typeCollection.add(new GrappaTextViewletType(changeable,zeroOne,capacity)); 49 GraphViewerFactory(VisClientStateModel stateModel, int type, boolean zeroOne, boolean capacity, Class elementTypeClass) argument
|
/barrelfish-2018-10-04/lib/vfs/ |
H A D | vfs_cache.c | 88 size_t map_size, max_capacity, capacity; member in struct:fs_cache 134 else if (cache->unused_count > cache->capacity / factor) { 135 unused_overburden = cache->unused_count - cache->capacity/factor; 189 if (cache->capacity == 0) { 195 cache->capacity = MIN_ALLOC; 197 for (size_t i = 1; i < cache->capacity; ++i) { 204 size_t new_capacity = 2*cache->capacity; 206 // realloc with new capacity 216 memset(cache->entries + cache->capacity, 0, 217 cache->capacity*sizeo [all...] |
/barrelfish-2018-10-04/lib/hashtable/ |
H A D | hashtable.c | 91 // TODO: XXX check for size and increase capacity, if necessary 215 * \brief create an empty hashtable with a given capacity and load factor 216 * \param capacity the capacity 220 static void ht_init(struct hashtable *_ht, int capacity, int load_factor) argument 222 _ht->capacity = capacity; 224 _ht->table_length = capacity; 228 _ht->threshold = (capacity * load_factor) / 100; 238 struct hashtable* create_hashtable2(int capacity, in argument [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/CPViz/viz/src/ie/ucc/cccc/viz/ |
H A D | VisualizerBinPacking.java | 86 int capacity=0;
88 capacity += bins[i].getMax();
95 if (required > capacity) {
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/ |
H A D | fdintro.tex | 338 \item whose capacity constraints are: 341 \item red has capacity 3 342 \item blue has capacity 1 343 \item green has capacity 4 364 \item and certain bin types have capacity constraint for certain 394 To represent a bin, with its colour, capacity and contents we use 397 :- local struct(bin(colour,capacity,contents:contents)) 483 constrain_bin(bin\{colour:Col,capacity:Cap,contents:C\}) :- 492 The colour capacity constraint relates the colour of the bin to its 493 capacity [all...] |
H A D | constimpl.tex | 387 and their capacity: 389 capacity(1, N) :- N>=0.0, N=<350.0. 390 capacity(2, N) :- N>=0.0, N=<180.0. 391 capacity(3, N) :- N>=0.0, N=<50.0. 395 {\tt capacity(3, C)} will raise an error, and 396 {\tt capacity(Type, 30.5)} will generate several solutions nondeterministically. 397 Only calls like {\tt capacity(3, 27.1)} will act correctly as a test. 407 delay capacity(T,N) if var(T);var(N). 408 capacity(1, N) :- N>=0.0, N=<350.0. 409 capacity( [all...] |
H A D | icintro.tex | 828 \item The capacity constraints imposed on the bins are: 831 \item red has capacity 3 832 \item blue has capacity 1 833 \item green has capacity 4 855 \item The following bin types have the following capacity constraints for certain 897 capacity and contents: 899 :- local struct(bin(colour, capacity, contents:contents)). 984 constrain_bin(bin\{colour:Col, capacity:Cap, contents:C\}) :- 992 The colour capacity constraint relates the colour of the bin to its 993 capacity, w [all...] |
H A D | repairtut.tex | 540 a given capacity and a set of items with given weights and profit 542 such that their weights do not exceed the container's capacity and 546 inequality constraint to ensure the capacity restriction, and an 564 \item {\tt Capacity} - the capacity of the knapsack (integer) 610 remove random items (changing 1 to 0) if the knapsack's capacity is 612 capacity left. We do a fixed number (MaxIter) of such steps and keep 625 up as explained above. The violation of the capacity constraint
|
H A D | setsolver.tex | 352 By adding a capacity limit and a search primitive, we can solve a
|
/barrelfish-2018-10-04/usr/monitor/include/ |
H A D | capsend.h | 31 size_t capacity; member in struct:capsend_destset
|
/barrelfish-2018-10-04/include/virtio/devices/ |
H A D | virtio_block.h | 108 uint64_t capacity; ///< the capacity in 512 byte sectors member in struct:virtio_block_config 217 * \brief returns the capacity of the VirtIO block device in 512 segments 221 * \returns capacity in 512-byte sectors
|
/barrelfish-2018-10-04/lib/cxx/cxx/ |
H A D | string.cpp | 404 s.resize(s.capacity()); 419 s.resize(s.capacity()); 431 s.resize(s.capacity());
|
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/ |
H A D | vbs_data.pl | 24 % arc( node1, node2, id, capacity ).
|
H A D | edge_finder.c | 77 long capacity; member in struct:__anon1771 175 ef->capacity = cap; 543 cap = ef->capacity; 618 * and executed with full capacity (fuly elastic relaxation).
|
/barrelfish-2018-10-04/doc/015-disk-driver-arch/ |
H A D | fat.tex | 74 the cache is at its maximum capacity, it can pop the front entry from the 80 setup and teardown. The initialization method takes the maximum capacity
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/ |
H A D | extfd.tex | 1668 \item whose capacity constraints are: 1671 \item red has capacity 3 1672 \item blue has capacity 1 1673 \item green has capacity 4 1694 \item and certain bin types have capacity constraint for certain 1789 capacity(Col, Capacity), 1809 {\bf capacity(Color, Capacity)} should instantiate the capacity 1811 if the capacity is known to be greater than 1817 capacity(Colo [all...] |
H A D | obsman.tex | 1774 \item whose capacity constraints are: 1777 \item red has capacity 3 1778 \item blue has capacity 1 1779 \item green has capacity 4 1800 \item and certain bin types have capacity constraint for certain 1895 capacity(Col, Capacity), 1915 {\bf capacity(Color, Capacity)} should instantiate the capacity 1917 if the capacity is known to be greater than 1923 capacity(Colo [all...] |
/barrelfish-2018-10-04/lib/net_queue_manager/ |
H A D | net_soft_filters_srv_impl.c | 673 size_t capacity = rx_get_free_slots_fn_ptr(); local 678 rx_ring_size = MIN(RX_RING_MAXMEM / rx_bufsz, capacity); 679 ETHERSRV_DEBUG("rx_ring_size %zd %zd\n", rx_ring_size, capacity);
|
/barrelfish-2018-10-04/lib/dmalloc/ |
H A D | dmalloc.c | 1303 given initial capacity, or, if 0, the default granularity size. It 1306 lock to control access. The capacity of the space will grow 1312 DLMALLOC_EXPORT mspace create_mspace(size_t capacity, int locked); 1325 space is used for bookkeeping, so the capacity must be at least this 1331 DLMALLOC_EXPORT mspace create_mspace_with_base(void* base, size_t capacity, int locked); 5482 mspace create_mspace(size_t capacity, int locked) { argument 5487 if (capacity < (size_t) -(msize + TOP_FOOT_SIZE + mparams.page_size)) { 5488 size_t rs = ((capacity == 0)? mparams.granularity : 5489 (capacity + TOP_FOOT_SIZE + msize)); 5501 mspace create_mspace_with_base(void* base, size_t capacity, in argument [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/documents/search/ |
H A D | search.tex | 1033 a given capacity and a set of items with given weights and profit 1035 such that their weights do not exceed the container's capacity and 1039 inequality constraint to ensure the capacity restriction, and an 1059 \item {\tt Capacity} - the capacity of the knapsack (integer) 1083 In the example, the single capacity constraint has been annotated with 1141 remove random items (changing 1 to 0) if the knapsack's capacity is 1143 capacity left. We do a fixed number (MaxIter) of such steps and keep 1156 up as explained above. The violation of the capacity constraint
|
/barrelfish-2018-10-04/usr/monitor/capops/ |
H A D | capsend.c | 175 dests->capacity = dest_count;
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/visualisation/ |
H A D | annotate.tex | 382 foo:(A1 + B1 + C1 + D1 $=< 500), % capacity constraints
|